Study of Routing Algorithms for Multiparty Connections in ATM

摘要

This report deals with routing algorithms for multiparty connections in ATM. Themotivation for multiparty calls come from the recognition that there is a wide class of applications that requires this call configuration. We consider multiparty calls as the general communication mode. We start our investigation by studying the theoretical background. Multiparty calls can be modeled as the Steiner Problem in Networks. We study the behavior of these algorithms and will look at heuristic solutions. We present measures to characterize these various algorithms, the efficiency of their solutions, and the execution times. In order to do this, we performed simulations, using a tool called MCRSIM.