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

[Hermanni Hyytiälä]

CVSROOT:        /cvsroot/gzz
Module name:    gzz
Changes by:     Hermanni Hyytiälä <address@hidden>      02/11/11 08:46:24

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

Log message:
        Proposal (Freedman et all): What about using DHTs and tries together 
(comments ?)

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/Misc_Notes
diff -u gzz/Documentation/misc/hemppah-progradu/Misc_Notes:1.3 
gzz/Documentation/misc/hemppah-progradu/Misc_Notes:1.4
--- gzz/Documentation/misc/hemppah-progradu/Misc_Notes:1.3      Thu Nov  7 
03:25:49 2002
+++ gzz/Documentation/misc/hemppah-progradu/Misc_Notes  Mon Nov 11 08:46:24 2002
@@ -105,4 +105,15 @@
 relies on Depth-First algorithn
 
 
+Questions:
+
+What about using trie based algorithms in conjuction with 
location-deterministic algorithms (proposed by Freedman et. all):
+A peer may send a limited number of lookup operations based on its local trie 
and, if failed, revert to 
+location-deterministic based lookup mechanism. Furthermore, if the 
location-deterministic algorithms seek 
+to reduce their message overhead by caching additional state, peers could use 
trie based algorithms 
+to maintain consistency of the cached data.
+
+Comments ?
+
+
 
Index: gzz/Documentation/misc/hemppah-progradu/progradu.bib
diff -u gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.3 
gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.4
--- gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.3    Thu Nov  7 
08:03:59 2002
+++ gzz/Documentation/misc/hemppah-progradu/progradu.bib        Mon Nov 11 
08:46:24 2002
@@ -130,3 +130,11 @@
        Address = "Sebastopol, CA"
 }
        
address@hidden:iptps02,
+       title = "Efficient Peer-to-Peer Lookup Based on a Distributed Trie",
+       author = "Michael J. Freedman and Radek Vingralek",
+       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"
+}