A Load Balancing Mechanism Using Bloom Filter in Storm System

Article Preview

Abstract:

When membership queries are evaluated in a set, the performance can be improved by a Bloom filter which is a space-efficient probabilistic data structure. According to its space-efficient character, Bloom Filter presented to address the load balancing problem for streaming media information in Storm system which is free and open source distributed real time computation system. This method increases the server cluster availability by balancing the workloads among the servers within a cluster. Additionally, it improves real time system Storm efficiently in saving the data transmission time and reducing the calculation complexity.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1972-1976

Citation:

Online since:

March 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Krishna C M: Real-time systems (Tata McGraw-Hill Education, 1997).

Google Scholar

[2] Dean J, Ghemawat S, MapReduce: simplified data processing on large clusters, Communications of the ACM Vol. 51 (2008) No. 1, pp.107-113.

DOI: 10.1145/1327452.1327492

Google Scholar

[3] Shvachko K, Kuang H, Radia S, et al, The hadoop distributed file system, Mass Storage Systems and Technologies (MSST), 2010 IEEE 26th Symposium on, IEEE.

DOI: 10.1109/msst.2010.5496972

Google Scholar

[4] W. Liu, M. Wu, X. Ou, et al.: Design of an I/O balancing file system on web server clusters, in: Proceedings of the 2000 International Workshop on Parallel Processing, ICPP'00 (2000), pp.119-126.

DOI: 10.1109/icppw.2000.869095

Google Scholar

[5] H. Hsiao, H. Su and H. Shen: Load Rebalancing for Distributed File Systems in Clouds, IEEE Trans. on Parallel and Distributed Systems (2012).

DOI: 10.1109/tpds.2012.196

Google Scholar

[6] B. Dong, X. Q. Li, Q. M. Wu, et al.: A dynamic and adaptive load balancing strategy for parallel file system with large-scale I/O servers, Parallel Distribution Computing (2012), pp.1254-1268.

DOI: 10.1016/j.jpdc.2012.05.006

Google Scholar

[7] Bloom, Burton H: Space/time trade-offs in hash coding with allowable errors, Communications of the ACM (1970), pp.422-426.

DOI: 10.1145/362686.362692

Google Scholar

[8] Mohandas, Neethu, and Sabu M. Thampi: Improving Hadoop performance in handling small files, Advances in Computing and Communications, Springer Berlin Heidelberg (2011), pp.187-194.

DOI: 10.1007/978-3-642-22726-4_20

Google Scholar