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.

A team of computer scientists has proposed a new algorithm that makes routers operate more efficiently by automatically limiting the number of network route or link-state updates they receive. The ...

The algorithm could be important in large heterogeneous corporate networks where the oldest, slowest routers make all the others wait while they absorb updates and recalculate their path tables. The ...