Random Variables Xn Research Articles

Limit theorems for the single server queue with traffic intensity one

We consider a single server queueing system with inter-arrival times {un, n ≧ 1}, and service times {υn, n ≧ 1} and the queue-discipline, ‘first-come, first-served’. It is assumed that {un} and {υn} are two independent renewal processes, and 0 > E(un) =a < ∞, 0 < E(υn) = b < ∞. The traffic intensity is P ρ b/a(0 > ρ > ∞). This paper is concerned with the case ρ = 1, where it is known that the various queueing processes such as the queue-length Q(t) and waiting time W(t) diverge to + ∞ in distribution as t → ∞. Borovkov [1], [2] and Brody [3] have obtained limit distributions for Q(t) and W(t) with appropriate location and scale parameters in the cases P ≧ 1. Here we investigate random variables related to the busy and idle periods in the system. To explain our approach, we consider the random variables Xn = υn – un (n ≧ 1). Let S0 ≡ 0, Sn = X1 + X2 + ··· + Xn (n ≧ 1), and define the sequence {Nk, k ≧ 0} as

Applications of the Theory of Runs to Hydrology

The problem of runs is one of long history among hydrologists. Classically a run is defined as a sequence of observations of the same kind preceded and succeeded by one or more observations of a different kind.Considering a sequence of random variables xn, n = 0, 1, 2,. and choosing a constant x0, one may arbitrarily classify the nth year as a surplus year if xn > x0 and call xn − x0 the surplus. Similarly if xn ≤ x0, the nth year is a deficit year with the deficit x0 − xn [Downer et al., 1967].