|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
26th IEEE International Conference on Distributed Computing Systems (ICDCS'06)
Fast data access over asymmetric channels using fair and secure bandwidth sharing
Lisboa, Portugal
July 04-July 07
ISBN: 0-7695-2540-7
| ASCII Text | x | ||
| Sachin Agarwal, Moshe Laifenfeld, Ari Trachtenberg, Murat Alanyali, "Fast data access over asymmetric channels using fair and secure bandwidth sharing," 2012 IEEE 32nd International Conference on Distributed Computing Systems, pp. 58, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06), 2006. | |||
| BibTex | x | ||
| @article{ 10.1109/ICDCS.2006.38, author = {Sachin Agarwal and Moshe Laifenfeld and Ari Trachtenberg and Murat Alanyali}, title = {Fast data access over asymmetric channels using fair and secure bandwidth sharing}, journal ={2012 IEEE 32nd International Conference on Distributed Computing Systems}, volume = {0}, year = {2006}, issn = {1063-6927}, pages = {58}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDCS.2006.38}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 IEEE 32nd International Conference on Distributed Computing Systems TI - Fast data access over asymmetric channels using fair and secure bandwidth sharing SN - 1063-6927 SP EP A1 - Sachin Agarwal, A1 - Moshe Laifenfeld, A1 - Ari Trachtenberg, A1 - Murat Alanyali, PY - 2006 KW - null VL - 0 JA - 2012 IEEE 32nd International Conference on Distributed Computing Systems ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDCS.2006.38
We propose a peer-to-peer architecture designed to overcome asymmetries in upload/download speeds that are typical in end-user dialup, broadband and cellular wireless Internet connections. Our approach allows users at remote locations to access information stored on their home computers at rates often exceeding their home connection?s upload capacity. The key to this approach is to share file data when communications are idle using random linear coding, so that, when needed, an end-user can download a file from several sources at a higher data rate than his home computer?s upload capacity. We prove that our proposed system is asymptotically fair, in that (even malicious) users are proportionally assigned idle bandwidth depending on how much bandwidth they contribute, and that there is a natural incentive to join and cooperate fairly in the system. In addition, our approach provides cryptographic security and geographic data robustness to the participating peers.
Citation:
Sachin Agarwal, Moshe Laifenfeld, Ari Trachtenberg, Murat Alanyali, "Fast data access over asymmetric channels using fair and secure bandwidth sharing," icdcs, pp.58, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.
