ACM Home Page
Please provide us with feedback. Feedback
Peer-to-peer research at Stanford
Full text PdfPdf (166 KB)
Source ACM SIGMOD Record archive
Volume 32 ,  Issue 3  (September 2003) table of contents
SPECIAL ISSUE: Special topic section on peer to peer data management table of contents
Pages: 23 - 28  
Year of Publication: 2003
ISSN:0163-5808
Authors
Mayank Bawa  Stanford University
Brian F. Cooper  Stanford University
Arturo Crespo  Stanford University
Neil Daswani  Stanford University
Prasanna Ganesan  Stanford University
Hector Garcia-Molina  Stanford University
Sepandar Kamvar  Stanford University
Sergio Marti  Stanford University
Mario Schlosser  Stanford University
Qi Sun  Stanford University
Patrick Vinograd  Stanford University
Beverly Yang  Stanford University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 81,   Citation Count: 5
Additional Information:

references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/945721.945728
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked 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.
2
3
4
5
 
6
7
 
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.
 
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.
10
 
11
 
12
N. Daswani and H. Garcia-Molina. Pong-cache poisoning in GUESS. preprint.
13
 
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.
 
15
Gnutella specification. www9.limewire.com/developer/gnutella protocol_0.4.pdf.
 
16
GUESS specification. groups.yahoo.com/group/the_gdf/files/Proposals/GUESS/guess 01.txt.
 
17
S. Kamvar, M. Schlosser, and H. Garcia-Molina. Incentives for combatting freeriding on P2P networks. Technical report, Stanford University, 2003.
 
18
Kazaa.www.kazaa.com.
19
 
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.
 
21
Q. Sun N. Daswani, M. Gulati and H. Garcia-Molina. On the flood-tolerance of large Gnutella topologies. preprint.
 
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.
23
 
24
25
 
26
27
 
28
 
29
 
30
B. Yang and H. Garcia-Molina. Designing a super-peer network. In Proc. of the 19th International Conference on Data Engineering, March 2003.
 
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.

Collaborative Colleagues:
Mayank Bawa: colleagues
Brian F. Cooper: colleagues
Arturo Crespo: colleagues
Neil Daswani: colleagues
Prasanna Ganesan: colleagues
Hector Garcia-Molina: colleagues
Sepandar Kamvar: colleagues
Sergio Marti: colleagues
Mario Schlosser: colleagues
Qi Sun: colleagues
Patrick Vinograd: colleagues
Beverly Yang: colleagues