On Compact Routing for the Internet

Details On Compact Routing for the Internet On Compact Routing for the Internet

2007-08-17

arxiv.org/abs/0708.2309v1

ACM SIGCOMM Computer Communication Review (CCR), v.37, n.3, p.41-52, 2007

Computer Science

Networking and Internet Architecture

This is a significantly revised, journal version of cs/0508021

Scientific paper

10.1145/1273445.1273450

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.''

Affiliated with

Also associated with

No associations

Rating

On Compact Routing for the Internet does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Compact Routing for the Internet, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Compact Routing for the Internet will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-5708