Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network
Reexamination Certificate
2006-01-10
2006-01-10
Vu, Huy D. (Department: 2665)
Multiplex communications
Data flow congestion prevention or control
Control of data admission to the network
Reexamination Certificate
active
06985442
ABSTRACT:
In a network of interconnected edge and core routers, where packet data flows are received at edge routers and then transmitted toward intended destinations via a path through one or more core routers, fair bandwidth sharing is achieved without per-flow state monitoring in the interior routers. Each edge router is arranged to divide each input data flow into a set of layers each having an associated level, based on rate. The division process is done without reference to the content of the flow, and can use layers of equal or unequal size. The packets in a flow are marked at an edge router with their layer level, in a globally consistent manner. Each core router maintains a layer level threshold, based upon buffer management conditions, and drops layers whose level exceeds the threshold. During congestion, the level threshold is decreased; when congestion clears, the level threshold is increased.
REFERENCES:
patent: 6167030 (2000-12-01), Kilkki et al.
patent: 6222841 (2001-04-01), Taniguchi
patent: 6643258 (2003-11-01), Ise et al.
patent: 6646988 (2003-11-01), Nandy et al.
Demers, A. et al., “Analysis and Simulation of a Fair Queueing Algorithm”, SIGCOMM Symposium on Communications Architectures and Protocols, Sep. 1989.
Shreedhar, M. et al., “Efficient Fair Queuing Using Deficit Round Robin”, Proceedings of SIGCOMM'95, Sep. 1995.
Bennett, J. C. R. et al., “Hierarchical Packet Fair Queueing Algorithms”, Proceedings of SIGCOMM'96, Aug. 1996.
S. Golestani, “A Self-clocked Fair Queueing Scheme for Broadband Applications”, Proceedings of IEEE INFOCOM'94, Jun. 1994.
Floyd, S. et al., “Random Early Detection Gateways for Congestion Avoidance”, IEEE/ACM Transactions on Networking, Aug. 1993.
Lin, D. et al, “Dynamics of Random Early Detection”, Proceedings of SIGCOMM'97, Oct. 1997.
Stoica et al., “Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks”, Proceedings of SIGCOMM '98, Sep. 1998.
Wu, L. et al, “Thin Streams: An Architecture for Multicasting Layered Video”, NOSSDAV'97, May 1997.
Vicisano, L et al., “One to Many Reliable Bulk-Data Transfer in the Mbone”, Proceedings of the Third International Workshop on High Performance Protocol Architectures HIPPARCH'97, Jun. 1997.
Donahoo, M. et al., “Multiple-Channel Multicast Scheduling for Scalable Bulk-Data Transport”, Infocom'99, Mar. 1999.
Stoica, I., “NS-2 Simulation for CSFQ”, http://www.cs.cmu.edu/˜istoica/csfq 1998.
Blake, S. et al, “An Architecture for Differentiated Services”, Internet Society Network Working Group Request For Comments #2475, Dec. 1998.
Jacobson, V., “Congestion Avoidance and Control”, ACM SIGCOMM 88, 1988.
U.S. Appl. No. 10/136,840, filed Apr. 30, 2002, A. E. Eckberg.
Cao Zhiruo
Wang Zheng
Freedman Barry H.
Lucent Technologies - Inc.
Milton James
Ryman Daniel
Vu Huy D.
LandOfFree
Technique for bandwidth sharing in internet and other router... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Technique for bandwidth sharing in internet and other router..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Technique for bandwidth sharing in internet and other router... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3585104