TD/sup 2/FQ: an integrated traffic scheduling and shaping scheme for DiffServ networks

The provision of quality of service (QoS) in terms of delay guarantee to real-time applications is a challenging issue in differentiated services (DiffServ) networks. There is a great demand to maintain individual flow's traffic pattern when scheduling aggregated traffic. In this paper, we propose an integrated traffic scheduling and shaping scheme for DiffServ networks. The proposed scheme is called TD/sup 2/FQ (token-driven delay-sensitive dynamic fair queueing). There are two highlights in TD/sup 2/FQ: a new scheduling mechanism-delay-sensitive dynamic fair queueing, and a new colored token approach. Besides the provision of guaranteed delay bound, TD/sup 2/FQ can handle the aggregated traffic shaping and maintain the inter-flow fairness within each traffic class. Theoretical analysis and simulation experiments are also presented. Comparison results demonstrate the advantage of our approach.

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

[2]  John Wroclawski,et al.  The Use of RSVP with IETF Integrated Services , 1997, RFC.

[3]  I. Yamasaki,et al.  Fair queuing with in/out bit in core stateless networks , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).

[4]  T.S. Eugene Ng,et al.  Supporting best-effort traffic with fair service curve , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

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

[6]  Lixia Zhang,et al.  Resource ReSerVation Protocol (RSVP) - Version 1 Functional Specification , 1997, RFC.

[7]  Albert G. Greenberg,et al.  Scalable Architectures for Integrated Traffic Shaping and Link Scheduling in High-Speed ATM Switches , 1997, IEEE J. Sel. Areas Commun..

[8]  Nsf Ncr,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case* , 1991 .

[9]  Ellen W. Zegura,et al.  Rainbow fair queueing: fair bandwidth sharing without per-flow state , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[10]  Parijat Dube,et al.  Measurement based optimal source shaping with a shaping + multiplexing delay constraint , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  Vijay Sivaraman,et al.  Traffic shaping for end-to-end delay guarantees with EDF scheduling , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).

[12]  Hui Zhang,et al.  WF/sup 2/Q: worst-case fair weighted fair queueing , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[13]  Ion Stoica,et al.  A hierarchical fair service curve algorithm for link-sharing, real-time and priority services , 1997, SIGCOMM '97.

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

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

[16]  Roch Guérin,et al.  Efficient network QoS provisioning based on per node traffic shaping , 1996, TNET.

[17]  Anujan Varma,et al.  A general methodology for designing efficient traffic scheduling and shaping algorithms , 1997, Proceedings of INFOCOM '97.

[18]  Scott Shenker,et al.  Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .

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

[20]  H. Jonathan Chao,et al.  Design of an ATM shaping multiplexer with guaranteed output burstiness , 1997 .

[21]  Ion Stoica,et al.  A hierarchical fair service curve algorithm for link-sharing, real-time, and priority services , 2000, TNET.

[22]  Andrea Francini,et al.  Minimum-latency dual-leaky-bucket shapers for packet multiplexers: theory and implementation , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).