Skip to main content

DRPS: A Simple Model for Locating the Tightest Link

  • Conference paper
  • 678 Accesses

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

Abstract

The tightest link of a network path is the link where the end-to-end available bandwidth is limited. We propose a new and simple probe model, called Dual Rate Periodic Streams (DRPS), for finding the location of the tightest link. A DRPS probe is a periodic stream with two rates. Initially, it goes through the path at a comparatively high rate. When arrived at a particular link, the probe shifts its rate to a lower level and keeps the rate. If proper rates are set to the probe, we can control whether the probe is congested or not by adjusting the shift time. When the point of rate shift is in front of the tightest link, the probe can go through the path without congestion, otherwise congestion occurs. Thus, we can find the location of the tightest link by congestion detection at the receiver.

Supported by the National Natural Science Foundation of China(No. 90204010).

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akella, A., Seshan, S., Shaikh, A.: An empirical evaluation of wide-area internet bottlenecks. In: Proceedings of ACM SIGCOMM Internet Measurement Conference (October 2003)

    Google Scholar 

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

    Google Scholar 

  3. Hu, N., Li, L., Mao, Z., Steenkiste, P., Wang, J.: Locating internet bottlenecks: algorithms, measurements, and implications. In: Proceedings of ACM SIGCOMM (August 2004)

    Google Scholar 

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

  5. Lai, K., Baker, M.: Measuring link bandwidths using a deterministic model of packet delay. In: Proceedings of ACM SIGCOMM (August 2000)

    Google Scholar 

  6. Ribeiro, V., Riedi, R., Baraniuk, R.: Spatio-temporal available bandwidth estimation with stab. In: Proceedings of ACM SIGMETRICS (June 2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, D., Huang, W., Lin, C. (2004). DRPS: A Simple Model for Locating the Tightest Link. In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds) Parallel and Distributed Processing and Applications. ISPA 2004. Lecture Notes in Computer Science, vol 3358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30566-8_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30566-8_38

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30566-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics