Priority-based Load Balancing Research Articles

PLB: a resilient and adaptive task scheduling scheme based on multi-queues for cloud environment

This research paper proposes a novel approach named priority-based load balancing (PLB) for cloud computing environment. The PLB provides a resilient and adaptive task scheduling using multi-queues. Numerous strategies have already been proposed in the past researches to prioritize the tasks and mapping all the tasks to different resources available on the cloud. There is still a hindrance in the performance due to the negligible attention paid to the unused resources and tasks having low priority, eventually leading to starvation problem. To this end, the PLB algorithm has been partitioned into four sub-procedures, namely (i) Starvation-free task allocation, (ii) Inserting tasks into the dispatcher, (iii) Re-ordering tasks inside the queues and eventually, (iv) Mapping tasks onto the Virtual Machines (VMs) calculating the cost incurred for all the corresponding VMs. The sole motivation of this research work is to optimize the performance parameters by allocating all the jobs to all the available resources in the workflow model. It also consolidates the job categorization in the priority-based multi-queues, while filtering tasks from all the queues to overcome the deprivation of low priority tasks. In this paper, a test-bed setup has been deployed using CloudSim 3 and TCS WAN emulator for experimentation and results evaluation. The experimental setup imbibes different aspects such as performance measures, average response time, makespan time in order to ascertain efficiency, resource utilization ratio and bandwidth of the workflow model. The obtained results are further compared with five different approaches including- First Come First Serve, Round Robin, Min–Min, Max–Min and ACO and it was observed that the proposed strategy yielded more efficiency and accuracy in most of the cases. The experimental results have been further validated and demonstrated in order to justify the claims of the proposed approach, being able to tackle out different priority tasks and resource allocation in a stable and optimum manner.

QoS Priority-Based Mobile Personal Cell Deployment with Load Balancing for Interference Reduction between Users on Coexisting Public Safety and Railway LTE Networks

The Republic of Korea has played a leading role in the development of next-generation long-term evolution (LTE) public safety networks. The LTE-based public safety (PS-LTE) network, the LTE-based high-speed railway (LTE-R) network, and the LTE-based maritime (LTE-M) network use the same 700 MHz frequency band. That results in severe co-channel interference (CCI), so there is a dire need for practical research into resolving the CCI issue. Moreover, unplanned deployment of the mobile personal cell (mPC) generates serious user-association issues owing to its movement, which leads to severe co-channel interference in coexisting PS-LTE and LTE-R networks. Indeed, it is important to satisfy users’ quality of service (QoS) requirements during resource allocation in specific public safety situations. Therefore, we address the CCI issues through wise deployment of the mPC for user association and load balancing in overlapping PS-LTE and LTE-R networks. In this paper, we propose a QoS mPC deployment (QoS_mPCD) scheme for priority-based load balancing and interference reduction in coexisting PS-LTE and LTE-R networks. The proposed scheme efficiently manages the user-association and load-balancing problems, and allocates the best resources to high-priority users based on defined service priority levels. Moreover, we employ an enhanced inter-cell interference coordination (eICIC) scheme that further reduces the interference with the users offloaded onto an mPC. System-level simulations are performed to evaluate the proposed QoS_mPCD scheme by considering important performance matrices such as user equipment (UE) throughput, UE received interference, and UE outage probabilities.

Research and analysis for adaptive IFIR Filters for voice quality enhancement in wireless VoIP

Voice over Internet Protocol (VoIP) has emerged as one of the most significant technology in the field of communication and evolved as a substitute to the conventional communication method as the Public Switched Telephone Network (PSTN). In the traditional PSTN systems, due to dedicated communication line the voice quality is considerably good. In the same, network bandwidth is fully utilized but at the same the time it was not available for other users or services. The PSTN architecture is not flexible to converge data, video and voice traffic altogether. The research work carried out by the various researchers discussed in the literature review in section 2 focused on to improve the VoIP speech codecs and use of the optimization techniques to reduce the processing time for the same. The priority based load balancing algorithms such as scheduling algorithms were also used to minimize the delay content to achieve quality of service. The papers presents an analysis of the adaptive filtering algorithms were used to reduce the effect of the echo on the quality of speech signal in the VoIP system.

Impact of the Connection Admission Process on the Direct Retry Load Balancing Algorithm in Cellular Networks

We present an analytical framework for modeling a priority-based load balancing scheme in cellular networks based on a new algorithm called direct retry with truncated offloading channel resource pool (DR <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</sub> ). The model, developed for a baseline case of two cell network, differs in many respects from previous works on load balancing. Foremost, it incorporates the call admission process, through random access. In specific, the proposed model implements the Physical Random Access Channel used in 3GPP network standards. Furthermore, the proposed model allows the differentiation of users based on their priorities. The quantitative results illustrate that, for example, cellular network operators can control the manner in which traffic is offloaded between neighboring cells by simply adjusting the length of the random access phase. Our analysis also allows for the quantitative determination of the blocking probability individual users will experience given a specific length of random access phase. Furthermore, we observe that the improvement in blocking probability per shared channel for load balanced users using (DR <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">K</sub> ) is maximized at an intermediate number of shared channels, as opposed to the maximum number of these shared resources. This occurs because a balance is achieved between the number of users requesting connections and those that are already admitted to the network. We also present an extension of our analytical model to a multicell network (by means of an approximation) and an application of the proposed load balancing scheme in the context of opportunistic spectrum access.

Priority Based Load Balancing in Cloud for Data Intensive Applications

Priority Based Load Balancing in Cloud for Data Intensive Applications

Load-balanced differentiated services support switch

How to provide quality of service (QoS) guarantees in the routing and switching devices has become one of the key research topics in the areas of routing and switching technologies. Differentiated services architecture (DiffServ), which forwards packets based on their per-hop behaviours, is known as a promising way for supporting QoS in a high-speed backbone network scenario. Motivated by the load-balanced Birkhoff-von Neumann switch, which has received much attention recently because of its outstanding extensibility performance, in this study, the authors propose a new switch architecture called load-balanced DiffServ support switch (LBDS). LBDS consists of pipeline traffic bandwidth control, priority-based load balancing, and bandwidth-based priority scheduling to implement fast forwarding for expedited forwarding (EF) traffic and assured forwarding for AF classes of traffic. The authors evaluate LBDS by extensive theoretical analysis and comprehensive simulations. As expected, LBDS can provide bandwidth guarantees for both EF and AF traffic. We also show that under burst traffic arrivals, especially when the traffic arrival pattern is non-uniform and the load is above 0.6, LBDS performs much better delay performance than existing DiffServ support schemes.