gzz-commits
[Top][All Lists]
Advanced

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

[Gzz-commits] journals/plans SA_2003.rst


From: Hermanni Hyytiälä
Subject: [Gzz-commits] journals/plans SA_2003.rst
Date: Wed, 14 May 2003 08:12:41 -0400

CVSROOT:        /cvsroot/fenfire
Module name:    journals
Changes by:     Hermanni Hyytiälä <address@hidden>      03/05/14 08:12:41

Modified files:
        plans          : SA_2003.rst 

Log message:
        p2p

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/fenfire/journals/plans/SA_2003.rst.diff?tr1=1.137&tr2=1.138&r1=text&r2=text

Patches:
Index: journals/plans/SA_2003.rst
diff -u journals/plans/SA_2003.rst:1.137 journals/plans/SA_2003.rst:1.138
--- journals/plans/SA_2003.rst:1.137    Wed May 14 08:12:04 2003
+++ journals/plans/SA_2003.rst  Wed May 14 08:12:41 2003
@@ -79,13 +79,6 @@
 
     \normalsize
 
-The Fenfire project is a free software effort. Mostly the source
-code is licensed under LGPL, but most valuable innovations are
-licenced under GPL license. If we ever acquire patents, we shall 
-make a worldwide irrevocable license grant for use in GPL software.
-All source code is available from the Savannah's CVS server
-(http://www.nongnu.org).
-
 The Fenfire project is a free software research effort to build 
 a location transparent, hyperstructured computer operating 
 environment. 
@@ -598,27 +591,17 @@
 is constructed deterministically, which all participating peers have to 
follow; the topology of the
 overlay and the placement of services is controlled tightly. This feafure 
provides $O(\log{n})$
 resource discovery efficiency and the number of packets grow with 
$O(\log{n})$. However,
-the tightly structured approach may not be reliable in highly adverse 
conditions, such as
-sudded network partition or wide hostile attack. Thus, either of the approches 
do not support 
-*both* adaptable and efficient resource discovery in peer-to-peer environment. 
-
-In our research, we focus on developing algorithms which are both adaptable 
and efficient in highly
-adverse conditions. Specifically, we study if we can combine the adaptivity of 
the loosely
-structured approach with the efficiently of the tightly structured approach. 
We also examine
-how well distributed resource discovery algorithms can be made to endurate 
hostile attacks
-in Peer-to-Peer enviroment.
-
-
-- is it possible to achieve logarithmical efficiency with Gnutella-like 
overlay (extreme ad hoc) ?
-- is it possible to improve the adaptivity of tightly structured systems 
without losing performance
-  / increasing node's load (gnutella's ad hoc)
-- is it possible to develop efficient algorithms which are resilient in 
adverse conditions ?
-       - is it possible to develop algorihtms which provide O(1) efficiency 
and which are 
-         resilient in adverse conditions ?
-- is it possible to develop working security infrastructure in a P2P 
environment ?
-       - is it possible to identify entity trustworthy in P2P environement 
(i.e. the Sybil attack)
-- is ideology behind tightly structured systems suitable for ad hoc enviroment 
(deterministic mapping
-  (of overlay and items) ?
+the tightly structured approach may not be reliable in highly adverse 
conditions and the 
+performance may suffers (e.g., sudden network partition or hostile attack). 
+Thus, either of the approches do not support efficient resource discovery in 
+peer-to-peer environment in *adverse* conditions. 
+
+In our research, we study mathematical models which can be used for analyzing 
the impacts of adverse 
+events both in the loosely and tightly structured systems. Currently such 
impacts are not well known and mathematical
+framework could help researchers to understand these events and effects 
better. Also, we 
+study algorithms which provide $O(1)$ efficiency in Peer-to-Peer environment. 
In this case, 
+our focus is to investigate how well these algorithms outperform in highly 
adverse conditions.
+
   
 Research schedule
 -----------------
@@ -640,7 +623,16 @@
 
   
 .. - ethical questions or data protection problems of the research   
-         
+  
+  
+The Fenfire project is a free software effort. Mostly the source
+code is licensed under LGPL, but most valuable innovations are
+licenced under GPL license. If we ever acquire patents, we shall 
+make a worldwide irrevocable license grant for use in GPL software.
+All source code is available from the Savannah's CVS server
+(http://www.nongnu.org).
+
+         
 .. raw:: latex
 
   \begin{table}[h]




reply via email to

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