Network coding link optimization problems based on genetic and particle swarm algorithm

Author

Xinjian Zhuo ; Jinrui Han ; Jincheng Han

Author_Institution

Sch. of Sci., Beijing Univ. of Posts & Telecommun., Beijing, China

fYear

2012

fDate

Oct. 30 2012-Nov. 1 2012

Firstpage

34

Lastpage

37

Abstract

Considering a multicast scenario, we want to minimize the coding nodes used for network coding while achieving the desired throughput. By using the genetic and particle swarm algorithm, this article solves the optimization of the network coding. According to the simulation results, it can be concluded that the genetic and particle swarm algorithm has faster convergence speed than the genetic algorithm in solving the problem of network coding optimization, and it can get better suboptimal value in a shorter period of time.

Keywords

genetic algorithms; network coding; particle swarm optimisation; convergence speed; genetic algorithm; multicast scenario; network coding link optimization problems; particle swarm algorithm; Biological cells; Encoding; Genetic algorithms; Genetics; Network coding; Particle swarm optimization; Topology; genetic and particle swarm algorithm; network coding; optimizing of network coding;

fLanguage

English

Publisher

ieee

Conference_Titel

Cloud Computing and Intelligent Systems (CCIS), 2012 IEEE 2nd International Conference on

Conference_Location

Hangzhou

Print_ISBN

978-1-4673-1855-6

Type

conf

DOI

10.1109/CCIS.2012.6664362

Filename

6664362