Skip to main content

Pathtrait: A Tool for Tight Link Location and End-to-End Available Bandwidth Measurement

  • Conference paper
  • 759 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3758))

Abstract

Estimating the end-to-end available bandwidth along a network path is of great significance in congestion control, streaming applications, QoS verification, server selection. Knowing the exact locations of tight links, network operators can apply traffic engineering, routing policy optimization and fault diagnosis. In this paper we present Pathtrait, a tool that allows end users to accurately locate the tight link along a network path and efficiently estimate the end-to-end available bandwidth through the information of tight link location. Pathtrait is based on a novel probing technique that generates three different sorts of probing trains. We utilize a original probing structure to capture the input rate and output rate of a single probing train at certain link among the estimated network path, which can infer the tight link and estimate the available bandwidth of the tight link.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jain, M., Dovrolis, C.: End-to-end available bandwidth: Measurement methodology, dynamics, and relation with tcp throughput. In: Proceedings of ACM SIGCOMM (August 2002)

    Google Scholar 

  2. Carter, R., Crovella, M.: Measuring Bottleneck Link Speed. Packet-Switched Networks, International Journal on Performance Evaluation 2728 (1996)

    Google Scholar 

  3. Dovrolis, C., Ramanathan, P., Moore, D.: What Do Packet Dispersion Techniques Measure? In: Proceedings of IEEE INFOCOM (April 2001)

    Google Scholar 

  4. Melander, B., Bjorkman, M., Gunningberg, P.: Regression-based Available Bandwidth Measurement. In: Proceedings of SPECTS (July 2002)

    Google Scholar 

  5. Ribeiro, V., Riedi, R., Baraniuk, R., Navratil, J., Cottrell, L.: pathChirp: Efficient Available Bandwidth Estimation for Network Paths. In: Proceedings of Passive and Active Measurement Workshop (2003)

    Google Scholar 

  6. Hu, N., Steenkiste, P.: Evaluation and Characterization of Available Bandwidth Probing Techniques. IEEE JSAC Special Issue in Internet and WWW Measurement, Mapping, and Modeling, 3rd Quarter (2003)

    Google Scholar 

  7. Akella, A., Seshan, S., Shaikh, A.: An empirical evaluation of wide-area Internet bottlenecks. In: Internet Measurement Conference (2003)

    Google Scholar 

  8. Ribeiro, V., Riedi, R., Baraniuk, R.: Spatio-Temporal Available Bandwidth Estimation with STAB. In: ACM SIGMETRICS Performance Evaluation Review (June 2004)

    Google Scholar 

  9. Lai, K., Baker, M.: Measuring Link Bandwidth Using a Deterministic Model of Packet Delay. In: Proceedings of ACM SIGCOMM (2000)

    Google Scholar 

  10. Zhang, D., Huang, W., Lin, C.: Locating the tightest link of a network path. In: ACM SIGMETRICS Performance Evaluation Review (June 2004)

    Google Scholar 

  11. Hu, N., Li, L., Mao, Z., Steenkiste, P., Wang, J.: Locating Internet Bottlenecks: Algorithms, Measurements, and Implications. In: ACM SIGCOMM Computer Communication Review (October 2004)

    Google Scholar 

  12. Harfoush, K., Bestavros, A., Byers, J.: Measuring bottleneck bandwidth of targeted path segments. In: Proceedings of IEEE INFOCOM (March 2003)

    Google Scholar 

  13. Anagnostakis, K., Greenwald, M., Ryger, R.: Cing: Measuring Network–internal Delays Using Only Existing Infrastructure. In: Proceedings of IEEE INFOCOM (April 2003)

    Google Scholar 

  14. Govindan, R., Paxson, V.: Estimating Router ICMP Generation Delays. In: Proceedings of PAM (March 2002)

    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

Zhang, D., Wu, Y., Xu, J. (2005). Pathtrait: A Tool for Tight Link Location and End-to-End Available Bandwidth Measurement. In: Pan, Y., Chen, D., Guo, M., Cao, J., Dongarra, J. (eds) Parallel and Distributed Processing and Applications. ISPA 2005. Lecture Notes in Computer Science, vol 3758. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11576235_12

Download citation

  • DOI: https://doi.org/10.1007/11576235_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29769-7

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics