Subscribe

Issue No.06 - June (2008 vol.19)

pp: 837-850

ABSTRACT

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.

INDEX TERMS

Network topology, Network monitoring, Internet Applications

CITATION

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.70771REFERENCES

- [1] D.G. Andersen, H. Balakrishnan, M.F. Kaashoek, and R. Morris, “Resilient Overlay Networks,”
Proc. 18th ACM Symp. Operating Systems Principles (SOSP '01), pp. 131-145, Oct. 2001.- [2] Y.H. Chu, S. Rao, S. Seshan, and H. Zhang, “A Case for End System Multicast,”
IEEE J. Selected Areas in Comm., vol. 20, no. 8, pp. 1456-1471, Oct. 2002.- [3] S. Banerjee, B. Bhattacharjee, and C. Kommareddy, “Scalable Application Layer Multicast,”
Proc. ACM SIGCOMM '02, pp. 205-217, Aug. 2002.- [4] S. Rhea, B. Godfrey, B. Karp, J. Kubiatowicz, S. Ratnasamy, S. Shenker, I. Stoica, and H. Yu, “OpenDHT: A Public DHT Service and Its Uses,”
Proc. ACM SIGCOMM '05, pp. 73-84, Aug. 2005.- [5] Y. Chawathe, S. Ramabhadran, S. Ratnasamy, A. LaMarca, J. Hellerstein, and S. Shenker, “A Case Study in Building Layered DHT Applications,”
Proc. ACM SIGCOMM '05, pp.97-108, Aug. 2005.- [6] D.G. Andersen, N. Feamster, S. Bauer, and H. Balakrishnan, “Topology Inference from BGP Routing Dynamics,”
Proc. ACM Internet Measurement Workshop (IMW '02), pp. 243-248, Nov. 2002.- [7] F. Wang and L. Gao, “On Inferring and Characterizing Internet Routing Policies,”
Proc. ACM Internet Measurement Workshop (IMW'03), pp. 15-26, Oct. 2003.- [8] M. Coates, R. Castro, R. Nowak, M. Gadhiok, R. King, and Y. Tsang, “Maximum Likelihood Network Topology Identification from Edge-Based Unicast Measurements,”
Proc. ACM SIGMETRICS '02, pp. 11-20, 2002.- [10]
Traceroute, http:/www.traceroute.org/, 2007.- [11] M. Kwon and S. Fahmy, “Topology-Aware Overlay Networks for Group Communication,”
Proc. 12th ACM Int'l Workshop Network and Operating Systems Support for Digital Audio and Video (NOSSDAV '02), pp. 127-136, May 2002.- [14] X. Jin, Q. Xia, and S.-H.G. Chan, “A Cost-Based Evaluation of End-to-End Network Measurements in Overlay Multicast,”
Proc. IEEE INFOCOM Mini-Symposium '07, June 2007.- [16] S.Y. Shi, J.S. Turner, and M. Waldvogel, “Dimensioning Server Access Bandwidth and Multicast Routing in Overlay Networks,”
Proc. 11th ACM Int'l Workshop Network and Operating Systems Support for Digital Audio and Video (NOSSDAV '01), pp. 83-91, 2001.- [18] B. Donnet, T. Friedman, and M. Crovella, “Improved Algorithms for Network Topology Discovery,”
Proc. Sixth Int'l Workshop Passive and Active Network Measurement (PAM '05), Mar. 2005.- [19] B. Donnet, P. Raoult, T. Friedman, and M. Crovella, “Efficient Algorithms for Large-Scale Topology Discovery,”
Proc. ACM SIGMETRICS '05, pp. 327-338, June 2005.- [21]
Skitter, http://www.caida.org/tools/measurementskitter /, 2007.- [22] R. Govindan and H. Tangmunarunkit, “Heuristics for Internet Map Discovery,”
Proc. IEEE INFOCOM '00, pp. 1371-1380, Mar. 2000.- [23] N. Spring, R. Mahajan, and D. Wetherall, “Measuring ISP Topologies with Rocketfuel,”
Proc. ACM SIGCOMM '02, pp. 133-145, Aug. 2002.- [24] P. Barford, A. Bestavros, J. Byers, and M. Crovella, “On the Marginal Utility of Network Topology Measurements,”
Proc. ACM Internet Measurement Workshop (IMW '01), pp. 5-17, Nov. 2001.- [25] A. Broido and K. Claffy, “Internet Topology: Connectivity of IP Graphs,”
Proc. SPIE Int'l Conf. and Exhibits on the Convergence of IT and Comm. (ITCom '01), Aug. 2001.- [28] T.S.E. Ng and H. Zhang, “Predicting Internet Network Distance with Coordinates-Based Approaches,”
Proc. IEEE INFOCOM '02, pp. 170-179, June 2002.- [29] F. Dabek, R. Cox, F. Kaashoek, and R. Morris, “Vivaldi: A Decentralized Network Coordinate System,”
Proc. ACM SIGCOMM '04, pp. 15-26, Aug. 2004.- [30] X. Jin, Q. Xia, and S.-H.G. Chan, “A Distributed Approach to End-to-End Network Topology Inference,”
Proc. IEEE Int'l Conf. Comm. (ICC '07), June 2007.- [31] X. Jin, W.-P.K. Yiu, and S.-H.G. Chan, “Improving the Efficiency of End-to-End Network Topology Inference,”
Proc. IEEE Int'l Conf. Comm. (ICC '07), June 2007.- [34] K. Sripanidkulchai, A. Ganjam, B. Maggs, and H. Zhang, “The Feasibility of Supporting Large-Scale Live Streaming Applications with Dynamic Application End-Points,”
Proc. ACM SIGCOMM '04, pp. 107-120, Aug. 2004.- [36] V.N. Padmanabhan and L. Subramanian, “An Investigation of Geographic Mapping Techniques for Internet Hosts,”
Proc. ACM SIGCOMM '01, pp. 173-185, Aug. 2001.- [37] J. Jannotti, D.K. Gifford, K.L. Johnson, M.F. Kaashoek, and J.W. O'Toole, “Overcast: Reliable Multicasting with an Overlay Network,”
Proc. Fourth Symp. Operating System Design and Implementation (OSDI '00), pp. 197-212, Oct. 2000.- [38] E. Zegura, K. Calvert, and S. Bhattacharjee, “How to Model an Internetwork,”
Proc. IEEE INFOCOM '96, pp. 594-602, Mar. 1996.- [39]
PlanetLab, http:/www.planet-lab.org, 2007. |