An approximate analysis of load balancing using stale state information for servers in parallel
(2003) In Proceedings of the Second IASTED International Conference on Communications, Internet, and Information Technology : November 17  19, 2003, Scottsdale, AZ, USA Abstract
 That a load balancing strategy using stale information care lessly will incur system performance degradation is easy to verify. However it is not so obvious that routing a customer to the expected shortest queue has the same problem when information for decision is stale. We consider a queueing system with a load balancer and a pool of identical FCFS queues in parallel. The arrival process is assumed to be Poisson and the service times have identical independent exponential distributions. The pool of servers informs the load balancer the number of customers in each server at some regularly spaced time instances. The load balancer routes each customer to the expected shortest queue based on available stale information and elapsed time since... (More)
 That a load balancing strategy using stale information care lessly will incur system performance degradation is easy to verify. However it is not so obvious that routing a customer to the expected shortest queue has the same problem when information for decision is stale. We consider a queueing system with a load balancer and a pool of identical FCFS queues in parallel. The arrival process is assumed to be Poisson and the service times have identical independent exponential distributions. The pool of servers informs the load balancer the number of customers in each server at some regularly spaced time instances. The load balancer routes each customer to the expected shortest queue based on available stale information and elapsed time since the last time instance of system sate information updating. The system performance analysis of this type of model is usu ally difficult because the involved state space is very large. However when taking the number of servers to the infinite limit, we have a set of differential equations which is easier to handle than the finite case. Using the approximation of infinite number of severs, we show that the average wait ing time for the system is not always minimized by routing each customer to the expected shortest queue when infor mation for decision is stale. (Less)
Please use this url to cite or link to this publication:
http://lup.lub.lu.se/record/532446
 author
 Cao, Jianhua ^{LU} and Nyberg, Christian ^{LU}
 organization
 publishing date
 2003
 type
 Chapter in Book/Report/Conference proceeding
 publication status
 published
 subject
 in
 Proceedings of the Second IASTED International Conference on Communications, Internet, and Information Technology : November 17  19, 2003, Scottsdale, AZ, USA
 editor
 Hamza, M.H.
 publisher
 ACTA Press
 external identifiers

 Scopus:1542538750
 ISBN
 0889863989
 language
 English
 LU publication?
 yes
 id
 1aeab9e3e98d495487e2fc2f66782c63 (old id 532446)
 date added to LUP
 20070913 13:21:22
 date last changed
 20161013 04:36:53
@misc{1aeab9e3e98d495487e2fc2f66782c63, abstract = {That a load balancing strategy using stale information care lessly will incur system performance degradation is easy to verify. However it is not so obvious that routing a customer to the expected shortest queue has the same problem when information for decision is stale. We consider a queueing system with a load balancer and a pool of identical FCFS queues in parallel. The arrival process is assumed to be Poisson and the service times have identical independent exponential distributions. The pool of servers informs the load balancer the number of customers in each server at some regularly spaced time instances. The load balancer routes each customer to the expected shortest queue based on available stale information and elapsed time since the last time instance of system sate information updating. The system performance analysis of this type of model is usu ally difficult because the involved state space is very large. However when taking the number of servers to the infinite limit, we have a set of differential equations which is easier to handle than the finite case. Using the approximation of infinite number of severs, we show that the average wait ing time for the system is not always minimized by routing each customer to the expected shortest queue when infor mation for decision is stale.}, author = {Cao, Jianhua and Nyberg, Christian}, editor = {Hamza, M.H.}, isbn = {0889863989}, language = {eng}, publisher = {ARRAY(0x89d9c18)}, series = {Proceedings of the Second IASTED International Conference on Communications, Internet, and Information Technology : November 17  19, 2003, Scottsdale, AZ, USA}, title = {An approximate analysis of load balancing using stale state information for servers in parallel}, year = {2003}, }