eprintid: 1732
rev_number: 7
eprint_status: archive
userid: 46
dir: disk0/00/00/17/32
datestamp: 2013-09-16 10:05:48
lastmod: 2013-09-16 12:02:59
status_changed: 2013-09-16 10:05:48
type: article
metadata_visibility: no_search
creators_name: Cello, Marco
creators_name: Gnecco, Giorgio
creators_name: Marchese, Mario
creators_name: Sanguineti, Marcello
creators_id: 
creators_id: giorgio.gnecco@imtlucca.it
creators_id: 
creators_id: 
title: Optimality Conditions for Coordinate-Convex Policies in CAC With Nonlinear Feasibility Boundaries 
ispublished: inpress
subjects: QA75
divisions: CSA
full_text_status: none
keywords: Call Admission Control (CAC), Coordinate-Convex (CC) policies, Stochastic Knapsack problem, combinatorial optimization, feasibility region, nonlinear constraints, 
abstract: 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 restricted to the family of Coordinate-Convex (CC) policies. For K=2 classes of users, both general structural properties of the optimal CC policies and structural properties that depend on the revenue ratio are investigated. Then, the analysis is extended to the case K>2. The theoretical results are exploited to narrow the set of admissible solutions to the associated knapsack problem, i.e., the set of CC policies to which an optimal one belongs. With respect to results available in the literature, less restrictive conditions on the optimality of the complete-sharing policy are obtained. To illustrate the role played by the theoretical results on the combinatorial CAC problem, simulation results are presented, which show how the number of candidate optimal CC policies dramatically decreases as the derived optimality conditions are imposed.
date: 2013
date_type: published
publication: IEEE/ACM Transactions on Networking
publisher: IEEE
pagerange: 1-15
id_number: 10.1109/TNET.2012.2222924
refereed: TRUE
issn: 1063-6692
official_url: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6353240&isnumber=4359146
citation:   Cello, Marco and Gnecco, Giorgio and Marchese, Mario and Sanguineti, Marcello  Optimality Conditions for Coordinate-Convex Policies in CAC With Nonlinear Feasibility Boundaries.  IEEE/ACM Transactions on Networking.  pp. 1-15.  ISSN 1063-6692    (In Press)   (2013)