Advertisement

A Network Coding Optimization Algorithm for Reducing Encoding Nodes

  • Limin Meng
  • Yangtianxiu Hu
Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 251)

Abstract

Network coding can effectively improve the transmission efficiency of the network, but compared with the traditional forwarding nodes, the participation of network encoding nodes will bring resource consumption. In this paper, we propose an improved algorithm of the max-flow based on the shortest path, which combines the concept of path capacity summation to achieve the maximum flow of the network, and the shortest path guarantees the minimal number of encoding nodes. The simulation results based on random network show that this algorithm can effectively reduce the encoding nodes and the consumption of network resources on the basis of realizing the maximum flow of the network.

Keywords

Network coding Encoding nodes The shortest path Max-flow Capacity summation 

Notes

Acknowledgement

Thanks for the support of Zhejiang Provincial Key Laboratory of Communication Network Applications, National Natural Science Foundation of China (61372087) and Natural Science Foundation of Zhejiang Province (LY18F010024).

References

  1. 1.
    Ahlswede, R., Cai, N., Li, S.Y.R., et al.: Network information flow. IEEE Trans. Inf. Theory 46, 1204–1216 (2000)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Hu, J.X., Liu, S.Y.: Improved multicast network coding algorithm. Comput. Eng. Appl. 47(15), 116–118 (2011)Google Scholar
  3. 3.
    Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 1(1), 269–271 (1959)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Yeung, R.W., Li, S.Y.R., Cai, N., et.al.: Network Coding Theory. Now Publishers Inc. (2006)Google Scholar
  5. 5.
    Tao, S.G., Huang, J.Q., Yang, Z.K., et al.: An improved algorithm for minimal cost network coding. Huazhong Univ. Sci. Tech. (Natural Sci. Edit.) 36(5), 1–4 (2008)Google Scholar
  6. 6.
    Yefim, D.: Algorithm for solution of a problem of maximum flow in a network with power estimation. Dokl. Akad. Nauk SSSR 11, 1277–1280 (1970)Google Scholar
  7. 7.
    Liu, J.F., Zhou, J.: Minimize coding node algorithm based on polynomial time algorithms. In: The 23rd National Conference on New Computer Science and Technology and Computer Education (2012)Google Scholar
  8. 8.
    Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)CrossRefGoogle Scholar
  9. 9.
    Jaggi, S., Sanders, P., Chou, P.A., et al.: Polynomial time algorithms for multicast network code construction. IEEE Trans. Inf. Theory 51(6), 1973–1982 (2005)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Zhu, Y.Y., Cao, Z., Zhu, L.X.: An improved encoding nodes reduction algorithm for network. Electron. Electro—opt. Syst. 3, 47–52 (2012)Google Scholar
  11. 11.
    Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399–404 (1956)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Wang, H.Y., Huang, Q., Li, C.T., et al.: Graph algorithm and its MATLAB implementation. Beijing University of Aeronautics and Astronautics Press, Beijing (2010)Google Scholar
  13. 13.
    Waxman, B.M.: Routing of multipoint connections. IEEE J. Sel. Areas Commun. 6(9), 1617–1622 (1988)CrossRefGoogle Scholar

Copyright information

© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2018

Authors and Affiliations

  1. 1.College of Information EngineeringZhejiang University of TechnologyHangzhouChina

Personalised recommendations