Buffer overflows of merging streams

Consider an Internet service provider (ISP), or a corporate intranet, that connects a large number of users with the Internet backbone using an "uplink." Within such a system, consider the traffic oriented towards the uplink, namely the streams whose start points are the local users and whose destination is outside the local domain. These streams are merged by a network that consists of merge nodes, typically arranged in a tree topology whose root is directly connected to the uplink. Without loss of generality, we may assume that the bandwidth of the link emanating from a merge node is less than the sum of bandwidths of incoming links (otherwise, we can assume that the incoming links are connected directly to the next node up). Hence, when all users inject data at maximum local speed, packets will eventually be discarded. A very effective way to mitigate some of the losses due to temporary overloads is to equip the merge nodes with buffers, that can absorb transient bursts by storing incoming packets while the outgoing link is busy. The merge nodes are controlled by local on-line buffer management algorithms whose job is to decide which packets to forward and which to drop so as to minimize the damage in case of an overflow.

[1]  David Clark,et al.  An Approach to Service Allocation in the Internet , 1997 .

[2]  Boaz Patt-Shamir,et al.  Nearly optimal FIFO buffer management for DiffServ , 2002, PODC '02.

[3]  Van Jacobson,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[4]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[5]  Allan Borodin,et al.  Adversarial queuing theory , 2001, JACM.

[6]  Boaz Patt-Shamir,et al.  Greedy Packet Scheduling on Shortest Paths , 1993, J. Algorithms.

[7]  Yishay Mansour,et al.  Harmonic buffer management policy for shared memory switches , 2004, Theor. Comput. Sci..

[8]  Yossi Azar,et al.  Management of Multi-Queue Switches in QoS Networks , 2003, STOC '03.

[9]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

[10]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[11]  Yishay Mansour,et al.  Competitve buffer management for shared-memory switches , 2001, SPAA '01.

[12]  Yishay Mansour,et al.  Loss-bounded analysis for differentiated services , 2001, ACM-SIAM Symposium on Discrete Algorithms.

[13]  Miguel A. Labrador,et al.  Packet dropping policies for ATM and IP networks , 1999, IEEE Communications Surveys & Tutorials.

[14]  Christophe Diot,et al.  Simple performance models of differentiated services schemes for the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[15]  Andras Veres,et al.  The chaotic nature of TCP congestion control , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[16]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[17]  Rafail Ostrovsky,et al.  Dynamic routing on networks with fixed-size buffers , 2003, SODA '03.

[18]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[19]  Srinivasan Keshav,et al.  An Engineering Approach to Computer Networking: ATM Networks , 1996 .

[20]  Boaz Patt-Shamir,et al.  Buffer Overflow Management in QoS Switches , 2004, SIAM J. Comput..

[21]  Yishay Mansour,et al.  Competitive queue policies for differentiated services , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).