GUMMADI K P, PRADEEP M J, MURTHY C S R. An Efficient Primary-Segmented Backup Scheme for Dependable Real -Time Communication in Multihop Networks[J]. ACM/IEEE Transactions on Networking, 2003, 11(1): 81-94.
[2]
LO C C, CHUANG B W. A Novel Approach of Backup Path Reservation for Survivable High-Speed Networks[J]. IEEE Communications Magazine, 2003.
[3]
SON T A, HOAI AN L T, KHADRAOUI D. Solving QoS routing problems by DCA[J]. Intelligent Information and Database Systems, Lecture Notes in Computer Science, 2010,5991/2010: 460–470.
[4]
KORKMAZ T, KRUNZ M. Multi-constrained optimal path selection[A]. Proc. INFOCOM 2001[C]. Anchorage, AK, USA, April 2001. 834-843.
[5]
SUURBRALLE J W, TARJAN R E. A Quick Method for Finding Shortest Pairs of Disjoint Paths[J], Networks, 1984 , 14: 325-333.
[6]
BHANDARI R. Optimal Diverse Routing in Telecommunication Fiber Networks[A]. Proc. IEEE INFOCOM’94[C]. Toronto, Ontario, Canada, June 1994. 1498-1508.
[7]
GUO Y C, KUIPERS F, MIEGHEM P V. A Link disjoint paths algorithm for reliable QoS routing[J]. International Journal of Communication Systems, 2003, 16(9): 779-798.
[8]
KODIALAM M, LAKSHMAN T V. Restorable Dynamic Quality of Service Routing[J]. IEEE Communications Magazine, 2002. 72-81.
[9]
SUURBRALLE J W, Disjoint Paths in a Network[J]. Networks, 1974, 4: 125-145.
[10]
HORST R, PARDALOS P M, THOAI N V. 全局优化引论（黄红选译）[M]. 北京，清华大学出版社, 2003
[11]
NI M F, WU X R, YU Z K. A Method Based on Penalty Function and Integer Programming for QoS Routing Problem[A]. Proc. IEEE The International Confercence on Multimedia Technology[C]. Ning Bo, China, 2010.2432–2434.
[12]
NEMHAUSER G L, WOLSEY L A. Integer and combinatorial optimization[M]. New York, John Willey & Sons, 1988. 540-546.
[13]
NOCEDAL J, WRIGHT S J. Numerical optimization[M]. New York, Springer, 1999.
