Routing over similar paths

Details Routing over similar paths Routing over similar paths

1998-03-13

2000-05-09

Rinehart, Mark H.

Electrical computers and digital processing systems: multicomput

Computer-to-computer data routing

Least weight routing

370406, G06F 1338, G06F 1517

Patent

active

060617365

ABSTRACT:
The routing paths are determined in a step-by-step nature. A Dijkstra algorithm is used and before labeling a link as a routing path, all possible routing paths which are within a predetermined range are compared. One of the paths in the range are chosen at random to be the routing path.

REFERENCES:
patent: 5117422 (1992-05-01), Hauptschein et al.
patent: 5251205 (1993-10-01), Callon et al.
patent: 5481604 (1996-01-01), Minot
patent: 5854899 (1998-12-01), Callon et al.
patent: 5940396 (1999-08-01), Rochberger
patent: 5946295 (1999-08-01), Sofman et al.
patent: 5964841 (1999-10-01), Rekhter
Meyers, R.A.; Encyclopedia of Telecommunications; "Intelligent Network Switches"; pp. 172-173; ISBN 0-12-226691-9; Academic Press, Inc., 1989.
Stallings, W.; Data and Computer Communications; "Route Discovery and Selection"; pp. 486-487; ISBN 0-02-415425-3; Prentice-Hall, Inc., 1997.
Handel, R. et al.; ATM Networks, Concepts, Protocols, Applications; "Self-Routing Switching Elements"; pp. 181-183; ISBN0-201-42274-3; Addison-Wesley Publishing Company, 1994.

Affiliated with

Also associated with

Rating

Routing over similar paths does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Routing over similar paths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Routing over similar paths will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1075130