About the cumulative idle time in multiphase queues

Saulius Minkevičius; Stasys Steišūnas

RAIRO - Operations Research - Recherche Opérationnelle (2005)

  • Volume: 39, Issue: 2, page 75-85
  • ISSN: 0399-0559

Abstract

top
The paper is designated to the analysis of queueing systems, arising in the network theory and communications theory (called multiphase queueing systems, tandem queues or series of queueing systems). Also we note that multiphase queueing systems can be useful for modelling practical multi-stage service systems in a variety of disciplines, especially on manufacturing (assembly lines), computer networking (packet switch structures), and in telecommunications (e.g. cellular mobile networks), etc. This research presents heavy traffic limit theorems for the cumulative idle time in multiphase queues. In this work, functional limit theorems are proved for the values of important probability characteristics of the queueing system (a cumulative idle time of a customer).

How to cite

top

Minkevičius, Saulius, and Steišūnas, Stasys. "About the cumulative idle time in multiphase queues." RAIRO - Operations Research - Recherche Opérationnelle 39.2 (2005): 75-85. <http://eudml.org/doc/245667>.

@article{Minkevičius2005,
abstract = {The paper is designated to the analysis of queueing systems, arising in the network theory and communications theory (called multiphase queueing systems, tandem queues or series of queueing systems). Also we note that multiphase queueing systems can be useful for modelling practical multi-stage service systems in a variety of disciplines, especially on manufacturing (assembly lines), computer networking (packet switch structures), and in telecommunications (e.g. cellular mobile networks), etc. This research presents heavy traffic limit theorems for the cumulative idle time in multiphase queues. In this work, functional limit theorems are proved for the values of important probability characteristics of the queueing system (a cumulative idle time of a customer).},
author = {Minkevičius, Saulius, Steišūnas, Stasys},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {queueing systems; multiphase queues; functional limit theorems; heavy traffic; a cumulative idle time of a customer},
language = {eng},
number = {2},
pages = {75-85},
publisher = {EDP-Sciences},
title = {About the cumulative idle time in multiphase queues},
url = {http://eudml.org/doc/245667},
volume = {39},
year = {2005},
}

TY - JOUR
AU - Minkevičius, Saulius
AU - Steišūnas, Stasys
TI - About the cumulative idle time in multiphase queues
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 2005
PB - EDP-Sciences
VL - 39
IS - 2
SP - 75
EP - 85
AB - The paper is designated to the analysis of queueing systems, arising in the network theory and communications theory (called multiphase queueing systems, tandem queues or series of queueing systems). Also we note that multiphase queueing systems can be useful for modelling practical multi-stage service systems in a variety of disciplines, especially on manufacturing (assembly lines), computer networking (packet switch structures), and in telecommunications (e.g. cellular mobile networks), etc. This research presents heavy traffic limit theorems for the cumulative idle time in multiphase queues. In this work, functional limit theorems are proved for the values of important probability characteristics of the queueing system (a cumulative idle time of a customer).
LA - eng
KW - queueing systems; multiphase queues; functional limit theorems; heavy traffic; a cumulative idle time of a customer
UR - http://eudml.org/doc/245667
ER -

References

top
  1. [1] C. Adams, E. Gelenbe and J. Vicard, An experimentally validated model of the paging drum. Acta Inform. 11 (1979) 103–117. Zbl0378.68019
  2. [2] F. Baccelli, A. Borovkov and J. Mairesse, Asymptotic results on infinite tandem queueing networks. Probab. Theory Related Fields 118 (2000) 365–405. Zbl0976.60088
  3. [3] P. Billingsley, Convergence of Probability Measures. New York, Wiley (1968). Zbl0172.21201MR233396
  4. [4] E. Gelenbe, On approximate computer system models. J. ACM 22 (1975) 261–269. Zbl0322.68035
  5. [5] E. Gelenbe, Probabilistic models of computer systems. II. Diffusion approximations, waiting times and batch arrivals. Acta Inform. 12 (1979) 285–303. Zbl0419.60086
  6. [6] E. Gelenbe, X. Mang and Y. Feng, Diffusion cell loss estimates for ATM with multiclass bursty traffic. Computer Systems – Science and Engineering. Special Issue: ATM Networks. 11 (1996) 325–333. 
  7. [7] E. Gelenbe, X. Mang and R. Onvural, Diffusion based Call Admission Control in ATM. Performance Evaluation 27/28 (1996) 411–436, also in Proceedings of the IFIP WG 7.3/ACM-SIGMETRICS Performance’96 Conference. Zbl0900.68032
  8. [8] E. Gelenbe and I. Mitrani, Analysis and Synthesis of Computer Systems. New York-London, Academic Press (1980). Zbl0484.68026MR696380
  9. [9] E. Gelenbe and R.R. Muntz, Probabilistic models of computer systems. I. Exact results. Acta Inform. 7 (1976) 35–60. Zbl0343.60066
  10. [10] G. Gelenbe and G. Pujolle, The behaviour of a single queue in a general queueing network. Acta Inform. 7 (1976/77) 123–136. Zbl0349.60091
  11. [11] D. Iglehart, Weak convergence in queueing theory. Adv. Appl. Probab. 5 (1973) 570–594. Zbl0296.60064
  12. [12] D. Iglehart and W. Whitt, Multiple channel queues in heavy traffic. I. Adv. Appl. Probab. No. 2 (1970) 150–177. Zbl0218.60098
  13. [13] F. Karpelevich and A. Kreinin, Heavy Traffic Limits for Multiphase Queues. American Mathematical Society, Providence, Rhode Island (1994). Zbl0861.90058MR1286738
  14. [14] O. Kella, Concavity and reflected Levy process. J. Appl. Probab. 29 (1992) 209–215. Zbl0760.60069
  15. [15] H. Kobayashi, Application of the diffusion approximation to queueing networks: Parts I and II. J. ACM 21 (1974) 316–328, 459–469. Zbl0278.60074
  16. [16] H. Kobayashi and Q. Ren, A diffusion approximation analysis of an ATM statistical multiplexer with multiple state solutions: Part I: Equilibrium state solutions. Proc. ICC’93 (1993) 1047–1053. 
  17. [17] X. Mang, ATM Network Performance Predictions and Control, Ph.D. Dissertation. Duke: Electrical and Computer Engineering Department of Duke University (1996). 
  18. [18] X. Mang and E. Gelenbe, Call admission control in ATM using diffusion model. Proc. Globecom’96, London, UK (1996). Zbl0900.68032
  19. [19] P. Milch and M. Waggoner, A random walk approach to a shutdown queueing system. SIAM J. Appl. Math. 19 (1970) 103–115. Zbl0213.20102
  20. [20] S. Minkevičius, Weak convergence in multiphase queues. Lithuanian Math. J. 26 (1986) 717–722 (in Russian). 
  21. [21] S. Minkevičius, On the full idle time in multiphase queues. Lithuanian Math. J. (to appear). Zbl1102.60084
  22. [22] M. Pike, Some numerical results for the queueing system D / E k / 1 . J. R. Statist. Soc. Ser. B. 25 (1963) 477–488. Zbl0129.31001
  23. [23] N. Prabhu, Stochastic Storage Processes. New York-Heidelberg-Berlin, Springer-Verlag (1968). Zbl0453.60094MR1492990
  24. [24] A. Puhalskii, Moderate deviations for queues in critical loading. Queue. Syst. Theor. Appl. 31 (1999) 359–392. Zbl0934.90022
  25. [25] M. Reiser, H. Kobayashi, Accuracy of the diffusion approximation for some queueing systems. IBM J. Res. Dev. 18 (1974) 110–124. Zbl0275.68014
  26. [26] M. Ridel, Conditions for stationarity in a single server queueing system. Zastos. Mat. 15 (1976) 17–24. Zbl0343.60062
  27. [27] L. Takacs, Occupation time problems in the theory of queues, in Lecture Notes in Economics and Mathematical Systems. Berlin-Heidelberg-New York, Springer-Verlag 98 (1974) 91–131. Zbl0303.60097
  28. [28] W. Whitt, Limits for cumulative input processes to queues. Probab. Engrg. Inform. Sci. 14 (2000) 123–150. Zbl0979.60089

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.