Topology-aware overlay path probing
Computer Communications
Link stress reduction in topology-aware overlay path monitoring
Computer Communications
Synergy: sharing-aware component composition for distributed stream processing systems
Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware
Applying genetic algorithms to decision making in autonomic computing systems
ICAC '09 Proceedings of the 6th international conference on Autonomic computing
On the impact of routing matrix inconsistencies on statistical path monitoring in overlay networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Synergy: sharing-aware component composition for distributed stream processing systems
Middleware'06 Proceedings of the 7th ACM/IFIP/USENIX international conference on Middleware
| Hi-index | 0.00 |
Path probing is essential to maintaining an efficient overlay network topology. However, the cost of complete probing can be as high as (n2) which is prohibitive in largescale overlay networks. Recently we proposed a method that trades probing overhead for inference accuracy in sparse networks such as the Internet. The method uses physical path information to infer path quality for all of the n 脳 (n-1) overlay paths, while actually probing only a subset of the paths. In this paper we propose and evaluate a distributed approach to implementing this method. We describe a minimum diameter, link-stress bounded overlay spanning tree, which is used to collect and disseminate path quality information. All nodes in the tree collaborate to infer the quality of all paths. Simulation results show this approach can achieve a high-level of inference accuracy while reducing probing overhead and balancing link stress on the spanning tree.