When FEC speed up data access in P2P networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2515, Issue , 2002, Pages 26-37

  Lacan, J ^a   Lancerica L ^a   Dairaine, L ^a  

^a UNIVERSITÉ DE TOULOUSE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; ERROR CORRECTION; MULTIMEDIA SYSTEMS; NETWORK ARCHITECTURE;

AMOUNT OF INFORMATION; DATA ACCESS; END USERS; FILE REPLICATION; P2P NETWORK; PEER TO PEER (P2P) NETWORK; PHYSICAL NETWORK; SPEED UP;

PEER TO PEER NETWORKS;

EID: 79951874299     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36166-9_3     Document Type: Conference Paper

References (17)

1. K. Aberer, M. Punceva, M. Hauswirth, R. Schmidt, “Improving Data Access in P2P Systems”, IEEE Internet Computing 6, 1, pp. 58-67, Jan./Feb. 2002.
2. J. W. Byers, M. Luby, M. Mitzenmacher, A. Rege, “A Digital Fountain Approach to Reliable Distribution of Bulk Data”, ACM SIGCOMM '98, September 2-4, 1998.
3. J. W. Byers, M. Luby, M. Mitzenmacher, “Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads”, in INFOCOM 99, 1999.
4. Y. Chen, J. Edler, A. Goldberg, A. Goettlieb, S. Sobti, P. Yianilos “Prototype Implementation of Archival Intermemory”, in Proc. of IEEE ICDE, February 1996.
5. Edonkey2000 Peer-to-peer system, www.edonkey2000.com, May 2002
6. Gnutella Peer-to-peer system, www.gnutella.com, May 2002
7. Li Gong, “Peer-to-Peer Networks in Action”, IEEE Internet Computing, January-February 2002
8. Kazaa Peer-to-peer system, www.kazaa.com, May 2002
9. Napster Peer-to-peer system, www.napster.com, May 2002
10. D. Patterson, G. Gibson, R. Katz, “A case for redundant arrays of inexpensive disks (RAID).,”, Proceedings of ACM SIGMOD ’88, 1988.
11. C. G. Plaxton, R. Rajaraman, A. W. Richa, “Accessing Nearby Copies of Replicated Objects in Distributed Environment”, Proc. ACM Symp. Parallel Algorithms and Architectures, ACM Press, New York, June 1997.
12. I. S. Reed, G. Solomon, “Polynomial Codes Over Certain Finite Field”, J. SIAM, vol. 8, pp. 300-304, 1960.
13. L. Rizzo, “Effective Erasure Codes for Reliable Computer Communication Protocols”, In Computer Communication Review, April 1997.
14. P. Rodriguez, A. Kirpal, E. W. Biersack, “Parallel-Access for Mirror Sites in the Internet”, In Proceedings of IEEE/Infocom’2000, Tel-Aviv, Israel. March 2000.
15. S. Saroiu, P. Gummadi, S. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems”, Technical Report, UW-CSE-01-06-02, University of Washington, Department of Computer Science and Engineering, Seattle, WA 98195-2350, July 2001
16. T. Speakman, D. Farinacci, J. Crowcroft, J. Gemmell, S. Lin, A. Tweedly, D. Leshchiner, M. Luby, N. Bhaskar, R. Edmonstone, K. Morse Johnson, T. Montgomery, L. Rizzo, R. Sumanasekera, L. Vicisano, “PGM Reliable Transport Protocol”, April 2000
17. H. Weatherspoon, J. D. Kubiatowicz, “Erasure Coding vs. Replication : A Quantitative Comparison”, in Proc. of IPTPS ’02, March 2002.