Analysis of queueing-time distributions for MAP/DN/1 queue
From MaRDI portal
Publication:2931936
DOI10.1080/00207160.2013.867021zbMath1306.60147OpenAlexW1984724866MaRDI QIDQ2931936
U. C. Gupta, Gagandeep Singh, Mohan L. Chaudhry
Publication date: 28 November 2014
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2013.867021
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Analyzing an infinite buffer batch arrival and batch service queue under batch-size-dependent service policy ⋮ Analytical and computational aspects of the infinite buffer single server \(N\) policy queue with batch renewal input ⋮ Queueing systems with correlated arrival flows and their applications to modeling telecommunication networks ⋮ Markovian arrival process subject to renewal generated binomial catastrophes ⋮ Sojourn-time distribution for \(M/G^a/1\) queue with batch service of fixed size -- revisited ⋮ A difference equation approach for analysing a batch service queue with the batch renewal arrival process ⋮ Analysis of the sojourn time distribution for \(M/GL/1\) queue with bulk-service of exactly size \(L\) ⋮ Queue length and server content distribution in an infinite-buffer batch-service queue with batch-size-dependent service ⋮ Queue-length distribution of a batch service queue with random capacity and batch size dependent service: \(\mathrm{M}/{\mathrm{G}^{Y}_{r}}/1\) ⋮ Analysis of an infinite-buffer batch-size-dependent service queue with Markovian arrival process ⋮ Discrete-time queue with batch renewal input and random serving capacity rule: \(GI^X/ Geo^Y/1\) ⋮ A Queueing System with Batch Renewal Input and Negative Arrivals ⋮ Computational and numerical investigation of the batch Markovian arrival process subject to renewal generated geometric catastrophes
Cites Work
- Unnamed Item
- A simple and complete computational analysis of MAP/R/1 queue using roots
- The Fourier-series method for inverting transforms of probability distributions
- Some performance measures for vacation models with a batch Markovian arrival process
- A numerically efficient method for the \(MAP/D/1/K\) queue via rational approximations
- Waiting-Time Distribution of M/DN/1 Queues Through Numerical Laplace Inversion
- New results on the single server queue with a batch markovian arrival process
- Robustness of Rootfinding in Single-Server Queueing Models