2020
DOI: 10.4018/ijec.2020070103
|View full text |Cite
|
Sign up to set email alerts
|

An QPSL Queuing Model for Load Balancing in Cloud Computing

Abstract: Load balancing is the process of distributing a workload among various servers. Queuing is the most common scenario for day-to-day applications. Queuing theory is used to study the problem of waiting lines. Queuing theory bridges the gap between service demands and the delay in replies given to users. The proposed QPSL Queuing Model makes use of M/M/k queue with FIFO queue discipline for load balancing in cloud computing. The model makes use of exponential distribution for calculating service rates and Poisson… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(3 citation statements)
references
References 13 publications
0
3
0
Order By: Relevance
“…Civelek [28] studied the impact of bivariate and temporal dependencies among interarrival and service times on the performance of single-server queues. Siddiqui [29] proposed an QPSL queue model for load balancing in cloud computing. In the construction field, a related study was conducted to apply the concept of customer-server queuing with regard to construction equipment for concrete placement and excavation [30].…”
Section: Research Methods For Quantifying Uncertaintymentioning
confidence: 99%
“…Civelek [28] studied the impact of bivariate and temporal dependencies among interarrival and service times on the performance of single-server queues. Siddiqui [29] proposed an QPSL queue model for load balancing in cloud computing. In the construction field, a related study was conducted to apply the concept of customer-server queuing with regard to construction equipment for concrete placement and excavation [30].…”
Section: Research Methods For Quantifying Uncertaintymentioning
confidence: 99%
“…But very low complexity rate is considered as the major disadvantage of this approach. Siddiqui et al (2019) proposed the queue processing for server load based queuing approach under a cloud computing environment. Response time, throughput, waiting time was the simulation metrics used to evaluate this approach.…”
Section: Previous Literature Reviewsmentioning
confidence: 99%
“…This theory focuses on managing the queue and service/operating time in a way to reduce waiting time and ensures maximum disposed entity from the system. Arrival rate of entity (𝜆) and service rate of server (𝜇) are the input variables to mathematically estimate waiting time, queue length, entity number in the queue and the system (Siddiqui et al, 2020). The queuing theory has many useful applications, including traffic flow (Zhao et al, 2019), (Hurtado Lange and Maguluri, 2022), (Maadi et al, 2022), plant location design (vehicle gas charging stations (Said and Mouftah, 2020), (Xiao et al, 2020)), scheduling (jobs on machine, patients in hospitals, online order taking and computer programs), and facility design (post offices, banks, supermarkets, ticket counter).…”
Section: Introductionmentioning
confidence: 99%