Packet Routing in Telecommunication Networks with Path and Flow Restrictions

We address packet-switched telecommunication networks, including ATM, SMDS, and X.25 services. We analyze important extensions of routing models by imposing restrictions on paths and flows. We then study how these modifications affect the computational requirements for solution. The restricted cases we examine are: 1) hop limits-the flow between each pair of nodes can take a maximum of h hops; 2) node and link capacity constraints-instead of traditional queuing delays, queuing is treated indirectly using penalty terms for "effective" capacity constraints; and 3) high- and low-priority flows-because of higher grade-of-service requirements for high-priority flows, additional capacity constraints are imposed on them. We discuss the importance of these restrictions and report results of computational testing using the flow-deviation algorithm. We also discuss the importance of limiting the number of routes used between node pairs and then analyze numerically how many distinct routes are typically used by the final solution from the flow-deviation algorithm when no route limits exist between node pairs.

[1]  Irina Neuman,et al.  A system for priority routing and capacity assignment in packet switched networks , 1992, Ann. Oper. Res..

[2]  L. Gouveia.  Multicommodity flow models for spanning trees with hop constraints , 1996 .

[3]  Joakim Kalvenes,et al.  Topology design and bridge-capacity assignment for interconnecting token ring LANs: A simulated annealing approach , 1996, Telecommun. Syst..

[4]  H. Joksch.  The shortest route problem with constraints , 1966 .

[5]  Kemal Altinkemer,et al.  Using a Hop-Constrained Model to Generate Alternative Communication Network Design , 2015, INFORMS J. Comput..

[6]  Sidney L. Hantler,et al.  An Algorithm for Optimal Route Selection in SNA Networks , 1983, IEEE Trans. Commun..

[7]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[8]  Jonathan Halpern,et al.  Shortest path with time constraints on movement and parking , 1974, Networks.

[9]  Yann Vaxès,et al.  Multicommodity network flow with jump constraints , 1997, Discret. Math..

[10]  C. Daganzo.  On the traffic assignment problem with flow dependent costs—II , 1977 .

[11]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[12]  Larry Joseph Leblanc,et al.  MATHEMATICAL PROGRAMMING ALGORITHMS FOR LARGE SCALE NETWORK EQUILIBRIUM AND NETWORK DESIGN PROBLEMS , 1973 .

[13]  Chang Sup Sung,et al.  An algorithm for configuring embedded networks in reconfigurable telecommunication networks , 1995, Telecommun. Syst..

[14]  Jan Karel Lenstra,et al.  The complexity of the network design problem , 1978, Networks.

[15]  M. Minoux,et al.  Structures algébriques généralisées des problèmes de cheminement dans les graphes , 1976 .

[16]  Charles J. McCallum.  A generalized upper bounding approach to a communications network planning problem , 1977, Networks.

[17]  Luís Gouveia,et al.  Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints , 1995, Comput. Oper. Res..

[18]  Warren B. Powell,et al.  A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem , 1993, Oper. Res..

[19]  Susan L. Albin,et al.  The design of centralized networks with reliability and availability constraints , 1988, Comput. Oper. Res..

[20]  Kaushal Chari,et al.  Multi-hour design of computer backbone networks , 1996, Telecommun. Syst..