By Topic

Space-stretch tradeoff optimization for routing in Internet-like graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Tang, Mingdong ; Schoool of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan, Hunan, China.; Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, Suzhou, China ; Zhang, Guoqiang ; Liu, Jianxun

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. Studies on complex networks have uncovered that most real-world networks exhibit power-law degree distributions, i.e., a few nodes have very high degrees while many other nodes have low degrees. High-degree nodes play the crucial role of hubs in communication and inter-networking. Based on this fact, we propose two highest-degree landmark based compact routing schemes, namely HDLR and HDLR+. Theoretical analysis on random power-law graphs shows that the two schemes can achieve better spacestretch trade-offs than previous compact routing schemes. Simulations conducted on random power-law graphs and real-world AS-level Internet graph validate the effectiveness of our schemes.

Published in:

Communications and Networks, Journal of  (Volume:14 ,  Issue: 5 )