End-to-End Delay Bounds and Buffer Sizing

  • George Kesidis

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.

Keywords

Propagation Delay Arrival Process Departure Process Output Link Delay Jitter 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Discussion and References

  1. [45]
    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. [32]
    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.CrossRefGoogle Scholar
  3. [67]
    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.CrossRefGoogle Scholar
  4. [17]
    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. [12]
    ATM Forum Technical Committee. User-Network Interface (UNI) Specification Version 3.1. Prentice-Hall, Upper Saddle River, NJ, 1995.Google Scholar
  6. [15]
    R. Cruz. Quality of service guarantees in virtual circuit switched networks. IEEE JSAC, Vol. 13, No. 6:pages 10481056, Aug. 1995.Google Scholar
  7. [80]
    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. [68]
    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.CrossRefGoogle Scholar
  9. [79]
    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.CrossRefGoogle Scholar
  10. [52]
    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

Copyright information

© Springer Science+Business Media New York 1996

Authors and Affiliations

  • George Kesidis
    • 1
  1. 1.E&CE DeptUniversity of WaterlooWaterlooCanada

Personalised recommendations