One-dimensional service networks and batch service queues
From MaRDI portal
Publication:2052950
DOI10.1007/s11134-021-09703-0zbMath1492.90041OpenAlexW3153816197MaRDI QIDQ2052950
Prithwish Basu, Nitish K. Panigrahy, Don Towsley, Philippe Nain
Publication date: 29 November 2021
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-03066179v2/file/1d-cost%20%281%29.pdf
resource allocationbatch service queuescommunication costaccessible batch queuesone-dimensional networks
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analytic and numerical aspects of batch service queues with single vacation
- Poisson matching
- Discrete-time bulk-service queues with accessible and non-accessible batches
- The moment generating function has its moments
- A polynomial time primal network simplex algorithm for minimum cost flows
- A queueing system with single arrival bulk service and single departure.
- Performance analysis of finite buffer discrete-time queue with bulk service
- Equilibrium probability calculations for a discrete-time bulk queue model
- Steady state analysis of a bulk queue with multiple vacations, setup times with \(N\)-policy and closedown times
- Analytic computation schemes for the discrete-time bulk service queue
- Factorization and stochastic decomposition properties in bulk queues with generalized vacations
- Geometry Helps in Matching
- Analysis of the Exceptional Queueing System by the Use of Regenerative Processes and Analytical Methods
- On M/G/1 queues with the first N customers of each busy period receiving exceptional services
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
- On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service
- Equivalences of Batch-Service Queues and Multi-Server Queues and Their Complete Simple Solutions in Terms of Roots
- On the busy period of the modified GI/G/1 queue
This page was built for publication: One-dimensional service networks and batch service queues
