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

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...

Full description

Saved in:
Bibliographic Details
Main Author Huang, Chunlin
Format Journal Article
LanguageEnglish
Published 19.08.2024
Subjects
Computer Science - Distributed, Parallel, and Cluster Computing
Computer Science - Networking and Internet Architecture
Online AccessGet full text

Cover

More Information
Summary: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.
DOI:10.48550/arxiv.2408.10092