A single server queue with a varying gate mechanism
From MaRDI portal
Publication:3568451
DOI10.1080/00207160802196769zbMATH Open1191.60104OpenAlexW2038732230MaRDI QIDQ3568451FDOQ3568451
Authors: P. R. Parthasarathy, K. Vasudevan
Publication date: 11 June 2010
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160802196769
Recommendations
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Response times in gated M/G/1 queues: The processor-sharing case
- SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
- A single server queue with gated processor-sharing discipline
- Branching processes with varying and random geometric offspring distributions
- The queue with Poisson input and general service times, treated as a branching process
- A tandem queue with a gate mechanism
Cited In (4)
This page was built for publication: A single server queue with a varying gate mechanism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3568451)