An algorithm for configuring embedded networks in reconfigurable telecommunication networks

This paper considers a problem of configuring logical networks by employing a self-planning facility in a telecommunication network carrying voice-grade calls to make the least-cost configuration where the involved system cost includes hop cost and lost-call traffic cost. The hop cost depends on the number of self-planning facilities included on routing path connecting the associated node pairs, while the lost-call traffic cost is incurred due to link capacities. The configuration problem is analyzed through dimensioning and routing on a reconfigurable network in a mixed 0/1 nonlinear programming approach for which lower bounds are found by Lagrangian relaxation embedded in a hybrid search procedure for the associated dual problem. Heuristic solution procedures are exploited and their efficiencies are tested with various numerical examples.

[1]  Frank Yeong-Sung Lin,et al.  A routing algorithm for virtual circuit data networks with multiple sessions per O - D pair , 1992, Networks.

[2]  Hasan Pirkul,et al.  Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality , 1985, Math. Program..

[3]  John Bellamy.  Digital Telephony , 1982 .

[4]  P. J. Zanella.  Customer network reconfiguration applications utilizing digital cross-connect systems , 1988, IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age.

[5]  Mario Gerla,et al.  Topology design and bandwidth allocation in ATM nets , 1989, IEEE J. Sel. Areas Commun..

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

[7]  Deb Ghosh,et al.  Configuring express pipes in emerging telecommunication networks , 1993, Telecommun. Syst..

[8]  Michel Gendreau,et al.  An algorithm for network dimensioning under reliability considerations , 1992, Ann. Oper. Res..

[9]  Moshe Dror,et al.  CIRCUIT NETWORK DESIGN UNDER RELIABILITY CONSTRAINTS , 1988 .

[10]  P. Camerini,et al.  On improving relaxation methods by modified gradient techniques , 1975 .

[11]  A. Weinrib,et al.  Dynamic network configuration management , 1990, IEEE International Conference on Communications, Including Supercomm Technical Sessions.

[12]  Andre Girard,et al.  Routing and Dimensioning in Circuit-Switched Networks , 1990 .

[13]  Ming-Jeng Lee,et al.  An efficient near-optimal algorithm for the joint traffic and trunk routing problem in self-planning networks , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[14]  Hasan Pirkul.  Configuring distributed computer systems , 1986 .

[15]  Howard L. Lemberg,et al.  An Analysis of Alternative Architectures for the Interoffice Network , 1986, IEEE J. Sel. Areas Commun..

[16]  D. L. Jagerman.  Methods in traffic calculations , 1984, AT&T Bell Laboratories Technical Journal.

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

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

[19]  J. R. Yee,et al.  A partial branch and bound design algorithm for reconfigurable networks , 1991, ICC 91 International Conference on Communications Conference Record.

[20]  C. Pack,et al.  Communications network planning in the evolving information age , 1987, IEEE Communications Magazine.

[21]  Prabhakant Sinha,et al.  The Multiple-Choice Knapsack Problem , 1979, Oper. Res..

[22]  W. Hutcheson,et al.  Control Services Based on Digital Cross-Connect Systems , 1987, IEEE J. Sel. Areas Commun..

[23]  K. R. Krishnan.  The convexity of loss rate in an Erland loss system and sojourn in an Erlang delay system with respect to arrival and service rates , 1990, IEEE Trans. Commun..

[24]  A. Jagers,et al.  On the continued Erlang loss function , 1986 .