By Topic

On the optimality of an index policy for bandwidth allocation with delayed state observation and differentiated services

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
$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

2 Author(s)
Ehsan, N. ; Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI ; Mingyan Liu

In this paper we study the optimality of an index policy for a bandwidth allocation problem, where a single server is allocated among N queues in a slotted system based on the queue backlog information. Due to the physical nature of the system this information is delayed, in that when the allocation decision is made, the server only has the backlog information from an earlier time. This results in imperfect and partial state observation. Queues have Bernoulli arrival processes with different probabilities of arrival, as well as different buffering/holding costs to differentiate heterogeneous classes of traffic/service. The objective is to minimize the expected total discounted holding cost over a finite or infinite horizon. We introduce an index policy with indices defined as functions of the state of a queue. We first show that when the state of the system is away from the boundary, i.e., no empty queues, the index policy is optimal. When there are empty queues, we show that under sufficient separation of the indices the index policy is still optimal. We show by example that if the separation does not hold, the index policy is not necessarily optimal. We then formulate the optimal bandwidth allocation as a restless bandit problem and show under what conditions the index policy calculated using Whittle's heuristics, which in general is only asymptotically optimal, is optimal for the finite case

Published in:

INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies  (Volume:3 )

Date of Conference:

7-11 March 2004