Featured Research

from universities, journals, and other organizations

New Algorithm Significantly Boosts Routing Efficiency Of Networks

Date:
August 22, 2008
Source:
University of California - San Diego
Summary:
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?"

The XL algorithm developed by computer scientists at UC San Diego significantly outperforms standard link-state and distance-vector algorithms, speeding routing in computer and communications networks.
Credit: Image courtesy of University of California - San Diego

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 at the University of California, San Diego 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.

“Routing in a static network is trivial,” say the authors in their paper, which will be presented at this week’s ACM SIGCOMM conference. “But most real networks are dynamic – network links go up and down – and thus some nodes need to recalculate their routes in response.”

The traditional approach, said Stefan Savage, professor of computer science at UC San Diego, “is to tell everyone; flood the topology change throughout the network and have each node re-compute its table of best routes – but that requirement to universally communicate, and to act on each change, is a big problem.”

What the team did with their new routing algorithm, according to Savage’s student Kirill Levchenko, was to reduce the “communication overhead” of route computation – by an order of magnitude.

“Being able to adapt to hardware failures is one of the fundamental characteristics of the Internet,” Levchenko said. “Our routing algorithm reduces the overhead of route re-computation after a network change, making it possible to support larger networks. The benefits are especially significant when networks are made up of low-power devices of slow links.”

The real technical innovation of their work, said another of the authors, Geoffrey M. Voelker, “is in how information about changes in the network is propagated. The XL routing algorithm propagates only some updates, reducing the number of updates sent through the network.”

They meet the “central challenge” of determining which updates are important and which can be suppressed by using three rules for update propagation, said team member Ramamohan Paturi. “The rules ensure that selected routes are nearly as good as if complete information about the network were available,” he said, “but at a fraction of the overhead required for maintaining such a state of perfect knowledge.”

The computer scientists also believe that there are “significant opportunities” to improve the efficiency of link-state routing even further. They look forward to discovering an algorithm that improves on their Approximate Link work with similar boosts in efficiency.

Grants from the National Science Foundation helped support the team’s research.


Story Source:

The above story is based on materials provided by University of California - San Diego. Note: Materials may be edited for content and length.


Cite This Page:

University of California - San Diego. "New Algorithm Significantly Boosts Routing Efficiency Of Networks." ScienceDaily. ScienceDaily, 22 August 2008. <www.sciencedaily.com/releases/2008/08/080818184257.htm>.
University of California - San Diego. (2008, August 22). New Algorithm Significantly Boosts Routing Efficiency Of Networks. ScienceDaily. Retrieved July 31, 2014 from www.sciencedaily.com/releases/2008/08/080818184257.htm
University of California - San Diego. "New Algorithm Significantly Boosts Routing Efficiency Of Networks." ScienceDaily. www.sciencedaily.com/releases/2008/08/080818184257.htm (accessed July 31, 2014).

Share This




More Computers & Math News

Thursday, July 31, 2014

Featured Research

from universities, journals, and other organizations


Featured Videos

from AP, Reuters, AFP, and other news services


Search ScienceDaily

Number of stories in archives: 140,361

Find with keyword(s):
Enter a keyword or phrase to search ScienceDaily for related topics and research stories.

Save/Print:
Share:

Breaking News:
from the past week

In Other News

... from NewsDaily.com

Science News

Health News

Environment News

Technology News



    Save/Print:
    Share:

    Free Subscriptions


    Get the latest science news with ScienceDaily's free email newsletters, updated daily and weekly. Or view hourly updated newsfeeds in your RSS reader:

    Get Social & Mobile


    Keep up to date with the latest news from ScienceDaily via social networks and mobile apps:

    Have Feedback?


    Tell us what you think of ScienceDaily -- we welcome both positive and negative comments. Have any problems using the site? Questions?
    Mobile: iPhone Android Web
    Follow: Facebook Twitter Google+
    Subscribe: RSS Feeds Email Newsletters
    Latest Headlines Health & Medicine Mind & Brain Space & Time Matter & Energy Computers & Math Plants & Animals Earth & Climate Fossils & Ruins