Tie-breaking in shortest path determination

Details Tie-breaking in shortest path determination Tie-breaking in shortest path determination

2011-03-22

2011-03-22

Pham, Chi H (Department: 2471)

Multiplex communications

Data flow congestion prevention or control

Reexamination Certificate

active

07911944

ABSTRACT:
A consistent tie-breaking decision between equal-cost shortest (lowest cost) paths is achieved by comparing an ordered set of node identifiers for each of a plurality of end-to-end paths. Alternatively, the same results can be achieved, on-the-fly, as a shortest path tree is constructed, by making a selection of an equal-cost path using the node identifiers of the diverging branches of the tree. Both variants allow a consistent selection to be made of equal-cost paths, regardless of where in the network the shortest paths are calculated. This ensures that traffic flow between any two nodes, in both the forward and reverse directions, will always follow the same path through the network.

REFERENCES:
patent: 5023916 (1991-06-01), Breu
patent: 5914936 (1999-06-01), Hatono et al.
patent: 6633544 (2003-10-01), Rexford et al.
patent: 6697333 (2004-02-01), Bawa et al.
patent: 6928484 (2005-08-01), Huai et al.
patent: 6990073 (2006-01-01), Sandoval
patent: 7224668 (2007-05-01), Smethurst et al.
patent: 7239609 (2007-07-01), Yokota et al.
patent: 7277709 (2007-10-01), Vadgama
patent: 7382734 (2008-06-01), Wakumoto et al.
patent: 7385986 (2008-06-01), Ono et al.
patent: 7567564 (2009-07-01), Tanaka
patent: 7606161 (2009-10-01), Kalkunte et al.
patent: 2003/0193898 (2003-10-01), Wong et al.
patent: 2004/0032832 (2004-02-01), Desai et al.
patent: 2004/0052239 (2004-03-01), Nesbitt
patent: 2004/0105388 (2004-06-01), Wilkins et al.
patent: 2005/0259647 (2005-11-01), Wakumoto et al.
patent: 2006/0182035 (2006-08-01), Vasseur
patent: 2006/0198323 (2006-09-01), Finn
patent: 2006/0233108 (2006-10-01), Krishnan
patent: 2007/0008949 (2007-01-01), Balandin
patent: 2007/0025243 (2007-02-01), Ayyagari et al.
patent: 2008/0123532 (2008-05-01), Ward et al.
patent: 2008/0219268 (2008-09-01), Dennison
patent: 2009/0122718 (2009-05-01), Klessig et al.
I.E.E.E., Draft Amendment to I.E.E.E. Std. 802.1Q-2005, Dec. 17, 2008, Virtual Bridged Local Area Networks—Amendment 9: Shortest Path Bridging (180 pages).
Seaman, M., Shortest Path Bridging—Introduction to Draft 0.3, Shortest Path Bridging D0.3 Introduction, 802.1 May 2006 (9 pages).
Seaman, M.., An Update on Bridging Technologies—Change and Evolution: Why, What, and How, 802 Jul. 2005, Bridging Technology Update (28 pages).
Seaman, M., Shortest Path Bridging, Revision 0.4 Mar. 20, 2005 (4 pages).
Canadian Patent Office, International Search Report and Written Opinion issued in corresponding PCT Application No. PCT/IB2008/003940, 8 pages, Dec. 23, 2009.

Affiliated with

Also associated with

Rating

Tie-breaking in shortest path determination does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Tie-breaking in shortest path determination, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tie-breaking in shortest path determination will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2694248