TY - JFULL
AU - Tayeb Lardjane and Rabah Messaci
PY - 2012/9/
TI - On a New Numerical Analysis for the Symmetric Shortest Queue Problem
T2 - International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering
SP - 1184
EP - 1193
EM - tlardjane@hotmail.com, lrabmes@yahoo.fr
VL - 6
SN - 1307-6892
UR - http://waset.org/publications/6435
PU - World Academy of Science, Engineering and Technology
NX - International Science Index 68, 2012
N2 - We consider a network of two M/M/1 parallel queues having the same poisonnian arrival stream with rate λ. Upon his arrival to the system a customer heads to the shortest queue and stays until being served. If the two queues have the same length, an arriving customer chooses one of the two queues with the same probability. Each duration of service in the two queues is an exponential random variable with rate μ and no jockeying is permitted between the two queues. A new numerical method, based on linear programming and convex optimization, is performed for the computation of the steady state solution of the system.
ER -