An optimal deployment strategy for ISDN switches in metropolitan networks: modeling and algorithm

In the initial stage of ISDN, ISDN switches (hosts) are installed in the main areas and the other areas are covered by remote systems. As the number of subscribers of a remote system increases this remote system will be replaced with a host, considering costs of hosts and remote systems. We formulate the problem of finding an optimal deployment strategy of ISDN facilities, mainly switch and remote systems, over a planning horizon using an integer programming and develop a heuristic algorithm for the problem. The heuristic algorithm developed here uses a backward approach from the final time of the planning horizon and can be efficiently implemented for determining the ISDN switch installation time.

[1]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[2]  A. A. Fredericks Congestion in blocking systems — a simple approximation technique , 1980, The Bell System Technical Journal.

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

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