摘要
This paper proposes an algorithm for multicast routing in ATMnetworks. We define the network cost of a routing as the combinationof the cost. If establishing connections, the cost of the overallbandwidth and overall switchings, our routing algorithm works on theoriginal topology of ATM networks with physical switches and physi-cal links, and different switching functionalities of VirtualPath(VP)switches and Virtual Channel(VC)switches in the network. Itgenerates an optimal multicast routing with the minimal overallnetwork cost. Simulations with MATLAB have been made to compare thequality of the routing generated by our algorithm with those of othertwo Major algorithms.
This paper proposes an algorithm for multicast routing in ATMnetworks. We define the network cost of a routing as the combinationof the cost. If establishing connections, the cost of the overallbandwidth and overall switchings, our routing algorithm works on theoriginal topology of ATM networks with physical switches and physi-cal links, and different switching functionalities of VirtualPath(VP)switches and Virtual Channel(VC)switches in the network. Itgenerates an optimal multicast routing with the minimal overallnetwork cost. Simulations with MATLAB have been made to compare thequality of the routing generated by our algorithm with those of othertwo Major algorithms.