Optimal reservation policy for two queues in tandem

Cheng-Yuan Ku; Din Yuen Chan; Lain Chyr Hwang

doi:10.1016/S0020-0190(02)00334-4

Optimal reservation policy for two queues in tandem

Cheng-Yuan Ku^*, Din Yuen Chan, Lain Chyr Hwang

^*Corresponding author for this work

Institute of Information Management

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

1 Scopus citations

Abstract

In this paper, we consider the optimal reservation problem for two multi-server loss queues in tandem, which is usually used to model network and communication systems. In previous work [European J. Oper. Res. 21 (1985) 399-409; Ph.D. diss., 1995; IEEE Trans. Automatic Control 42 (1997) 1017-1023], under appropriate conditions, the optimal reservation policy that maximizes the expected total discounted reward over an infinite horizon is shown to be a switching curve in two-dimensional state space. However, some counterintuitive examples for variation do exist in the numerical experiments. We therefore discuss and analyze the variation in these switching curves with the number of customers in the system. We propose two sufficient conditions under which the counterintuitive situation will not occur.

Original language	American English
Pages (from-to)	27-30
Number of pages	4
Journal	Information Processing Letters
Volume	85
Issue number	1
DOIs	https://doi.org/10.1016/S0020-0190(02)00334-4
State	Published - 16 Jan 2003

Keywords

Interconnection networks
Optimal reservation policy
Variation of policy

Access to Document

10.1016/S0020-0190(02)00334-4

Cite this

@article{74c3d79211eb498cb027092d034333ce,

title = "Optimal reservation policy for two queues in tandem",

abstract = "In this paper, we consider the optimal reservation problem for two multi-server loss queues in tandem, which is usually used to model network and communication systems. In previous work [European J. Oper. Res. 21 (1985) 399-409; Ph.D. diss., 1995; IEEE Trans. Automatic Control 42 (1997) 1017-1023], under appropriate conditions, the optimal reservation policy that maximizes the expected total discounted reward over an infinite horizon is shown to be a switching curve in two-dimensional state space. However, some counterintuitive examples for variation do exist in the numerical experiments. We therefore discuss and analyze the variation in these switching curves with the number of customers in the system. We propose two sufficient conditions under which the counterintuitive situation will not occur.",

keywords = "Interconnection networks, Optimal reservation policy, Variation of policy",

author = "Cheng-Yuan Ku and Chan, {Din Yuen} and Hwang, {Lain Chyr}",

year = "2003",

month = jan,

day = "16",

doi = "10.1016/S0020-0190(02)00334-4",

language = "American English",

volume = "85",

pages = "27--30",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - Optimal reservation policy for two queues in tandem

AU - Ku, Cheng-Yuan

AU - Chan, Din Yuen

AU - Hwang, Lain Chyr

PY - 2003/1/16

Y1 - 2003/1/16

N2 - In this paper, we consider the optimal reservation problem for two multi-server loss queues in tandem, which is usually used to model network and communication systems. In previous work [European J. Oper. Res. 21 (1985) 399-409; Ph.D. diss., 1995; IEEE Trans. Automatic Control 42 (1997) 1017-1023], under appropriate conditions, the optimal reservation policy that maximizes the expected total discounted reward over an infinite horizon is shown to be a switching curve in two-dimensional state space. However, some counterintuitive examples for variation do exist in the numerical experiments. We therefore discuss and analyze the variation in these switching curves with the number of customers in the system. We propose two sufficient conditions under which the counterintuitive situation will not occur.

AB - In this paper, we consider the optimal reservation problem for two multi-server loss queues in tandem, which is usually used to model network and communication systems. In previous work [European J. Oper. Res. 21 (1985) 399-409; Ph.D. diss., 1995; IEEE Trans. Automatic Control 42 (1997) 1017-1023], under appropriate conditions, the optimal reservation policy that maximizes the expected total discounted reward over an infinite horizon is shown to be a switching curve in two-dimensional state space. However, some counterintuitive examples for variation do exist in the numerical experiments. We therefore discuss and analyze the variation in these switching curves with the number of customers in the system. We propose two sufficient conditions under which the counterintuitive situation will not occur.

KW - Interconnection networks

KW - Optimal reservation policy

KW - Variation of policy

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

U2 - 10.1016/S0020-0190(02)00334-4

DO - 10.1016/S0020-0190(02)00334-4

M3 - Article

AN - SCOPUS:0037448285

SN - 0020-0190

VL - 85

SP - 27

EP - 30

JO - Information Processing Letters

JF - Information Processing Letters

IS - 1

ER -

Optimal reservation policy for two queues in tandem

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this