End-To-End Delay Bounds and Buffer Sizing

Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 537)


We will now begin to demonstrate the usefulness of the guaranteed-rate property concept by considering tandem PSNs. Useful end-to-end cell delay bounds and buffer sizing results will be obtained. These results will be applied to provisioning problems in subsequent chapters. The issue of controlling cell delay jitter is addressed. Finally, extensions are made to arbitrary virtual path connection (VPC) structures by using the notion of “effective” guaranteed-rate properties. In the following, we will assume all guaranteed-rate property parameters are nonnegative integers.


Buffer Size Arrival Process Bandwidth Allotment Cell Delay Output Link 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    That is, the queue does not transmit in an unreserved or reserved-but-unused slot.Google Scholar
  2. 2.
    Multiple frames sizes per link are possible [63, 80].Google Scholar
  3. 3.
    Recall that the service eligibility time of is under (work-conserving) Virtual Clock and is under Idling Virtual Clock (IVC).Google Scholar

Copyright information

© Springer Science+Business Media New York 2000

Authors and Affiliations

  1. 1.E&CE DeptUniversity of WaterlooWaterlooCanada

Personalised recommendations