A best-effort multicast algorithm

Today's IP networks have seen a growing number of applications whose traffic are most efficiently transported using multicast forwarding service. In this paper, we present a scalable, sender-initiated, performance-driven, best-effort tree construction algorithm, which adapts to the changing network conditions. The algorithm does not use any unicast routing protocol. We demonstrate the operations and evaluate the performance of the algorithm using computer simulations.