0% found this document useful (0 votes)
55 views5 pages

A Comparative Study Between Multi Queue Multi Server and Single Queue Multi Server Queuing System

This document presents a comparative study between multi queue multi server (MQMS) and single queue multi server (SQMS) queuing systems. The authors derive the relevant mathematical equations for both systems and use the principle of finite mathematical induction to show the superiority of SQMS over MQMS. Key findings include that the SQMS model provides more practical and effective solutions for applications compared to the MQMS model. The document also reviews previous literature on queuing theory models and their applications in fields such as management science, medical science, and computer systems.

Uploaded by

Vincent Nowaseb
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
0% found this document useful (0 votes)
55 views5 pages

A Comparative Study Between Multi Queue Multi Server and Single Queue Multi Server Queuing System

This document presents a comparative study between multi queue multi server (MQMS) and single queue multi server (SQMS) queuing systems. The authors derive the relevant mathematical equations for both systems and use the principle of finite mathematical induction to show the superiority of SQMS over MQMS. Key findings include that the SQMS model provides more practical and effective solutions for applications compared to the MQMS model. The document also reviews previous literature on queuing theory models and their applications in fields such as management science, medical science, and computer systems.

Uploaded by

Vincent Nowaseb
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 5

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/343933417

A Comparative Study Between Multi Queue Multi Server And Single Queue Multi
Server Queuing System

Article in International Journal of Scientific & Technology Research · December 2019


DOI: 10.1088/1742-6596/1000

CITATION READS
1 456

4 authors:

Dr Ranadheer Donthi Mahaboob B.


St.Martin's Engineering College K L University
22 PUBLICATIONS 41 CITATIONS 50 PUBLICATIONS 159 CITATIONS

SEE PROFILE SEE PROFILE

J. Peter Praveen Vijay Prasad


Vignan's Institute of institute of information Technology Vikram University
20 PUBLICATIONS 73 CITATIONS 15 PUBLICATIONS 51 CITATIONS

SEE PROFILE SEE PROFILE

Some of the authors of this publication are also working on these related projects:

A Treatise on Testing General Linear Hypothesis in Stochastic Linear Regression Model View project

All content following this page was uploaded by Vijay Prasad on 06 October 2020.

The user has requested enhancement of the downloaded file.


INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 12, DECEMBER 2019 ISSN 2277-8616

A Comparative Study Between Multi Queue Multi


Server And Single Queue Multi Server Queuing
System
S Vijay Prasad, B Mahaboob, Ranadheer Donthi, J Peter Praveen

Abstract: Queuing theory is a mathematical phenomenon which has a large number of applications in many branches like Management Sciences,
Medical Sciences and Econometrics. In this, the different types of consumers are provided the required service by different types of servers following to
precise queuing orders. This research article explores the superiority of SQMSM over the MQMSM and this is shown by using the principle of finite
mathematical induction. Besides the corresponding mathematical equations are derived and results obtained are more practical and effective in
applications point of view.

Index terms: QTM (Queuing Theory Model), OR (Operations Research), Single server queuing model, Multi server queuing model, MQMS (Multi
Queue Multi Server) and SQMS (Single queue –Multi server model), Waiting time.
——————————  ——————————

1 INTRODUCTION: Besides the principal mathematical concepts of queuing


Queuing theory is a mathematical phenomena and it has a model: service time and arrival distributions, queue
large number of applications in many branches like Medical behavior and queue disciplines were presented in their
Sciences, Management Sciences, Computer Systems and article. To evaluate the performance of practical queuing
Econometrics. In this, the different types of consumers are systems the operating characteristic principle for MS
provided required service by different types of servers queuing model meant were also presented [3]. Adan et al.
following to precise queuing orders. Queuing theory is most in 2001, in their research article, proposed analytic
useful in order to predict the some computer performance techniques for queuing models with multiple queues and
measures. This is the mathematical discourse of queues in those procedures were explained briefly with the help of key
which QTM is framed to estimate the waiting times and models namely shortest queue, 2x2 switches and the cyclic
queue length. QT is branch of OR has the outcomes are polling system [4]. Ahmad and Nikenasih, in 2017, in their
frequently used to make a business decisions concerning research article focused on the outcomes of the queue
the desired resources to offer the service. QT consists of model is signified by (M/M/4):(GD/∞/∞), in which the
assembling the mathematical models of different category service time and arrivals follow exponential and Poisson
of the queuing system which can be used to estimate the distribution respectively and estimated the characteristics
changes in the system according to the demand and the rules of the queuing model and in terms of TC (total cost)
analysis of the queuing activities and the queues. Sandhiya minimize the number of servers .[5] Xiao and Zhang, in
and Varadharajan, in 2018, proposed a interval arithmetic 2010, in their research article investigated the queuing
process to study the properties of queuing models and numbers, the service window numbers and the optimal
estimated with interval numbers to deal with uncertain service rate by using the principles of Queuing Theory [6].
parameters by using the single server queuing model and This research article explores the superiority of SQMSM
more than one server queuing model in which the service over the MQMSM and this is shown by using the principle
rates and the arrival rate are considered interval number of finite mathematical induction. Besides the corresponding
[1]. Ekpenyong et al. in 2011, extended the results in a new mathematical equations are derived and results obtained
queuing system with multiple phases of multiple servers are more practical and effective in applications point of
under the circumstances of first come first served, unlimited view.
population basis, Erlang service time and Poisson arrivals
and performance measures with multiple phases of the 2 A GLANCE ON THE PREREQUISITES OF THE
single-server single queue system with multiple phases QUEUING SYSTEMS
found and compared with the performance measures of
single-server with multiple phases model [2]. Nsude et al. in 2.1 Principal Notations
2017, in their research paper focused on multiple-lines, α = Average of the arrival rate
multiple server systems of customers in banking sector. β = Average of the service rate
η = Efficiency of the system (Utilization of the server)
---------------------------------------------------------- Eq = the total number of clients existing in the queue
Ec = the total number of clients existing in the system
 S Vijay Prasad and J Peter Praveen are currently working as Tq = the time of waiting of the client in the queue
Assistant Professors in Department of Mathematics, Koneru Tc= the time of waiting of the client in the system
Lakshmaiah Education Foundation, Vaddeswaram, A.P., India,
522502. E- mail;indorevijay@gmail.com
• B Mahaboob is currently working as Associate Professor in 2.2 Measurements of working capacity of the single
Department of Mathematics, Koneru Lakshmaiah Education queue single server model
Foundation, Vaddeswaram, A.P., India, 522502. The total number of clients waiting in the system E =
• Ranadheer Donthi currently working as Professor in Department of
Mathematics, St. Martin Engineering College, Secunderabad,
Telangana, India, 500014
1821
IJSTR©2019
www.ijstr.org
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 12, DECEMBER 2019 ISSN 2277-8616

The number of clients waiting in the queue E = ( )


+ < +
( )[( )( )∑ ] ( )

The waiting time of the client in the queue T = =


( ) < 1
( )( )∑

The waiting time of the client in the system T = T + cη − *(c − 1) (c − η) ∑ + η+ < 0


Assume the LHS of the above inequality as h(c). Then one
2.3 Measurements of working capacity of the single get
queue multi server model h(c) < 0 for all c > 1
The number of clients waiting in the queue E = f(c), g(c) and h(c) are similar.
*( )
( ) ( )
+P where
3.2 Lemma
P = [∑ (α⁄β) + (α⁄β) ( )] If the SQMS model is superior over the MQMS model then
f(c) < 0, ∀ c > 1, where
The number of clients waiting in the system E = E +
f(c) = cη − *(c − 1) (c − η) ∑ + η +.
Proof: The equation is proved by using the Principle of
The waiting time of the client in the queue
Finite Mathematical Induction.
T = *( )
( ) ( )
+P = If c = 2
The waiting time of the client in the system 𝑇 = 𝑇 + f(2) = 2η − *(2 − 1) (2 − η) ∑ + η +
3 SQMS VERSES MQMS IN QUEUING SYSTEM f(2) = −(2 − η) < 0
If one consider S number of service stations in the system, Now one can suppose that this result is valid for m
arrival rate of the clients is α and the service rate of each f(m) = m η − *(m − 1) (m − η) ∑ + η + <0
service station is β, then one can estimate E , E , T and T Now it remains to show that this valid for m + 1
in 2 instants and can study the comparative properties of
f(m + 1) = (m + 1)η − *(m + 1 − 1) (m + 1 −
these in each instant. In the case of exactly one queue and
c number of service stations then phenomenon named η) ∑ + η +
M/M/c queuing system and in this case one can use MSQM
to evaluate E , E , T and T . If there are c number of f(m + 1) = (m + 1)η − *(m) (m + 1 − η) ∑ + η +
queues and c number of service stations in the system then
the queuing system considered c number of separate f(m + 1) = mη + η − η − (m + 1 − η) *(m) ∑ +
M/M/1 queuing models and one can apply SSQM to
evaluate E , E , T and T . Also in this case the client arrival (m) +
rate becomes . f(m + 1) = − *(m) (m + 1 − η) ∑ +
3.1 Part-I f(m + 1) < 0 , Hence it is valid for all c > 1.
E < E where E and E are in the cases of one queue
and c queues respectively 3.3 Part- II
< The total number of clients waiting (L ) is larger one queue
( )[( )( )∑ ] ( )
as one compare with case of c queue E > E where E
< 1 and E are in the cases of one queue and c queues
( )( )∑ respectively
cη − *(c − 1) (c − η) ∑ + η+ < 0 + η >
( )[( )( )∑ ] ( )
Assume the LHS of the above inequality as f(c). Then one
[ ( )( )( )∑ ( )]
get
f(c) < 0 for all c > 1 >
( )[( )( )∑ ] ( )
T < T where T and T are in the cases of one queue
( )( ) ∑ ( )
and c queues respectively > 1
( )( )∑
<
( )[( )( )∑ ] ( )
η + (c − η − 1)(c − 1) ∑ > 0
< 1 Assume the LHS of the above inequality as y(c). Then one
( )( )∑
get
cη − *(c − 1) (c − η) ∑ + η+ < 0 y(c) > 0 for all c > 1
Assume the LHS of the above inequality as g(c). Then one
get 3.4 Lemma
g(c) < 0 for all c > 1 If the SQMS model is superior over the MQMS model then
f(c) and g(c) are similar. y(c) > 0, ∀ c > 1, where y(c) = η + (c − η − 1)(c −
T < T where T and T are in the cases of one queue 1) ∑
and C queues respectively Proof: The equation is proved by using the Principle of
Finite Mathematical Induction.
1822
IJSTR©2019
www.ijstr.org
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 12, DECEMBER 2019 ISSN 2277-8616

If c = 2 12(6), 5387-5399.
y(2) = η + (2 − η − 1) (2 − 1) ∑ [11] Vasanta Kumar, V., Srinivasa Rao, T., & Srinivasa
Kumar, B. (2018). Queuing system with customer
y(2) = η + (1 − η) (1 + η) reneging during vacation and breakdown times. Journal
y(2) = 1 > 0 of Advanced Research in Dynamical and Control
Suppose that this result is valid for m Systems, 10(2), 381-385.
y(m) = η + (m − η − 1)(m − 1) ∑ > 0 [12] Rao, S. H., Kumar, V. V., Rao, T. S., & Kumar, B. S.
Now it remains to show that this valid for m + 1 (2016). M/M/1 two-phase gated queuing system with
unreliable server and state dependent arrivals.
y(m + 1) = η + (m + 1 − η − 1)(m + 1 − 1) ∑ International Journal of Chemical Sciences, 14(3), 1742-
1754.
y(m + 1) = η + (m − η)(m) ∑ >0 since
[13] Hanumantha Rao, S., Vasanta Kumar, V., Srinivasa
m−η>0 Rao, T., & Srinivasa Kumar, B. (2018). Analysis of batch
Therefore y(m + 1) > 0 arrival two-phase Mx/M/1 queueing system with
Hence it is valid for all c > 1 impatient customers and unreliable server. Journal of
Advanced Research in Dynamical and Control Systems,
4 CONCLUSION 10(2), 348-356.
This research article has proved the superiority of SQMS [14] Rao, H., Kumar, V., Srinivasa Rao, T., & Srinivasa
over the MQMSM and this is shown by using the principle Kumar, B. (2018). Optimal control of M/M/1 two-phase
of finite mathematical induction. Besides the corresponding queueing system with state-dependent arrival rate,
mathematical equations are derived and results obtained server breakdowns, delayed repair, and N-policy. Paper
are more practical and effective in applications point of presented at the Journal of Physics: Conference Series,
view. , 1000(1) doi:10.1088/1742-6596/1000/1/012031 Satish
Kumar, D., Anusha, S., Rao, D. S., & Niranjan, H.
5 REFERENCE (2018). A study on consumer behavior at corporate retail
[1] N Sandhiya, R Varadharajan, A study on single and stores in vijayawada city. Paper presented at the Journal
multi server queuing models using interval number, IOP of Physics: Conference Series, , 1139(1)
Conf. Series: Journal of Physics: Conf. Series, 1000 doi:10.1088/1742-6596/1139/1/012039.
(2018) 012133, doi :10.1088/1742-6596/1000/1/012133. [15] Rajyalakshmi, K., & Victorbabu, B. R. (2018). A note on
[2] Ekpenyong, Emmanuel John and Udoh, Nse Sunday, second order rotatable designs under tridiagonal
Analysis of Multi-Server Single Queue System with correlated structure of errors using balanced incomplete
Multiple Phases, Pak.j.stat.oper.res. , (2011), Vol. VII (2), block designs. International Journal of Agricultural and
pp 305-314. Statistical Sciences, 14(1), 1-4.
[3] F. I. Nsude, Elem-Uche O. and Bassey Uwabunkonye, [16] Kumar, D., Rajyalakshmi, K., & Asadi, S. S. (2017).
Analysis of multiple-queue multiple-server queuing Digital marketing strategical role to promote technical
system: a case study of first bank nig. plc, afikpo branch, education in andhra and telangana: An exploratory
International Journal of Scientific & Engineering study. International Journal of Civil Engineering and
Research, (2017), 8 (1), pp 1700- 1709. Technology, 8(10), 197-206.
[4] I.J.B.F. Adan, O.J. Boxma_ and J.A.C. Resing, [17] Vijay Prasad, S., Peter Praveen, J., Tiwari, A., Prasad,
Queueing models with multiple waiting lines, queueing K., Bindu, P., Donthi, R., & Mahaboob, B. (2018). An
systems, (2001), 37, pp 65–98. application of LPP - graphical method for solving multi
[5] Ahmad Muhajir and Nikenasih Binatari, Queueing server queuing model. International Journal of
system analysis of multi server model at XYZ insurance Mechanical Engineering and Technology, 9(1066-1069),
company in Tasikmalaya city, AIP Conference 1066-1069.
Proceedings 1868, 040004 (2017); doi: [18] Vijay Prasad, S., Badshah, V.H. and Pradeep Porwal,
10.1063/1.4995119. Decision Making by M/M/S Queuing Model: A Case
[6] Huimin Xiao and Guozheng Zhang, The queuing theory Study-I, International Journal of Pure and Applied
application in bank service optimization, International Mathematical Sciences, Volume 7, (2014), pp 137-143.
conference on logistics systems and intelligent [19] S. Vijay Prasad and V. H. Badshah, Alternate queuing
management (ICLSIM), IEEE Press, (2010), pp 1097- system for tatkal railway reservation system, Advances
1100. in Applied Science Research, (2014), 5(6), pp 120-125.
[7] Cooper, R., Introduction to Queuing Theory, 2nd Edition, [20] Kumar, D. P., Rajyalakshmi, K., & Asadi, S. S. (2017). A
New York: Elsevier North Holland, (1980). model analysis for the promotional techniques of cell
[8] Sharma. J. K , Operations research theory and phone subscriber identity module (SIM) cards.
applications, third edition, Macmillan India Ltd. New International Journal of Civil Engineering and
Delhi, (2007), 725-750. Technology, 8(9), 889-897.
[9] Taha, H. A., Operations research: an introduction, 8th [21] Kumar, D. P., Rajyalakshmi, K., & Asadi, S. S. (2017).
edition, Pearson Education, Inc., (2007), 557-558. Analysis of mobile technology switching behavior of
[10] Hanumantha Rao, S., Vasanta Kumar, V., Srinivasa consumer using chi-square technique: A model study
Rao, T., & Srinivasa Kumar, B. (2016). A two-phase from hyderabad. International Journal of Civil
unreliable M/Ek/1 queueing system with server startup, Engineering and Technology, 8(9), 99-109.
N-policy, delayed repair and state dependent arrival [22] Rajyalakshmi, K., Kumar, D. P., & Asadi, S. S. (2017). An
rates. Global Journal of Pure and Applied Mathematics, analitical study for evaluation of factors influencing the

1823
IJSTR©2019
www.ijstr.org
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 12, DECEMBER 2019 ISSN 2277-8616

customers to utilization of e-commerce sites.


International Journal of Mechanical Engineering and
Technology, 8(12), 184-196.

1824
IJSTR©2019
View publication stats
www.ijstr.org

You might also like