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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Queueing systems Jg. 50; H. 4; S. 401 - 457
1. Verfasser: Stolyar, Alexander L.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer Nature B.V 01.08.2005
Schlagworte:
Algorithms
Commodities
Control algorithms
Control systems
Convex analysis
Mathematical models
Optimization
Queuing theory
Studies
Traffic congestion
Utility functions
Wireless networks
ISSN:0257-0130, 1572-9443
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0257-0130
1572-9443
DOI:10.1007/s11134-005-1450-0