End-to-end internet packet dynamics
IEEE/ACM Transactions on Networking (TON)
Using pathchar to estimate Internet link characteristics
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Measuring link bandwidths using a deterministic model of packet delay
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Hidden Markov modeling for network communication channels
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Using loss pairs to discover network properties
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
On the constancy of internet path properties
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Detecting shared congestion of flows via end-to-end measurement
IEEE/ACM Transactions on Networking (TON)
Continuous-time hidden Markov models for network performance evaluation
Performance Evaluation
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
User-level internet path diagnosis
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
A measurement study of available bandwidth estimation tools
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
An empirical evaluation of wide-area internet bottlenecks
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Model-based identification of dominant congested links
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Locating internet bottlenecks: algorithms, measurements, and implications
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
MultiQ: automated detection of multiple bottleneck capacities along a path
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Towards unbiased end-to-end network diagnosis
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Network loss inference with second order statistics of end-to-end flows
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
A wavelet-based approach to detect shared congestion
IEEE/ACM Transactions on Networking (TON)
Practical passive lossy link inference
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
Network Tomography of Binary Network Performance Characteristics
IEEE Transactions on Information Theory
The use of end-to-end multicast measurements for characterizing internal network behavior
IEEE Communications Magazine
Evaluation and characterization of available bandwidth probing techniques
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In this paper, we propose a model-based approach that uses periodic end-end probes to identify whether a "dominant congested link" exists along an end-end path. Informally, a dominant congested link refers to a link that incurs the most losses and significant queuing delays along the path. We begin by providing a formal yet intuitive definition of dominant congested link and present two simple hypothesis tests to identify whether such a link exists. We then present a novel model-based approach for dominant congested link identification that is based on interpreting probe loss as an unobserved (virtual) delay. We develop parameter inference algorithms for hidden Markov model (HMM) and Markov model with a hidden dimension (MMHD) to infer this virtual delay. Our validation using ns simulation and Internet experiments demonstrate that this approach can correctly identify a dominant congested link with only a small amount of probe data. We further provide an upper bound on the maximum queuing delay of the dominant congested link once we identify that such a link exists.