Issues in Peer-to-Peer Networking: a Coding Optimization Approach
Author(s)
Chang, Christopher S.; Ho, Tracey; Effros, Michelle; Medard, Muriel; Leong, Ben
DownloadMedard_Issues in.pdf (150.2Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2010-06Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Research Laboratory of ElectronicsJournal
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
Other identifiers
INSPEC Accession Number: 11501245
ISBN
978-1-4244-7188-1
978-1-4244-7189-8