1985
DOI: 10.1080/15326348508807001
|View full text |Cite
|
Sign up to set email alerts
|

The relaxation time of two queueing systems in series

Abstract: This paper deals with the time-dependent behaviour of two queueing systems in series, the simplest example of a Jackson network. The Laplace transform of the probability p 0(t) that the tandem system is empty at time t is obtained by reducing the functional equation for the generating function of the joint queue length distribution to a Riemann-Hilbert boundary value problem. From this Laplace transform the relaxation time of p 0(t) is determined for all cases, and the first term of the asymptotic expansion of… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

2
36
0

Year Published

1987
1987
2012
2012

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 36 publications
(38 citation statements)
references
References 9 publications
2
36
0
Order By: Relevance
“…Since, as we will show, the integral (1) can be evaluated explicitly in terms of the birth and death rates of X it may be an attractive alternative to r(X ) as a one-parameter characterization of the speed of convergence. Rather than (1), however, we propose its normalized…”
Section: E(x(t))mentioning
confidence: 99%
See 1 more Smart Citation
“…Since, as we will show, the integral (1) can be evaluated explicitly in terms of the birth and death rates of X it may be an attractive alternative to r(X ) as a one-parameter characterization of the speed of convergence. Rather than (1), however, we propose its normalized…”
Section: E(x(t))mentioning
confidence: 99%
“…(which is independent of j), or its reciprocal r(X ) ≡ 1/γ(X ), the relaxation time (see, for example, [1] and [12]). If M ≡ lim t→∞ E(X(t)) < ∞ we also have…”
Section: E(x(t))mentioning
confidence: 99%
“…For this problemθ is real, so that −θ = r(β, η). Our definition of the relaxation time in (7) assumes the initial condition p(x, 0) = δ(x − x 0 ) in (4), and then the approach to equilibrium is governed by λ 1 = r. But we could certainly have initial conditions that would lead to a faster approach. For example, if p(x, 0) = p(x, ∞) then p(x, t) = p(x, ∞) for all t and equilibrium is attained instantaneously.…”
mentioning
confidence: 99%
“…Main results. The diffusion process (X(t)) t≥0 is a Markov process on the real line with continuous paths and density p = p(x, t) = p(x, t; x 0 ; β, η) that satisfies the forward Kolmogorov equation p(x, 0) = δ(x − x 0 ), (4) p(0 + , t) = p(0 − , t), p x (0 + , t) = p x (0 − , t), (5) and p(x, t) must decay as x → ±∞. The limiting distribution of the diffusion process is (see [15]) (6) p(x, ∞; x 0 ; β, η) = C e − 1 2 ηx 2 e −βx , x > 0, e − 1 2 x 2 e −βx , x < 0, where C −1 = ∞ 0 e − 1 2 ηx 2 e −βx dx + 0 −∞ e − 1 2 x 2 e −βx dx.…”
mentioning
confidence: 99%
See 1 more Smart Citation