@inproceedings{43ba4fd602704200b198461ce0a61ba1,
title = "Routing on shortest pair of disjoint paths with bandwidth guaranteed",
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.",
keywords = "Bandwidth, Disjoint, Guaranteed, Multipath, QoS, Shortest pair",
author = "Hongze Leng and Meilian Liang and Junqiang Song and Zheng Xie and Jun Zhang",
year = "2009",
doi = "10.1109/DASC.2009.81",
language = "English",
isbn = "9780769539294",
series = "8th IEEE International Symposium on Dependable, Autonomic and Secure Computing, DASC 2009",
pages = "557--561",
booktitle = "8th IEEE International Symposium on Dependable, Autonomic and Secure Computing, DASC 2009",
note = "8th IEEE International Symposium on Dependable, Autonomic and Secure Computing, DASC 2009 ; Conference date: 12-12-2009 Through 14-12-2009",
}