Coordinated network scheduling: a framework for end-to-end services

In multi-hop networks, packet schedulers at downstream nodes have an opportunity to make up for excessive latencies due to congestion at upstream nodes. Similarly when packets incur low delays at upstream nodes, downs stream nodes can reduce priority and schedule other packets first. The goal of this paper is to define a framework for design and analysis of coordinated network scheduling (CNS) which exploit such inter-node coordination. The first provide a general CNS definition which enables us to classify a number of schedulers from the literature including, FIFO+, CEDF and work-conserving CJVC as examples of CNS schedulers. We then develop a distributed theory of traffic envelopes which enables us to derive end-to-end statistical admission control conditions for CNS schedulers. We show that CNS schedulers are able to limit traffic distortion to within a narrow range resulting in improved end-to-end performance and more efficient resource utilization.

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

[2]  Ness B. Shroff,et al.  Admission control for statistical QoS: theory and practice , 1999, IEEE Netw..

[3]  Cheng-Shang Chang,et al.  Stability, queue length, and delay of deterministic and stochastic queueing networks , 1994, IEEE Trans. Autom. Control..

[4]  Harrick M. Vin,et al.  Determining end-to-end delay bounds in heterogeneous networks , 1997, Multimedia Systems.

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

[6]  Donald F. Towsley,et al.  Statistical Analysis of Generalized Processor Sharing Scheduling Discipline , 1994, SIGCOMM.

[7]  Harrick M. Vin,et al.  Statistical delay guarantee of virtual clock , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[8]  Ness B. Shroff,et al.  A central-limit-theorem-based approach for analyzing queue behavior in high-speed networks , 1998, TNET.

[9]  Hui Zhang,et al.  Implementing distributed packet fair queueing in a scalable switch architecture , 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.

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

[11]  James F. Kurose,et al.  On computing per-session performance bounds in high-speed multi-hop computer networks , 1992, SIGMETRICS '92/PERFORMANCE '92.

[12]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[13]  Donald F. Towsley,et al.  Statistical Analysis of Generalized Processor Sharing Scheduling Discipline , 1995, IEEE J. Sel. Areas Commun..

[14]  Chaiwat Oottamakorn,et al.  Effective envelopes: statistical bounds on multiplexed traffic in packet networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[15]  Edward W. Knightly,et al.  Providing end-to-end statistical performance guarantees with bounding interval dependent stochastic models , 1994, SIGMETRICS.

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

[17]  QueueingJon,et al.  WF 2 Q : Worst-case Fair Weighted Fair , 1996 .

[18]  George Varghese,et al.  Efficient fair queueing using deficit round robin , 1995, SIGCOMM '95.

[19]  Edward W. Knightly,et al.  Inter-class resource sharing using statistical service envelopes , 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).

[20]  Edward W. Knightly.  Enforceable quality of service guarantees for bursty traffic streams , 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.

[21]  Moshe Sidi,et al.  Performance and stability of communication networks via robust exponential bounds , 1993, TNET.

[22]  Matthew Andrews,et al.  Probabilistic end-to-end delay bounds for earliest deadline first scheduling , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[23]  Gustavo de Veciana,et al.  Bandwidth allocation for multiple qualities of service using generalized processor sharing , 1996, IEEE Trans. Inf. Theory.

[24]  David Clark,et al.  Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism , 1992, SIGCOMM.

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

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

[27]  Debasis Mitra,et al.  Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes , 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).

[28]  Roch Guérin,et al.  The effect of traffic shaping in efficiently providing end-to-end performance guarantees , 1996, Telecommun. Syst..

[29]  Jean C. Walrand,et al.  Dynamic priority protocols for packet voice , 1989, IEEE J. Sel. Areas Commun..

[30]  S. J. Golestani.  A stop-and-go queueing framework for congestion management , 1990, SIGCOMM 1990.

[31]  ZhangLixia,et al.  Supporting real-time applications in an Integrated Services Packet Network , 1992 .

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

[33]  Edward W. Knightly,et al.  Providing end-to-end statistical performance guarantees with bounding interval dependent stochastic models , 1994, SIGMETRICS.

[34]  Keith W. Ross,et al.  Guaranteeing statistical QoS to regulated traffic: the multiple node case , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[35]  Lisa Zhang,et al.  Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule , 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).

[36]  Hui Zhang.  Providing end-to-end performance guarantees using non-work-conserving disciplines , 1995, Comput. Commun..

[37]  Nick McKeown,et al.  A practical scheduling algorithm to achieve 100% throughput in input-queued switches , 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.

[38]  Vijay Sivaraman,et al.  Providing end-to-end statistical delay guarantees with earliest deadline first scheduling and per-hop traffic shaping , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).