T-LB: A Topology-Based Load-Balancing Algorithm for Structured P2P Networks

Article Preview

Abstract:

In interest-based structured P2P networks, the load unbalance problem restricts the performance of the network. To solve this problem, A Topology-based Load-Balancing Algorithm called T-LB is presented. It adopts the concept of virtual server, defines balancing domain as nodes with same interest, determine the Q value of each node according to the characteristics of the network topology, and then dynamically distribute network load based on the Q value of nodes. Simulation results show that T-LB improves the proportion of non-overloaded nodes to from 65% to 86%, reduces the average information query delay, and improves the performance of the network.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 926-930)

Pages:

2198-2203

Citation:

Online since:

May 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Dalvi, Mrs Yogita A., R. Shankar, and Mr Atesh Kumar: American Journal of Computer Science & Engineering Survey, Vol. 1 (2013) No. 1, pp.7-13.

Google Scholar

[2] MI Wei, et al: Journal of Beijing University of Posts and Telecommunications, Vol. 33 (2010) No. 6, pp.116-120. (In Chinese).

Google Scholar

[3] Stoica, Ion, et al: Chord: A scalable peer-to-peer lookup service for internet applications, ACM SIGCOMM Computer Communication Review, Vol. 31 (2001) No. 4, pp.149-160.

DOI: 10.1145/964723.383071

Google Scholar

[4] Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler: Distributed Computing (Springer Berlin Heidelberg, 2013), pp.537-549.

Google Scholar

[5] WEI Xiang-lin, et al: Journal of Beijing University of Posts and Telecommunications. Vol. 35 (2012) No. 3, pp.87-90. (In Chinese).

Google Scholar

[6] Chawachat, Jakarin, and Jittat Fakcharoenphol: arXiv preprint arXiv: 1210. 7954, (2012).

Google Scholar

[7] Pavani, Palakollu, and Mrs Syed Shaheen: International Journal of Advanced and Innovative Research, Vol. 2 (2013) No. 9, pp.432-438.

Google Scholar

[8] Fan, Bin, et al: Small cache, big effect: Provable load balancing for randomly partitioned cluster services. Proceedings of the 2nd ACM Symposium on Cloud Computing (2011), pp.1-12.

DOI: 10.1145/2038916.2038939

Google Scholar

[9] Daryapurkar, Akshay, and Mrs VM Deshmukh: International Journal Of Computer Science And Applications, Vol. 6 (2013) No. 2, pp.308-312.

Google Scholar

[10] Peng Li-min, et al: Journal of South China University of Technology(Natural Science), Vol. 39 (2011) No. 10, pp.55-60. (In Chinese).

Google Scholar