Abstract
Multicast routing over semi-permanent VP (virtual path)s 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Burgin, Broadband ISDN resource management: The role of virtual paths,IEEE Comm. Mag., pp. 44–48, 1991.
B. M. Waxman, Routing of multiple connections,IEEE Journal on Sel. Areas in Comm., Vol. SAC-6, No. 9, pp. 1617–1622, 1988.
D. Bertsekas and R. G. Gallager,Data Networks, Prentice-Hall, Inc., 1989.
F. K. Hwang and D. S. Richards, Steiner tree problems,Networks, Vol. 22, No. 1, pp. 55–89, January 1992.
J. T. Park, Heuristics for design of multi-point circuit layout,AT&T Bell Lab. Technical Memorandum, 1988.
C. A. Noronha, Jr. and F. A. Tobagi, Optimal routing of multicast streams,Proc. of IEEE Infocom '94, Toronto, Canada, pp. 865–873, June 1994.
S. Y. Cheung and A. Kumar, Efficient quorumcast routing algorithms,Proc. of IEEE Infocom '94, Toronto, Canada, pp. 840–847, June 1994.
M. H. Ammar, Probabilistic multicast: generalizing the multicast paradigm to improve scalability,Proc. of IEEE Infocom '94, Toronto, Canada, pp. 848–855, June 1994.
S. Ahn, R. P. Tsang, S.-R. Tong, and D. H. C. Du, Virtual path layout design on ATM networks,Proc. of IEEE Infocom '94, Toronto, Canada, pp. 192–200, June 1994.
J. S. Turner, Design of a broadcast packet switching network,IEEE Trans. on Comm., Vol. COM-36, No. 6, pp. 734–743, June 1988.
R. Bubenik, J. Dehart, and M. Gaddis, Multipoint connection management in high speed networks,Proc. of Infocom '91, pp. 59–68, 1991.
V. P. Kompella, J. C. Pasquale, and G. C. Polyzos, Multicasting for multimedia applications,Proc. of Infocom '92, pp. 2078–2085, 1992.
CCITT Draft Recommendation I. 311, B-ISDN general network aspects,SG XIII, January 1990.
H. Tode,et al., Multicast routing algorithm for nodal load balancing,Proc. of Globecom '92, pp. 2086–2095, 1992.
E. Cavallero, U. Mocci, C. Scoglio, and A. Tonietti, Optimization of virtual path/virtual circuit management in ATM networks,Proceedings of Networks '92, 1992.
R. W. Floyd, Algorithm 97: Shortest path,Comm. of the ACM, Vol. 5, 1962.
S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by simulated annealing,Science, Vol. 220, No. 4598, pp. 671–680, May 1983.
Romeo, F.,et al., Research on simulated annealing at Berkeley, Proc. 1984 IEEE International Conference on Computer Design, pp. 652–657, 1984.
Sechen, C.,et al., Timber Wolf 3.2: A new standard cell placement and global routing package, Proc. Design Automation Conference, 1986.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Park, J.T., Do, J.H. & Han, C.M. Multicasting VP design methodology using simulated annealing in an ATM network. J Netw Syst Manage 4, 133–153 (1996). https://doi.org/10.1007/BF02139131
Issue Date:
DOI: https://doi.org/10.1007/BF02139131