TY  - JOUR
SN  - 0022-3239
ID  - eprints2614
EP  - 841
N2  - Call admission control with two classes of users is investigated via a nonlinear stochastic knapsack model. The feasibility region represents the subset of the call space, where given constraints on the quality of service have to be satisfied. Admissible strategies are searched for within the class of coordinate-convex policies. Structural properties that the optimal policies belonging to such a class have to satisfy are derived. They are exploited to narrow the search for the optimal solution to the nonlinear stochastic knapsack problem that models call admission control. To illustrate the role played by these properties, the numbers of coordinate-convex policies by which they are satisfied are estimated. A graph-based algorithm to generate all such policies is presented.
JF  - Journal of Optimization Theory and Applications
PB  - Springer-Verlag
IS  - 3
N1  - Published online: 30 April 2014
AV  - none
SP  - 819
TI  - Narrowing the Search for Optimal Call-Admission Policies Via a Nonlinear Stochastic Knapsack Model
A1  - Cello, Marco
A1  - Gnecco, Giorgio
A1  - Marchese, Mario
A1  - Sanguineti, Marcello
UR  - http://link.springer.com/article/10.1007%2Fs10957-014-0570-2
Y1  - 2015/03//
VL  - 164
KW  - Stochastic knapsack
KW  -  Nonlinear constraints
KW  -  Call admission control
KW  -  Coordinate-convex policies
KW  -  Structural properties
ER  -