Optimality Conditions for Coordinate-Convex Policies in CAC With Nonlinear Feasibility Boundaries

Optimality conditions for Call Admission Control (CAC) problems with nonlinearly constrained feasibility regions and K classes of users are derived. The adopted model is a generalized stochastic knapsack, with exponentially distributed interarrival times of the objects. Call admission strategies are...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE/ACM transactions on networking 2013-10, Vol.21 (5), p.1363-1377
Hauptverfasser:	Cello, Marco, Gnecco, Giorgio, Marchese, Mario, Sanguineti, Marcello
Format:	Artikel
Sprache:	eng
Schlagworte:	Admission control Call Admission Control (CAC) combinatorial optimization Coordinate-Convex (CC) policies feasibility region IEEE transactions Indexes Multiplexing nonlinear constraints Optimization Quality of service Stochastic Knapsack problem Stochastic processes Studies Vectors
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!