Cello, Marco and Gnecco, Giorgio and Marchese, Mario and Sanguineti, Marcello Narrowing the Search for Optimal Call-Admission Policies Via a Nonlinear Stochastic Knapsack Model. Journal of Optimization Theory and Applications, 164 (3). pp. 819-841. ISSN 0022-3239 (2015)
Full text not available from this repository.Abstract
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.
| Item Type: | Article |
|---|---|
| Identification Number: | https://doi.org/10.1007/s10957-014-0570-2 |
| Additional Information: | Published online: 30 April 2014 |
| Uncontrolled Keywords: | Stochastic knapsack, Nonlinear constraints, Call admission control, Coordinate-convex policies, Structural properties |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Research Area: | Computer Science and Applications |
| Depositing User: | Ms T. Iannizzi |
| Date Deposited: | 23 Feb 2015 09:38 |
| Last Modified: | 19 May 2015 09:17 |
| URI: | http://eprints.imtlucca.it/id/eprint/2614 |
Actions (login required)
 |
Edit Item |
