-
Notifications
You must be signed in to change notification settings - Fork 92
/
discovery.go
351 lines (321 loc) · 11.4 KB
/
discovery.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
348
349
350
351
// Copyright 2017 Factom Foundation
// Use of this source code is governed by the MIT
// license that can be found in the LICENSE file.
package p2p
import (
"bufio"
"bytes"
"encoding/json"
"math/rand"
"net"
"net/http"
"os"
"sort"
"strconv"
"sync"
"time"
log "github.com/sirupsen/logrus"
)
var discoLogger = packageLogger.WithField("subpack", "discovery")
type Discovery struct {
knownPeers map[string]Peer // peers we know about indexed by hash
peersFilePath string // the path to the peers.
lastPeerSave time.Time // Last time we saved known peers.
rng *rand.Rand // RNG = random number generator
seedURL string // URL to the source of a list of peers
// logging
logger *log.Entry
}
var UpdateKnownPeers sync.Mutex
// Discovery provides the code for sharing and managing peers,
// namely keeping track of all the peers we know about (not just the ones
// we are connected to.) The discovery "service" is owned by the
// Controller and its routines are called from the Controllers runloop()
// This ensures that all shared memory is accessed from that goroutine.
func (d *Discovery) Init(peersFile string, seed string) *Discovery {
d.logger = discoLogger
UpdateKnownPeers.Lock()
d.knownPeers = map[string]Peer{}
UpdateKnownPeers.Unlock()
d.rng = rand.New(rand.NewSource(time.Now().UnixNano()))
d.peersFilePath = peersFile
d.seedURL = seed
//d.LoadPeers()
d.DiscoverPeersFromSeed()
return d
}
// Only controller should be able to read this, but we still got
// a concurrent read/write error, so isolating changes to knownPeers
// UpdatePeer updates the values in our known peers. Creates peer if its not in there.
func (d *Discovery) updatePeer(peer Peer) {
d.logger.Debugf("Updating peer: %v", peer)
UpdateKnownPeers.Lock()
_, ok := d.knownPeers[peer.Address]
if !ok {
d.logger.WithFields(log.Fields{
"address": peer.Address,
"last_source": peer.LastSource()}).Infof("Discovered new peer")
}
d.knownPeers[peer.Address] = peer
UpdateKnownPeers.Unlock()
}
// getPeer returns a known peer, if present
func (d *Discovery) getPeer(address string) Peer {
UpdateKnownPeers.Lock()
thePeer := d.knownPeers[address]
UpdateKnownPeers.Unlock()
return thePeer
}
// UpdatePeer updates the values in our known peers. Creates peer if its not in there.
func (d *Discovery) isPeerPresent(peer Peer) bool {
UpdateKnownPeers.Lock()
_, present := d.knownPeers[peer.Address]
UpdateKnownPeers.Unlock()
return present
}
// LoadPeers loads the known peers from disk OVERWRITING PREVIOUS VALUES
func (d *Discovery) LoadPeers() {
file, err := os.Open(d.peersFilePath)
if nil != err {
d.logger.Errorf("Discover.LoadPeers() File read error on file: %s, Error: %+v", d.peersFilePath, err)
return
}
dec := json.NewDecoder(bufio.NewReader(file))
UpdateKnownPeers.Lock()
dec.Decode(&d.knownPeers)
// since this is run at startup, reset quality scores.
for _, peer := range d.knownPeers {
peer.QualityScore = 0
peer.Location = peer.LocationFromAddress()
d.knownPeers[peer.Address] = peer
}
UpdateKnownPeers.Unlock()
d.logger.Debugf("LoadPeers() found %d peers in peers.json", len(d.knownPeers))
file.Close()
}
// SavePeers just saves our known peers out to disk. Called periodically.
func (d *Discovery) SavePeers() {
// save known peers to peers.json
d.lastPeerSave = time.Now()
file, err := os.Create(d.peersFilePath)
if nil != err {
d.logger.Errorf("Discover.SavePeers() File write error on file: %s, Error: %+v", d.peersFilePath, err)
return
}
defer file.Close()
writer := bufio.NewWriter(file)
encoder := json.NewEncoder(writer)
var qualityPeers = map[string]Peer{}
UpdateKnownPeers.Lock()
for _, peer := range d.knownPeers {
switch {
case peer.IsSpecial(): // always save special peers, even if we haven't talked in awhile.
qualityPeers[peer.AddressPort()] = peer
d.logger.Debugf("SavePeers() saved peer in peers.json: %+v", peer)
case time.Since(peer.LastContact) > time.Hour*168:
d.logger.Debugf("SavePeers() DID NOT SAVE peer in peers.json. Last Contact greater than 168 hours. Peer: %+v", peer)
break
case MinumumQualityScore > peer.QualityScore:
d.logger.Debugf("SavePeers() DID NOT SAVE peer in peers.json. MinumumQualityScore: %d > Peer quality score. Peer: %+v", MinumumQualityScore, peer)
break
default:
qualityPeers[peer.AddressPort()] = peer
}
}
UpdateKnownPeers.Unlock()
encoder.Encode(qualityPeers)
writer.Flush()
d.logger.Debugf("SavePeers() saved %d peers in peers.json. \n They were: %+v", len(qualityPeers), qualityPeers)
}
// LearnPeers receives a set of peers from other hosts
// The unique peers are added to our peer list.
// The peers are in a json encoded string as a byte slice
func (d *Discovery) LearnPeers(parcel Parcel) {
dec := json.NewDecoder(bytes.NewReader(parcel.Payload))
var peerArray []Peer
err := dec.Decode(&peerArray)
if nil != err {
d.logger.Errorf("Discovery.LearnPeers got an error unmarshalling json. error: %+v json: %+v", err, strconv.Quote(string(parcel.Payload)))
return
}
filteredArray := d.filterPeersFromOtherNetworks(peerArray)
for _, value := range filteredArray {
value.QualityScore = 0
switch d.isPeerPresent(value) {
case true:
alreadyKnownPeer := d.getPeer(value.Address)
d.updatePeer(d.updatePeerSource(alreadyKnownPeer, parcel.Header.PeerAddress))
default:
value.Source = map[string]time.Time{parcel.Header.PeerAddress: time.Now()}
d.updatePeer(value)
d.logger.Debugf("Discovery.LearnPeers !!!!!!!!!!!!! Discovered new PEER! %+v ", value)
}
}
d.SavePeers()
}
// updatePeerSource checks to see if source is in peer's sources, and if not puts it in there with a value equal to time.Now()
func (d *Discovery) updatePeerSource(peer Peer, source string) Peer {
if nil == peer.Source {
peer.Source = map[string]time.Time{}
}
_, sp := peer.Source[source]
if !sp {
peer.Source[source] = time.Now()
}
return peer
}
func (d *Discovery) filterPeersFromOtherNetworks(peers []Peer) (filtered []Peer) {
for _, peer := range peers {
if CurrentNetwork == peer.Network {
filtered = append(filtered, peer)
}
}
return
}
func (d *Discovery) filterForUniqueIPAdresses(peers []Peer) (filtered []Peer) {
unique := map[string]Peer{}
for _, peer := range peers {
_, present := unique[peer.Address]
if !present {
filtered = append(filtered, peer)
unique[peer.Address] = peer
}
}
return
}
// GetOutgoingPeers gets a set of peers to connect to on startup
// For now, this gives a set of 12 of the total known peers.
// We want peers from diverse networks. So,method is this:
// -- generate list of candidates (if exclusive, only special peers)
// -- sort candidates by distance
// -- if num canddiates is less than desired set, return all candidates
// -- Otherwise,repeatedly take candidates at the 0%, %25, %50, %75, %100 points in the list
// -- remove each candidate from the list.
// -- continue until there are no candidates left, or we have our set.
func (d *Discovery) GetOutgoingPeers() []Peer {
firstPassPeers := []Peer{}
selectedPeers := map[string]Peer{}
UpdateKnownPeers.Lock()
for _, peer := range d.knownPeers {
switch {
case OnlySpecialPeers && peer.IsSpecial():
firstPassPeers = append(firstPassPeers, peer)
case !OnlySpecialPeers:
firstPassPeers = append(firstPassPeers, peer)
default:
}
}
UpdateKnownPeers.Unlock()
secondPass := d.filterPeersFromOtherNetworks(firstPassPeers)
peerPool := d.filterForUniqueIPAdresses(secondPass)
sort.Sort(PeerDistanceSort(peerPool))
// Get four times as many as who knows how many will be online
desiredQuantity := NumberPeersToConnect * 4
// If the peer pool isn't at least twice the size of what we need, then location diversity is meaningless.
if len(peerPool) < desiredQuantity*2 {
return peerPool
}
// Algo is to divide peers up into buckets, sorted by distance.
// Number of buckets is the number of peers we want to get.
// Then given the size of each bucket, pick a random peer in the bucket.
bucketSize := 1 + int(len(peerPool)-1/desiredQuantity)
for index := 0; index < int(desiredQuantity); index++ {
bucketIndex := int(index / desiredQuantity * len(peerPool))
newPeerIndex := bucketIndex + rand.Intn(bucketSize)
if newPeerIndex > len(peerPool)-1 {
newPeerIndex = len(peerPool) - 1
}
newPeer := peerPool[newPeerIndex]
selectedPeers[newPeer.Address] = newPeer
}
// Now derive a slice of peers to return
finalSet := []Peer{}
for _, v := range selectedPeers {
finalSet = append(finalSet, v)
}
d.logger.Debugf("discovery.GetOutgoingPeers() got the following peers: %+v", finalSet)
return finalSet
}
// SharePeers gets a set of peers to send to other hosts
// For now, this gives a random set of the total known peers.
// The peers are in a json encoded string as byte slice
func (d *Discovery) SharePeers() []byte {
return d.getPeerSelection()
}
// For now we use 4 * NumberPeersToConnect to share, which if connection
// rate is %25 will result in NumberPeersToConnect connections.
// getPeerSelection gets a selection of peers for SHARING. So we want to share quality peers with the
// network. Therefore, we sort by quality, and filter out special peers
func (d *Discovery) getPeerSelection() []byte {
// var peer, currentBest Peer
// var currentBestDistance float64
selectedPeers := []Peer{}
firstPassPeers := []Peer{}
specialPeersByLocation := map[uint32]Peer{}
UpdateKnownPeers.Lock()
for _, peer := range d.knownPeers {
if peer.QualityScore > MinumumSharingQualityScore { // Only share peers that have earned positive reputation
firstPassPeers = append(firstPassPeers, peer)
}
}
UpdateKnownPeers.Unlock()
peerPool := d.filterPeersFromOtherNetworks(firstPassPeers)
sort.Sort(PeerQualitySort(peerPool))
// Pull out special peers by location. Use location because it should more accurately reflect IP address.
// we check by location to keep from sharing special peers when they dial into us (in which case we wouldn't realize
// they were special by the flag.)
for _, peer := range peerPool {
if peer.IsSpecial() && peer.Location != 0 { // only include special peers that have IP address
specialPeersByLocation[peer.Location] = peer
}
}
for _, peer := range peerPool {
_, present := specialPeersByLocation[peer.Location]
switch {
case peer.IsSpecial():
break
case present:
break
default:
selectedPeers = append(selectedPeers, peer)
}
if 4*NumberPeersToConnect <= len(selectedPeers) {
break
}
}
json, err := json.Marshal(selectedPeers)
if nil != err {
d.logger.Errorf("Discovery.getPeerSelection got an error marshalling json. error: %+v selectedPeers: %+v", err, selectedPeers)
}
d.logger.Debugf("peers we are sharing: %+v", string(json))
return json
}
// DiscoverPeers gets a set of peers from a DNS Seed
func (d *Discovery) DiscoverPeersFromSeed() {
d.logger.Info("Contacting seed URL to get peers")
resp, err := http.Get(d.seedURL)
if nil != err {
d.logger.Errorf("DiscoverPeersFromSeed getting peers from %s produced error %+v", d.seedURL, err)
return
}
defer resp.Body.Close()
var lines []string
scanner := bufio.NewScanner(resp.Body)
for scanner.Scan() {
lines = append(lines, scanner.Text())
}
bad := 0
for _, line := range lines {
address, port, err := net.SplitHostPort(line)
if err == nil {
peerp := new(Peer).Init(address, port, 0, RegularPeer, 0)
peer := *peerp
peer.LastContact = time.Now()
d.updatePeer(d.updatePeerSource(peer, "DNS-Seed"))
} else {
bad++
d.logger.Errorf("Bad peer in " + d.seedURL + " [" + line + "]")
}
}
d.logger.Debugf("DiscoverPeersFromSeed got peers: %+v", lines)
}