Paircoding: Improving file sharing using sparse network codes

Proceedings of the 2009 4th International Conference on Internet and Web Applications and Services, ICIW 2009

Volumn , Issue , 2009, Pages 49-57

  Ortolf, Christian ^a   Schindelhauer, Christian ^a   Vater, Arne ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BITTORRENT; COMPUTATIONAL MODEL; COMPUTATIONAL OVERHEADS; DISTRIBUTED ENVIRONMENTS; DYNAMIC BANDWIDTH; EFFICIENT METHOD; ENCODING AND DECODING; FILE SHARING; LINEAR COMBINATIONS; MATRIX OPERATIONS; NETWORK CODING; NETWORK FLOWS; PEER-TO-PEER NETWORKS; SPARSE NETWORK; TEMPORAL AVAILABILITY;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL EFFICIENCY; DISKS (STRUCTURAL COMPONENTS); INTERNET; WORLD WIDE WEB;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 70349731421     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIW.2009.16     Document Type: Conference Paper

References (18)

1. D. Waitzman, C. Partridge, and S. Deering, "Distance vector multicast routing protocol," Internet Engineering Task Force, RFC 1075, Nov. 1988. [Online]. Available: http://www.rfc-editor.org/rfc/rfc1075.txt
2. D. Estrin, D. Farinacci, A. Helmy, D. Thaler, S. Deering, M. Handley, V. Jacobson, and C. Liu, "Protocol independent Multicast-Sparse mode (PIM-SM): protocol specification," Internet Engineering Task Force, RFC 2362, Jun. 1998. [Online]. Available: http://www.rfc-editor.org/rfc/rfc2362.txt
3. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," in Computer Communication Review, vol. 31. Dept. of Elec. Eng. and Comp. Sci., University of California, Berkeley, 2001, pp. 161-172.
4. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, "Chord: A scalable Peer-To-Peer lookup service for internet applications," in Proceedings of the ACM SIGCOMM 2001 Conference (SIGCOMM-01), ser. Computer Communication Review, R. Guerin, Ed., vol. 31, 4. New York: ACM Press, Aug. 27-31 2001, pp. 149-160.
5. A. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems," Lecture Notes in Computer Science, In Proc. of the International Conference on Distributed Systems Platforms (IFIP/ACM), vol. 2218, pp. 329-350, 2001.
6. K. Hildrum, J. D. Kubiatowicz, S. Rao, and B. Y. Zhao, "Distributed object location in a dynamic network," in SPAA '02: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures. New York, NY, USA: ACM Press, 2002, pp. 41-52.
7. S. Q. Zhuang, B. Y. Zhao, A. D. Joseph, R. H. Katz, and J. D. Kubiatowicz, "Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination," in Proceedings of NOSSDAV, June 2001.
8. S. Ratnasamy, M. Handley, R. M. Karp, and S. Shenker, "Application-level multicast using content-addressable networks," in Networked Group Communication, Third International COST264 Workshop, NGC 2001, London, UK, November 7-9, 2001, Proceedings, ser. Lecture Notes in Computer Science, J. Crowcroft and M. Hofmann, Eds., vol. 2233. Springer, 2001, pp. 14-29.
9. M. Castro, P. Druschel, A. Kermarrec, and A. Rowstron, "SCRIBE: A large-scale and decentralized application-level multicast infrastructure," IEEE Journal on Selected Areas in communications (JSAC), vol. 20, no. 8, pp. 1489-1499, 2002.
10. M. Castro, P. Druschel, A. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, "Splitstream: High-bandwidth multicast in cooperative environments," 2003.
11. B. Cohen, "Incentives build robustness in BitTorrent," Berkeley, CA, USA, 2003.
12. D. Levin, K. Lacurts, N. Spring, and B. Bhattacharjee, "Bittorrent is an auction: analyzing and improving bittorrent's incentives," SIGCOMM Comput. Commun. Rev., vol. 38, no. 4, pp. 243-254, 2008.
13. M. Piatek, T. Isdal, T. Anderson, A. Krishnamurthy, and A. Venkataramani, "Do incentives build robustness in bittorrent?" in NSDI'07, Cambridge, MA, April 2007.
14. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204-1216, 2000.
15. P. Chou, Y. Wu, and K. Jain, "Practical network coding," 2003.
16. M. Wang and B. Li, "How practical is network coding?" Quality of Service, 2006. IWQoS 2006. 14th IEEE International Workshop on, pp. 274-278, June 2006.
17. C. Gkantsidis and P. Rodriguez, "Network coding for large scale content distribution," in INFOCOM. IEEE, 2005, pp. 2235-2245.
18. Z. Galil and G. F. Italiano, "Data structures and algorithms for disjoint set union problems," ACM Comput. Surv., vol. 23, no. 3, pp. 319-344, 1991.