Shichang Sun, A. Abraham, Guiyong Zhang, Hongbo Liu
{"title":"点对点网络中邻居选择的粒子群算法","authors":"Shichang Sun, A. Abraham, Guiyong Zhang, Hongbo Liu","doi":"10.1109/CISIM.2007.6","DOIUrl":null,"url":null,"abstract":"Peer-to-peer (P2P) topology has significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we propose a particle swarm optimization (PSO) approach to the problem of neighbor selection (NS) in P2P networks. Each particle encodes the upper half of the peer-connection matrix through the undirected graph, which reduces the search space dimension. The results indicate that PSO usually required shorter time to obtain better results than genetic algorithm (GA), specially for large scale problems.","PeriodicalId":350490,"journal":{"name":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","volume":"23 S1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"A Particle Swarm Optimization Algorithm for Neighbor Selection in Peer-to-Peer Networks\",\"authors\":\"Shichang Sun, A. Abraham, Guiyong Zhang, Hongbo Liu\",\"doi\":\"10.1109/CISIM.2007.6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Peer-to-peer (P2P) topology has significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we propose a particle swarm optimization (PSO) approach to the problem of neighbor selection (NS) in P2P networks. Each particle encodes the upper half of the peer-connection matrix through the undirected graph, which reduces the search space dimension. The results indicate that PSO usually required shorter time to obtain better results than genetic algorithm (GA), specially for large scale problems.\",\"PeriodicalId\":350490,\"journal\":{\"name\":\"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)\",\"volume\":\"23 S1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISIM.2007.6\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISIM.2007.6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Particle Swarm Optimization Algorithm for Neighbor Selection in Peer-to-Peer Networks
Peer-to-peer (P2P) topology has significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we propose a particle swarm optimization (PSO) approach to the problem of neighbor selection (NS) in P2P networks. Each particle encodes the upper half of the peer-connection matrix through the undirected graph, which reduces the search space dimension. The results indicate that PSO usually required shorter time to obtain better results than genetic algorithm (GA), specially for large scale problems.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
