Well-posedness of the M/G/1 Queueing System with Vacations by the Cofinal Theory

Thet Thet Win, Houbao Xu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Cofinal theory is a method of effectiveness and convenience to prove that a system operator can generate a C0-semigroup. This paper analyzes the system operator of the M/G/1 queueing system with working vacations and vacation interruption. Then we prove that the system is well-posedness. First, we translate the system into an abstract Cauchy problem. Then we prove that the system operator is a densely defined resolvent positive operator is a densely defined resolvent positive operator. At the end, we draw the conclusion that the system operator generates a C0-semigroup by the cofinal theory.

Original languageEnglish
Title of host publicationProceedings of the 39th Chinese Control Conference, CCC 2020
EditorsJun Fu, Jian Sun
PublisherIEEE Computer Society
Pages214-219
Number of pages6
ISBN (Electronic)9789881563903
DOIs
Publication statusPublished - Jul 2020
Event39th Chinese Control Conference, CCC 2020 - Shenyang, China
Duration: 27 Jul 202029 Jul 2020

Publication series

NameChinese Control Conference, CCC
Volume2020-July
ISSN (Print)1934-1768
ISSN (Electronic)2161-2927

Conference

Conference39th Chinese Control Conference, CCC 2020
Country/TerritoryChina
CityShenyang
Period27/07/2029/07/20

Keywords

  • Adjoint Operator
  • C-Semigroup
  • Cofinal
  • Eigenvalue
  • M/G/1 Queueing System
  • Resolvent

Fingerprint

Dive into the research topics of 'Well-posedness of the M/G/1 Queueing System with Vacations by the Cofinal Theory'. Together they form a unique fingerprint.

Cite this