Routing on shortest pair of disjoint paths with bandwidth guaranteed

8th IEEE International Symposium on Dependable, Autonomic and Secure Computing, DASC 2009

Volumn , Issue , 2009, Pages 557-561

  Leng, Hongze ^a   Liang, Meilian ^b   Song, Junqiang ^a   Xie, Zheng ^a   Zhang, Jun ^c  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

^b GUANGXI UNIVERSITY   (China)

^c BEIHANG UNIVERSITY   (China)

Author keywords

Bandwidth; Disjoint; Guaranteed; Multipath; QoS; Shortest pair

Indexed keywords

DISJOINT; DISJOINT PATHS; IN-NETWORK; MULTI PATH ROUTING; MULTI-PATH; NP COMPLETE; OPTIMAL SOLUTIONS; QOS ROUTING;

HEURISTIC ALGORITHMS;

BANDWIDTH;

EID: 77950592882     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DASC.2009.81     Document Type: Conference Paper

References (26)

1. W. Zheng, C. Jon. Quality-of-Service routing for supporting multimedia applications. IEEE Journal on Selected Areas in Communications, 1996, 14(7): 1228-1234.
2. Guozhen Tan, Xiaogao Qu, Dong Li. An Overview of Network Routing Algorithm and QoS Management Strategy. Application Research of Computers, 2003, 10(4): 4-12.
3. Kaan Bur, Cem Ersoy. Admission Control for Mumticast Routing with Quality of Service in Ad Hoc Networks. ISCIS 2005, LNCS 3733, 2005: 44-53.
4. Yuxia Lin, Huilin Zhu, Zhengxin Ma, Xuming Liu. Selection of Quamy of Service Routing Metric. Telecommunications Science, 2003, 19(7): 22-27.
5. Hongze Leng, Zheng Xie, Zhi Chen, Zhen Xu. New Algorithm for the Shortest Path Problem with Constraints. Proceedings of First International Conference on Modelling and Simulation, 2008, Volume II: 320-325.
6. Zeyan Wang, Xingchun Diao. Heuristic Algorithm for shortest Path Problem with Nonlinear Constraints. Journal of System Simulation, 2004, 16(7): 1556-1559.
7. Huilin Zhu, Daming Hang, Zhengxin Ma, Zhigang Cao, O.K. Li. Quality of Service Routing: Problems and Solutions. ACTA Electronica Sinica, 2003, 31(1): 1-8.
8. Tao Zhang, Jun Zhang, Zhongkan Liu. A Delay Constraint Minimum Cost Routing Algorithm for Satellite Time-Varying Network. ACTA Electronica Sinica, 2006, 34(9): 1584-1589.
9. Ahned Redha Mahlous, Rod J Fretwell, Brahim Chaourar. MFMP: Max Flow Multipath Routing Algorithm. Second UKSIM European Symposium on Computer Modeling and Simulation, 2008: 482-487.
10. Baohong Shen, Bin Hao, Arunabha Sen. On Multipath Routing using Widest Pair of Disjoint Paths. Hight Performance Switching and Routing, 2004 HPSR, 2004: 134-140.
11. Charu C. Aggarwal, James B.Orlin. On Multi-route Maximum Flows in Networks. Networks, 2001, 39(1): 43-52.
12. Deeper Sidhu, Raj Nair, Shukri Abdallah. Finding Disjoint Paths in Networks. ACM SIGCOMM Computer Communication Review, 1991, 21(4): 43-51.
13. Huiyao An, Wei Peng, Xicheng Lu. Maximally Realiable Pathset Selection for Multipath Routing in MANET. Journal of National University of Defence Technology, 2006, 28(3): 64-70.
14. Israel Cidon, Raphael Rom, Yuval Shavitt. Analysis of Multi-Path Routing. IEEE/ACM Transactions on Networking, 1999, 7(6): 885-896.
15. S.J. Lee, M. Gerla. Split Multipath Routing with Maximally Disjoint Paths in Ad Hoc Networks. ICC01, 2001, 10: 3201-3205.
16. Shangming Zhu, Zhili Zhang, Xinhua Zhuang. Modified Widest Disjoint Paths Algorithm For Multipath Routing. NPC 2007, LNCS 4672, 2007: 212-219.
17. S. Suurballe, R. Tarjan. A Quick Method for Finding Shortest Pair of Disjoint Paths. Networks, 1984, 14(325-336).
18. S. Suurballe. Disjoint Paths in Networks. Networks, 1974, 4: 125-145.
19. C. L. Li, S. T. McCormick, D. Simchi Levi. The Complexity of Finding Two Disjont Paths with Min-Max Objective Functions. Discrete Applied Mathematics, 1990, 26: 105-115.
20. S. Nelakuditi, Zhili Zhang. On Selection of Candidate Paths for Proportional Routing. Computer Networks, 2004, 44: 79-102.
21. Santosh N. Kabadi, R.Chandrasekaran, K.P.K Nair. Multiroute flows: Cut-trees and realizability. Discrete Optimization 2 2005: 229-240.
22. Stavros G. Kolliopoulos. Minimum-Cost Single-Source 2-Splittable Flow. Information Processing Letters 94 2004: 15-18.
23. A. Consiglio, A.pecorella. Using Simulated Annealing to Solve the K-Shortest Path Problem. Proc. Conf. Italian Assoc., 1995.
24. Y. L. Chen. Finding the k Quickest Simple Paths in a Network. Information Processing Letters, 1994, 50: 89-92.
25. David Eppstein. Finding the k Shortest Paths. SIAM J. Computing, 1998, 28(2): 652-673.
26. G. N. Frederickson. An Optimal Algorithm for Selection in a Min-Heap. Information and Computaion, 1993, 104: 197-214.