Capacity planning of private networks using DCS under multibusy-hour traffic

An integer programming model and Lagrangian relaxation-based heuristic solution method is developed, to determine transmission capacity in private backbone networks using DCS's, such that multibusy-hour point-to-point circuit requirements can be met at low cost. It simultaneously determines capacity, routing and topology. Numerical results for T1 networks are shown. >

[1]  T. C. Hu,et al.  Synthesis of a Communication Network , 1964 .

[2]  George G. Polak,et al.  Network design and dynamic routing under queueing demand , 1985, Z. Oper. Research.

[3]  Amitava Dutta,et al.  A Multiperiod Capacity Planning Model for Backbone Computer Communication Networks , 1992, Oper. Res..

[4]  Wayne D. Grover,et al.  Precision time-transfer in transport networks using digital cross-connect systems , 1990, IEEE Transactions on Communications.

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

[6]  Norman Zadeh,et al.  On building minimum cost communication networks , 1973, Networks.

[7]  M. Eisenberg.  Engineering traffic networks for more than one busy hour , 1977, The Bell System Technical Journal.

[8]  Amitava Dutta,et al.  Design of private backbone networks -- I: time varying traffic , 1993 .

[9]  M. Ackroyd.  Call Repacking in Connecting Networks , 1979, IEEE Trans. Commun..

[10]  R. F. Rey,et al.  Engineering and Operations in the Bell System , 1983 .

[11]  Eric Rosenberg,et al.  A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communications Network , 1987, Oper. Res..

[12]  Yogesh K. Agarwal.  An algorithm for designing survivable networks , 1989, AT&T Technical Journal.

[13]  W. Elsner.  A descent algorithm for the multihour sizing of traffic networks , 1977, The Bell System Technical Journal.

[14]  S. Hurtubise,et al.  Dynamic Routing and Call Repacking in Circuit-Switched Networks , 1983, IEEE Trans. Commun..

[15]  Bernard Yaged,et al.  Minimum cost routing for static network models , 1971, Networks.

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