Super peer selection strategy in peer-to-peer networks based on learning automata

被引:2
|
作者
Safara, Fatemeh [1 ]
Souri, Alireza [2 ]
Deiman, Sara Fathipour [3 ]
机构
[1] Islamic Azad Univ, Islamshahr Branch, Dept Comp Engn, Islamshahr, Iran
[2] Islamic Azad Univ, Islamshahr Branch, Young Researchers & Elite Club, Islamshahr, Iran
[3] Islamic Azad Univ, Cent Tehran Branch, Dept Comp Engn, Tehran, Iran
关键词
capacity; delta distance; learning automata; P model; Super peer selection; OVERLAY NETWORK; EFFICIENT; DHT;
D O I
10.1002/dac.4296
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A super peer is a peer that has the highest capacity in comparison with other peers in the network. It is trying to reduce the load of the rest of the peers and improve network performance. Selecting a super peer in a peer-to-peer-based network is a very crucial challenge. As the ability of peers are very different, by considering capacity of each peer and selecting a proper role, we can use network components much more efficiently. Because of the dynamicity of these networks, comparative methods of selecting super peers is of special importance. Comparative selection is continuously trying to select proper super peer. In recent studies, learning automata was introduced as a powerful learning model to solve this issue. In most of the studies, learning automata with an S model is employed. In this article, another selection method of learning automata with a P model environment is presented and its capability for super peer selection is shown. Moreover, simulation results show that removing some of the super peers would result in better performance in terms of inversion time in the high level of super-peer capacity, required time for selecting proper super peer, and super peer tolerance.
引用
收藏
页数:10
相关论文
共 50 条
  • [41] Searching in peer-to-peer networks
    Klampanos, Iraklis A.
    Jose, Joemon M.
    [J]. COMPUTER SCIENCE REVIEW, 2012, 6 (04) : 161 - 183
  • [42] Tracerouting peer-to-peer networks
    Liu, WL
    Boutaba, R
    [J]. Monitoring Internet Traffic and Services, 2005, : 101 - 114
  • [43] Peer-to-peer networks in action
    Gong, L
    [J]. IEEE INTERNET COMPUTING, 2002, 6 (01) : 37 - 39
  • [44] Simulating Peer-to-Peer Networks
    Dhurandher, Sanjay K.
    Misra, Sudip
    Obaidat, Mohammad S.
    Singh, Inderpreet
    Agarwal, Raghu
    Bhambhani, Bhuvnesh
    [J]. 2009 IEEE/ACS INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, VOLS 1 AND 2, 2009, : 336 - +
  • [45] JXTA & peer-to-peer networks
    Li, S
    [J]. DR DOBBS JOURNAL, 2003, 28 (06): : 30 - +
  • [46] Reputation in peer-to-peer networks
    Hu, THT
    Wongrujira, K
    Sereviratne, A
    [J]. 2004 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-7, 2004, : 1411 - 1415
  • [47] Adaptive neighborhood selection in peer-to-peer networks based on content similarity and reputation
    Pogkas, Ioannis
    Kriakov, Vassil
    Chen, Zhongqiang
    Delis, Alex
    [J]. PEER-TO-PEER NETWORKING AND APPLICATIONS, 2009, 2 (01) : 37 - 59
  • [48] A novel anonymous communication strategy based on structured peer-to-peer overlay networks
    Wu, Yanhui
    [J]. PROCEEDINGS OF THE 2007 1ST INTERNATIONAL SYMPOSIUM ON INFORMATION TECHNOLOGIES AND APPLICATIONS IN EDUCATION (ISITAE 2007), 2007, : 581 - 585
  • [49] Adaptive neighborhood selection in peer-to-peer networks based on content similarity and reputation
    Ioannis Pogkas
    Vassil Kriakov
    Zhongqiang Chen
    Alex Delis
    [J]. Peer-to-Peer Networking and Applications, 2009, 2 : 37 - 59
  • [50] Towards optimal neighbour selection mechanisms in peer-to-peer networks
    Yang, Zhenying
    [J]. JOURNAL OF OPTICS-INDIA, 2023, 53 (3): : 1984 - 1993