EP 2853068 A1 20150401 - TIE-BREAKING IN SHORTEST PATH DETERMINATION
Title (en)
TIE-BREAKING IN SHORTEST PATH DETERMINATION
Title (de)
TIE-BREAKING BEI DER BESTIMMUNG DES KÜRZESTEN WEGES
Title (fr)
SÉLECTION LORS DE LA DÉTERMINATION DU CHEMIN LE PLUS COURT
Publication
Application
Priority
CA 2012050337 W 20120522
Abstract (en)
[origin: WO2013173900A1] 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.
IPC 8 full level
H04L 45/122 (2022.01); H04L 45/18 (2022.01)
CPC (source: EP KR)
H04L 45/12 (2013.01 - EP KR); H04L 45/20 (2013.01 - EP KR); H04L 45/48 (2013.01 - KR); H04L 45/48 (2013.01 - EP)
Citation (search report)
See references of WO 2013173900A1
Designated contracting state (EPC)
AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR
Designated extension state (EPC)
BA ME
DOCDB simple family (publication)
WO 2013173900 A1 20131128; BR 112014028934 A2 20170627; CN 104396198 A 20150304; EP 2853068 A1 20150401; JP 2015520997 A 20150723; KR 20150030644 A 20150320
DOCDB simple family (application)
CA 2012050337 W 20120522; BR 112014028934 A 20120522; CN 201280073362 A 20120522; EP 12877146 A 20120522; JP 2015512973 A 20120522; KR 20147032799 A 20120522