Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2670518.2673863 | HotNets |
Keywords | Field | DocType |
forwarding table,data compression,hop-by-hop routing,store and forward networks,entropy,internet scalability | Multipath routing,Link-state routing protocol,Dynamic Source Routing,Computer science,Hierarchical routing,Policy-based routing,Static routing,Computer network,Routing Information Protocol,Routing protocol,Distributed computing | Conference |
Citations | PageRank | References |
0 | 0.34 | 14 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gábor Rétvári | 1 | 194 | 24.87 |
| Dávid Szabó | 2 | 10 | 2.92 |
| András Gulyás | 3 | 134 | 23.05 |
| Attila Korösi | 4 | 20 | 4.16 |
| János Tapolcai | 5 | 364 | 41.42 |