Uc+network

Showing results 1 to 3 of 3

New algorithm speeds up networks

Routing scalability has always been a problem in networking research. Now, computer scientists at UC San Diego (UCSD) have developed a new algorithm to improve the routing efficiency of networks. '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 results presented today at the ACM SIGCOMM Conference show that XL outperforms standard algorithms, in some cases reducing the number of routing messages ten-fold. But read more...

August 19, 2008 by

Internet maps are blooming

It is important to understand network topology to predict its performance and its resilience to attacks. This is why computer scientists at UC San Diego have developed new algorithms which create Internet maps. Their maps -- looking like digital dandelions -- show Internet nodes and their linkages. But they are -- mostly -- randomly generated graphs that describe the characteristics of a specific corner of the Internet but double or triple the number of nodes. These algorithms, which you soon will be able to download, should also improve the scalability of network protocols and applications.

September 1, 2007 by

The best of ZDNet, delivered

You have been successfully signed up. To sign up for more newsletters or to manage your account, visit the Newsletter Subscription Center.
Subscription failed.

Top Stories