An evolutionary approach to inter-session network coding
Whereas the theory and application of optimal network coding are well studied for the single-session multicast scenario, there is no known optimal network coding strategy for a more general connection problem where there are more than one session and receivers may demand different sets of informatio...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
2010
|
| Online Access: | http://hdl.handle.net/1721.1/54694 https://orcid.org/0000-0003-4059-407X |
| _version_ | 1826199720790327296 |
|---|---|
| author | O'Reilly, Una-May Medard, Muriel Traskov, Danail Kim, Minkyu |
| author2 | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
| author_facet | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory O'Reilly, Una-May Medard, Muriel Traskov, Danail Kim, Minkyu |
| author_sort | O'Reilly, Una-May |
| collection | MIT |
| description | Whereas the theory and application of optimal network coding are well studied for the single-session multicast scenario, there is no known optimal network coding strategy for a more general connection problem where there are more than one session and receivers may demand different sets of information. Though there have been a number of recent studies that demonstrate various utilities of network coding in the multi- session scenario, they rely on very restricted classes of codes in terms of the coding operations allowed and/or the location of decoding. In this paper, we propose a novel inter-session network coding strategy for a general connection problem. Our coding strategy allows fairly general random linear coding over a large finite field, in which decoding is done at receivers and the mixture of information at interior nodes is controlled by evolutionary mechanisms. We demonstrate how our coding strategy may surpass existing end-to-end pairwise XOR coding schemes in terms of effectiveness and practicality. |
| first_indexed | 2024-09-23T11:25:00Z |
| format | Article |
| id | mit-1721.1/54694 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T11:25:00Z |
| publishDate | 2010 |
| record_format | dspace |
| spelling | mit-1721.1/546942022-09-27T19:22:06Z An evolutionary approach to inter-session network coding Institute of Electrical and Electronics Engineers O'Reilly, Una-May Medard, Muriel Traskov, Danail Kim, Minkyu Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. Laboratory for Information and Decision Systems Medard, Muriel Kim, Minkyu O'Reilly, Una-May Medard, Muriel Whereas the theory and application of optimal network coding are well studied for the single-session multicast scenario, there is no known optimal network coding strategy for a more general connection problem where there are more than one session and receivers may demand different sets of information. Though there have been a number of recent studies that demonstrate various utilities of network coding in the multi- session scenario, they rely on very restricted classes of codes in terms of the coding operations allowed and/or the location of decoding. In this paper, we propose a novel inter-session network coding strategy for a general connection problem. Our coding strategy allows fairly general random linear coding over a large finite field, in which decoding is done at receivers and the mixture of information at interior nodes is controlled by evolutionary mechanisms. We demonstrate how our coding strategy may surpass existing end-to-end pairwise XOR coding schemes in terms of effectiveness and practicality. 2010-05-04T15:22:23Z 2010-05-04T15:22:23Z 2009-06 Article http://purl.org/eprint/type/ConferencePaper 978-1-4244-3512-8 0743-166X http://hdl.handle.net/1721.1/54694 Kim, M. et al. “An Evolutionary Approach To Inter-Session Network Coding.” INFOCOM 2009, IEEE. 2009. 450-458. © 2009 IEEE https://orcid.org/0000-0003-4059-407X en_US http://dx.doi.org/10.1109/INFCOM.2009.5061950 IEEE INFOCOM 2009 Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. application/pdf IEEE |
| spellingShingle | O'Reilly, Una-May Medard, Muriel Traskov, Danail Kim, Minkyu An evolutionary approach to inter-session network coding |
| title | An evolutionary approach to inter-session network coding |
| title_full | An evolutionary approach to inter-session network coding |
| title_fullStr | An evolutionary approach to inter-session network coding |
| title_full_unstemmed | An evolutionary approach to inter-session network coding |
| title_short | An evolutionary approach to inter-session network coding |
| title_sort | evolutionary approach to inter session network coding |
| url | http://hdl.handle.net/1721.1/54694 https://orcid.org/0000-0003-4059-407X |
| work_keys_str_mv | AT oreillyunamay anevolutionaryapproachtointersessionnetworkcoding AT medardmuriel anevolutionaryapproachtointersessionnetworkcoding AT traskovdanail anevolutionaryapproachtointersessionnetworkcoding AT kimminkyu anevolutionaryapproachtointersessionnetworkcoding AT oreillyunamay instituteofelectricalandelectronicsengineers AT medardmuriel instituteofelectricalandelectronicsengineers AT traskovdanail instituteofelectricalandelectronicsengineers AT kimminkyu instituteofelectricalandelectronicsengineers AT oreillyunamay evolutionaryapproachtointersessionnetworkcoding AT medardmuriel evolutionaryapproachtointersessionnetworkcoding AT traskovdanail evolutionaryapproachtointersessionnetworkcoding AT kimminkyu evolutionaryapproachtointersessionnetworkcoding |