An Information-Theoretic Approach to Routing Scalability
Gábor Rétvári, Dávid Szabó, András Gulyás, Attila Kő̈rösi, János Tapolcai · 2014
Many of our computer networks, not the least of which the Internet, are built upon hop-by-hop routing. At the moment, it is not clear whether we will be able to scale these networks into the future economically. In this paper, we propose a new information-theoretic model to study routing scalability, we present preliminary analysis suggesting that hop-by-hop routing tolerates network growth surprisingly efficiently, and we sketch the scalability map of the Internet which we then use to make some bold predictions.