End-to-End Delay Bounds and Buffer Sizing
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.
KeywordsPropagation Delay Arrival Process Departure Process Output Link Delay Jitter
Unable to display preview. Download preview PDF.
Discussion and References
- 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
- 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
- ATM Forum Technical Committee. User-Network Interface (UNI) Specification Version 3.1. Prentice-Hall, Upper Saddle River, NJ, 1995.Google Scholar
- R. Cruz. Quality of service guarantees in virtual circuit switched networks. IEEE JSAC, Vol. 13, No. 6:pages 10481056, Aug. 1995.Google Scholar
- H. Zhang. Service disciplines for guaranteed performance service in packet-switching networks. Proc. of the IEEE, Vol. 83, No. 10, Oct. 1995.Google Scholar
- 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