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.
Source: University of California - San Diego
Related stories:
Digital Dandelions
What looks like the head of a digital dandelion is a map of the Internet generated by new algorithms from computer scientists at UC San Diego. This map features Internet nodes – the red dots – and linkages – the green lines. But it is no ordinary map. It is a (mostly) randomly generated graph that retains the essential characteristics of a specific corner of the Internet but doubles the number of nodes.
Nature offers guidance on organising dynamic networks
Today, for many, computer networks are an indispensable infrastructure that interconnects people, places and organisations. But increasingly they are beginning to creak as their complexity grows. Biological systems through years of evolution can offer clues on how to cope, as a research project has demonstrated.
Bell Labs Researchers Push The Limits of Mobile Computing
Researchers from
Lucent Technologies'
Bell Labs are presenting two papers based on innovative research this week at MobiCom 2004 in Philadelphia, the premier international forum for mobile computing and wireless
networking. First, they'll describe a method for dynamically improving how data packets are routed through a wireless network by modifying its topology in response to changing traffic patterns and user demand. Next, they'll describe how the performance of wireless local area networks (
WLANs) can be greatly improved by seamlessly shifting users from heavily loaded to lightly loaded access points - thereby relieving network congestion and increasing the number of users that can access the network at any given time. Both of the approaches described at the conference hold the promise of
improving the performance, reliability and availability of wireless communications. This work is yet another example of how Lucent continues to push the envelope and lead the evolution towards high-speed mobile data.
Professor Finally Publishes Controversial Brain Theory
(PhysOrg.com) -- In the late '90s, Asim Roy, a professor of information systems at Arizona State University, began to write a paper on a new brain theory. Now, 10 years later and after several rejections and resubmissions, the paper “Connectionism, Controllers, and a Brain Theory” has finally been published in the November issue of
IEEE Transactions on Systems, Man, and Cybernetics – Part A: Systems and Humans.
'Six Degrees of Kevin Bacon' game provides clue to efficiency of complex networks
As the global population continues to grow exponentially, our social connections to one another remain relatively small, as if we're all protagonists in the Kevin Bacon game inspired by "Six Degrees of Separation," a Broadway play and Hollywood feature that were popular in the 1990s.
Light-speed computer connection will slash genetic data transfer time between TGen-ASU
Hot on the heels of a new supercomputer, plans for a new light-speed data line between the Translational Genomics Research Institute and Arizona State University could slash the time is takes to transfer genetic information.
Harnessing network anarchy for the common good
(PhysOrg.com) -- Anarchy may be the bane of political conservatives, but on the internet it is the essence of the information superhighway.
Simulator allows scientists to predict evolution’s next best move
(PhysOrg.com) -- Biologists today are doing what Darwin thought impossible. They are studying the process of evolution not through fossils but directly, as it is happening. Now, by modeling the steps evolution takes to build, from scratch, an adaptive biochemical network, biophysicists Eric D. Siggia and Paul Francois at Rockefeller University have gone one step further. Instead of watching evolution in action, they show that they can predict its next best move.
