2023
DOI: 10.1007/s12596-023-01373-w
|View full text |Cite
|
Sign up to set email alerts
|

Towards optimal neighbour selection mechanisms in peer-to-peer networks

Yang Zhenying
Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 34 publications
0
1
0
Order By: Relevance
“…Simultaneously, the utilization of the Particle Swarm Optimization (PSO) algorithm in distributed environments has gained traction. Various PSO algorithms, including dynamic multi-swarm PSO (DMS-PSO), PSO for neighbor selection in peer-to-peer (P2P) networks, and gossip-based PSO for maintaining flexible P2P networks, have been explored [38,39]. Studies have demonstrated the adaptability of PSO in diverse distributed environments, showcasing its potential in addressing optimization challenges.…”
Section: Related Workmentioning
confidence: 99%
“…Simultaneously, the utilization of the Particle Swarm Optimization (PSO) algorithm in distributed environments has gained traction. Various PSO algorithms, including dynamic multi-swarm PSO (DMS-PSO), PSO for neighbor selection in peer-to-peer (P2P) networks, and gossip-based PSO for maintaining flexible P2P networks, have been explored [38,39]. Studies have demonstrated the adaptability of PSO in diverse distributed environments, showcasing its potential in addressing optimization challenges.…”
Section: Related Workmentioning
confidence: 99%