mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-04-28 17:57:56 +00:00
Aaro Altonen
80616f6d03
[litep2p](https://github.com/altonen/litep2p) is a libp2p-compatible P2P networking library. It supports all of the features of `rust-libp2p` that are currently being utilized by Polkadot SDK. Compared to `rust-libp2p`, `litep2p` has a quite different architecture which is why the new `litep2p` network backend is only able to use a little of the existing code in `sc-network`. The design has been mainly influenced by how we'd wish to structure our networking-related code in Polkadot SDK: independent higher-levels protocols directly communicating with the network over links that support bidirectional backpressure. A good example would be `NotificationHandle`/`RequestResponseHandle` abstractions which allow, e.g., `SyncingEngine` to directly communicate with peers to announce/request blocks. I've tried running `polkadot --network-backend litep2p` with a few different peer configurations and there is a noticeable reduction in networking CPU usage. For high load (`--out-peers 200`), networking CPU usage goes down from ~110% to ~30% (80 pp) and for normal load (`--out-peers 40`), the usage goes down from ~55% to ~18% (37 pp). These should not be taken as final numbers because: a) there are still some low-hanging optimization fruits, such as enabling [receive window auto-tuning](https://github.com/libp2p/rust-yamux/pull/176), integrating `Peerset` more closely with `litep2p` or improving memory usage of the WebSocket transport b) fixing bugs/instabilities that incorrectly cause `litep2p` to do less work will increase the networking CPU usage c) verification in a more diverse set of tests/conditions is needed Nevertheless, these numbers should give an early estimate for CPU usage of the new networking backend. This PR consists of three separate changes: * introduce a generic `PeerId` (wrapper around `Multihash`) so that we don't have use `NetworkService::PeerId` in every part of the code that uses a `PeerId` * introduce `NetworkBackend` trait, implement it for the libp2p network stack and make Polkadot SDK generic over `NetworkBackend` * implement `NetworkBackend` for litep2p The new library should be considered experimental which is why `rust-libp2p` will remain as the default option for the time being. This PR currently depends on the master branch of `litep2p` but I'll cut a new release for the library once all review comments have been addresses. --------- Signed-off-by: Alexandru Vasile <alexandru.vasile@parity.io> Co-authored-by: Dmitry Markin <dmitry@markin.tech> Co-authored-by: Alexandru Vasile <60601340+lexnv@users.noreply.github.com> Co-authored-by: Alexandru Vasile <alexandru.vasile@parity.io>
78 lines
2.0 KiB
Rust
78 lines
2.0 KiB
Rust
// This file is part of Substrate.
|
|
|
|
// Copyright (C) Parity Technologies (UK) Ltd.
|
|
// SPDX-License-Identifier: GPL-3.0-or-later WITH Classpath-exception-2.0
|
|
|
|
// This program is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
|
|
// This program is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with this program. If not, see <https://www.gnu.org/licenses/>.
|
|
|
|
//! Mocked components for tests.
|
|
|
|
use crate::{
|
|
peer_store::{PeerStoreProvider, ProtocolHandle},
|
|
ReputationChange,
|
|
};
|
|
|
|
use sc_network_common::role::ObservedRole;
|
|
use sc_network_types::PeerId;
|
|
|
|
use std::{collections::HashSet, sync::Arc};
|
|
|
|
/// No-op `PeerStore`.
|
|
#[derive(Debug)]
|
|
pub struct MockPeerStore {}
|
|
|
|
impl PeerStoreProvider for MockPeerStore {
|
|
fn is_banned(&self, _peer_id: &PeerId) -> bool {
|
|
// Make sure that the peer is not banned.
|
|
false
|
|
}
|
|
|
|
fn register_protocol(&self, _protocol_handle: Arc<dyn ProtocolHandle>) {
|
|
// Make sure not to fail.
|
|
}
|
|
|
|
fn report_disconnect(&self, _peer_id: PeerId) {
|
|
// Make sure not to fail.
|
|
}
|
|
|
|
fn report_peer(&self, _peer_id: PeerId, _change: ReputationChange) {
|
|
// Make sure not to fail.
|
|
}
|
|
|
|
fn peer_reputation(&self, _peer_id: &PeerId) -> i32 {
|
|
// Make sure that the peer is not banned.
|
|
0
|
|
}
|
|
|
|
fn peer_role(&self, _peer_id: &PeerId) -> Option<ObservedRole> {
|
|
None
|
|
}
|
|
|
|
fn set_peer_role(&self, _peer_id: &PeerId, _role: ObservedRole) {
|
|
unimplemented!();
|
|
}
|
|
|
|
fn outgoing_candidates(&self, _count: usize, _ignored: HashSet<PeerId>) -> Vec<PeerId> {
|
|
unimplemented!()
|
|
}
|
|
|
|
fn num_known_peers(&self) -> usize {
|
|
0usize
|
|
}
|
|
|
|
fn add_known_peer(&self, _peer_id: PeerId) {
|
|
unimplemented!()
|
|
}
|
|
}
|