By Topic

Routing with limited state information in queueing systems with blocking

Sign In

Full text access may be available.

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

Formats Non-Member Member
$31 $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

3 Author(s)
Sparaggis, P.D. ; Dept. of Electr. & Comput. Eng., Massachusetts Univ., Amherst, MA, USA ; Towsley, D. ; Cassandras, C.G.

Proves the optimality of routing policies with limited state information that are employed in queueing systems with finite capacities and customers arriving at arbitrary instants. Using sample path arguments it is shown that, on one hand, when service times are exponential and capacities are equal, the round robin policy minimizes the expected number of losses by any time t and at the same time, maximizes the expected number of departures by t, over all policies that use no state information. On the other hand, when service times are deterministic, a modified round robin policy that makes use of limited state information outperforms stochastically all dynamic policies that have richer state information, in terms of the number of losses and the number of departures by t

Published in:

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