Name
Abstract | ||
|---|---|---|
Particle Swarm Optimization (PSO) is a well-known technique that has been used for a wide range of optimization problems. The method is inherently parallel, wherein a group of particles wander in the solution space; communicate with one another to find the best solution. Though parallel, this method has not been much experimented in peer-to-peer computing frameworks. A peer-to-peer network brings a new set of challenges but has a number of distinct properties; for example they are prone to various types of failure but can harness the unused computing cycle of a set of systems. In this paper, we illustrate such a framework, wherein the PSO method is being implemented on top of a custom peer-to-peer network. Our framework includes novel algorithms that effectively skip overwork, finds Pareto optimal solutions that are diversified and includes both load balance and fault tolerance techniques. We demonstrate the use of this new distributed optimization framework using some well-known multi-objective benchmark functions and explain its effectiveness when compared to other systems of such types. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-319-03753-0_64 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Peer-to-peer,Computer science,Multi-objective optimization,Artificial intelligence,Optimization problem,Distributed computing,Particle swarm optimization,Mathematical optimization,Load balancing (computing),Multi-swarm optimization,Fault tolerance,Overlay network,Machine learning | Conference | 8297 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hrishikesh Dewan | 1 | 13 | 3.72 |
| Raksha B. Nayak | 2 | 0 | 1.69 |
| V. Susheela Devi | 3 | 47 | 9.21 |