Skip to main content
Log in

Rate conservation principle for discrete-time queues

  • Articles
  • Published:
Queueing Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. 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.

    Google Scholar 

  2. S.L. Brumelle, On the relation between customer and time averages in queues, J. Appl. Prob. 8 (1971) 508–520.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. P. Franken, D. König, U. Arndt and V. Schmidt,Queues and Point Processes (Wiley, Chichester, 1982).

    Google Scholar 

  5. S. Halfin, Batch delays versus customer delays, Bell Syst. Techn. J. 62 (1983) 2011–2015.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. D. König and V. Schmidt, EPSTA: The coincidence of time-stationary and customer stationary distributions, Queueing Systems 5 (1989) 247–264.

    Google Scholar 

  8. A. Kuczura, Piecewise Markov processes, SIAM J. Appl. Math. 24 (1973) 169–181.

    Google Scholar 

  9. 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.

  10. B. Melamed and W. Whitt, On arrivals see time averages, Oper. Res. 38 (1990) 156–172.

    Google Scholar 

  11. M. Miyazawa, Time and customer averages in queues with stationary inputs, J. Appl. Prob. 14 (1977) 349–357.

    Google Scholar 

  12. M. Miyazawa, The derivation of invariance relations in complex queueing systems with stationary inputs, Adv. Appl. Prob. 15 (1983) 874–885.

    Google Scholar 

  13. M. Miyazawa, The intensity conservation law for queues with randomly changed service rate, J. Appl. Prob. 22 (1985) 408–418.

    Google Scholar 

  14. 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.

    Google Scholar 

  15. 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).

  16. 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.

    Google Scholar 

  17. S. Stidham Jr. and M. El-Taha, Sample-path analysis of processes with imbedded point processes, Queueing Systems 5 (1989) 131–166.

    Google Scholar 

  18. Y. Takahashi and O. Hashida, Delay analysis of discrete-time priority queue with structured inputs, Queueing Systems 8 (1991) 149–164.

    Google Scholar 

  19. R.W. Wolff, Poisson arrivals see time averages, Oper. Res. 30 (1982) 223–231.

    Google Scholar 

  20. R.W. Wolff,Stochastic Modeling and the Theory of Queues (Prentice-Hall, New Jersey, 1989).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01158799

Keywords

Navigation