116 |
+There are not hotspots in skip graphs (query/routing hotsports) |
+There are not hotspots in skip graphs (query/routing hotsports) |
117 |
-not network/geographical locality |
-not network/geographical locality |
118 |
-for our purposes, Skip Graps could be used (sensible) only for block IDs, not for URNs: in Skip Graps, there have to be total order for data elements --> for URNs, there cannot be a total order |
-for our purposes, Skip Graps could be used (sensible) only for block IDs, not for URNs: in Skip Graps, there have to be total order for data elements --> for URNs, there cannot be a total order |
119 |
-for range queries, we would have to use local sensitive hashing, *if* we want fetch blocks like 'next block = i + 1'. SHA-1 is a (secure) random hash of content (it won't help for us in this case) |
-for range queries, we would have to use local sensitive hashing, *if* we want fetch blocks like 'next block = i + 1'. SHA-1 is a (secure) random hash of content (it won't help for us in this case) |
|
|
|
120 |
|
|
121 |
|
|
122 |
See summary table for performance details |
See summary table for performance details |
139 |
-we don't have to create 'mini-blocks' for Gzz p2p, since bitTorrent itself partitions data into several blocks for us |
-we don't have to create 'mini-blocks' for Gzz p2p, since bitTorrent itself partitions data into several blocks for us |
140 |
-my initial suggestion for our p2p data obtaining scheme: use Kademlia for data lookup and bitTorrent/MFTP-like tool for downloading the data |
-my initial suggestion for our p2p data obtaining scheme: use Kademlia for data lookup and bitTorrent/MFTP-like tool for downloading the data |
141 |
|
|
142 |
See http://bitconjurer.org/BitTorrent/ for details. |
See http://bitconjurer.org/BitTorrent/ for details. |
143 |
|
|
144 |
|
1.9. PeerNet |
145 |
|
Notice: pros and cons are not presented here |
146 |
|
-Peernet is a p2p based *network layer* for large networks |
147 |
|
-Peernet makes an explicit distinction between node identity and address |
148 |
|
-requires no manual configuration (plug-and-play) |
149 |
|
-can support wireless or wireline infrastructure |
150 |
|
-log(n) routing table, log(n) search |
151 |
|
|
152 |
1.8. Summary |
Summary |
153 |
|
|
154 |
This summary table is far from complete (and from total truth) |
This summary table is far from complete (and from total truth) |
155 |
|
|