Mpath: A Loop-Free Multipath Routing Algorithm Using Predecessor Information

Tech ID: 10191 / UC Case 2000-355-0

BACKGROUND

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. However, single-path routing is inherently slow in responding to congestion and temporary traffic bursts. Multiple paths are better suited to congestion, but can suffer from the bouncing effect and counting-to-infinity problems, which can be debilitating to network performance.

DESCRIPTION

Scientists at the University of California 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.

APPLICATIONS

This UC invention has applications in several internet routing applications, such as:

Traffic load-balancing, for minimizing network delays;
Providing an alternative to MPDA.

ADVANTAGES

REFER ALSO TO UC CASES 2000-303, 2000-311, 2000-314, 2000-349 THROUGH 356, 2000-360, 2000-380, 2000-383 THROUGH 385

Patent Status

Country	Type	Number	Dated	Case
United States Of America	Issued Patent	7,203,191	04/10/2007	2000-355

Inventors

Garcia-Luna-Aceves, Jose Joaquin(JJ
Vutukury, Srinivas

Other Information

Categorized As

Communications
- Other
Computer
- Software

Related cases

2000-355-0

Contact

University of California, Santa Cruz Office for Management of Intellectual Property / technology@ucsc.edu / tel: View Phone Number. Please reference Tech ID #10191.

Request Additional Information