Show simple item record

dc.contributor.authorShen, Xiang-Jun
dc.contributor.authorLiu, Lu
dc.contributor.authorZha, Zheng-Jun
dc.contributor.authorGu, Pei-Ying
dc.contributor.authorJiang, Zhong-Qiu
dc.contributor.authorChen, Ji-Ming
dc.contributor.authorPanneerselvam, John
dc.date.accessioned2016-11-15T11:50:57Z
dc.date.available2016-11-15T11:50:57Z
dc.date.issued2014-05-15
dc.identifier.citationShen, X. et al (2014) 'Achieving dynamic load balancing through mobile agents in small world P2P networks' Computer Networks, 75:134en
dc.identifier.issn13891286
dc.identifier.doi10.1016/j.comnet.2014.05.003
dc.identifier.urihttp://hdl.handle.net/10545/620851
dc.description.abstractPeer-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.
dc.language.isoenen
dc.publisherElsevieren
dc.relation.urlhttp://linkinghub.elsevier.com/retrieve/pii/S138912861400187Xen
dc.rightsArchived with thanks to Computer Networksen
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/en
dc.subjectUnstructured P2Pen
dc.subjectLoad balancingen
dc.subjectMobile agentsen
dc.subjectSmall worlden
dc.titleAchieving dynamic load balancing through mobile agents in small world P2P networksen
dc.typeArticleen
dc.contributor.departmentUniversity of Derbyen
dc.identifier.journalComputer Networksen
html.description.abstractPeer-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.


Files in this item

Thumbnail
Name:
Publisher version

This item appears in the following Collection(s)

Show simple item record

Archived with thanks to Computer Networks
Except where otherwise noted, this item's license is described as Archived with thanks to Computer Networks