Improved Competitive Guarantees for QoS Buffering

We consider a network providing Differentiated Services (Diffserv) which allow Internet service providers (ISP) to offer different levels of Quality of Service (QoS) to different traffic streams. We study FIFO buffering algorithms, where packets must be transmitted in the order they arrive. The buffer space is limited, and packets are lost if the buffer is full. Each packet has an intrinsic value, and the goal is to maximize the total value of transmitted packets. Our main contribution is an algorithm for arbitrary packet values that for the first time achieves a competitive ratio better than 2, namely 2-e for a constant e> 0.

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

[2]  Baruch Schieber,et al.  Further Improvements in Competitive Guarantees for QoS Buffering , 2004, ICALP.

[3]  Ion Stoica,et al.  Providing guaranteed services without per flow management , 1999, SIGCOMM '99.

[4]  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).

[5]  Yishay Mansour,et al.  Competitive queueing policies for QoS switches , 2003, SODA '03.

[6]  Parameswaran Ramanathan,et al.  Proportional differentiated services: delay differentiation and packet scheduling , 2002, TNET.

[7]  Boaz Patt-Shamir,et al.  Optimal smoothing schedules for real-time streams (extended abstract) , 2000, PODC.

[8]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

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

[10]  Jim Kurose,et al.  A quantitative study of differentiated services for the Internet , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

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

[12]  Boaz Patt-Shamir,et al.  Optimal smoothing schedules for real-time streams , 2004, PODC '00.

[13]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[14]  Vaduvur Bharghavan,et al.  Relative Delay Differentiation and Delay Class Adaptation in Core-Stateless Networks. , 2000, INFOCOM 2000.

[15]  Van Jacobson,et al.  A Two-bit Differentiated Services Architecture for the Internet , 1999, RFC.

[16]  Andrew T. Campbell,et al.  Peering and provisioning of differentiated Internet services , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

[18]  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).

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

[20]  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).