Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA token-based central queue with order-independent service rates
126
0
0.0
(
0
)
Added by
Jan-Pieter Dorsman
Publication date
2019
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic 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.
rate research
Read More
We discuss a single-server multi-station alternating queue where the preparation times and the service times are auto- and cross-correlated. We examine two cases. In the first case, preparation and service times depend on a common discrete time Markov chain. In the second case, we assume that the service times depend on the previous preparation time through their joint Laplace transform. The waiting time process is directly analysed by solving a Lindley-type equation via transform methods. Numerical examples are included to demonstrate the effect of the autocorrelation of and the cross-correlation between the preparation and service times.
We consider a service system with two Poisson arrival queues. A server chooses which queue to serve at each moment. Once a queue is served, all the customers will be served within a fixed amount of time. This model is useful in studying airport shuttling or certain online computing systems. We propose a simple yet optimal state-independent policy for this problem which is not only easy to implement, but also performs very well.
We study a generalization of the $M/G/1$ system (denoted by $rM/G/1$) with independent and identically distributed (iid) service times and with an arrival process whose arrival rate $lambda_0f(r)$ depends on the remaining service time $r$ of the current customer being served. We derive a natural stability condition and provide a stationary analysis under it both at service completion times (of the queue length process) and in continuous time (of the queue length and the residual service time). In particular, we show that the stationary measure of queue length at service completion times is equal to that of a corresponding $M/G/1$ system. For $f > 0$ we show that the continuous time stationary measure of the $rM/G/1$ system is linked to the $M/G/1$ system via a time change. As opposed to the $M/G/1$ queue, the stationary measure of queue length of the $rM/G/1$ system at service completions differs from its marginal distribution under the continuous time stationary measure. Thus, in general, arrivals of the $rM/G/1$ system do not see time averages. We derive formulas for the average queue length, probability of an empty system and average waiting time under the continuous time stationary measure. We provide examples showing the effect of changing the reshaping function on the average waiting time.
We consider a model describing the waiting time of a server alternating between two service points. This model is described by a Lindley-type equation. We are interested in the time-dependent behaviour of this system and derive explicit expressions for its time-dependent waiting-time distribution, the correlation between waiting times, and the distribution of the cycle length. Since our model is closely related to Lindleys recursion, we compare our results to those derived for Lindleys recursion.
In this paper, we study an $N$ server fork-join queue with nearly deterministic arrival and service times. Specifically, we present a fluid limit for the maximum queue length as $Ntoinfty$. This fluid limit depends on the initial number of tasks. In order to prove these results, we develop extreme value theory and diffusion approximations for the queue lengths.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
