Efficient support of delay and rate guarantees in an internet
- 28 August 1996
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 26 (4) , 106-116
- https://doi.org/10.1145/248157.248167
Abstract
In this paper, we investigate some issues related to the efficient provision of end-to-end delay guarantees in the context of the Guaranteed (G) Services framework [16]. First, we consider the impact of reshaping traffic within the network on the end-to-end delay, the end-to-end jitter, as well as per-hop buffer requirements. This leads us to examine a class of traffic disciplines that use reshaping at each hop, namely rate-controlled disciplines. In this case, it is known that it is advantageous to use the Earliest Deadline First (EDF) scheduling policy at the link scheduler [8]. For this service discipline, we determine the appropriate values of the parameters that have to be exported, as specified in [16]. Subsequently, with the help of an example, we illustrate how the G service traffic will typically underutilize the network, regardless of the scheduling policy used. We then define a Guaranteed Rate (GR) service, that is synergetic with the G service framework and makes use of this unutilized bandwidth to provide rate guarantees to flows. We outline some of the details of the GR service and explain how it can be supported in conjunction with the G service in an efficient manner.Keywords
This publication has 9 references indexed in Scilit:
- Optimal multiplexing on a single link: delay and buffer requirementsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient network QoS provisioning based on per node traffic shapingIEEE/ACM Transactions on Networking, 1996
- Service disciplines for guaranteed performance service in packet-switching networksProceedings of the IEEE, 1995
- Quality of service guarantees in virtual circuit switched networksIEEE Journal on Selected Areas in Communications, 1995
- Stability, queue length, and delay of deterministic and stochastic queueing networksIEEE Transactions on Automatic Control, 1994
- A generalized processor sharing approach to flow control in integrated services networks: the multiple node caseIEEE/ACM Transactions on Networking, 1994
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- A calculus for network delay. I. Network elements in isolationIEEE Transactions on Information Theory, 1991
- New directions in communications (or which way to the information age?)IEEE Communications Magazine, 1986