Xl: an efficient network routing algorithm

Authors:
Kirill Levchenko;Geoffrey M. Voelker;Ramamohan Paturi;Stefan Savage
Affiliations:
University of California San Diego, La Jolla, CA, USA;University of California San Diego, La Jolla, CA, USA;University of California San Diego, La Jolla, CA, USA;University of California San Diego, La Jolla, CA, USA
Venue:
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Year:
2008

Citing 12
Cited 7

A loop-free extended Bellman-Ford routing protocol without bouncing effect

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A new responsive distributed shortest-path rounting algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Loop-free routing using diffusing computations

IEEE/ACM Transactions on Networking (TON)
Distributed, scalable routing based on link-state vectors

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Resilient overlay networks

SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
A case study of OSPF behavior in a large enterprise network

Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Inferring link weights using end-to-end measurements

Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Analysis of link failures in an IP backbone

Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Route Flapping Effects on OSPF

SAINT-W '03 Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT'03 Workshops)
A Performance Comparison of the Temporally-Ordered Routing Algorithm and Ideal Link-State Routing

ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
Orbis: rescaling degree correlations to generate annotated internet topologies

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Scalable routing strategies for ad hoc wireless networks

IEEE Journal on Selected Areas in Communications

OSPF for Implementing Self-adaptive Routing in Autonomic Networks: A Case Study

MACE '09 Proceedings of the 4th IEEE International Workshop on Modelling Autonomic Communications Environments
A distributed routing architecture for secure communication over highly dynamic radio networks

COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Scalable multi-region routing at inter-domain level

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
California fault lines: understanding the causes and impact of network failures

Proceedings of the ACM SIGCOMM 2010 conference
Scalable routing on flat names

Proceedings of the 6th International COnference
An efficient critical protection scheme for intra-domain routing using link characteristics

Computer Networks: The International Journal of Computer and Telecommunications Networking
Aspen trees: balancing data center fault tolerance, scalability and cost

Proceedings of the ninth ACM conference on Emerging networking experiments and technologies

Quantified Score

Hi-index	0.00

Visualization

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.