Maximizing queueing network utility subject to stability: greedy primal-dual algorithm (Q2572913)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maximizing queueing network utility subject to stability: greedy primal-dual algorithm |
scientific article; zbMATH DE number 2223415
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing queueing network utility subject to stability: greedy primal-dual algorithm |
scientific article; zbMATH DE number 2223415 |
Statements
Maximizing queueing network utility subject to stability: greedy primal-dual algorithm (English)
0 references
7 November 2005
0 references
convex optimization
0 references
congestion control
0 references
resource allocation
0 references
scheduling
0 references
wireless
0 references
power and rate constraints
0 references
0 references
0 references
0 references
0 references
0.9304336905479432
0 references
0.8300922513008118
0 references
0.8201989531517029
0 references
0.8004007935523987
0 references
