Related papers: On {\em BASTA} for Discrete-Time Queues
We give a simple derivation of the distribution of the maximum L of the length of the queue during a busy period for the M/M/1 queue with lambda<1 the ratio between arrival rate and service rate. We observe that the asymptotic behavior of…
In discrete time, customers arrive at random. Each waits until one of two servers is available; each thereafter departs at random. We seek the distribution of maximum line length of idle customers. In the context of an emergency room (for…
We develop theoretical foundations and practical algorithms for vehicle routing with time-dependent travel times. We also provide new benchmark instances and experimental results. First, we study basic operations on piecewise linear arrival…
Consider the problem of a multiple access channel in a time dependent environment with a large number of users. In such a system, mostly due to practical constraints (e.g., decoding complexity), not all users can be scheduled together, and…
The notion of delays arises naturally in many computational models, such as, in the design of circuits, control systems, and dataflow languages. In this work, we introduce \emph{automata with delay blocks} (ADBs), extending finite state…
Kingman has shown, under very weak conditions on the interarrival- and sevice-time distributions, that First-Come-First-Served minimizes the variance of the waiting time among possible service disciplines. We show, under the same…
Based on the principle that arrival time and position are simultaneously measurable quantities a simple formula is derived for the arrival time probability density in nonrelativistic quantum theory.
In a batch of synchronized queues, customers can only be serviced all at once or not at all, implying that service remains idle if at least one queue is empty. We propose that a batch of $n$ synchronized queues in a discrete-time setting is…
In recent years it was shown both theoretically and experimentally that in certain systems exhibiting anomalous diffusion the time and ensemble average mean squared displacement are remarkably different. The ensemble average diffusivity is…
Traffic state estimation plays an important role in facilitating effective traffic management. This study develops a combinatorial approach for nonparametric short-term queue length estimation in terms of cycle-by-cycle partially observed…
We revisit the arguments underlying two well-known arrival-time distributions in quantum mechanics, viz., the Aharonov-Bohm and Kijowski (ABK) distribution, applicable for freely moving particles, and the quantum flux (QF) distribution. An…
We study a double-ended queue which consists of two classes of customers. Whenever there is a pair of customers from both classes, they are matched and leave the system immediately. The matching follows first-come-first-serve principle. If…
We consider a simple mean reverting diffusion process, with piecewise constant drift and diffusion coefficients, discontinuous at a fixed threshold. We discuss estimation of drift and diffusion parameters from discrete observations of the…
It is known that Lorentz covariance fixes uniquely the current and the associated guidance law in the trajectory interpretation of quantum mechanics for spin-1/2 particles. In the nonrelativistic domain this implies a guidance law for…
We consider the FCFS $GI/GI/n$ queue in the Halfin-Whitt heavy traffic regime, and prove bounds for the steady-state probability of delay (s.s.p.d.) for generally distributed processing times. We prove that there exist $\epsilon_1,…
In this paper we solve a particular stochastic recursion in the stationary ergodic framework, and propose some applications of this result to the study of regenerativity (that is, finiteness of busy cycles) and stationarity of some queueing…
We propose a covariant algorithm for relativistic ideal measurements and for relativistic continuous measurements, its non-relativistic limit results the algorithm of the Event-Enhanced Quantum Theory. Therefore an additional intrinsic…
Convergence is proved for solutions of Dirichlet problems in regions with many small excluded sets (holes), as the holes become smaller and more numerous. The problem is formulated in the context of Markov processes associated with general…
When the arrival processes are Poisson, queueing networks are well-understood in terms of the product-form structure of the number of jobs $N_i$ at the individual queues; much less is known about the waiting time $W$ across the whole…
We consider the number distribution of topological defects resulting from the finite-time crossing of a continuous phase transition and identify signatures of universality beyond the mean value, predicted by the Kibble-Zurek mechanism.…