On Path Selection for Multipath Connection

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

[1]  Pablo Rodriguez,et al.  Parallel-access for mirror sites in the Internet , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[2]  Robert E. Tarjan,et al.  A quick method for finding shortest pairs of disjoint paths , 1984, Networks.

[3]  Edward Chow,et al.  On proxy server based multipath connection , 2005 .

[4]  Deepinder P. Sidhu,et al.  Finding disjoint paths in networks , 1991, Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication.

[5]  Ming Zhang,et al.  Proceedings of the General Track: 2004 USENIX Annual Technical Conference , 2022 .

[6]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[7]  Eiji Oki,et al.  Recursive matrix-calculation method for disjoint path search with hop link number constraints , 1995 .

[8]  Ramesh Bhandari.  Optimal diverse routing in telecommunication fiber networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[9]  Chung-Lun Li,et al.  The complexity of finding two disjoint paths with min-max objective function , 1989, Discret. Appl. Math..

[10]  J. W. Suurballe.  Disjoint paths in a network , 1974, Networks.

[11]  Bo Li,et al.  On the optimal placement of web proxies in the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[12]  D. Wilkinson,et al.  Enhanced secure dynamic DNS update with indirect route , 2004, Proceedings from the Fifth Annual IEEE SMC Information Assurance Workshop, 2004..

[13]  Nachum Shacham,et al.  A distributed algorithm for finding shortest pairs of disjoint paths , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[14]  P. Krishnan,et al.  The cache location problem , 2000, TNET.

[15]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[16]  Shi-Wei Lee,et al.  A K-Best Paths Algorithm for Highly Reliable Communication Networks , 1999 .

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  C. Edward Chow,et al.  Secure collective defense system , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[19]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[20]  Yuchun Guo,et al.  Link‐disjoint paths for reliable QoS routing , 2003, Int. J. Commun. Syst..