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

Proceedings - IEEE INFOCOM

Volumn 3, Issue , 2004, Pages 1974-1983

  Ehsan, Navid ^a   Liu, Mingyan ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

Delayed state observation; Differentiated services; Index policy; Optimal bandwidth allocation; Optimization; Resource allocation; Restless bandit

Indexed keywords

DELAYED STATE OBSERVATION; DIFFERENTIATED SERVICES; OPTIMAL BANDWIDTH ALLOCATION; RESTLESS BANDIT;

BANDWIDTH; COSTS; DELAY CIRCUITS; OPTIMAL CONTROL SYSTEMS; OPTIMIZATION; PACKET NETWORKS; PROBLEM SOLVING; PUBLIC POLICY; QUEUEING NETWORKS; RESOURCE ALLOCATION;

TELECOMMUNICATION SERVICES;

EID: 8344284239     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2004.1354606     Document Type: Conference Paper

References (13)

1. C. Buyukkoc, P. Varaiya, and J. Warland, "The cμ-rule revisited," Advances in Applied Probability, vol. 17, pp. 237-238, 1985.
2. L. Tassiulas and A. Ephremides, "Dynamic server allocation to parallel queues with randomly varying connectivity," IEEE Transactions on Information Theory, vol. 39, no. 2, pp. 466-478, March 1993.
3. L. Tassiulas, "Scheduling and performance limits of networks with constantly changing topology," IEEE Transactions on Information Theory, vol. 43, no. 3, pp. 1067-73, May 1997.
4. N. Bambos and G. Michailidis, "On the stationaiy dynamics of parallel queues with random server connectivities," Proc. 43th Conference on Decision and Control (CDC), pp. 3638-43, 1995, New Orleans, LA.
5. C. Lott and D. Teneketzis, "On the optimality of an index rule in multi-channel allocation for single-hop mobile networks with multiple service classes," Probability in the Engineering and Informational Sciences, vol. 14, no. 3, pp. 259-297, July 2000.
6. L. Tassiulas and S. Papavassiliou, "Optimal anticipative scheduling with asynchronous transmission opportunities," IEEE Transactions on Automatic Control, vol. 40, no. 12, pp. 2052-62, December 1995.
7. M. Carr and B. Hajek, "Scheduling with asynchronous service opportunities with applications to multiple satellite systems," IEEE Transactions on Automatic Control, vol. 38, no. 12, pp. 1820-33, December 1993.
8. P. Sparaggis, D. Towsley, and C. Cassandras, "Extremal properties of the shortest/longest non-full queue policies in finite-capacity systems with state-dependent service rates," Journal of Applied Probability, vol. 30, pp. 233-236, 1993.
9. P. Whittle, "Restless bandits: Activity allocation in a changing world," A Celebration of Applied Probability, ed. J. Gani, Journal of applied probability, vol. 25A, pp. 287-298, 1988.
10. R. Weber and G. Weiss, "On an index policy for restless bandits," Journal of Applied Probability, vol. 27, pp. 637-648, 1990.
11. N. Ehsan and M. Liu, "Optimal bandwidth allocation with delayed state observation and batch assignment," EECS Technical Report CGR 03-11, University of Michigan, Ann Arbor, March 2003.
12. J. Nino-Mora, "Restless bandits, patial conservation laws, and indexability," Advances in Applied Probability, Vol. 33, no. 1, pp. 76-98, 2001.
13. M. Raissi-Dehkordi and J. S. Baras, "Broadcast scheduling in information delivery systems," Proc. IEEE GLOBECOM, 2002.