Analysis of a Discrete-Time Finite-Capacity Single-Server Queue with Markovian-Arrival Process and Random-Bulk-Service: D-MAP/GY/1/M

DOI10.1080/07362994.2010.515487zbMath1206.60084OpenAlexW2033555624MaRDI QIDQ3068103

Nam K. Kim, Bong K. Yoon, Mohan L. Chaudhry

Publication date: 13 January 2011

Published in: Stochastic Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/07362994.2010.515487

zbMATH Keywords

queueingdiscrete timefinite-capacitycorrelated arrivalrandom-bulk-service

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of the discrete-time bulk-service queue Geo/G\(^Y\)/1/N+B.
• Analysis of the queue-length distribution for the discrete-time batch-service \(Geo/G^{a,Y}/1/k\) queue
• Descriptors of arrival-process burstiness with application to the discrete Markovian arrival process
• A matrix analytic solution to a hysteretic queueing system with random server capacity
• Computational analysis of single-server bulk-service queues, M/G^Y/ 1
• ANALYSIS OF A GI/G^Y/1 SYSTEM IN DISCRETE-TIME
• A note on the M^X/G^Y/1, K bulk queueing system

This page was built for publication: Analysis of a Discrete-Time Finite-Capacity Single-Server Queue with Markovian-Arrival Process and Random-Bulk-Service: D-MAP/G^Y/1/M