Hostname: page-component-54dcc4c588-9xpg2 Total loading time: 0 Render date: 2025-10-01T11:56:11.336Z Has data issue: false hasContentIssue false
  • English
  • Français

Conditional expected sojourn times in insensitive queueing systems and networks

Published online by Cambridge University Press:  01 July 2016

Uwe Jansen
Uwe Jansen*
Affiliation:
Bergakademie Freiberg
*
∗ Postal address: Bergakademie Freiberg, Sektion Mathematik, Bernhard-von-Cotta Str. 2, 92 Freiberg (Sachs.), GDR.
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider queueing systems where the stationary state probabilities are insensitive with respect to the distribution of certain basic random variables such as service requirements, interarrival times, repair times, etc. The conditional expected sojourn times are stated as Radon–Nikodym densities of the stationary distribution at jump points of the queueing system. The conditions are the given values of such basic random variables for which the insensitivity is valid. We use stationary point processes as our main tool. This means that dependences between certain basic random variables are permitted. Conditional expected real service times, conditional mean response times in closed queueing networks, and similar conditional expected values, are dealt with as special cases.

Keywords

INSENSITIVITYMEAN SOJOURN TIMESRADON–NIKODYM DENSITIESSTATIONARY POINT PROCESSES

Information

Type
Research Article
Information
Advances in Applied Probability , Volume 16 , Issue 4 , December 1984 , pp. 906 - 919
Copyright
Copyright © Applied Probability Trust 1984 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Barbour, A. D. (1976) Networks of queues and the method of stages. Adv. Appl. Prob. 8, 584–591.CrossRefGoogle Scholar
Barbour, A. D. (1982) Generalized semi-Markov schemes and open queueing networks. J. Appl. Prob. 19, 469–474.CrossRefGoogle Scholar
Barbour, A. D. and Schassberger, R. (1981) Insensitive average residence time in generalized semi-Markov processes. Adv. Appl. Prob. 13, 846–859.CrossRefGoogle Scholar
Baskett, F., Chandy, K. M., Muntz, R. R. and Palacios, F. G. (1975) Open, closed and mixed networks of queues with different classes of customers. J. Assoc. Comput. Mach. 22, 248–260.CrossRefGoogle Scholar
Chandy, K. M., Howard, J. H. and Towsley, D. F. (1977) Product form and local balance in queueing networks. J. Assoc Comput. Mach. 24, 250–263.CrossRefGoogle Scholar
Franken, P., König, D., Arndt, U. and Schmidt, V. (1981) Queues and Point Processes. Akademie-Verlag, Berlin (Wiley, New York, 1982).Google Scholar
Jansen, U. (1983) A generalization of insensitivity results by cyclically marked stationary point processes. Elektron. Informationsverarb. Kybemet. 19, 307–320.Google Scholar
Jansen, U. and König, D. (1980) Insensitivity and steady-state probabilities in product form for queueing networks. Elektron. Informationsverarb. Kybemet. 16, 385–397.Google Scholar
Jansen, U., König, D. and Nawrotzki, K. (1979) A criterion of insensitivity for a class of queueing systems with random marked point processes. Math. Operationsforsch. Statist., Ser. Optimization 10, 379–404.CrossRefGoogle Scholar
Kelley, F. P. (1979) Reversibility and Stochastic Networks. Wiley, New York.Google Scholar
Kleinrock, L. (1976) Queueing Systems. Vol. 2: Computer Applications. Wiley, New York.Google Scholar
König, D., Matthes, K. and Nawrotzki, K. (1967) Verallgemeinerung der Erlangschen und Engsetschen Formeln (Eine Methode in der Bedienungstheorie). Akademie-Verlag, Berlin.Google Scholar
Rolski, T. (1981) Stationary Random Processes Associated with Point Processes. Lecture Notes in Statistics 5, Springer-Verlag, New York.CrossRefGoogle Scholar