article

Peer-to-peer research at Stanford

Authors:

Hector Garcia-Molina,

Qi Sun,

Beverly YangAuthors Info & Claims

ACM SIGMOD Record, Volume 32, Issue 3

Pages 23 - 28

https://doi.org/10.1145/945721.945728

Published: 01 September 2003 Publication History

Get Access

References

[1]

M. Bawa, H. Garcia-Molina, A. Gionis, and R. Motwani. Estimating aggregates on a peer-to-peer network. Technical report, Computer Science Dept., Stanford University, 2003.

Google Scholar

[2]

M. Bawa, R. J. Bayardo Jr., S. Rajagopalan, and E. J. Shekita. Make it fresh, make it quick --- searching a network of personal webservers. In Proc. of the 12th Intl. Conf. on World Wide Web (WWW), 2003.

Digital Library

Google Scholar

[3]

M. Bawa, G. S. Manku, and P. Raghavan. SETS: Search Enhanced by Topic-Segmentation. In Proc. of the 26th Intl. ACM Conf. on Research and Development in Information Retrieval (SIGIR), 2003.

Digital Library

Google Scholar

[4]

B. Bloom. Space/time Trade-offs in Hash Coding with Allowable Errors. In Communications of ACM, volume 13(7), pages 422--426, 1970.

Digital Library

Google Scholar

[5]

B. F. Cooper and H. Garcia-Molina. Creating trading networks of digital archives. In Proc. 1st Joint ACM/IEEE Conference on Digital Libraries (JCDL), June 2001.

Digital Library

Google Scholar

[6]

B. F. Cooper and H. Garcia-Molina. Bidding for storage space in a peer-to-peer data preservation system. In Proceedings of the International Conference on Distributed Computing Systems (ICDCS), 2002.

Digital Library

Google Scholar

[7]

B. F. Cooper and H. Garcia-Molina. Peer-to-peer data trading to preserve information. ACM Transactions on Information Systems (TOIS), 20(2), April 2002.

Digital Library

Google Scholar

[8]

B. F. Cooper and H. Garcia-Molina. Ad hoc, self-supervising peer-to-peer search networks. Technical report, Computer Science Dept., Stanford University, 2003.

Google Scholar

[9]

B. F. Cooper and H. Garcia-Molina. SIL: Modeling and measuring scalable peer-to-peer search networks. Technical report, Computer Science Dept., Stanford University, 2003.

Google Scholar

[10]

F. Cornelli, E. Damiani, S. De Capitani Di Vimercati, S. Paraboschi, and S. Samarati. Choosing reputable servents in a P2P network. In Proceedings of the 11th World Wide Web Conference, May 2002.

Digital Library

Google Scholar

[11]

A. Crespo and H. Garcia-Molina. Routing indices for peer-to-peer systems. In Proc. of the 28th International Conference on Distributed Computing Systems, July 2002.

Digital Library

Google Scholar

[12]

N. Daswani and H. Garcia-Molina. Pong-cache poisoning in GUESS. preprint.

Google Scholar

[13]

N. Daswani and H. Garcia-Molina. Query-flood DoS attacks in Gnutella networks. In ACM Conference on Computer and Communications Security, 2002.

Digital Library

Google Scholar

[14]

P. Ganesan, Q. Sun, and H. Garcia-Molina. YAPPERS: A peer-to-peer lookup service over arbitrary topology. In Proc. of the 22nd Annual Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM), 2003.

Google Scholar

[15]

Gnutella specification. www9.limewire.com/developer/gnutella protocol_0.4.pdf.

Google Scholar

[16]

GUESS specification. groups.yahoo.com/group/the_gdf/files/Proposals/GUESS/guess 01.txt.

Google Scholar

[17]

S. Kamvar, M. Schlosser, and H. Garcia-Molina. Incentives for combatting freeriding on P2P networks. Technical report, Stanford University, 2003.

Google Scholar

[18]

Kazaa.www.kazaa.com.

Google Scholar

[19]

J. Kleinberg. The small-world phenomenon: An algorithmic perspective. In Proc. of the ACM Symposium on Theory of Computing (STOC), 2000.

Digital Library

Google Scholar

[20]

G. S. Manku, M. Bawa, and P. Raghavan. Symphony: Distributed hashing in a small world. In Proc. of the 4th USENIX Symp. on Internet Technologies and Systems (USITS), 2003.

Digital Library

Google Scholar

[21]

Q. Sun N. Daswani, M. Gulati and H. Garcia-Molina. On the flood-tolerance of large Gnutella topologies. preprint.

Google Scholar

[22]

L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998.

Google Scholar

[23]

S. Ratnasamy, P. Francis, M. Handley, and R. M. Karp. A Scalable Content-Addressable Network (CAN). In Proc. of ACM SIGCOMM, 2001.

Digital Library

Google Scholar

[24]

A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. of the Intl. Conf. on Distributed Systems Platforms (Middleware), pages 329--350. IFIP/ACM, 2001.

Digital Library

Google Scholar

[25]

M. Schlosser S. Kamvar and H. Garcia-Molina. The EigenTrust algorithm for reputation management in P2P networks. In WWW 2003, 2003.

Digital Library

Google Scholar

[26]

M. Schlosser, M. Sintek, S. Decker, and W. Nejdl. A scalable and ontology-based P2P infrastructure for semantic web services. In Proceedings of the 2nd International IEEE Conference on P2P Computing, Linkoping, Sweden, September 2002.

Digital Library

Google Scholar

[27]

I. Stoica, R. Morris, D. Karger, M. Frans Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. of ACM SIGCOMM, pages 149--160, 2001.

Digital Library

Google Scholar

[28]

Q. Sun and H. Garcia-Molina. Partial lookup services. In Proc. of the 23rd Intl. Conf. on Distributed Computing Systems (ICDCS), 2003.

Digital Library

Google Scholar

[29]

B. Yang and H. Garcia-Molina. Improving efficiency of peer-to-peer search. In Proc. of the 28th International Conference on Distributed Computing Systems, July 2002.

Digital Library

Google Scholar

[30]

B. Yang and H. Garcia-Molina. Designing a super-peer network. In Proc. of the 19th International Conference on Data Engineering, March 2003.

Google Scholar

[31]

B. Yang, S. Kamvar, and H. Garcia-Molina. Addressing the non-cooperation problem in competitive P2P systems. Stanford University Database Group Technical Report, 2003.

Google Scholar

Cited By

View all

Khatibi ESharifi M(2020)Resource discovery mechanisms in pure unstructured peer-to-peer systems: a comprehensive surveyPeer-to-Peer Networking and Applications10.1007/s12083-020-01027-9Online publication date: 26-Nov-2020
https://doi.org/10.1007/s12083-020-01027-9
Ayvaz SCetin S(2019)Witness of ThingsInternational Journal of Intelligent Unmanned Systems10.1108/IJIUS-05-2018-00117:2(72-87)Online publication date: 15-Apr-2019
https://doi.org/10.1108/IJIUS-05-2018-0011
Aebeloe CMontoya GHose K(2019)Decentralized Indexing over a Network of RDF PeersThe Semantic Web – ISWC 201910.1007/978-3-030-30793-6_1(3-20)Online publication date: 26-Oct-2019
https://dl.acm.org/doi/10.1007/978-3-030-30793-6_1
Show More Cited By

Peer-to-peer research at Stanford

Recommendations

An efficient and secure overlay network for general peer-to-peer systems
An Efficient Hybrid Peer-to-Peer System for Distributed Data Sharing

Peer-to-peer overlay networks are widely used in distributed systems. Based on whether a regular topology is maintained among peers, peer-to-peer networks can be divided into two categories: structured peer-to-peer networks in which peers are connected ...
Ranking factors in peer-to-peer overlay networks

A large number of peer processes are distributed in a peer-to-peer (P2P) overlay network. It is difficult, maybe impossible for a peer to perceive the membership and location of every resource object due to the scalability and openness of a P2P network. ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGMOD Record Volume 32, Issue 3

September 2003

86 pages

ISSN:0163-5808

DOI:10.1145/945721

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 September 2003

Published in SIGMOD Volume 32, Issue 3

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

26
Total Citations
View Citations
1,406
Total Downloads

Downloads (Last 12 months)32
Downloads (Last 6 weeks)5

Reflects downloads up to 18 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Khatibi ESharifi M(2020)Resource discovery mechanisms in pure unstructured peer-to-peer systems: a comprehensive surveyPeer-to-Peer Networking and Applications10.1007/s12083-020-01027-9Online publication date: 26-Nov-2020
https://doi.org/10.1007/s12083-020-01027-9
Ayvaz SCetin S(2019)Witness of ThingsInternational Journal of Intelligent Unmanned Systems10.1108/IJIUS-05-2018-00117:2(72-87)Online publication date: 15-Apr-2019
https://doi.org/10.1108/IJIUS-05-2018-0011
Aebeloe CMontoya GHose K(2019)Decentralized Indexing over a Network of RDF PeersThe Semantic Web – ISWC 201910.1007/978-3-030-30793-6_1(3-20)Online publication date: 26-Oct-2019
https://dl.acm.org/doi/10.1007/978-3-030-30793-6_1
Priyankara HJayasuriya KGunasekara U(2018)Vyapthi: A Leveraged P2P Content Sharing Platform for Distributed e-Learning Systems2018 18th International Conference on Advances in ICT for Emerging Regions (ICTer)10.1109/ICTER.2018.8615494(126-132)Online publication date: Sep-2018
https://doi.org/10.1109/ICTER.2018.8615494
Sagharichian MAlipour Langouri MNaderi H(2017)A fast method to exactly calculate the diameter of incremental disconnected graphsWorld Wide Web10.1007/s11280-016-0394-020:2(399-416)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.1007/s11280-016-0394-0
De SBarik MBanerjee I(2016)Goal Based Threat Modeling for Peer-to-Peer CloudProcedia Computer Science10.1016/j.procs.2016.06.01089(64-72)Online publication date: 2016
https://doi.org/10.1016/j.procs.2016.06.010
He WCui L(2011)An adaptive distribution model for multi-dimensional data in decentralized environmentsProceedings of the 2011 international conference on Web information systems and mining - Volume Part I10.5555/2045561.2045588(175-183)Online publication date: 24-Sep-2011
https://dl.acm.org/doi/10.5555/2045561.2045588
Fujiwara YOnizuka MKitsuregawa M(2011)Real-time diameter monitoring for time-evolving graphsProceedings of the 16th international conference on Database systems for advanced applications - Volume Part I10.5555/1997305.1997337(311-325)Online publication date: 22-Apr-2011
https://dl.acm.org/doi/10.5555/1997305.1997337
He WCui L(2011)An Adaptive Distribution Model for Multi-dimensional Data in Decentralized EnvironmentsWeb Information Systems and Mining10.1007/978-3-642-23971-7_24(175-183)Online publication date: 2011
https://doi.org/10.1007/978-3-642-23971-7_24
Fujiwara YOnizuka MKitsuregawa M(2011)Real-Time Diameter Monitoring for Time-Evolving GraphsDatabase Systems for Advanced Applications10.1007/978-3-642-20149-3_24(311-325)Online publication date: 2011
https://doi.org/10.1007/978-3-642-20149-3_24
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

An efficient and secure overlay network for general peer-to-peer systems

An Efficient Hybrid Peer-to-Peer System for Distributed Data Sharing

Ranking factors in peer-to-peer overlay networks