Skip to main content

Measuring Internet Bottlenecks: Location, Capacity, and Available Bandwidth

  • Conference paper
Networking and Mobile Computing (ICCNMC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3619))

Included in the following conference series:

Abstract

The ability to measure the location, capacity and available bandwidth of bottleneck in end-to-end network path is of major importance in congestion control, streaming applications, quality-of-service, overlay network and traffic engineering. Existing algorithms either fail to measure all the three bottleneck properties, or generate a large amount of probing packets. In addition, they often require deployment in both end hosts. A novel technique, called BNeck, is presented in this paper. It allows end users to efficiently and accurately measure the three bottleneck properties. The key idea of BNeck is that the per-link dispersion of probing packet train can be applied to measure the properties of congested links. The accuracy and efficiency of BNeck have been verified with elaborately designed simulation. The simulation result indicates that various applications can adopt BNeck to probe for the three bottleneck properties without loss of performance.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Carter, R.L., Crovella, M.E.: Measuring bottleneck link speed in packet-switched networks. Perform. Eval. 27(28), 297–318 (1996)

    Google Scholar 

  2. Paxson, V.: End-to-end Internet packet dynamics. IEEE/ACM Trans. Networking 7, 277–292 (1999)

    Article  Google Scholar 

  3. Hu, N., Li, L.: Locating Internet Bottlenecks: Algorithms, Measurements, and Implications. In: ACM SIGCOMM, August 2004, pp. 41–54 (2004)

    Google Scholar 

  4. Jacobson, V.: Pathchar - a tool to infer characteristics of Internet paths. Presented in April 1997 MSRI talk (1997)

    Google Scholar 

  5. Dovrolis, C., Ramanathan, P., Moore, D.: What do packet dispersion techniques measure? In: Proc. IEEE INFOCOM, April 2001, pp. 905–914 (2001)

    Google Scholar 

  6. Jain, M., Dovrolis, C.: End-to-End Available Bandwidth: Measurement Methodology, Dynamics, and Relation With TCP Throughput. IEEE/ACM Trans. Networking 11(4), 537–549 (2003)

    Article  Google Scholar 

  7. RFC 792. Internet control message protocol (September 1981)

    Google Scholar 

  8. Kapoor, R.: CapProbe: A Simple and Accuracy Capacity Estimation Technique. In: ACM SIGCOMM, August 2004, pp. 67–78 (2004)

    Google Scholar 

  9. Zhang, Y., Duffield, N.: On the constancy of Internet path properties. In: Proc. ACM SIGCOMM Internet Measurement Workshop, November 2001, pp. 197–211 (2001)

    Google Scholar 

  10. NS-2, http://www.isi.edu/nsnam/ns/

  11. Taqqu, M.S., Willinger, W.: Proof of a Fundamental Result in Self-Similar Traffic Modeling. ACM Computer Communications Review, 5–23 (April 1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhou, H., Wang, Y., Wang, Q. (2005). Measuring Internet Bottlenecks: Location, Capacity, and Available Bandwidth. In: Lu, X., Zhao, W. (eds) Networking and Mobile Computing. ICCNMC 2005. Lecture Notes in Computer Science, vol 3619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534310_110

Download citation

  • DOI: https://doi.org/10.1007/11534310_110

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28102-3

  • Online ISBN: 978-3-540-31868-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics