
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Xing Jin, Wanqing Tu, S.H. Gary Chan, "Scalable and Efficient EndtoEnd Network Topology Inference," IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 6, pp. 837850, June, 2008.  
BibTex  x  
@article{ 10.1109/TPDS.2007.70771, author = {Xing Jin and Wanqing Tu and S.H. Gary Chan}, title = {Scalable and Efficient EndtoEnd Network Topology Inference}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {19}, number = {6}, issn = {10459219}, year = {2008}, pages = {837850}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2007.70771}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Scalable and Efficient EndtoEnd Network Topology Inference IS  6 SN  10459219 SP837 EP850 EPD  837850 A1  Xing Jin, A1  Wanqing Tu, A1  S.H. Gary Chan, PY  2008 KW  Network topology KW  Network monitoring KW  Internet Applications VL  19 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[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. 131145, 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. 14561471, Oct. 2002.
[3] S. Banerjee, B. Bhattacharjee, and C. Kommareddy, “Scalable Application Layer Multicast,” Proc. ACM SIGCOMM '02, pp. 205217, 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. 7384, 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.97108, 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. 243248, Nov. 2002.
[7] F. Wang and L. Gao, “On Inferring and Characterizing Internet Routing Policies,” Proc. ACM Internet Measurement Workshop (IMW'03), pp. 1526, Oct. 2003.
[8] M. Coates, R. Castro, R. Nowak, M. Gadhiok, R. King, and Y. Tsang, “Maximum Likelihood Network Topology Identification from EdgeBased Unicast Measurements,” Proc. ACM SIGMETRICS '02, pp. 1120, 2002.
[9] M. Coates, A. Hero, R. Nowak, and B. Yu, “Internet Tomography,” IEEE Signal Processing Magazine, vol. 19, no. 3, pp. 4765, May 2002.
[10] Traceroute, http:/www.traceroute.org/, 2007.
[11] M. Kwon and S. Fahmy, “TopologyAware Overlay Networks for Group Communication,” Proc. 12th ACM Int'l Workshop Network and Operating Systems Support for Digital Audio and Video (NOSSDAV '02), pp. 127136, May 2002.
[12] J. Han, D. Watson, and F. Jahanian, “Topology Aware Overlay Networks,” Proc. IEEE INFOCOM '05, pp. 25542565, Mar. 2005.
[13] X. Jin, Y. Wang, and S.H.G. Chan, “Fast Overlay Tree Based on Efficient EndtoEnd Measurements,” Proc. IEEE Int'l Conf. Comm. (ICC '05), pp. 13191323, May 2005.
[14] X. Jin, Q. Xia, and S.H.G. Chan, “A CostBased Evaluation of EndtoEnd Network Measurements in Overlay Multicast,” Proc. IEEE INFOCOM MiniSymposium '07, June 2007.
[15] X. Jin, W.P.K. Yiu, S.H.G. Chan, and Y. Wang, “Network Topology Inference Based on EndtoEnd Measurements,” IEEE J.Selected Areas in Comm., vol. 24, no. 12, pp. 21822195, Dec. 2006.
[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. 8391, 2001.
[17] S.Y. Shi and J.S. Turner, “Routing in Overlay Multicast Networks,” Proc. IEEE INFOCOM '02, pp. 12001208, June 2002.
[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 LargeScale Topology Discovery,” Proc. ACM SIGMETRICS '05, pp. 327338, June 2005.
[20] B. Donnet, P. Raoult, T. Friedman, and M. Crovella, “Deployment of an Algorithm for LargeScale Topology Discovery,” IEEE J.Selected Areas in Comm., vol. 24, no. 12, pp. 22102220, Dec. 2006.
[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. 13711380, Mar. 2000.
[23] N. Spring, R. Mahajan, and D. Wetherall, “Measuring ISP Topologies with Rocketfuel,” Proc. ACM SIGCOMM '02, pp. 133145, 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. 517, 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.
[26] B. Yao, R. Viswanathan, F. Chang, and D.G. Waddington, “Topology Inference in the Presence of Anonymous Routers,” Proc. IEEE INFOCOM '03, pp. 353363, Apr. 2003.
[27] M. Faloutsos, P. Faloutsos, and C. Faloutsos, “On PowerLaw Relationships of the Internet Topology,” Proc. ACM SIGCOMM '99, pp. 251262, Sept. 1999.
[28] T.S.E. Ng and H. Zhang, “Predicting Internet Network Distance with CoordinatesBased Approaches,” Proc. IEEE INFOCOM '02, pp. 170179, June 2002.
[29] F. Dabek, R. Cox, F. Kaashoek, and R. Morris, “Vivaldi: A Decentralized Network Coordinate System,” Proc. ACM SIGCOMM '04, pp. 1526, Aug. 2004.
[30] X. Jin, Q. Xia, and S.H.G. Chan, “A Distributed Approach to EndtoEnd 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 EndtoEnd Network Topology Inference,” Proc. IEEE Int'l Conf. Comm. (ICC '07), June 2007.
[32] X. Zhang, J. Liu, B. Li, and T.S.P. Yum, “CoolStreaming/DONet: A DataDriven Overlay Network for PeertoPeer Live Media Streaming,” Proc. IEEE INFOCOM '05, pp. 21022111, Mar. 2005.
[33] Z. Fei and M. Yang, “A Proactive Tree Recovery Mechanism forResilient Overlay Multicast,” IEEE/ACM Trans. Networking, vol. 15, no. 1, pp. 173186, Feb. 2007.
[34] K. Sripanidkulchai, A. Ganjam, B. Maggs, and H. Zhang, “The Feasibility of Supporting LargeScale Live Streaming Applications with Dynamic Application EndPoints,” Proc. ACM SIGCOMM '04, pp. 107120, Aug. 2004.
[35] G. Tan and S.A. Jarvis, “Improving the Fault Resilience of Overlay Multicast for Media Streaming,” IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 6, pp. 721734, June 2007.
[36] V.N. Padmanabhan and L. Subramanian, “An Investigation of Geographic Mapping Techniques for Internet Hosts,” Proc. ACM SIGCOMM '01, pp. 173185, 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. 197212, Oct. 2000.
[38] E. Zegura, K. Calvert, and S. Bhattacharjee, “How to Model an Internetwork,” Proc. IEEE INFOCOM '96, pp. 594602, Mar. 1996.
[39] PlanetLab, http:/www.planetlab.org, 2007.