Space-Stretch Tradeoff Optimization for Routing in Internet-Like Graphs

Journal of Communications and Networks

Volumn 14, Issue 5, 2012, Pages 546-553

  Tang, Mingdong ^a,b   Liu, Jianxun ^a   Zhang, Guoqiang ^b,c  

^a HUNAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b SOOCHOW UNIVERSITY   (China)

^c NANJING NORMAL UNIVERSITY   (China)

Author keywords

Compact routing; power law networks; routing scheme; routing table size; stretch; trade off

Indexed keywords

EID: 85008538330     PISSN: 12292370     EISSN: None     Source Type: Journal    
DOI: 10.1109/JCN.2012.00013     Document Type: Article

References (31)

1. L. Cowen, “Compact routing with minimum stretch,” J. Algorithms, vol. 38, no. 1, pp. 170–183, 2001.
2. M. Thorup and U. Zwick, “Compact routing schemes,” in Proc. SPAA, 2001, pp. 1–10.
3. C. Gavoille and M. Gengler, “Space-Efficiency for routing schemes of stretch factor three,” J. Parallel Distrib. Comput., vol. 61, no. 5, pp. 679–687, 2001.
4. P. Fraigniaud and C. Gavoille, “Routing in trees,” in Proc. ICALP, 2001, pp. 757–772.
5. K. A. Laing, “Name-independent compact routing in trees,” Inf. Process. Lett., vol. 103, no. 2, pp. 57–60, 2007.
6. H. Lu, “Improved compact routing tables for planar networks via orderly spanning trees,” in Proc. COCOON, 2002, pp. 57–66.
7. I. Abraham and D. Malkhi, “Name independent routing for growth bounded networks,” in Proc. SPAA, 2005, pp. 49–55.
8. G. Konjevod, A. Richa, and D. Xia, “Optimal scale-free compact routing schemes in networks of low doubling dimension,” in Proc. ACM-SIAM SODA, 2007, pp. 939–948.
9. I. Abraham, C. Gavoille, A. V. Goldberg, and D. Malkhi, “Routing in networks with low doubling dimension,” in Proc. ICDCS, 2006.
10. M. Faloutsos, P. Faloutsos, and C. Faloutsos, “On power-law relationships of the Internet topology,” Comput. Commun. Rev., vol. 29, pp. 251–262, 1999.
11. G. Q. Zhang, B. Quoitin, and S. Zhou, “Phase changes in the evolution of the IPv4 and IPv6 AS-level Internet topologies,” Comput. Commun., vol. 34, pp. 649–657, 2011.
12. M. Ripeanu, A. Iarmnitchi, and I. Foster, “Mapping the Gnutella network,” IEEE Internet Comput., pp. 50–57, Jan. 2002.
13. R. Albert, H. Jeong, and A. L. Barabasi, “Diameter of the world wide web,” Nature, vol. 401, pp. 130–131, 1999.
14. D. Krioukov, K. Fall, and X. Yang, “Compact routing on Internet-like graphs,” in Proc. IEEE INFOCOM, 2004, pp. 209–219.
15. A. Brady and L. Cowen, “Compact routing on power law graphs with additive stretch,” in Proc. ALENEX, 2006, pp. 119–128.
16. S. Carmi, R. Cohen, and D. Dolev, “Searching complex networks efficiently with minimal information,” Europhysics Lett., vol. 74, pp. 1102–1108, 2006.
17. M. Enachescu, M. Wang, and A. Goel, “Reducing maximum stretch in compact routing,” in Proc. IEEE INFOCOm, 2008, pp. 977–985.
18. I. Norros, “Powernet: Compact routing on Internet-like random networks,” in Proc. NGI, Aveiro, 2009.
19. D. Meyer, L. Zhang, and K. Fall, “Report from the IAB workshop on routing and addressing,” The Internet Architecture Board, 2007.
20. G. Huston. (2001. Mar.). Analyzing the Internet's Bgp routing table. Internet Protocol J. 4 (1). [Online]. Available: http://www.cisco.com/web/about/ac123/ac147/archived-issues/ipj-4-1/bgp-routing-table.html
21. D. Krioukov and K. Claffy, “On compact routing for the Internet,” ACM SIGCOMM Comput. Commun. Rev., vol. 37, no. 3, pp. 43–52, 2007.
22. F. Chung and L. Lu, “The average distances in random graphs with given expected degrees,” in Proc. National Academy Sci., vol. 99, 2002, pp. 15879–15882.
23. L. Lu, “Probabilistic methods in massive graphs and Internet computing,” University of California San Diego, 2002.
24. T. Eilam, C. Gavoille, and D. Peleg, “Compact routing schemes with low stretch factor,” in Proc. ACM PODC, Puerto Vallarta, Mexico, 1998, pp. 11–20.
25. M. Thorup and U. Zwick, “Approximate distance oracles,” in Proc. ASM STOC, 2001.
26. A. Barabasi and R. Albert, “Emergence of scaling in random network,” Science, vol. 286, pp. 509–512, 1999.
27. G. Q. Zhang, G. Q. Zhang, Q. F. Yang, S. Q. Cheng, and T. Zhou. (2008, Dec.). Evolution of the Internet and its cores. New J. Phys. [Online]. 10 (12). Available: http://iopscience.iop.org/1367-2630/10/12/123027
28. CAIDA's Skitter project. CAIDA. [Online]. Available: http://www.caida.org/tools/measurement/skitter/
29. W. Chen, C. Sommer, S. H. Teng, and Y. Wang, “Compacting routing in power-law graphs,” in Proc. DISC, Sept. 2009.
30. I. Norros and H. Reittu, “Network models with a ‘soft hierarchy’: A random graph construction with loglog scalability,” IEEE Netw., vol. 22, no. 2, pp. 40–46, 2008.
31. S. Zhou and R. J. Mondragon, “The rich-club phenomenon in the Internet topology,” IEEE Commun. Lett., vol. 3, pp. 180–182, 2004.