Abstract
We introduce a new class of queueing networks in which customers are either ‘negative' or ‘positive'. A negative customer arriving to a queue reduces the total customer count in that queue by 1 if the queue length is positive; it has no effect at all if the queue length is empty. Negative customers do not receive service. Customers leaving a queue for another one can either become negative or remain positive. Positive customers behave as ordinary queueing network customers and receive service. We show that this model with exponential service times, Poisson external arrivals, with the usual independence assumptions for service times, and Markovian customer movements between queues, has product form. It is quasi-reversible in the usual sense, but not in a broader sense which includes all destructions of customers in the set of departures. The existence and uniqueness of the solutions to the (nonlinear) customer flow equations, and hence of the product form solution, is discussed.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Cited by
62 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A MODEL OF REGIONAL ENERGY SUPPLY SYSTEMS BASED ON SPECIALIZED QUEUEING SYSTEMS;Vestnik of M. Kozybayev North Kazakhstan University;2024-06-27
2. IoT-Fog Computing Sustainable System for Smart Cities: A Queueing-based Approach;2023 1st International Conference on Advanced Innovations in Smart Cities (ICAISC);2023-01-23
3. Queueing Models;Networking and Computation;2020
4. Whittle networks with resets;Proceedings of the 11th EAI International Conference on Performance Evaluation Methodologies and Tools;2017-12-05
5. MX/M/c Queue with catastrophes and state-dependent control at idle time;Frontiers of Mathematics in China;2017-11-12