An algebraic approach to practical and scalable overlay network monitoring
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Towards unbiased end-to-end network diagnosis
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Support for resilient Peer-to-Peer gaming
Computer Networks: The International Journal of Computer and Telecommunications Networking
Algebra-based scalable overlay network monitoring: algorithms, evaluation, and applications
IEEE/ACM Transactions on Networking (TON)
Link stress reduction in topology-aware overlay path monitoring
Computer Communications
Scheduling algorithms for conducting conflict-free measurements in overlay networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the reliability of large-scale distributed systems - A topological view
Computer Networks: The International Journal of Computer and Telecommunications Networking
Towards unbiased end-to-end network diagnosis
IEEE/ACM Transactions on Networking (TON)
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
On the impact of routing matrix inconsistencies on statistical path monitoring in overlay networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
An efficient overlay link performance monitoring technique
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Binary versus analogue path monitoring in IP networks
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
Intra autonomous system overlay dedicated to communication resilience
CRITIS'07 Proceedings of the Second international conference on Critical Information Infrastructures Security
Hi-index | 0.00 |
Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as O(n2), which is prohibitive in large-scale overlay networks. Several methods have been proposed to reduce probing overhead, although at a cost in terms of probing completeness. In this paper, an orthogonal solution is proposed that trades probing overhead for estimation accuracy in sparse networks such as the Internet. The proposed solution uses network-level path composition information (for example, as provided by a topology server) to infer path quality without full-scale probing. The inference metrics include latency, loss rate and available bandwidth. This approach is used to design several probing algorithms, which are evaluated through analysis and simulation. The results show that the proposed method can significantly reduce probing overhead while providing bounded quality estimations for all n 脳 (n - 1) overlay paths. The solution is well suited to medium-scale overlay networks in the Internet. In other environments, it can be combined with extant probing algorithms to further improve performance.