Jitter calculus in ATM networks: multiple nodes
IEEE/ACM Transactions on Networking (TON)
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
A measurement study of available bandwidth estimation tools
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Packet-Pair Bandwidth Estimation: Stochastic Analysis of a Single Congested Node
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Ten fallacies and pitfalls on end-to-end available bandwidth estimation
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Single-hop probing asymptotics in available bandwidth estimation: sample-path analysis
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Packet-dispersion techniques and a capacity-estimation methodology
IEEE/ACM Transactions on Networking (TON)
Evaluation and characterization of available bandwidth probing techniques
IEEE Journal on Selected Areas in Communications
A measurement-friendly network (MFN) architecture
Proceedings of the 2006 SIGCOMM workshop on Internet network management
The probe gap model can underestimate the available bandwidth of multihop paths
ACM SIGCOMM Computer Communication Review
Granular model of packet pair separation in Poissonian traffic
Computer Networks: The International Journal of Computer and Telecommunications Networking
Adding definition to active probing
ACM SIGCOMM Computer Communication Review
A queueing-theoretic foundation of available bandwidth estimation: single-hop analysis
IEEE/ACM Transactions on Networking (TON)
Operational comparison of available bandwidth estimation tools
ACM SIGCOMM Computer Communication Review
A stochastic foundation of available bandwidth estimation: multi-hop analysis
IEEE/ACM Transactions on Networking (TON)
Real-time available-bandwidth estimation using filtering and change detection
Computer Networks: The International Journal of Computer and Telecommunications Networking
Impact of transient CSMA/CA access delays on active bandwidth measurements
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Inverse problems in queueing theory and Internet probing
Queueing Systems: Theory and Applications
Analysis of minimal backlogging-based available bandwidth estimation mechanism
Computer Communications
Speed measurements of residential internet access
PAM'12 Proceedings of the 13th international conference on Passive and Active Measurement
Inverse problems in bandwidth sharing networks
Proceedings of the 24th International Teletraffic Congress
SoNIC: precise realtime software access and control of wired networks
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
Hi-index | 0.00 |
This paper analyzes the asymptotic behavior of packet-train probing over a multi-hop network path P carrying arbitrarily routed bursty cross-traffic flows. We examine the statistical mean of the packet-train output dispersions and its relationship to the input dispersion. We call this relationship the response curve of path P. We show that the real response curve Z is tightly lower-bounded by its multi-hop fluid counterpart F, obtained when every cross-traffic flow on P is hypothetically replaced with a constant-rate fluid flow of the same average intensity and routing pattern. The real curve Z asymptotically approaches its fluid counterpart F as probing packet size or packet train length increases. Most existing measurement techniques are based upon the single-hop fluid curve S associated with the bottleneck link in P. We note that the curve S coincides with F in a certain large-dispersion input range, but falls below F in the remaining small-dispersion input ranges. As an implication of these findings, we show that bursty cross-traffic in multi-hop paths causes negative bias (asymptotic underestimation) to most existing techniques. This bias can be mitigated by reducing the deviation of Z from S using large packet size or long packet-trains. However, the bias is not completely removable for the techniques that use the portion of S that falls below F.