Skip to main content
SpringerLink
Log in

On the Impacts of Traffic Shaping on End-to-End Delay Bounds in Aggregate Scheduling Networks

  • Conference paper
Quality for All (QofIS 2003)

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

Included in the following conference series:

Abstract

The Differentiated Services architecture allows for the provision of scalable Quality of Service by means of aggregating flows to a small number of traffic classes. Among these classes a Premium Service is defined, for which end-to-end delay guarantees are of particular interest. However, in aggregate scheduling networks the derivation of such worst case delays is significantly complicated and the derived bounds are weakened by the multiplexing of flows to aggregates.

A means to minimize the impacts of interfering flows is to shape incoming traffic, so that bursts are smoothed. Doing so reduces the queuing delay within the core of the domain, whereas an additional shaping delay at the edge is introduced. In this paper we address the issue of traffic shaping analytically. We derive a form that allows to quantify the impacts of shaping and we show simulation results on the derivation of end-to-end delay bounds under different shaping options.

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

Access this chapter

Log in via an institution
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. Adler, H.-M.: 10 Gigabit/s Plattform für das G-WiN betriebsbereit. DFN Mitteilungen 60 (2002)

    Google Scholar 

  2. Blake, S., et al.: An Architecture for Differentiated Services, RFC 2475 (1998)

    Google Scholar 

  3. Chang, C.-S.: Performance Guarantees in Communication Networks. TNCS. Springer, Heidelberg (2000)

    MATH  Google Scholar 

  4. Charny, A., Le Boudec, J.-Y.: Delay Bounds in a Network with Aggregate Scheduling. In: Crowcroft, J., Roberts, J., Smirnov, M.I. (eds.) QofIS 2000. LNCS, vol. 1922, pp. 1–13. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  5. Cruz, R.L.: A Calculus for Network Delay, Part I: Network Elements in Isolation. IEEE Transactions on Information Theory 37(1), 114–131 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cruz, R.L.: A Calculus for Network Delay, Part II: Network Analysis. IEEE Transactions on Information Theory 37(1), 132–141 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  7. Cruz, R.L.: SCED+: Efficient Management of Quality of Service Guarantees. In: Proceedings of IEEE Infocom (1998)

    Google Scholar 

  8. Davie, B., et al.: An Expedited Forwarding PHB. RFC 3246 (2002)

    Google Scholar 

  9. Einhoff, G.: Quality of Service Routing for an IP Premium Service based on MPLS Traffic Engineering, Master’s Thesis, Aachen University (2003)

    Google Scholar 

  10. Le Boudec, J.-Y.: Some Properties Of Variable Length Packet Shapers. In: Proceedings of ACM Sigmetrics (2001)

    Google Scholar 

  11. Le Boudec, J.-Y., Thiran, P.: Network Calculus A Theory of Deterministic Queuing Systems for the Internet. LNCS, vol. 2050. Springer, Heidelberg (2002)

    Google Scholar 

  12. Nichols, K., Jacobson, V., Zhang, L.: A Two-bit Differentiated Services Architecture for the Internet. RFC 2638 (1999)

    Google Scholar 

  13. Pareck, A.K., Gallager, R.G.: A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case. IEEE/ACM Transactions on Networking 1(3), 344–357 (1993)

    Article  Google Scholar 

  14. Pareck, A.K., Gallager, R.G.: A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple-Node Case. IEEE/ACM Transactions on Networking 2(2), 137–150 (1994)

    Article  Google Scholar 

  15. Sander, V.: Design and Evaluation of a Bandwidth Broker that Provides Network Quality of Service for Grid Applications, PhD Thesis, Aachen University (2002)

    Google Scholar 

  16. Starobinski, D., Karpovsky, M., Zakrevski, L.: Application of Network Calculus to General Topologies using Turn-Prohibition. In: Proceedings of IEEE Infocom (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Aachen University, Ahornstr. 55, 52074, Aachen, Germany

    Markus Fidler

Authors
  1. Markus Fidler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Electrical Engineering, ACCESS Linnaeus Center,  

    Gunnar Karlsson

  2. Fraunhofer Institut FOKUS, Kaiserin-Augusta Allee 31, 10589, Berlin, Germany

    Michael I. Smirnov

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fidler, M. (2003). On the Impacts of Traffic Shaping on End-to-End Delay Bounds in Aggregate Scheduling Networks. In: Karlsson, G., Smirnov, M.I. (eds) Quality for All. QofIS 2003. Lecture Notes in Computer Science, vol 2811. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45188-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45188-4_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20192-2

  • Online ISBN: 978-3-540-45188-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation