On Path Selection for Multipath Connection

作者: Yu Cai , C. Edward Chow

DOI: 10.1007/978-1-4020-6264-3_89

关键词: Selection (genetic algorithm)Network topologyNetwork performanceGreedy algorithmComputer scienceDelay spreadMathematical optimizationGenetic algorithmLog-distance path loss modelMultipath propagation

摘要: Multipath connection, which utilizes the multiple paths between network hosts in parallel, has been used to improve performance, security and reliability. Path selection is a critical decision multipath connection network. Different results significantly different result. In this paper, we present several heuristic algorithms including genetic algorithm solve path problem environment. The reasons choose are because of its flexibility extensibility when context changes. We define two objective functions constrains problem. performance proposed on simulated topology as well real-world presented. It observed that can produce satisfactory within reasonable execution time.

参考文章(22)
C.E. Chow, Yu Cai, D. Wilkinson, G. Godavari, Secure collective defense system global communications conference. ,vol. 4, pp. 2245- 2249 ,(2004) , 10.1109/GLOCOM.2004.1378408
Arvind Krishnamurthy, Randolph Wang, Junwen Lai, Larry Peterson, Ming Zhang, A transport layer approach for improving end-to-end performance and robustness using redundant paths usenix annual technical conference. pp. 8- 8 ,(2004)
Naoaki Yamanaka, Eiji Oki, Recursive matrix-calculation method for disjoint path search with hop link number constraints IEICE Transactions on Communications. ,vol. 78, pp. 769- 774 ,(1995)
Shi-Wei Lee, Cheng-Shong Wu, A K-Best Paths Algorithm for Highly Reliable Communication Networks IEICE Transactions on Communications. ,vol. 82, pp. 586- 590 ,(1999)
Deepinder Sidhu, Raj Nair, Shukri Abdallah, Finding disjoint paths in networks acm special interest group on data communication. ,vol. 21, pp. 43- 51 ,(1991) , 10.1145/115992.115998
Yuchun Guo, Fernando Kuipers, Piet Van Mieghem, Link-disjoint paths for reliable QoS routing International Journal of Communication Systems. ,vol. 16, pp. 779- 798 ,(2003) , 10.1002/DAC.612
Chung-Lun Li, S.Thomas McCormick, David Simchi-Levi, The complexity of finding two disjoint paths with min-max objective function Discrete Applied Mathematics. ,vol. 26, pp. 105- 115 ,(1989) , 10.1016/0166-218X(90)90024-7
Kenneth Steiglitz, Christos H. Papadimitriou, Combinatorial Optimization: Algorithms and Complexity ,(1981)