Load Balancing in Very Large Data-Centers: The FISSION Approach

An algorithm for load balancing in multiprocessor systems

Load balancing algorithms are designed to achieve efficient resource utilisation in large-scale distributed systems. The primary goal of designing load balancing algorithms is to balance the overall workload among all the nodes in distributed systems to improve the performance. This paper presents an in-depth study and detailed comparative analysis of different load monitoring and balancing algorithms employing fuzzy logic and mobile agents. A detailed qualitative as well as quantitative analysis of algorithmic performances is included. The analytical survey presented in this paper would enable understanding of applications of different algorithms under different computing environments. Furthermore, this paper proposes a hybrid architecture combining fuzzy logic and mobile agents for load balancing and monitoring in distributed systems.

Nginx is a commonly used and free open-source web server that is used as a reverse proxy server, load balancer and HTTP cache. It consumes less memory and can handle more clients with less number of processes. Nginx provides users with five predefined load balancing algorithms. However, most of these algorithms are static and some of the load balancing rules are inefficient. In order to make the load of a cluster more stable under high concurrent requests, we developed a Dynamic Load Balancing (DLB) algorithm that uses Nginx as a network security control panel to provide load balancing for a cluster of backend servers. The DLB algorithm is based on the weighted round robin module of Nginx, Logistic Regression and Maximum Likelihood Estimation (MLE) algorithm. It handles the situation of high concurrent requests and reduces the probability of omitted or under-reported incident and status. We also propose a Hybrid Load Balance Method (HLBM) that incorporates the DLB algorithm and evolutionary computing to further improve the performance. We have conducted limited experiment by using dynamic load balancing algorithm. We will complete to develop the Hybrid Load Balance method and conduct experiments for HLBM.

The exponentially extensive and emerging expansion of the cloud computing network (CCN) and its prolific application result in an ample number of users/clients. The frugal superintend of the client’s requests for resources is troublesome due to a precise number of resources and to actualize the engrossment of Quality of Service (QOS). In aisle to achieve QOS, it is mandatory to maximize the efficiency and reliability of CNN resources. The zero-ground affair is to find an efficient load balancing (LB) algorithm (LBA) that obliged to parcel out data traffic amidst multitudinous resources. Here, in this paper, a multitudinous proposed scheme for QOS has been analyzed.

This article is about the ways of load balancing for server stations. The article contains most popular approaches and algorithms of load balancing in modern applications. The algorithm of round load balancing was described. This algorithm was chosen as the base for simulation model. This model was created by software tools MATLAB/SimulinkiSimEvents/Stateflow. The model takes into account the random nature of requests appearance and the variable time delay between the receiving of tasks. The process of model simulation provides numerical result of load balancing. It is possible to compare the modeling result with a real load balancing system. Finally, in this article the authors provided the idea of updating a round balancing algorithm for a simulation model as the way of future investigation.

Past approaches to routing in mesh networks either (i) do not account for the MAC-layer interactions between the links in a tractable manner, or (ii) are agnostic to load-balancing across gateways. Our answer to these problems is MaLB (MAC-aware and Load Balanced routing algorithm), a greedy, tractable, and distributed mesh routing algorithm. Since the underlying objective function has high combinatorial complexity, MaLB uses a greedy approach. MaLB finds an optimum routing forest (union of trees rooted at the gateways) by taking into account MAC-layer interaction between links, as well as optimum multi-hop association of mesh nodes to gateways. MaLB builds on top of ETP (Expected Through-Put), a recently proposed MAC-aware routing metric. We also propose a low complexity variant of MaLB called LB (Load Balanced routing algorithm) which performs load balancing in a MAC-agnostic manner. MaLB performs especially well in networks with skewed topologies that result from unplanned mesh network deployment, as well as in the presence of gateway failures. Simulations with an enhanced version of ns-2 show that MaLB results in up to 60% higher throughput than a shortest path algorithm with ETX (Expected Transmission Count). Furthermore, MaLB results in up to 30% improvement over the LB algorithm, as well as a shortest path algorithm with ETT (Expected Transmission Time).

Dear SCPE Reader, We present a selection of papers which are extensions of papers presented at the 7-th International Symposium on Parallel and Distributed Computing, 1–5 July 2008, in Krakow, Poland. The motivation for publishing the selection in the SCPE Journal was, on the one hand, to present the flavour of the research reported at the conference and on the other hand to present some of the most relevant topics currently focused on the research on parallel and distributed computing in general. The selection contains only 6 papers out of about 60 presented at the conference, and thus, is far from covering all relevant topics represented at the ISPDC 2008. This is because not all of the invited authors were patient enough to accept a fairly long paper publishing process. Nevertheless, we hope that the presented papers will bring you closer to the research covered by the ISPDC conferences and will encourage you to participate in future ISPDC editions. The first paper ``The Impact of Workload Variability on Load Balancing Algorithms'' is by Marta Beltran and Antonio Guzman from King Juan Carlos University in Spain. It concerns an important topic of load balancing in cluster systems, namely adaptativity of the load balancing algorithms to changes of the workload in the system. Adequate accounting for additional load in the hosting system is of great relevance for correct optimization effects. The paper presents a thorough formal analysis of the workload variability metrics and their influence on the quality of load balancing algorithms. Four basic activities appearing in load balancing algorithms are identified, and based on them some algorithmic solutions are proposed to correctly deal with workload variability in system load balancing. The problem of dynamic load balancing algorithms robustness has been discussed. Two different robustness metrics sensitive to the applied type of opimization: local task-oriented or a global one enable selecting task remote execution or migration as load balancing operations. The proposed approach is illustrated with experiments. The second paper ``Model-Driven Engineering and Formal Validation of High-Performance Embedded Systems'' is by Abdoulaye Gamatie, Eric Rutten, Huafeng Yu, Pierre Boulet, Jean-Luc Dekeyser, from University of Lille and INRIA in France. The paper is concerned with a very advanced methodology of designing correct parallel embedded systems for intensive data-parallel computing. In their previous research, the authors of the paper designed the GASPARD embedded system design framework. It is based on the hardware/software co-design approach through model-driven engineering. The framework is based on an UML-like model specification language in which hardware and software elements are modelled using a component approach with special mechanisms for repetitive structures. This paper tries to combine the modelling framework of GASPARD with the mechanisms of synchronous languages to achieve design verifiability provided for such languages. The paper shows how GASPARD models can be translated into synchronous models based on data flow equations in order to formally check their correctness. The proposed approach is illustrated with an example of a video processing system. The third paper ``Relations Between Several Parallel Computational Models'' is by Stephan Bruda and Yuanqiao Zhang from Bishop’s University in Canada. The paper is concerned with theoretical aspects of shared memory systems described by the parallel random access machine PRAM model and aims in studying performance properties of different types of PRAM systems. The attention is focussed on analysing the computational power of two more sophisticated PRAM models (Combining CRCW and Broadcast Selective Reduction), which include data reduction in case of concurrent writes. The paper shows that these two models have equivalent computational power, which is a new result comparing the existing literature. The performance of both models applied to reconfigurable multiple bus machines was studied as a possible architectural solution for current VLSI processor implementations. It was shown that in such systems under reasonable assumptions concurrent-write does not enhance performance comparing the exclusive-write model. Another result important for the VLSI technology is that the Combining CRCW PRAM model (in which data of concurrent writes are arthmetically or logically combined before write) and the exclusive-write on directed reconfigurable busses perform in equivalent way under strong real-time requirements. The fourth paper ``Experiences with Mesh-Like Computations Using Prediction Binary Trees'' is by Gennaro Cordasco, Biagio Cosenza, Rosario de Chiara, Ugo Erra and Vittorio Scarano from the University ``degli Studi'' of Salerno and the University ``degli Studi della Biasilicata'' of Potenza in Italy. The paper concerns optimization methods for mesh-like computations in clusters of processors. The computations are perfomed assuming a phase-like program execution control using a tiling approach which reduces inter-processor communication. A temporal coherence is also assumed, which means that task sizes provide similar execution times in consecutive phases. Temporary coherent computations are structured in a Prediction Binary Tree, in which leaves represent computing tiles to be mapped to processors. A phase-by-phase semi-static load balancing is introduced to the scheduling algorithm. The scheduling algorithm is equipped with a predictor, which estimates the computation time of next phase tiles based on previous execution times and modifies the tiles to achieve balanced execution in phases. For this, two heuristics are used to leverage on data locality in processors. The proposed approach is illustrated by the example of interactive rendering with Parallel Ray Tracing algorithm. The fifth paper ``The Influence of the IBM pSeries Servers Virtualization Mechanism on Dynamic Resource Allocation in AIX 5L'' is by Maciej Mlynski from ASpartner Limited in Poland. The paper concerns a very up-to-date problem of system virtualization and presents the results of research carried on IBM pSeries servers. IBM is strongly developing the virtualization technique especially on IBM pSeries servers enabling an improved and flexible sharing of system resources between applications. The paper investigates novel facilities for dynamic resource management such as micro-partitioning and partition load manager. They enable dynamic creation of workload logical partitions of system resources and their dynamic mangement. It includes run-time resource re-alocation between logical partitions including setting of sharing specifications as well as run-time adding/removing/setting parameters of resources in the system. It remains an open question how to properly tune parameters of the operating system using the provided virtualization facilities to obtain the best efficiency for a given application program. The paper presents the results of experiments which study the effects of tuning the disk subsystem parameters under the IBM AIX 5L operating system with the use of the provided virtualization facilities on the resulting application execution performance. The results show that even small deterioration in the resource pool status requires an immediate adaptation of the operating system parameters to maintain the required performance. The sixth paper ``HeteroPBLAS: A Set of Parallel Basic Linear Algebra Subprograms Optimized for Heterogeneous Computational Clusters'' is by Ravi Reddy, Alexey Lastovetsky and Pedro Alonso from University College Dublin in Ireland and Polytechnic University of Valencia in Spain. The paper concerns the methodology for parallelization of linear algebra computations for execution in heterogeneous cluster environments. The design of the HeteroPBLAS library (Parallel Basic Linear Algebra Subprograms) for heterogeneous computational clusters is presented. The main contribution of the paper is the automation of the parallelization and optimization of the PBLAS, which is done by means of a special user interface and the underlying set of functions. An important element is here a performance model that is based on program code instrumentation, which determines parameters of the application and the executive heterogeneous platform relevant for execution performance of parallel code. The parameter values specified for or returned by execution of the performance model functions are next used for generation and optimal mapping of the parallel code of the library subroutines. The proposed approach is illustrated by experimental results of execution of optimized HeteroPBLAS programs on homogeneous and heterogeneous computing clusters. Marek Tudruj

Packet switching remains one of the bottlenecks in building fast Internet routers. Load balancing and switch scheduling are two important algorithms in the effort to maximize the throughput and minimize the latency of these packet switches. A load balancing algorithm regulates the traffic to conform to the service rates while a switch scheduling algorithm allocates the service rates adaptive to the arrival patterns. Many existing load balancing and switch scheduling algorithms are very similar. We show that load balancing and switch scheduling systems are dual systems based on the linear queue dynamics approximation. This allows us to cast a load balancing problem as a scheduling problem, and vice versa. We further show an example of designing a new algorithm for load balancing using an existing scheduling algorithm based on the duality. The duality perspective also allows us to solve unknown problems. We find the entropy rate of the randomized bandwidth allocation system with linear queue dynamics based on the knowledge of the entropy rate of the randomized load balancing system. For the general case, we find both an upper and a lower bound on the entropy rate. The joint use of dual load balancing and switch scheduling algorithms leads to performance gains as we show using mean field analysis.

Increasing usability of internet is creating huge data which should be managed by the industries, but this should not affect the processing time which may create inconvenience to end user. As cloud is emerging as back bone of IT industry there are much enhancement needed in it Many companies are switching their data from small storage location to Cloud, The migration is done such that the companies do not have a burden to purchase the Infrastructure they merely have to rent out the Infrastructure but the migration should not cost on the speed of storage or retrieval of the data from the server. Load balancing is one of the major issue in cloud computing, but these problems are Tractable There are many algorithm for load balancing which has advantage over the other in this paper Ant colony algorithm is studied .

This article introduces a new load balancing algorithm, called diffusive load balancing, and compares its performance with three other load balancing algorithms: static, round robin, and shortest queue load balancing. The comparison of load balancing algorithms is made in three simulated client-server environments: a small-scale, intranet, and Internet environment. Experimental results of performance modeling show that diffusive load balancing is better than round robin and static load balancing in a dynamic environment, which manifest in frequent clients' object creation requests and in short objects' lifetimes. In this research, the diffusive load balancing algorithm is discussed in juxtaposition with the distributed client-server architectures.

Current and planned solutions used in the ICT infrastructure are largely based on Photonic and RF Communications Systems. Rapid advances in photonic and RF photonic technologies have significantly accelerated the introduction of these new technologies in access storage, backbone and grid networks, defining and building the rules to ensure transfer of multi Tera-bit volumes of data. The purpose of this volume is to provide a vehicle for directing research in this area from multiple lenses in the selected areas of investigation. Following an introduction by the editors, reviews of research will be clustered into two sections. The first part of this Special Issue focuses on the Photonic and RF Communications systems technologies and this Section comprises 7 articles. Recent solutions in wideband and multi-band RF circuits are presented in the articles 7 through 9 in the second part of the Special Issue. The first article, by Arash Bahrami , et al., present an experimental evaluation of a radio-over-fiber system. In the paper, the authors proposed an optical microwave radio-over-fiber system in which an integrated dual-parallel Mach-Zehnder modulator is biased at the maximum transmission biasing point. The authors consider the two following modulation schemes: binary phase shift keying (BSK) and quadrature phase shift keying (QPSK) over fiber spans of 10 and 25 km of standard single mode fiber. The obtained results show that the second order sideband of optical microwave has the potential to provide error-free transmission for BPSK and QPSK. John S. Vardakas , et al. in the next article, analyse the delay of converged Wavelength Division Multiplexing Ethernet Passive Optical Network and WiMax networks. In such access networks, the provision of Quality of Service (QoS) support is a challenging issue, mainly due to the different bandwidth allocation mechanisms of the two access technologies. In the paper, the authors analyse the delay performance by considering multiple service-classes with different priorities. The proposed analytical model allows the calculation of the average end-to-end packet delay of each service-class as the sum of the queuing delay in both domains. The accuracy of the analysis was verified by simulation. Ioannis Mamounakis , et al., propose a novel traffic prediction method to minimize packet delay in Ethernet Passive Optical Networks. The authors utilise traffic information to predict the accumulated burst size of each respective optical network unit in the following cycle. The paper demonstrates and proves that a significant delay enhancement can be accomplished by reporting the predicted burst size, rather than the current one, to the Optical Line Terminal (OLT). The simulation experiments carried out by the authors show that a significant decrease in the delay can be obtained without any changes to the dynamic bandwidth assignment scheme at the OLT. The paper by Mariusz Głąbowski , et al. proposes an analytical model of a multi-service switching network with overflow links with finite capacity in the first stage of the network. This model can be used to evaluate the QoS parameters which are closely interrelated with the method of operation of the large capacity optical nodes. The proposed method allows their traffic capacity to be increased through a significant decrease in the phenomenon of internal blocking in switching networks which is the basic element of the node. The proposed calculation method is validated by the authors via simulation. Aboagela Dogman , et al. present an integrated QoS management process for multimedia traffic in wire and wireless networks. In the proposed process, the statistics of traffic are determined and then used as an input to a fuzzy interface system (FIZ). FIZ allows the traffic to be accurately sampled and this traffic is in the next step pre-processed using a fuzzy c-means (FCM). FIZ identifies clusters representing poor, average and good QoS. This information is then used in a multilayer perceptron neural network to assess the overall QoS for multimedia traffic. The authors showed that the developed adaptive statistical sampling represents traffic more correctly than systematic, stratified and random non-adaptive sampling methods. The article by Adam Kaliszan , et al. provides a generalised convolution algorithm for modelling state-dependent systems. This model corresponds to the system that uses one or many physical resources, e.g. one or a set of lambda channels in DWDM optical networks. The proposed calculation method can be used for the analysis and dimensioning of optical networks and systems. This method is also useful for an optical system in which advanced traffic management mechanism have been applied, e.g. bandwidth reservation or threshold mechanism. The accuracy of the proposed model is validated by simulation experiments. From their onset RF Communications Systems have been critical to the development of ICT infrastructure. In mobile and satellite communication systems, wideband and multi-band RF circuits are important for achieving high-date wireless transmission and supporting a large number of standards (e.g. UMTS, WiFi, WiMAX, or LTE). A wideband or multi-band RF circuit can replace a number of single-band RF circuits, leading to a significant reduction of size, weight and cost of modern wireless systems. There have been a great number of recent developments in the above areas over the past years. The articles that outline these solutions are in the latter part of this Special Issue, i.e. comprise articles from Article 7 through Article 9. The article by Bingo Wing-Kuen Ling , et al. discusses the frequency spectrum of a pulse for ultra wideband impulse radio systems as the frequency response of a real valued causal rational infinite impulse response filter. The pulse design problem is formulated as a functional inequality constrained optimization problem that can be solved by the method proposed by the authors. This pulse can be generated via an excitation of a simple circuit. Numerical simulation results confirm that the energy compaction performance defined in the frequency domain of the proposed pulse outperforms that of existing pulses. It is worth emphasizing that the pulse can be generated via an excitation of a simple circuit. In their article, Xue Li and , et al. present the WiFi leakage problem that appears in the users' equipment that simultaneously use both LTE and WiFi technologies. The authors propose WiFi leakage detection algorithms for successful detection of the weak WiFi leakage in the presence of both LTE signal and Gaussian noise. The algorithms include energy ratio detection, entropy ratio detection and cyclostationary detection based on spectral correlation function. The effectiveness and efficiency of the proposed WiFi leakage detection techniques have been confirmed by simulations performed for different scenarios. The article by Piotr Remlein discusses the performance of Intelligent Transportation Systems (ITS) that consists of satellite mesh networks. In the paper the author analyses a new power-limited and energy-efficient systems employing coded continuous phase modulation signals and with multiuser Frequency Division Multiplexed transmission. The results obtained by the author show that good performance of the proposed solution can be achieved by reducing the inter-carrier frequency spacing and using simple iterative ICI cancellation algorithm at the receiver. Based on the results, it can be concluded that this system might constitute a desirable option in ITS satellite mesh, ad-hoc networks. The objective of this Special Issue is to bring together the state-of-the-art research contributions that address challenges in emerging devices and architecture for photonic systems and RF circuits for wideband and multi-band communications systems. Due to the complexity and scope of the subject area, the set of articles presented attempts to address only some selected relevant issues. The Guest Editors believe though that the contributions included in the Special Issue will inspire the research activities of leading authors and scholars worldwide. The Guest Editors also expect this Special Issue to provide insight into the questions that they address as the presented articles expose important contributions to each of the relevant subject areas. Piotr Zwierzykowski received MSc and PhD (Hons) degrees in telecommunications from Poznan University of Technology, Poland, in 1995 and 2002, respectively. Since 1995 he has been working at the Poznan University of Technology, where he is currently an Assistant Professor. Piotr Zwierzykowski is the author, or co-author, of over 200 journals and conference publications and three books in the area of computer and communication networks. His research covers modelling and dimensioning of optical networks, teletraffic engineering and routing. He is a Senior Member of IEEE and the Secretary in the IEICE Europe Section. Steven Gao received a PhD degree from Shanghai University, P.R. China. He is a Professor and Chair in RF and Microwave Engineering at University of Kent, UK. His research covers smart antennas, satellite antennas, phased arrays, RF and microwave circuits (power amplifiers), satellite communications, UWB radars, synthetic-aperture radars and mobile communications. From 2007 to 2012, he was a Senior Lecturer and Head of Space Antennas and Microwave System Group at Surrey Space Centre, University of Surrey, UK. He has two books including “Space Antenna Handbook” (Wiley, 2012) and “Circularly Polarized Antennas” (IEEE-Wiley, 2014), published over 200 papers and holds several patents in smart antennas and RF. He is an IEEE AP-S Distinguished Lecturer and a Chair of LAPC 2013. He is an Invited Speaker at IWAT'2014 (Sydney), SOMIRES'2013 (Japan), APCAP'2014 (China), etc. He is an Associate Editor of Radio Science and the Editor-in-Chief for Wiley Book Series on "Microwave and Wireless Technologies". He is a Fellow of the IET. Wai Pang Ng received his BEng (Hons) Communication and Electronic Engineering and IEE Prize from Northumbria University, UK and PhD in Electronic Engineering from University of Wales Swansea, UK in 1997 and 2001, respectively. He is a Reader of Optical Communications at Northumbria University. From 2001 to 2004, he was a Senior Networking Software Engineer at Intel Corporation, before starting his academic career at Northumbria University. He has published over 80 journals and conference publications in the area of optical switching, optical signal processing and radio-over-fiber. He is a Chartered Engineer of the Engineering Council UK and a Senior Member of the IEEE. Currently he serves as the Chair of the IEEE UK&RI Communication Chapter. He was also the Co-Chair of the Signal Processing for Communications Symposium in IEEE International Conference on Communications (ICC) 2009 (Dresden, Germany) and now serves as the Publicity Chair of ICC 2015 in London. Zuqing Zhu received a PhD degree from the Department of Electrical and Computer Engineering, University of California, Davis, in 2007. From July 2007 to January 2011, he worked in the Service Provider Technology Group of Cisco Systems, San Jose, as a senior R&D engineer. In January 2011, he joined the University of Science and Technology of China (USTC), where he is currently an Associate Professor. He has published more than 100 papers in peer-reviewed journals and conferences. He has been in the technical program committees (TPC) of INFOCOM, ICC, GLOBECOM, ICCCN and etc. He is also an editorial board member of Elsevier Journal of Optical Switching and Networking, Springer Telecommunication Systems Journal, Springer Photonic Network Communications Journal and Wiley European Transactions on Emerging Telecommunications Technologies amongst others. He has received the Best Paper Awards from the IEEE International Conference on Communications (ICC) 2013, the IEEE Global Communications Conference (GLOBECOM) 2013, and the IEEE International Conference on Networking and Communications (ICNC) 2014. He is a Senior Member of IEEE and OSA.

Cloud provides convenient and on demand network access for computing resources available over internet. There are many tasks required to be executed by the available resources to achieve the best performance, reduce response time and utilize resources. Load balancing algorithms that based only on load balancing, improve resource utilization. However these algorithms don't take resource speed and task length in their consideration. On the other hand, load balancing algorithms that based on completion time of tasks and speed of resources to reduce makespan don't take the resource load into their consideration. In this paper, Load Balance over Slow Resources (LBSR) algorithm is proposed. It assigns tasks to resources in a way that results in high load balancing over all resources including very slow ones. The performance of LBSR algorithm is evaluated against three well known load balancing algorithms: Min-Min, LBIMM, and Optimized TSA algorithms. The simulation results show that LBSR outperforms the other algorithms significantly in terms of makespan, resource utilization, and load deviation. The enhancement reaches more than 50% in some situations.

In the past few years, cloud computing has emerged as a vigorous technology in the era of internet. Its economic model fecilitate the client to use software, infrastructure, applications as a service by just paying according to the usage without possessing them. The development of cloud computing needs to balance the load among different replicated services offered by cloud environment. In terms of responsiveness and availability, load balancing is one major aspect to deal with. Load balancing ensures that the load is equally spread over the cloud servers. Efficient load balancing algorithm leads to decrease in maintenance costs and increase in resource availability. There are various factors that affect the efficiency of load balancing algorithm, two of such factors are addressed in the proposed algorithm. The download of large data files is handled by dual direction technique. This technique make use of replicated servers and download the partitions of a file simultaneously from multiple replica servers. Another factor that is taken into consideration is handling of high priority tasks. There are various parameters to define the effectiveness of a load balancing algorithm such as response time, data center processing time etc. In this present work a load balancing algorithm, based on honey bee optimization algorithm is proposed which has shown better response time. Experimental studies on standard data sets showed that the proposed request balanced honey bee algorithm compared to the original honey bee algorithm, has performed 5.2% to 9.7% better with respect to the response time and 13.8% to 68.2% better with respect to the processing time, which is a significant improvement.

Objectives: To enlighten the issues and challenges of Load Balancing Algorithm (LBA) for cloud computing environment. In this study the authors proposed a LBA for cloud computing server. Methods/Statistical Analysis: The numerous LBAs are compared with objective, merit, demerit and challenges of the LBA in terms of parameters such as performance, response time, scalability, overhead and many more. This study facilitates identification of efficient LBA for optimizes resource use, minimum response time, maximum throughput and avoidance of overload. Findings: The load balancer is permitted in most instances to provide support continuity as well as dealing with extra traffic. Consequently the useful load balancing algorithms required to find inexpensive resource usage by provisioning of resources to cloud users. The use of proposed algorithm is to improve the overhead and load imbalance factor of the system. Application: The Load Balancing (LB) is a vital feature of cloud computing environment. The economical LB algorithm assures cost effective resource usage by provisioning of resources to cloud users on demand schedule in pay-as-you-say-manner. The LB may actually provide assistance prioritizing users by using suitable scheduling requirements and also it is crucial part in cloud computing for maintaining the work load across various systems over the network and gives minimum processing time, minimum response time and ignores the workload.

We review the recent results on the design and implementation of the performance-optimized bidirectional optical backplane bus aimed at high speed multiprocessor systems. It employs an array of multiplexed holograms, in conjunction with a waveguiding plate within which cascaded fanouts are generated. Data transfer rate of 1.2 Gbit/sec at 1300 nm is demonstrated with a single bus line for a system composed of nine boards. Packaging-related issues and misalignment effects are addressed. Theoretical treatment to minimize fluctuations among the received powers at each board was carried out and the overall performance was optimized. We also introduce a hybrid optical backplane with multiple bus lines. The hybrid backplane maintains the same waveguiding structure, and exploits optoelectronic array devices. A new demonstration system is being implemented. The optical backplane that we developed is transparent to higher level bus protocols, thus can support standard backplane buses such as Futurebus+, Multibus II, and VMEbus.