/[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.9 by hemppah, Wed Jun 4 11:27:21 2003 UTC revision 1.10 by hemppah, Wed Jun 4 12:01:51 2003 UTC
# Line 59  ISSUE: Line 59  ISSUE:
59            
60      Why GISP ? Why are we using it versus some other systems?      Why GISP ? Why are we using it versus some other systems?
61            
62      - According to Benja, "it's written in Java" :)      - According to Benja, "...since it's written in Java" :)
63      - Easy implementation (and it's implemented)      - Easy implementation (and it's already implemented)
64      - (belief that) GISP is a Kademlia implementation (which      - (belief that) GISP is a Kademlia implementation (which
65        is not true - only distance function is similar)        is not true - only distance function is similar)
66            
# Line 72  ISSUE: Line 72  ISSUE:
72            
73      GISP's routing table is based on Chord's routing      GISP's routing table is based on Chord's routing
74      table - O(log^2 n) messages are required to join/leave      table - O(log^2 n) messages are required to join/leave
75      operations and O(log n) lookup efficiency (according to      operations and O(log n) for lookup efficiency (according to
76      original Chord publication). GISP extends Chord's routing      original Chord publication). GISP extends Chord's routing
77      table to have more space for cached data (peer information).      table to have more space for cached data (peer information).
78        Chord's routing table maintains information about O(log n)
79        peers. GISP publication does not (nor the protocol specification)
80        describe how much more space a GISP peer maintain compared
81        to Chord's O(log n). Instead, for example, the protocol
82        specification states that "A peer should keep as much other
83        peer information as possible for cache".
84            
85      However, neither the original GISP publication nor the GISP      However, neither the original GISP publication nor the GISP
86      protocol specification do not provide any lookup properties.      protocol specification do not provide any lookup properties.
87      In publication, the author states that GISP is more efficient      In the publication, the author states that GISP is more efficient
88      than "broadcasting system".          than a "broadcasting system".    
89                
90    
91  ISSUE:  ISSUE:
# Line 98  ISSUE: Line 104  ISSUE:
104       - very fast connections between peers       - very fast connections between peers
105      - some form of formal analyses ("proofs") are used with,      - some form of formal analyses ("proofs") are used with,
106        e.g., Chord and Kademlia        e.g., Chord and Kademlia
107      - number of peers used in simulations: from 2^7 to 2^20      - number of peers commonly used in simulations: from 2^7 to 2^20
108            
109  Plan  Plan
110  ====  ====

Legend:
Removed from v.1.9  
changed lines
  Added in v.1.10

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