期刊名称：International Journal of Grid and Distributed Computing
印刷版ISSN：2005-4262
出版年度：2015
卷号：8
期号：3
页码：167-178
DOI：10.14257/ijgdc.2015.8.3.17
出版社：SERSC
摘要：With rapidly growing influence and demand for cloud computing services, issues involving control, migration, security, availability of data, trust matters directly related to sensitive information stored can no longer be treated lightly. Through our work as explained in this paper, we discuss these topics, and also review several algorithms which are used in cloud computing. These algorithms are implemented in a cloud computing architecture to balance load to improve efficiency. Weighted active monitoring load balancing algorithm, dynamic load balancing algorithm, static algorithms, and ant colony algorithm are all used for load balancing in distributed computing systems. In this paper, we propose a load balancing technique based on Tree Parity Machine. Our approach is to design a Tree Parity Machine based model that would distribute workload evenly among all nodes. The technique proposed by us is not complicated. It has been conceived such that it can work efficiently with training sets that have been proven to produce intended results. Our Tree Parity Machine based model would predict the demand and, accordingly, allocate necessary resources. Thus, it would be able to maintain active servers to meet existing demands. As a result, consumption of energy can be significantly lowered. The conservative approach of over-provisioning is, thus, avoided.
