A Token-Based Central Queue with Order-Independent Service Rates
From MaRDI portal
Abstract: We study a token-based central queue with multiple customer types. Customers of each type arrive according to a Poisson process and have an associated set of compatible tokens. Customers may only receive service when they have claimed a compatible token. If upon arrival, more than one compatible token is available, an assignment rule determines which token will be claimed. The service rate obtained by a customer is state-dependent, i.e., it depends on the set of claimed tokens and on the number of customers in the system. Our first main result shows that, provided the assignment rule and the service rates satisfy certain conditions, the steady-state distribution has a product form. We show that our model subsumes known families of models that have product-form steady-state distributions including the order-independent queue of Krzesinski (2011) and the model of Visschers et al. (2012). Our second main contribution involves the derivation of expressions for relevant performance measures such as the sojourn time and the number of customers present in the system. We apply our framework to relevant models, including an M/M/K queue with heterogeneous service rates, the MSCCC queue, multi-server models with redundancy and matching models. For some of these models, we present expressions for performance measures that have not been derived before.
Recommendations
- A token based parallel processing queueing system with priority
- A unifying service discipline for providing rate-based guaranteed and fair queuing services based on the Timed Token protocol
- An \(M/M/c\) queue with queueing-time dependent service rates
- A tollbooth tandem queue with heterogeneous servers
- Queues with workload-dependent arrival and service rates
- Queueing systems with random service rate
- A general input queue with N policy and service rate depending on bulk size
- A comparison of stochastically ordered queues
- \(\mathrm{M/M/1}\) queue with controllable service rate
Cites work
- A product form solution to a system with multi-type jobs and multi-type servers
- A REVERSIBLE ERLANG LOSS SYSTEM WITH MULTITYPE CUSTOMERS AND MULTITYPE SERVERS
- A skill based parallel service system under FCFS-ALIS -- steady state, overloads, and abandonments
- scientific article; zbMATH DE number 3656855 (Why is no real title available?)
- Networks with customers, signals, and product form solutions
- On the Stochastic Matrices Associated with Certain Queuing Processes
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Order independent queues
- Queueing with redundant requests: exact analysis
- Redundancy-\(\mathbf{d}\): the power of \(\mathbf{d}\) choices for redundancy
- Reversibility and further properties of FCFS infinite bipartite matching
- The distributional form of Little's law and the Fuhrmann-Cooper decomposition
- Waiting Lines with Heterogeneous Servers
Cited in
(7)- Redundancy scheduling with scaled Bernoulli service requirements
- A token based parallel processing queueing system with priority
- Stability regions of systems with compatibilities and ubiquitous measures on graphs
- Editorial introduction: Special issue on product forms, stochastic matching, and redundancy
- Editorial introduction: second part of the special issue on product forms, stochastic matching, and redundancy
- New directions in pass-and-swap queues
- Graph-based product form
This page was built for publication: A Token-Based Central Queue with Order-Independent Service Rates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5031028)
