Comparative analysis of optimal policies for loss queues in tandem

Cheng-Yuan Ku, Shi Ming Huang, Jyun Cheng Wang, Shin Yuan Hung

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we focus on the call admission control (CAC) problem for a finite number of multiserver loss queues in tandem. Optimal policies of two different scales are considered. The global optimal policies maximize the total discounted revenue collected from all of the stations. The decision logic consists of a set of maps that are the functions of the number of requested service in progress [5]. However, the local optimal policies implemented in each station maximize the total discounted revenue collected from the corresponding station individually. It can be shown that these local policies depend on the status of all of the upstream stations. Furthermore, a comparison study was taken to gauge the performance of local optimal logic in distributed control structure against a benchmark scenario of the global optimal logic in a centralized architecture.

Original languageEnglish
Pages (from-to)33-43
Number of pages11
JournalInternational Journal of Information and Management Sciences
Volume13
Issue number4
StatePublished - 1 Jan 2002

Keywords

  • Call admission control
  • Dynamic programming
  • Global optimal policy
  • Local optimal policy
  • Loss queues in tandem

Fingerprint Dive into the research topics of 'Comparative analysis of optimal policies for loss queues in tandem'. Together they form a unique fingerprint.

Cite this