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.

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 ...

A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...

The energy costs of IT equipment have become a major concern, leading to a variety of creative ideas about how to keep power use in check. Most of the challenge has been finding ways to make sure that ...