Distributed, scalable routing based on link-state vectors
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
An analysis of BGP convergence properties
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Compact routing with minimum stretch
Journal of Algorithms
Space-efficiency for routing schemes of stretch factor three
Journal of Parallel and Distributed Computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Delayed Internet routing convergence
IEEE/ACM Transactions on Networking (TON)
Analysis of the MED Oscillation Problem in BGP
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Compact routing with name independence
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
The impact of address allocation and routing on the structure and implementation of routing tables
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Compact name-independent routing with minimum stretch
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
A space lower bound for name-independent compact routing in trees
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
HLP: a next generation inter-domain routing protocol
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Metric Embeddings with Relaxed Guarantees
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The internet AS-level topology: three data sources and one definitive metric
ACM SIGCOMM Computer Communication Review
On space-stretch trade-offs: lower bounds
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Routing in Networks with Low Doubling Dimension
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Algorithms on negatively curved spaces
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Dynamic routing schemes for general graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Accountable internet protocol (aip)
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
A compact routing architecture for mobility
Proceedings of the 3rd international workshop on Mobility in the evolving internet architecture
Black boxes: making ends meet in data driven networking
Proceedings of the 3rd international workshop on Mobility in the evolving internet architecture
On the scalability of BGP: the roles of topology growth and update rate-limiting
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Design considerations for a network of information
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Graph annotations in modeling complex network topologies
ACM Transactions on Modeling and Computer Simulation (TOMACS)
On hierarchical routing in wireless sensor networks
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
HAIR: hierarchical architecture for internet routing
Proceedings of the 2009 workshop on Re-architecting the internet
A stochastic clustering algorithm for swarm compact routing
NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
Powernet: compact routing on Internet-like random networks
NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
A compact routing scheme with lower stretch
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
Scalable support of interdomain routes in a single AS
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Novel topological framework for adaptive routing
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Forbidden-set distance labels for graphs of bounded doubling dimension
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On the scalability of BGP: the role of topology growth
IEEE Journal on Selected Areas in Communications - Special issue title on scaling the internet routing system: an interim report
An Internet without the Internet protocol
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scalable routing on flat names
Proceedings of the 6th International COnference
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
Scalable Uniform Graph Sampling by Local Computation
SIAM Journal on Scientific Computing
Simulating Routing Schemes on Large-Scale Topologies
PADS '10 Proceedings of the 2010 IEEE Workshop on Principles of Advanced and Distributed Simulation
Improved compact routing schemes for power-law networks
NPC'11 Proceedings of the 8th IFIP international conference on Network and parallel computing
Address-based route reflection
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
A case for hierarchical routing in low-power wireless embedded networks
ACM Transactions on Sensor Networks (TOSN)
HDLBR: A name-independent compact routing scheme for power-law networks
Computer Communications
A survey and taxonomy of ID/Locator Split Architectures
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.01 |
The Internet's routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing scalability and designs algorithms that try to meet these limits. In particular, compact routing research shows that shortest-path routing, forming a core of traditional routing algorithms, cannot guarantee routing table (RT) sizes that on all network topologies grow slower than linearly as functions of the network size. However, there are plenty of compact routing schemes that relax the shortest-path requirement and allow for improved, sublinear RT size scaling that is mathematically provable for all static network topologies. In particular, there exist compact routing schemes designed for grids, trees, and Internet-like topologies that offer RT sizes that scale logarithmically with the network size. In this paper, we demonstrate 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 RT 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.