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, the authors investigate the newly emerged problem of minimizing the amount of coding operations required in network coding based multicast. To this end, they develop the first elitism-based compact Genetic Algorithm (cGA) to the problem concerned, with three extensions to improve the algorithm performance.

Provided by: University of Notre Dame (Mendoza) Topic: Networking Date Added: Jun 2011 Format: PDF

Find By Topic