Selecting Relay Nodes Based on Evaluation Results to Enhance P2P Broadcasting Efficiency

TL;DR

This paper proposes a Neighbor Evaluation mechanism for selecting relay nodes in P2P networks, significantly improving broadcast latency and coverage by assessing neighbor quality, thus reducing resource consumption.

Contribution

It introduces a novel Neighbor Evaluation mechanism for relay node selection in P2P broadcasting, addressing limitations of existing DHT-based algorithms.

Findings

Neighbor Evaluation improves broadcast latency

Neighbor Evaluation enhances coverage rate

Reduces network resource consumption

Abstract

The existence of node failures is inevitable in distributed systems, thus many P2P broadcasting networks adopt highly robust Flooding-based broadcast algorithms. High redundancy inevitably leads to high network resource consumption, and it may constrain the data transmission rate of the network. To address excessive network resource consumption, many studies have explored broadcasting mechanisms in structured P2P overlay networks. However, existing DHT-based algorithms cannot assess the quality of neighbors, which is crucial for broadcast efficiency. In this paper, we introduce the Neighbor Evaluation mechanism to select relay nodes based on their evaluated contributions. According to experimental results, the Neighbor Evaluation mechanism has a significant effect on both broadcast latency and coverage rate.