Effort of Load Balancer to Achieve Green Cloud Computing : A Review

G.Siva Shanmugam,N.Ch.S. N. Iyengar 보안공학연구지원센터 2016 International Journal of Multimedia and Ubiquitous Vol.11 No.3

In a distributed system, from the starting days onwards distribution of load among servers becomes a serious problem in the commercial Internet. The problem in this scenario is? The entire single application oriented server has to engage the entire amount of traffic and if they went down, all commercial activities come down offline result out of business. Running individually the application server couldn’t support start-up budgets. The folks involved in the Web Commercial plan to solve this problem by distributing the load evenly to all the servers running on the web host owned by different agents or organizations; thus new scenario was born named as Load Balancing. In this treatise, we investigate several shapes attenuated by load Balancer and reviewed the algorithms proposed on load balancing. Here we took both static as well as dynamic based algorithms and their performances are formulated by comparison with all other existing scheme. This paper also brings connectivity on green computing with cloud load balancers. By cloud computing we can attain multi tenancy and dynamic resource handling which automatically reduces co2 emission from servers. Without the facility of sharing single resources among thousands of peoples, green computing is not possible. So the nature of cloud load balancer and green computing was illustrated here.

Analysis of Load Balancing Algorithms using Cloud Analyst

Simar Preet Singh,Anju Sharma,Rajesh Kumar 보안공학연구지원센터 2016 International Journal of Grid and Distributed Comp Vol.9 No.9

This paper discusses the Cloudanalyst tool. Cloudanalyst tool is used to determine the better load balancing algorithm from various scheduling and load balancing techniques e.g. round robin algorithm. This learning will help valued understanding to design infrastructure services of the Cloud. Different areas like coordination between one data center and other data center, algorithms of load balancing as well as other value-added services are also kept in mind, that are possible like service broker policies, which synchronize efficient

GA-based Adaptive Load Balancing Method in Distributed Systems

Lee, Seong-Hoon,Lee, Sang-Gu Korean Institute of Intelligent Systems 2002 INTERNATIONAL JOURNAL of FUZZY LOGIC and INTELLIGE Vol.2 No.1

In the sender-initiated load balancing algorithms, the sender continues to send an unnecessary request message fur load transfer until a receiver is found while the system load is heavy. Meanwhile, in the receiver-initiated load balancing algorithms, the receiver continues to send an unnecessary request message for load acquisition until a sender is found while the system load is light. These unnecessary request messages result in inefficient communications, low CPU utilization, and low system throughput in distributed systems. To solve these problems, in this paper, we propose a genetic algorithm based approach fur improved sender-initiated and receiver-initiated load balancing. The proposed algorithm is used for new adaptive load balancing approach. Compared with the conventional sender-initiated and receiver-initiated load balancing algorithms, the proposed algorithm decreases the response time and increases the acceptance rate.

Estimation-Based Load-Balancing with Admission Control for Cluster Web Servers

Saeed Sharifian,Seyed Ahmad Motamedi,Mohammad Kazem Akbari 한국전자통신연구원 2009 ETRI Journal Vol.31 No.2

The growth of the World Wide Web and web-based applications is creating demand for high performance web servers to offer better throughput and shorter user-perceived latency. This demand leads to widely used cluster-based web servers in the Internet infrastructure. Load balancing algorithms play an important role in boosting the performance of cluster web servers. Previous load balancing algorithms suffer a significant performance drop under dynamic and database-driven workloads. We propose an estimation-based load balancing algorithm with admission control for cluster-based web servers. Because it is difficult to accurately determine the load of web servers, we propose an approximate policy. The algorithm classifies requests based on their service times and tracks the number of outstanding requests from each class in each web server node to dynamically estimate each web server load state. The available capacity of each web server is then computed and used for the load balancing and admission control decisions. The implementation results confirm that the proposed scheme improves both the mean response time and the throughput of clusters compared to rival load balancing algorithms and prevents clusters being overloaded even when request rates are beyond the cluster capacity.

An Enhanced Cloud Network Load Balancing Approach Using Hierarchical Search Optimization Technique

보안공학연구지원센터(IJHIT) 보안공학연구지원센터 2015 International Journal of Hybrid Information Techno Vol.8 No.3

As one of the driving forces changing the way research and industry uses virtualization, distributed computing, internet, software and web services today, cloud computing stands tall. A cloud is an ecosystem of data centers, distributed servers, and clients all interconnected to each other. The unique selling point of a cloud is its reduced cost of ownership in comparison to traditional models. This primary advantage is complemented by fault tolerance, high availability opportunity, scalable and flexible structure, reduced infrastructure overheads for users, and services that can be accessed as and when required. One of the challenges that face cloud computing is load balancing. Load balancing assures optimum use of available resources, thereby, enabling consistency and performance of the overall system. An imbalance of load causes a single node or nodes to operate beyond its optimum levels. As a result, there could be either a gradual or a rapid loss in overall efficiency of the system leading to increase in emission rates and inefficient use of energy. In this paper, we have focused on resourceful load balancing coupled with a technique which reduces flooding. We have discussed how a combination of these is able to ensure efficient routing with reduced carbon emission.

Improved RFID Middleware Architecture and Optimal Algorithm based on Internet of Things

Weiqing Qu,Yuedou Qi,Qi Zhang,Chunliang Zhou 보안공학연구지원센터 2016 International Journal of Future Generation Communi Vol.9 No.11

Internet of things is a wireless data communications technology, while radio frequency identification (RFID) is an emerging technology in the automatic identification of the Internet of things. In fact, it means the use of RFID system identification technology through the Internet to achieve the application of information interconnection and sharing. In this paper, the author analyzes an improved RFID middleware architecture and optimal algorithm based on internet of things. Through the analysis of RFID middleware technology, we put forward an optimized load balancing algorithm. The results show that the optimization algorithm is superior to the existing algorithms in the average time of load balancing and label processing.

An Algorithm for the High-speed Train Multi-leg Load Planning Problem

Dong-jin Noh,Byung-In Kim,Hyunbo Cho,Jun-Seo Park 대한산업공학회 2015 대한산업공학회 추계학술대회논문집 Vol.2015 No.11

This paper considers a load planning problem for a high-speed train called CTX (Cargo Transit eXpress), whose speed is up to 300 km/h. In the problem, a CTX train visits a sequence of predetermined stations and loads and unloads small containers called unit load device (ULD) from the stations. A CTX train has a given number of cars and each of which has available given positions for ULDs. A set of ULDs that are transported by the train is given and each of which has weight and origin and destination stations. Since the train moves fast, the weight balance among the cars and within each car of the train is critical for safety. Furthermore, since the train traverses multiple stations, the weight balance should be kept among all the legs between stations. The problem is to assign ULDs to positions of cars with consideration of load balancing and multiple stations. Thus, this problem is a multi-leg load planning problem, which has not been studied much. Because the problem is NP-hard, a heuristic algorithm is proposed. The computational results show the effectiveness of the proposed algorithm.

Dynamic Clustering for Load-Balancing Routing In Wireless Mesh Network

Thai, Pham Ngoc,Hwang, Min-Tae,Hwang, Won-Joo Korea Multimedia Society 2007 멀티미디어학회논문지 Vol.10 No.12

In this paper, we study the problem of load balancing routing in clustered-based wireless mesh network in order to enhance the overall network throughput. We first address the problems of cluster allocation in wireless mesh network to achieve load-balancing state. Due to the complexity of the problem, we proposed a simplified algorithm using gradient load-balancing model. This method searches for a localized optimal solution of cluster allocation instead of solving the optimal solution for overall network. To support for load-balancing algorithm and reduce complexity of topology control, we also introduce limited broadcasting between two clusters. This mechanism maintain shortest path between two nodes in adjacent clusters while minimizing the topology broadcasting complexity. The simulation experiments demonstrate that our proposed model achieve performance improvement in terms of network throughput in comparison with other clustering methods.

Cloud Data Migration Method Based on ABC Algorithm

Geng Yushui,Yuan Jiaheng,Sun Tao 보안공학연구지원센터 2016 International Journal of Database Theory and Appli Vol.9 No.5

Cloud storage systems has played an important role in the support of large-scale and high-performance cloud application. For the purposes of the cloud storage system, data migration is the key technology to the elastic load balancing.In this paper, we take data migration issues into the load-balancing scenarios and propose the data migration method based on the ABC algorithm. At the same time, we validated the method.In the method,we compute the load of each storage node through the comprehensive evaluation system.The system contains the following four aspects, including the available CPU,available memory, data access heat and the system response time.The cloud storage system performs the data migration operation according to the data obtained from the comprehensive evaluation system.The results show that this method can satisfy the application needs.At the same time, this method can reflect the integrated load of each node, and it also can achieve the optimal performance of the cloud storage system.

Automatic decomposition of unstructured meshes employing genetic algorithms for parallel FEM computations

Rama Mohan Rao, A.,Appa Rao, T.V.S.R.,Dattaguru, B. Techno-Press 2002 Structural Engineering and Mechanics, An Int'l Jou Vol.14 No.6

Parallel execution of computational mechanics codes requires efficient mesh-partitioning techniques. These mesh-partitioning techniques divide the mesh into specified number of submeshes of approximately the same size and at the same time, minimise the interface nodes of the submeshes. This paper describes a new mesh partitioning technique, employing Genetic Algorithms. The proposed algorithm operates on the deduced graph (dual or nodal graph) of the given finite element mesh rather than directly on the mesh itself. The algorithm works by first constructing a coarse graph approximation using an automatic graph coarsening method. The coarse graph is partitioned and the results are interpolated onto the original graph to initialise an optimisation of the graph partition problem. In practice, hierarchy of (usually more than two) graphs are used to obtain the final graph partition. The proposed partitioning algorithm is applied to graphs derived from unstructured finite element meshes describing practical engineering problems and also several example graphs related to finite element meshes given in the literature. The test results indicate that the proposed GA based graph partitioning algorithm generates high quality partitions and are superior to spectral and multilevel graph partitioning algorithms.