Realizing Compact Routing Scheme by Message Passing

The Internet´s routing system is facing strong stresses due to the rapid growth of Internet scaling and its poor fundamental scaling properties. Compact routing may be a good research field that can resolve the limits of routing scalability and design. In this paper, we devise a kind of compact routing scheme for the structure of the Internet AS graph. The routing scheme is based on message passing. Using random walk on networks derives an effective similarity measure between nodes. The nodes send message to each other via message passing, which can be seen as a support for leaders. When the algorithm reaches to convergence, some leader nodes will be emerged and ordinary nodes will know their leader nodes. In the compact routing system, these leader nodes are called landmarks in the network. We also propose a cluster for each node in the network. When a packet reaches to a node, if the destination node is in the cluster of the node, the packet will be delivered along a shortest path; else the packet will be delivered firstly to the landmark of the destination node. The last work in our paper is to apply our compact routing scheme on the AS graph and give the simulation result.