Powernet: Compact Routing on Internet-like Random Networks

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.