= Poisson arrivals see time averages
{c}
{wiki}
= PASTA
{c}
{synonym}
<Poisson arrivals see time averages> says that an exogenous, homogeneous <Poisson process> samples prearrival states with the same long-run frequencies as observation over time, provided the observed system cannot anticipate future arrivals and the relevant time averages exist. The system may depend on all past arrivals: an ordinary <queue> does. The required <independence> is between future increments of the <Poisson process> and the history available to the system, including its service information. Assume measurable state observations with ordinary <piecewise continuous functions> as <sample paths>; write $X(t-)$ for the state immediately before time $t$.
For a state set $B$, let $A(T)$ count offered arrivals by time $T$ and let $t_k$ be their times. With a positive finite constant arrival rate, the <PASTA> equality is
$$
\lim_{T\to\infty}\frac{1}{A(T)}\sum_{k:t_k\leq T}\mathbf 1_{\{X(t_k-)\in B\}}
=\lim_{T\to\infty}\frac1T\int_0^T\mathbf 1_{\{X(t)\in B\}}\,dt,
$$
almost surely when the time limit exists. The <indicator functions> count visits on the left and time spent on the right. For a <stationary process> with <ergodicity>, the right side is the stationary <probability> of $B$. It matters that the arriving customer has not yet changed the observed state.
In the <M M 1 utilization and delay> example, <server utilization> is $0.8$. Thus <PASTA> says that 80 percent of offered arrivals find the server busy and 20 percent find the whole <queue> empty. If an offered arrival seeing population $n$ is admitted with <conditional probability> $p(n)$, using fresh randomness independent of that state, the accepted fraction is $\sum_n\pi_np(n)$, where $\pi$ is the <stationary distribution>. Multiplying this fraction by the offered rate gives the admitted <queue throughput> when every admitted customer eventually completes service. Accepted arrivals are selected by state and need not themselves form a <Poisson process> or see the unconditioned time frequencies.
Arbitrary arrivals need not see time averages. Suppose a customer arrives every two minutes and its <service time> is exactly one minute, with one server and no other customers. The server is busy half the time, but every arrival finds it idle. A uniformly random initial phase can even make the occupancy a <stationary process>, without repairing the disagreement. Nevertheless <Little's law> still gives $L=(1/2)\cdot1=1/2$, with rate measured in customers per minute. This separates <Little's law> from <PASTA>.
Ronald W. Wolff's 1982 paper gave a general <PASTA> theorem under nonanticipation, rather than requiring the observed system to be independent of its driving <Poisson process>. Its Theorem 1 compares the two long-run fractions; stationarity is a way to establish convergence, not the central sampling condition. https://pubsonline.informs.org/doi/10.1287/opre.30.2.223[Wolff, Poisson Arrivals See Time Averages, Operations Research 30(2), 223-231]{ref}. https://www.math.purdue.edu/~peterson/Teaching/532/PASTA.pdf[Original paper, section 1 and Theorem 1]{ref}.
Back to article page