2011 | OriginalPaper | Buchkapitel
Optimal Distributed Uplink Channel Allocation: A Constrained MDP Formulation
verfasst von : Vivek S. Borkar, Joy Kuri
Erschienen in: Advances in Dynamic Games
Verlag: Birkhäuser Boston
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Several users share a common channel for transmission, which has an average rate constraint. The packets not yet transmitted are queued. The problem of optimal channel allocation to minimize the average sum queue occupancy subject to this constraint splits into individual Markov decision processes (MDPs) coupled through the Lagrange multiplier for the rate constraint. This multiplier can be computed by an on-line stochastic gradient ascent in a centralized or distributed manner. This gives a stochastic dynamic version of Kelly’s decomposition. A learning scheme is also presented.