Abstract
We present a point-process approach to stationary discrete-time queues where arrivals and services are synchronized. The introduction of a Palm distribution enables us to discuss the ASTA (Arrivals See Time Averages) property, and to derive the rate conservation principle. By applying the principle to the discrete-time queues we present qualitative relationships between customer- and time-stationary distributions, including Little's and Brumelle's formulas.
Similar content being viewed by others
References
P. Brémaud, Characteristics of queueing systems observed at events and the connection between stochastic intensity and Palm probability, Queueing Systems 5 (1989) 99–112.
S.L. Brumelle, On the relation between customer and time averages in queues, J. Appl. Prob. 8 (1971) 508–520.
C.-S. Chang, X. Chao and M. Pinedo, Integration of discrete-time correlated Markov processes in a TDM system. Structural results, Prob. Eng. Inform. Sci. 4 (1990) 29–56.
P. Franken, D. König, U. Arndt and V. Schmidt,Queues and Point Processes (Wiley, Chichester, 1982).
S. Halfin, Batch delays versus customer delays, Bell Syst. Techn. J. 62 (1983) 2011–2015.
D. König, T. Rolski, V. Schmidt and D. Stoyan, Stochastic processes with imbedded marked point processes (PMP) and their application in queueing, Math. Operationsforsch. Statist., Ser. Optimization 9 (1978) 125–141.
D. König and V. Schmidt, EPSTA: The coincidence of time-stationary and customer stationary distributions, Queueing Systems 5 (1989) 247–264.
A. Kuczura, Piecewise Markov processes, SIAM J. Appl. Math. 24 (1973) 169–181.
A. Makowski, B. Melamed and W. Whitt, On averages seen by arrivals in discrete time,Proc. 28th IEEE Conf. on Decision and Control (1989) pp. 1084–1086.
B. Melamed and W. Whitt, On arrivals see time averages, Oper. Res. 38 (1990) 156–172.
M. Miyazawa, Time and customer averages in queues with stationary inputs, J. Appl. Prob. 14 (1977) 349–357.
M. Miyazawa, The derivation of invariance relations in complex queueing systems with stationary inputs, Adv. Appl. Prob. 15 (1983) 874–885.
M. Miyazawa, The intensity conservation law for queues with randomly changed service rate, J. Appl. Prob. 22 (1985) 408–418.
M. Miyazawa, Comparison of the loss probability of theGI X/GI/1/k queues with a common traffic intensity, J. Oper. Res. Soc. Japan 32 (1989) 505–516.
M. Miyazawa, Rate conservation law with multiplicity and its applications to queues, Res. Report ISSUT/0-90-6, Department of Information Science, Science University of Tokyo (1990).
I. Rubin and Z. Tsai, Message delay analysis of multiclass priority TDMA, FDMA, and discrete-time queueing systems, IEEE Trans. Inf. Theory IT-35 (1989) 637–647.
S. Stidham Jr. and M. El-Taha, Sample-path analysis of processes with imbedded point processes, Queueing Systems 5 (1989) 131–166.
Y. Takahashi and O. Hashida, Delay analysis of discrete-time priority queue with structured inputs, Queueing Systems 8 (1991) 149–164.
R.W. Wolff, Poisson arrivals see time averages, Oper. Res. 30 (1982) 223–231.
R.W. Wolff,Stochastic Modeling and the Theory of Queues (Prentice-Hall, New Jersey, 1989).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Miyazawa, M., Takahashi, Y. Rate conservation principle for discrete-time queues. Queueing Syst 12, 215–229 (1992). https://doi.org/10.1007/BF01158799
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01158799