No CrossRef data available.
Article contents
THE TIME-TO-EMPTY FOR TANDEM JACKSON NETWORKS
Published online by Cambridge University Press: 01 October 2004
Abstract
We derive the distribution of the time-to-empty for an open tandem Jackson network assuming that while in equilibrium at time 0, the arrival stream is suddenly shut off. The analysis is based on analogous results regarding the distribution of the time-to-empty for the corresponding closed tandem Jackson network. The results obtained are used in the analysis of a two-class tandem Jackson network with FIFO discipline in which customers of the second class have negligible service times.
- Type
- Research Article
- Information
- Probability in the Engineering and Informational Sciences , Volume 18 , Issue 4 , October 2004 , pp. 493 - 502
- Copyright
- © 2004 Cambridge University Press
References
REFERENCES
Bertsimas, D. &
Nakazato, D.
(1995).
The distributional Little's Law and its applications.
Operations Research
43:
298–310.Google Scholar
Brémaud, P.,
Kanurpatti, R., &
Mazumdar, R.
(1992).
Event and time averages: A review.
Advances in Applied Probability
24:
377–411.Google Scholar
Haji, R. &
Newell, G.F.
(1971).
A relation between stationary queue and waiting–time
distributions.
Journal of Applied Probability
8:
617–620.Google Scholar
Keilson, J. &
Servi, L.D.
(1988).
A distributional form of Little's law.
Operations Research Letters
7:
223–227.Google Scholar
Lavenerg, S.S. &
Reiser, M.
(1980).
Stationary state probabilities at arrival instants for closed
queueing networks with multiple types of customers.
Journal of Applied Probability
17:
1048–1061.Google Scholar
Sevcik, K.C. &
Mitrani, I.
(1981).
The distribution of queueing network states at input and output
instants.
Journal of the Association for Computing Machines
28:
358–371.Google Scholar
Walrand, J.
(1988).
An introduction to queueing networks.
Englewood Cliffs, NJ:
Prentice-Hall.
Zazanis, M.A.
(1997).
Formulas and representations for cyclic Markovian networks via
Palm calculus.
Queueing Systems
26(1–2):
151–167.Google Scholar
Zazanis, M.A.
(1998).
Functional versions of Little's law.
Stochastic Processes and Their Applications
74(2):
195–201.Google Scholar
Zazanis, M.A.
(2004).
Cycle times in single server cyclic Jackson networks.
Operations Research Letters
32(5):
422–430.Google Scholar