Locality-preserving randomized multicast routing on k-ary n-cube
Ting Zhou, Youjian Zhao, Zhenhua Liu, Xiaoping Zhang · International Conference on Information Networking · 2009
With the growth of interest in multicast communication networks, the importance of routing techniques for multicast connections is being emphasized. In this paper, we propose a new multicast algorithm for a k-ary n-cube network ,the Randomized Local Balance Multicast (RLBM) that outperforms unicast-based multicast routing scheme. Simulation results show that if choosing the proper threshold , the RLBM performs very well under different conditions with lower average delay and higher saturation throughput.