Optimal admission control for two station tandem queues with loss

Bara Kim; Jeongsim Kim

doi:10.1016/j.orl.2014.04.006

Optimal admission control for two station tandem queues with loss

Bara Kim
, Jeongsim Kim^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

7 Citations (Scopus)

Abstract

We consider a two-station tandem queue with a buffer size of one at the first station and a finite buffer size at the second station. Silva et al. (2013) gave a criterion determining the optimal admission control policy for this model. In this paper, we improve the results of Silva et al. (2013) and also solve the problem conjectured by Silva et al. (2013).

Original language	English
Pages (from-to)	257-262
Number of pages	6
Journal	Operations Research Letters
Volume	42
Issue number	4
DOIs	https://doi.org/10.1016/j.orl.2014.04.006
Publication status	Published - 2014 Jun

Bibliographical note

Funding Information:
B. Kim’s research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT & Future Planning (MSIP) ( 2011-0025576 ). J. Kim’s research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology ( NRF-2011-0011887 ).

Keywords

Admission control
Greedy policy
Optimal policy
Prudent policy
Tandem queues

ASJC Scopus subject areas

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Access to Document

10.1016/j.orl.2014.04.006

Cite this

@article{e5da654ebf4444b28eddde2aedd36812,

title = "Optimal admission control for two station tandem queues with loss",

abstract = "We consider a two-station tandem queue with a buffer size of one at the first station and a finite buffer size at the second station. Silva et al. (2013) gave a criterion determining the optimal admission control policy for this model. In this paper, we improve the results of Silva et al. (2013) and also solve the problem conjectured by Silva et al. (2013).",

keywords = "Admission control, Greedy policy, Optimal policy, Prudent policy, Tandem queues",

author = "Bara Kim and Jeongsim Kim",

note = "Funding Information: B. Kim{\textquoteright}s research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT \& Future Planning (MSIP) ( 2011-0025576 ). J. Kim{\textquoteright}s research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology ( NRF-2011-0011887 ).",

year = "2014",

month = jun,

doi = "10.1016/j.orl.2014.04.006",

language = "English",

volume = "42",

pages = "257--262",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "4",

}

TY - JOUR

T1 - Optimal admission control for two station tandem queues with loss

AU - Kim, Bara

AU - Kim, Jeongsim

N1 - Funding Information: B. Kim’s research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT & Future Planning (MSIP) ( 2011-0025576 ). J. Kim’s research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology ( NRF-2011-0011887 ).

PY - 2014/6

Y1 - 2014/6

N2 - We consider a two-station tandem queue with a buffer size of one at the first station and a finite buffer size at the second station. Silva et al. (2013) gave a criterion determining the optimal admission control policy for this model. In this paper, we improve the results of Silva et al. (2013) and also solve the problem conjectured by Silva et al. (2013).

AB - We consider a two-station tandem queue with a buffer size of one at the first station and a finite buffer size at the second station. Silva et al. (2013) gave a criterion determining the optimal admission control policy for this model. In this paper, we improve the results of Silva et al. (2013) and also solve the problem conjectured by Silva et al. (2013).

KW - Admission control

KW - Greedy policy

KW - Optimal policy

KW - Prudent policy

KW - Tandem queues

UR - https://www.scopus.com/pages/publications/84899851990

U2 - 10.1016/j.orl.2014.04.006

DO - 10.1016/j.orl.2014.04.006

M3 - Article

AN - SCOPUS:84899851990

SN - 0167-6377

VL - 42

SP - 257

EP - 262

JO - Operations Research Letters

JF - Operations Research Letters

IS - 4

ER -

Optimal admission control for two station tandem queues with loss

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this