Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A control-theoretic approach to flow control
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Improving the start-up behavior of a congestion control scheme for TCP
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Measurements and analysis of end-to-end Internet dynamics
Measurements and analysis of end-to-end Internet dynamics
End-to-end internet packet dynamics
IEEE/ACM Transactions on Networking (TON)
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Measuring link bandwidths using a deterministic model of packet delay
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Active probing using packet quartets
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
MRTG: The Multi Router Traffic Grapher
LISA '98 Proceedings of the 12th Conference on Systems Administration
Server Selection Using Dynamic Path Characterization in Wide-Area Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
The PingER project: active Internet performance monitoring for the HENP community
IEEE Communications Magazine
Measurement and analysis of IP network usage and behavior
IEEE Communications Magazine
TCP Vegas: end to end congestion avoidance on a global Internet
IEEE Journal on Selected Areas in Communications
Wide-area Internet traffic patterns and characteristics
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
The p-pair/train technique estimates the capacity of a path from the dispersion experienced by two/multiple back-to-back packets. The dispersion of packets may follow a complicated multimodal distribution, which causes statistical filtering methodologies and heuristic approaches (e.g., pathrate) to be inaccurate in heavily-loaded cases. This paper analyzes the noise characteristics in the path capacity measurement, and elaborates on the distribution of capacity estimates. Based on this analysis, a new algorithm called LMSA (Local Modes Statistical Algorithm), and its enhancement (LMSA+) are presented. Using multiple distributions of capacity estimates obtained by variable-sized probing p-pairs, LMSA+ only picks out the local modes that locates at fixed positions, and selects the minimum of these modes as the path capacity. Simulation results demonstrate that, compared with pathrate, LMSA+ is more accurate in heavily-loaded paths or paths with relatively large bottleneck bandwidth values, and is more robust to the dynamic cross traffic load.