Loading...

An evolutionary approach to generalized mirror sites problem

Etemadi Tajbakhsh, S ; Sharif University of Technology | 2009

334 Viewed
  1. Type of Document: Article
  2. DOI: 10.1063/1.3130631
  3. Publisher: 2009
  4. Abstract:
  5. The minimum cost subgraph for joint distributed source and network coding has been studied using a linear programming approach. This problem considers some statistically correlated information sources in a network, where sending over each link has a defined cost. The desired solution to this problem is a set of coding rates over the graph links, that minimizes the total communication costs. But in this problem, the placement of the sources is pre-defined, which is not necessarily optimal. In this paper, for the first time, we find a "good" placement for the sources using a genetic programming approach. This problem can be seen as the generalized mirror sites problem, where sources are not restricted to replication of data and transmission by routing. © 2009 American Institute of Physics
  6. Keywords:
  7. Distributed source coding ; Genetic programming ; Network coding
  8. Source: 1st International Conference on Bio-Inspired Computational Methods Used for Solving Difficult Problems-Development of Intelligent and Complex Systems, BICS 2008, Tirgu Mures, 5 November 2008 through 7 November 2008 ; Volume 1117 , 2009 , Pages 40-46 ; 0094243X (ISSN); 9780735406544 (ISBN)
  9. URL: https://aip.scitation.org/doi/abs/10.1063/1.3130631