Abstract
Using stochastic dominance, in this paper we provide a new characterization of point processes. This characterization leads to a unified proof for various stability results of open Jackson networks where service times are i.i.d. with a general distribution, external interarrivai times are i.i.d. with a general distribution and the routing is Bernoulli. We show that if the traffic condition is satisfied, i.e., the input rate is smaller than the service rate at each queue, then the queue length process (the number of customers at each queue) is tight. Under the traffic condition, the pth moment of the queue length process is bounded for allt if the p+lth moment of the service times at all queues are finite. If, furthermore, the moment generating functions of the service times at all queues exist, then all the moments of the queue length process are bounded for allt. When the interarrivai times are unbounded and non-lattice (resp. spreadout), the queue lengths and the remaining service times converge in distribution (resp. in total variation) to a steady state. Also, the moments converge if the corresponding moment conditions are satisfied.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Asmussen,Applied Probability and Queues (Wiley, New York, 1987).
A.A. Borovkov,Stochastic Processes in Queueing Theory (Springer, New York, 1976).
A.A. Borovkov, Limit theorems for queueing networks. I, Theory Prob. Appl. 31 (1986) 413–427.
C.S. Chang, Stability, queue length and delay, Part I: Deterministic queueing networks,IEEE Conf. on Decision and Control, Vol. 1 (1992) pp. 999–1004.
C.S. Chang, Stability, queue length and delay, Part II: Stochastic queueing networks,IEEE Conf. on Decision and Control, Vol. 1 (1992) pp. 1005–1010.
Y.S. Chow and H. Teicher,Probability Theory: Independence, Inter changeability, Martingales (Springer, New York, 1988).
T.M. Cover and J.A. Thomas,Elements of Information Theory (Wiley, New York, 1991).
R.L. Cruz, A calculus for network delay, Part I: Network elements in isolation, IEEE Trans. Inform. Theory 37 (1991) 114–131.
R.L. Cruz, A calculus for network delay, Part II: Network analysis, IEEE Trans. Inform. Theory 37 (1991) 132–141.
D.J. Daley and T. Rolski, Finiteness of waiting-time moments in general stationary single-server queues, Ann. Appl. Prob. (1992).
D.J. Daley and D. Vere-Jones,An Introduction to the Theory of Point Processes (Springer, New York, 1988).
S.G. Foss, Some properties of open queueing networks, Problems Inform. Transmission 25 (1989) 241–246.
S.G. Foss, Ergodicity of queueing networks, Sibirskij Matematicheskij Ghurnal [Siberian Math. J.] 32 (4) (1991) 183–202 (inRussian). Translated in 1992.
B. Hajek, Hitting-time and occupation-time bounds implied by drift analysis with applications, Adv. Appl. Prob. (1982) 502–525.
T. Kamae, U. Krengel and G.L. O'Brien, Stochastic inequalities on partially ordered spaces, Ann. Prob. 5 (1977) 899–912.
J. Kiefer and J. Wolfowitz, On the theory of queues with many servers, Trans. Am. Math. Soc. 78 (1955) 1–18.
J. Kiefer and J. Wolfowitz, On the characteristics of the general queueing process with applications to random walk, Ann. Math. Stat. 27 (1956) 147–161.
J.F.C. Kingman, Inequalities in the theory of queues, J. Roy. Stat. Soc. Series B 32 (1970) 102–110.
J.F.C. Kingman, Subadditive processes, in:Ecole d'Ete de Probabilities de Saint-Flour, eds. A. Dold and B. Eckmann, Lecture Notes in Mathematics 539 (Springer, Berlin, 1976) pp. 165–223.
J.F. Kurose, On computing per-session performance bounds in high-speed multi-hop computer networks, to be presented inSIGMETRICS andPERFORMANCE'92
R.M. Loynes, The stability of a queue with non-independent inter-arrival and service times, Proc. Camb. Phil. Soc. 58 (1962) 497–520.
S.P. Meyn and D. Down, Stability of generalized Jackson networks, preprint (1991).
S.P. Meyn and R.L. Tweedie, Criteria for stability of Markov processes I: Discrete time chain, Adv. Appl. Prob. 24 (1992) 542–574.
S.P. Meyn and R.L. Tweedie, Criteria for stability of Markov processes II: Continuous time processes and sample chains, preprint (1990).
T. Rolski, Queues with nonstationary arrivals,Queueing Systems 5 (1989) 113–130.
T. Rolski and R. Szekli, Networks of work-conserving normal queues,Applied Prob. Computer Science. The Interface, Vol. II (Birkhauser, 1982).
T. Rolski and R. Szekli, Stochastic ordering and thinning of point processes, Stoch. Processes and Their Appl. 37 (1991) 299–312.
S.M. Ross,Stochastic Processes (Wiley, New York, 1983).
J.G. Shanthikumar and D.D. Yao, Stochastic monotonicity in general queueing networks, J. Appl. Prob. 26 (1989) 413–417.
K. Sigman, Notes on the stability of closed queueing networks, J. Appl. Prob. 26 (1989) 678–682. Also corrections in J. Appl. Prob. 27 (1990) 735.
K. Sigman, The stability of open queueing networks, Stoch. Processes and Their Appl. 35 (1990) 11–25.
D. Stoyan,Comparison Methods for Queues and Other Stochastic Models (Wiley, Berlin, 1983).
P. Tsoucas and J. Walrand, Monotonicity of throughput in non-Markovian networks, J. Appl. Prob. 26 (1989) 134–141.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chang, CS., Thomas, J.A. & Kiang, SH. On the stability of open networks: A unified approach by stochastic dominance. Queueing Syst 15, 239–260 (1994). https://doi.org/10.1007/BF01189239
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01189239