Related papers: A two-queue Markovian polling system with two prio…
The model is a "generalized switch", serving multiple traffic flows in discrete time. The switch uses MaxWeight algorithm to make a service decision (scheduling choice) at each time step, which determines the probability distribution of the…
We consider polling models in the sense of Takagi (MIT Press, 1986). In our case, the feature of the server is that it may be forced to wait idly for new messages at an empty queue instead of switching to the next station. We propose four…
We are interested in a large queue in a $GI/G/k$ queue with heterogeneous servers. For this, we consider tail asymptotics and weak limit approximations for the stationary distribution of its queue length process in continuous time under a…
We consider the $\Delta_{(i)}/G/1$ queue, in which a a total of $n$ customers independently demand service after an exponential time. We focus on the case of heavy-tailed service times, and assume that the tail of the service time…
Let $X$ be the constrained random walk on ${\mathbb Z}_+^2$ with increments $(1,0)$, $(-1,0)$, $(0,1)$ and $(0,-1)$; $X$ represents, at arrivals and service completions, the lengths of two queues working in parallel whose service and…
We introduce the prioritising exclusion process, a stochastic scheduling mechanism for a priority queueing system in which high priority customers gain advantage by overtaking low priority customers. The model is analogous to a totally…
Delay or queue length information has the potential to influence the decision of a customer to use a service system. Thus, it is imperative for service system managers to understand how the information that they provide will affect the…
We study multiclass many-server queues for which the arrival, service and abandonment rates are all modulated by a common finite-state Markov process. We assume that the system operates in the "averaged" Halfin-Whitt regime, which means…
The shortest-remaining-processing-time (SRPT) scheduling policy has been extensively studied, for more than 50 years, in single-server queues with infinitely patient jobs. Yet, much less is known about its performance in multiserver queues.…
Tandem queueing networks are widely used to model systems where services are provided in sequential stages. In this study, we assume that each station in the tandem system operates under a general renewal process. Additionally, we assume…
Quantum computing is revolutionizing various fields, including operations research and queueing theory. This study presents a quantum method for simulating single-server Markovian (M/M/1) queues, making quantum computing more accessible to…
The main target of this paper is to present the Markov chain C that, not giving explicitly the queue lengths stationary probabilities, has the necessary information to its determination for open networks of queues with several classes of…
In many important real-world queueing settings, arrival and service rates fluctuate over time. We consider the MAMS system, where the arrival and service rates each vary according to an arbitrary finite-state Markov chain, allowing…
After a short report of results on infinite servers queues systems, focusing on its busy period, using networks of queues with infinite servers nodes a model is constructed to study a two echelons repair system. These repair systems may be…
Till today we dreamt of imperceptible delay in a network. The computer science research grows today faster than ever offering more and more services (computational representational, graphical, intelligent implication etc) to its user. But…
Amid unprecedented times caused by COVID-19, healthcare systems all over the world are strained to the limits of, or even beyond, capacity. A similar event is experienced by some healthcare systems regularly, due to for instance seasonal…
We revisit a single-server retrial queue with two independent Poisson streams (corresponding to two types of customers) and two orbits. The size of each orbit is infinite. The exponential server (with a rate independent of the type of…
This paper considers a work-conserving FIFO single-server queue with multiple batch Markovian arrival streams governed by a continuous-time finite-state Markov chain. A particular feature of this queue is that service time distributions of…
We study a vacation-type queueing model, and a single-server multi-queue polling model, with the special feature of retrials. Just before the server arrives at a station there is some deterministic glue period. Customers (both new arrivals…
We present an analysis of large-scale load balancing systems, where the processing time distribution of tasks depends on both the task and server types. Our study focuses on the asymptotic regime, where the number of servers and task types…