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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ahlswede, R., Cai, N., Li, S.-Y.R., Yeung, R.W.: Network information flow. IEEE Transactions on Information Theory 46, 1204–1216 (2000)
Li, S.Y.R., Yeung, R.W., Cai, N.: Linear network coding. IEEE Transactions on Information Theory 49(2), 371–381 (2003)
Ho, T., Koetter, R., Medard, M., Karger, D., Effros, M.: The Benefits of Coding over Routing in a Randomized Setting. In: Proceedings of the International Symposium on Information Theory, pp. 442–447 (2003)
Koetter, R., Medard, M.: An algebraic approach to network coding. IEEE/ACM Transactions on Networking 11(5), 782–795 (2003)
Sanders, P., Egner, S., Tolhuizen, L.: Polynomial time algorithms for network information flow. In: 15th ACM Symposium on Parallel Algorithms and Architectures, San Diego, CA, pp. 286–294 (2003)
Jaggi, S., Chou, P.A., Jain, K.: Low complexity algebraic multicast network codes. In: Proc. ISIT, Yakohama, Japan, p. 368 (2003)
Lun, D.S., Ratnakar, N., Medard, M., Koetter, R., Karger, D.R., Ho, T., Ahmed, E., Zhao, F.: Minimum-cost multicast over coded packet networks. IEEE Trans. Inf. Theory 52(6), 2608–2623 (2006)
Chi, K., Yang, C., Wang, X.: Performance of network coding based multicast. IEE Proc.-Commun. 153(3), 399–404 (2006)
Wang, J., Liu, J., Wang, X.: Performance Analysis of Multicast Routing Algorithm Based on Network Coding. Journal of Electronics & Information Technology 30(11), 2605–2608 (2008)
Zhu, Y., Li, B., Guo, J.: Multicast with Network Coding in Application-Layer Overlay Networks. IEEE Journal on Selected Areas in Communications 22(1), 1–13 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tang, D., Lu, X., Li, J. (2013). Multicast Routing Algorithm Based on Network Coding. In: Liu, D., Alippi, C., Zhao, D., Hussain, A. (eds) Advances in Brain Inspired Cognitive Systems. BICS 2013. Lecture Notes in Computer Science(), vol 7888. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38786-9_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-38786-9_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38785-2
Online ISBN: 978-3-642-38786-9
eBook Packages: Computer ScienceComputer Science (R0)