Improved compact routing schemes for power-law networks

  • Authors:

  • Mingdong Tang;Jianxun Liu;Guoqing Zhang

  • Affiliations:

  • Key Laboratory of Knowledge Processing and Networked Manufacturing, Hunan University of Science and Technology, Xiangtan, China and Institute of Computing Technology, Chinese Academy of Sciences, ...;Key Laboratory of Knowledge Processing and Networked Manufacturing, Hunan University of Science and Technology, Xiangtan, China;Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China

  • Venue:
  • NPC'11 Proceedings of the 8th IFIP international conference on Network and parallel computing
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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 realworld networks have degree distributions exhibiting power law tails, i.e., a few nodes have very high degrees while many other nodes have low degrees. Highdegree 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 tradeoff 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.