ABE: providing a low-delay service within best effort

We propose alternative best effort (ABE), a novel service for IP networks, which idea of providing low-delay at the expense of maybe less throughput. The objective is to retain the simplicity of the original Internet single-class best-effort service while providing low-delay to interactive adaptive applications. With ABE, every best effort packet is marked as either green or blue. Green packets are guaranteed a low bounded delay in every router. In exchange, green packets are more likely to be dropped (or marked using congestion notification) during periods of congestion than blue packets. For every packet, the choice of color is made by the application based on the nature of its traffic and on global traffic conditions. Typically, an interactive application with real-time deadlines, such as audio, will mark most at its packets as green, as long as the network conditions offer large enough throughput. In contrast, an application that transfers binary data such as bulk data transfer will seek to minimize overall transfer time and send blue traffic. We propose router requirements that aim at enforcing benefits for all types of traffic, namely that green traffic achieves low-delay and blue traffic receives at least as much throughput as it would in a flat (legacy) best effort network. ABE is different from differentiated or integrated services in that neither packet color can be said to receive better treatment; thus, flat rate pricing may be maintained, and there is no need for reservations or profiles. We define the ABE service, its requirements, properties, and usage. We discuss the implications of replacing the existing IP best effort service by the ABE service. We propose and analyze an implementation based on a new scheduling method called duplicate scheduling with deadlines. It supports any mixture of TCP, TCP-friendly, and non-TCP-friendly traffic.

[1]  Fred Baker,et al.  Assured Forwarding PHB Group , 1999, RFC.

[2]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[3]  Steven McCanne,et al.  On improving the fairness of TCP congestion avoidance , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[4]  Jean Bolot,et al.  Adaptive FEC-Based Error Control for Interactive Audio in the Internet , 1998 .

[5]  Christophe Diot,et al.  1-Bit Schemes for Service Discrimination in the Internet: Analysis and Evaluation , 1997 .

[6]  Donald F. Towsley,et al.  Modeling TCP Reno performance: a simple model and its empirical validation , 2000, TNET.

[7]  T. V. Lakshman,et al.  Design considerations for supporting TCP with per-flow queueing , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[8]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[9]  Christian Huitema,et al.  An Architecture for Residential Internet Telephony Service , 1999, IEEE Internet Comput..

[10]  Sally Floyd,et al.  TCP and explicit congestion notification , 1994, CCRV.

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

[12]  Van Jacobson,et al.  An Expedited Forwarding PHB , 1999, RFC.

[13]  J.-Y. Le Boudec,et al.  A proposal for an asymmetric best-effort service , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[14]  Christian Huitema,et al.  Multimedia Applications Should Be Adaptive , 1995, Third IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems.

[15]  Jean-Yves Le Boudec,et al.  The Alternative Best Effort Service , 1999 .

[16]  Serge Fdida,et al.  A proportional Queue Control Mechanism to Provide Differentiated Services , 1998 .

[17]  Jean-Yves Le Boudec,et al.  Adaptive Delay aware error control for Internet Telephony , 2000 .

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

[19]  Donald F. Towsley,et al.  Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.

[20]  Jean-Yves Le Boudec,et al.  A Novel Scheduler For a Low Delay Service Within Best-Effort , 2001, IWQoS.

[21]  Jean-Yves Le Boudec,et al.  Global fairness of additive-increase and multiplicative-decrease with heterogeneous round-trip times , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[22]  Jean-Yves Le Boudec,et al.  SRP: a scalable resource reservation protocol for the Internet , 1998, Comput. Commun..

[23]  Hui Zhang,et al.  Service disciplines for guaranteed performance service in packet-switching networks , 1995, Proc. IEEE.

[24]  Parameswaran Ramanathan,et al.  Proportional differentiated services: delay differentiation and packet scheduling , 1999, SIGCOMM '99.