Configuring wide area computer networks

SummaryModern computer networks consist of wide area backbone networks which serve as major highways to transfer large volumes of communication traffic between access points, and local access networks which feed traffic between the backbone network and end user nodes. The topological design of wide area computer communication networks consists of selecting a set of locations for network control processors (NCPs) placement, deciding on backbone links and their capacities to connect the NCPs, linking end user nodes to the NCPs and selecting routes for routing messages between communicating end user pairs. This paper presents some of the problems faced by network designers starting from the capacity assignment problem, moving to routing and capacity assignment, followed by the topological design and capacity assignment problem; the last problem presented is the topological design and capacity expansion over time. The problems are complex combinatorial optimization problems, which require developing new solution procedures. The paper presents the problems and discusses models and solution procedures. The paper concludes with a discussion and directions for further research.ZusammenfassungIn dieser Arbeit behandeln wir einige Probleme die als Schritte beim Design von Weitverkehrsnetzen (WAN) auftreten: Kapazitätsplanung und -zuordnung, Wegebestimmung, Wahl der Netztopologie sowie Kapazitätserweiterung. Diese Problemstellungen führen dabei auf komplexe Kombinatorische Optimierungsprogramme, die die Entwicklung neuer Lösungstechniken verlangen.Wir beschreiben die verschiedenen Probleme und diskutieren zugehörige Optimierungsmodelle und Lösungsverfahren. Diese Arbeit schließt mit einem Ausblick auf zukünftige Forschungsschwerpunkte.

[1]  Moshe Dror,et al.  Fiberoptic circuit network design under reliability constraints , 1989, IEEE J. Sel. Areas Commun..

[2]  Norman Zadeh,et al.  On building minimum cost communication networks over time , 1974, Networks.

[3]  Bezalel Gavish,et al.  Capacity and Flow Assignments in Large Computer Networks , 1986, INFOCOM 1986.

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

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

[6]  Yuping Qiu,et al.  Planning for optimal expansion of leased line communication networks , 1992, Ann. Oper. Res..

[7]  B. Gavish Topological design of computer communication networks — The overall design problem , 1992 .

[8]  M. R. Rao,et al.  Optimal Network Capacity Planning: A Shortest-Path Scheme , 1975, Oper. Res..

[9]  Bezalel Gavish,et al.  Backbone Network Design Tools with Economic Tradeoffs , 1990, INFORMS J. Comput..

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

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

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

[13]  Bezalel Gavish,et al.  Routing in a Network with Unreliable Components , 1988, IEEE Trans. Commun..

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

[15]  Bezalel Gavish,et al.  Telecommunications network topological design and capacity expansion: Formulations and algorithms , 1993, Telecommun. Syst..

[16]  Bezalel Gavish,et al.  Telecommunications Network Topological Design and Capacity Expansion , 1991 .

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

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

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

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

[21]  P. Brooker,et al.  Optimal expansion of an existing network , 1974, Math. Program..

[22]  Michel Minoux,et al.  Network Synthesis and Dynamic Network Optimization , 1987 .

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

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

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

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