Analysis of the BMAP/SM/1/N type system with randomized choice of customers admission discipline
From MaRDI portal
Publication:4690229
DOI10.1007/978-3-319-44615-8_4zbMATH Open1405.90046OpenAlexW2513466016MaRDI QIDQ4690229FDOQ4690229
Authors: Alexej Shaban, Alexander Dudin 
Publication date: 22 October 2018
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-44615-8_4
Recommendations
- A single-server queueing system with batch Markov arrivals, semi-Markov service, and finite buffer: its characteristics
- An SM\(_2/\text{MSP}/n/r\) system with random-service discipline and a common buffer
- The \(MAP + MAP/PH/1/N\) queuing system with single and batch arrivals of customers
- BMAP/G/1/N queue with vacations and limited service discipline
- Erlang loss queueing system with batch arrivals operating in a random environment
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Title not available (Why is that?)
- New results on the single server queue with a batch markovian arrival process
- Title not available (Why is that?)
- Analysis of the loss probability of the map/g/1/k queue part i: asymptotic theory
- Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory
- A retrial BMAP/SM/1 system with linear repeated requests
- Lack of invariant property of the Erlang loss model in case of MAP input
- The n/g/l finite capacity queue
- Optimal hysteretic control for a \(\text{BMAP/SM/1/}N\) queue with two operation modes
- A single-server queueing system with batch Markov arrivals, semi-Markov service, and finite buffer: its characteristics
- Some steady-state distributions for theMAP /SM /1 queue
- Algorithmic analysis of dual tandem queue with batch Markovian arrival process and repeated attempts at the first station
Cited In (4)
- Queueing systems with correlated arrival flows and their applications to modeling telecommunication networks
- On the distribution of the number of consecutively lost customers in the \textit{BMAP}/\textit{PH}/1/\textit{N} system
- An SM\(_2/\text{MSP}/n/r\) system with random-service discipline and a common buffer
- Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/\(1\) queue under random order service discipline
This page was built for publication: Analysis of the BMAP/SM/1/N type system with randomized choice of customers admission discipline
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4690229)
