network: rework broadcast logic

We have a number of queues for different purposes:
 * regular broadcast queue
 * direct p2p queue
 * high-priority queue

And two basic egress scenarios:
 * direct p2p messages (replies to requests in Server's handle* methods)
 * broadcasted messages

Low priority broadcasted messages:
 * transaction inventories
 * block inventories
 * notary inventories
 * non-consensus extensibles

High-priority broadcasted messages:
 * consensus extensibles
 * getdata transaction requests from consensus process
 * getaddr requests

P2P messages are a bit more complicated, most of the time they use p2p queue,
but extensible message requests/replies use HP queue.

Server's handle* code is run from Peer's handleIncoming, every peer has this
thread that handles incoming messages. When working with the peer it's
important to reply to requests and blocking this thread until we send (queue)
a reply is fine, if the peer is slow we just won't get anything new from
it. The queue used is irrelevant wrt this issue.

Broadcasted messages are radically different, we want them to be delivered to
many peers, but we don't care about specific ones. If it's delivered to 2/3 of
the peers we're fine, if it's delivered to more of them --- it's not an
issue. But doing this fairly is not an easy thing, current code tries performing
unblocked sends and if this doesn't yield enough results it then blocks (but
has a timeout, we can't wait indefinitely). But it does so in sequential
manner, once the peer is chosen the code will wait for it (and only it) until
timeout happens.

What can be done instead is an attempt to push the message to all of the peers
simultaneously (or close to that). If they all deliver --- OK, if some block
and wait then we can wait until _any_ of them pushes the message through (or
global timeout happens, we still can't wait forever). If we have enough
deliveries then we can cancel pending ones and it's again not an error if
these canceled threads still do their job.

This makes the system more dynamic and adds some substantial processing
overhead, but it's a networking code, any of this overhead is much lower than
the actual packet delivery time. It also allows to spread the load more
fairly, if there is any spare queue it'll get the packet and release the
broadcaster. On the next broadcast iteration another peer is more likely to be
chosen just because it didn't get a message previously (and had some time to
deliver already queued messages).

It works perfectly in tests, with optimal networking conditions we have much
better block times and TPS increases by 5-25%% depending on the scenario.

I'd go as far as to say that it fixes the original problem of #2678, because
in this particular scenario we have empty queues in ~100% of the cases and
this new logic will likely lead to 100% fan out in this case (cancelation just
won't happen fast enough). But when the load grows and there is some waiting
in the queue it will optimize out the slowest links.

pkg/network/peer.go

@@ -1,6 +1,7 @@
 package network
 
 import (
+	"context"
 	"net"
 
 	"github.com/nspcc-dev/neo-go/pkg/network/payload"
@@ -23,12 +24,17 @@ type Peer interface {
 	// EnqueuePacket if there is no error in serializing it.
 	EnqueueMessage(*Message) error
 
-	// EnqueuePacket is a blocking packet enqueuer, it doesn't return until
-	// it puts the given packet into the queue. It accepts a slice of bytes that
+	// BroadcastPacket is a context-bound packet enqueuer, it either puts the
+	// given packet into the queue or exits with errors if the context expires
+	// or peer disconnects. It accepts a slice of bytes that
 	// can be shared with other queues (so that message marshalling can be
-	// done once for all peers). It does nothing if the peer has not yet
+	// done once for all peers). It returns an error if the peer has not yet
 	// completed handshaking.
-	EnqueuePacket(bool, []byte) error
+	BroadcastPacket(context.Context, []byte) error
+
+	// BroadcastHPPacket is the same as BroadcastPacket, but uses a high-priority
+	// queue.
+	BroadcastHPPacket(context.Context, []byte) error
 
 	// EnqueueP2PMessage is a temporary wrapper that sends a message via
 	// EnqueueP2PPacket if there is no error in serializing it.
@@ -40,14 +46,14 @@ type Peer interface {
 	// done once for all peers). It does nothing if the peer has not yet
 	// completed handshaking. This queue is intended to be used for unicast
 	// peer to peer communication that is more important than broadcasts
-	// (handled by EnqueuePacket) but less important than high-priority
-	// messages (handled by EnqueueHPPacket).
+	// (handled by BroadcastPacket) but less important than high-priority
+	// messages (handled by EnqueueHPPacket and BroadcastHPPacket).
 	EnqueueP2PPacket([]byte) error
 
 	// EnqueueHPPacket is a blocking high priority packet enqueuer, it
 	// doesn't return until it puts the given packet into the high-priority
 	// queue.
-	EnqueueHPPacket(bool, []byte) error
+	EnqueueHPPacket([]byte) error
 	Version() *payload.Version
 	LastBlockIndex() uint32
 	Handshaked() bool