Journal of Korea Society of Industrial Information Systems (한국산업정보학회논문지)

Korea Society of Industrial Information Systems (한국산업정보학회)
권호 표지
DOI QR코드

DOI QR Code

A Unified Approach for the Analysis of Discrete-time MAP/G/1 Queue: by Workload Analysis

일량분석에 의한 이산시간 MAP/G/1 대기행렬시스템의 통합적 분석

  • Received : 2017.01.02
  • Accepted : 2017.02.25
  • Published : 2017.02.28
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, We suggest a unified approach for the analysis of discrete-time MAP/G/1 queueing system. Many researches on the D-MAP/G/1 queue have been used different approach to analyze system queue length and waiting time for the same system. Therefore, a unified framework for analyzing a system is necessary from a viewpoint of system design and management. We first derived steady-state workload distribution, and then waiting time and sojourn time are derived by the result of workload analysis. Finally, system queue length distribution is derived with generating function from the sojourn time distribution.

본 논문에서는 이산시간 마코비안 도착과정(discrete-time Markovian arrival process, 이하 이산시간 MAP)을 갖는 대기행렬시스템의 주요성능척도들을 분석하기 위한 통합적 접근방법을 제시한다. 기존의 이산시간 MAP/G/1 대기행렬시스템의 연구들을 보면 동일한 시스템에 대하여 시스템 내 고객수와 대기시간 등을 분석할 때 서로 다른 방법으로 접근하였기에 이 둘을 동시에 살펴보고자 할 때는 추가적인 시간과 노력이 뒤따랐다. 따라서 하나의 시스템을 여러 방면에서 포괄적으로 분석할 수 있는 통합적인 접근방법은 시스템을 설계하고 관리하는 입장에서 볼 때 중요한 분석의 틀이 된다. 본 논문에서는 이산시간 MAP/G/1 시스템의 안정상태 일량 분포를 유도하고 이를 이용하여 임의고객의 대기시간, 체재시간 분포를 유도한다. 체재시간 분포로부터 이탈시점 고객수 분포를 구하고 이탈시점 고객수와 임의시점 고객수와의 관계로부터 고객수 분포를 유도한다.

Keywords

References

  1. Neuts, M. F., “A Versatile Markovian Point Process,” Journal of Applied Probability, Vol. 16, No. 4, pp. 764-779, 1979. https://doi.org/10.1017/S0021900200033465
  2. Casale, G., Zhang, E. Z. and Smirni, E., “Trace Data Characterization and Fitting for Markov Modeling,” Performance Evaluation, Vol. 54, No. 2, pp. 61-79, 2010.
  3. Buchholz, P., "An EM-algorithm for MAP Fitting from Real Traffic Data.," International Conference on Modelling Techniques and Tools for Computer Performance Evaluation. Springer Berlin Heidelberg, 2003.
  4. Klemm, A., Lindemann, C. and Lohmann, M., “Modeling IP Traffic Using the Batch Markovian Arrival Process,” Performance Evaluation, Vol. 54, No. 2, pp. 149-173, 2003. https://doi.org/10.1016/S0166-5316(03)00067-1
  5. Artalejo, J.R., Gomez-Corral, A. and Qi-Ming H., "Markovian Arrivals in Stochastic Modelling: a Survey and Some New Results", Statistics and Operations Research Transactions, Vol. 34, No. 2, pp. 101-156, 2010.
  6. Paxson, V. and Floyd, S., "Wide Area Traffic: The Failure of Poisson Modeling", IEEE/ACM Transactions on Networking, Vol. 3, No. 3, pp. 226-244, 1995. https://doi.org/10.1109/90.392383
  7. Ramaswami, V., “The N/G/1 Queue and Its Detailed Analysis,” Advances in Applied Probability, Vol. 12, No. 1, pp. 222-261, 1980. https://doi.org/10.1017/S0001867800033474
  8. Okamura, H., Dohi, T. and Trivedi, K. S., "Markovian Arrival Process Parameter Estimation with Group Data". IEEE/ACM Transactions on Networking, Vol. 17, No. 4, pp. 1326-1339, 2009. https://doi.org/10.1109/TNET.2008.2008750
  9. Breuer, L. and Kume, A., "An EM Algorithm for Markovian Arrival Processes Observed at Discrete Times," In International GI/ITG Conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance, Springer Berlin Heidelberg, pp. 242-258, 2010.
  10. Carrizosa, E. and Ramirez-Cobo, P., "Maximum Likelihood Estimation in the Two-state Markovian Arrival Process", arXiv preprint arXiv:1401.3105, 2014.
  11. Lee, H. W., Queueing Theory, Sigma Press, 2006 (in Korean)
  12. Cinlar, E., “Queues with semi-Markovian Arrivals,” Journal of Applied Probability, Vol. 4, No. 2, pp. 365-379, 1967. https://doi.org/10.1017/S0021900200032113
  13. Neuts, M.F., "Matrix-analytic Methods in Queueing Theory," appears in: Advances in Queueing : Theory, methods and Open Problems, J.H. Dshalalow Editor, CRC Press, pp. 265-292, 1995.
  14. Wallace, V.L. The Solution of Quasi Birth and Death Processes Arising from Multiple Access Computer Systems, SEL Technical Report No. 35, Michigan Univ. Ann Arbor Systems Engineering Lab, 1969.
  15. Ramaswami, V., "A Stable Recursion for the Steady State Vector in Markov Chains of M/G/1 Type," Stochastic Models, Vol. 4, No. 1, 1988.
  16. Lucantoni, D. M., “New Results for the Single Server Queue with a Batch Markovian Arrival Process,” Stochastic Models, Vol. 7, No. 1, pp. 1-46, 1991. https://doi.org/10.1080/15326349108807174
  17. Lucantoni, D. M., "The BMAP/G/1 Queue: A Tutorial," Lecture Notes in Computer Science, Vol. 729, pp. 330-358, 1993.
  18. Blondia, C. and Casals, O., "Statistical Multiplexing of VBR Sources: A Matrixanalytic Approach," Performance Evaluation, Vol. 16, pp. 5-20, 1992. https://doi.org/10.1016/0166-5316(92)90064-N
  19. Cox, D.R., “The Analysis of non-Markovian Stochastic Processes by the Inclusion of Supplementary Variables,” Mathematical Proceedings of the Cambridge Philosophical Society, Vol. 51, No. 3, pp. 433-441, 1955. https://doi.org/10.1017/S0305004100030437
  20. Hokstad, B.T., "A Supplementary Variable Technique Applied to the M/G/1 Queue", Scandinavian Journal of Statistics, Vol. 2, No. 2, pp. 95-98, 1975.
  21. Lee, H.W., Ahn, B.Y. and Park, N.I., "Decompositions of the Queue Length Distributions in the MAP/G/1 Queue under Multiple and Single Vacations with N-policy," Stochastic Models, Vol. 17, No. 2, pp. 157-190, 2001 https://doi.org/10.1081/STM-100002062
  22. Lee, H.W. and Ahn, B.Y., "Operational Behavior of the MAP/G/1 Queue under N-policy with Single Vacation and Setup", Journal of Applied Mathematics & Stochastic Analysis, Vol. 15, No. 2, pp. 167-196, 2002.
  23. Lee, H.W., Shin, Y.J. and Lee, S.W., “Two Approaches for Discrete-time MAP/G/1 Queues,” Journal of Industrial Engineering and Management Systems, Vol. 2, No. 2, pp. 188-192, 2003.
  24. Lee, H.W., Shin, Y.J., Lee, E.Y. and Chae, K.C., “An Eigenvalue Approach to Discretetime MAP/G/1 Queues,” International Journal of Industrial Engineering, Vol. 10, No. 4, pp. 644-650, 2003.
  25. Lee, H.W. and Park, N.I., “Using Factorization for Waiting Times in BMAP/G/1 Queues with N-policy and Vacations,” Stochastic Analysis and Applications, Vol. 22, No. 3, pp. 755-773, 2004. https://doi.org/10.1081/SAP-120030455
  26. Lee, H.W., Lee, S.W., Seo, W.J., Cheon, S.H. and J. Jeon, "A Unified Framework for the Analysis of M/G/1 Queue Controlled by Workload," Lecture Notes in Computer Science, Vol. 3982, pp. 718-727, 2006.
  27. Lee, S.W., Lee, H.W. and Baek, J. W., "Analysis of Discrete-time Geo/G/1 Queue under the D-policy," 6th International Conference on Queueing Theory and Network Analysis, 2011, Seoul, Korea, QTNA2011.
  28. Lee, S.W., Lee, H.W. and Baek, J. W., “Analysis of Discrete-time MAP/G/1 Queue under Workload Control,” Performance Evaluation, Vol. 69, No. 2, pp. 71-85, 2012. https://doi.org/10.1016/j.peva.2011.11.001
  29. Hunter, J.J., Mathematical Techniques of Applied Probability, Vol. II, Discrete-time Models: Techniques and Applications, New York: Academic Press, 1983.
  30. Takagi, H., Queueing Analysis: Vol. III, Discrete-Time Systems, North-Holland, 1993.
  31. Kim, N.K., Chang, S.H. and Chae, K.C., "On the Relationships among Queue Lengths at Arrival, Departure, and Random Epochs on the Discrete-time Queue with D-BMAP Arrivals," Operations Research, Vol. 30, pp. 25-32, 2002.
  32. Latouche, G. and Ramaswami, V., Introduction to Matrix Analytic Methods in Stochastic Modeling, Society for Industrial and Applied Mathematics, 1999.
  33. Bruneel, H. and Kim, B. G., Discrete-Time Models for Communication Systems Including ATM, Kluwer Academic Publishers, 1993.
  34. Lee, K.-G., Choi, S. and Ryu, S.-W., “Development of Simulation System for Evaluating Performance of the Flat Display Manufacturing Line with Repetitive Process,” The Journal of Information Systems, Vol. 17, No. 4, pp. 301-319, 2008. https://doi.org/10.5859/KAIS.2008.17.4.301

Cited by

  1. 기계 학습 및 딥러닝 알고리즘을 사용한 스마트 수도미터 시스템에서의 물 사용량 데이터 분석 vol.55, pp.7, 2017, https://doi.org/10.5573/ieie.2018.55.7.31
  2. 딥러닝을 활용한 자산분배 시스템 vol.24, pp.1, 2017, https://doi.org/10.9723/jksiis.2019.24.1.023
  3. 머신러닝을 이용한 철광석 가격 예측에 대한 연구 vol.25, pp.2, 2017, https://doi.org/10.9723/jksiis.2020.25.2.057