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

[Hermanni Hyytiälä]

CVSROOT:        /cvsroot/gzz
Module name:    gzz
Changes by:     Hermanni Hyytiälä <address@hidden>      02/12/10 06:54:48

Modified files:
        Documentation/misc/hemppah-progradu: masterthesis.tex 

Log message:
        DHT updates

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/gzz/Documentation/misc/hemppah-progradu/masterthesis.tex.diff?tr1=1.19&tr2=1.20&r1=text&r2=text

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/masterthesis.tex
diff -u gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.19 
gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.20
--- gzz/Documentation/misc/hemppah-progradu/masterthesis.tex:1.19       Tue Dec 
10 06:48:35 2002
+++ gzz/Documentation/misc/hemppah-progradu/masterthesis.tex    Tue Dec 10 
06:54:48 2002
@@ -214,8 +214,12 @@
 address space is partitioned into sections, which form adjoining regions of 
this address space. In general, 
 either a single computer or multiple computers is assigned to each section of 
the virtual address space. Each 
 computer is assigned one or more sections, and they maintains copies of those 
key-value bindings whose key values 
-lie within its assigned cell. The allocation of the address space and the 
assigment of computers to sections 
-is dynamic. Therefore, everytime when a node joins or leaves the network, the 
address space is reallocated.
+lie within its assigned cell. This means, in general, that computer that hosts 
corresponding key-value pair, 
+is not owned by the user that decided to provide the resource to the 
community. Moreover, the allocation of the address 
+space and the assigment of computers to sections is dynamic. Therefore, 
everytime when a node joins or 
+leaves the network, the address space is reallocated.
+
+
 
 \subsection{Plaxton Algorithm}
 Plaxton \cite{plaxton97accessingnearby} developed the first routing algorithm, 
which can be used with DHTs.