Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm

We study a model of controlled queueing network, which operates and makes control decisions in discrete time. An underlying random network mode determines the set of available controls in each time slot. Each control decision "produces" a certain vector of "commodities"; it also...

Full description

Saved in:
Bibliographic Details
Published inQueueing systems Vol. 50; no. 4; pp. 401 - 457
Main Author Stolyar, Alexander L.
Format Journal Article
LanguageEnglish
Published New York Springer Nature B.V 01.08.2005
Subjects
Algorithms
Commodities
Control algorithms
Control systems
Convex analysis
Mathematical models
Optimization
Queuing theory
Studies
Traffic congestion
Utility functions
Wireless networks
Online AccessGet full text

Cover

More Information
Summary:We study a model of controlled queueing network, which operates and makes control decisions in discrete time. An underlying random network mode determines the set of available controls in each time slot. Each control decision "produces" a certain vector of "commodities"; it also has associated "traditional" queueing control effect, i.e., it determines traffic (customer) arrival rates, service rates at the nodes, and random routing of processed customers among the nodes. The problem is to find a dynamic control strategy which maximizes a concave utility function H ( X ), where X is the average value of commodity vector, subject to the constraint that network queues remain stable.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0257-0130
1572-9443
DOI:10.1007/s11134-005-1450-0