Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published May 2007 | Published
Book Section - Chapter Open

Evolutionary Approaches To Minimizing Network Coding Resources

Abstract

We wish to minimize the resources used for network coding while achieving the desired throughput in a multicast scenario. We employ evolutionary approaches, based on a genetic algorithm, that avoid the computational complexity that makes the problem NP-hard. Our experiments show great improvements over the sub-optimal solutions of prior methods. Our new algorithms improve over our previously proposed algorithm in three ways. First, whereas the previous algorithm can be applied only to acyclic networks, our new method works also with networks with cycles. Second, we enrich the set of components used in the genetic algorithm, which improves the performance. Third, we develop a novel distributed framework. Combining distributed random network coding with our distributed optimization yields a network coding protocol where the resources used for coding are optimized in the setup phase by running our evolutionary algorithm at each node of the network. We demonstrate the effectiveness of our approach by carrying out simulations on a number of different sets of network topologies.

Additional Information

© 2007 IEEE. Reprinted with permission. Current Version Published: 2007-05-29. The first author would like to thank Fang Zhao for her help on the experiments.

Attached Files

Published - KIMinfocom07.pdf

Files

KIMinfocom07.pdf
Files (488.9 kB)
Name Size Download all
md5:f862f067ad152361763860a2dee39865
488.9 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 17, 2023