Link set sizing for networks supporting SMDS

To size networks that support switched multimegabit data service (SMDS), one must determine how much additional capacity is needed and where it is needed so as to minimize the total capacity augmentation cost. Two combinatorial optimization problem formulations are considered and compared for their relative applicability and complexity. A solution procedure based on Lagrangean relaxation is proposed for one of the formulations. In computational experiments, the proposed algorithm determines solutions that are within a few percent of an optimal solution in minutes of CPU time for networks with 10-26 nodes. The proposed algorithm is compared with a most congested first (MCF) heuristic. For the test networks, it achieves up to 152% improvement in the total cost over the MCF heuristic. >

[1]  J. L. Wang,et al.  Minimax open shortest path first routing algorithms in networks supporting the SMDS service , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[2]  J. L. Wang,et al.  An integrated methodology for supporting packet network engineering , 1990, [Proceedings] GLOBECOM '90: IEEE Global Telecommunications Conference and Exhibition.

[3]  Mischa Schwartz,et al.  Telecommunication networks , 1987 .

[4]  Mischa Schwartz,et al.  Telecommunication networks: protocols, modeling and analysis , 1986 .

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

[6]  Jonathan L. Wang.  An integrated methodology for supporting network planning and traffic engineering with considerations to SMDS service , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[7]  Frank Yeong-Sung Lin.  Allocation of end-to-end delay objectives for networks supporting SMDS , 1993 .

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

[9]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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