Tayeb Lardjane and Rabah Messaci On a New Numerical Analysis for the Symmetric Shortest Queue Problem
1185 - 1193
2012
6
8
International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering http://waset.org/publications/6435
http://waset.org/publications/68
World Academy of Science, Engineering and Technology
We consider a network of two MM1 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.
International Science Index 68, 2012