Related papers: Queuing for an infinite bus line and aging branchi…
We study randomized experiments in a service system when stochastic congestion can arise from temporarily limited supply or excess demand. Such congestion gives rise to cross-unit interference between the waiting customers, and analytic…
Giving customers queue length information about a service system has the potential to influence the decision of a customer to join a queue. Thus, it is imperative for managers of queueing systems to understand how the information that they…
The paper studies a multiserver retrial queueing system with $m$ servers. Arrival process is a point process with strictly stationary and ergodic increments. A customer arriving to the system occupies one of the free servers. If upon…
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 a discrete time queueing system where deterministic arrivals have i.i.d. exponential delays $\xi_{i}$. The standard deviation $\sigma$ of the delay is finite, but its value is much larger than the deterministic unit service time.…
We analyze the behavior of closed product-form queueing networks when the number of customers grows to infinity and remains proportionate on each route (or class). First, we focus on the stationary behavior and prove the conjecture that the…
A common assumption when modeling queuing systems is that arrivals behave like a Poisson process with constant parameter. In practice, however, call arrivals are often observed to be significantly overdispersed. This motivates that in this…
In networks with intermittent connectivity, such as mobile, aerial, and space systems, maintaining information freshness is complicated by time-varying arrivals, service disruptions, and interactions among traffic classes with different…
In this paper we consider a single-server, cyclic polling system with switch-over times. A distinguishing feature of the model is that the rates of the Poisson arrival processes at the various queues depend on the server location. For this…
We consider multi-component matching systems in heavy traffic consisting of $K\geq 2$ distinct perishable components which arrive randomly over time at high speed at the assemble-to-order station, and they wait in their respective queues…
We consider a stochastic, dynamic job scheduling problem, formulated as a queueing control problem, in which a single server processes jobs of different types that arrive according to independent Poisson processes. The problem is defined on…
In urban settings, bus transit stands as a significant mode of public transportation, yet faces hurdles in delivering accurate and reliable arrival times. This discrepancy often culminates in delays and a decline in ridership, particularly…
We consider a single server queue that serves a finite population of $n$ customers that will enter the queue (require service) only once, also known as the $\Delta_{(i)}/G/1$ queue. This paper presents a method for analyzing heavy-traffic…
We consider a class of density-dependent branching processes which generalises exponential, logistic and Gompertz growth. A population begins with a single individual, grows exponentially initially, and then growth may slow down as the…
A new public conveyance model applicable to buses and trains is proposed in this paper by using stochastic cellular automaton. We have found the optimal density of vehicles, at which the average velocity becomes maximum, significantly…
A source submits status updates to a network for delivery to a destination monitor. Updates follow a route through a series of network nodes. Each node is a last-come-first-served queue supporting preemption in service. We characterize the…
We consider the problem of customer equilibrium behavior of a single server Markovian queue with dynamic control of the service rate. Customers arrive according a Poisson procedure and the system administrator makes a service rate choice…
In this paper, we consider the number of both arrivals and departures seen by a tagged customer while in service in a classical $M/M/1$ processor sharing queue. By exploiting the underlying orthogonal structure of this queuing system…
There are $n$ queues, each with a single server. Customers arrive in a Poisson process at rate $\lambda n$, where $0<\lambda<1$. Upon arrival each customer selects $d\geq2$ servers uniformly at random, and joins the queue at a least-loaded…
In this paper we study asymptotic behaviour of a growth process generated by a semi-deterministic variant of cooperative sequential adsorption model (CSA). This model can also be viewed as a particular queueing system with local…