Please use this identifier to cite or link to this item:
|Title:||Issues in peer-to-peer networking: A coding optimization approach||Authors:||Chang, C.S.
|Issue Date:||2010||Citation:||Chang, C.S.,Ho, T.,Effros, M.,Médard, M.,Leong, B. (2010). Issues in peer-to-peer networking: A coding optimization approach. 2010 IEEE International Symposium on Network Coding, NetCod 2010 : 43-48. ScholarBank@NUS Repository. https://doi.org/10.1109/NETCOD.2010.5487668||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. © 2010 IEEE.||Source Title:||2010 IEEE International Symposium on Network Coding, NetCod 2010||URI:||http://scholarbank.nus.edu.sg/handle/10635/41653||ISBN:||9781424471904||DOI:||10.1109/NETCOD.2010.5487668|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 23, 2019
checked on May 22, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.