Related papers: A Specific $M|G|\infty$ Queue System Busy Period a…
We characterize heavy-traffic process and steady-state limits for systems staffed according to the square-root safety rule, when the service requirements of the customers are perfectly correlated with their individual patience for waiting…
The traffic in wireless networks has become diverse and fluctuating both spatially and temporally due to the emergence of new wireless applications and the complexity of scenarios. The purpose of this paper is to quantitatively analyze the…
In this paper, we analyze how well a machine can solve a general problem in queueing theory. To answer this question, we use a deep learning model to predict the stationary queue-length distribution of an $M/G/1$ queue (Poisson arrivals,…
An infinite buffer batch service vacation queue has been studied where service rate of the batch is dependent on the size of the batch and vacation rate is dependent on the queue size at vacation initiation epoch. The arrivals follow the…
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$…
Operators on probability distributions can be expressed as operators on the associated moment sequences, and so correspond to operators on integer sequences. Thus, there is an opportunity to apply each theory to the other. Moreover,…
We study a dynamic scheduling problem for a multi-class queueing network with a large pool of statistically identical servers. The arrival processes are Poisson, and service times and patience times are assumed to be exponentially…
In this paper, we prove the exponential convergence of the non-stationary moment of a random variable that defines the virtual waiting time in the mass service system M\G\1\ $\infty $, where the distribution of the service time satisfies…
In this paper, asymptotic properties of the loss probability are considered for an M/G/1/N queue with server vacations and exhaustive service discipline, denoted by an M/G/1/N -(V, E)-queue. Exact asymptotic rates of the loss probability…
In a financial market, for agents with long investment horizons or at times of severe market stress, it is often changes in the asset price that act as the trigger for transactions or shifts in investment position. This suggests the use of…
We calculate asymptotics of the distribution of the number of customers in orbit in a two-class priority retrial $M/G/1$-type queueing model. In this model, priority customers wait in line while non-priority customers join an orbit and…
We consider a switch operating under the MaxWeight scheduling algorithm, under any traffic pattern such that all the ports are loaded. This system is interesting to study since the queue lengths exhibit a multi-dimensional state-space…
This work studies queues in a Euclidean space. Consider $N$ servers that are distributed uniformly in $[0,1]^d$. Customers arrive at the servers according to independent stationary processes. Upon arrival, they probabilistically decide…
We consider the Erlang A model, or $M/M/m+M$ queue, with Poisson arrivals, exponential service times, and $m$ parallel servers, and the property that waiting customers abandon the queue after an exponential time. The queue length process is…
Queueing systems are widely applicable stochastic models with use cases in communication networks, healthcare, service systems, etc. Although their optimal control has been extensively studied, most existing approaches assume perfect…
In this article statistical bounds for certain output characteristics of the $M/GI/1/n$ and $GI/M/1/n$ loss queueing systems are derived on the basis of large samples of an input characteristic of these systems, such as service time in the…
Recently, Atar and Miyazawa [2] introduced a multi-level GI/G/1 queue with a finite number of levels, where both the arrival and service rates depend on the level corresponding to the current queue length. For this model, they proved that…
We propose in this article a M/G/c/c state dependent queuing model for road traffic flow. The model is based on finite capacity queuing theory which captures the stationary density-flow relationships. It is also inspired from the…
A network of signalized intersections is modeled as a queuing network. The intersections are regulated by fixed-time (FT) controls, all with the same cycle length or period, $T$. Vehicles arrive from outside the network at entry links in a…
Consider the batch-arrival $GI^X/M/c/N$ model with $c$ servers, general inter-arrival batch times, finite buffer, and exponential service times. Inter-arrival batch times, batch sizes, and service times are $i.i.d.$ and independent of each…