Current routing algorithms in the IP internet provide either a single path between each source-destination pair or paths of equal length in cases where more than one path is provided. The issue with single-path routing is that it is inherently slow in responding to congestion and temporary traffic bursts. Multiple paths are better suited for congestion, but they can suffer from the and problems, which are debilitating to network performance.
Scientists at the University of California, Santa Cruz have developed a novel distributed routing algorithm for computing multiple paths that does not require equal length between each source-destination pair in a computer network. As a result, the paths are loop-free at every instant in steady state mode as well as during network transitions, equating to faster speeds in response to congestion.
|United States Of America||Issued Patent||7,203,191||04/10/2007||2000-355|
Multi-path routing, network routing, internet routing, router, network congestion, Cat3