Abstract
Many applications of ATM networks require a multicast function, which is used to send the same packet to a group of destinations. This paper proposed an algorithm for multicast routing in ATM networks. We define the network cost of routing as the combination of the cast of establishing connections, the cost of the overall bandwidth and the cost of the overall switching. Our routing algorithm works on the original topology of ATM networks with physical switches and physical links and considers the different switching functions of VP (virtual path) switches and VC (virtual channel) switches. It generates optimal multicast routing with minimal overall network cost. Simulations have been carried out to compare the quality of the routing generated by our algorithm with those of other major algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
