gzz-commits
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[Gzz-commits] storm/doc/pegboard/available_overlays--hemppah ...


From: Hermanni Hyytiälä
Subject: [Gzz-commits] storm/doc/pegboard/available_overlays--hemppah ...
Date: Tue, 24 Jun 2003 03:37:18 -0400

CVSROOT:        /cvsroot/storm
Module name:    storm
Branch:         
Changes by:     Hermanni Hyytiälä <address@hidden>      03/06/24 03:37:18

Modified files:
        doc/pegboard/available_overlays--hemppah: peg.rst 

Log message:
        more

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/storm/storm/doc/pegboard/available_overlays--hemppah/peg.rst.diff?tr1=1.14&tr2=1.15&r1=text&r2=text

Patches:
Index: storm/doc/pegboard/available_overlays--hemppah/peg.rst
diff -u storm/doc/pegboard/available_overlays--hemppah/peg.rst:1.14 
storm/doc/pegboard/available_overlays--hemppah/peg.rst:1.15
--- storm/doc/pegboard/available_overlays--hemppah/peg.rst:1.14 Mon Jun 23 
07:24:14 2003
+++ storm/doc/pegboard/available_overlays--hemppah/peg.rst      Tue Jun 24 
03:37:18 2003
@@ -5,8 +5,8 @@
 
 :Authors:  Hermanni Hyytiälä
 :Date-Created: 2003-06-18
-:Last-Modified: $Date: 2003/06/23 11:24:14 $
-:Revision: $Revision: 1.14 $
+:Last-Modified: $Date: 2003/06/24 07:37:18 $
+:Revision: $Revision: 1.15 $
 :Status:   Incomplete
 
 .. :Stakeholders:
@@ -116,7 +116,7 @@
 
 Abstraction
 '''''''''''
-DHT
+DHT/DOLR
 
 Redundancy
 ''''''''''
@@ -141,13 +141,18 @@
 ''''''''
 C++ (GCC 2.95, not 2.96, although 3.x should work)
 
+Additional requirements:
+* Self-certifying File System (http://fs.net)
+* autoconf, automake, etc.
+* Berkeley DB 3.X 
+
 License
 '''''''
 BSD-like
 
 Other notes
 '''''''''''
-No support for network locality
+No support for network locality- do not take network latencies into account
 
 
 Tapestry_
@@ -161,10 +166,27 @@
 ''''''''''
 According to `Tapestry: A Resilient Global-scale Overlay for Service
 Deployment`_:
-"..Tapestry is highly resilient under dynamic conditions,
-providing a near optimal success rate for requests
-under high churn rates, and quicly recovering from
-massive membership events in under a minute."
+
+    Tapestry is highly resilient under dynamic conditions,
+    providing a near optimal success rate for requests
+    under high churn rates, and quicly recovering from
+    massive membership events in under a minute."
+    
+According to the Tapestry website:
+
+    Tapestry offers fault-resilient mechanisms for both object 
+    location and point to point message delivery.  For object location, 
+    Tapestry generates a small number of deterministic and independent 
+    GUIDs for each object.  An object server publishes an object's 
+    availability on all of its GUIDs, and a client issues Tapestry locate 
+    requests for all of the object GUIDs in parallel.  This greatly 
+    increases availability under fault conditions, while improving 
+    general performance and reducing performance variability.  For point 
+    to point message delivery, Tapestry provides pre-calculated backup 
+    routes at each overlay hop.  UDP soft-state beacons measure up-to-date 
+    link conditions. Tapestry uses such information and simple fault-avoidance 
+    protocols to route messages around failures, providing successful 
+    delivery with high probability if a path between the endpoints exists.
 
 Replication, backup links
 
@@ -181,9 +203,30 @@
 
 Tapestry 1.0 (April 2002)
 
-According to the Tapestry website, "Tapestry 2.0 is coming soon, with support 
-for massively parallel insertions, voluntary deletions, 
-and a distributed test framework."
+According to the Tapestry website:
+
+    Tapestry 2.0 is coming soon, with support 
+    for massively parallel insertions, voluntary deletions, 
+    and a distributed test framework.
+    
+    Tapestry Version 1.0 contains the following functionality:
+
+    * Basic Tapestry Java code running on the SEDA stage-driven event model
+    * Tapestry node insertion
+          o Using a static configuration built from configuration files
+          o Using the dynamic iterative insertion of single nodes to existing 
+           Tapestry networks
+    * Support for multiple backup links per route entry
+    * Object location
+          o Object publication with optional tags
+          o Object location with optional tags
+          o TapestryFailure messages returned upon the failure of a  
+           TapestryLocateMsg
+    * Message routing
+          o Routing messages to an exact GUID match
+          o Routing messages to the node closest in ID to a given GUID
+    * An initial self-optimizing componentthat monitors link conditions to 
+      decide when to use backup routes   
 
 Developer
 '''''''''
@@ -195,6 +238,12 @@
 The Java interface libraries for the BerkeleyDB database (included with this
 release).
 
+Additional requirements:
+* The Cryptix JCE library (included with the 1.0 release)
+* UNIX make program
+* The Java interface libraries for the BerkeleyDB database 
+  (included with the 1.0 release)
+  
 License
 '''''''
 BSD-like
@@ -205,7 +254,11 @@
 
 According to the Tapestry website, "Tapestry is the networking substrate of 
 OceanStore_, a storage system aiming to provide global-scale persistent and 
-secure storage." 
+secure storage."
+
+
+Why Oceanstore_ uses Tapestry_ ? 
+See http://www.oceanstore.org/info/whytapestry.html 
 
 
 Kademlia_ 
@@ -251,7 +304,7 @@
 
 Abstraction
 '''''''''''
-DHT
+DHT/DOLR
 
 Redundancy
 ''''''''''
@@ -276,7 +329,7 @@
 
 Language
 ''''''''
-Java (requires a Java runtime version 1.4), C#
+Java (requires a Java runtime version 1.4), C# (not known)
 
 License
 '''''''
@@ -284,7 +337,10 @@
 
 Other notes
 '''''''''''
-Support for network locality
+Support for network locality - Pastry actively replicates the objects and 
+places them at random locations in the network. Result: When locating
+nearby object it might require the client to route to a distant replica of 
+the object.
 
 
 GISP_
@@ -292,7 +348,7 @@
 
 Abstraction
 '''''''''''
-DHT
+DHT/DOLR
 
 Redundancy
 ''''''''''




reply via email to

[Prev in Thread] Current Thread [Next in Thread]