The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
A tree-edit-distance algorithm for comparing simple, closed shapes
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
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
Detecting shared congestion of flows via end-to-end measurement
IEEE/ACM Transactions on Networking (TON)
Robust identification of shared losses using end-to-end unicast probes
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
BRITE: Universal Topology Generation from a User''s Perspective
BRITE: Universal Topology Generation from a User''s Perspective
Merging logical topologies using end-to-end measurements
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
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
FlowMate: scalable on-line flow clustering
IEEE/ACM Transactions on Networking (TON)
A survey on tree edit distance and related problems
Theoretical Computer Science
| Hi-index | 0.00 |
Quality of Service (QoS) of large-scale distributed systems depends on the properties of the network connecting the nodes/hosts of the system. Topological information about the underlying network is beneficial for improving the performance, devising reliability schemes, ensuring low overhead, and enhancing the scalability of such systems. Topology information is often obtained with the support of the network infrastructure. Unfortunately, this support is often limited and sometimes not reliable. Various techniques have been proposed to infer useful information about the structure of the IP topology using strictly end-to-end measurements. In this paper, we rely on path sharing information between the nodes of a distributed system collected using end-to-end measurements and explore how much of the logical topology can be inferred using only this information. We propose an algorithm to construct such an inferred graph and evaluate this algorithm by simulations. In the synthetic topologies we considered, error in the estimated distances between the end nodes is on average a negligible fraction of the diameter for the tree topologies and less than 20% of the diameter for denser graphs.