A model and algorithm for interconnecting two WANs

The authors consider the problem of determining which gateways to use to interconnect existing wide area networks (WANs) to minimize a linear combination of the average internet and intranet packet delays subject to a cost constraint on the amount to be spent to establish the gateways. This problem is formulated as a nonlinear combinational optimization problem. When the gateway locations are fixed, the resulting routing problem is not a convex programming problem. An algorithm to solve this problem is developed, and computational experience is reported. For light intranet traffic, the algorithm computed solutions that were within 6% of an optimal solution. For medium intranet traffic, the algorithm did not perform as well (error ranging from 5.7% to 16%). In addition, the CPU time used was higher for medium intranet traffic than for light intranet traffic.<<ETX>>

[1]  Chi-Chun Lo,et al.  A two-phase algorithm and performance bounds for the star-star concentrator location problem , 1989, IEEE Trans. Commun..

[2]  Bezalel Gavish,et al.  Topological design of centralized computer networks - formulations and algorithms , 1982, Networks.

[3]  A. M. Geoffrion,et al.  Lagrangean Relaxation Applied to Capacitated Facility Location Problems , 1978 .

[4]  James R. Yee,et al.  A gateway allocation algorithm for interconnecting existing data networks , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  Bezalel Gavish,et al.  A system for routing and capacity assignment in computer communication networks , 1989, IEEE Trans. Commun..

[6]  Mario Gerla,et al.  On the Topological Design of Distributed Computer Networks , 1977, IEEE Trans. Commun..

[7]  Mario Gerla,et al.  Optimal Routing in a Packet-Switched Computer Network , 1974, IEEE Transactions on Computers.

[8]  D. Bertsekas,et al.  Projected Newton methods and optimization of multicommodity flows , 1982, 1982 21st IEEE Conference on Decision and Control.

[9]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[10]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

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

[12]  Ellis Horowitz,et al.  Computing Partitions with Applications to the Knapsack Problem , 1974, JACM.

[13]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[14]  Frank Yeong-Sung Lin,et al.  A distributed routing algorithm for virtual circuit date networks , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[15]  Douglas Comer.  Internetworking With TCP/IP Principles , 1988 .