Affiliation:
1. University of California San Diego, La Jolla, CA, USA
Abstract
In this paper, we present a new link-state routing algorithm called Approximate Link state (XL) aimed at increasing routing efficiency by suppressing updates from parts of the network. We prove that three simple criteria for update propagation are sufficient to guarantee soundness, completeness and bounded optimality for any such algorithm. We show, via simulation, that XL significantly outperforms standard link-state and distance vector algorithms - in some cases reducing overhead by more than an order of magnitude - while having negligible impact on path length. Finally, we argue that existing link-state protocols, such as OSPF, can incorporate XL routing in a backwards compatible and incrementally deployable fashion.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Software
Reference31 articles.
1. Abilene interior-routing metrics. http://noc.net.internet2.edu March 2006. Abilene interior-routing metrics. http://noc.net.internet2.edu March 2006.
2. Resilient overlay networks
3. Distributed, scalable routing based on link-state vectors
4. A loop-free extended Bellman-Ford routing protocol without bouncing effect
5. Cisco Systems. Introduction to EIGRP. Document ID 13669. Cisco Systems. Introduction to EIGRP. Document ID 13669.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献