On Compact Routing for the Internet
| dc.creator | Krioukov, Dmitri | |
| dc.creator | claffy, kc | |
| dc.creator | Fall, Kevin | |
| dc.creator | Brady, Arthur | |
| dc.date | 2007-08-17 | |
| dc.date.accessioned | 2026-07-07T09:32:34Z | |
| dc.date.available | 2026-07-07T09:32:34Z | |
| dc.description | While there exist compact routing schemes designed for grids, trees, and Internet-like topologies that offer routing tables of sizes that scale logarithmically with the network size, we demonstrate in this paper that in view of recent results in compact routing research, such logarithmic scaling on Internet-like topologies is fundamentally impossible in the presence of topology dynamics or topology-independent (flat) addressing. We use analytic arguments to show that the number of routing control messages per topology change cannot scale better than linearly on Internet-like topologies. We also employ simulations to confirm that logarithmic routing table size scaling gets broken by topology-independent addressing, a cornerstone of popular locator-identifier split proposals aiming at improving routing scaling in the presence of network topology dynamics or host mobility. These pessimistic findings lead us to the conclusion that a fundamental re-examination of assumptions behind routing models and abstractions is needed in order to find a routing architecture that would be able to scale ``indefinitely.'' | |
| dc.description | This is a significantly revised, journal version of cs/0508021 | |
| dc.identifier | https://arxiv.org/abs/0708.2309 | |
| dc.identifier | http://arxiv.org/abs/0708.2309 | |
| dc.identifier | ACM SIGCOMM Computer Communication Review (CCR), v.37, n.3, p.41-52, 2007 | |
| dc.identifier | doi:10.1145/1273445.1273450 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/158821 | |
| dc.subject | Networking and Internet Architecture | |
| dc.subject | C.2.2; G.2.2; C.2.1 | |
| dc.title | On Compact Routing for the Internet | |
| dc.type | text |