gzz-commits
[Top][All Lists]
Advanced

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

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


From: Hermanni Hyytiälä
Subject: [Gzz-commits] gzz/Documentation/misc/hemppah-progradu researc...
Date: Mon, 16 Dec 2002 09:14:48 -0500

CVSROOT:        /cvsroot/gzz
Module name:    gzz
Changes by:     Hermanni Hyytiälä <address@hidden>      02/12/16 09:14:48

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

Log message:
        Some text for hybrid and social discovery

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

Patches:
Index: gzz/Documentation/misc/hemppah-progradu/research_problems
diff -u gzz/Documentation/misc/hemppah-progradu/research_problems:1.2 
gzz/Documentation/misc/hemppah-progradu/research_problems:1.3
--- gzz/Documentation/misc/hemppah-progradu/research_problems:1.2       Mon Dec 
16 08:53:19 2002
+++ gzz/Documentation/misc/hemppah-progradu/research_problems   Mon Dec 16 
09:14:48 2002
@@ -54,13 +54,26 @@
 -Example systems: Gnutella, Fastrack family (Kazaa, Morpheus), JXTA Search, 
Gnutella2
 
 1.4. Hybrid systems (HS)
-(-text missing)
+-based on FBNt technique, 
++solves some of the Gnutella's scalability issues by introducing ``Super 
nodes'' (a superNode acts like a local hub, building an index 
+of the resources being shared by each node connected to it and proxying lookup 
queries on behalf of other nodes)
++this kind of structure reduces network traffic in comparison to a original 
broadcast query algorithm employed on the Gnutella system
+
+-Example systems: FastTrack (Kazaa, Morpheus), Gnutella2, JXTA
 
 1.5  Social Discovery Systems (SDS)
-(-text missing)
+Notice: pros and cons are not presented here
+-nodes continually discover new nodes to communicate with and determine which 
properties each node have. 
+-every node has a total control over the connections in the
+-as in real social life, nodes who have returned relevant results in the past, 
will have a high quality value in future query lookups
+-with every lookup query, a node determines how proficient a given node is to 
another node's objectives
+
+-Example systems: Alpine Network
 
 1.6. Summary
 
+This summary table is far from complete (and from total truth)
+
                Insert/Delete   Space           Search
 Chord:                 O(log^2 n)      O(nlog n)       O(log n)
 CAN:           O(r)            O(nr)           O((r/4)n^(1/r)), where r is the 
number of dimensions used in a virtual space
@@ -71,7 +84,7 @@
 Small Worlds:  N/A             O(1)            O(log^2 n)
 Flooding:      N/A             O(1)            "high"
 Hybrid:                N/A             N/A             N/A
-Social:                N/A             N/A             N/A
+Social:                N/A             O(1)            N/A
 
 *I will try fill in N/As as quickly as possible!*
 



reply via email to

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