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

[Hermanni Hyytiälä]

CVSROOT:        /cvsroot/gzz
Module name:    gzz
Changes by:     Hermanni Hyytiälä <address@hidden>      03/01/23 07:02:31

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

Log message:
        Notes on DHT's support for hetergeneous nodes (Symphony)

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/progradu.bib
diff -u gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.46 
gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.47
--- gzz/Documentation/misc/hemppah-progradu/progradu.bib:1.46   Thu Jan 23 
05:43:47 2003
+++ gzz/Documentation/misc/hemppah-progradu/progradu.bib        Thu Jan 23 
07:02:30 2003
@@ -1553,3 +1553,17 @@
        location = {Seattle, Washington},
        url = {http://www-db.stanford.edu/~manku/papers/03usits-symphony.pdf}
 }
+
address@hidden,
+       author = {David Karger and Eric Lehman and Tom Leighton and Rina 
Panigrahy and Matthew Levine and Daniel Lewin},
+       title = {Consistent hashing and random trees: distributed caching 
protocols for relieving hot spots on the World Wide Web},
+       booktitle = {Proceedings of the twenty-ninth annual ACM symposium on 
Theory of computing},
+       year = {1997},
+       isbn = {0-89791-888-6},
+       pages = {654--663},
+       location = {El Paso, Texas, United States},
+       doi = {http://doi.acm.org/10.1145/258533.258660},
+       publisher = {ACM Press},
+}
+
+
Index: gzz/Documentation/misc/hemppah-progradu/research_problems
diff -u gzz/Documentation/misc/hemppah-progradu/research_problems:1.28 
gzz/Documentation/misc/hemppah-progradu/research_problems:1.29
--- gzz/Documentation/misc/hemppah-progradu/research_problems:1.28      Thu Jan 
23 03:26:59 2003
+++ gzz/Documentation/misc/hemppah-progradu/research_problems   Thu Jan 23 
07:02:30 2003
@@ -152,7 +152,7 @@
 Hybrid:                N/A             N/A             N/A
 Social:                N/A***          N/A***          N/A***
 Skip graphs 1): O(log n)       O(log n)        O(log n)
-Symphony:      O(log^2 n)      O(log n)        O(log n)
+Symphony:      O(log^2 n)      O(log n)****    O(log n)
 
 * = In Kademlia, there is no action required when nodes leaves the system
 
@@ -160,6 +160,8 @@
 
 *** = From p2p-hackers mailinglist:
 
+**** = Can be also O(1). Additional space of 'space^2' can be used as a 
lookahed list for better performance
+
 1) = In these approaches, node is treated as 'named resource'; in this 
approach, *resources* self-organise (opposite to DHTs).
 E.g., in Skip graphs, a peer (i.e. computer) needs 2k(log n) space for k 
resources. SWAN requires O(1) space for neighbor links. 
 - - -
@@ -820,6 +822,9 @@
 Proposal, Brocade: Landmark routing on overlay networks \cite{zhao02brocade}
 -Secondary overlay layer on top of routing layer, which exploits knowledge of
 underlying network properties
+
+Symphony seems to be the first DHT system which support hetergeneity 
\cite{gurmeet03symphony}
+
 
 Security issues related to p2p, create by Ross Lee Graham:
 http://www.ida.liu.se/~rosgr/p2psecurity.html