Abstract
Virtual Path (VP) Assignment is an important resource management activity in ATM networks. By using the VP concept, the logical layout of the network can be administered to minimize the total network cost to the provider. We formulate the VP Assignment problem as a constrained optimization problem; the objective function to be minimized reflects processing/control costs at nodes and transmission costs between nodes. The quality of service requirements and overall throughput of the network are taken into consideration in the solution process as constraints.
Since the solution space is complex, we develop a heuristic algorithm based on descent methods to reach a “near-optimal” VP configuration for a given physical network and traffic demand. The Multi-Rate Loss Network model is used in the calculation of connection-level blocking probabilities. Results for static connection-routing are presented, for various forms of the objective function and constraints.
Chapter PDF
Similar content being viewed by others
References
Addie, G. and Burgin, John and Sutherland, S. L. (1988) B-ISDN Protocol Architecture, in Proceedings of IEEE GLOBECOM, 22.6.1, Hollywood,FL.
Arvidsson, A. (Oct. 1994) Real Time Management of Reconfigurable Virtual Path Networks in B-ISDN, TRC Report No. 15/94, Teletraffic Research Centre, The University of Adelaide.
Aydemir, M. and Viniotis I. (1995) Virtual Path Assignment Problem in ATM Networks, CACC Report, NCSU, Raleigh, NC.
Baskett, F. and Chandy, K. M. and Muntz, R. R. and Palacios, F. G. (1975) Open, Closed and Mixed Networks of Queues with Different Classes of Customers, in Journal of the ACM, 22, 248–60.
Bertsekas, Dimitri and Gallager, Robert. (1992) Data Networks, 2nd Edition. 524–8. Prentice Hall.
Burgin, John and Dorman, Dennis. (Sep. 1991) Broadband ISDN Resource Management: The Role of Virtual Paths, in IEEE Communications Magazine, 44–48.
Cheng, Kwang-Ting and Lin, Frank Yeung-Sung. (1994) On the Joint Virtual Path Assignment and Virtual Circuit Routing in ATM Networks, in Proceedings of the IEEE GLOBECOM, 777–82.
Chlamtac, Imrich and Faragó, Andras and Zhang, Tao. (May 1993) How to Establish and Utilize Virtual Paths in ATM Networks, in Conference Record of the IEEE International Conference on Communications (ICC), Geneva, Switzerland.
Chung, Sun-Ping and Ross, Keith W. (1993) Reduced Load Approximations for Multirate Loss Networks, in IEEE Transactions on Communications,41(8), 1222–31.
Kanada, T. and Sato, K. and Tsuboi T. (1987) An ATM Based Transport Network Architecture, in IEEE COMSOC Int. Workshop on Future Prospects of Burst/Packetized Multimedia Communications, Osaka, JAPAN.
Kaufman, Joseph S. (1981) Blocking in a Shared Resource Environment, in IEEE Transactions on Communications,COM-29(10), 1474–81.
Kelly, F. P. (1986) Blocking Probabilities in Large Circuit-Switched Networks, in Advances in Applied Probability, 18, 473–505.
Lam, S. S. (Jul. 1977) Queueing Networks with Population Size Constraints, in IBM Journal of Research and Development, 370–8.
Lin, Frank Yeung-Sung and Cheng, Kwang-Ting. (Dec. 1993) Virtual Path Assignment and Virtual Circuit Routing in ATM Networks, in Proceedings of the IEEE GLOBECOM, 436–41. Houston, Texas.
Sato, Ken-Ichi and Ohta, Satoru and Tokizawa, Ikuo. (1990) Broad-Band ATM Network Architecture Based on Virtual Paths, in IEEE Transactions on Communications, COM-38(8), 1212–22.
Siebenhaar, Rainer (1994) Optimized ATM Virtual Path Bandwidth Management Under Fairness Constraints, in Proceedings of the IEEE GLOBECOM, 924–8.
Tokizawa, I and Kanada, T. and Sato, K. (1988) A New Transport Network Architecture Based on Asynchronous Transfer Mode Techniques, in Proceedings of ISSLS’88, 11.2.15, Boston, MA.
Whitt, Ward. (1985) Blocking When Service is Required From Several Facilities Simultaneously, in ATS?T Technical Journal, 64(8), 1807–56. Prentice Hall Inc., NJ.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Aydemir, M., Viniotis, Y. (1996). Virtual Path Assignment in ATM Networks. In: Fdida, S., Onvural, R.O. (eds) Data Communications and their Performance. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34942-8_25
Download citation
DOI: https://doi.org/10.1007/978-0-387-34942-8_25
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4908-3
Online ISBN: 978-0-387-34942-8
eBook Packages: Springer Book Archive