Issues in Peer-to-Peer Networking: a Coding Optimization Approach
Name
Medard_Issues in.pdf
Size
150.28 KB
Format
Adobe PDF
Checksum (MD5)
c7c11555208bf33ed1434a6b9b824e14
Author(s)
Chang, Christopher S.
Ho, Tracey
Effros, Michelle
Medard, Muriel
Leong, Ben
Date Issued
June 2010
Journal
IEEE International Symposium on Network Coding (NetCod)
Publisher
Institute of Electrical and Electronics Engineers
Citation
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
Version
Author's final manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
Attribution-Noncommercial-Share Alike 3.0 Unported
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/NETCOD.2010.5487668
