Queue size distribution in a discrete-time D-BMAP/G/1 retrial queue

Bara Kim, Jeongsim Kim

Research output: Contribution to journalArticlepeer-review

15 Citations (Scopus)

Abstract

We consider a discrete-time batch Markovian arrival process (D-BMAP)/G/1 retrial queue. We find the light-tailed asymptotics for the stationary distributions of the number of customers at embedded epochs and at arbitrary time. Using these tail asymptotics we propose a method for calculating the stationary distributions of the number of customers at embedded epochs and at arbitrary time. Numerical examples are presented to illustrate our results.

Original languageEnglish
Pages (from-to)1220-1227
Number of pages8
JournalComputers and Operations Research
Volume37
Issue number7
DOIs
Publication statusPublished - 2010 Jul

Bibliographical note

Funding Information:
This research was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Information Technology Research Center) support program supervised by the IITA (Institute of Information Technology Assessment) and the Korea Research Foundation Grant funded by the Korean Government (MOEHRD) (KRF-2008-314-C00031).

Copyright:
Copyright 2009 Elsevier B.V., All rights reserved.

Keywords

  • D-BMAP/G/1 retrial queue
  • Queue size distribution
  • Tail asymptotics

ASJC Scopus subject areas

  • General Computer Science
  • Modelling and Simulation
  • Management Science and Operations Research

Fingerprint

Dive into the research topics of 'Queue size distribution in a discrete-time D-BMAP/G/1 retrial queue'. Together they form a unique fingerprint.

Cite this