Researches on the problem of link disjoint paths pair with QoS constraints

Tongxin Xuebao/Journal on Communications

Volumn 27, Issue 6, 2006, Pages 36-42

  Zhang, Pin ^a   Zhang, Jian Wu ^a   Li, Le Min ^b   Wang, Sheng ^b  

^a HANGZHOU DIANZI UNIVERSITY   (China)

^b UNIVERSITY OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

Link disjoint paths; Link split graph; QoS constraints

Indexed keywords

LINK DISJOINT PATHS; LINK SPLIT GRAPH; QUALITY OF SERVICE CONSTRAINTS;

ALGORITHMS; GRAPH THEORY; MATHEMATICAL MODELS; QUALITY OF SERVICE;

TELECOMMUNICATION LINKS;

EID: 33749854954     PISSN: 1000436X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. SUURBALLE J W. Disjoint paths in a network[J]. Networks, 1974, 4(2): 125-145.
2. SUURBALLE J W, TARJAN R E. A quick method for finding shortest pairs of disjoint paths[J]. Networks, 1984, 14(2): 325-336.
3. BHANDARI R. Optimal diverse routing in telecommunication fiber networks[A]. Proc IEEE NFOCOM 94[C]. Toronto, Ontario, Canada, 1994. 1498-1508.
4. CASTANON D A. Efficient algorithms for finding the K best paths through a trellis[J]. IEEE Trans on Aerospace and Electronic Systems, 1990, 26(2): 405-410.
5. ALEXANDER S. Finding k disjoint paths in a directed planar graph[J]. SIAM Journal on Computing, 1994, 23(4): 780-788.
6. LEE S W, WU C S. A k-best paths algorithm for highly reliable communication network[J]. IEICE Trans on Communication, 1999, E82-B(4): 586-590.
7. ITALIANO G, RASTOGI R, YENER B. Restoration algorithms for virtual private networks in the hose model[A]. Proceedings of IEEE INFOCOM'02[C]. New York, 2002. 131-139.
8. KAR K, KODIALAM M, LAKSHMAN T V. Routing restorable bandwidth guaranteed connections using maximum 2-route flows[J]. IEEE/ACM Transactions on Networking, 2003, 11(5): 772-781.
9. KODIALAM M, LAKSHMAN T V. Restorable dynamic quality of service routing[J]. IEEE Communications Magazine, 2002, 40(6): 72-81.
10. YUCHUN GUO, 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.
11. GAREY M, JOHNSON D. Computers and Intractability: a Guide to the Theory of NP Completeness[M]. W H Freeman, San Francisco. 1979.
12. ZHANG P, LI L M, WANG S. Algorithms for the bi-constraint path problem[J]. Journal of China Institute of Communications, 2003, 25(12): 32-43.