Minimax Models for Diverse Routing

An important task in the management and administration of communication networks is constructing routes for messages to follow from source to destination. A common approach is to route along the shortest available path connecting the source to the destination, where link lengths can be defined in a variety of ways (e.g., time, cost, impact on average queueing delay, or capacity required). This paper presents a family of novel minimax models for determining a set of paths from the source to the destination that are reasonably short in length while also reasonably diverse (disjoint). The overall goal is to design a routing scheme that is both ef.cient and robust, resulting in greater network reliability. Several models are investigated and a column-generation approach is proposed for exact solution. Computational results show that this exact technique can be applied effectively to moderate sized networks. For even larger networks, heuristic methods are developed and tested.

[1]  Charles J. Colbourn,et al.  Lower bounds on two-terminal network reliability , 1988, Discret. Appl. Math..

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

[3]  Raphael Rom,et al.  Analysis of multi-path routing , 1999, TNET.

[4]  Yash P. Aneja,et al.  CLASSES OF LINEAR PROGRAMS WITH INTEGRAL OPTIMAL SOLUTIONS. , 1985 .

[5]  Jon M. Peha,et al.  Analyzing the fault tolerance of double-loop networks , 1994, TNET.

[6]  David Bernstein,et al.  FINDING ALTERNATIVES TO THE BEST PATH , 1997 .

[7]  Robert E. Tarjan,et al.  Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees , 1975, Networks.

[8]  Lester Randolph Ford,et al.  A Suggested Computation for Maximal Multi-Commodity Network Flows , 2004, Manag. Sci..

[9]  D. Torrieri,et al.  Algorithms for finding an optimal set of short disjoint paths in a communication network , 1991, MILCOM 91 - Conference record.

[10]  Alon Itai,et al.  The complexity of finding maximum disjoint paths with length constraints , 1982, Networks.

[11]  Douglas R. Shier,et al.  Online Supplement to “ Minimax Models for Diverse Routing ” , 2001 .

[12]  R. F. Churchhouse,et al.  An Introduction to Linear Programming and the Theory of Games , 1964, Mathematical Gazette.

[13]  R. F. Churchhouse,et al.  An Introduction to Linear Programming and the Theory of Games , 1964 .

[14]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[15]  Y. P. Aneja,et al.  Two problems in multicommodity networks , 1979 .

[16]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[17]  Donald M. Topkis,et al.  A k shortest path algorithm for adaptive routing in communications networks , 1988, IEEE Trans. Commun..

[18]  John A. Silvester,et al.  An approach to path-splitting in multipath networks , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[19]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[20]  Yash P. Aneja,et al.  Maximal expected flow in a network subject to arc failures , 1980, Networks.

[21]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[22]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[23]  Douglas R. Shier,et al.  Diversified network routing via minimax objectives , 2000 .

[24]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[25]  Yash P. Aneja,et al.  Network flows with age dependent decay rates , 1985 .

[26]  J. W. Suuballe,et al.  Disjoint Paths in a Network , 2022 .