한국시뮬레이션학회논문지 (Journal of the Korea Society for Simulation)

한국시뮬레이션학회 (The Korea Society for Simulation)
권호 표지
DOI QR코드

DOI QR Code

시뮬레이션을 이용한 대기행렬 네트워크 도착과정의 변동성함수에 관한 연구

A Simulation Study on the Variability Function of the Arrival Process in Queueing Networks

  • 김선교 (아주대학교 경영대학 경영학부)
  • 투고 : 2011.03.10
  • 심사 : 2011.04.09
  • 발행 : 2011.06.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 연구에서는 대기행렬네트워크 성과측정 방법 중의 한 가지로서 널리 이용되는 분해법의 구성요소로 제안된 변동성 함수 의 이론적 근거를 살펴보고 성과척도 측정의 정확도 제고를 위하여 회귀분석을 통한 변동성 함수의 모수추정 개선방안을 제안하고자 한다. 이를 위하여 변동성이 높은 도착과정과 서비스 과정이 포함된 직렬 대기행렬 네트워크에서의 이탈과정의 자동상관계수 함수를 추정하여 분해법에 사용할 수 있는 방안을 알아본다.

In queueing network analysis, arrival processes are usually modeled as renewal processes by matching mean and variance. The renewal approximation simplifies the analysis and provides reasonably good estimate for the performance measures of the queueing systems under moderate conditions. However, high variability in arrival process or in service process requires more sophisticated approximation procedures for the variability parameter of departure/arrival processes. In this paper, we propose an heuristic approach to refine Whitt's variability function with the k-interval squared coefficient of variation also known as the index of dispersion for intervals(IDI). Regression analysis is used to establish an empirical relationships between the IDI of arrival process and the IDI of departure process of a queueing system.

키워드

참고문헌

  1. Albin, S.L. (1984), "Approximating a point process by a renewal process, II: superposition arrival processes to queues", Operations Research, vol. 32, pp. 1133-1162. https://doi.org/10.1287/opre.32.5.1133
  2. Bitran, G.R. and Tirupati, D. (1988), "Multiproduct queueing networks with deterministic routing: decomposition approach and the notion of interference", Management Science, vol. 34, pp. 75-100. https://doi.org/10.1287/mnsc.34.1.75
  3. Buzacott, J.A. and Shanthikumar, J.G. (1993), "Stochastic models of manufacturing systems". Prentice Hall.
  4. Fendick, K.W., Saksena, V.R. and Whitt, W. (1989), "Dependence in packet queues", IEEE Transactions on Communications, vol. 37, pp. 1173-1183. https://doi.org/10.1109/26.46511
  5. Fendick, K.W., Saksena, V.R. and Whitt, W. (1991), "Investigating dependence in packet queues with the index of dispersion for work", IEEE Transactions on Communications, vol. 39, pp. 1231-1244. https://doi.org/10.1109/26.134013
  6. Jagerman, D., Baris, B., Altiok, T., and Melamed, B. (2004), "Mean waiting time approximations in the G/G/1 queue", Queueing Systems, vol. 46, pp. 481-506. https://doi.org/10.1023/B:QUES.0000027996.28824.89
  7. Heindl, A. (2001), "Decomposition of general tandem queueing networks with MMPP input", Performance Evaluation, vol. 44, pp. 5-23. https://doi.org/10.1016/S0166-5316(00)00058-4
  8. Kim, S. (2000), Refined parametric decomposition approximation of queueing networks, Ph.D thesis, Purdue University.
  9. Kim, S. (2004), "The heavy traffic bottleneck phenomenon under splitting and superposition", European Journal of Operational Research, vol. 157, pp. 736-745. https://doi.org/10.1016/S0377-2217(03)00299-6
  10. Kim, S., Muralidharan, R. and O'Cinneide, C. (2005), "Taking account of correlations between streams in queueing network approximations", Queueing Systems, vol. 49, pp. 261-281. https://doi.org/10.1007/s11134-005-6967-8
  11. Kim, S. (2005), "Approximation of multi-class queueing networks with highly variable arrivals under deterministic routing", Naval Research Logistics, vol. 52, pp.399-408. https://doi.org/10.1002/nav.20085
  12. Kuehn, P. (1979), "Approximate analysis of general queueing networks by decomposition", IEEE Transactions on Communications, vol. 27, pp. 113-126. https://doi.org/10.1109/TCOM.1979.1094270
  13. Livny, M., Melamed, B., Tsiolis, A. (1993), "The Impact of autocorrelation on queueing systems", Management Science, vol. 39(3), pp. 322-339. https://doi.org/10.1287/mnsc.39.3.322
  14. Shanthikumar, J.G. and Buzacott, J.A. (1981), "Open queueing network models of dynamic job shops", International Journal of Production and Research, vol. 19, pp. 255-266. https://doi.org/10.1080/00207548108956652
  15. Shioda, S. (2003), "Departure process of the MAP/SM/1 queue", Queueing Systems, vol. 44, pp. 31-50. https://doi.org/10.1023/A:1024090706623
  16. Sriram, K. and Whitt, W. (1986), "Characterizing superposition arrival processes in packet multiplexers for voice and data", IEEE Journal on Selected Areas in Communications, SAC, vol. 4, pp. 833-846. https://doi.org/10.1109/JSAC.1986.1146402
  17. Suresh, S. and Whitt, W. (1990a), "Arranging queues in series: a simulation experiment", Management Science, vol. 36, pp. 1080-1091. https://doi.org/10.1287/mnsc.36.9.1080
  18. Suresh, S. and Whitt, W. (1990b), "The heavy traffic bottleneck phenomenon in open queueing networks", Operations Research Letter, vol. 9, pp. 355-362. https://doi.org/10.1016/0167-6377(90)90054-9
  19. Whitt, W. (1981), "Approximating a point process by a renewal process: The view through a queue, an Indirect Approach", Management Science, vol. 27, pp. 619-636. https://doi.org/10.1287/mnsc.27.6.619
  20. Whitt, W. (1982), "Approximating a point process by a renewal process, I: Two basic methods", Operations Research, vol. 30, pp. 124-147.
  21. Whitt, W. (1983), "The Queueing Network Analyzer", The Bell System Technical Journal, vol. 62, pp. 2779-2815. https://doi.org/10.1002/j.1538-7305.1983.tb03204.x
  22. Whitt, W. (1994), "Towards better multi-class parametricdecomposition approximations for open queueing networks", Annals of Operations Research, vol. 48, pp. 221-248. https://doi.org/10.1007/BF02024659
  23. Whitt, W. (1995), "Variability functions for parametricdecomposition approximations of queueing networks", Management Science, vol. 41, pp. 1704-1715. https://doi.org/10.1287/mnsc.41.10.1704
  24. Wolff, R. W. and Wang, C.-L. (2003), "Idle period approximations and bounds for the GI/G/1 queue", Advances in Applied Probability, vol. 35, pp. 773-792. https://doi.org/10.1239/aap/1059486828
  25. Yeh, P.-C. and Chang, J.-F. (2000), "Characterizing the departure process of a single server queue from the embedded markov renewal process at departures", Queueing Systems, vol. 35, pp. 381-395. https://doi.org/10.1023/A:1019114732376