An analysis of ant colony behavior could yield better algorithms for network communication, say investigators. Biologists have long suspected that ants base their population-density estimates on the ...

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.

Computer scientists have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum transport costs for ...