The problem of the scalability of inter-domain routing is of the main issues in the design of Next Generation Internet (NGI). This paper addresses the intrinsic essences of the problems created by the scalability of Internet routing by introducing the entropy routing information concept. Based on the theoretical model of entropy in routing information, potential solutions to the routing scalability problems are discussed, which focus on three different aspects with their respective benefits and limitations and their architectural evaluations on typical proposals. In the end, a conclusion on the challenges of the Internet routing scalability problem is drawn, and the direction of further research on this problem is explored. © Copyright 2011, Institute of Software, the Chinese Academy of Sciences. All rights reserved.
CITATION STYLE
Zhang, W., Bi, J., & Wu, J. P. (2011). Scalability of Internet inter-domain routing. Ruan Jian Xue Bao/Journal of Software, 22(1), 84–100. https://doi.org/10.3724/SP.J.1001.2011.03935
Mendeley helps you to discover research relevant for your work.