Residual time

From testwiki
Revision as of 06:52, 17 September 2023 by imported>Fgnievinski (removed Category:Time; added Category:Durations using HotCat)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

In the theory of renewal processes, a part of the mathematical theory of probability, the residual time or the forward recurrence time is the time between any given time t and the next epoch of the renewal process under consideration. In the context of random walks, it is also known as overshoot. Another way to phrase residual time is "how much more time is there to wait?".

The residual time is very important in most of the practical applications of renewal processes:

  • In queueing theory, it determines the remaining time, that a newly arriving customer to a non-empty queue has to wait until being served.[1]
  • In wireless networking, it determines, for example, the remaining lifetime of a wireless link on arrival of a new packet.
  • In dependability studies, it models the remaining lifetime of a component.
  • etc.

Formal definition

Sample evolution of a renewal process with holding times Si and jump times Jn.

Consider a renewal process {N(t),t0}, with holding times Si and jump times (or renewal epochs) Ji, and i. The holding times Si are non-negative, independent, identically distributed random variables and the renewal process is defined as N(t)=sup{n:Jnt}. Then, to a given time t, there corresponds uniquely an N(t), such that:

JN(t)t<JN(t)+1.

The residual time (or excess time) is given by the time Y(t) from t to the next renewal epoch.

Y(t)=JN(t)+1t.

Probability distribution of the residual time

Let the cumulative distribution function of the holding times Si be F(t)=Pr[Sit] and recall that the renewal function of a process is m(t)=𝔼[N(t)]. Then, for a given time t, the cumulative distribution function of Y(t) is calculated as:[2]

Φ(x,t)=Pr[Y(t)x]=F(t+x)0t[1F(t+xy)]dm(y)

Differentiating with respect to x, the probability density function can be written as

ϕ(x,t)=f(t+x)+0tf(u+x)m(tu)du,

where we have substituted u=ty. From elementary renewal theory, m(t)1/μ as t, where μ is the mean of the distribution F. If we consider the limiting distribution as t, assuming that f(t)0 as t, we have the limiting pdf as

ϕ(x)=1μ0f(u+x)du=1μxf(v)dv=1F(x)μ.

Likewise, the cumulative distribution of the residual time is

Φ(x)=1μ0x[1F(u)]du.

For large t, the distribution is independent of t, making it a stationary distribution. An interesting fact is that the limiting distribution of forward recurrence time (or residual time) has the same form as the limiting distribution of the backward recurrence time (or age). This distribution is always J-shaped, with mode at zero.

The first two moments of this limiting distribution Φ are:

E[Y]=μ22μ=μ2+σ22μ,
E[Y2]=μ33μ,

where σ2 is the variance of F and μ2 and μ3 are its second and third moments.

Waiting time paradox

The fact that E[Y]=μ2+σ22μ>μ2 (for σ>0) is also known variously as the waiting time paradox, inspection paradox, or the paradox of renewal theory. The paradox arises from the fact that the average waiting time until the next renewal, assuming that the reference time point t is uniform randomly selected within the inter-renewal interval, is larger than the average inter-renewal interval μ2. The average waiting is E[Y]=μ2 only when σ2=0, that is when the renewals are always punctual or deterministic.

Special case: Markovian holding times

When the holding times Si are exponentially distributed with F(t)=1eλt, the residual times are also exponentially distributed. That is because m(t)=λt and:

Pr[Y(t)x]=[1eλ(t+x)]0t[11+eλ(t+xy)]d(λy)=1eλx.

This is a known characteristic of the exponential distribution, i.e., its memoryless property. Intuitively, this means that it does not matter how long it has been since the last renewal epoch, the remaining time is still probabilistically the same as in the beginning of the holding time interval.

Renewal theory texts usually also define the spent time or the backward recurrence time (or the current lifetime) as Z(t)=tJN(t). Its distribution can be calculated in a similar way to that of the residual time. Likewise, the total life time is the sum of backward recurrence time and forward recurrence time.

References

Template:Reflist

  1. William J. Stewart, "Probability, Markov Chains, Queues, and Simulation: The Mathematical Basis of Performance Modeling", Princeton University Press, 2011, Template:ISBN, 9781400832811
  2. Jyotiprasad Medhi, "Stochastic processes", New Age International, 1994, Template:ISBN, 9788122405491