Abstract
AbstractThe packet‐pair probing algorithm for network‐bandwidth estimation is examined and an approximate model is proposed for predicting its behaviour. The model replaces the Poisson arrival process with a Gaussian distribution and resolves the queue‐size profile into two separate components: A transient component representing the buffer‐emptying process and an equilibrium component representing the return to steady‐state behaviour. Comparison with discrete‐event simulation results shows that the model is accurate in single‐hop paths when utilization is ⩽70% when the cross‐traffic packets are ⩽½ the size of the probe packets. When extended to two‐hop paths, the model remains accurate for smaller cross‐traffic packets (\documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}$\leq\frac{1}{10}-\frac{1}{5}$\end{document} the probe‐packet size). Copyright © 2008 John Wiley & Sons, Ltd.
Highlights
The term available bandwidth refers to the unused portion of a network path’s capacity which new connections may utilise without taking bandwidth from the existing cross-traffic [1]
Some bandwidth-probing algorithms determine a by multiplying l by the idle rate, which can be inferred from the delay distribution of probe-packets [3] or from information passed from the MAC layer [4]
This paper began by considering the probing of single and multi-hop network paths under the packet-pair algorithm
Summary
The term available bandwidth refers to the unused portion of a network path’s capacity which new connections may utilise without taking bandwidth from the existing cross-traffic [1]. An advantage of the packet-pair technique is that it requires no prior knowledge of link capacity, which together with the effective bandwidth can (in principle) be inferred from the measured data This rests upon certain assumptions concerning network behaviour; namely that packet scheduling is FIFO (first-in-firstout), that the raw bandwidth is constant and well-defined and that the bandwidth seen by discrete packet-pairs is identical to that enjoyed by sustained streams. The packet-pair algorithm is still valuable in conventional wired networks of switches and routers Though it has been widely investigated, much of the previous work ignores the finite granularity of the cross-traffic which is treated as a continuous “fluid”. All the C++ classes are available online and can be downloaded from http://staffnet.king.ac.uk/~ku12881/netclasses/
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
