Relevant Links
Press Release
Research Paper
Media Contact
Keywords
Networks, routing, algorithms
Buzz
COMPUTING RESEARCH HIGHLIGHT OF THE WEEK [Oct 24-31, 2008]
New Algorithm Significantly Boosts Routing Efficiency of Networks
A time-and-money-saving question shared by commuters in their cars and networks sharing ever-changing Internet resources is: "What's the best way to get from here to there?"
A new algorithm developed by computer scientists from UC San Diego’s Jacobs School of Engineering helps answer that question, at least for computer networks; and it promises to significantly boost the efficiency of network routing. Called XL, for approximate link state, the algorithm increases network routing efficiency by suppressing updates from parts of the system -- updates which force connected networks to continuously re-calculate the paths they use in the great matrix of the Internet.
The new algorithm reduces the "communication overhead" of route computation by an order of magnitude, making it much easier to support larger networks and improve the performance of networks made up of low-power devices of slow links.
Researchers:
Kirill Levchenko, Geoffrey M. Voelker, Ramamohan Paturi and Stefan Savage
Research support provided by:
National Science Foundation
‹ Current Highlight | Past Highlights ›
Computing Research Highlight of the Week is a service of the Computing Community Consortium and the Computing Research Association designed to highlight some of the exciting and important recent research results in the computing fields. Each week a new highlight is chosen by CRA and CCC staff and volunteers from submissions from the computing community. Want your research featured? Submit it!.
