Pseudo conservation for partially fluid, partially lossy queueing systems
From MaRDI portal
Publication:2283262
DOI10.1007/S10479-018-2780-8zbMATH Open1427.90092OpenAlexW2794347361MaRDI QIDQ2283262FDOQ2283262
V. Kavitha, Jayakrishnan Nair, Raman Kumar Sinha
Publication date: 30 December 2019
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-018-2780-8
Recommendations
- Pseudo-conservation laws in cyclic-service systems with a class of limited service policies
- PSEUDO-CONSERVATION LAW FOR DISCRETE-TIME MULTI-QUEUE SYSTEMS WITH PRIORITY DISCIPLINES
- Sample-path conservation laws, with applications to scheduling queues and fluid systems
- Pseudo-conservation laws in cyclic-service systems
- A Unifying Conservation Law for Single-Server Queues
balkingrenegingfluid limitsloss systemsmulticlass queuesheterogeneous queuesachievable regioncomplete policiespseudo-conservation
Cites Work
- Title not available (Why is that?)
- Markov chains and stochastic stability
- Stochastic orders
- Queuing with Preemptive Priorities or with Breakdown
- Title not available (Why is that?)
- Some Queuing Problems with Balking and Reneging—II
- Renewal theory and computable convergence rates for geometrically erdgodic Markov chains
- A conservation law for a wide class of queueing disciplines
- Title not available (Why is that?)
- Introduction to Queueing
- On queues with Markov modulated service rates
- M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules
- Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control
- A delay dependent queue discipline
- Improving Service by Informing Customers About Anticipated Delays
- Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance
- Complete parameterized families of job scheduling strategies
- A Characterization of Waiting Time Performance Realizable by Single-Server Queues
- A polling model with an autonomous server
- An Exact Analysis of the Multi‐classM/M/kPriority Queue with Partial Blocking
This page was built for publication: Pseudo conservation for partially fluid, partially lossy queueing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2283262)
