Multicast routing algorithm based on network coding

Authors:
Dongming Tang;Xianliang Lu;Juguang Li
Affiliations:
School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China,School of Information Engineering, Southwest University of Science and Technolo ...;School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China;School of Information Engineering, Southwest University of Science and Technology, Mianyang, China
Venue:
BICS'13 Proceedings of the 6th international conference on Advances in Brain Inspired Cognitive Systems
Year:
2013

Citing 6
Cited 0

Polynomial time algorithms for network information flow

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory
Minimum-cost multicast over coded packet networks

IEEE Transactions on Information Theory
Multicast with network coding in application-layer overlay networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Network coding has been proved can approach the max-flow min-cut limit of the network graph and can improve the performance of multicast communication. Considering the advantages of Dijkstra shortest path algorithm and network coding respectively, an improved multicast routing algorithm based on network coding is proposed in this paper. The details of algorithm are given to construct a proper multicast topology for data transmission. The simulation results show proposed algorithm has an apparent advantage of throughput and load balance compared with shortest path distribution tree algorithm, and has better advantage than previously proposed multicast routing algorithm based on network coding in terms of the metrics of load balance.