Abstract
A large number of products implementing aggregate buffering and scheduling mechanisms have been developed and deployed, and still more are under development. With the rapid increase in the demand for reliable end-to-end QoS solutions, it becomes increasingly important to understand the implications of aggregate scheduling on the resulting QoS capabilities. This paper studies the bounds on the worst case delay in a network implementing aggregate scheduling. We derive an upper bound on the queuing delay as a function of priority traffic utilization and the maximum hop count of any flow, and the shaping parameters at the network ingress. Our bound explodes at a certain utilization level which is a function of the hop count. We show that for a general network configuration and larger utilization utilization an upper bound on delay, if it exists, must be a function of the number of nodes and/or the number of flows in the network.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
V. Jacobson, K. Nichols, K. Poduri. An Expedited Forwarding PHB, RFC 2598, June 1999. 1,2
F. Baker, C. Iturralde, F. Le Faucheur, B. Davie. Aggregation of RSVP for IPv4 and IPv6 Reservations, draft-ietf-issll-rsvp-aggr-00.txt September 1999, work in progress. 2, 5
F. Brichet, L. Massoulie, J. Roberts Stochastic Ordering and the Notion of Negligible CDV, ITC15, Washington, D. C. June 1997. 3
Schenker, S., Partridge, C., Guerin, R. Specification of Guaranteed Quality of Service, RFC 2212 September 1997 3
R. L. Cruz. Quality of service guarantees in virtual circuit switched networks. IEEE JSAC, pages 1048–1056, August 1995. 5, 6
J.-Y. Le Boudec. Application of network calculus to guaranteed service networks. IEEE Transactions on Information Theory, 441087–1096, May1998. 5, 6
C. S. Chang. On deterministic traffic regulation and service guarantee A systematic approach by filtering. IEEE Transactions on Information Theory, 441096–1107, August 1998. 5, 6
R._Agrawal, R. L._Cruz, C. Okino, and R. Rajan. Performance bounds for flow control protocols. IEEE/ACM Transactions on Networking (7)3, pages 310–323, June 1999. 5, 6
Parekh A. K. and Gallager R. G., A generalized processor sharing approach toflow control in integrated services networks The multiple node case. IEEE/ACM Trans. Networking, vol 2-2, pages 137–150, April 1994. 6
M. Andrews, B. Awerbuch, A. Fernandez, J. Kleinberg, T. Leighton, and Z. Liu. Universal stability results for greedy contention resolution protocols. In 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS’96), Burlington VT, October 1996. 4, 6
J.Y. Le Boudec and G. Hebuterne. Comment on a deterministic approach to the end-to-end analysis of packet flows in connection oriented network. IEEE/ACM Transactions on Networking, February 2000. 4, 7
I. Chlamtac, A. Faragò, H. Zhang, and A. Fumagalli. A deterministic approach to the end-to-end analysis of packet flows in connection oriented networks. IEEE/ACM transactions on networking, (6)4422–431, 08 1998. 4, 7
C. S. Chang. A filtering theory for Communication Networks. Springer Verlag, 1999. 6
A. Charny. “Delay Bounds in a Network with Aggregate Scheduling”. Draft version. ftp://ftpeng.cisco.com/ftp/acharny/aggregate delay v4.ps, February 2000. 7
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Charny, A., Boudec, JY.L. (2000). Delay Bounds in a Network with Aggregate Scheduling. In: Crowcroft, J., Roberts, J., Smirnov, M.I. (eds) Quality of Future Internet Services. QofIS 2000. Lecture Notes in Computer Science, vol 1922. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39939-9_1
Download citation
DOI: https://doi.org/10.1007/3-540-39939-9_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41076-8
Online ISBN: 978-3-540-39939-1
eBook Packages: Springer Book Archive