Abstract
Dynamic reconfiguration is a network management control which reserves transmission capacity on the communication links in order to form dedicated logical paths for each origin-destination flow. We present an efficient deterministic algorithm (XFG) to rapidly compute an optimal network configuration. We apply reconfiguration to a model of an ATM network. The XFG calculation of an optimal configuration requires a few seconds of CPU time (Pentium 100MHz) whereas a standard NLP package requires several hours to compute an optimal network configuration.
Chapter PDF
Similar content being viewed by others
Keywords
References
Faragó A., Blaabjerg S., Ast L., Gordos G. and Henk T.. A New Degree of Freedom in ATM Network Dimensioning: Optimizing the Logical Con- figuration. IEEE J. on Selected Areas in Comms.,13:71199–1206.
Kelly F.P. (1991) Loss networks. Annals of Applied Prob., 1:3, 473–505.
Lawrence C., Zou J.L. and Tits A.L. (1996) User’s Guide for CFSQP Version 2.4. Report Number TR-94–16r1, Electrical Engineering Departmenand Institute for Systems Research, University of Maryland, College Park, MD 20742 USA.
Mitra D. and Seery J.B. (1990) Comparative Evaluations of Randomized and Dynamic Routing Strategies for Circuit-Switched Networks. IEEE Trans. Comm., 31, 102–116.
Mitra D., Morrison J.A. and Ramakrishnan K.G. (1996) ATM network design and optimization: a multirate loss network framework. Proc IEEE INFOCOM ’96, 994–1003.
Ross K.W. (1995) Multiservice Loss Models for Broadband Telecommunication Networks. Springer-Verlag, Berlin.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Berezner, S.A., Krzesinski, A.E. (1998). Call admission and routing in ATM networks based on virtual path separation. In: Kühn, P.J., Ulrich, R. (eds) Broadband Communications. BC 1998. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35378-4_36
Download citation
DOI: https://doi.org/10.1007/978-0-387-35378-4_36
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4683-9
Online ISBN: 978-0-387-35378-4
eBook Packages: Springer Book Archive