[Gzz-commits] journals/plans SA_2003.rst

[Hermanni Hyytiälä]

CVSROOT:        /cvsroot/fenfire
Module name:    journals
Changes by:     Hermanni Hyytiälä <address@hidden>      03/05/14 06:44:50

Modified files:
        plans          : SA_2003.rst 

Log message:
        Better p2p

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

Patches:
Index: journals/plans/SA_2003.rst
diff -u journals/plans/SA_2003.rst:1.128 journals/plans/SA_2003.rst:1.129
--- journals/plans/SA_2003.rst:1.128    Wed May 14 06:41:19 2003
+++ journals/plans/SA_2003.rst  Wed May 14 06:44:50 2003
@@ -589,47 +589,25 @@
 Efficient information sharing in peer-to-peer environment 
 '''''''''''''''''''''''''''''''''''''''''''''''''''''''''      
 
-Efficient resource discovery is an essential problem in peer-to-peer networks 
because there is 
+Efficient resource discovery is an essential problem in Peer-to-Peer networks 
because there is 
 no centralized index where to look for information about resources. There are 
two well known 
 approaches in which all modern Peer-to-Peer systems fall: the loosely 
structured approach 
-and the tightly structured approach. In the loosely structured approach the 
construction 
-and the maintenance of the network is controlled loosely while tightly 
structured approach
+and the tightly structured approach [hyytiala03stormp2p]_. In the loosely 
structured approach the 
+construction and the maintenance of the network is controlled loosely. In the 
loosely structured approach, 
+t he performance of resource discovery is $O(n)$ and the number of network 
packets can grow with 
+$O(n^{2})$, where $n$ is the number of participating nodes in the network. 
Tightly structured approach
 is constructed deterministically, which all participating peers have to 
follow; the topology of the
-overlay and the placement of services is controlled tightly. Currently either 
of the approches 
-do not support *both* adaptable and efficient resource discovery in 
peer-to-peer environment. 
-
-In our research, we  
-
-
-Currently we use distributed hash tables for searching blocks 
-in a distributed environment, but the use of other Peer-to-Peer technologies 
are 
-also studied.
-
-Research on how location-independent identifiers can be used to find
-information in a Peer-to-Peer environment. To support our research work, we 
have 
-developed a software library, named as Storage Modules (Storm), which provides 
-the basis for storing (xanalogical) data to our system. Storm provides an 
alternative to 
-traditional file-based storage as all data is stored as immutable *blocks*. A 
block is 
-like a file but it cannot be changed, and instead of a file name it is 
identified by a 
-SHA-1 cryptographic content hash [fips-sha-1]_. Thus, identifiers are 
-location-independent and globally unique.
-      
-Research focuses on finding efficient methods for locating xanalogical media 
-using location-independent and globally unique identifiers from the 
Peer-to-Peer 
-network. Currently we use distributed hash tables for searching blocks 
-in a distributed environment, but the use of other Peer-to-Peer technologies 
are 
-also studied.
-
-.. more about theories behind the p2p stuff (HH)
-   
-Our goal is to build a Peer-to-Peer system that allows one to perform a 
*global* 
-data lookups and fetch a block if *anybody* has published it in the Internet.
-
-
-
-Flexible focus+context views such as fisheye distortions
-allow more context to be shown but also induce 
-usability issues that need to be solved.
+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.
 
   
 Research schedule