By Topic

Optimal routing to parallel heterogeneous servers-small arrival rates

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

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

2 Author(s)
Z. Rosberg ; Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel ; A. M. Makowski

Consider a set of k(⩾2) heterogeneous and exponential servers that operate in parallel. Customers arrive into a single infinite capacity buffer according to a Poisson process, and are routed to available servers in accordance with some routing policy. It is shown that for arrival rates in some possible interval (0,λ0), ever routing policy which minimizes the long-run expected holding cost is contained in the set of routing policies that minimize the expected flow time for a system with fixed initial population and no new arrivals

Published in:

IEEE Transactions on Automatic Control  (Volume:35 ,  Issue: 7 )