Related papers: A restless time-fractional multiclass queue
A non-homogeneous Poisson cluster model is studied, motivated by insurance applications. The Poisson center process which expresses arrival times of claims, triggers off cluster member processes which correspond to number or amount of…
A queueing model has $J\ge2$ heterogeneous service stations, each consisting of many independent servers with identical capabilities. Customers of $I\ge2$ classes can be served at these stations at different rates, that depend on both the…
The Join-the-Shortest-Queue routing policy is studied in an asymptotic regime where the number of processors $n$ scales with the arrival rate. A large deviation principle (LDP) for the occupancy process is established, as $n\to \infty$, in…
We investigate joint temporal and contemporaneous aggregation of N independent copies of strictly stationary INteger-valued AutoRegressive processes of order 1 (INAR(1)) with random coefficient $\alpha\in(0,1)$ and with idiosyncratic…
Networks-on-chip (NoCs) have become the standard for interconnect solutions in industrial designs ranging from client CPUs to many-core chip-multiprocessors. Since NoCs play a vital role in system performance and power consumption,…
In this article it is shown that if the busy period of a MGinf queue system is PME distributed, the service time is a random variable with a long tail distribution. The result is obtained through Laplace transforms analysis.
In this paper, we exploit results obtained in an earlier study for the Laplace transform of the sojourn time $\Omega$ of an entire batch in the $M^{[X]}/M/1$ Processor Sharing (PS) queue in order to derive the asymptotic behavior of the…
We consider a single-server queue where interarrival and service times depend linearly and randomly on customer waiting times, and establish a sample-path moderate deviation principle (MDP) for the waiting time process. The waiting times…
We consider a novel queuing problem where the decision-maker must choose to accept or reject randomly arriving tasks into a no buffer queue which are processed by $N$ identical servers. Each task has a price, which is a positive real…
The single server queue with multiple customer types and semi-Markovian service times, sometimes referred to as the $M/SM/1$ queue, has been well-studied since its introduction by Neuts in 1966. In this paper, we apply an extension of this…
This paper introduces and analyzes the notion of throughput suboptimality for many-server queueing systems in heavy traffic. The queueing model under consideration has multiple customer classes, indexed by a finite set $\mathcal{I}$, and…
This paper studies a single server queue in heavy traffic, with general inter-arrival and service time distributions, where arrival and service rates vary discontinuously as a function of the (diffusively scaled) queue length. It is proved…
In this work, we study the stationary distribution of the scaled queue length vector process in multiclass queueing networks operating under static buffer priority service policies. We establish that when subjected to a multi-scale heavy…
A simple analytical solution is proposed for the stationary loss system of two parallel queues with finite capacity $K$, in which new customers join the shortest queue, or one of the two with equal probability if their lengths are equal.…
This paper examines a discrete-time queuing system with applications to telecommunications traffic. The arrival process is a particular Markov modulated process which belongs to the class of discrete batched Markovian arrival processes. The…
We study the process of suitably normalized successive return times to rare events in the setting of infinite-measure preserving dynamical systems. Specifically, we consider small neighborhoods of points whose measure tends to zero. We…
We investigate a processor sharing queue with renewal arrivals and generally distributed service times. Impatient jobs may abandon the queue, or renege, before completing service. The corresponding stochastic processes are represented by…
We study the problem of strategic choice of arrival time to a single-server queue with opening and closing times when there is uncertainty regarding service speed. A Poisson population of customers choose their arrival time with the goal of…
We study the performance of random linear network coding for time division duplexing channels with Poisson arrivals. We model the system as a bulk-service queue with variable bulk size. A full characterization for random linear network…
We consider a horizontal traffic queue (HTQ) on a periodic road segment, where vehicles arrive according to a spatio-temporal Poisson process, and depart after traveling a distance that is sampled independently and identically from a…