Name
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. 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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/JCN.2012.00013 | Journal of Communications and Networks |
Keywords | Field | DocType |
Memory management,Compact routing,Routing protocols,Complex networks,Internet | Multipath routing,Link-state routing protocol,Dynamic Source Routing,Computer science,Static routing,Policy-based routing,Hierarchical routing,Computer network,Destination-Sequenced Distance Vector routing,Routing protocol,Distributed computing | Journal |
Volume | Issue | ISSN |
14 | 5 | 1229-2370 |
Citations | PageRank | References |
1 | 0.46 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mingdong Tang | 1 | 9 | 4.06 |
| Guoqiang Zhang | 2 | 185 | 11.62 |
| Jianxun Liu | 3 | 640 | 67.12 |