Article thumbnail

PathChirp: Efficient Available Bandwidth Estimation for Network Paths

By Vinay Joseph Ribeiro, Rudolf H. Riedi, Richard G. Baraniuk, Jiri Navratil and Les CottrellVinay Joseph Ribeiro, Rudolf H. Riedi, Richard G. Baraniuk, Jiri Navratil and Les Cottrell

Abstract

Conference PaperThis paper presents <i>PathChirp</i>, a new active probing tool for estimating the available bandwidth on a communication network path. Based on the concept of "self-induced congestion," PathChirp features an exponential flight pattern of probes we call a <i>chirp</i>. Packet chips offer several significant advantages over current probing schemes based on packet pairs or packet trains. By rapidly increasing the probing rate within each chirp, PathChirp obtains a rich set of information from which to dynamically estimate the available bandwidth. Since it uses only packet interarrival times for estimation, PathChirp does not require synchronous nor highly stable clocks at the sender and receiver. We test PathChirp with simulations and Internet experiments and find that it provides good estimates of the available bandwidth while using up to an order-of-magnitude fewer bytes than current state-of-the-art techniques

Topics: bandwidth, available bandwidth, networks, chirps, estimation, end-to-end, measurement, probing, Signal Processing for Networking, bandwidth, available bandwidth, networks, chirps, estimation, end-to-end, measurement, probing
Year: 2006
OAI identifier: oai:scholarship.rice.edu:1911/20252
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/1911/202... (external link)
  • http://dsp.rice.edu/) (external link)
  • http://cmc.rice.edu/) (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles