A compact genetic algorithm for the network coding based resource minimization problem

In network coding based data transmission, intermediate nodes in the network are allowed to perform mathematical operations to recombine (code) data packets received from different incoming links. Such coding operations incur additional computational overhead and consume public resources such as buffering and computational resource within the network. Therefore, the amount of coding operations is expected to be minimized so that more public resources are left for other network applications.In this paper, we investigate the newly emerged problem of minimizing the amount of coding operations required in network coding based multicast. To this end, we develop the first elitism-based compact genetic algorithm (cGA) to the problem concerned, with three extensions to improve the algorithm performance. First, we make use of an all-one vector to guide the probability vector (PV) in cGA towards feasible individuals. Second, we embed a PV restart scheme into the cGA where the PV is reset to a previously recorded value when no improvement can be obtained within a given number of consecutive generations. Third, we design a problem-specific local search operator that improves each feasible solution obtained by the cGA. Experimental results demonstrate that all the adopted improvement schemes contribute to an enhanced performance of our cGA. In addition, the proposed cGA is superior to some existing evolutionary algorithms in terms of both exploration and exploitation simultaneously in reduced computational time.

[1]  Xin Yao,et al.  Population-Based Incremental Learning With Associative Memory for Dynamic Environments , 2008, IEEE Transactions on Evolutionary Computation.

[2]  Shumeet Baluja,et al.  Evolution-Based Methods for Selecting Point Data for Object Localization: Applications to Computer-Assisted Surgery , 2004, Applied Intelligence.

[3]  Yuefeng Ji,et al.  An improved quantum-inspired evolutionary algorithm for coding resource optimization based network coding multicast scheme , 2010 .

[4]  David E. Goldberg,et al.  A Survey of Optimization by Building and Using Probabilistic Models , 2002, Comput. Optim. Appl..

[5]  Yunnan Wu,et al.  Minimum-energy multicast in mobile ad hoc networks using network coding , 2004, Information Theory Workshop.

[6]  Aluizio F. R. Araújo,et al.  MulRoGA: A Multicast Routing Genetic Algorithm approach considering multiple objectives , 2008, Applied Intelligence.

[7]  Yunnan Wu,et al.  Network Coding for the Internet and Wireless Networks , 2007, IEEE Signal Processing Magazine.

[8]  Rahul Sukthankar,et al.  Multiple Adaptive Agents for Tactical Driving , 1998, Applied Intelligence.

[9]  Christina Fragouli,et al.  Information flow decomposition for network coding , 2006, IEEE Transactions on Information Theory.

[10]  Chang Wook Ahn,et al.  Elitism-based compact genetic algorithms , 2003, IEEE Trans. Evol. Comput..

[11]  Muriel Médard,et al.  Genetic Representations for Evolutionary Minimization of Network Coding Resources , 2007, EvoWorkshops.

[12]  José Ignacio Hidalgo,et al.  A parallel compact genetic algorithm for multi-FPGA partitioning , 2001, Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing.

[13]  Panos M. Pardalos,et al.  A survey of combinatorial optimization problems in multicast routing , 2005, Comput. Oper. Res..

[14]  Heitor Silvério Lopes,et al.  A Compact Genetic Algorithm with Elitism and Mutation Applied to Image Recognition , 2008, ICIC.

[15]  Muriel Médard,et al.  Evolutionary Approaches To Minimizing Network Coding Resources , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[16]  Rong Qu,et al.  A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems , 2010, Applied Intelligence.

[17]  R. Yeung,et al.  Secure network coding , 2002, Proceedings IEEE International Symposium on Information Theory,.

[18]  Prabhas Chongstitvatana,et al.  A hardware implementation of the Compact Genetic Algorithm , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[19]  David E. Goldberg,et al.  The compact genetic algorithm , 1999, IEEE Trans. Evol. Comput..

[20]  Sun Jin Kim,et al.  Evolutionary algorithms for route selection and rate allocation in multirate multicast networks , 2007, Applied Intelligence.

[21]  Bu-Sung Lee,et al.  A survey of application level multicast techniques , 2004, Comput. Commun..

[22]  Sheng-Fuu Lin,et al.  A self-organization mining based hybrid evolution learning for TSK-type fuzzy model design , 2010, Applied Intelligence.

[23]  R. Koetter,et al.  An algebraic approach to network coding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[24]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[25]  John C. Gallagher,et al.  A family of compact genetic algorithms for intrinsic evolvable hardware , 2004, IEEE Transactions on Evolutionary Computation.

[26]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[27]  Michael Langberg,et al.  The encoding complexity of network coding , 2005, ISIT.

[28]  Rong Qu,et al.  A Population Based Incremental Learning for Delay Constrained Network Coding Resource Minimization , 2011, EvoApplications.

[29]  M. Médard,et al.  On Minimizing Network Coding Resources : An Evolutionary Approach , 2005 .

[30]  Xin Yao,et al.  Experimental study on population-based incremental learning algorithms for dynamic optimization problems , 2005, Soft Comput..