logos-messaging/go-libp2p-pubsub
1
0
Fork 0
mirror of https://github.com/logos-messaging/go-libp2p-pubsub.git synced 2026-01-05 22:33:10 +00:00
Code Issues Packages Projects Releases Wiki Activity

configurable number of peers for opportunistic grafting

Browse Source
This commit is contained in:
vyzo 2020-04-10 22:37:07 +03:00
parent 6732f9848b
commit 9904d69cde
1 changed files with 9 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
gossipsub.go
View File

@ -67,6 +67,9 @@ var (
// Number of heartbeat ticks for attempting to improve the mesh with opportunistic // Number of heartbeat ticks for attempting to improve the mesh with opportunistic
// grafting // grafting
GossipSubOpportunisticGraftTicks uint64 = 60 GossipSubOpportunisticGraftTicks uint64 = 60
// Number of peers to opportunistically graft
GossipSubOpportunisticGraftPeers = 2
) )
// NewGossipSub returns a new PubSub object using GossipSubRouter as the router. // NewGossipSub returns a new PubSub object using GossipSubRouter as the router.
@ -928,7 +931,7 @@ func (gs *GossipSubRouter) heartbeat() {
// should we try to improve the mesh with opportunistic grafting? // should we try to improve the mesh with opportunistic grafting?
if gs.heartbeatTicks%GossipSubOpportunisticGraftTicks == 0 && len(peers) > 1 { if gs.heartbeatTicks%GossipSubOpportunisticGraftTicks == 0 && len(peers) > 1 {
// Opportunistic grafting works as follows: we check the median score of peers in the // Opportunistic grafting works as follows: we check the median score of peers in the
// mesh; if this score is below the opportunisticGraftThreshold, we select a peer at // mesh; if this score is below the opportunisticGraftThreshold, we select a few peers at
// random with score over the median. // random with score over the median.
// The intention is to (slowly) improve an underperforming mesh by introducing good // The intention is to (slowly) improve an underperforming mesh by introducing good
// scoring peers that may have been gossiping at us. This allows us to get out of sticky // scoring peers that may have been gossiping at us. This allows us to get out of sticky
@ -954,7 +957,7 @@ func (gs *GossipSubRouter) heartbeat() {
// if the median score is below the threshold, select a better peer (if any) and GRAFT // if the median score is below the threshold, select a better peer (if any) and GRAFT
if medianScore < gs.opportunisticGraftThreshold { if medianScore < gs.opportunisticGraftThreshold {
backoff := gs.backoff[topic] backoff := gs.backoff[topic]
plst = gs.getPeers(topic, 1, func(p peer.ID) bool { plst = gs.getPeers(topic, GossipSubOpportunisticGraftPeers, func(p peer.ID) bool {
_, inMesh := peers[p] _, inMesh := peers[p]
_, doBackoff := backoff[p] _, doBackoff := backoff[p]
_, direct := gs.direct[p] _, direct := gs.direct[p]
@ -962,9 +965,10 @@ func (gs *GossipSubRouter) heartbeat() {
}) })
if len(plst) != 0 { if len(plst) != 0 {
p := plst[0] for _, p := range plst {
log.Debugf("HEARTBEAT: Opportunistically graft peer %s on topic %s", p, topic) log.Debugf("HEARTBEAT: Opportunistically graft peer %s on topic %s", p, topic)
graftPeer(p) graftPeer(p)
}
} }
} }
} }