Pseudo conservation for partially fluid, partially lossy queueing systems

<a class="pub-badge pub-badge--doi" href="https://doi.org/10.1007/S10479-018-2780-8" rel="nofollow">DOI 10.1007/S10479-018-2780-8</a><a class="pub-badge pub-badge--grey" href="https://zbmath.org/1427.90092" rel="nofollow">zbMATH</a><a class="pub-badge pub-badge--grey" href="https://openalex.org/works/W2794347361" rel="nofollow">OpenAlex</a><a class="pub-badge pub-badge--mardi" href="https://portal.mardi4nfdi.de/wiki/Item:Q2283262" rel="nofollow">MaRDI QID Q2283262</a><a class="pub-badge pub-badge--grey" href="https://fdo.portal.mardi4nfdi.de/fdo/Q2283262" rel="nofollow">FDO</a>

Authors 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

zbMATH Keywords

balkingrenegingfluid limitsloss systemsmulticlass queuesheterogeneous queuesachievable regioncomplete policiespseudo-conservation

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

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

Cites work

• scientific article; zbMATH DE number 3174015 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• scientific article; zbMATH DE number 3255204 (Why is no real title available?)
• M/G/c Queueing Systems with Multiple Customer Classes: Characterization and Control of Achievable Performance Under Nonpreemptive Priority Rules
• A Characterization of Waiting Time Performance Realizable by Single-Server Queues
• A conservation law for a wide class of queueing disciplines
• A delay dependent queue discipline
• A polling model with an autonomous server
• An Exact Analysis of the Multi‐classM/M/kPriority Queue with Partial Blocking
• Complete parameterized families of job scheduling strategies
• Improving service by informing customers about anticipated delays
• Markov chains and stochastic stability
• Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control
• On queues with Markov modulated service rates
• Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance
• Performance modeling and design of computer systems. Queueing theory in action
• Queuing with preemptive priorities or with breakdown
• Renewal theory and computable convergence rates for geometrically erdgodic Markov chains
• Some Queuing Problems with Balking and Reneging—II
• Stochastic orders

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)