The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Using pathchar to estimate Internet link characteristics
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
End-to-end internet packet dynamics
IEEE/ACM Transactions on Networking (TON)
Detecting shared congestion of flows via end-to-end measurement
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
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
Network tomography on general topologies
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
P2Cast: peer-to-peer patching scheme for VoD service
WWW '03 Proceedings of the 12th international conference on World Wide Web
Multicast-based inference of network-internal loss characteristics
IEEE Transactions on Information Theory
Speeding up the evaluation of multimedia streaming applications in MANETs using HMMs
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Monitoring link delays with one measurement host
ACM SIGMETRICS Performance Evaluation Review - Special issue on the First ACM SIGMETRICS Workshop on Large Scale Network Inference (LSNI 2005)
Model-based end-to-end available bandwidth inference using queueing analysis
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Network modelling and simulation
Markovian-based traffic modeling for mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Measurement of loss pairs in network paths
IMC '10 Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
Model-based identification of dominant congested links
IEEE/ACM Transactions on Networking (TON)
| 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 and examine several novel model-based approaches for identifying a dominant congested link that are 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 to infer this virtual delay. Our validation using ns simulation and live Internet experiments demonstrate that this approach can correctly identify a dominant congested link with only a small amount of probe data. We further estimate the maximum queuing delay of the dominant congested link, once we identify that a dominant congested link exists.