Skip to main content

End-to-End Delay Bounds and Buffer Sizing

  • Chapter
ATM Network Performance
  • 29 Accesses

Abstract

We will now begin to demonstrate the usefulness of the minimum-bandwidth property concept by considering tandem processor sharing nodes (PSNs). Useful end-to-end cell delay bounds and buffer sizing results will be obtained for end-to-end virtual path connections (VPCs). These results will be applied to provisioning problems in subsequent chapters. Finally, results for end-to-end VPCs are extended to arbitrary VPC structures by using the notion of “effective” minimum-bandwidth properties. We will assume all minimum-bandwidth property parameters are nonnegative integers.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Discussion and References

  1. A. Hung and G. Kesidis. End-to-end delay bounds and buffer sizing in ATM networks. Technical Report 95–08, E and CE Dept, Univ. of Waterloo, June 1995.

    Google Scholar 

  2. N.R. Figueira and J. Pasquale. An upper bound on delay for the VirtualClock service discipline. IEEE/ACM Trans. Networking, Vol. 3, No. 4:pages 399–408, Aug. 1995.

    Article  Google Scholar 

  3. A.K. Parekh and R.G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: The multiple node case. IEEE/ACM Trans. Networking, Vol. 2, No. 2:pages 137–150, Apr. 1994.

    Article  Google Scholar 

  4. R.L. Cruz. Service burstiness and dynamic burstiness measures: a framework. J. High-Speed Networks, Vol. 1, No. 2:pages 105–127, 1992.

    Google Scholar 

  5. ATM Forum Technical Committee. User-Network Interface (UNI) Specification Version 3.1. Prentice-Hall, Upper Saddle River, NJ, 1995.

    Google Scholar 

  6. R. Cruz. Quality of service guarantees in virtual circuit switched networks. IEEE JSAC, Vol. 13, No. 6:pages 10481056, Aug. 1995.

    Google Scholar 

  7. H. Zhang. Service disciplines for guaranteed performance service in packet-switching networks. Proc. of the IEEE, Vol. 83, No. 10, Oct. 1995.

    Google Scholar 

  8. A.K. Parekh and R.G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: The single node case. IEEE/ACM Trans. Networking, Vol. 1, No. 3:pages 344–357, June 1993.

    Article  Google Scholar 

  9. G.G. Xie and S.S. Lam. Delay guarantee of Virtual Clock server. IEEE/ACM Trans. Networking, Vol. 3, No. 6:pages 683–689, Dec. 1995.

    Article  Google Scholar 

  10. G. Kesidis. Resource provisioning in ATM networks using virtual path connections. Technical Report No. 95–11, E and CE Dept, Univ. of Waterloo, Oct., 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer Science+Business Media New York

About this chapter

Cite this chapter

Kesidis, G. (1996). End-to-End Delay Bounds and Buffer Sizing. In: ATM Network Performance. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-4568-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-4568-9_4

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4757-4570-2

  • Online ISBN: 978-1-4757-4568-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics