Peer-to-peer: A technique perspective

Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks

Volumn , Issue , 2005, Pages 591-616

  Zheng, Weimin ^a   Liu, Xuezheng ^a   Shi, Shuming ^a   Hu, Jinfeng ^a   Dong, Haitao ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77954641825     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9780203323687     Document Type: Chapter

References (76)

1. Napster. http://www.napster.com.
2. Gnutella. http://gnutella.wego.com.
3. I. Clarke, O. Sandberg, B. Wiley, and T.W. Hong. Freenet: a distributed anonymous information storage and retrieval system. In Proceedings of the Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, June 2000. http://freenet.sourceforge.net.
4. KaZaA. http://kazaa.com.
5. BitTorrent. http://bitconjurer.org/BitTorrent/.
6. A. Rowstron and P. Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proceedings of ACM SOSP’01, 2001.
7. F. Dabek, M.F. Kaashoek, D. Karger, et al. Wide-area cooperative storage with CFS. In Proc. ACM SOSP’01, Banff, Canada, Oct. 2001.
8. J. Kubiatowicz, D. Bindel, Y. Chen, et al. Ocean Store: an architecture for global-scale persistent storage. In Proceedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), 2000.
9. A. Muthitacharoen, R. Morris, T.M. Gil, and B. Chen. Ivy: A read/write peer-to-peer file system. In Proceedings of the 5th Symposium on Operating Systems Design and Implementation, 2002.
10. M. Castro, P. Druschel, A.-M. Kermarrec, et al. SplitStream—high-bandwidth multicast in cooperative environments. SOSP’03, 2003.
11. J. Eriksson, M. Faloutsos, and S. Krishnamurthy. PeerNet: pushing peer-to-peer down the stack. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS’03), 2003.
12. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. Ascalable content-addressable network. Annual Conference of the Special Interest Group on Data Communication (SIGCOMM 2001), August 2001.
13. A. Rowstron and P. Druschel. Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems. International Conference on Distributed Systems Platforms (Middleware 2001), November 2001.
14. I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan. Chord: a scalable peer-to-peer lookup service for Internet applications. Annual Conference of the Special Interest Group on Data Communication (SIGCOMM 2001), August 2001.
15. B. Zhao, Jo. Kubiatowicz, and A. Joseph. Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing. Technical Report UCB/CSD-01-1141, Computer Science Division, University of California, Berkeley. April 2001.
16. C. Plaxton, R. Rajaraman, and A. Richa. Accessing nearby copies of replicated objects in a distributed environment. In Proceedings of the ACM SPAA, Newport, RI, June 1997, pp. 311–320.
17. J. Xu, A. Kumar, and X. Yu. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks, IEEE Journal on Selected Areas in Communications, 22(1), 151–163, January 2004.
18. A. Gupta, B. Liskov, and R. Rodrigues. One hop lookups for peer-to-peer overlays. In Proceedings of the Ninth Workshop on Hot Topics in Operating Systems, Lihue, Hawaii, May 2003.
19. E. Ng, and H. Zhang. Towards global network positioning. In Proceedings of ACMSIGCOMM Internet Measurement Workshop 2001, November 2001.
20. S. Saroiu, P.K. Gummadi, and S.D. Gribble. A measurement study of peer-to-peer file sharing systems. In Proceedings of Multimedia Computing and Networking 2002 (MMCN’02), January 2002.
21. Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker. Making Gnutella-like P2P systems scalable. In Proceedings of ACM SIGCOMM 2003, Karlsruhe, Germany, August 2003.
22. D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. In 29th ACM Annual Symposium on Theory of Computing (STOC 1997), May 1997.
23. A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica. Load balancing in structured P2P systems. In 2nd International Workshop on Peer-to-Peer Systems (IPTPS’03), February 2003.
24. B. Godfrey, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica. Load balancing in dynamic structured P2P systems. In The 23rdAnnual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004), March 2004.
25. C. Blake and R. Rodrigues. High availability, scalable storage, dynamic peer networks: pick two. In 9th Workshop on Hot Topics in Operating Systems (HOTOS IX), May 2003.
26. Granary project. Homepage at: http://166.111.68.166/granary/.
27. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-to-peer networks. In Proc. ACM ICS 2002, 2002.
28. L.A. Adamic, R.M. Lukose, A.R. Puniyani, and B.A. Huberman. Search in power-law networks. Physical Review E 64, 2001.
29. B. Yang and H. Garcia-Molina. Efficient search in peer-to-peer networks. In ICDCS’02, 2002.
30. A. Crespo and H. Garcia-Molina. Routing indices for peer-to-peer systems. In ICDCS’02, 2002.
31. B. Yang and H. Garcia-Molina. Designing a super-peer network. In ICDE’03, 2003.
32. E. Cohen, A. Fiat, and H. Kaplan. Associative search in peer to peer networks: harnessing latent semantics. In INFOCOM’03, 2003.
33. K. Sripanidkulchai, B. Maggs, and H. Zhang. Efficient content location using interest-based locality in peer-to-peer systems. In INFOCOM’03, 2003.
34. B.H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7):422–426, 1970.
35. J. Li, B.-T. Loo, J.M. Hellerstein, M.F. Kaashoek, D.R. Karger, and R. Morris. On the feasibility of peerto- peer Web indexing and search. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS’03), 2003.
36. P. Reynolds and A. Vahdat. Efficient peer-to-peer keyword searching. In Middleware’03, 2003.
37. B. Bhattacharjee, S. Chawathe, V. Gopalakrishnan, P. Keleher, and B. Silaghi. Efficient peer-to-peer searches using result-caching. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS’03), 2003.
38. O.D. Gnawali. A Keyword Set Search System for Peer-to-Peer Networks. Masters thesis, Massachusetts Institute of Technology, June 2002. UCB/CSD-01-1141, University of California, Berkeley, April 2001.
39. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In Symposium on Principles of Database Systems, 2001.
40. C. Tang, Z. Xu, and M. Mahalingam. Peersearch: efficient information retrieval in peer-to-peer networks. In Proceedings of HotNets-I, ACM SIGCOMM, 2002.
41. C. Tang and S. Dwarkadas. Peer-to-peer information retrieval in distributed hashtable systems. In USENIX/ACM Symposium on Networked Systems Design and Implementation (NSDI’04), March 2004.
42. S. Shi, G. Yang, D. Wang, J. Yu, S. Qu, and M. Chen. Making peer-to-peer keyword searching feasible using multi-level partitioning. In Proceedings of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS’04), 2004.
43. N.J.A. Harvey, M.B. Jones, S. Saroiu, M. Theimer, and A. Wolman. SkipNet: a scalable overlay network with practical locality properties. In USITS’03, 2003.
44. B.-T. Loo, R. Huebsch, I. Stoica, and J.M. Hellerstein. The case for a hybrid P2P search infrastructure. In Proceedings of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS’04), 2004.
45. S. Deering and D. Cheriton. Multicast routing in datagram internetworks and extended LANs, ACM Transactions on Computer Systems, 8(2), May 1990.
46. S.E. Deering. Multicast Routing in a Datagram Internetwork, Ph.D. thesis, Stanford University, December 1991.
47. S. Deering, D. Estrin, D. Farinacci, V. Jacobson, C. Liu, and L. Wei. The PIM architecture for wide-area multicast routing, IEEE/ACM Transactions on Networking, 4(2), April 1996.
48. S. Floyd, V. Jacobson, C.G. Liu, S. McCanne, and L. Zhang. A reliable multicast framework for lightweight sessions and application level framing, IEEE/ACM Transaction on Networking, 5(4):784–803, December 1997.
49. J.C. Lin and S. Paul. A reliable multicast transport protocol. In Proc. of IEEE INFOCOM’96, 1996, pp. 1414–1424.
50. J.H. Saltzer, D.P. Reed, and D.D. Clark. End-to-end arguments in system design, ACM Transactions on Computer Systems, 4(2): 277–288, November 1984.
51. K.P. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky. Bimodal multicast, ACM Transactions on Computer Systems, 17(2): 41–88, May 1999.
52. P. Eugster, S. Handurukande, R. Guerraoui, A.-M. Kermarrec, and P. Kouznetsov. Lightweight probabilistic broadcast. In Proceedings of The International Conference on Dependable Systems and Networks (DSN 2001), Gothenburg, Sweden, July 2001.
53. L.F. Cabrera, M.B. Jones, and M. Theimer. Herald: achieving a global event notification service. In HotOS VIII, Schloss Elmau, Germany, May 2001.
54. S.Q. Zhuang, B.Y. Zhao, A.D. Joseph, R.H. Katz, and J. Kubiatowicz. Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination. In Proceedings of the Eleventh International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV2001), Port Jefferson, NY, June 2001.
55. Y.-H. Chu, S.G. Rao, and H. Zhang. A case for end system multicast. Proceedings of ACM Sigmetrics, Santa Clara, CA, June 2000, pp. 1–12.
56. P.T. Eugster, P. Felber, R. Guerraoui, and A.-M. Kermarrec. The Many Faces of Publish/Subscribe, Technical Report DSC ID:2000104, EPFL, January 2001.
57. H. Gabow. Two algorithms for generating weighted spanning trees in order. Siam J. Computing, 6:139–150, 1977.
58. J.W. Byers, J. Considine, M. Mitzenmacher, and S. Rost. Informed content delivery across adaptive overlay networks. In Proceedings of ACM SIGCOMM, August 2002.
59. D. Kostic, A. Rodriguez, J.R. Albrecht, and A. Vahdat: Bullet: high bandwidth data dissemination using an overlay mesh. In Proceedings of the 19th ACM Symposium on Operating System Principles, October 2003, pp. 282–297.
60. M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh. Splitstream: highbandwidth content distribution in cooperative environments. In Proceedings of the 19th ACM Symposium on Operating System Principles, October 2003.
61. M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron. SCRIBE: a large-scale and decentralized application-level multicast infrastructure. IEEE JSAC, 20(8), October 2002.
62. J. Jannotti, D.K. Gifford, and K.L. Johnson. Overcast: reliablemulticasting with an overlay network. In USENIX Symposium on Operating System Design and Implementation, San Diego, CA, October 2000.
63. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Application-level multicast using contentaddressable networks. In Proceedings of the 3rd International Workshop on Networked Group Communication, November 2001.
64. V.N. Padmanabhan, H.J. Wang, and P.A. Chou. Resilient peer-to-peer streaming. In 11th IEEE International Conference on Network Protocols (ICNP’03), November 4–7, 2003, Atlanta, GA.
65. T.S.E. Ng, Y.-H. Chu, S.G. Rao, K. Sripanidkulchai, and H. Zhang. Measurement-based optimization techniques for bandwidth-demanding peer-to-peer systems. In IEEE INFOCOM’03, 2003.
66. R.L. Carter and M. Crovella. Server selection using dynamic path characterization in wide-area networks. In Proceedings of IEEE INFOCOM, 1997.
67. M. Sayal, Y. Breitbart, P. Scheuermann, and R. Vingralek. Selection algorithms for replicated Web servers. In Proceedings of the Workshop on Internet Server Performance, 1998.
68. Z. Fei, S. Bhattacharjee, E.W. Zegura, and M.H. Ammar. A novel server selection technique for improving the response time of a replicated service. In Proceedings of IEEE INFOCOM, 1998.
69. K. Obraczka and F. Silva. Network latencymetrics for server proximity. In Proceedings of IEEE Globecom, December 2000.
70. K. Hanna, N. Natarajan, and B.N. Levine. Evaluation of a novel two-step server selection metric. In Proceedings of IEEE ICNP, November 2001.
71. K. Lai and M. Baker. Nettimer: a tool for measuring bottleneck link bandwidth. In Proceedings of the 3rd USENIX Symposium on Internet Technologies and Systems, March 2001.
72. W. Bolosky, J. Douceur, D. Ely, and M. Theimer. Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs. In 2000 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (Sigmetrics 2000), June 2000.
73. S.C. Rhea and J. Kubiatowicz. Probabilistic location and routing. In The 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2002), June 2002.
74. L.P. Cox, C.D. Murray, and B.D. Noble. Pastiche: making backup cheap and easy. In 5th Symposium Operating Systems Design and Implementation (OSDI’02), December 2002.
75. M. Luby, M. Mitzenmacher, M. Shokrollahi, D. Spielman, and V. Stemann. Analysis of low density codes and improved designs using irregular graphs. In 30th ACM Annual Symposium on Theory of Computing (STOC 1998), May 1998.
76. J. Plank. A tutorial on Reed-Solomon coding for fault tolerance in RAID-like systems. Software Practice and Experience, 27(9):995–1012, September 1997.