Abstract
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). We 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 suggested as a solution to the inflexibility of the pure C-C-D scheme. A mean-field approximation is introduced for efficient computation of relevant quantitative characteristics and applied to various problems of our scheme. We review a few recent Internet routing proposals and discuss their relation to our scheme. We find out that the topology creation of our scheme offers advantages in terms of scalability and routing policy control.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
