On compact routing for the internet
ACM SIGCOMM Computer Communication Review
Network models with a 'soft hierarchy': a random graph construction with loglog scalability
IEEE Network: The Magazine of Global Internetworking
Improved compact routing schemes for power-law networks
NPC'11 Proceedings of the 8th IFIP international conference on Network and parallel computing
HDLBR: A name-independent compact routing scheme for power-law networks
Computer Communications
| Hi-index | 0.00 |
It is generally recognized that the current routing scheme of Internet suffers from serious scalability problems. In this paper, we work with the abstract but 'Internet-like' network model consisting of an infinite-variance power-law random graph (IVPLRG) and adopt the idea of a routing scheme proposed by Carmi, Cohen and Dolev (C-C-D). The scheme fits very naturally to the spontaneously emerging 'soft hierarchy' architecture on an IVPLRG. The use of multiple addresses is studied as a solution to the inflexibility of the pure C-C-D scheme. A new mean-field methodology is introduced for the efficient computation of relevant quantitative characteristics.