Network management is very painful and tedious process in large networks having hundreds of switches and routers. Software Defined Networking (SDN) is a new way for creating, designing and managing networks which aims...
详细信息
ISBN:
(数字)9788132227526
ISBN:
(纸本)9788132227526;9788132227502
Network management is very painful and tedious process in large networks having hundreds of switches and routers. Software Defined Networking (SDN) is a new way for creating, designing and managing networks which aims to change this current undesirable situation. The main idea of SDN consists in logically centralizing network control in a SDN controller, which controls and monitors the behavior of the network. In this paper we developed an SDN application that performs server loadbalancing. The Main problem with traditional load balancer is that they use dedicated hardware. That hardware is very expensive and inflexible. Network Administrators cannot write their own algorithms since traditional load balancers are vendor locked. Therefore to solve these problems, we created SDN application which turned simple OpenFlow device into powerful load balancer. There are already certain existing load balancing algorithms in SDN but main problem with all these algorithms is that every request and return message has to pass through the load balancer. It introduces unnecessary latency. To solve these problems we implemented direct routing based load balancing algorithms. In Direct Routing, the load balancer is not involved in the return message from the web server to the client. It means server responds directly to client bypassing the load balancer thus improving performance.
Web services are playing a very important role in various business-based applications. There are an enormous amount of web services present and they are creating a huge web traffic. The organizations are trying to red...
详细信息
ISBN:
(纸本)9788132225263;9788132225256
Web services are playing a very important role in various business-based applications. There are an enormous amount of web services present and they are creating a huge web traffic. The organizations are trying to reduce the web traffic by having cluster-based web servers. It is a vital task to handle these cluster-based web servers while they have a varying load on it. These servers should be highly scalable and available. loadbalancing is an important technique to provide rapid response to the requests of the client. As the process of loadbalancing occurs fault tolerance should be taken care of. This paper focuses on the scalable, fault-tolerant, and loadbalancing mechanism of cluster-based web servers. The distributed spanning tree structure is used for balancing the client requests among the cluster-based servers. An architecture based on DST is proposed in this paper for cluster-based web servers.
Cloud Computing is a new technology. Cloud Computing provides many facilities like on demand self-services, unlimited resources, rapid elasticity and measured services to end users. All users access these resources di...
详细信息
ISBN:
(纸本)9781479979837
Cloud Computing is a new technology. Cloud Computing provides many facilities like on demand self-services, unlimited resources, rapid elasticity and measured services to end users. All users access these resources directly through internet. Users can use these resources and services as they want on pay per use concept. In cloud computing architecture loadbalancing is a very important issue. There are many algorithms for loadbalancing in cloud computing. All algorithms work different ways. We proposed a Improved Max-Min Ant colony Algorithm. Improved Max-Min used the concept of original Max-Min. Improved Max-Min is based on the execution time not on completion time as a selection basis. The main motive of our work is to balance the total load of cloud system. We try to minimizing the total makespan. We simulated results using the CloudSim toolkit. Results show the comparison between improved max min and new hybrid improved Max-Min ant approach. It mainly focuses on total processing time and processing cost.
Cloud Computing is a new technology. Cloud Computing provides many facilities like on demand self-services, unlimited resources, rapid elasticity and measured services to end users. All users access these resources di...
详细信息
ISBN:
(纸本)9781479979851
Cloud Computing is a new technology. Cloud Computing provides many facilities like on demand self-services, unlimited resources, rapid elasticity and measured services to end users. All users access these resources directly through internet. Users can use these resources and services as they want on pay per use concept. In cloud computing architecture loadbalancing is a very important issue. There are many algorithms for loadbalancing in cloud computing. All algorithms work different ways. We proposed a Improved Max-Min Ant colony Algorithm. Improved Max-Min used the concept of original Max-Min. Improved Max-Min is based on the execution time not on completion time as a selection basis. The main motive of our work is to balance the total load of cloud system .We try to minimizing the total makespan. We simulated results using the CloudSim toolkit Results show the comparison between improved max min and new hybrid improved Max-Min ant approach. It mainly focuses on total processing time and processing cost.
This paper presents an adaptive loadbalancing algorithm (ALBL) for cluster-based web systems. The balancing policy is based on two criteria: HTTP process time and network delay. The former describes web server abilit...
详细信息
This paper presents an adaptive loadbalancing algorithm (ALBL) for cluster-based web systems. The balancing policy is based on two criteria: HTTP process time and network delay. The former describes web server ability to process a forthcoming request, while the latter tries to estimate network conditions. Periodic criteria calculations are performed by agents at the web switch and the weight estimation process is transparent to web servers enhancing therefore distributed system's scalability. We put to test our implementation against known blind selection balancingalgorithms used at web-farms such as: Round Robin, stateful ones such as Least Connections and adaptive ones such as Least load. We also put to test performance and scalability of previous algorithms. From our testbed scenario results we show that ALBL algorithm outperforms stateless and stateful algorithms and also presents significant performance gains towards adaptive algorithms. We also show that our algorithm scales well as the number of balancing servers and web cluster's requests rate increases. We also pinpoint ALBL algorithm ability to predict network conditions and web servers load without the use of feedback information obtained by web servers but frequent service and network probes towards web servers issued by the web switch.
Cloud computing is a model for enabling ubiquitous, convenient, on-demand network access to a shared pool of configurable computing resources that can be rapidly provisioned and released with minimal management effort...
详细信息
ISBN:
(纸本)9781479976836
Cloud computing is a model for enabling ubiquitous, convenient, on-demand network access to a shared pool of configurable computing resources that can be rapidly provisioned and released with minimal management effort or service provider interaction. In cloud computing, loadbalancing is one of the key issues. loadbalancing is the process of apportioning the load among various nodes of a distributed system to improve both resource utilization and job response time while avoiding a situation where some of the nodes are heavily loaded while others are idle. This paper outlines an experimentation based comparative analysis of the load balancing algorithms for different scenario use cases
The main results of this paper are based on the idea that most load balancing algorithms can be described in the framework of optimization theory. It enables to involve classical results linked with convergence, its s...
详细信息
The main results of this paper are based on the idea that most load balancing algorithms can be described in the framework of optimization theory. It enables to involve classical results linked with convergence, its speed and other elements. We emphasize that these classical results have been found independently and till now this connection has not been shown clearly. In this paper, we analyze the loadbalancing algorithm based on the steepest descent algorithm. The analysis shows that the speed of convergence is determined by eigenvalues of the Laplacian for the graph of a given loadbalancing system. This consideration also leads to the problems of choosing an optimal structure for a loadbalancing system. We prove that these optimal graphs have special Laplacians: the multiplicities of their minimal and maximal positive eigenvalues must be greater than one. Such a property is essential for strongly regular graphs, investigated in algebraic graph theory. (c) 2007 Elsevier Inc. All rights reserved.
The purpose of content-based information retrieval (CBIR) systems is to retrieve, from real data stored in a database, information that is relevant to a query. When large volumes of data are considered, as it is very ...
详细信息
The purpose of content-based information retrieval (CBIR) systems is to retrieve, from real data stored in a database, information that is relevant to a query. When large volumes of data are considered, as it is very often the case with databases dealing with multimedia data, it may become necessary to look for parallel solutions in order to store and gain access to the available items in an efficient way. Among the range of parallel options available nowadays, clusters stand out as flexible and cost effective solutions, although the fact that they are composed of a number of independent machines makes it easy for them to become heterogeneous. This paper describes a heterogeneous cluster-oriented CBIR implementation. First, the cluster solution is analyzed without loadbalancing, and then, a new loadbalancing algorithm for this version of the CBIR system is presented. The loadbalancing algorithm described here is dynamic, distributed, global and highly scalable. Nodes are monitored through a load index which allows the estimation of their total amount of workload, as well as the global system state. loadbalancing operations between pairs of nodes take place whenever a node finishes its job, resulting in a receptor-triggered scheme which minimizes the system's communication overhead. Globally, the CBIR cluster implementation together with the loadbalancing algorithm can cope effectively with varying degrees of heterogeneity within the cluster;the experiments presented within the paper show the validity of the overall strategy. Together, the CBIR implementation and the loadbalancing algorithm described in this paper span a new path for performant, cost effective CBIR systems which has not been explored before in the technical literature. (C) 2006 Elsevier Inc. All rights reserved.
An architecture and its four load balancing algorithms for a highly OR-parallel inference machine are proposed, and its performance is evaluated in a trace-driven simulation study. This inference machine consists of a...
详细信息
An architecture and its four load balancing algorithms for a highly OR-parallel inference machine are proposed, and its performance is evaluated in a trace-driven simulation study. This inference machine consists of a large number of processing elements (PE's) with serial I/O links directly connected to each other in a simply modified mesh network. Each PE is a high-speed sequential Prolog processor with its own local memory. The activity of all PE's is locally controlled by four new load balancing algorithms based on purely local communication. Communication is allowed only between directly connected PE's. These load balancing algorithms reduce communication overhead in a loadbalancing and make it possible to accomplish highly OR-parallel execution. A software simulator using a trace-driven simulation technique based on an inference tree has been developed, and some typical OR-parallel benchmarks such as the n-queens problem have been simulated on it. The average communication per loadbalancing is reduced by a factor ranging from 1/30 to 1/100 by the interaction of these load balancing algorithms as compared with a conventional copying method. The inference machine (1024 PE's: 32 x 32 array) attains 300-600 times parallel speedup, assuming 1 MLIPS (mega logical inference per second) PE and a 20 MBPS (mega bit per second) each serial I/O link, which could be easily integrated on a single chip using current VLSI technology. This highly OR-parallel inference machine promises to be an important step towards the realization of a high-performance artificial intelligence system.
loadbalancing requirements in parallel image analysis are considered and results on the performance of parallel implementations of two image feature extraction tasks on the Connection Machine and the iPSC/2 hypercube...
详细信息
loadbalancing requirements in parallel image analysis are considered and results on the performance of parallel implementations of two image feature extraction tasks on the Connection Machine and the iPSC/2 hypercube are reported and discussed. A load redistribution algorithm, which makes use of parallel prefix operations and one-to-one permutations among the processors, is described and has been used in this work. The expected improvement in performance resulting from loadbalancing has been determined analytically and is compared to actual performance results obtained from the above implementations. The analytical results demonstrate the specific dependence of the expected improvement in performance on the computational and communication requirements of each task, characteristic machine parameters, a characterization of prior load distribution in terms of parameters which can be computed dynamically at the start of task execution, and the overhead incurred by load redistribution. Based on these results one may also define a set of rules for determining in advance the potential gains in performance to be obtained from application of this particular loadbalancing algorithm.
暂无评论