Finding Minimum-Cost Paths with Minimum Sharability

In communication networks, multiple communication paths sharing minimum number of links or/and nodes may be desirable for improved performance, resource utilization and reliability. We introduce the notion of link sharability and node sharability, and consider the problems of finding minimum-cost k paths subject to minimum link/node sharability constraints. We identify 65 different link/node sharability constraints, and consider the fundamental problem of finding minimum-cost k paths between a pair of nodes under these constraints. We present a unified polynomial-time algorithm scheme for solving this problem subject to 25 of these different sharability constraints.

[1]  David Griffin,et al.  A management system for load balancing through adaptive routing in multi-service ATM networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[2]  Mei Yang,et al.  Dual-Homing Based Scalable Partial , 2006 .

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

[4]  Saewoong Bahk,et al.  Dynamic multi-path routing and how it compares with other dynamic routing algorithms for high speed wide area network , 1992, SIGCOMM 1992.

[5]  John E. Hopcroft,et al.  The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..

[6]  Tohru Kikuno,et al.  A routing protocol for finding two node-disjoint paths in computer networks , 1995, Proceedings of International Conference on Network Protocols.

[7]  Andreas Pitsillides,et al.  Addressing network survivability issues by finding the K-best paths through a trellis graph , 1997, Proceedings of INFOCOM '97.

[8]  Chung-Lun Li,et al.  Finding disjoint paths with different path-costs: Complexity and algorithms , 1992, Networks.

[9]  Si-Qing Zheng,et al.  Finding Two Disjoint Paths in a Network with Min-Min Objective Function , 2003 .

[10]  Hiroshi Suzuki,et al.  Fast bandwidth reservation scheme with multi-link and multi-path routing in ATM networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

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

[12]  Si-Qing Zheng,et al.  Finding Two Disjoint Paths in a Network with MinSum-MinMin Objective Function , 2007, FCS.

[13]  D. Castañón.  Efficient algorithms for finding the K best paths through a trellis , 1990 .

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

[15]  Ram Krishnan,et al.  Choice of allocation granularity in multipath source routing schemes , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[16]  Xiangtong Qi,et al.  On finding the best partial multicast protection tree under dual-homing architecture , 2005, HPSR. 2005 Workshop on High Performance Switching and Routing, 2005..

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

[18]  Xiangtong Qi,et al.  Dual-homing multicast protection , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[19]  Si-Qing Zheng,et al.  Finding Two Disjoint Paths in a Network with Normalized alpha+-MIN-SUM Objective Function , 2005, ISAAC.

[20]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .