Simulation of the Tree Algorthm in ATM Networks

This paper proposes an algorithm for multicast routing in ATM networks. We define the network cost of a routing as the combination of the cost. If establishing connections, the cost of the overall bandwidth and overall switchings, our routing algorithm works on the original topology of ATM networks with physical switches and physical links, and different switching functionalities of Virtual Path(VP) switches and Virtual Channel(VC) switches in the networks. It generates an optimal multicast routing with the minimal overall network cost. Simulations with MATLAB have been made to compare the quality of the routing generated by our algorithm with those of other two major algorithms.