Load Balancing for Optimal Sharing of Network Bandwidth

International Journal of Computer Applications, 2012

DHT-based P2P systems have been proven to be a scalable and efficient means of sharing information. With the entrance of quality of services concerns into DHT systems, however, the ability to guarantee that the system will not be overwhelmed due to load imbalance becomes much more significant, especially when factors such as item popularity and skewing are taken into consideration. In this paper, we focus on the problem of load imbalance caused by skewed access distribution. We propose an effective load balancing solution, which takes the peer heterogeneity and access popularity into account to determine the load distribution. Our algorithm achieves load balancing by dynamically balancing the query routing load and query answering load respectively. Experimentations performed over a Pastry-like system illustrate that our balancing algorithms effectively balance the system load and significantly improves performance.

There are a huge number of nodes connected to web computing to offer various types of web services to provide cloud clients. Limited numbers of nodes connected to cloud computing have to execute more than a thousand or a million tasks at the same time. So it is not so simple to execute all tasks at the same particular time. Some nodes execute all tasks, so there is a need to balance all the tasks or loads at a time. Load balance minimizes the completion time and executes all the tasks in a particular way.There is no possibility to keep an equal number of servers in cloud computing to execute an equal number of tasks. Tasks that are to be performed in cloud computing would be more than the connected servers. Limited servers have to perform a great number of tasks.We propose a task scheduling algorithm where few nodes perform the jobs, where jobs are more than the nodes and balance all loads to the available nodes to make the best use of the quality of services with load balancing.

2013

1 Abstract— One of the critical scheduling problems in distributed computing environment is load balancing on a cluster of replicated servers which face a constant pressure of increased network traffic and diverse load levels. The key issue in server load balancing in a DCS is to select an effective load balancing scheme to distribute clients' requests to the servers. In this paper, we have investigated the problem of server load balancing and evaluated various server load balancing policies. We have also conducted simulation study to compare the performance of various policies. Keywords-server load balancing, admission control, stateful servers, weighted round robin, shortest queue, diffusive algorithm

2021

Inspired by applications on search engines and web servers, we consider a load balancing problem with a general convex objective function. In this problem, we are given a bipartite graph on a set of sources S and a set of workers W and the goal is to distribute the load from each source among its neighboring workers such that the total load of workers are as balanced as possible. We present a new distributed algorithm that works with any symmetric non-decreasing convex function for evaluating the balancedness of the workers’ load. Our algorithm computes a nearly optimal allocation of loads in O(logn log2 d/ 3) rounds where n is the number of nodes, d is the maximum degree, and is the desired precision. If the objective is to minimize the maximum load, we modify the algorithm to obtain a nearly optimal solution in O(logn log d/ 2) rounds. This improves a line of algorithms that require a polynomial number of rounds in n and d and appear to encounter a fundamental barrier that prevent...

Obtaining maximum throughput across a network or a mesh through optimal load balancing is known to be an NP-hard problem. Designing efficient load balancing algorithms for networks in the wireless domain becomes an especially challenging task due to the limited bandwidth available. In this paper we present heuristic algorithms for load balancing and maximum throughput scheduling in Wireless Mesh Networks with stationary nodes. The goals are to (a) improve the network throughput through admissibly optimal distribution of the network traffic across the wireless links, (b) ensure that the scheme is secure, and (c) ensure fairness to all nodes in the network for bandwidth allocation. The main consideration is the routing of non-local traffic between the nodes and the destination via multiple Internet gateways. Our schemes split an individual node's traffic to the Internet across multiple gateways that are accessible from it. Simulation results show that this approach results in marked increase in average network throughput in moderate to heavy traffic scenarios. We also prove that in our algorithm it is very difficult for an adversary to block a fraction of a node's available paths, making it extremely hard to compromise all traffic from a node. Simulation results also show that our scheme is admissibly fair in bandwidth allocation even to nodes with longest paths to the gateway nodes.

Cloud Computing as the name suggests, it is a style of computing where different users uses the resources on the go i.e. over the Internet. In the recent era, this technology has emerged as a strong option for not only large scale organizations but also for small scale organizations that only access/use the resources what they want. In recent research study, many organizations lose significant part of their revenues in handling the requests given by the clients over the web servers i.e. unable to balance the load for web servers which results in loss of data, delay in time and increased costs. This Paper gives a new enhanced load balancing algorithm by which the performance of their web application can be increased. This Algorithm works on the major drawbacks such as delay in time, response to request ratio etc.

IEEE Internet Computing, 2000

In the past few years, several DHT-based abstractions for peer-to-peer systems have been proposed. The main characteristic is to associate nodes (peers) with keys (objects) and to construct distributed routing structures to support an efficient location. These approaches address the load problem, and load balancing is achieved by moving the keys. However, the problem is still not properly covered. In this paper we present an analysis of structured peer-to-peer systems taking into consideration Zipf-like requests distribution. Based on our analysis, we propose a novel approach for load balancing relying on object popularity. Our approach is based on routing table reorganization in order to balance the lookup traffic load. We have implemented this approach in a Pastry-like system. The obtained results demonstrate a better balance of load, which can lead to improved scalability and performance.

International Journal of Information Technology and Computer Science, 2014

In distributed computing system some nodes are very fast and some are slow and during the computation many fast nodes become idle or under loaded while the slow nodes become over loaded due to the uneven distribution of load in the system. In distributed system, the most common important factor is the information collection about loads on different nodes. The success of load balancing algorithm depends on how quickly the information about the load in the system is collected by a node willing to transfer or accept load. In this paper we have shown that the number of communication overheads depends on the number of overloaded nodes present in the domain of an under loaded nodes and vice-versa. We have also shown that communication overhead for load balancing is always fairly less than KN but in worst case our algorithm's complexity becomes equal to KN.

International Journal Of Innovative Research In Technology, 2017

Cloud computing is a vigorous technology by which a user can get software, application, operating system and hardware as a service without actually possessing it and paying only according to the usage. Load balancing is a critical aspect that ensures that all the resources and entities are well balanced such that no resource or entity neither is under loaded nor overloaded. The load balancing algorithms can be static or dynamic. In this paper, an enhanced dynamic load balancer based on S warm algorithm as load balancer has been implemented which permits the user to input the number of hosts, VMs, job requests and also the type of application to perceive priority considerations for executing the jobs. The results obtained from the proposed load balancer portrays that it is adept to achieve better performance, resource utilization, response time and load balancing than the existing load balancing process.

The current best effort approach to quality of service (QoS) in the Internet can no longer satisfy a diverse variety of cus- tomer service requirements, and that i s why there is a need for alternative strategies. We believe that t he Internet needs means for providing a fine-grained per-flow QoS that does not cause network c ongestion and keeps overall l ink utiliza- tion high. In this paper we introduce an efficient, fast and scalable load distribution mechanism, which fairly distributes available resources among the flows based on their resource requirements. The load d istribution scheme (LDS) is imple- mented via a message exchange protocol which maintains high link utilization while incurring low overhead. We study the LDS a nd compare two fairness mechanisms introduced within the LDS framework using simulations in OPNET.

Load balancing algorithm can efficiently improve the performance of a distributed computing system than the system without load balancing algorithm. Dynamic load balancing algorithm is accountable for balancing load among the nodes depending upon the system state at any instant of moment. In centralized approach the information is collected by a specially designated central node and in distributed approach each node has the autonomy to collect the information about the load of the system. For a large global distributed system centralized approach of the load balancing algorithm is not efficient due to the contention problem. In distributed approach either a sender or a receiver may poll all the nodes in a network for load balancing causing huge overheads. Hierarchical load balancing approach imbibes the merits of both centralized and decentralized approaches by removing the disadvantages of centralized and decentralized approaches. In this paper we have proposed a hierarchical load balancing algorithm ELHLBA in which we considered the parents of leaf nodes as a front end nodes. We compared our algorithm with other existing algorithm ILHLBA and LHLBA. The simulation results show that our algorithm produces better result than the existing algorithms ELHLBA and LHLBA in respect of response time and throughput against system utilization.

Linked Open Data - Applications, Trends and Future Developments, 2020

Computational approaches contribute a significance role in various fields such as medical applications, astronomy, and weather science, to perform complex calculations in speedy manner. Today, personal computers are very powerful but underutilized. Most of the computer resources are idle; 75% of the time and server are often unproductive. This brings the sense of distributed computing, in which the idea is to use the geographically distributed resources to meet the demand of high-performance computing. The Internet facilitates users to access heterogeneous services and run applications over a distributed environment. Due to openness and heterogeneous nature of distributed computing, the developer must deal with several issues like load balancing, interoperability, fault occurrence, resource selection, and task scheduling. Load balancing is the mechanism to distribute the load among resources optimally. The objective of this chapter is to discuss need and issues of load balancing tha...

2006

We present a contribution on dynamic load balancing for distributed and parallel object-oriented applications. We specially target peer-to-peer systems and their capability to distribute parallel computation. Using an algorithm for active-object load balancing, we simulate the balance of a parallel application over a peer-to-peer infrastructure. We tune the algorithm parameters in order to obtain the best performance, concluding that our IFL algorithm behaves very well and scales to large peer-to-peer networks (around 8,000 nodes).

Cloud computing is a new technology which uses virtual machines instead of physical machines to host, store and network different components. Load balancing is a methodology to distribute workload across multiple computers, or other resources over the network links to achieve optimal resource utilization, minimum data processing time, minimum average response time, and avoid overload. The load balancing is to be done properly to gain maximum throughput and performance of cloud. Here we have considered two load balancing algorithms Equally spread current Execution algorithm and Throttled load balancing algorithm and made performance analysis of these algorithms using cloudanalyst. In Section I we gave brief introduction about load balancing in cloud computing. In section II we made a survey of Load balancing algorithms. We explained the two dynamic load balancing algorithms in section III. In section IV we introduced a simulation tool cloud Analyst and in next section V we analyzed the performance of algorithms.