Dynamic bi-directional multicast shared tree

Abstract

This paper presents a proposed architecture for a MultiPoint-to-MultiPoint routing algorithm for large-scale high-speed networks. This algorithm builds a bi-directional multicast tree. The tree is shared among multicast group members. The presented architecture is useful for multicast applications within a single autonomous domain. It requires full topology and group membership knowledge. It considers two different metric parameters delay and cost. This consideration directs the multicast traffic to routes different from those of unicast and broadcast traffics. The goal of this architecture is to create a congestion prevention policy, as an open loop solution for traffic control. A good design attempts to balance the load over the domain and avoids traffic concentration, especially that multicast traffics are greedy in bandwidth consumption. The experiments show the advantages of using this architecture over traditional multicast routing. The performance is compared in terms of the required buffer size, the number of forwarded packets, end-to-end delay, and packet loss rate. The architecture scales well with the increase of the number of senders within a multicast group. ©2009 IEEE.