Scheduling algorithms for downlink services in wireless networks: A Markov decision process approach

William A. Massey, K. G. Ramakrishnan, M. Aravamudan, G. Pai

Research output: Contribution to conferencePaperpeer-review

6 Scopus citations

Abstract

We model the scheduling of emerging wireless data services as a Markov decision process. These services are characterized by real-time downlink data transfers such as those needed for personalized traffic, weather and business updates. Characterizing each differing service by its own time-criticality as well as reward and penalty values, we can numerically compute an optimal Markov decision scheduling rule for serving these requests. These computations suggest that we can formulate a simple, near optimal rule for scheduling these services efficiently.

Original languageEnglish (US)
Pages4038-4042
Number of pages5
StatePublished - Dec 1 2004
EventGLOBECOM'04 - IEEE Global Telecommunications Conference - Dallas, TX, United States
Duration: Nov 29 2004Dec 3 2004

Other

OtherGLOBECOM'04 - IEEE Global Telecommunications Conference
CountryUnited States
CityDallas, TX
Period11/29/0412/3/04

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Keywords

  • 3G-Wireless
  • Cognitive Radio
  • Markov Decision Processes
  • Optimal Scheduling

Fingerprint Dive into the research topics of 'Scheduling algorithms for downlink services in wireless networks: A Markov decision process approach'. Together they form a unique fingerprint.

Cite this