A critical point for random graphs with a given degree sequence
Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
ACM SIGCOMM Computer Communication Review
DNS performance and the effectiveness of caching
IEEE/ACM Transactions on Networking (TON)
Advances in Network Simulation
Computer
Power laws and the AS-level internet topology
IEEE/ACM Transactions on Networking (TON)
Percolation Search in Power Law Networks: Making Unstructured Peer-to-Peer Networks Scalable
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
HLP: a next generation inter-domain routing protocol
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
A clean slate 4D approach to network control and management
ACM SIGCOMM Computer Communication Review
Scalable percolation search on complex networks
Theoretical Computer Science - Complex networks
Design and implementation of a routing control platform
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Scaling IP Routing with the Core Router-Integrated Overlay
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Using forgetful routing to control BGP table size
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
| Hi-index | 0.00 |
The uncontrollable growth of the Internet, breaking through meshing and multi-homing practices the existing topology-based prefix aggregation mechanisms, creates the necessity of revisiting some fundamental aspects in the inter-domain routing model due to severe scalability issues in routing table size. In this paper, we at first analyze the root causes of these problems and then exploit a promising solution based on on-demand routing and on a widely known uniform caching and searching algorithm. Such algorithm is based on bond percolation, a mathematical phase transition model well-suited for random walk searches in power law networks, automatically shielding nodes with limited connectivity from large traffic volumes and reducing the total traffic to scale sub-linearly with the network size. The proposed solution introduces limited modifications to the BGP protocol, ensuring backward compatibility and allowing gradual deployment throughout the Internet. It dramatically reduces the routing table size requirements in all the nodes participating to the search network while allowing reliable and efficient on-demand discovery of unknown routing information, as demonstrated through extensive simulation experiments.