Abstract
In this paper we propose an approximation for the end-to-end (queueing) delay distribution based on endpoint measurements. We develop a notion of the end-to-end capacity which is defined for a path of interest. We show that the end-to-end path can be represented by a single-node model with the end-to-end capacity in the sense that the single-node model is equivalent to the original path in terms of the queue-length and the departure. Our study is motivated by the case where the end-to-end delay distribution can be approximated by an appropriately scaled end-to-end queue-length distribution. We investigate the accuracy of our approximation and demonstrate its application to admission control providing end-to-end QoS.
Keywords
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Addie, R. G. and Zukerman, M.: An Approximation for Performance Evaluation of Stationary Single Server Queues. IEEE Transactions on Communications42, (1994) 3150–3160.
Duffield, N. G. and O’Connell, N.: Large Deviations and Overflow Probabilities for the General Single Server Queue, with Application. Proc. Cambridge Philos. Soc.118, (1995) 363–374.
Glynn, P. W. and Whitt, W.: Logarithmic Asymptotics for Steady-State Tail Probabilities in a Single-Server Queue. Journal of Applied Probability (1994) 131–155.
Choe, J. and Shroff, N. B.: A Central Limit Theorem Based Approach for Analyzing Queue Behavior in High-Speed Networks. IEEE/ACM Transactions on Networking6, (1998) 659–671.
Likhanov, N. and Mazumdar, R. R.: Cell-Loss Asymptotics in Buffers fed with a Large Number of Independent stationary sources. In Proceedings of IEEE INFOCOM. San Francisco, CA (1998).
Kim, H. S. and Shroff, N. B.: Loss Probability Calculations and Asymptotic Analysis for Finite Buffer Multiplexers. IEEE/ACM Transactions on Networking9, (2001) 755–768.
Nagarajan, R., Kurose, J. and Towsley, D.: Local Allocation of End-to-End Quality-of-Service in High-Speed Networks. IFIP Transactions C-Communication Systems15, (1993) 99–118.
Yates, D., Kurose, J. and Towsley, D.: On Per-Session End-to-End Delay and the Call Admission Problem for Real-Time Applications with QOS Requirements. Journal of Highspeed Networks3, (1994) 429–458.
Kim, H. S.: Queueing Analysis of Network Multiplexers: Loss Ratio and End-to-End Delay Distribution. PhD thesis. School of Electrical and Computer Engineering Purdue University, West Lafayette, IN (2003).
Cetinkaya, C., Kanodia, V. and Knightly, E.: Scalable Services via Egress Admission Control. IEEE Transactions on Multimedia3, (2001) 69–81.
Yuan, P., Schlembach, J., Skoe, A. and Knightly, E.: Design and Implementation of Scalable Admission Control. Computer Networks Journal:Special Issue on Quality of Service in IP Networks37, (2001) 507–518.
Qiu, J. and Knightly, E.: Measurement-Based Admission Control with Aggregate Traffic Envelopes. IEEE/ACM Transactions on Networking9, (2001) 199–210.
Grossglauser, M. and Tse, D.: A Time-Scale Decomposition Approach to Measurement-Based Admission Control. In Proceedings of IEEE INFOCOM. New York, NY (1999).
Bianchi, G., Capone, A. and Petrioli, C.: Throughput Analysis of End-to-End Masurement-based Admission Control in IP. In Proceedings of IEEE INFOCOM. Tel Aviv, Israel (2000).
Cruz, R. L.: A Calculus for Network Delay, Part II: Network Analysis. IEEE Transactions on Information Theory37, (1991) 132–142.
Kurose, J.: On Computing Per-Session Performance Bounds in High-Speed Multi-Hop Computer Networks. In Proceedings of ACM SIGMETRICS. (1992) 128–139.
Zhang, H. and Knightly, E. W.: Providing End-to-End Statistical Performance Guarantee with Bounding Interval Dependent Stochastic Models. In Proceedings of ACM SIGMETRICS. (1994) 211–220.
Eun, D., Kim, H. S. and Shroff, N. B.: End-to-End Traffic Analysis in Large Networked Systems. In Proceedings of Allerton Conference. Monticello, IL (2001).
Eun, D. and Shroff, N. B.: A Measurement-Analytic Approach for QoS Estimation in a Network based on the Dominant Time Scale. IEEE/ACM Transactions on Networking (2003) to appear.
Eun, D. and Shroff, N. B.: Simplification of Network Analysis in Large-Bandwidth Systems. In Proceedings of IEEE INFOCOM. San Francisco, CA (2003).
Feller, W.: An Introduction to Probability Theory and its Applications I. John Wiley & Son, New York (1968).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, H.S., Shroff, N.B. (2003). An Approximation of the End-to-End Delay Distribution. In: Jeffay, K., Stoica, I., Wehrle, K. (eds) Quality of Service — IWQoS 2003. IWQoS 2003. Lecture Notes in Computer Science, vol 2707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44884-5_4
Download citation
DOI: https://doi.org/10.1007/3-540-44884-5_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40281-7
Online ISBN: 978-3-540-44884-6
eBook Packages: Springer Book Archive