Skip to main content

The Effect of Per-input Shapers on the Delay Bound in Networks with Aggregate Scheduling

  • Conference paper
Interactive Multimedia on Next Generation Networks (MIPS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2899))

Included in the following conference series:

Abstract

In order to provide modern multimedia applications with firm guarantees on quality of service (QoS) we have proposed a simplified guaranteed service. In this paper we introduce a router model with per-input shapers for the aggregate flows at the output ports. We calculate the delay bound for the guaranteed-service traffic. The existing QoS architecture for differentiated services does not give a computable delay bound, which is essential for interactive real-time communications. We show that at the expense of some modifications to the structure of the output port of the routers it is possible to compute a finite delay bound in the case of aggregate scheduling.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Braden, R., Clark, D., Shenker, S.: Integrated services in the Internet architecture: an overview. RFC1633, IETF (June 1994)

    Google Scholar 

  2. Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weis, W.: An architecture for differentiated services. RFC 2475, IETF (December 1998)

    Google Scholar 

  3. Jacobson, V., Nichols, K., Poduri, K.: An expedited forwarding PHB. RFC 2598, IETF (June 1999)

    Google Scholar 

  4. Le Boudec, J.-Y.: A proven delay bound for a network with aggregate scheduling. EPFLDCS Technical Report DSC2000/002, http://ica1www.epfl.ch/PS_files/ds2.pdf

  5. Charny, A., Le Boudec, J.-Y.: Delay bounds in a network with aggregate scheduling. In: Proc. of first International Workshop on Quality of Future Internet Services (Qo- FIS 2000) (October 2000)

    Google Scholar 

  6. Thiran, P., Le Boudec, J.-Y. (eds.): Network Calculus. LNCS, vol. 2050, p. 3. Springer, Heidelberg (2001)

    Book  MATH  Google Scholar 

  7. Andrews, M.: Instability of FIFO in session-oriented networks. In: Proc. of eleventh annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000) (January 2000)

    Google Scholar 

  8. Karlsson, G., Orava, F.: The DIY approach to QoS. In: Proc. of Seventh International Workshop on Quality of Service (IWQoS 1999), pp. 6–8 (1999)

    Google Scholar 

  9. Mowbray, M., Karlsson, G., Köhler, T.: Capacity reservation for multimedia traffics. Distributed Systems Engineering 5, 12–18 (1998)

    Article  Google Scholar 

  10. Ossipov, E., Karlsson, G.: A simplified guaranteed service for the Internet. In: Proc. of Seventh International Workshop on Protocols for High-Speed Networks (2002)

    Google Scholar 

  11. Ossipov, E., Karlsson, G.: SOS: Sender oriented signaling for simplified guaranteed service. In: Stiller, B., Smirnow, M., Karsten, M., Reichl, P. (eds.) QofIS 2002 and ICQT 2002. LNCS, vol. 2511, p. 100. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Ossipov, E.: The design and application of a simplified guaranteed service for the Internet, Licentiate thesis, KTH, Sweden (2003), http://www.it.kth.se/~osipov/FILES/Lic/Lic.pdf

  13. Network Simulator NS-2, http://www.isi.edu/nsnam/ns

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ossipov, E., Karlsson, G. (2003). The Effect of Per-input Shapers on the Delay Bound in Networks with Aggregate Scheduling. In: Ventre, G., Canonico, R. (eds) Interactive Multimedia on Next Generation Networks. MIPS 2003. Lecture Notes in Computer Science, vol 2899. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40012-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-40012-7_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20534-0

  • Online ISBN: 978-3-540-40012-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics