Adapted routing algorithm in the overlay multicast

With the rapid growth of multimedia applications, Internet has been becoming crowded. IP multicast was proposed to help this situation, but not widely deployed for its scalability and fundamental network requirement problem. Application-layer multicast (also called Overlay multicast) is an attractive alternative solution. In this paper, we developed an adapted routing algorithm of overlay networks to provide scalable multicast services on the Internet. The algorithm defines an optimal balance tree to optimize the trade-off between delay and bandwidth consumption with a new metrics: OBDB. Our experimental results demonstrate the scalability, efficiency and performance of our approach.