[Gzz-commits] gzz/Documentation/misc/hemppah-progradu prograd...

[Hermanni Hyytiälä]

CVSROOT:        /cvsroot/gzz
Module name:    gzz
Changes by:     Hermanni Hyytiälä <address@hidden>      02/11/13 02:49:15

Modified files:
        Documentation/misc/hemppah-progradu: progradu.bib 

Log message:
        refs

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/gzz/Documentation/misc/hemppah-progradu/progradu.bib.diff?tr1=1.5&tr2=1.6&r1=text&r2=text

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/progradu.bib
diff -u gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.5 
gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.6
--- gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.5    Tue Nov 12 
06:19:21 2002
+++ gzz/Documentation/misc/hemppah-progradu/progradu.bib        Wed Nov 13 
02:49:15 2002
@@ -1,28 +1,3 @@
address@hidden:trie:iptps02,
-       title = {Efficient Peer-To-Peer Lookup Based on a Distributed Trie},    
-       author = {Michael J. Freedman and Radek Vingralek},
-       abstract = "Two main approaches have been taken for
-       distributed key/value lookup operations in peer-to-peer systems: 
-       broadcast searches and location-deterministic algorithms. We describe 
-       a third alternative based on a distributed trie. This algorithm 
functions 
-       well in a very dynamic, hostile environment, offering security benefits 
over prior
-       proposals. Our approach takes advantage of working-set temporal
-       locality and global key/value distribution skews due to content
-       popularity. Peers gradually learn system state during lookups,
-       receiving the sought values and/or internal information used by the
-       trie. The distributed trie converges to an accurate network map over
-       time. We describe several modes of information piggybacking, and
-       conservative and liberal variants of the basic algorithm for
-       adversarial settings. Simulations show efficient lookups and low
-       failure rates.",        
-       booktitle = {Proceedings of the 1st International Workshop on 
-       Peer-to-Peer Systems (IPTPS)},  
-       year = {2002},
-       month = {March},
-       address = {Cambridge, MA},
-}
-
-
 @inproceedings{harren02:complex:iptps02,       
        title = "Complex queries in DHT-based peer-to-peer networks",   
        author = "M. Harren and J. Hellerstein and R. Huebsch and B. Loo and 
@@ -36,54 +11,49 @@
        complex query facilities on top of these DHT-based
        P2P systems. We describe the issues involved and
        outline our research plan and current status.", 
-       year = "2002"
+       year = "2002",
+       url = "www.cs.rice.edu/Conferences/IPTPS02/191.pdf"
  }
 
  
 @inproceedings{ratnasamy02:routing:iptps02,
        author = "Sylvia Ratnasamy and Scott Shenker and Ion Stoica",   
-       title = "Routing Algorithms for DHTs: Some Open Questions",     
-       abstract = "First paragraph: This paper is not about finished work, 
-       but instead is about a research agenda for future work (by us and 
others). 
-       We hope that presenting such a discussion to this audience will promote 
synergy
-       between research groups in this area and help clarify some of the
-       underlying issues. We should note that there are many other
-       interesting issues that remain to be resolved in these DHT systems,
-       such as security and robustness to attacks, system monitoring and
-       maintenance, and indexing and keyword searching. These issues will
-       doubtless be discussed elsewhere in this workshop. Our focus on
-       routing algorithms is not intended to imply that these other issues
-       are of secondary importance",   
-       year = 2002,    
+       title = "Routing Algorithms for DHTs: Some Open Questions",
+       year = "2002",  
+       url = "www.cs.rice.edu/Conferences/IPTPS02/174.pdf"
 }
 
 
 @techreport{zhao01tapestry,
        author = {B. Y. Zhao and J. D. Kubiatowicz and A. D. Joseph},   
-       title = {Tapestry: An Infrastructure for Fault-tolerant
-        Wide-area Location and Routing},                 
-       institution = {UC Berkeley},
-       year = 2001,
-       number = {UCB/CSD-01-1141},
-       month = apr,  
+       title = {Tapestry: An Infrastructure for Fault-tolerant Wide-area 
Location and Routing},        
+       year = "2001",
+       url = "www.cs.berkeley.edu/~ravenben/ publications/CSD-01-1141.pdf"     
  
 }
 
 
 @article{rowstron01pastry,
        author = "Antony Rowstron and Peter Druschel",
-       title = "Pastry: Scalable, Decentralized Object Location, and Routing 
for Large-Scale Peer-to-Peer Systems",
-       journal = "Lecture Notes in Computer Science",
-       volume = "2218",
-       pages = "329--??",
+       title = "Pastry: Scalable, Decentralized Object Location, and Routing 
for Large-Scale Peer-to-Peer Systems",    
        year = "2001",
+       url = "www.cs.cornell.edu/People/egs/615/pastry.pdf"
 }
 
 @inproceedings{stoicachord,
        author = "Ion Stoica and Robert Morris and David Karger and Frans 
Kaashoek and Hari Balakrishnan",
-       title = "Chord: {A} Scalable {Peer-To-Peer} Lookup Service for Internet 
Applications",
-       booktitle = "Proceedings of the 2001 ACM SIGCOMM Conference",
-       pages = "149--160",
+       title = "Chord: {A} Scalable {Peer-To-Peer} Lookup Service for Internet 
Applications",  
+       year = "2001",
+       url = "www.pdos.lcs.mit.edu/papers/chord:sigcomm01/ chord_sigcomm.pdf"
+}
+
address@hidden dabek01widearea,
+       author = "Frank Dabek and M. Frans Kaashoek and David Karger and Robert 
Morris and Ion Stoica",
+       title = "Wide-area cooperative storage with {CFS}",
+       booktitle = "Proceedings of the 18th {ACM} {S}ymposium on {O}perating 
{S}ystems {P}rinciples ({SOSP} '01)",
+       month = oct,
+       address = "Chateau Lake Louise, Banff, Canada",
        year = "2001",
+       url = "www.pdos.lcs.mit.edu/papers/cfs:sosp01/cfs_sosp.pdf "
 }
 
 @techreport{ratnasamy00scalable,
@@ -92,24 +62,21 @@
        number = "TR-00-010",
        address = "Berkeley, CA",
        year = "2000",
+       url = "robotics.eecs.berkeley.edu/~wlr/ 228a/Projects/Ratnasamy2.pdf"
 }
 
 @inproceedings{maymounkov02kademlia:iptps02,
        author = "P. Maymounkov and D. Mazieres",
-       title = "Kademlia: A peerto -peer information system based on the xor 
metric",
-       text = "P. Maymounkov and D. Mazieres. Kademlia: A peerto -peer 
information system
-       based on the xor metric. In Proceedings of IPTPS02, Cambridge, USA, 
March
-       2002. http://www.cs.rice.edu/Conferences/IPTPS02/.";,
+       title = "Kademlia: A peerto -peer information system based on the xor 
metric",  
        year = "2002",
+       url = "www.cs.rice.edu/Conferences/IPTPS02/109.pdf"
 }
 
 @article{clarke01freenet,
        author = "Ian Clarke and Oskar Sandberg and Brandon Wiley and Theodore 
W. Hong",
-       title = "Freenet: {A} Distributed Anonymous Information Storage and 
Retrieval System",
-       journal = "Lecture Notes in Computer Science",
-       volume = "2009",
-       pages = "46+",
-       year = "2001",
+       title = "Freenet: {A} Distributed Anonymous Information Storage and 
Retrieval System",  
+       year = "2000",
+       url = "freenetproject.org/twiki/Main/Papers/icsi-revised.pdf"
 }
 
 @inproceedings{kirsten:distributedlocation,
@@ -118,8 +85,7 @@
        booktitle="Proceedings of the Fourteenth ACM Symposium on Parallel
        Algorithms and Architectures",
        year =2002,
-       month = aug,
-       pages="41--52",
+       url = "oceanstore.cs.berkeley.edu/publications/ papers/pdf/SPAA02.pdf"  
 }
 
 @book{oram:harnessingpower,
@@ -136,7 +102,8 @@
        booktitle = "Proceedings of the 1st {I}nternational {W}orkshop on 
{P}eer-to-{P}eer {S}ystems ({IPTPS02})",
        address = "Cambridge, MA",
        month = "March",
-       year = "2002"
+       year = "2002",
+       url = "www.cs.rice.edu/Conferences/IPTPS02/167.pdf "
 }
 
 @inproceedings{yang:improvingsearch,
@@ -152,5 +119,59 @@
        In addition, we designed our techniques to be simple, so that they can 
be easily incorporated 
        into existing systems for immediate impact.",
        month = "July",
-       year = "2002"
+       year = "2002",
+       url = "hake.stanford.edu/~byang/pubs/p2psearch.pdf"
+}
+
+
address@hidden:yappers,
+       author = "Ganesan, Prasanna; Sun, Qixiang; Garcia-Molina, Hector",
+       title = "YAPPERS: A Peer-to-Peer Lookup Service Over Arbitrary Topology"
+       year = "2002",
+       url = "http://dbpubs.stanford.edu:8090/pub/2002-24";
+}
+
address@hidden:openproblems,
+
+       author = "Daswani, Neil; Garcia-Molina, Hector; Yang, Beverly",
+       title = "Open Problems in Data-sharing Peer-to-peer Systems",
+       year = "2003",
+       url = "http://dbpubs.stanford.edu:8090/pub/2003-1";
+}
+
address@hidden,
+       title = "Gnutella",
+       url = "http://www.gnutella.com";
+}
+
address@hidden,
+       title = "FastTrack",
+       url = "http://www.fasttrack.nu";
+}
+
address@hidden,
+       title = "Morpheus",
+       url = "http://www.musiccity.com";
+}
+
address@hidden,
+       title = "Napster",
+       url = "http://www.napster.com";
+}
+
address@hidden,
+       title = "address@hidden",
+       url = "http://www.setiathome.ssl.berkely.edu";
+}
+
address@hidden,
+       title = "Groove Networks",
+       url = "http://www.groove.net";
 }
+
address@hidden,
+       title = "Project JXTA",
+       url = "http://www.jxta.org";
+}
+
+