Issues in Peer-to-Peer Networking: a Coding Optimization Approach
In this paper we consider a linear optimization approach for studying download finish times in peer-to-peer networks that allow but do not require coding. We demonstrate that using the network coding framework simplifies analysis even in scenarios where the optimal solution does not require coding....
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers
2011
|
| Online Access: | http://hdl.handle.net/1721.1/60374 https://orcid.org/0000-0003-4059-407X |
| _version_ | 1826209882693435392 |
|---|---|
| author | Chang, Christopher S. Ho, Tracey Effros, Michelle Medard, Muriel Leong, Ben |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Chang, Christopher S. Ho, Tracey Effros, Michelle Medard, Muriel Leong, Ben |
| author_sort | Chang, Christopher S. |
| collection | MIT |
| description | In this paper we consider a linear optimization approach for studying download finish times in peer-to-peer networks that allow but do not require coding. We demonstrate that using the network coding framework simplifies analysis even in scenarios where the optimal solution does not require coding. For example, we use the network coding framework to disprove the claim of Ezovski et al. that in the absence of coding, the sequential minimization of file download times minimizes the average finish time over all users. We also use this framework to study the effect of requiring reciprocity, a typical feature of incentive-compatible protocols. Lastly, we show that for a dynamically changing network scenario, coding can provide a robust and optimal solution that outperforms routing. |
| first_indexed | 2024-09-23T14:33:51Z |
| format | Article |
| id | mit-1721.1/60374 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T14:33:51Z |
| publishDate | 2011 |
| publisher | Institute of Electrical and Electronics Engineers |
| record_format | dspace |
| spelling | mit-1721.1/603742022-10-01T21:41:56Z Issues in Peer-to-Peer Networking: a Coding Optimization Approach Chang, Christopher S. Ho, Tracey Effros, Michelle Medard, Muriel Leong, Ben Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. Research Laboratory of Electronics Medard, Muriel Medard, Muriel In this paper we consider a linear optimization approach for studying download finish times in peer-to-peer networks that allow but do not require coding. We demonstrate that using the network coding framework simplifies analysis even in scenarios where the optimal solution does not require coding. For example, we use the network coding framework to disprove the claim of Ezovski et al. that in the absence of coding, the sequential minimization of file download times minimizes the average finish time over all users. We also use this framework to study the effect of requiring reciprocity, a typical feature of incentive-compatible protocols. Lastly, we show that for a dynamically changing network scenario, coding can provide a robust and optimal solution that outperforms routing. Singapore. Ministry of Education (Grant R-252-000-348-112) Lincoln Laboratory (AFRL contract no. FA8721-05-C-0002) 2011-01-03T21:29:37Z 2011-01-03T21:29:37Z 2010-06 Article http://purl.org/eprint/type/ConferencePaper 978-1-4244-7188-1 978-1-4244-7189-8 INSPEC Accession Number: 11501245 http://hdl.handle.net/1721.1/60374 Chang, C.S. et al. “Issues in Peer-to-Peer Networking: A Coding Optimization Approach.” Network Coding (NetCod), 2010 IEEE International Symposium on. 2010. 1-6. © 2010, IEEE https://orcid.org/0000-0003-4059-407X en_US http://dx.doi.org/10.1109/NETCOD.2010.5487668 IEEE International Symposium on Network Coding (NetCod) Attribution-Noncommercial-Share Alike 3.0 Unported http://creativecommons.org/licenses/by-nc-sa/3.0/ application/pdf Institute of Electrical and Electronics Engineers MIT web domain |
| spellingShingle | Chang, Christopher S. Ho, Tracey Effros, Michelle Medard, Muriel Leong, Ben Issues in Peer-to-Peer Networking: a Coding Optimization Approach |
| title | Issues in Peer-to-Peer Networking: a Coding Optimization Approach |
| title_full | Issues in Peer-to-Peer Networking: a Coding Optimization Approach |
| title_fullStr | Issues in Peer-to-Peer Networking: a Coding Optimization Approach |
| title_full_unstemmed | Issues in Peer-to-Peer Networking: a Coding Optimization Approach |
| title_short | Issues in Peer-to-Peer Networking: a Coding Optimization Approach |
| title_sort | issues in peer to peer networking a coding optimization approach |
| url | http://hdl.handle.net/1721.1/60374 https://orcid.org/0000-0003-4059-407X |
| work_keys_str_mv | AT changchristophers issuesinpeertopeernetworkingacodingoptimizationapproach AT hotracey issuesinpeertopeernetworkingacodingoptimizationapproach AT effrosmichelle issuesinpeertopeernetworkingacodingoptimizationapproach AT medardmuriel issuesinpeertopeernetworkingacodingoptimizationapproach AT leongben issuesinpeertopeernetworkingacodingoptimizationapproach |