Advertisement

Delay Bounds in a Network with Aggregate Scheduling

  • Anna Charny
  • Jean-Yves Le Boudec
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1922)

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.

Keywords

delay jitter aggregate scheduling FIFO priority queuing Guaranteed Service, Diffserv 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    V. Jacobson, K. Nichols, K. Poduri. An Expedited Forwarding PHB, RFC 2598, June 1999. 1,2Google Scholar
  2. 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, 5Google Scholar
  3. 3.
    F. Brichet, L. Massoulie, J. Roberts Stochastic Ordering and the Notion of Negligible CDV, ITC15, Washington, D. C. June 1997. 3Google Scholar
  4. 4.
    Schenker, S., Partridge, C., Guerin, R. Specification of Guaranteed Quality of Service, RFC 2212 September 1997 3Google Scholar
  5. 5.
    R. L. Cruz. Quality of service guarantees in virtual circuit switched networks. IEEE JSAC, pages 1048–1056, August 1995. 5, 6Google Scholar
  6. 6.
    J.-Y. Le Boudec. Application of network calculus to guaranteed service networks. IEEE Transactions on Information Theory, 441087–1096, May1998. 5, 6Google Scholar
  7. 7.
    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, 6Google Scholar
  8. 8.
    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, 6Google Scholar
  9. 9.
    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. 6Google Scholar
  10. 10.
    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, 6Google Scholar
  11. 11.
    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, 7Google Scholar
  12. 12.
    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, 7CrossRefGoogle Scholar
  13. 13.
    C. S. Chang. A filtering theory for Communication Networks. Springer Verlag, 1999. 6Google Scholar
  14. 14.
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Anna Charny
    • 1
  • Jean-Yves Le Boudec
    • 2
  1. 1. Cisco SystemsChelmsford
  2. 2.Jean-Yves Le Boudec EPFL-DSCINNLausanne-EPFLSwitzerland

Personalised recommendations