2.3 Multipath Maximum Probability Path Algorithm
In this section, the multipath maximum probability path algorithm (MPPR) is proposed.
Each node finds a label that satisfies the topK condition to cycle, which is basically
very close to the optimal path. The time complexity of the algorithm is Oðm 2 Â
ðlog 2 nÞ
2 Þ (m 2 is the number of branches, and n is the number of labels included in
HyperD). The path formula is described by Eq. (2.3).
Path MPPR ¼ min
X v
t¼u
topK
NeisðtÞ
minðdifferenceðl t ; l v Þ
!
: e t ¼
X topK
i¼1
p i ! 0:9
!
ð2:3Þ
Improved HyperD Routing Query Algorithm Under Different …
437
In this section, the multipath maximum probability path algorithm (MPPR) is proposed.
Each node finds a label that satisfies the topK condition to cycle, which is basically
very close to the optimal path. The time complexity of the algorithm is Oðm 2 Â
ðlog 2 nÞ
2 Þ (m 2 is the number of branches, and n is the number of labels included in
HyperD). The path formula is described by Eq. (2.3).
Path MPPR ¼ min
X v
t¼u
topK
NeisðtÞ
minðdifferenceðl t ; l v Þ
!
: e t ¼
X topK
i¼1
p i ! 0:9
!
ð2:3Þ
Improved HyperD Routing Query Algorithm Under Different …
437