Dynamic multicasting on bi-directional rings

Motivated by the advantages of least-loaded based routing for point-to-point connection, we propose a new dynamic multicasting algorithm called least loaded multicast (LLM) for bi-directional rings. The basic idea is to select the least loaded links for multicast connections so as to maximize the network throughput. The “revenue loss factor” γ of the network is adopted as the performance metric of the multicasting algorithm. Computer simulation shows that LLM routing is stable even near the saturation region and γ is significantly smaller than that of the minimum-hop routing