Using loss pairs to discover network properties
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Maximum likelihood network topology identification from edge-based unicast measurements
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Network tomography on general topologies
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Detecting shared congestion of flows via end-to-end measurement
IEEE/ACM Transactions on Networking (TON)
Managing a portfolio of overlay paths
NOSSDAV '04 Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video
Passive inference of path correlation
NOSSDAV '04 Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video
A wavelet-based approach to detect shared congestion
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Network radar: tomography from round trip time measurements
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
FlowMate: scalable on-line flow clustering
IEEE/ACM Transactions on Networking (TON)
Inference and Labeling of Metric-Induced Network Topologies
IEEE Transactions on Parallel and Distributed Systems
Network loss tomography using striped unicast probes
IEEE/ACM Transactions on Networking (TON)
Concurrent multipath transfer using SCTP multihoming over independent end-to-end paths
IEEE/ACM Transactions on Networking (TON)
A factor analytic approach to inferring congestion sharing based on flow level measurements
IEEE/ACM Transactions on Networking (TON)
A transport layer approach for improving end-to-end performance and robustness using redundant paths
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Identifying lossy links in wired/wireless networks by exploiting sparse characteristics
Computer Networks: The International Journal of Computer and Telecommunications Networking
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)
Measuring capacity bandwidth of targeted path segments
IEEE/ACM Transactions on Networking (TON)
Estimating topological distances based on end-to-end path sharing
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
POPI: a user-level tool for inferring router packet forwarding priority
IEEE/ACM Transactions on Networking (TON)
Measurement of loss pairs in network paths
IMC '10 Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
Detecting shared congestion paths based on PCA
Proceedings of the Nineteenth International Workshop on Quality of Service
CCIPCA-OPCSC: An online method for detecting shared congestion paths
Computer Networks: The International Journal of Computer and Telecommunications Networking
Eliminating bottlenecks in overlay multicast
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Correlation-aware multipath selection to enhance path diversity in ubiquitous computing environment
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
Current Internet transport protocols make end-to-end measurements and maintain per-connection state to regulate the use of shared network resources. When two or more such connections share a common endpoint, there is an opportunity to correlate the end-to-end measurements made by these protocols to better diagnose and control the use of shared resources. We develop packet probing techniques to determine whether a pair of connections experience shared congestion. Correct, efficient diagnoses could enable new techniques for aggregate congestion control, QoS admission control, connection scheduling and mirror site selection. Our extensive simulation results demonstrate that the conditional (Bayesian) probing approach we employ provides superior accuracy, converges faster, and tolerates a wider range of network conditions than previously proposed memoryless (Markovian) probing approaches.