Related papers: Waves in a Spatial Queue: Stop-and-Go at Airport S…
Recent studies indicate that in many situations service times are affected by the experienced queueing delay of the particular customer. This effect has been detected in different areas, such as health care, call centers and…
Modern Internet services, such as those at Google, Yahoo!, and Amazon, handle billions of requests per day on clusters of thousands of computers. Because these services operate under strict performance requirements, a statistical…
We analyze the service times of customers in a stable M/M/1 queue in equilibrium depending on their position in a busy period. We give the law of the service of a customer at the beginning, at the end, or in the middle of the busy period.…
We consider a multihop wireless system. There are multiple source-destination pairs. The data from a source may have to pass through multiple nodes. We obtain a channel scheduling policy which can guarantee end-to-end mean delay for the…
In this study, we consider multi-class multi-server asymmetric queueing systems consisting of $N$ queues on one side and $K$ servers on the other side, where jobs randomly arrive in queues at each time. The service rate of each job-server…
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…
Why does a traffic jams form out of nowhere, and why does it stretch for kilometers even after the initial cause is passed? This study examines how congestion moves and spreads across motorways using a surprisingly simple method: response…
We consider the $M/M/1$-PS queue with processor sharing. We study the conditional sojourn time distribution of an arriving customer, conditioned on the number of other customers present. A new formula is obtained for the conditional sojourn…
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…
Stop-and-go waves are commonly observed in traffic and pedestrian flows. In traffic theory they are described by phase transitions of metastable models. The self-organization phenomenon occurs due to inertia mechanisms but requires fine…
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…
Collective movement is observed widely in nature, where individuals interact locally to produce globally ordered, coherent motion. In typical models of collective motion, each individual takes the average direction of multiple neighbors,…
We study the joint control of arrival and service rates in queueing systems with the objective of minimizing long-run expected cost minus revenue. Although the objective function is non-convex, first-order methods have been empirically…
We consider the processor sharing $M/M/1$-PS queue which also models balking. A customer that arrives and sees $n$ others in the system "balks" (i.e., decides not to enter) with probability $1-b_n$. If $b_n$ is inversely proportional to…
Airlines use different boarding policies to organize the queue of passengers waiting to enter the airplane. We analyze three policies in the many-passenger limit by a geometric representation of the queue position and row designation of…
We use Stokesian Dynamics simulations to study the microscopic motion of particles suspended in fluids passing through porous media. We construct model porous media with fixed spherical particles, and allow mobile ones to move through this…
Motivated by a web-server model, we present a queueing network consisting of two layers. The first layer incorporates the arrival of customers at a network of two single-server nodes. We assume that the inter-arrival and the service times…
In this paper, we study scheduling of a queueing system with zero knowledge of instantaneous network conditions. We consider a one-hop single-server queueing system consisting of $K$ queues, each with time-varying and non-stationary arrival…
This article considers execution and analysis of laboratory experiments of pedestrians moving in a quasi-one-dimensional system with periodic boundary conditions. To analyze characteristics of jams in the system we aim to use the whole…
Let $n$ particles move in standard Brownian motion in one dimension, with the process terminating if two particles collide. This is a specific case of Brownian motion constrained to stay inside a Weyl chamber; the Weyl group for this…