Locality-preserving randomized multicast routing on k-ary n-cube

Authors:
Ting Zhou;Youjian Zhao;Zhenhua Liu;Xiaoping Zhang
Affiliations:
Department of Computer Science and Technology, Tsinghua University, Beijing. P. R. China;Department of Computer Science and Technology, Tsinghua University, Beijing. P. R. China;Department of Computer Science and Technology, Tsinghua University, Beijing. P. R. China;Department of Computer Science and Technology, Tsinghua University, Beijing. P. R. China
Venue:
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
Year:
2009

Citing 7
Cited 0

Design and analysis of a large-scale multicast output buffered ATM switch

IEEE/ACM Transactions on Networking (TON)
ROMM routing on mesh and torus networks

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Multicast ATM switches: survey and performance evaluation

ACM SIGCOMM Computer Communication Review
Locality-preserving randomized oblivious routing on torus networks

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Interconnection Networks: An Engineering Approach

Interconnection Networks: An Engineering Approach
Broadcast Ring Sandwich Networks

IEEE Transactions on Computers
GOAL: a load-balanced adaptive routing algorithm for torus networks

Proceedings of the 30th annual international symposium on Computer architecture

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.