Optimal admission control and state space reduction in two-class preemptive loss systems

Bara Kim, Sung Seok Ko

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We consider a multiserver system with two classes of customers with preemption, which is a widely used system in the analysis of cognitive radio networks. It is known that the optimal admission control for this system is of threshold type. We express the expected total discounted profit using the total number of customers, thus reducing the stochastic optimization problem with a two-dimensional state space to a problem with a one-dimensional birth-and-death structure. An efficient algorithm is proposed for the calculation of the expected total discounted profit.

Original languageEnglish
Pages (from-to)917-921
Number of pages5
JournalETRI Journal
Volume37
Issue number5
DOIs
Publication statusPublished - 2015 Oct 1

Fingerprint

Access control
Profitability
Cognitive radio

Keywords

  • Cognitive radio networks
  • Markov decision process
  • Optimal admission policy
  • Preemptive loss system

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science(all)
  • Electronic, Optical and Magnetic Materials

Cite this

Optimal admission control and state space reduction in two-class preemptive loss systems. / Kim, Bara; Ko, Sung Seok.

In: ETRI Journal, Vol. 37, No. 5, 01.10.2015, p. 917-921.

Research output: Contribution to journalArticle

@article{3a07f3154f2549d4913e0aef888149f6,
title = "Optimal admission control and state space reduction in two-class preemptive loss systems",
abstract = "We consider a multiserver system with two classes of customers with preemption, which is a widely used system in the analysis of cognitive radio networks. It is known that the optimal admission control for this system is of threshold type. We express the expected total discounted profit using the total number of customers, thus reducing the stochastic optimization problem with a two-dimensional state space to a problem with a one-dimensional birth-and-death structure. An efficient algorithm is proposed for the calculation of the expected total discounted profit.",
keywords = "Cognitive radio networks, Markov decision process, Optimal admission policy, Preemptive loss system",
author = "Bara Kim and Ko, {Sung Seok}",
year = "2015",
month = "10",
day = "1",
doi = "10.4218/etrij.15.0114.0348",
language = "English",
volume = "37",
pages = "917--921",
journal = "ETRI Journal",
issn = "1225-6463",
publisher = "ETRI",
number = "5",

}

TY - JOUR

T1 - Optimal admission control and state space reduction in two-class preemptive loss systems

AU - Kim, Bara

AU - Ko, Sung Seok

PY - 2015/10/1

Y1 - 2015/10/1

N2 - We consider a multiserver system with two classes of customers with preemption, which is a widely used system in the analysis of cognitive radio networks. It is known that the optimal admission control for this system is of threshold type. We express the expected total discounted profit using the total number of customers, thus reducing the stochastic optimization problem with a two-dimensional state space to a problem with a one-dimensional birth-and-death structure. An efficient algorithm is proposed for the calculation of the expected total discounted profit.

AB - We consider a multiserver system with two classes of customers with preemption, which is a widely used system in the analysis of cognitive radio networks. It is known that the optimal admission control for this system is of threshold type. We express the expected total discounted profit using the total number of customers, thus reducing the stochastic optimization problem with a two-dimensional state space to a problem with a one-dimensional birth-and-death structure. An efficient algorithm is proposed for the calculation of the expected total discounted profit.

KW - Cognitive radio networks

KW - Markov decision process

KW - Optimal admission policy

KW - Preemptive loss system

UR - http://www.scopus.com/inward/record.url?scp=84942585663&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84942585663&partnerID=8YFLogxK

U2 - 10.4218/etrij.15.0114.0348

DO - 10.4218/etrij.15.0114.0348

M3 - Article

AN - SCOPUS:84942585663

VL - 37

SP - 917

EP - 921

JO - ETRI Journal

JF - ETRI Journal

SN - 1225-6463

IS - 5

ER -