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...
Showing results 1 to 3 of 3
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.
Shelton Waggener, the CIO of the University of California at Berkeley, explains how student devices are put through a "computer hygiene" program.
The best of ZDNet, delivered
- 1 Windows 10: You've got questions, I've got answers
- 2 Perfectly legal ways you can still get Windows 7 cheap (or even free)
- 3 Hands-on with Windows 10: Installing the latest Technical Preview
- 4 31 ways to improve your iPhone's battery life
- 5 How much does an iPhone 6 really cost? (Hint: It's way more than $199)