Multicasting VP Design Methodology Using Simulated Annealing in an ATM Network



J.T. Park
School of Electronic and Electrical,
Kyungpook National University
1370 Sankyuk-Dong, Buk-Gu, Taegu City, Korea
Email: park_AT_ee.kyungpook.ac.kr

J.H. Do
School of Electronic and Electrical,
Kyungpook National University
1370 Sankyuk-Dong, Buk-Gu, Taegu City, Korea
Email: jhdo_AT_palgong.kyungpook.ac.kr

C.M. Han
Department of Electronics Engineering,
Hankuk University of Foreign Studies
89 Wangsan, Mohyun, Yongin, Kyonggi-Do, Korea
Email: cmhan_AT_maincc.hufs.ac.kr



Abstract
Multicast routing over semi-permanent VPs (virtual paths) in an ATM (asynchronous transfer mode)-based B-ISDN (broadband integrated services digital network) determines a set of VPs connecting from a source node to destination nodes. The problem of finding the optimal constrained multicasting tree over the semi-permanent VPs in an ATM network is known to be NP (nondeterministic polynomial time)-complete. We develop an optimization methodology for searching a constrained multicast routing tree with minimum cost, using simulated annealing technique. We define the problem-dependent components such as state space and cost function, and refine the implementation-dependent factors including initial temperature and cooling schedule. The simulation results show that our optimization methodology demonstrates good behavior in terms of performance on a variety of graphs modeling the sample ATM networks.

Keywords: High-speed network management, ATM network management, multipoint virtual paths design, optimization, simulated annealing

This paper appears in Vol. 4, No. 2 of JNSM.

NOTE: only abstract of paper available on-line

Back to JNSM main page