On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Topology-aware overlay networks for group communication
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Network tomography on general topologies
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
Backup Path Allocation Based on a Correlated Link Failure Probability Model in Overlay Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
A measurement study of available bandwidth estimation tools
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
On the Cost-Quality Tradeoff in Topology-Aware Overlay Path Probing
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
A Distributed Approach to Topology-Aware Overlay Path Monitoring
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
An algebraic approach to practical and scalable overlay network monitoring
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Enhanced EDF Scheduling Algorithms for Orchestrating Network-Wide Active Measurements
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
On the schedulability of measurement conflict in overlay networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
An OSPF topology server: design and evaluation
IEEE Journal on Selected Areas in Communications
Scheduling algorithms for conducting conflict-free measurements in overlay networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.24 |
Overlay networks often employ end-to-end probes to track network performance. These probes are routed through overlay paths, which usually overlap at the overlay level. In addition, two seemingly disjoint overlay paths may share many physical links at the IP level, causing high link stress. Several monitoring algorithms have been proposed to reduce the overall probing overhead. Surprisingly, they do not address the associated problem of high link stress. The high link stress presents an additional load on the network links, which could cause congestion, delay, and measurement conflict. In this paper, we aim at reducing the link stress associated with probing algorithms by introducing the concept of Internal Probing, where readily available IP-level topology information is used in conjunction with the overlay topology to reduce the link stress on highly shared path segments. Simulation results show that the proposed scheme can reduce the link stress by up to 30%.