Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Alternate path routing
Reexamination Certificate
2005-08-09
2005-08-09
Burgess, Glenton B. (Department: 2153)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
Alternate path routing
C709S240000, C709S241000, C709S242000, C709S243000, C370S395420, C370S238000
Reexamination Certificate
active
06928484
ABSTRACT:
A method for identifying and choosing a shortest path segment that has an alternate edge disjoint path segment. While routing Unidirectional Path Switched Ring (UPSR) path segments in a graph, there may be several equal distance paths to choose the shortest path from. Choosing a certain path as the shortest path may minimize or eliminate the chance of finding an alternative path segment. A method is provided such that if multiple shortest paths from the source node to a particular destination node exist, the method selects the shortest path which has an alternate edge disjoint path, and which can be used for path protection. The particular shortest path chosen by the method is not necessarily the first shortest path constructed.
REFERENCES:
patent: 4956835 (1990-09-01), Grover
patent: 4967345 (1990-10-01), Clarke et al.
patent: 5812524 (1998-09-01), Moran et al.
patent: 5881243 (1999-03-01), Zaumen et al.
patent: 6047331 (2000-04-01), Medard et al.
patent: 6061736 (2000-05-01), Rochberger et al.
patent: 6130875 (2000-10-01), Doshi et al.
patent: 6304349 (2001-10-01), Alanyali et al.
patent: 6324162 (2001-11-01), Chaudhuri
patent: 6347078 (2002-02-01), Narvaez-Guarnieri et al.
patent: 6498778 (2002-12-01), Cwilich et al.
Anbiah Anix
Baldwin Gary
Huai Jin
Burgess Glenton B.
Cisco Technology Inc.
Parton Kevin
Ritter Lang & Kaplan LLP
LandOfFree
Method and apparatus for discovering edge-disjoint shortest... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for discovering edge-disjoint shortest..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for discovering edge-disjoint shortest... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3519536