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)
Multi-hop probing asymptotics in available bandwidth estimation: stochastic analysis
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Evaluation and characterization of available bandwidth probing techniques
IEEE Journal on Selected Areas in Communications
The quest for bandwidth estimation techniques for large-scale distributed systems
ACM SIGMETRICS Performance Evaluation Review
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
A measurement study of bandwidth estimation in IEEE 802.11g wireless LANs using the DCF
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Computer Networks: The International Journal of Computer and Telecommunications Networking
A system-theoretic approach to bandwidth estimation
IEEE/ACM Transactions on Networking (TON)
Large scale probabilistic available bandwidth estimation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Analysis of minimal backlogging-based available bandwidth estimation mechanism
Computer Communications
SLDRT: A measurement technique for available bandwidth on multi-hop path with bursty cross traffic
Computer Networks: The International Journal of Computer and Telecommunications Networking
Available bandwidth estimation for the network paths with multiple tight links and bursty traffic
Journal of Network and Computer Applications
Estimation of the available bandwidth ratio of a remote link or path segments
Computer Networks: The International Journal of Computer and Telecommunications Networking
An intelligent routing approach using genetic algorithms for quality graded network
International Journal of Intelligent Systems Technologies and Applications
A QoS-based routing approach using genetic algorithms for bandwidth maximisation in networks
International Journal of Artificial Intelligence and Soft Computing
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 Sthat falls below F.