Issue No.06 - June (2008 vol.19)
We consider using tools like traceroute to infer the underlay topology among a group of hosts. Traditional Max-Delta inference relies on a central server and is not scalable. In this paper, we investigate a distributed inference scheme to support scalable inference. In our scheme, each host joins an overlay tree before conducting traceroute. A host then independently selects paths to traceroute and exchanges traceroute results with others through the overlay tree. As a result, each host can maintain a partially discovered topology. Furthermore, we propose several techniques to reduce the measurement cost, including (a) integrating the Doubletree algorithm to reduce measurement redundancy; (b) setting up a lookup table for routers to reduce traceroute size, and (c) conducting topology abstraction and reducing the computing frequency to reduce computational overhead. In our scheme, the computation loads for target selection are distributed to all the hosts instead of a single server, and the consumption of edge bandwidth at a host is hence limited. We have done simulations on Internet-like topologies and conducted measurements on PlanetLab. The results show that the constructed tree has a low diameter. Furthermore, the proposed improvements can efficiently reduce measurement redundancy, computational overhead and bandwidth consumption.
Network topology, Network monitoring, Internet Applications
Xing Jin, Wanqing Tu, S.-H. Gary Chan, "Scalable and Efficient End-to-End Network Topology Inference", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 6, pp. 837-850, June 2008, doi:10.1109/TPDS.2007.70771