/[storm]/storm/doc/pegboard/storm_gisp_simulation--hemppah/peg.rst
ViewVC logotype

Diff of /storm/doc/pegboard/storm_gisp_simulation--hemppah/peg.rst

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1.4 by hemppah, Wed Jun 4 08:05:03 2003 UTC revision 1.5 by hemppah, Wed Jun 4 08:34:07 2003 UTC
# Line 77  discoveries. Line 77  discoveries.
77  The GISP protocol  The GISP protocol
78  =================  =================
79    
80  - GISP_ protocol resembles Kademlia_  - "GISP intends leverage those (DHT) algoritms and make a practical protocol."
81  - XOR-metrin for distances  - *distance function* is based on XOR-metric (Kademlia uses XOR)
82  - lacks of binary-tree abstraction ?  - protocol (most recent) talks about XOR-metric, publication
83  - uses Chord_'s extended routing table - more space for caching    numerical metric
84    (Log^2 messages)  - lacks of Kademlia's binary-tree abstraction (routing table) -the benefits
85  - replicates in a same way as Kademlia    of Kademlia's  lookup properties are not available
86    - uses Chord_'s extended routing table expect more space is used for caching
87      (Log^2 messages): asymmetric (requires stabilization protocol like Chord)
88      and lookup process is unidirectional (a virtual ring)
89      -Chord's routing table is rigid compared to Kademlia's (well known issue)  
90    - replicates in a same way as Kademlia ?
91  - no concurrent RPCs during lookup -- no free of choice during  - no concurrent RPCs during lookup -- no free of choice during
92    lookups ?    lookups ?
93    - does GISP have the property of Kademlia: leaving peer costs nothing ?
94       - no, since GISP's routing table is based on Chord's routing table
95    - supports "peer strength" for peer heteregeneity
96    - nothing mentioned about the overlay topology -- however, routing table
97      is based on Chord's routing table --> toplogy resembles Chord's virtual
98      ring
99    
100    
101  Research problems  Research problems
# Line 98  answers to the following questions. Line 109  answers to the following questions.
109        
110  - What about GISP's lookup effieciency when the network grows ?  - What about GISP's lookup effieciency when the network grows ?
111    
112  - GISP does not use Kademlia's binary-tree abstraction - does it have influence  - GISP does not use Kademlia's binary-tree abstraction - does it have influences
113    anf yes, what are the influences ?    and if it does, what are the influences ?
114                    
115  - How well GISP is able to perform in adverse conditions, e.g., a  - How well GISP is able to perform in adverse conditions, e.g., a
116    network partition occurs ?    network partition occurs ?

Legend:
Removed from v.1.4  
changed lines
  Added in v.1.5

savannah-hackers-public@gnu.org
ViewVC Help
Powered by ViewVC 1.1.26