Routing on Shortest Pair of Disjoint Paths with Bandwidth Guaranteed

Authors:
Hongze Leng;Meilian Liang;Junqiang Song;Zheng Xie;Jun Zhang
Affiliations:
-;-;-;-;-
Venue:
DASC '09 Proceedings of the 2009 Eighth IEEE International Conference on Dependable, Autonomic and Secure Computing
Year:
2009

Citing 0
Cited 1

Power aware stability-based routing protocol for hybrid ad hoc networks

International Journal of Mobile Network Design and Innovation

Quantified Score

Hi-index	0.00

Visualization

Abstract

QoS routing and multipath routing have been receiving much attention respectively in network communication. However, the research combining those two kinds of routing is rare. This paper integrated the ideas of QoS and multipath, and presented the problem of Shortest Pair of Disjoint Paths with Bandwidth Guaranteed. We proved it to be NP-Complete, and then proposed a heuristic algorithm. The analysis indicates that our algorithm shows good performance and it can produce optimal solutions in most cases.