A multi-swarm approach for neighbor selection in peer-to-peer networks

Ajith Abraham, Youakim Badr, Hongbo Liu, Crina Grosan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

Peer-to-peer (P2P) topology has a significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we investigate a multi-swarm approach to the problem of Neighbor Selection (NS) in P2P networks. Particle swarm optimization algorithm share some common characteristics with P2P in a dynamic social environment. Each particle encodes the upper half of the peer-connection matrix through the undirected graph, which reduces the search space dimension. The synergetic performance is achieved by the adjustment to the velocity influenced by the individual's cognition, the group cognition from multi-swarms, and the social cognition from the whole swarm. The performance of the proposed approach is evaluated and compared with two other different algorithms. The results indicate that it usually required shorter time to obtain better results than the other considered methods, specially for large scale problems.

Original languageEnglish (US)
Title of host publication5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings
Pages178-184
Number of pages7
DOIs
StatePublished - Dec 1 2008
Event5th International Conference on Soft Computing As Transdisciplinary Science and Technology, CSTST '08 - Cergy-Pontoise, France
Duration: Oct 28 2008Oct 31 2008

Publication series

Name5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings

Conference

Conference5th International Conference on Soft Computing As Transdisciplinary Science and Technology, CSTST '08
CountryFrance
CityCergy-Pontoise
Period10/28/0810/31/08

Fingerprint

Peer to peer networks
Peer-to-peer Networks
Cognition
Swarm
Particle swarm optimization (PSO)
Social Dynamics
Connection Matrix
Scalability
Peer-to-peer (P2P)
P2P Network
Topology
Large-scale Problems
Particle Swarm Optimization Algorithm
Undirected Graph
Search Space
Adjustment

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Theoretical Computer Science

Cite this

Abraham, A., Badr, Y., Liu, H., & Grosan, C. (2008). A multi-swarm approach for neighbor selection in peer-to-peer networks. In 5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings (pp. 178-184). (5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings). https://doi.org/10.1145/1456223.1456263
Abraham, Ajith ; Badr, Youakim ; Liu, Hongbo ; Grosan, Crina. / A multi-swarm approach for neighbor selection in peer-to-peer networks. 5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings. 2008. pp. 178-184 (5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings).
@inproceedings{7b542b110dc74a09bf5f7b406b0bc1ce,
title = "A multi-swarm approach for neighbor selection in peer-to-peer networks",
abstract = "Peer-to-peer (P2P) topology has a significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we investigate a multi-swarm approach to the problem of Neighbor Selection (NS) in P2P networks. Particle swarm optimization algorithm share some common characteristics with P2P in a dynamic social environment. Each particle encodes the upper half of the peer-connection matrix through the undirected graph, which reduces the search space dimension. The synergetic performance is achieved by the adjustment to the velocity influenced by the individual's cognition, the group cognition from multi-swarms, and the social cognition from the whole swarm. The performance of the proposed approach is evaluated and compared with two other different algorithms. The results indicate that it usually required shorter time to obtain better results than the other considered methods, specially for large scale problems.",
author = "Ajith Abraham and Youakim Badr and Hongbo Liu and Crina Grosan",
year = "2008",
month = "12",
day = "1",
doi = "10.1145/1456223.1456263",
language = "English (US)",
isbn = "9781605580463",
series = "5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings",
pages = "178--184",
booktitle = "5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings",

}

Abraham, A, Badr, Y, Liu, H & Grosan, C 2008, A multi-swarm approach for neighbor selection in peer-to-peer networks. in 5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings. 5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings, pp. 178-184, 5th International Conference on Soft Computing As Transdisciplinary Science and Technology, CSTST '08, Cergy-Pontoise, France, 10/28/08. https://doi.org/10.1145/1456223.1456263

A multi-swarm approach for neighbor selection in peer-to-peer networks. / Abraham, Ajith; Badr, Youakim; Liu, Hongbo; Grosan, Crina.

5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings. 2008. p. 178-184 (5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - A multi-swarm approach for neighbor selection in peer-to-peer networks

AU - Abraham, Ajith

AU - Badr, Youakim

AU - Liu, Hongbo

AU - Grosan, Crina

PY - 2008/12/1

Y1 - 2008/12/1

N2 - Peer-to-peer (P2P) topology has a significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we investigate a multi-swarm approach to the problem of Neighbor Selection (NS) in P2P networks. Particle swarm optimization algorithm share some common characteristics with P2P in a dynamic social environment. Each particle encodes the upper half of the peer-connection matrix through the undirected graph, which reduces the search space dimension. The synergetic performance is achieved by the adjustment to the velocity influenced by the individual's cognition, the group cognition from multi-swarms, and the social cognition from the whole swarm. The performance of the proposed approach is evaluated and compared with two other different algorithms. The results indicate that it usually required shorter time to obtain better results than the other considered methods, specially for large scale problems.

AB - Peer-to-peer (P2P) topology has a significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we investigate a multi-swarm approach to the problem of Neighbor Selection (NS) in P2P networks. Particle swarm optimization algorithm share some common characteristics with P2P in a dynamic social environment. Each particle encodes the upper half of the peer-connection matrix through the undirected graph, which reduces the search space dimension. The synergetic performance is achieved by the adjustment to the velocity influenced by the individual's cognition, the group cognition from multi-swarms, and the social cognition from the whole swarm. The performance of the proposed approach is evaluated and compared with two other different algorithms. The results indicate that it usually required shorter time to obtain better results than the other considered methods, specially for large scale problems.

UR - http://www.scopus.com/inward/record.url?scp=77951615686&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951615686&partnerID=8YFLogxK

U2 - 10.1145/1456223.1456263

DO - 10.1145/1456223.1456263

M3 - Conference contribution

AN - SCOPUS:77951615686

SN - 9781605580463

T3 - 5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings

SP - 178

EP - 184

BT - 5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings

ER -

Abraham A, Badr Y, Liu H, Grosan C. A multi-swarm approach for neighbor selection in peer-to-peer networks. In 5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings. 2008. p. 178-184. (5th International Conference on Soft Computing as Transdisciplinary Science and Technology, CSTST '08 - Proceedings). https://doi.org/10.1145/1456223.1456263