Analysis of queue-length dependent vacations and P-limited service in \(\mathrm{BMAP}/\mathrm{G}/1/N\) systems: stationary distributions and optimal control
DOI10.1155/2013/196372zbMath1295.60102OpenAlexW2065259216WikidataQ58993547 ScholiaQ58993547MaRDI QIDQ2444206
Publication date: 9 April 2014
Published in: International Journal of Stochastic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/196372
batch Markovian arrival process (BMAP)queue-length distributionfinite-buffer single server queueing systemqueue-length dependent vacations
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- BMAP/G/1/N queue with vacations and limited service discipline
- Queueing systems with vacations - a survey
- \(M/G/1/N\) vacation model with varying \(E\)-limited service discipline
- Optimal multithreshold control for a BMAP\(/G/1\) queue with \(N\) service modes
- Some performance measures for vacation models with a batch Markovian arrival process
- A new approach to the queue length and waiting time of \(BMAP/G/1\) queues.
- A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity
- A numerically efficient method for the \(MAP/D/1/K\) queue via rational approximations
- Tail asymptotics for the fundamental period in the MAP\(/G/1\) queue
- Complete analysis of MAP/G/1/N queue with single (multiple) vacation(s) under limited service discipline
- Vacation queueing models. Theory and applications
- New results on the single server queue with a batch markovian arrival process
- A single-server queue with server vacations and a class of non-renewal arrival processes
- Regenerative Analysis and Steady State Distributions for Markov Chains
- Control Policies for the MX/G/1 Queueing System
- A versatile Markovian point process
- The BMAP/G/1 vacation queue with queue-length dependent vacation schedule
- Optimal strategy in N-policy production system with early set-up
- AMAP/G/1 Queue with an Underlying Birth–Death Process
- Calculating the loss probability in aBMAP/G/l/N+1 queue
- The BMAP/GI/1 queue with server set-up times and server vacations
- Time to Reach Buffer Capacity in aBMAPQueue
- Finite capacity vacation models with non-renewal input
This page was built for publication: Analysis of queue-length dependent vacations and P-limited service in \(\mathrm{BMAP}/\mathrm{G}/1/N\) systems: stationary distributions and optimal control
