Analysis & Minimization of the Effect of Delay on Load Balancing for Efficient Web Server Queueing Model

2014 ◽  
Vol 3 (4) ◽  
pp. 1-16 ◽  
Author(s):  
Harikesh Singh ◽  
Shishir Kumar
Keyword(s):  
Load Balancing ◽  
Waiting Time ◽  
Queue Length ◽  
Completion Time ◽  
Web Server ◽  
Task Completion ◽  
Web Servers ◽  
Task Completion Time ◽  
Average Waiting Time ◽  
The Web

Load balancing applications introduce delays due to load relocation among various web servers and depend upon the design of balancing algorithms and resources required to share in the large and wide applications. The performance of web servers depends upon the efficient sharing of the resources and it can be evaluated by the overall task completion time of the tasks based on the load balancing algorithm. Each load balancing algorithm introduces delay in the task allocation among the web servers, but still improved the performance of web servers dynamically. As a result, the queue-length of web server and average waiting time of tasks decreases with load balancing instants based on zero, deterministic, and random types of delay. In this paper, the effects of delay due to load balancing have been analyzed based on the factors: average queue-length and average waiting time of tasks. In the proposed Ratio Factor Based Delay Model (RFBDM), the above factors are minimized and improved the functioning of the web server system based on the average task completion time of each web server node. Based on the ratio of average task completion time, the average queue-length and average waiting time of the tasks allocated to the web server have been analyzed and simulated with Monte-Carlo simulation. The results of simulation have shown that the effects of delays in terms of average queue-length and average waiting time using proposed model have minimized in comparison to existing delay models of the web servers.

scholarly journals Web Server Performance Improvement Using Dynamic Load Balancing Techniques: A Review

2021 ◽  
pp. 47-62
Author(s):  
Ibrahim Mahmood Ibrahim ◽  
Siddeeq Y. Ameen ◽  
Hajar Maseeh Yasin ◽  
Naaman Omar ◽  
Shakir Fattah Kak ◽  
...  
Keyword(s):  
Load Balancing ◽  
Response Time ◽  
Performance Improvement ◽  
Web Server ◽  
Dynamic Load Balancing ◽  
The Internet ◽  
Web Servers ◽  
Web Server Performance ◽  
Server Clusters ◽  
The Web

Today, web services rapidly increased and are accessed by many users, leading to massive traffic on the Internet. Hence, the web server suffers from this problem, and it becomes challenging to manage the total traffic with growing users. It will be overloaded and show response time and bottleneck, so this massive traffic must be shared among several servers. Therefore, the load balancing technologies and server clusters are potent methods for dealing with server bottlenecks. Load balancing techniques distribute the load among servers in the cluster so that it balances all web servers. The motivation of this paper is to give an overview of the several load balancing techniques used to enhance the efficiency of web servers in terms of response time, throughput, and resource utilization. Different algorithms are addressed by researchers and get good results like the pending job, and IP hash algorithms achieve better performance.

A Prolific Scheme for Load Balancing Relying on Task Completion Time

2018 ◽  
Vol 8 (3) ◽  
pp. 1741
Author(s):  
V. Anand ◽  
K. Anuradha
Keyword(s):  
Load Balancing ◽  
Uniform Distribution ◽  
Resource Utilization ◽  
Completion Time ◽  
Computation Time ◽  
Task Completion ◽  
The Internet ◽  
Task Completion Time ◽  
Network Load ◽  
Computation Load

In networks with lot of computation, load balancing gains increasing significance. To offer various resources, services and applications, the ultimate aim is to facilitate the sharing of services and resources on the network over the Internet. A key issue to be focused and addressed in networks with large amount of computation is load balancing. Load is the number of tasks‘t’ performed by a computation system. The load can be categorized as network load and CPU load. For an efficient load balancing strategy, the process of assigning the load between the nodes should enhance the resource utilization and minimize the computation time. This can be accomplished by a uniform distribution of load of to all the nodes. A Load balancing method should guarantee that, each node in a network performs almost equal amount of work pertinent to their capacity and availability of resources. Relying on task subtraction, this work has presented a pioneering algorithm termed as E-TS (Efficient-Task Subtraction). This algorithm has selected appropriate nodes for each task. The proposed algorithm has improved the utilization of computing resources and has preserved the neutrality in assigning the load to the nodes in the network.

scholarly journals Task Scheduling Allocation based on Task Completion Time in Cloud Environment

2019 ◽  
Vol 8 (4) ◽  
pp. 5207-5213
Keyword(s):  
Resource Allocation ◽  
Cloud Computing ◽  
Load Balancing ◽  
Task Scheduling ◽  
Task Allocation ◽  
Completion Time ◽  
Resource Provisioning ◽  
Task Completion ◽  
Task Completion Time ◽  
Survey Paper

Cloud computing is a prominent computing model wherein shared resources can be given as per the customer request at a time. The available resources in the cloud are gathered to execute several tasks that are submitted by the customer. While implementing the tasks, there is a need to optimize performance in terms of execution time, response time and resource utilization of the cloud. The optimization of the mentioned factors in the Cloud Computing can be achieved by one of the major areas known as Load balancing which refers to dealing with client requests from diverse application servers that are functioning in the cloud. An efficient Load Balancing algorithm enables the cloud to be more proficient and enhances customer contentment. So, this survey paper highlights the latest studies regarding the application of Load Balancing techniques for task allocation such as resource allocation (RA) strategies, cloud task scheduling centered on Load Balancing, dynamic Resource Allocation schemes, and cloud resource provisioning scheduling heuristics. Finally, Load Balancing performance for task allocation methods is compared based on task completion time.

The Effects of Language Barriers and Time Constraints on Online Learning Performance: An Eye-Tracking Study

2021 ◽  
pp. 001872082110109
Author(s):  
Auður Anna Jónsdóttir ◽  
Ziho Kang ◽  
Tianchen Sun ◽  
Saptarshi Mandal ◽  
Ji-Eun Kim
Keyword(s):  
Online Learning ◽  
Eye Movement ◽  
Completion Time ◽  
Language Use ◽  
Time Pressure ◽  
Time Constraints ◽  
Task Completion ◽  
Esl Students ◽  
Task Completion Time ◽  
Eye Fixation

Objective The goal of this study is to model the effect of language use and time pressure on English as a first language (EFL) and English as a second language (ESL) students by measuring their eye movements in an on-screen, self-directed learning environment. Background Online learning is becoming integrated into learners’ daily lives due to the flexibility in scheduling and location that it offers. However, in many cases, the online learners often have no interaction with one another or their instructors, making it difficult to determine how the learners are reading the materials and whether they are learning effectively. Furthermore, online learning may pose challenges to those who face language barriers or are under time pressure. Method The effects of two factors, language use (EFL vs. ESL) and time constraints (high vs. low time pressure), were investigated during the presentation of online materials. The effects were analyzed based on eye movement measures (eye fixation rate—the total number of eye fixations divided by the task duration and gaze entropy) and behavioral measures (correct rate and task completion time). Results The results show that the ESL students had higher eye fixation rates and longer task completion times than the EFL students. Moreover, high time pressure resulted in high fixation rates, short task completion time, low correct rates, and high gaze entropy. Conclusion and Application The results suggest the possibility of using unobtrusive eye movement measures to develop ways to better assist those who struggle with learning in the online environment.

scholarly journals Bandwidth-Aware Rescheduling Mechanism in SDN-Based Data Center Networks

Electronics ◽  
2021 ◽  
Vol 10 (15) ◽  
pp. 1774
Author(s):  
Ming-Chin Chuang ◽  
Chia-Cheng Yen ◽  
Chia-Jui Hung
Keyword(s):  
Data Center ◽  
Completion Time ◽  
Network Performance ◽  
Data Locality ◽  
Task Completion ◽  
Data Center Networks ◽  
Task Completion Time ◽  
Data Packets ◽  
Network Bandwidth ◽  
Data Process

Recently, with the increase in network bandwidth, various cloud computing applications have become popular. A large number of network data packets will be generated in such a network. However, most existing network architectures cannot effectively handle big data, thereby necessitating an efficient mechanism to reduce task completion time when large amounts of data are processed in data center networks. Unfortunately, achieving the minimum task completion time in the Hadoop system is an NP-complete problem. Although many studies have proposed schemes for improving network performance, they have shortcomings that degrade their performance. For this reason, in this study, we propose a centralized solution, called the bandwidth-aware rescheduling (BARE) mechanism for software-defined network (SDN)-based data center networks. BARE improves network performance by employing a prefetching mechanism and a centralized network monitor to collect global information, sorting out the locality data process, splitting tasks, and executing a rescheduling mechanism with a scheduler to reduce task completion time. Finally, we used simulations to demonstrate our scheme’s effectiveness. Simulation results show that our scheme outperforms other existing schemes in terms of task completion time and the ratio of data locality.

scholarly journals The Impact of Notification Modality and Ambient Sound on Users’ Mobile Interaction

Symmetry ◽  
2021 ◽  
Vol 13 (3) ◽  
pp. 395
Author(s):  
Chien-Hsiung Chen ◽  
Miao Huang
Keyword(s):  
Completion Time ◽  
Sampling Method ◽  
Sound Level ◽  
Task Completion ◽  
Maze Task ◽  
Task Completion Time ◽  
Mobile Interaction ◽  
Ambient Sound ◽  
Convenience Sampling ◽  
The Impact

This study investigated the impacts of different notification modalities used in low and high ambient sound environments for mobile phone interaction. Three different notification modalities—Shaking Visual, Shaking Visual + Vibration, and Vibration—were designed and experimentally tested by asking users to conduct a maze task. A total of 72 participants were invited to take part in the experiment through the convenience sampling method. The generated results indicated that (1) the notification modality affects participants’ task completion time, (2) the error rate pertinent to the number of notifications is positively related to the participants’ task completion time, and (3) the ambient sound level and notification modalities impact the overall experience of the participants. The main contributions of this study are twofold. First, it verifies that the multi-dimensional feature of a Shaking Visual + Vibration synesthesia notification design is implementable. Second, this study demonstrated that the synesthesia notification could be feasible for mobile notification, and it was more perceptible by the users.

Sign in / Sign up

Export Citation Format

Share Document