A finite capacity bulk service queue with single vacation and Markovian arrival process (Q1773287): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Karabi Sikdar / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Damodar N. Shanbhag / rank | |||
Normal rank |
Revision as of 00:57, 15 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A finite capacity bulk service queue with single vacation and Markovian arrival process |
scientific article |
Statements
A finite capacity bulk service queue with single vacation and Markovian arrival process (English)
0 references
26 April 2005
0 references
From the authors' abstract: Vacation time queues with Markovian arrival process (MAP) are mainly useful in modeling and performance analysis of telecommunication networks based on asynchronous transfer mode environment. This paper analyzes a single-server finite capacity queue wherein service is performed in batches of maximum size ``\(b\)'' with a minimum threshold ``\(a\)'' and arrivals are governed by MAP. The server takes a single vacation when he finds less than ``\(a\)'' customers after service completion. The distributions of buffer contents at various epochs (service completion, vacation termination, departure, arbitrary and pre-arrival) have been obtained. Also, some performance measures such as loss probability and average queue length are discussed, and some numerical results are presented.
0 references
vacation time queue
0 references
departure process
0 references
loss probability
0 references