2020-04-23 17:03:52 +00:00
|
|
|
package pubsub
|
|
|
|
|
|
|
|
import (
|
2020-05-08 17:07:05 +00:00
|
|
|
"math"
|
2021-02-09 08:17:30 +00:00
|
|
|
"net"
|
2020-04-23 17:03:52 +00:00
|
|
|
"sync"
|
|
|
|
"testing"
|
|
|
|
"time"
|
|
|
|
|
|
|
|
"github.com/libp2p/go-libp2p-core/peer"
|
|
|
|
)
|
|
|
|
|
|
|
|
func TestScoreTimeInMesh(t *testing.T) {
|
|
|
|
// Create parameters with reasonable default values
|
|
|
|
mytopic := "mytopic"
|
|
|
|
params := &PeerScoreParams{
|
|
|
|
AppSpecificScore: func(peer.ID) float64 { return 0 },
|
|
|
|
Topics: make(map[string]*TopicScoreParams),
|
|
|
|
}
|
|
|
|
topicScoreParams := &TopicScoreParams{
|
|
|
|
TopicWeight: 0.5,
|
|
|
|
TimeInMeshWeight: 1,
|
|
|
|
TimeInMeshQuantum: time.Millisecond,
|
|
|
|
TimeInMeshCap: 3600,
|
|
|
|
}
|
|
|
|
params.Topics[mytopic] = topicScoreParams
|
|
|
|
|
|
|
|
peerA := peer.ID("A")
|
|
|
|
|
|
|
|
// Peer score should start at 0
|
|
|
|
ps := newPeerScore(params)
|
|
|
|
ps.AddPeer(peerA, "myproto")
|
|
|
|
|
|
|
|
aScore := ps.Score(peerA)
|
|
|
|
if aScore != 0 {
|
|
|
|
t.Fatal("expected score to start at zero")
|
|
|
|
}
|
|
|
|
|
|
|
|
// The time in mesh depends on how long the peer has been grafted
|
|
|
|
ps.Graft(peerA, mytopic)
|
|
|
|
elapsed := topicScoreParams.TimeInMeshQuantum * 200
|
|
|
|
time.Sleep(elapsed)
|
|
|
|
|
|
|
|
ps.refreshScores()
|
|
|
|
aScore = ps.Score(peerA)
|
|
|
|
expected := topicScoreParams.TopicWeight * topicScoreParams.TimeInMeshWeight * float64(elapsed/topicScoreParams.TimeInMeshQuantum)
|
2020-04-23 18:19:48 +00:00
|
|
|
if aScore < expected {
|
|
|
|
t.Fatalf("Score: %f. Expected >= %f", aScore, expected)
|
2020-04-23 17:03:52 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestScoreTimeInMeshCap(t *testing.T) {
|
|
|
|
// Create parameters with reasonable default values
|
|
|
|
mytopic := "mytopic"
|
|
|
|
params := &PeerScoreParams{
|
|
|
|
AppSpecificScore: func(peer.ID) float64 { return 0 },
|
|
|
|
Topics: make(map[string]*TopicScoreParams),
|
|
|
|
}
|
|
|
|
topicScoreParams := &TopicScoreParams{
|
|
|
|
TopicWeight: 0.5,
|
|
|
|
TimeInMeshWeight: 1,
|
|
|
|
TimeInMeshQuantum: time.Millisecond,
|
|
|
|
TimeInMeshCap: 10,
|
|
|
|
}
|
|
|
|
|
|
|
|
params.Topics[mytopic] = topicScoreParams
|
|
|
|
|
|
|
|
peerA := peer.ID("A")
|
|
|
|
|
|
|
|
ps := newPeerScore(params)
|
|
|
|
ps.AddPeer(peerA, "myproto")
|
|
|
|
ps.Graft(peerA, mytopic)
|
|
|
|
elapsed := topicScoreParams.TimeInMeshQuantum * 40
|
|
|
|
time.Sleep(elapsed)
|
|
|
|
|
|
|
|
// The time in mesh score has a cap
|
|
|
|
ps.refreshScores()
|
|
|
|
aScore := ps.Score(peerA)
|
|
|
|
expected := topicScoreParams.TopicWeight * topicScoreParams.TimeInMeshWeight * topicScoreParams.TimeInMeshCap
|
|
|
|
variance := 0.5
|
|
|
|
if !withinVariance(aScore, expected, variance) {
|
|
|
|
t.Fatalf("Score: %f. Expected %f ± %f", aScore, expected, variance*expected)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestScoreFirstMessageDeliveries(t *testing.T) {
|
|
|
|
// Create parameters with reasonable default values
|
|
|
|
mytopic := "mytopic"
|
|
|
|
params := &PeerScoreParams{
|
|
|
|
AppSpecificScore: func(peer.ID) float64 { return 0 },
|
|
|
|
Topics: make(map[string]*TopicScoreParams),
|
|
|
|
}
|
|
|
|
topicScoreParams := &TopicScoreParams{
|
|
|
|
TopicWeight: 1,
|
|
|
|
FirstMessageDeliveriesWeight: 1,
|
|
|
|
FirstMessageDeliveriesDecay: 1.0, // test without decay for now
|
|
|
|
FirstMessageDeliveriesCap: 2000,
|
|
|
|
TimeInMeshQuantum: time.Second,
|
|
|
|
}
|
|
|
|
|
|
|
|
params.Topics[mytopic] = topicScoreParams
|
|
|
|
peerA := peer.ID("A")
|
|
|
|
|
|
|
|
ps := newPeerScore(params)
|
|
|
|
ps.AddPeer(peerA, "myproto")
|
|
|
|
ps.Graft(peerA, mytopic)
|
|
|
|
|
|
|
|
// deliver a bunch of messages from peer A
|
|
|
|
nMessages := 100
|
|
|
|
for i := 0; i < nMessages; i++ {
|
|
|
|
pbMsg := makeTestMessage(i)
|
2020-09-29 15:05:54 +00:00
|
|
|
pbMsg.Topic = &mytopic
|
2020-04-23 17:03:52 +00:00
|
|
|
msg := Message{ReceivedFrom: peerA, Message: pbMsg}
|
|
|
|
ps.ValidateMessage(&msg)
|
|
|
|
ps.DeliverMessage(&msg)
|
|
|
|
}
|
|
|
|
|
|
|
|
ps.refreshScores()
|
|
|
|
aScore := ps.Score(peerA)
|
|
|
|
expected := topicScoreParams.TopicWeight * topicScoreParams.FirstMessageDeliveriesWeight * float64(nMessages)
|
|
|
|
if aScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", aScore, expected)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestScoreFirstMessageDeliveriesCap(t *testing.T) {
|
|
|
|
// Create parameters with reasonable default values
|
|
|
|
mytopic := "mytopic"
|
|
|
|
params := &PeerScoreParams{
|
|
|
|
AppSpecificScore: func(peer.ID) float64 { return 0 },
|
|
|
|
Topics: make(map[string]*TopicScoreParams),
|
|
|
|
}
|
|
|
|
topicScoreParams := &TopicScoreParams{
|
|
|
|
TopicWeight: 1,
|
|
|
|
FirstMessageDeliveriesWeight: 1,
|
|
|
|
FirstMessageDeliveriesDecay: 1.0, // test without decay for now
|
|
|
|
FirstMessageDeliveriesCap: 50,
|
|
|
|
TimeInMeshQuantum: time.Second,
|
|
|
|
}
|
|
|
|
|
|
|
|
params.Topics[mytopic] = topicScoreParams
|
|
|
|
peerA := peer.ID("A")
|
|
|
|
|
|
|
|
ps := newPeerScore(params)
|
|
|
|
ps.AddPeer(peerA, "myproto")
|
|
|
|
ps.Graft(peerA, mytopic)
|
|
|
|
|
|
|
|
// deliver a bunch of messages from peer A
|
|
|
|
nMessages := 100
|
|
|
|
for i := 0; i < nMessages; i++ {
|
|
|
|
pbMsg := makeTestMessage(i)
|
2020-09-29 15:05:54 +00:00
|
|
|
pbMsg.Topic = &mytopic
|
2020-04-23 17:03:52 +00:00
|
|
|
msg := Message{ReceivedFrom: peerA, Message: pbMsg}
|
|
|
|
ps.ValidateMessage(&msg)
|
|
|
|
ps.DeliverMessage(&msg)
|
|
|
|
}
|
|
|
|
|
|
|
|
ps.refreshScores()
|
|
|
|
aScore := ps.Score(peerA)
|
|
|
|
expected := topicScoreParams.TopicWeight * topicScoreParams.FirstMessageDeliveriesWeight * topicScoreParams.FirstMessageDeliveriesCap
|
|
|
|
if aScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", aScore, expected)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestScoreFirstMessageDeliveriesDecay(t *testing.T) {
|
|
|
|
// Create parameters with reasonable default values
|
|
|
|
mytopic := "mytopic"
|
|
|
|
params := &PeerScoreParams{
|
|
|
|
AppSpecificScore: func(peer.ID) float64 { return 0 },
|
|
|
|
Topics: make(map[string]*TopicScoreParams),
|
|
|
|
}
|
|
|
|
topicScoreParams := &TopicScoreParams{
|
|
|
|
TopicWeight: 1,
|
|
|
|
FirstMessageDeliveriesWeight: 1,
|
|
|
|
FirstMessageDeliveriesDecay: 0.9, // decay 10% per decay interval
|
|
|
|
FirstMessageDeliveriesCap: 2000,
|
|
|
|
TimeInMeshQuantum: time.Second,
|
|
|
|
}
|
|
|
|
|
|
|
|
params.Topics[mytopic] = topicScoreParams
|
|
|
|
peerA := peer.ID("A")
|
|
|
|
|
|
|
|
ps := newPeerScore(params)
|
|
|
|
ps.AddPeer(peerA, "myproto")
|
|
|
|
ps.Graft(peerA, mytopic)
|
|
|
|
|
|
|
|
// deliver a bunch of messages from peer A
|
|
|
|
nMessages := 100
|
|
|
|
for i := 0; i < nMessages; i++ {
|
|
|
|
pbMsg := makeTestMessage(i)
|
2020-09-29 15:05:54 +00:00
|
|
|
pbMsg.Topic = &mytopic
|
2020-04-23 17:03:52 +00:00
|
|
|
msg := Message{ReceivedFrom: peerA, Message: pbMsg}
|
|
|
|
ps.ValidateMessage(&msg)
|
|
|
|
ps.DeliverMessage(&msg)
|
|
|
|
}
|
|
|
|
|
|
|
|
ps.refreshScores()
|
|
|
|
aScore := ps.Score(peerA)
|
|
|
|
expected := topicScoreParams.TopicWeight * topicScoreParams.FirstMessageDeliveriesWeight * topicScoreParams.FirstMessageDeliveriesDecay * float64(nMessages)
|
|
|
|
if aScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", aScore, expected)
|
|
|
|
}
|
|
|
|
|
|
|
|
// refreshing the scores applies the decay param
|
|
|
|
decayIntervals := 10
|
|
|
|
for i := 0; i < decayIntervals; i++ {
|
|
|
|
ps.refreshScores()
|
|
|
|
expected *= topicScoreParams.FirstMessageDeliveriesDecay
|
|
|
|
}
|
|
|
|
aScore = ps.Score(peerA)
|
|
|
|
if aScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", aScore, expected)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestScoreMeshMessageDeliveries(t *testing.T) {
|
|
|
|
// Create parameters with reasonable default values
|
|
|
|
mytopic := "mytopic"
|
|
|
|
params := &PeerScoreParams{
|
|
|
|
AppSpecificScore: func(peer.ID) float64 { return 0 },
|
|
|
|
Topics: make(map[string]*TopicScoreParams),
|
|
|
|
}
|
|
|
|
topicScoreParams := &TopicScoreParams{
|
|
|
|
TopicWeight: 1,
|
|
|
|
MeshMessageDeliveriesWeight: -1,
|
2020-05-06 22:17:57 +00:00
|
|
|
MeshMessageDeliveriesActivation: time.Second,
|
2020-04-23 17:03:52 +00:00
|
|
|
MeshMessageDeliveriesWindow: 10 * time.Millisecond,
|
|
|
|
MeshMessageDeliveriesThreshold: 20,
|
|
|
|
MeshMessageDeliveriesCap: 100,
|
|
|
|
MeshMessageDeliveriesDecay: 1.0, // no decay for this test
|
|
|
|
|
|
|
|
FirstMessageDeliveriesWeight: 0,
|
|
|
|
TimeInMeshQuantum: time.Second,
|
|
|
|
}
|
|
|
|
|
|
|
|
params.Topics[mytopic] = topicScoreParams
|
|
|
|
|
|
|
|
// peer A always delivers the message first.
|
|
|
|
// peer B delivers next (within the delivery window).
|
|
|
|
// peer C delivers outside the delivery window.
|
|
|
|
// we expect peers A and B to have a score of zero, since all other parameter weights are zero.
|
|
|
|
// Peer C should have a negative score.
|
|
|
|
peerA := peer.ID("A")
|
|
|
|
peerB := peer.ID("B")
|
|
|
|
peerC := peer.ID("C")
|
|
|
|
peers := []peer.ID{peerA, peerB, peerC}
|
|
|
|
|
|
|
|
ps := newPeerScore(params)
|
|
|
|
for _, p := range peers {
|
|
|
|
ps.AddPeer(p, "myproto")
|
|
|
|
ps.Graft(p, mytopic)
|
|
|
|
}
|
|
|
|
|
2020-04-23 18:19:48 +00:00
|
|
|
// assert that nobody has been penalized yet for not delivering messages before activation time
|
2020-04-23 17:03:52 +00:00
|
|
|
ps.refreshScores()
|
|
|
|
for _, p := range peers {
|
|
|
|
score := ps.Score(p)
|
|
|
|
if score < 0 {
|
|
|
|
t.Fatalf("expected no mesh delivery penalty before activation time, got score %f", score)
|
|
|
|
}
|
|
|
|
}
|
2020-04-23 18:19:48 +00:00
|
|
|
// wait for the activation time to kick in
|
|
|
|
time.Sleep(topicScoreParams.MeshMessageDeliveriesActivation)
|
2020-04-23 17:03:52 +00:00
|
|
|
|
|
|
|
// deliver a bunch of messages from peer A, with duplicates within the window from peer B,
|
|
|
|
// and duplicates outside the window from peer C.
|
|
|
|
nMessages := 100
|
|
|
|
wg := sync.WaitGroup{}
|
|
|
|
for i := 0; i < nMessages; i++ {
|
|
|
|
pbMsg := makeTestMessage(i)
|
2020-09-29 15:05:54 +00:00
|
|
|
pbMsg.Topic = &mytopic
|
2020-04-23 17:03:52 +00:00
|
|
|
msg := Message{ReceivedFrom: peerA, Message: pbMsg}
|
|
|
|
ps.ValidateMessage(&msg)
|
|
|
|
ps.DeliverMessage(&msg)
|
|
|
|
|
|
|
|
msg.ReceivedFrom = peerB
|
|
|
|
ps.DuplicateMessage(&msg)
|
|
|
|
|
|
|
|
// deliver duplicate from peerC after the window
|
|
|
|
wg.Add(1)
|
|
|
|
time.AfterFunc(topicScoreParams.MeshMessageDeliveriesWindow+(20*time.Millisecond), func() {
|
|
|
|
msg.ReceivedFrom = peerC
|
|
|
|
ps.DuplicateMessage(&msg)
|
|
|
|
wg.Done()
|
|
|
|
})
|
|
|
|
}
|
|
|
|
wg.Wait()
|
|
|
|
|
|
|
|
ps.refreshScores()
|
|
|
|
aScore := ps.Score(peerA)
|
|
|
|
bScore := ps.Score(peerB)
|
|
|
|
cScore := ps.Score(peerC)
|
|
|
|
if aScore < 0 {
|
|
|
|
t.Fatalf("Expected non-negative score for peer A, got %f", aScore)
|
|
|
|
}
|
|
|
|
if bScore < 0 {
|
|
|
|
t.Fatalf("Expected non-negative score for peer B, got %f", aScore)
|
|
|
|
}
|
|
|
|
|
|
|
|
// the penalty is the difference between the threshold and the actual mesh deliveries, squared.
|
|
|
|
// since we didn't deliver anything, this is just the value of the threshold
|
|
|
|
penalty := topicScoreParams.MeshMessageDeliveriesThreshold * topicScoreParams.MeshMessageDeliveriesThreshold
|
|
|
|
expected := topicScoreParams.TopicWeight * topicScoreParams.MeshMessageDeliveriesWeight * penalty
|
|
|
|
if cScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", cScore, expected)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestScoreMeshMessageDeliveriesDecay(t *testing.T) {
|
|
|
|
// Create parameters with reasonable default values
|
|
|
|
mytopic := "mytopic"
|
|
|
|
params := &PeerScoreParams{
|
|
|
|
AppSpecificScore: func(peer.ID) float64 { return 0 },
|
|
|
|
Topics: make(map[string]*TopicScoreParams),
|
|
|
|
}
|
|
|
|
topicScoreParams := &TopicScoreParams{
|
|
|
|
TopicWeight: 1,
|
|
|
|
MeshMessageDeliveriesWeight: -1,
|
|
|
|
MeshMessageDeliveriesActivation: 0,
|
|
|
|
MeshMessageDeliveriesWindow: 10 * time.Millisecond,
|
|
|
|
MeshMessageDeliveriesThreshold: 20,
|
|
|
|
MeshMessageDeliveriesCap: 100,
|
|
|
|
MeshMessageDeliveriesDecay: 0.9,
|
|
|
|
|
|
|
|
FirstMessageDeliveriesWeight: 0,
|
|
|
|
TimeInMeshQuantum: time.Second,
|
|
|
|
}
|
|
|
|
|
|
|
|
params.Topics[mytopic] = topicScoreParams
|
|
|
|
|
|
|
|
peerA := peer.ID("A")
|
|
|
|
|
|
|
|
ps := newPeerScore(params)
|
|
|
|
ps.AddPeer(peerA, "myproto")
|
|
|
|
ps.Graft(peerA, mytopic)
|
|
|
|
|
|
|
|
// deliver messages from peer A
|
|
|
|
nMessages := 40
|
|
|
|
for i := 0; i < nMessages; i++ {
|
|
|
|
pbMsg := makeTestMessage(i)
|
2020-09-29 15:05:54 +00:00
|
|
|
pbMsg.Topic = &mytopic
|
2020-04-23 17:03:52 +00:00
|
|
|
msg := Message{ReceivedFrom: peerA, Message: pbMsg}
|
|
|
|
ps.ValidateMessage(&msg)
|
|
|
|
ps.DeliverMessage(&msg)
|
|
|
|
}
|
|
|
|
|
|
|
|
// we should have a positive score, since we delivered more messages than the threshold
|
|
|
|
ps.refreshScores()
|
|
|
|
aScore := ps.Score(peerA)
|
|
|
|
if aScore < 0 {
|
|
|
|
t.Fatalf("Expected non-negative score for peer A, got %f", aScore)
|
|
|
|
}
|
|
|
|
|
|
|
|
// we need to refresh enough times for the decay to bring us below the threshold
|
|
|
|
decayedDeliveryCount := float64(nMessages) * topicScoreParams.MeshMessageDeliveriesDecay
|
|
|
|
for i := 0; i < 20; i++ {
|
|
|
|
ps.refreshScores()
|
|
|
|
decayedDeliveryCount *= topicScoreParams.MeshMessageDeliveriesDecay
|
|
|
|
}
|
|
|
|
aScore = ps.Score(peerA)
|
|
|
|
// the penalty is the difference between the threshold and the (decayed) mesh deliveries, squared.
|
|
|
|
deficit := topicScoreParams.MeshMessageDeliveriesThreshold - decayedDeliveryCount
|
|
|
|
penalty := deficit * deficit
|
|
|
|
expected := topicScoreParams.TopicWeight * topicScoreParams.MeshMessageDeliveriesWeight * penalty
|
|
|
|
if aScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", aScore, expected)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestScoreMeshFailurePenalty(t *testing.T) {
|
|
|
|
// Create parameters with reasonable default values
|
|
|
|
mytopic := "mytopic"
|
|
|
|
params := &PeerScoreParams{
|
|
|
|
AppSpecificScore: func(peer.ID) float64 { return 0 },
|
|
|
|
Topics: make(map[string]*TopicScoreParams),
|
|
|
|
}
|
|
|
|
|
|
|
|
// the mesh failure penalty is applied when a peer is pruned while their
|
|
|
|
// mesh deliveries are under the threshold.
|
|
|
|
// for this test, we set the mesh delivery threshold, but set
|
|
|
|
// MeshMessageDeliveriesWeight to zero, so the only affect on the score
|
|
|
|
// is from the mesh failure penalty
|
|
|
|
topicScoreParams := &TopicScoreParams{
|
|
|
|
TopicWeight: 1,
|
|
|
|
MeshFailurePenaltyWeight: -1,
|
|
|
|
MeshFailurePenaltyDecay: 1.0,
|
|
|
|
|
|
|
|
MeshMessageDeliveriesActivation: 0,
|
|
|
|
MeshMessageDeliveriesWindow: 10 * time.Millisecond,
|
|
|
|
MeshMessageDeliveriesThreshold: 20,
|
|
|
|
MeshMessageDeliveriesCap: 100,
|
|
|
|
MeshMessageDeliveriesDecay: 1.0,
|
|
|
|
|
|
|
|
MeshMessageDeliveriesWeight: 0,
|
|
|
|
FirstMessageDeliveriesWeight: 0,
|
|
|
|
TimeInMeshQuantum: time.Second,
|
|
|
|
}
|
|
|
|
|
|
|
|
params.Topics[mytopic] = topicScoreParams
|
|
|
|
|
|
|
|
peerA := peer.ID("A")
|
|
|
|
peerB := peer.ID("B")
|
|
|
|
peers := []peer.ID{peerA, peerB}
|
|
|
|
|
|
|
|
ps := newPeerScore(params)
|
|
|
|
for _, p := range peers {
|
|
|
|
ps.AddPeer(p, "myproto")
|
|
|
|
ps.Graft(p, mytopic)
|
|
|
|
}
|
|
|
|
|
|
|
|
// deliver messages from peer A. peer B does nothing
|
|
|
|
nMessages := 100
|
|
|
|
for i := 0; i < nMessages; i++ {
|
|
|
|
pbMsg := makeTestMessage(i)
|
2020-09-29 15:05:54 +00:00
|
|
|
pbMsg.Topic = &mytopic
|
2020-04-23 17:03:52 +00:00
|
|
|
msg := Message{ReceivedFrom: peerA, Message: pbMsg}
|
|
|
|
ps.ValidateMessage(&msg)
|
|
|
|
ps.DeliverMessage(&msg)
|
|
|
|
}
|
|
|
|
|
|
|
|
// peers A and B should both have zero scores, since the failure penalty hasn't been applied yet
|
|
|
|
ps.refreshScores()
|
|
|
|
aScore := ps.Score(peerA)
|
|
|
|
bScore := ps.Score(peerB)
|
|
|
|
if aScore != 0 {
|
|
|
|
t.Errorf("expected peer A to have score 0.0, got %f", aScore)
|
|
|
|
}
|
|
|
|
if bScore != 0 {
|
|
|
|
t.Errorf("expected peer B to have score 0.0, got %f", bScore)
|
|
|
|
}
|
|
|
|
|
|
|
|
// prune peer B to apply the penalty
|
|
|
|
ps.Prune(peerB, mytopic)
|
|
|
|
ps.refreshScores()
|
|
|
|
aScore = ps.Score(peerA)
|
|
|
|
bScore = ps.Score(peerB)
|
|
|
|
|
|
|
|
if aScore != 0 {
|
|
|
|
t.Errorf("expected peer A to have score 0.0, got %f", aScore)
|
|
|
|
}
|
|
|
|
|
|
|
|
// penalty calculation is the same as for MeshMessageDeliveries, but multiplied by MeshFailurePenaltyWeight
|
|
|
|
// instead of MeshMessageDeliveriesWeight
|
|
|
|
penalty := topicScoreParams.MeshMessageDeliveriesThreshold * topicScoreParams.MeshMessageDeliveriesThreshold
|
|
|
|
expected := topicScoreParams.TopicWeight * topicScoreParams.MeshFailurePenaltyWeight * penalty
|
|
|
|
if bScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", bScore, expected)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestScoreInvalidMessageDeliveries(t *testing.T) {
|
|
|
|
// Create parameters with reasonable default values
|
|
|
|
mytopic := "mytopic"
|
|
|
|
params := &PeerScoreParams{
|
|
|
|
AppSpecificScore: func(peer.ID) float64 { return 0 },
|
|
|
|
Topics: make(map[string]*TopicScoreParams),
|
|
|
|
}
|
|
|
|
topicScoreParams := &TopicScoreParams{
|
|
|
|
TopicWeight: 1,
|
|
|
|
TimeInMeshQuantum: time.Second,
|
2020-05-08 17:07:05 +00:00
|
|
|
InvalidMessageDeliveriesWeight: -1,
|
2020-04-23 17:03:52 +00:00
|
|
|
InvalidMessageDeliveriesDecay: 1.0,
|
|
|
|
}
|
|
|
|
params.Topics[mytopic] = topicScoreParams
|
|
|
|
|
|
|
|
peerA := peer.ID("A")
|
|
|
|
|
|
|
|
ps := newPeerScore(params)
|
|
|
|
ps.AddPeer(peerA, "myproto")
|
|
|
|
ps.Graft(peerA, mytopic)
|
|
|
|
|
|
|
|
nMessages := 100
|
|
|
|
for i := 0; i < nMessages; i++ {
|
|
|
|
pbMsg := makeTestMessage(i)
|
2020-09-29 15:05:54 +00:00
|
|
|
pbMsg.Topic = &mytopic
|
2020-04-23 17:03:52 +00:00
|
|
|
msg := Message{ReceivedFrom: peerA, Message: pbMsg}
|
|
|
|
ps.RejectMessage(&msg, rejectInvalidSignature)
|
|
|
|
}
|
|
|
|
|
|
|
|
ps.refreshScores()
|
|
|
|
aScore := ps.Score(peerA)
|
2020-05-08 17:07:05 +00:00
|
|
|
expected := topicScoreParams.TopicWeight * topicScoreParams.InvalidMessageDeliveriesWeight * float64(nMessages*nMessages)
|
2020-04-23 17:03:52 +00:00
|
|
|
if aScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", aScore, expected)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestScoreInvalidMessageDeliveriesDecay(t *testing.T) {
|
|
|
|
// Create parameters with reasonable default values
|
|
|
|
mytopic := "mytopic"
|
|
|
|
params := &PeerScoreParams{
|
|
|
|
AppSpecificScore: func(peer.ID) float64 { return 0 },
|
|
|
|
Topics: make(map[string]*TopicScoreParams),
|
|
|
|
}
|
|
|
|
topicScoreParams := &TopicScoreParams{
|
|
|
|
TopicWeight: 1,
|
|
|
|
TimeInMeshQuantum: time.Second,
|
2020-05-08 17:07:05 +00:00
|
|
|
InvalidMessageDeliveriesWeight: -1,
|
2020-04-23 17:03:52 +00:00
|
|
|
InvalidMessageDeliveriesDecay: 0.9,
|
|
|
|
}
|
|
|
|
params.Topics[mytopic] = topicScoreParams
|
|
|
|
|
|
|
|
peerA := peer.ID("A")
|
|
|
|
|
|
|
|
ps := newPeerScore(params)
|
|
|
|
ps.AddPeer(peerA, "myproto")
|
|
|
|
ps.Graft(peerA, mytopic)
|
|
|
|
|
|
|
|
nMessages := 100
|
|
|
|
for i := 0; i < nMessages; i++ {
|
|
|
|
pbMsg := makeTestMessage(i)
|
2020-09-29 15:05:54 +00:00
|
|
|
pbMsg.Topic = &mytopic
|
2020-04-23 17:03:52 +00:00
|
|
|
msg := Message{ReceivedFrom: peerA, Message: pbMsg}
|
|
|
|
ps.RejectMessage(&msg, rejectInvalidSignature)
|
|
|
|
}
|
|
|
|
|
|
|
|
ps.refreshScores()
|
|
|
|
aScore := ps.Score(peerA)
|
2020-05-08 17:07:05 +00:00
|
|
|
expected := topicScoreParams.TopicWeight * topicScoreParams.InvalidMessageDeliveriesWeight * math.Pow(topicScoreParams.InvalidMessageDeliveriesDecay*float64(nMessages), 2)
|
2020-04-23 17:03:52 +00:00
|
|
|
if aScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", aScore, expected)
|
|
|
|
}
|
|
|
|
|
|
|
|
// refresh scores a few times to apply decay
|
|
|
|
for i := 0; i < 10; i++ {
|
|
|
|
ps.refreshScores()
|
2020-05-08 17:07:05 +00:00
|
|
|
expected *= math.Pow(topicScoreParams.InvalidMessageDeliveriesDecay, 2)
|
2020-04-23 17:03:52 +00:00
|
|
|
}
|
|
|
|
aScore = ps.Score(peerA)
|
|
|
|
if aScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", aScore, expected)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-04-24 20:06:34 +00:00
|
|
|
func TestScoreRejectMessageDeliveries(t *testing.T) {
|
|
|
|
// this tests adds coverage for the dark corners of rejection tracing
|
|
|
|
mytopic := "mytopic"
|
|
|
|
params := &PeerScoreParams{
|
|
|
|
AppSpecificScore: func(peer.ID) float64 { return 0 },
|
|
|
|
Topics: make(map[string]*TopicScoreParams),
|
|
|
|
}
|
|
|
|
topicScoreParams := &TopicScoreParams{
|
|
|
|
TopicWeight: 1,
|
|
|
|
TimeInMeshQuantum: time.Second,
|
|
|
|
InvalidMessageDeliveriesWeight: -1,
|
|
|
|
InvalidMessageDeliveriesDecay: 1.0,
|
|
|
|
}
|
|
|
|
params.Topics[mytopic] = topicScoreParams
|
|
|
|
|
|
|
|
peerA := peer.ID("A")
|
|
|
|
peerB := peer.ID("B")
|
|
|
|
|
|
|
|
ps := newPeerScore(params)
|
|
|
|
ps.AddPeer(peerA, "myproto")
|
|
|
|
ps.AddPeer(peerB, "myproto")
|
|
|
|
|
|
|
|
pbMsg := makeTestMessage(0)
|
2020-09-29 15:05:54 +00:00
|
|
|
pbMsg.Topic = &mytopic
|
2020-04-24 20:06:34 +00:00
|
|
|
msg := Message{ReceivedFrom: peerA, Message: pbMsg}
|
|
|
|
msg2 := Message{ReceivedFrom: peerB, Message: pbMsg}
|
|
|
|
|
|
|
|
// these should have no effect in the score
|
|
|
|
ps.RejectMessage(&msg, rejectBlacklstedPeer)
|
|
|
|
ps.RejectMessage(&msg, rejectBlacklistedSource)
|
|
|
|
ps.RejectMessage(&msg, rejectValidationQueueFull)
|
|
|
|
|
|
|
|
aScore := ps.Score(peerA)
|
|
|
|
expected := 0.0
|
|
|
|
if aScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", aScore, expected)
|
|
|
|
}
|
|
|
|
|
|
|
|
// insert a record in the message deliveries
|
|
|
|
ps.ValidateMessage(&msg)
|
|
|
|
|
|
|
|
// this should have no effect in the score, and subsequent duplicate messages should have no
|
|
|
|
// effect either
|
|
|
|
ps.RejectMessage(&msg, rejectValidationThrottled)
|
|
|
|
ps.DuplicateMessage(&msg2)
|
|
|
|
|
|
|
|
aScore = ps.Score(peerA)
|
|
|
|
expected = 0.0
|
|
|
|
if aScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", aScore, expected)
|
|
|
|
}
|
|
|
|
|
|
|
|
bScore := ps.Score(peerB)
|
|
|
|
expected = 0.0
|
|
|
|
if bScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", aScore, expected)
|
2020-04-28 14:43:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// now clear the delivery record
|
|
|
|
ps.deliveries.head.expire = time.Now()
|
|
|
|
time.Sleep(1 * time.Millisecond)
|
|
|
|
ps.deliveries.gc()
|
|
|
|
|
|
|
|
// insert a record in the message deliveries
|
|
|
|
ps.ValidateMessage(&msg)
|
|
|
|
|
|
|
|
// this should have no effect in the score, and subsequent duplicate messages should have no
|
|
|
|
// effect either
|
|
|
|
ps.RejectMessage(&msg, rejectValidationIgnored)
|
|
|
|
ps.DuplicateMessage(&msg2)
|
|
|
|
|
|
|
|
aScore = ps.Score(peerA)
|
|
|
|
expected = 0.0
|
|
|
|
if aScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", aScore, expected)
|
|
|
|
}
|
|
|
|
|
|
|
|
bScore = ps.Score(peerB)
|
|
|
|
expected = 0.0
|
|
|
|
if bScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", aScore, expected)
|
2020-04-24 20:06:34 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// now clear the delivery record
|
|
|
|
ps.deliveries.head.expire = time.Now()
|
|
|
|
time.Sleep(1 * time.Millisecond)
|
|
|
|
ps.deliveries.gc()
|
|
|
|
|
|
|
|
// insert a new record in the message deliveries
|
|
|
|
ps.ValidateMessage(&msg)
|
|
|
|
|
|
|
|
// and reject the message to make sure duplicates are also penalized
|
|
|
|
ps.RejectMessage(&msg, rejectValidationFailed)
|
|
|
|
ps.DuplicateMessage(&msg2)
|
|
|
|
|
|
|
|
aScore = ps.Score(peerA)
|
|
|
|
expected = -1.0
|
|
|
|
if aScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", aScore, expected)
|
|
|
|
}
|
|
|
|
|
|
|
|
bScore = ps.Score(peerB)
|
|
|
|
expected = -1.0
|
|
|
|
if bScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", bScore, expected)
|
|
|
|
}
|
|
|
|
|
|
|
|
// now clear the delivery record again
|
|
|
|
ps.deliveries.head.expire = time.Now()
|
|
|
|
time.Sleep(1 * time.Millisecond)
|
|
|
|
ps.deliveries.gc()
|
|
|
|
|
|
|
|
// insert a new record in the message deliveries
|
|
|
|
ps.ValidateMessage(&msg)
|
|
|
|
|
|
|
|
// and reject the message after a duplciate has arrived
|
|
|
|
ps.DuplicateMessage(&msg2)
|
|
|
|
ps.RejectMessage(&msg, rejectValidationFailed)
|
|
|
|
|
|
|
|
aScore = ps.Score(peerA)
|
2020-05-08 17:07:05 +00:00
|
|
|
expected = -4.0
|
2020-04-24 20:06:34 +00:00
|
|
|
if aScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", aScore, expected)
|
|
|
|
}
|
|
|
|
|
|
|
|
bScore = ps.Score(peerB)
|
2020-05-08 17:07:05 +00:00
|
|
|
expected = -4.0
|
2020-04-24 20:06:34 +00:00
|
|
|
if bScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", bScore, expected)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-04-23 17:03:52 +00:00
|
|
|
func TestScoreApplicationScore(t *testing.T) {
|
|
|
|
// Create parameters with reasonable default values
|
|
|
|
mytopic := "mytopic"
|
|
|
|
|
|
|
|
var appScoreValue float64
|
|
|
|
params := &PeerScoreParams{
|
|
|
|
AppSpecificScore: func(peer.ID) float64 { return appScoreValue },
|
|
|
|
AppSpecificWeight: 0.5,
|
|
|
|
Topics: make(map[string]*TopicScoreParams),
|
|
|
|
}
|
|
|
|
|
|
|
|
peerA := peer.ID("A")
|
|
|
|
|
|
|
|
ps := newPeerScore(params)
|
|
|
|
ps.AddPeer(peerA, "myproto")
|
|
|
|
ps.Graft(peerA, mytopic)
|
|
|
|
|
|
|
|
for i := -100; i < 100; i++ {
|
|
|
|
appScoreValue = float64(i)
|
|
|
|
ps.refreshScores()
|
|
|
|
aScore := ps.Score(peerA)
|
|
|
|
expected := float64(i) * params.AppSpecificWeight
|
|
|
|
if aScore != expected {
|
|
|
|
t.Errorf("expected peer score to equal app-specific score %f, got %f", expected, aScore)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestScoreIPColocation(t *testing.T) {
|
|
|
|
// Create parameters with reasonable default values
|
|
|
|
mytopic := "mytopic"
|
|
|
|
|
|
|
|
params := &PeerScoreParams{
|
|
|
|
AppSpecificScore: func(peer.ID) float64 { return 0 },
|
|
|
|
IPColocationFactorThreshold: 1,
|
|
|
|
IPColocationFactorWeight: -1,
|
|
|
|
Topics: make(map[string]*TopicScoreParams),
|
|
|
|
}
|
|
|
|
|
|
|
|
peerA := peer.ID("A")
|
|
|
|
peerB := peer.ID("B")
|
|
|
|
peerC := peer.ID("C")
|
|
|
|
peerD := peer.ID("D")
|
|
|
|
peers := []peer.ID{peerA, peerB, peerC, peerD}
|
|
|
|
|
|
|
|
ps := newPeerScore(params)
|
|
|
|
for _, p := range peers {
|
|
|
|
ps.AddPeer(p, "myproto")
|
|
|
|
ps.Graft(p, mytopic)
|
|
|
|
}
|
|
|
|
|
|
|
|
// peerA should have no penalty, but B, C, and D should be penalized for sharing an IP
|
|
|
|
setIPsForPeer(t, ps, peerA, "1.2.3.4")
|
|
|
|
setIPsForPeer(t, ps, peerB, "2.3.4.5")
|
|
|
|
setIPsForPeer(t, ps, peerC, "2.3.4.5", "3.4.5.6")
|
|
|
|
setIPsForPeer(t, ps, peerD, "2.3.4.5")
|
|
|
|
|
|
|
|
ps.refreshScores()
|
|
|
|
aScore := ps.Score(peerA)
|
|
|
|
bScore := ps.Score(peerB)
|
|
|
|
cScore := ps.Score(peerC)
|
|
|
|
dScore := ps.Score(peerD)
|
|
|
|
|
|
|
|
if aScore != 0 {
|
|
|
|
t.Errorf("expected peer A to have score 0.0, got %f", aScore)
|
|
|
|
}
|
|
|
|
|
|
|
|
nShared := 3
|
|
|
|
ipSurplus := nShared - params.IPColocationFactorThreshold
|
|
|
|
penalty := ipSurplus * ipSurplus
|
|
|
|
expected := params.IPColocationFactorWeight * float64(penalty)
|
|
|
|
for _, score := range []float64{bScore, cScore, dScore} {
|
|
|
|
if score != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", score, expected)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-02-09 08:23:47 +00:00
|
|
|
func TestScoreIPColocationWhitelist(t *testing.T) {
|
2021-02-09 08:17:30 +00:00
|
|
|
// Create parameters with reasonable default values
|
|
|
|
mytopic := "mytopic"
|
|
|
|
|
|
|
|
_, ipNet, err := net.ParseCIDR("2.3.0.0/16")
|
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
|
|
|
|
params := &PeerScoreParams{
|
2021-02-09 08:23:47 +00:00
|
|
|
AppSpecificScore: func(peer.ID) float64 { return 0 },
|
|
|
|
IPColocationFactorThreshold: 1,
|
|
|
|
IPColocationFactorWeight: -1,
|
|
|
|
IPColocationFactorWhitelist: []*net.IPNet{ipNet},
|
|
|
|
Topics: make(map[string]*TopicScoreParams),
|
2021-02-09 08:17:30 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
peerA := peer.ID("A")
|
|
|
|
peerB := peer.ID("B")
|
|
|
|
peerC := peer.ID("C")
|
|
|
|
peerD := peer.ID("D")
|
|
|
|
peers := []peer.ID{peerA, peerB, peerC, peerD}
|
|
|
|
|
|
|
|
ps := newPeerScore(params)
|
|
|
|
for _, p := range peers {
|
|
|
|
ps.AddPeer(p, "myproto")
|
|
|
|
ps.Graft(p, mytopic)
|
|
|
|
}
|
|
|
|
|
|
|
|
// peerA should have no penalty, but B, C, and D should be penalized for sharing an IP
|
|
|
|
setIPsForPeer(t, ps, peerA, "1.2.3.4")
|
|
|
|
setIPsForPeer(t, ps, peerB, "2.3.4.5")
|
|
|
|
setIPsForPeer(t, ps, peerC, "2.3.4.5", "3.4.5.6")
|
|
|
|
setIPsForPeer(t, ps, peerD, "2.3.4.5")
|
|
|
|
|
|
|
|
ps.refreshScores()
|
|
|
|
aScore := ps.Score(peerA)
|
|
|
|
bScore := ps.Score(peerB)
|
|
|
|
cScore := ps.Score(peerC)
|
|
|
|
dScore := ps.Score(peerD)
|
|
|
|
|
|
|
|
if aScore != 0 {
|
|
|
|
t.Errorf("expected peer A to have score 0.0, got %f", aScore)
|
|
|
|
}
|
|
|
|
|
|
|
|
if bScore != 0 {
|
|
|
|
t.Errorf("expected peer B to have score 0.0, got %f", aScore)
|
|
|
|
}
|
|
|
|
|
|
|
|
if cScore != 0 {
|
|
|
|
t.Errorf("expected peer C to have score 0.0, got %f", aScore)
|
|
|
|
}
|
|
|
|
|
|
|
|
if dScore != 0 {
|
|
|
|
t.Errorf("expected peer D to have score 0.0, got %f", aScore)
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2020-05-01 18:38:32 +00:00
|
|
|
func TestScoreBehaviourPenalty(t *testing.T) {
|
|
|
|
params := &PeerScoreParams{
|
|
|
|
AppSpecificScore: func(peer.ID) float64 { return 0 },
|
|
|
|
BehaviourPenaltyWeight: -1,
|
|
|
|
BehaviourPenaltyDecay: 0.99,
|
|
|
|
}
|
|
|
|
|
|
|
|
peerA := peer.ID("A")
|
|
|
|
|
2020-05-01 19:25:10 +00:00
|
|
|
var ps *peerScore
|
|
|
|
|
|
|
|
// first check AddPenalty on a nil peerScore
|
|
|
|
ps.AddPenalty(peerA, 1)
|
2020-05-01 18:38:32 +00:00
|
|
|
aScore := ps.Score(peerA)
|
|
|
|
if aScore != 0 {
|
|
|
|
t.Errorf("expected peer score to be 0, got %f", aScore)
|
|
|
|
}
|
|
|
|
|
2020-05-01 19:25:10 +00:00
|
|
|
// instantiate the peerScore
|
|
|
|
ps = newPeerScore(params)
|
|
|
|
|
|
|
|
// next AddPenalty on a non-existent peer
|
|
|
|
ps.AddPenalty(peerA, 1)
|
|
|
|
aScore = ps.Score(peerA)
|
|
|
|
if aScore != 0 {
|
|
|
|
t.Errorf("expected peer score to be 0, got %f", aScore)
|
|
|
|
}
|
|
|
|
|
|
|
|
// add the peer and test penalties
|
|
|
|
ps.AddPeer(peerA, "myproto")
|
|
|
|
|
|
|
|
aScore = ps.Score(peerA)
|
|
|
|
if aScore != 0 {
|
|
|
|
t.Errorf("expected peer score to be 0, got %f", aScore)
|
|
|
|
}
|
|
|
|
|
2020-05-01 18:38:32 +00:00
|
|
|
ps.AddPenalty(peerA, 1)
|
|
|
|
aScore = ps.Score(peerA)
|
|
|
|
if aScore != -1 {
|
|
|
|
t.Errorf("expected peer score to be -1, got %f", aScore)
|
|
|
|
}
|
|
|
|
|
|
|
|
ps.AddPenalty(peerA, 1)
|
|
|
|
aScore = ps.Score(peerA)
|
|
|
|
if aScore != -4 {
|
|
|
|
t.Errorf("expected peer score to be -4, got %f", aScore)
|
|
|
|
}
|
|
|
|
|
|
|
|
ps.refreshScores()
|
|
|
|
|
|
|
|
aScore = ps.Score(peerA)
|
|
|
|
if aScore != -3.9204 {
|
|
|
|
t.Errorf("expected peer score to be -3.9204, got %f", aScore)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-04-23 17:03:52 +00:00
|
|
|
func TestScoreRetention(t *testing.T) {
|
|
|
|
// Create parameters with reasonable default values
|
|
|
|
mytopic := "mytopic"
|
|
|
|
|
|
|
|
params := &PeerScoreParams{
|
|
|
|
AppSpecificScore: func(peer.ID) float64 { return -1000 },
|
|
|
|
AppSpecificWeight: 1.0,
|
|
|
|
Topics: make(map[string]*TopicScoreParams),
|
|
|
|
RetainScore: time.Second,
|
|
|
|
}
|
|
|
|
|
|
|
|
peerA := peer.ID("A")
|
|
|
|
|
|
|
|
ps := newPeerScore(params)
|
|
|
|
ps.AddPeer(peerA, "myproto")
|
|
|
|
ps.Graft(peerA, mytopic)
|
|
|
|
|
|
|
|
// score should equal -1000 (app specific score)
|
|
|
|
expected := float64(-1000)
|
|
|
|
ps.refreshScores()
|
|
|
|
aScore := ps.Score(peerA)
|
|
|
|
if aScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", aScore, expected)
|
|
|
|
}
|
|
|
|
|
|
|
|
// disconnect & wait half of RetainScore time. should still have negative score
|
|
|
|
ps.RemovePeer(peerA)
|
|
|
|
delay := params.RetainScore / time.Duration(2)
|
|
|
|
time.Sleep(delay)
|
|
|
|
ps.refreshScores()
|
|
|
|
aScore = ps.Score(peerA)
|
|
|
|
if aScore != expected {
|
|
|
|
t.Fatalf("Score: %f. Expected %f", aScore, expected)
|
|
|
|
}
|
|
|
|
|
|
|
|
// wait remaining time (plus a little slop) and the score should reset to zero
|
|
|
|
time.Sleep(delay + (50 * time.Millisecond))
|
|
|
|
ps.refreshScores()
|
|
|
|
aScore = ps.Score(peerA)
|
|
|
|
if aScore != 0 {
|
|
|
|
t.Fatalf("Score: %f. Expected 0.0", aScore)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-09-09 12:15:41 +00:00
|
|
|
func TestScoreRecapTopicParams(t *testing.T) {
|
2020-09-09 11:47:36 +00:00
|
|
|
// Create parameters with reasonable default values
|
|
|
|
mytopic := "mytopic"
|
|
|
|
params := &PeerScoreParams{
|
|
|
|
AppSpecificScore: func(peer.ID) float64 { return 0 },
|
|
|
|
Topics: make(map[string]*TopicScoreParams),
|
|
|
|
}
|
|
|
|
topicScoreParams := &TopicScoreParams{
|
|
|
|
TopicWeight: 1,
|
|
|
|
|
|
|
|
MeshMessageDeliveriesWeight: -1,
|
|
|
|
MeshMessageDeliveriesActivation: time.Second,
|
|
|
|
MeshMessageDeliveriesWindow: 10 * time.Millisecond,
|
|
|
|
MeshMessageDeliveriesThreshold: 20,
|
|
|
|
MeshMessageDeliveriesCap: 100,
|
|
|
|
MeshMessageDeliveriesDecay: 1.0, // no decay for this test
|
|
|
|
|
|
|
|
FirstMessageDeliveriesWeight: 10,
|
|
|
|
FirstMessageDeliveriesDecay: 1.0, // no decay for this test
|
|
|
|
FirstMessageDeliveriesCap: 100,
|
|
|
|
|
|
|
|
TimeInMeshQuantum: time.Second,
|
|
|
|
}
|
|
|
|
|
|
|
|
params.Topics[mytopic] = topicScoreParams
|
|
|
|
|
|
|
|
// peer A always delivers the message first.
|
|
|
|
// peer B delivers next (within the delivery window).
|
|
|
|
// peer C delivers outside the delivery window.
|
|
|
|
// we expect peers A and B to have a score of zero, since all other parameter weights are zero.
|
|
|
|
// Peer C should have a negative score.
|
|
|
|
peerA := peer.ID("A")
|
|
|
|
peerB := peer.ID("B")
|
|
|
|
peers := []peer.ID{peerA, peerB}
|
|
|
|
|
|
|
|
ps := newPeerScore(params)
|
|
|
|
for _, p := range peers {
|
|
|
|
ps.AddPeer(p, "myproto")
|
|
|
|
ps.Graft(p, mytopic)
|
|
|
|
}
|
|
|
|
|
|
|
|
// deliver a bunch of messages from peer A, with duplicates within the window from peer B,
|
|
|
|
nMessages := 100
|
|
|
|
for i := 0; i < nMessages; i++ {
|
|
|
|
pbMsg := makeTestMessage(i)
|
2020-09-29 15:05:54 +00:00
|
|
|
pbMsg.Topic = &mytopic
|
2020-09-09 11:47:36 +00:00
|
|
|
msg := Message{ReceivedFrom: peerA, Message: pbMsg}
|
|
|
|
ps.ValidateMessage(&msg)
|
|
|
|
ps.DeliverMessage(&msg)
|
|
|
|
|
|
|
|
msg.ReceivedFrom = peerB
|
|
|
|
ps.DuplicateMessage(&msg)
|
|
|
|
}
|
|
|
|
|
|
|
|
// check that the FirstMessageDeliveries for peerA and MeshMessageDeliveries for PeerB is
|
|
|
|
// at 100
|
|
|
|
if ps.peerStats[peerA].topics[mytopic].firstMessageDeliveries != 100 {
|
|
|
|
t.Fatalf("expected 100 FirstMessageDeliveries for peerA, but got %f", ps.peerStats[peerA].topics[mytopic].firstMessageDeliveries)
|
|
|
|
}
|
|
|
|
// check that the MeshMessageDeliveries for peerB and MeshMessageDeliveries for PeerB is
|
|
|
|
// at 100
|
|
|
|
if ps.peerStats[peerB].topics[mytopic].meshMessageDeliveries != 100 {
|
|
|
|
t.Fatalf("expected 100 MeshMessageDeliveries for peerB, but got %f", ps.peerStats[peerB].topics[mytopic].meshMessageDeliveries)
|
|
|
|
}
|
|
|
|
|
|
|
|
// reset the topic paramaters recapping the deliveries counters
|
|
|
|
newTopicScoreParams := &TopicScoreParams{
|
|
|
|
TopicWeight: 1,
|
|
|
|
|
|
|
|
MeshMessageDeliveriesWeight: -1,
|
|
|
|
MeshMessageDeliveriesActivation: time.Second,
|
|
|
|
MeshMessageDeliveriesWindow: 10 * time.Millisecond,
|
|
|
|
MeshMessageDeliveriesThreshold: 20,
|
|
|
|
MeshMessageDeliveriesCap: 50,
|
|
|
|
MeshMessageDeliveriesDecay: 1.0, // no decay for this test
|
|
|
|
|
|
|
|
FirstMessageDeliveriesWeight: 10,
|
|
|
|
FirstMessageDeliveriesDecay: 1.0, // no decay for this test
|
|
|
|
FirstMessageDeliveriesCap: 50,
|
|
|
|
|
|
|
|
TimeInMeshQuantum: time.Second,
|
|
|
|
}
|
|
|
|
|
|
|
|
err := ps.SetTopicScoreParams(mytopic, newTopicScoreParams)
|
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
|
|
|
|
// verify that the counters got recapped
|
|
|
|
if ps.peerStats[peerA].topics[mytopic].firstMessageDeliveries != 50 {
|
|
|
|
t.Fatalf("expected 50 FirstMessageDeliveries for peerA, but got %f", ps.peerStats[peerA].topics[mytopic].firstMessageDeliveries)
|
|
|
|
}
|
|
|
|
if ps.peerStats[peerB].topics[mytopic].meshMessageDeliveries != 50 {
|
|
|
|
t.Fatalf("expected 50 MeshMessageDeliveries for peerB, but got %f", ps.peerStats[peerB].topics[mytopic].meshMessageDeliveries)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-09-09 12:22:32 +00:00
|
|
|
func TestScoreResetTopicParams(t *testing.T) {
|
|
|
|
// Create parameters with reasonable default values
|
|
|
|
mytopic := "mytopic"
|
|
|
|
params := &PeerScoreParams{
|
|
|
|
AppSpecificScore: func(peer.ID) float64 { return 0 },
|
|
|
|
Topics: make(map[string]*TopicScoreParams),
|
|
|
|
}
|
|
|
|
topicScoreParams := &TopicScoreParams{
|
|
|
|
TopicWeight: 1,
|
|
|
|
TimeInMeshQuantum: time.Second,
|
|
|
|
InvalidMessageDeliveriesWeight: -1,
|
|
|
|
InvalidMessageDeliveriesDecay: 1.0,
|
|
|
|
}
|
|
|
|
|
|
|
|
params.Topics[mytopic] = topicScoreParams
|
|
|
|
|
|
|
|
// peer A always delivers the message first.
|
|
|
|
// peer B delivers next (within the delivery window).
|
|
|
|
// peer C delivers outside the delivery window.
|
|
|
|
// we expect peers A and B to have a score of zero, since all other parameter weights are zero.
|
|
|
|
// Peer C should have a negative score.
|
|
|
|
peerA := peer.ID("A")
|
|
|
|
|
|
|
|
ps := newPeerScore(params)
|
|
|
|
ps.AddPeer(peerA, "myproto")
|
|
|
|
|
|
|
|
// reject a bunch of messages
|
|
|
|
nMessages := 100
|
|
|
|
for i := 0; i < nMessages; i++ {
|
|
|
|
pbMsg := makeTestMessage(i)
|
2020-09-29 15:05:54 +00:00
|
|
|
pbMsg.Topic = &mytopic
|
2020-09-09 12:22:32 +00:00
|
|
|
msg := Message{ReceivedFrom: peerA, Message: pbMsg}
|
|
|
|
ps.ValidateMessage(&msg)
|
|
|
|
ps.RejectMessage(&msg, rejectValidationFailed)
|
|
|
|
}
|
|
|
|
|
|
|
|
// check the topic score
|
|
|
|
aScore := ps.Score(peerA)
|
|
|
|
if aScore != -10000 {
|
|
|
|
t.Fatalf("expected a -10000 score, but got %f instead", aScore)
|
|
|
|
}
|
|
|
|
|
|
|
|
// reset the topic paramaters recapping the deliveries counters
|
|
|
|
newTopicScoreParams := &TopicScoreParams{
|
|
|
|
TopicWeight: 1,
|
|
|
|
TimeInMeshQuantum: time.Second,
|
|
|
|
InvalidMessageDeliveriesWeight: -10,
|
|
|
|
InvalidMessageDeliveriesDecay: 1.0,
|
|
|
|
}
|
|
|
|
|
|
|
|
err := ps.SetTopicScoreParams(mytopic, newTopicScoreParams)
|
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
|
|
|
|
// verify the topic score was adjusted
|
|
|
|
aScore = ps.Score(peerA)
|
|
|
|
if aScore != -100000 {
|
|
|
|
t.Fatalf("expected a -1000000 score, but got %f instead", aScore)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2020-04-23 17:03:52 +00:00
|
|
|
func withinVariance(score float64, expected float64, variance float64) bool {
|
|
|
|
if expected >= 0 {
|
|
|
|
return score > expected*(1-variance) && score < expected*(1+variance)
|
|
|
|
}
|
|
|
|
return score > expected*(1+variance) && score < expected*(1-variance)
|
|
|
|
}
|
|
|
|
|
|
|
|
// hack to set IPs for a peer without having to spin up real hosts with shared IPs
|
|
|
|
func setIPsForPeer(t *testing.T, ps *peerScore, p peer.ID, ips ...string) {
|
|
|
|
t.Helper()
|
|
|
|
ps.setIPs(p, ips, []string{})
|
|
|
|
pstats, ok := ps.peerStats[p]
|
|
|
|
if !ok {
|
|
|
|
t.Fatal("unable to get peerStats")
|
|
|
|
}
|
|
|
|
pstats.ips = ips
|
|
|
|
}
|