DocumentCode
3037996
Title
On the Coding-Link Cost Tradeoff in Multicast Network Coding
Author
Kim, Minkyu ; Medard, Muriel ; Aggarwal, Varun ; O´Reilly, Una-May
Author_Institution
Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA 02139. Email: minkyu@mit.edu
fYear
2007
fDate
29-31 Oct. 2007
Firstpage
1
Lastpage
7
Abstract
We investigate the issue of the tradeoff between network coding and link usage in multicast network coding. Network coding makes minimum-cost multicast, an NP-complete problem with traditional routing alone, polynomially solvable, but if we consider the network coding capability as a resource, the link cost is actually minimized at the expense of the coding cost. We show that identifying such a tradeoff is NP-hard. For this problem, we propose an evolutionary approach that generalizes our previously proposed algorithms for coding resource optimization. Based on an existing multi-objective genetic algorithm, we develop a novel selection mechanism that utilizes some specific characteristics of the problem. We then show that the algorithm can be implemented in a distributed manner and evaluate the algorithm´s performance by performing experiments on several topologies.
Keywords
Artificial intelligence; Costs; Genetic algorithms; Intelligent networks; Laboratories; NP-complete problem; Network coding; Performance evaluation; Polynomials; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Military Communications Conference, 2007. MILCOM 2007. IEEE
Conference_Location
Orlando, FL, USA
Print_ISBN
978-1-4244-1513-7
Electronic_ISBN
978-1-4244-1513-7
Type
conf
DOI
10.1109/MILCOM.2007.4454941
Filename
4454941
Link To Document