Evolutionary Approaches to Minimizing Network Coding Resources

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages, 6 figures, accepted to the 26th Annual IEEE Conference on Computer Communications (INFOCOM 2007)

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Evolutionary Approaches to Minimizing Network Coding Resources does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Evolutionary Approaches to Minimizing Network Coding Resources, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Evolutionary Approaches to Minimizing Network Coding Resources will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-218398

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.