Analytical method for accuracy analysis of the randomized T-policy queue

Kuo Hsiung Wang, Dong Yuh Yang*, W.l. Pearn

*Corresponding author for this work

Research output: Contribution to journalArticle

4 Scopus citations


We consider a randomized policy to control the M/G/1 queueing system with an unreliable server, second optional service and general startup times. The server is subject to breaking down according to a Poisson process, and the repair time obeys a general distribution. All arrived customers demand the first required service, and only some of the arrived customers demand the second optional service. After all the customers are served in the system, the server immediately takes a vacation and operates the (T, p)-policy. For this queueing system, we employ maximum entropy approach with several constraints to develop the probability distributions of the system size and the expected waiting time in the queue. Based on the accuracy comparison between the exact and approximate methods, we show that the maximum entropy approach is quite accurate for practical purpose, which is a useful method for solving complex queueing systems.

Original languageEnglish
Pages (from-to)1717-1730
Number of pages14
JournalInternational Journal of Innovative Computing, Information and Control
Issue number3 A
StatePublished - 1 Mar 2012


  • (T, P)-policy
  • Accuracy comparison
  • Maximum entropy
  • Second optional service
  • Sever breakdowns
  • Startup

Fingerprint Dive into the research topics of 'Analytical method for accuracy analysis of the randomized T-policy queue'. Together they form a unique fingerprint.

  • Cite this