By Topic

Fluid analysis of arrival routing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
M. H. Veatch ; Gordon Coll., Wehham, MA, USA

In Hajek's arrival routing problem (1984), customers are routed to one of n queues to minimize average holding cost. Interarrival and service times are exponentially distributed. We solve the associated fluid model. The optimal fluid policy tells us the asymptotic slopes of the switching surfaces in the original problem when the queues are large. If these slopes are nonzero, then numerical tests indicate that the fluid policy performs well in the original stochastic network. The fluid policy also indicates the approximate path that will be taken to recover from large queues: Routing only switches to queues with larger holding cost and once a large queue empties it will remain approximately empty

Published in:

IEEE Transactions on Automatic Control  (Volume:46 ,  Issue: 8 )