Proportional differentiated services: delay differentiation and packet scheduling

The proportional differentiation model provides the network operator with the 'tuning knobs' for adjusting the per-hop quality-of-service (QoS) ratios between classes, independent of the class loads. This paper applies the proportional model in the differentiation of queueing delays, and investigates appropriate packet scheduling mechanisms. Starting from the proportional delay differentiation (PDD) model, we derive the average queueing delay in each class, show the dynamics of the class delays under the PDD constraints, and state the conditions in which the PDD model is feasible. The feasibility model of the model can be determined from the average delays that result with the strict priorities scheduler. We then focus on scheduling mechanisms that can implement the PDD model, when it is feasible to do so. The proportional average delay (PAD) scheduler meets the PDD constraints, when they are feasible, but it exhibits a pathological behavior in short timescales. The waiting time priority (WTP) scheduler, on the other hand, approximates the PDD model closely, even in the short timescales of a few packet departures, but only in heavy load conditions. PAD and WTP serve as motivation for the third scheduler, called hybrid proportional delay (HPD). HPD approximates the PDD model closely, when the model is feasible, independent of the class load distribution. Also, HPD provides predictable delay differentiation even in short timescales.

[1]  Vaduvur Bharghavan,et al.  Delay differentiation and adaptation in core stateless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[2]  Constantinos Dovrolis,et al.  Relative differentiated services in the Internet: issues and mechanisms , 1999, SIGMETRICS '99.

[3]  Jean-Yves Le Boudec,et al.  Delay Bounds in a Network with Aggregate Scheduling , 2000, QofIS.

[4]  Scott Shenker,et al.  Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks , 2003, TNET.

[5]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

[6]  Jean-Yves Le Boudec,et al.  Asymmetric Best Effort Service for Packet Networks , 1998 .

[7]  ZhangHui,et al.  Core-stateless fair queueing , 1998 .

[8]  P. P. White,et al.  RSVP and integrated services in the Internet: a tutorial , 1997, IEEE Commun. Mag..

[9]  S. Bodamer,et al.  A scheduling algorithm for relative delay differentiation , 2000, ATM 2000. Proceedings of the IEEE Conference on High Performance Switching and Routing (Cat. No.00TH8485).

[10]  RamanathanParameswaran,et al.  Proportional differentiated services , 1999 .

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

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

[13]  Scott Shenker,et al.  Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks , 1998, SIGCOMM '98.

[14]  Roch Guérin,et al.  Scalable QoS provision through buffer management , 1998, SIGCOMM '98.

[15]  Parameswaran Ramanathan,et al.  Class provisioning using proportional delay differentiation , 2001, SPIE ITCom.

[16]  Andrew Odlyzko,et al.  Paris Metro pricing: the minimalist differentiated services solution , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[17]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[18]  Isi Mitrani,et al.  Complete parameterized families of job scheduling strategies , 2004, Acta Informatica.

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

[20]  David K. Y. Yau,et al.  Characterization and performance evaluation for proportional delay differentiated services , 2000, Proceedings 2000 International Conference on Network Protocols.

[21]  Parameswaran Ramanathan,et al.  Dynamic class selection: From relative differentiation to absolute QoS , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[22]  Donald F. Towsley,et al.  On achievable service differentiation with token bucket marking for TCP , 2000, SIGMETRICS '00.

[23]  Hui Zhang,et al.  LIRA: An Approach for Service Differentiation in the Internet , 1998 .

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

[25]  Nicolas Christin,et al.  JoBS: Joint Buffer Management and Scheduling for Differentiated Services , 2001, IWQoS.

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

[27]  Parameswaran Ramanathan,et al.  A case for relative differentiated services and the proportional differentiation model , 1999, IEEE Netw..

[28]  David D. Clark,et al.  Explicit allocation of best-effort packet delivery service , 1998, TNET.

[29]  David L. Black,et al.  Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers , 1998, RFC.

[30]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1997, TNET.

[31]  Leonard Kleinrock,et al.  A delay dependent queue discipline , 1964 .

[32]  Gunter Bolch,et al.  Queueing Networks and Markov Chains - Modeling and Performance Evaluation with Computer Science Applications, Second Edition , 1998 .

[33]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[34]  Meng Chang Chen,et al.  Proportional delay differentiation service based on weighted fair queuing , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).

[35]  Jean Michel Régnier.  Priority assignment in integrated services networks , 1986 .

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

[37]  Edward G. Coffman,et al.  A Characterization of Waiting Time Performance Realizable by Single-Server Queues , 1980, Oper. Res..

[38]  C. Dovrolis,et al.  Proportional differentiated services, part II: loss rate differentiation and packet dropping , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).

[39]  Edward W. Knightly,et al.  Egress admission control , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[40]  Hiroshi Saito,et al.  Local optimal proportional differentiation scheduler for relative differentiated services , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).