Open AccessCoolStreaming and Gossip Algorithm in P2P Service Networks
Author(s) -
Weiqi Feng,
Lei Liu
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1486/3/032002
Subject(s) - computer science , scalability , distributed computing , gossip protocol , bandwidth (computing) , fault tolerance , computer network , gossip , peer to peer , algorithm , database , psychology , social psychology
In recent years, peer-to-peer (P2P) as a new network application model has become more and more popular for its scalability, high fault tolerance and other outstanding advantages. The main feature of P2P technology is to ensure the network resources distributed on terminal computers, including computing resources, bandwidth resources, content resources, etc., are fully utilized to reduce the consumption of central server resources. This paper analyzes the performance differences of nodes in P2P networks from many aspects, such as available bandwidth, online time and storage space. Based on this mechanism and with the idea of mission algorithm, the data distribution efficiency of this algorithm is significantly improved compared with the classical mission algorithm, which can ensure the minimal network load and achieve the efficiency of flood data distribution strategy.