Ningning Hu
ABSTRACT
The ability to locate network bottlenecks along end-to-end paths on the Internet is of great interest to both network operators and researchers. For example, knowing where bottleneck links are, network operators can apply traffic engineering either at the interdomain or intradomain level to improve routing. Existing tools either fail to identify the location of bottlenecks, or generate a large amount of probing packets. In addition, they often require access to both end points. In this paper we present Pathneck, a tool that allows end users to efficiently and accurately locate the bottleneck link on an Internet path. Pathneck is based on a novel probing technique called Recursive Packet Train (RPT) and does not require access to the destination. We evaluate Pathneck using wide area Internet experiments and trace-driven emulation. In addition, we present the results of an extensive study on bottlenecks in the Internet using carefully selected, geographically diverse probing sources and destinations. We found that Pathneck can successfully detect bottlenecks for almost 80% of the Internet paths we probed. We also report our success in using the bottleneck location and bandwidth bounds provided by Pathneck to infer bottlenecks and to avoid bottlenecks in multihoming and overlay routing.
- Abilene network monitoring. http://www.abilene.iu.edu/noc.html.]]Google Scholar
- Dummynet. http://info.iet.unipi.it/~luigi/ip_dummynet/.]]Google Scholar
- Emulab. http://www.emulab.net.]]Google Scholar
- Planetlab. https://www.planet-lab.org.]]Google Scholar
- Routescience. http://www.routescience.com.]]Google Scholar
- University of Oregon Route Views Project. http://www.routeviews.org.]]Google Scholar
- RFC 792. Internet control message protocol, September 1981.]]Google Scholar
- A. Akella, B. Maggs, S. Seshan, A. Shaikh, and R. Sitaraman. A Measurement-Based Analysis of Multihoming. In Proc. ACM SIGCOMM, September 2003.]] Google ScholarDigital Library
- A. Akella, J. Pang, B. Maggs, S. Seshan, and A. Shaikh. Overlay routing vs multihoming: An end-to-end perspective. In Proc. ACM SIGCOMM, August 2004.]] Google ScholarDigital Library
- A. Akella, S. Seshan, and A. Shaikh. An empirical evaluation of wide-area internet bottlenecks. In Proc. ACM IMC, October 2003.]] Google ScholarDigital Library
- K. G. Anagnostakis, M. B. Greenwald, and R. S. Ryger. cing: Measuring network-internal delays using only existing infrastructure. In Proc. IEEE INFOCOM, April 2003.]]Google ScholarCross Ref
- D. G. Andersen, A. C. Snoeren, and H. Balakrishnan. Best-path vs. multi-path overlay routing. In Proc. ACM IMC, October 2003.]] Google ScholarDigital Library
- R. L. Carter and M. E. Crovella. Measuring bottleneck link speed in packet-switched networks. Technical report, Boston University Computer Science Department, March 1996.]] Google ScholarDigital Library
- C. Dovrolis, P. Ramanathan, and D. Moore. What do packet dispersion techniques measure? In Proc. of ACM INFOCOM, April 2001.]]Google ScholarCross Ref
- D. Goldenberg, L. Qiu, H. Xie, Y. R. Yang, and Y. Zhang. Optimizing Cost and Performance for Multihoming. In Proc. ACM SIGCOMM, August 2004.]] Google ScholarDigital Library
- R. Govindan and V. Paxson. Estimating router ICMP generation delays. In Proc. PAM, March 2002.]]Google Scholar
- K. Harfoush, A. Bestavros, and J. Byers. Measuring bottleneck bandwidth of targeted path segments. In Proc. IEEE INFOCOM, April 2003.]]Google ScholarCross Ref
- N. Hu and P. Steenkiste. Evaluation and characterization of available bandwidth probing techniques. IEEE JSAC Special Issue in Internet and WWW Measurement, Mapping, and Modeling, 21(6), August 2003.]] Google ScholarDigital Library
- V. Jacobson. pathchar - a tool to infer characteristics of internet paths, 1997. Presented as April 97 MSRI talk.]]Google Scholar
- M. Jain and C. Dovrolis. End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput. In Proc. ACM SIGCOMM, August 2002.]] Google ScholarDigital Library
- M. Jain and C. Dovrolis. Pathload: A measurement tool for end-to-end available bandwidth. In Proc. PAM, March 2002.]]Google Scholar
- K. Lai and M. Baker. Nettimer: A tool for measuring bottleneck link bandwidth. In Proc. of the USENIX Symposium on Internet Technologies and Systems, March 2001.]] Google ScholarDigital Library
- R. Mahajan, N. Spring, D. Wetherall, and T. Anderson. User-level internet path diagnosis. In Proc. SOSP, October 2003.]] Google ScholarDigital Library
- Z. M. Mao, J. Rexford, J. Wang, and R. Katz. Towards an Accurate AS-level Traceroute Tool. In Proc. ACM SIGCOMM, September 2003.]] Google ScholarDigital Library
- N. Maxemchuk. Dispersity Routing in Store and Forward Networks. PhD thesis, University of Pennsylvania, May 1975.]]Google Scholar
- B. Melander, M. Bjorkman, and P. Gunningberg. A new end-to-end probing and analysis method for estimating bandwidth bottlenecks. In Proc. IEEE GLOBECOM, November 2000.]]Google ScholarCross Ref
- J. Padhye, V. Firoiu, D. Towsley, and J. Kurose. Modeling TCP throughput: A simple model and its empirical validation. In Proc. ACM SIGCOMM, September 1998.]] Google ScholarDigital Library
- M. O. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. J. of the ACM, 36(2), April 1989.]] Google ScholarDigital Library
- V. Ribeiro. Spatio-temporal available bandwidth estimation for high-speed networks. In Proc. of the First Bandwidth Estimation Workshop (BEst), December 2003.]]Google Scholar
- V. Ribeiro, R. Riedi, R. Baraniuk, J. Navratil, and L. Cottrell. pathchirp: Efficient available bandwidth estimation for network paths. In Proc. PAM, April 2003.]]Google Scholar
- RON. Resilient Overlay Networks. http://nms.lcs.mit.edu/ron/.]]Google Scholar
- S. Savage. Sting: a TCP-based network measurement tool. In Proc. of the 1999 USENIX Symposium on Internet Technologies and Systems, October 1999.]] Google ScholarDigital Library
- S. Savage, T. Anderson, A. Aggarwal, D. Becker, N. Cardwell, A. Collins, E. Hoffman, J. Snell, A. Vahdat, G. Voelker, and J. Zahorjan. Detour: a case for informed internet routing and transport. IEEE Micro, 19(1), 1999.]] Google ScholarDigital Library
- N. Spring, R. Mahajan, and T. Anderson. Quantifying the Causes of Path Inflation. In Proc. ACM SIGCOMM, August 2003.]] Google ScholarDigital Library
- N. Spring, R. Mahajan, and D. Wetherall. Measuring ISP topologies with Rocketfuel. In Proc. ACM SIGCOMM, August 2002.]] Google ScholarDigital Library
- J. Strauss, D. Katabi, and F. Kaashoek. A measurement study of available bandwidth estimation tools. In Proc. ACM IMC, October 2003.]] Google ScholarDigital Library
- H. Tangmunarunkit, R. Govindan, and S. Shenker. Internet Path Inflation Due to Policy Routing. In Proc. SPIE ITCOM, August 2001.]]Google Scholar
Index Terms
- Locating internet bottlenecks: algorithms, measurements, and implications
Recommendations
Locating internet bottlenecks: algorithms, measurements, and implications
The ability to locate network bottlenecks along end-to-end paths on the Internet is of great interest to both network operators and researchers. For example, knowing where bottleneck links are, network operators can apply traffic engineering either at ...
Locating Available Bandwidth Bottlenecks
STAB is a new edge-based probing tool to locate thin links on an end-to-end network path in space and over time. Thin links are those links with less available bandwidth than all links preceding them on the path. STAB uses special chirp-probing trains ...
TCP-friendly congestion control for the fair streaming of scalable video
Dynamic bandwidth estimation serves as an important basis for performance optimization of real-time distributed multimedia applications. The objective of this paper is to develop a TCP-friendly and fair congestion control algorithm which regulates the ...
Comments