By Topic

CAC with Nonlinearly-Constrained Feasibility Regions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Cello, M. ; Dept. of Commun., Comput. & Syst. Sci. (DIST), Univ. of Genoa, Genoa, Italy ; Gnecco, G. ; Marchese, Mario ; Sanguineti, M.

Two criteria are proposed to characterize and improve suboptimal coordinate-convex (c.c.) policies in Call Admission Control (CAC) problems with nonlinearly-constrained feasibility regions. Then, a structural property of the optimal c.c. policies is derived. This is expressed in terms of constraints on the relative positions of successive corner points.

Published in:

Communications Letters, IEEE  (Volume:15 ,  Issue: 4 )