Abstract
Compact routing intends to achieve good tradeoff between the routing path length and the memory overhead, and is recently considered as a main alternative to overcome the fundamental scaling problems of the Internet routing system. Plenty of studies have been conducted on compact routing, and quite a few universal compact routing schemes have been designed for arbitrary network topologies. However, it is generally believed that specialized compact routing schemes for peculiar network topologies can have better performance than universal ones. Complex network research has uncovered that most real-world networks have degree distributions exhibiting power law tails, i.e., a few nodes have very high degrees while many other nodes have low degrees. High-degree nodes play a crucial role of hubs in communication and networking. Based on this fact, we put forward two highest-degree landmark based compact routing schemes, namely HDLR and HDLR + . Theoretical analysis on random power law graphs shows our schemes can achieve a better space-stretch trade-off than prior compact routing schemes. Simulations conducted on random power law graphs and real-world AS-level Internet graph validate the effectivity of our schemes.
Chapter PDF
Similar content being viewed by others
References
Thorup, M., Zwick, U.: Compact routing schemes. In: 13th ACM Symposium on Parallel Algorithms and Architecture, pp. 1–10. ACM Press, New York (2001)
Cowen, L.: Compact routing with minimum stretch. Journal of Algorithms 38(1), 170–183 (2001)
Gavoille, C., Gengler, M.: Space-Efficiency for routing schemes of stretch factor three. Journal of Parallel and Distributed Computing 61(5), 679–687 (2001)
Fraigniaud, P., Gavoille, C.: Routing in trees. In: Yu, Y., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 757–772. Springer, Heidelberg (2001)
Laing, K.A.: Name-independent compact routing in trees. Information Processing Letters 103(2), 57–60 (2007)
Lu, H.: Improved compact routing tables for planar networks via orderly spanning trees. In: 8th International Computing and Combinatorics Conference, pp. 57–66. Springer, Heidelberg (2002)
Abraham, I., Malkhi, D.: Name independent routing for growth bounded networks. In: 17th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2005), pp. 49–55. ACM Press, New York (2005)
Konjevod, G., Richa, A., Xia, D.: Optimal scale-free compact routing schemes in networks of low doubling dimension. In: 18th ACM-SIAM Symposium on Discrete Algorithms, pp. 939–948. ACM Press, New York (2007)
Abraham, I., Gavoille, C., Goldberg, A.V., Malkhi, D.: Routing in networks with low doubling dimension. In: 26th International Conference on Distributed Computing Systems. IEEE Computer Society, Washington, DC (2006)
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the Internet topology. Computer Communications Review 29, 251–262 (1999)
Ripeanu, M., Iarmnitchi, A., Foster, I.: Mapping the Gnutella network. IEEE Internet Computing, 50–57 (2002)
Albert, R., Jeong, H., Barabasi, A.L.: Dimeter of the world wide web. Nature 401, 130–131 (1999)
Krioukov, D., Fall, K., Yang, X.: Compact routing on Internet-like graphs. In: IEEE INFOCOM 2004, IEEE Computer Society, Washington, DC (2004)
Brady, A., Cowen, L.: Compact routing on power law graphs with additive stretch. In: 8th Workshop on Algorithm Engineering and Experiments, pp. 119–128. SIAM, Philadelphia (2006)
Carmi, S., Cohen, R., Dolev, D.: Searching complex networks efficiently with minimal information. Europhysics Letters 74, 1102–1108 (2006)
Enachescu, M., Wang, M., Goel, A.: Reducing maximum stretch in compact routing. In: IEEE INFOCOM 2008, pp. 977–985. IEEE Computer Society, Washington, DC (2008)
Norros, I.: Powernet: compact routing on Internet-like random networks. In: 5th Euro-NGI Conference on Next Generation Internet Networks. IEEE Press, New York (2009)
Meyer, D., Zhang, L., Fall, K.: Report from the IAB workshop on routing and addressing. RFC4984 (2007)
Huston, G.: Analyzing the Internet’s BGP routing table. The Internet Protocol Journal 4(1) (2001)
Krioukov, D., Claffy, K.: On compact routing for the Internet. ACM SIGCOMM Computer Communication Review 37(3), 43–52 (2007)
Chung, F., Lu, L.: The average distances in random graphs with given expected degrees. Internet Mathematics 1, 15879–15882 (2002)
Lu, L.: Probabilistic methods in massive graphs and Internet computing. Ph D thesis, University of California San Diego (2002)
Eilam, T., Gavoille, C., Peleg, D.: Compact routing schemes with low stretch factor. In: 17th Annual ACM Symposium on Principles of Distributed Computing, pp. 11–20. ACM Press, New York (1998)
Thorup, M., Zwick, U.: Approximate distance oracles. In: ACM Symposium on Theory of Computing, pp. 183–192. ACM Press, New York (2001)
Barabasi, A., Albert, R.: Emergence of scaling in random network. Science 286, 509 (1999)
Zhang, G.Q., Zhang, G.Q., Yang, Q.F., Cheng, S.Q., Zhou, T.: Evolution of the Internet and its cores. New Journal of Physics 10, 123027 (2008)
Zhou, S., Mondragon, R.J.: The rich-club phenomenon in the Internet topology. IEEE Communications Letters 3, 180–182 (2004)
Chen, W., Sommer, C., Teng, S.-H., Wang, Y.: Compacting routing in power-law graphs. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 379–391. Springer, Heidelberg (2009)
CAIDA, http://www.caida.org
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 IFIP International Federation for Information Processing
About this paper
Cite this paper
Tang, M., Liu, J., Zhang, G. (2011). Improved Compact Routing Schemes for Power-Law Networks. In: Altman, E., Shi, W. (eds) Network and Parallel Computing. NPC 2011. Lecture Notes in Computer Science, vol 6985. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24403-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-24403-2_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24402-5
Online ISBN: 978-3-642-24403-2
eBook Packages: Computer ScienceComputer Science (R0)