6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07) 2007
DOI: 10.1109/cisim.2007.6
|View full text |Cite
|
Sign up to set email alerts
|

A Particle Swarm Optimization Algorithm for Neighbor Selection in Peer-to-Peer Networks

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
4
3
1

Relationship

2
6

Authors

Journals

citations
Cited by 11 publications
(6 citation statements)
references
References 14 publications
(13 reference statements)
0
6
0
Order By: Relevance
“…Return Q best function optimization problems, or the problems [33] that can be transformed to function optimization problems. As an algorithm, its main strength is its fast convergence [34,35], which compares favorably with many other global optimization algorithms. The classical particle swarm model consists of a swarm of particles which are initialized with a population of random candidate solutions.…”
Section: Model Selection Algorithmmentioning
confidence: 99%
“…Return Q best function optimization problems, or the problems [33] that can be transformed to function optimization problems. As an algorithm, its main strength is its fast convergence [34,35], which compares favorably with many other global optimization algorithms. The classical particle swarm model consists of a swarm of particles which are initialized with a population of random candidate solutions.…”
Section: Model Selection Algorithmmentioning
confidence: 99%
“…In order to maximize the disjointness of content, the system has to maximize the number of content pieces each peer can contribute to its neighbors by determining the connections. We discussed to apply the particle swarm algorithm for the problem (35,1400,17) [26]. The algorithm was repeated 4 times with different random seeds.…”
Section: Curve Illustrationmentioning
confidence: 99%
“…Each trial had a fixed number of 80 iterations. Other specific parameter settings of the algorithms are described in [26]. The average fitness values of the best solutions throughout the optimization run were recorded.…”
Section: Curve Illustrationmentioning
confidence: 99%
“…Huang et al in [20] propose a network-aware P2P file sharing architecture, which has a resource provider selection algorithm that can select a new resource provider for mobile peers experiencing broken connections in wireless mobile networks, but this resource selection strategy cannot be used in the P2P streaming system. Sun et al in [21] propose an optimization method using particle swarm optimization algorithm for neighbor selection in P2P networks. Yao et al in [22] indicate that PPLive achieves high ISP level traffic locality spontaneously with its decentralized, latency based, and neighbor referral peer selection strategy, which provide some new insights for better understanding and optimizing the network-and user-level performance in practical P2P live streaming systems.…”
Section: Related Workmentioning
confidence: 99%