Topological design of computer communication networks

The author develops a nonlinear formulation of the topological design problem, and obtains a Lagrangean relaxation of the problem. The Lagrangean solutions provide lower bounds on the optimal solutions, which are further improved using subgradient optimization procedures. Heuristics are developed for generating feasible solutions to the problem. The quality of solutions generated by this heuristic are compared to the lower bounds generated by the Lagrangean procedures on a set of test cases.<<ETX>>

[1]  Tak-Shing Peter Yum.  The Design and Analysis of a Semidynamic Deterministic Routing Rule , 1981, IEEE Trans. Commun..

[2]  Donald T. Tang,et al.  Discrete Link Capacity and Priority Assignments in Communication Networks , 1977, IBM J. Res. Dev..

[3]  Pierre Semal,et al.  An algorithm for the optimization of nonbifurcated flows in computer communication networks , 1981, Perform. Evaluation.

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

[5]  W. Chou,et al.  Integrated optimization of distributed processing networks , 1978, AFIPS National Computer Conference.

[6]  P. McGregor,et al.  Network Design: An Algorithm for the Access Facility Location Problem , 1977, IEEE Trans. Commun..

[7]  Shyam Johari.  Burroughs Network Architecture: An Overview , 1983, INFOCOM.

[8]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

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

[10]  Mario Gerla,et al.  Deterministic and adaptive routing policies in packet-switched computer networks , 1973, DATACOMM '73.

[11]  L. R. Tymes,et al.  Routing and Flow Control in TYMNET , 1981, IEEE Trans. Commun..

[12]  Leonard Kleinrock,et al.  Communication Nets: Stochastic Message Flow and Delay , 1964 .

[13]  Vijay Ahuja,et al.  Routing and Flow Control in Systems Network Architecture , 1979, IBM Syst. J..

[14]  Bezalel Gavish,et al.  Augmented Lagrangean Based Algorithms for Centralized Network Design , 1985, IEEE Trans. Commun..

[15]  Adrian Segall,et al.  Optimal Distributed Routing for Virtual Line-Switched Data Networks , 1979, IEEE Trans. Commun..

[16]  P. M. Cashin.  Datapac Network Protocols , 1976, ICCC.

[17]  David C. Walden,et al.  The ARPA Network Design Decisions , 1977, Comput. Networks.

[18]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[19]  M. Schwartz,et al.  Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..

[20]  G. Michael Schneider,et al.  An Algorithm for the Design of Multilevel Concentrator Networks , 1982, Comput. Networks.

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

[22]  R. Boorstyn,et al.  Large-Scale Network Topological Optimization , 1977, IEEE Trans. Commun..

[23]  D. T. Tang,et al.  Discrete Link Capacity Assignment in Communication Networks , 1976, ICCC.

[24]  Douglas Comer,et al.  The computer science research network CSNET: a history and status report , 1983, CACM.

[25]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[26]  Jennings Dm,et al.  Computer Networking for Scientists , 1986 .

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

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

[29]  Luigi Fratta,et al.  Heuristic Design Algorithm for Computer Communication Networks with Different Classes of Packets , 1977, IBM J. Res. Dev..

[30]  D. Bertsekas.  A class of optimal routing algorithms for communication networks , 1980 .

[31]  Tak-Shing Peter Yum,et al.  The Join-Biased-Queue Rule and Its Application to Routing in Computer Communication Networks , 1981, IEEE Trans. Commun..

[32]  A. M. Geoffrion.  Lagrangean Relaxation and Its Uses in Integer Programming , 1972 .

[33]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[34]  James P. Gray,et al.  SNA Multiple-System Networking , 1979, IBM Syst. J..