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

Bara Kim; Jeongsim Kim

doi:10.1016/j.cor.2009.04.016

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

Bara Kim, Jeongsim Kim

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

16 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 language	English
Pages (from-to)	1220-1227
Number of pages	8
Journal	Computers and Operations Research
Volume	37
Issue number	7
DOIs	https://doi.org/10.1016/j.cor.2009.04.016
Publication status	Published - 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

Access to Document

10.1016/j.cor.2009.04.016

Cite this

@article{39f666b13a354160a2a28782f03e0c77,

title = "Queue size distribution in a discrete-time D-BMAP/G/1 retrial queue",

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.",

keywords = "D-BMAP/G/1 retrial queue, Queue size distribution, Tail asymptotics",

author = "Bara Kim and Jeongsim Kim",

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.",

year = "2010",

month = jul,

doi = "10.1016/j.cor.2009.04.016",

language = "English",

volume = "37",

pages = "1220--1227",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd",

number = "7",

}

TY - JOUR

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

AU - Kim, Bara

AU - Kim, Jeongsim

N1 - 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.

PY - 2010/7

Y1 - 2010/7

N2 - 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.

AB - 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.

KW - D-BMAP/G/1 retrial queue

KW - Queue size distribution

KW - Tail asymptotics

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

U2 - 10.1016/j.cor.2009.04.016

DO - 10.1016/j.cor.2009.04.016

M3 - Article

AN - SCOPUS:70649112361

SN - 0305-0548

VL - 37

SP - 1220

EP - 1227

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 7

ER -

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

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this