Load-balancing schemes for a hierarchical peer-to-peer file search system
by Qi Cao, Satoshi Fujita
International Journal of Grid and Utility Computing (IJGUC), Vol. 2, No. 2, 2011

Abstract: In 2009, Qin et al. proposed a three-tier peer-to-peer (P2P) architecture for real-time file search in distributed networks. In this architecture, indices of files held by the user peers in the bottom layer are stored in the super-peers (SPs) in the middle layer, and the correlation of those two bottom layers is controlled by the central server(s) in the top layer using the notion of tags. In Qin et al.'s system, a heavily loaded SP can move excessive load to a lightly loaded SP by using the notion of task migration. However, such a task-migration approach is not sufficient to balance the load of SPs if the size of tasks is highly imbalanced. To overcome such an issue, in this paper, we propose two load-balancing schemes for this architecture, aiming to ensure an even load distribution over the SPs. The first scheme controls the load of each task in order to decrease the total cost of task migration. The second scheme directly balances the load over tasks by reordering the priority of tags used in the query-forwarding step. The effectiveness of the proposed schemes is evaluated by simulation. The result of the simulations indicates that all the schemes can work in coordination in alleviating the bottleneck situation of SPs.

Online publication date: Sat, 28-Mar-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com