Thumbnail
Access Restriction
Subscribed

Author Kapoor, Rohit ♦ Chen, Ling-Jyh ♦ Sanadidi, M. Y. ♦ Gerla, Mario ♦ Lao, Li
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Network capacity ♦ Bottleneck bandwidth ♦ Packet pair dispersion
Abstract We present a new capacity estimation technique, called CapProbe. CapProbe combines delay as well as dispersion measurements of packet pairs to filter out samples distorted by cross-traffic. CapProbe algorithms include convergence tests and convergence speed-up techniques by varying probing parameters. Our study of CapProbe includes a probability analysis to determine the time it takes CapProbe to converge on the average. Through simulations and measurements, we found CapProbe to be quick and accurate across a wide range of traffic scenarios. We also compared CapProbe with two previous well-known techniques, pathchar and pathrate. We found CapProbe to be much more accurate than pathchar and similar in accuracy to pathrate, while providing faster estimation than both. Another advantage of CapProbe is its lower computation cost, since no statistical post processing of probing data is required.
Description Affiliation: UCLA (Chen, Ling-Jyh; Lao, Li; Gerla, Mario; Sanadidi, M. Y.) || Qualcomm (Kapoor, Rohit)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1993-07-01
Publisher Place New York
Journal ACM SIGCOMM Computer Communication Review (CCRV)
Volume Number 34
Issue Number 4
Page Count 12
Starting Page 67
Ending Page 78


Open content in new tab

   Open content in new tab
Source: ACM Digital Library