Achieving dynamic load balancing through mobile agents in small world P2P networks

被引:10
作者
Shen, Xiang-Jun [1 ]
Liu, Lu [1 ,2 ]
Zha, Zheng-Jun [3 ]
Gu, Pei-Ying [1 ]
Jiang, Zhong-Qiu [1 ]
Chen, Ji-Ming [1 ]
Panneerselvam, John [2 ]
机构
[1] Jiangsu Univ, Sch Comp Sci & Commun Engn, Zhenjiang 212013, Jiangsu, Peoples R China
[2] Univ Derby, Sch Comp & Math, Derby DE22 1GB, England
[3] Chinese Acad Sci, Inst Intelligent Machines, Wuxi 212013, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Unstructured P2P; Load balancing; Mobile agents; Resource grouping; Small world; TO-PEER NETWORKS; EFFICIENT; PROXIMITY; AWARE;
D O I
10.1016/j.comnet.2014.05.003
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Peer-to-Peer (P2P) networks are a class of distributed networking and are being deployed in a wide range of applications. Besides such an importance, P2P networks still incur complexities in the resource location policies and in the load balancing techniques of the nodes, especially in unstructured P2P networks. One potential solution to resolve such issues is to enable the P2P networks to evolve into a self-optimizing overlay network topology by identifying the overloaded peers promptly. This paper introduces a new load balancing method in unstructured P2P networks based on mobile agents and resource grouping techniques. We firstly propose a resource grouping strategy to cluster the nodes which have same set of resources, thereby balancing the load among inter-group nodes. On the other hand, load balancing among intra-group nodes is achieved by using the mobile agents monitoring technique. By using this technique, the mobile agents migrate through the nodes in the same group, for the purpose of identifying the possible network congestion. Thus, queries can reach the desired resources more quickly while congested nodes can be identified promptly. The simulation results show that our proposed network evolves into a group-based small world network significantly. The evolved network exhibits robustness and adaptability under external attacking, high query workload, and higher network churns. The simulation results also illustrate that the proposed model achieves better search performance than the DANTE system. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:134 / 148
页数:15
相关论文
共 43 条
[1]   A survey of peer-to-peer content distribution technologies [J].
Androutsellis-Theotokis, S ;
Spinellis, D .
ACM COMPUTING SURVEYS, 2004, 36 (04) :335-371
[2]  
Aspnes J., 2004, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, P115
[3]  
Bhardwaj R., 2009, INT C INT AG MULT SY, P1
[4]  
Chen H, 2004, 2004 IEEE INTERNATIONAL SYMPOSIUM ON CLUSTER COMPUTING AND THE GRID - CCGRID 2004, P27
[5]   Availability and locality measurements of peer-to-peer file systems [J].
Chu, J ;
Labonte, K ;
Levine, BN .
SCALABILITY AND TRAFFIC CONTROL IN IP NETWORKS II, 2002, 4868 :310-321
[6]  
Dasgupta P., 2006, P IEEE WIC ACM INT C, P389
[7]   A peer to peer (P2P) architecture for dynamic workflow management [J].
Fakas, GJ ;
Karakostas, B .
INFORMATION AND SOFTWARE TECHNOLOGY, 2004, 46 (06) :423-431
[8]   Randomized load balancing strategies with churn resilience in peer-to-peer networks [J].
Fu, Song ;
Xu, Cheng-Zhong ;
Shen, Haiying .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2011, 34 (01) :252-261
[9]  
Ganesan P., 2004, P 30 INT C VER LARG, P444
[10]  
Gkantsidis C, 2004, IEEE INFOCOM SER, P120