Skip to main content
SpringerLink
Log in

An Approximation of the End-to-End Delay Distribution

  • Conference paper
  • First Online:
Book cover Quality of Service — IWQoS 2003 (IWQoS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2707))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Addie, R. G. and Zukerman, M.: An Approximation for Performance Evaluation of Stationary Single Server Queues. IEEE Transactions on Communications42, (1994) 3150–3160.

    Article  Google Scholar 

  2. 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.

    Article  MathSciNet  Google Scholar 

  3. 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.

    Google Scholar 

  4. 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.

    Article  Google Scholar 

  5. 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).

    Google Scholar 

  6. 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.

    Article  Google Scholar 

  7. 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.

    Google Scholar 

  8. 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.

    Google Scholar 

  9. 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).

    Google Scholar 

  10. Cetinkaya, C., Kanodia, V. and Knightly, E.: Scalable Services via Egress Admission Control. IEEE Transactions on Multimedia3, (2001) 69–81.

    Article  Google Scholar 

  11. 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.

    Article  Google Scholar 

  12. Qiu, J. and Knightly, E.: Measurement-Based Admission Control with Aggregate Traffic Envelopes. IEEE/ACM Transactions on Networking9, (2001) 199–210.

    Article  Google Scholar 

  13. Grossglauser, M. and Tse, D.: A Time-Scale Decomposition Approach to Measurement-Based Admission Control. In Proceedings of IEEE INFOCOM. New York, NY (1999).

    Google Scholar 

  14. 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).

    Google Scholar 

  15. Cruz, R. L.: A Calculus for Network Delay, Part II: Network Analysis. IEEE Transactions on Information Theory37, (1991) 132–142.

    Article  MathSciNet  Google Scholar 

  16. Kurose, J.: On Computing Per-Session Performance Bounds in High-Speed Multi-Hop Computer Networks. In Proceedings of ACM SIGMETRICS. (1992) 128–139.

    Google Scholar 

  17. 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.

    Google Scholar 

  18. 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).

    Google Scholar 

  19. 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.

    Google Scholar 

  20. Eun, D. and Shroff, N. B.: Simplification of Network Analysis in Large-Bandwidth Systems. In Proceedings of IEEE INFOCOM. San Francisco, CA (2003).

    Google Scholar 

  21. Feller, W.: An Introduction to Probability Theory and its Applications I. John Wiley & Son, New York (1968).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, 47907, USA

    Han S. Kim & Ness B. Shroff

Authors
  1. Han S. Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ness B. Shroff
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC, 27599-3175, USA

    Kevin Jeffay

  2. Computer Science Division, EECS Department, University of California at Berkeley, 645 Soda Hall, Berkeley, CA, 94720-1776, USA

    Ion Stoica

  3. Center for Internet Research, International Computer Science Institute, 1947 Center Street, Suite 600, Berkeley, CA, 94704, USA

    Klaus Wehrle

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation