Abstract
This paper presents a simple approximation to the delay distributions commonly used in traffic engineering and network planning. A key advantage of the approximation is its ability to estimate end-to-end delay without requiring convolutions or Laplace transforms. Two example applications to network planning are given: first, directly to the estimation of percentiles of end-to-end delay from component subnetwork measurements, and second, to network element characterization for computing delays in signaling or other systems that exhibit complex multiple message exchanges. A consideration of the accuracy of the method is included for both examples.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ramsay, C.M.: A Note on the Normal Power Approximation. ASTIN Bulletin 21(1) (April 1991)
ITU-T Recommendation Y.1541. Network performance objectives for IP-based services (February 2006)
Anick, D., Mitra, D., Sondhi, M.M.: Bell System Technical Journal 61(8), 1871–1894 (1982)
Kleinrock, L.: Queueing Systems, vol. 1: Theory. John Wiley & Sons, Chichester (1975)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Armolavicius, R. (2007). Simple Approximations of Delay Distributions and Their Application to Network Modeling. In: Mason, L., Drwiega, T., Yan, J. (eds) Managing Traffic Performance in Converged Networks. ITC 2007. Lecture Notes in Computer Science, vol 4516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72990-7_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-72990-7_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72989-1
Online ISBN: 978-3-540-72990-7
eBook Packages: Computer ScienceComputer Science (R0)