Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지

A Study on the Comparison of Storage Sharing Schemes in Queueing System with Finite Capacity Buffer

유한 용량의 버퍼를 가지는 대기행렬에서의 저장공간 공유방안 비교에 관한 연구

  • Kwon Soo-Tae (Department of Information System, School of Information Technology and Engineering, Jeonju University)
  • 권수태 (전주대학교 정보기술공학부 정보시스템전공)
  • Published : 2004.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

본 논문의 목적은 유한 저장공간을 가지는 대기행렬 시스템에서 완전공유(Complete Sharing), 완전분할(Complete Partitioning), 최소할당공유(Sharing with Minimum Allocation)와 같은 다양한 저장공간 공유방안들을 비교ㆍ분석하는 것으로, 이를 위하여 먼저 각각의 공유방안에서의 대기행렬 안정상태확률을 효율적으로 구할 수 있는 방법이 제시되었다. 다음으로 각각의 저장공간 공유방안을 특징짓는데 필요한 몇 가지 성질들이 규명되었으며, 이를 토대로 각각의 저장공간 공유방안에 대하여 시스템 성능척도인 생산률들을 도출하는 한편, 이들의 대소관계를 파악하고, 수치실험을 통하여 이를 입증하였다.

Keywords

References

  1. Akyildiz, I.F. ; 'Exact Product Form Solution for Queueing Networks with Blocking,' IEEE Transaction on Computers, 36(1) : 122-125, 1987
  2. Baskett, F., Chandy, M., Muntz, R.R. and Palacios, F.G.; 'Open, Closed and Mixed Networks of Queues with Different Classes of Customers,' Journal of Association for Computing Machinery, 22 : 233-248, 1975
  3. Bondi, A.B. ; 'An Analysis of Finite Capacity Queues with Priority Scheduling and Common or Reserved Waiting Areas,' Computers & Operations Research, 16(3) : 217-233, 1989
  4. Dowdy, L.W., Eager, D.L., Gordon, K.D. and Saxton, L.V. ; 'Throughput Concavity and Response Time Convexity,' Information Processing Letters, 19 : 209-212, 1984
  5. Gross, D. and Harris, C.; Fundamentals of Queueing Theory, John Wiely & Sons, New York, 1985
  6. Haskose, A., Kingsman B.G., and Worthington, D. ; 'Modelling Flow and Jobbing Shops as a Queueing Network for Workload Control,' International Journal of Production Economics, 78 : 271-285, 2002
  7. Kamoun, F., and Kleinrock, L. ; 'Analysis of Finite Storage in a Computer Network Node Environment under General Traffic Condition,' IEEE Transactions Communication, 28(7) : 992-1003, 1980
  8. Kapadia, A.S., Kazmi, M.H., and Mitchell, A.C. ; 'Analysis of Finite Capacity Non-Preemptive Priority Queue,' Computers & Operations Research, 11(3) : 337-343, 1984
  9. Kelly, F.P.; Reversibility and Stochastic Networks, John Wiley & Sons, New York, 1979
  10. Lee, H.S., and Pollock, S.M. ; 'Approximation Analysis of Open Acyclic Exponential Queueing Networks with Blocking,' Operations Research, 38 : 1123-1134, 1990
  11. Ma, J. and Matsui, M. ; 'Perfomance Evaluation of a Flexible Machining /Assembly System and Routing Comparisons' International Journal of Production Research, 40(7): 1713-1724, 2002
  12. Rupe, J. and Kuo, W.; 'Performability of FMS based on Stochastic Process Models,' International Journal of Production Research, 39(1) : 139-155, 2001
  13. Sung, C.S. and Kwon, S.T. ; 'Performance Modelling of an FMS with Finite Input and Output Buffers,' International Journal of Production Economics, 37 : 161-175, 1994
  14. Xiaobo, Z., Gong, Q. and Wang, J. ; 'On Control Strategies in a Multi-Stage Production System,' International Journal of Production Research, 40(5) : 1155-1171, 2002