/
node.go
347 lines (315 loc) · 8.27 KB
/
node.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
package quasar
import (
"github.com/f483/dejavu"
"io"
"math/rand"
"sync"
"time"
)
// Node holds the quasar pubsup state
type Node struct {
net networkOverlay
filters [][]byte // only to prevent malloc in sendUpdates
subscribers map[sha256digest][]io.Writer
mutex *sync.RWMutex
peers map[pubkey]*peerData
log *logger
history dejavu.DejaVu // memory of past events
cfg *Config
stopDispatcher chan bool
stopPropagation chan bool
stopExpiredPeerGC chan bool
}
type peerData struct {
filters [][]byte
timestamp uint64 // unixtime
}
func (p *peerData) isExpired(c *Config) bool {
return (newTimestampMS() - c.FilterFreshness) > p.timestamp
}
// New create instance with the sane defaults.
func New() *Node {
// TODO pass node id/pubkey and peers list
return newNode(nil, nil, &StandardConfig)
}
func newNode(n networkOverlay, l *logger, c *Config) *Node {
d := dejavu.NewProbabilistic(c.HistoryLimit, c.HistoryAccuracy)
return &Node{
net: n,
filters: newFilters(c),
subscribers: make(map[sha256digest][]io.Writer),
mutex: new(sync.RWMutex),
peers: make(map[pubkey]*peerData),
log: l,
history: d,
cfg: c,
stopDispatcher: nil, // set on Start() call
stopPropagation: nil, // set on Start() call
stopExpiredPeerGC: nil, // set on Start() call
}
}
func (n *Node) processUpdate(u *update) {
n.log.updateReceived(n, u)
if n.net.isConnected(u.NodeId) == false {
n.log.updateFail(n, u)
return // ignore to prevent memory attack
}
n.mutex.Lock()
data, ok := n.peers[*u.NodeId]
if !ok { // init if doesnt exist
data = &peerData{
filters: newFilters(n.cfg),
timestamp: 0,
}
n.peers[*u.NodeId] = data
}
// update peer data
data.filters = u.Filters
data.timestamp = newTimestampMS()
n.mutex.Unlock()
n.log.updateSuccess(n, u)
}
// Publish a message on the network for given topic.
func (n *Node) Publish(topic []byte, message []byte) {
// TODO validate input
event := newEvent(topic, message, n.cfg.DefaultEventTTL)
n.route(event)
n.log.eventPublished(n, event)
}
func (n *Node) isDuplicate(e *event) bool {
return n.history.Witness(append(e.TopicDigest[:], e.Message...))
}
func (n *Node) deliver(receivers []io.Writer, e *event) {
for _, receiver := range receivers {
receiver.Write(e.Message)
}
}
func (n *Node) subscriptions() []*sha256digest {
digests := make([]*sha256digest, 0)
for digest := range n.subscribers {
digests = append(digests, &digest)
}
return digests
}
// Algorithm 1 from the quasar paper.
func (n *Node) sendUpdates() {
n.mutex.RLock()
clearFilters(n.filters)
pubkey := n.net.id()
pubkeyDigest := sha256sum(pubkey[:])
digests := append(n.subscriptions(), &pubkeyDigest)
n.filters[0] = newFilterFromDigests(n.cfg, digests...)
for _, data := range n.peers {
// XXX better if only expiredPeerGC takes care of it?
// if data.isExpired(n.cfg) {
// continue
// }
for i := 1; uint32(i) < n.cfg.FiltersDepth; i++ {
size := int(n.cfg.FiltersM / 8)
for j := 0; j < size; j++ { // inline merge for performance
n.filters[i][j] = n.filters[i][j] | data.filters[i-1][j]
}
}
}
for _, id := range n.net.connectedPeers() {
// top filter never sent as not used by peers
n.net.sendUpdate(id, n.filters)
n.log.updateSent(n, n.filters, id)
}
n.mutex.RUnlock()
}
// Algorithm 2 from the quasar paper.
func (n *Node) route(e *event) {
n.mutex.RLock()
defer n.mutex.RUnlock()
nodeId := n.net.id()
if n.isDuplicate(e) {
n.log.eventDropDuplicate(n, e)
return
}
if receivers, ok := n.subscribers[*e.TopicDigest]; ok {
n.deliver(receivers, e)
n.log.eventDeliver(n, e)
e.addPublisher(&nodeId)
for _, peerId := range n.net.connectedPeers() {
if !e.inPublishers(peerId) {
n.net.sendEvent(peerId, e)
n.log.eventRouteDirect(n, e, peerId)
}
}
return
}
e.Ttl -= 1
if e.Ttl == 0 {
n.log.eventDropTTL(n, e)
return
}
for i := 0; uint32(i) < n.cfg.FiltersDepth; i++ {
for peerId, data := range n.peers {
f := data.filters[i]
if filterContainsDigest(f, n.cfg, e.TopicDigest) {
negRt := false
for _, publisher := range e.Publishers {
if filterContainsDigest(f, n.cfg, publisher) {
negRt = true
}
}
if !negRt && !e.inPublishers(&peerId) {
n.net.sendEvent(&peerId, e)
n.log.eventRouteWell(n, e, &peerId)
return
}
}
}
}
n.sendToRandomPeer(e)
}
func (n *Node) sendToRandomPeer(e *event) {
peers := make([]*pubkey, 0)
for _, peerId := range n.net.connectedPeers() {
if !e.inPublishers(peerId) {
peers = append(peers, peerId)
}
}
if len(peers) > 0 {
peerId := peers[rand.Intn(len(peers))]
n.net.sendEvent(peerId, e)
n.log.eventRouteRandom(n, e, peerId)
}
}
func (n *Node) dispatchInput() {
for {
select {
case u := <-n.net.receivedUpdateChannel():
if u.valid(n.cfg) {
n.processUpdate(u)
}
case e := <-n.net.receivedEventChannel():
if e.valid() {
n.log.eventReceived(n, e)
n.route(e)
}
case <-n.stopDispatcher:
return
}
}
}
func (n *Node) removeExpiredPeers() {
n.mutex.Lock()
toRemove := []*pubkey{}
for peerId, data := range n.peers {
if data.isExpired(n.cfg) {
toRemove = append(toRemove, &peerId)
}
}
for _, peerId := range toRemove {
delete(n.peers, *peerId)
}
n.mutex.Unlock()
}
func (n *Node) expiredPeerGC() {
delay := time.Duration(n.cfg.FilterFreshness/2) * time.Millisecond
for {
select {
case <-time.After(delay):
n.removeExpiredPeers()
case <-n.stopExpiredPeerGC:
return
}
}
}
func (n *Node) propagateFilters() {
delay := time.Duration(n.cfg.PropagationDelay) * time.Millisecond
for {
select {
case <-time.After(delay):
n.sendUpdates()
case <-n.stopPropagation:
return
}
}
}
// Start quasar system
func (n *Node) Start() {
n.net.start()
n.stopDispatcher = make(chan bool)
n.stopPropagation = make(chan bool)
n.stopExpiredPeerGC = make(chan bool)
go n.dispatchInput()
go n.propagateFilters()
go n.expiredPeerGC()
}
// Stop quasar system
func (n *Node) Stop() {
n.net.stop()
n.stopDispatcher <- true
n.stopPropagation <- true
n.stopExpiredPeerGC <- true
}
// Subscribe provided message receiver to given topic.
func (n *Node) Subscribe(topic []byte, receiver io.Writer) {
// TODO validate input
digest := sha256sum(topic)
n.SubscribeDigest(&digest, receiver)
}
// Subscribe provided message receiver to given topic digest.
func (n *Node) SubscribeDigest(digest *sha256digest, receiver io.Writer) {
// TODO validate input
n.mutex.Lock()
receivers, ok := n.subscribers[*digest]
if ok != true { // new subscription
n.subscribers[*digest] = []io.Writer{receiver}
} else { // append to existing subscribers
n.subscribers[*digest] = append(receivers, receiver)
}
n.mutex.Unlock()
}
// Unsubscribe message receiver channel from topic. If nil receiver
// channel is provided all message receiver channels for given topic
// will be removed.
func (n *Node) Unsubscribe(topic []byte, receiver io.Writer) {
// TODO validate input
digest := sha256sum(topic)
n.mutex.Lock()
receivers, ok := n.subscribers[digest]
// remove specific message receiver
if ok && receiver != nil {
for i, v := range receivers {
if v == receiver {
receivers = append(receivers[:i], receivers[i+1:]...)
n.subscribers[digest] = receivers
break
}
}
}
// remove sub key if no specific message
// receiver provided or no message receiver remaining
if ok && (receiver == nil || len(n.subscribers[digest]) == 0) {
delete(n.subscribers, digest)
}
n.mutex.Unlock()
}
// Subscribed returns true if node is subscribed to given topic.
func (n *Node) Subscribed(topic []byte) bool {
digest := sha256sum(topic)
return n.SubscribedDigest(&digest)
}
// Subscribed returns true if node is subscribed to given topic digest.
func (n *Node) SubscribedDigest(digest *sha256digest) bool {
n.mutex.RLock()
_, ok := n.subscribers[*digest]
n.mutex.RUnlock()
return ok
}
// Subscribers retruns message receivers for given topic.
func (n *Node) Subscribers(topic []byte) []io.Writer {
// TODO validate input
digest := sha256sum(topic)
results := []io.Writer{}
n.mutex.RLock()
if receivers, ok := n.subscribers[digest]; ok {
results = append(results, receivers...)
}
n.mutex.RUnlock()
return results
}