한국정보과학회논문지:시스템및이론 (Journal of KIISE:Computer Systems and Theory)

한국정보과학회 (Korean Institute of Information Scientists and Engineers)
권호 표지

용량제한을 갖는 중첩형 대기행렬 네트워크의 성능 범위분석

A Boundness Analysis of Performance on the Nested Queueing Network with Population Constraint

  • 이영 (계명대학교 경영공학과)
  • 발행 : 2009.08.15
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

각 계층 네트워크가 세마포에 의하여 용량제한을 갖는 중첩형 대기행렬 네트워크의 평균대기시간에 관하여 연구하였다. 중첩형 대기행렬 네트워크는 고객의 대기시간 관점에서 보다 간단한 대기행렬 네트워크로 변환될 수 있다. 이러한 중첩형 대기행렬 네트워크의 가장 중요한 특성은 하위계층의 흐름이 상위 계층의 상태에 의존적이며, 제한을 받는다는 것이다. 이러한 형태의 대기행렬 네트워크는 성능분석을 정확히 할 수 없기 때문에, 변환된 중첩형 대기행렬 네트워크를 이용하여 평균대기시간에 대한 하한과 상한을 분석하고자 한다. 모의실험에 관한 측정은 도착분포가 단계형태 분포로서 포아송, 얼랑 그리고 초지수분포에 관하여 조사하였다. 이렇게 구한 범위는 추후에 좀 더 근접한 근사치를 구하는데 이용할 수 있다.

In this study, we analyze the mean waiting time on the nested open queueing network, where the population within each subnetwork is controlled by a semaphore queue. The queueing network can be transformed into a simpler queueing network in terms of customers waiting time. A major characteristic of this model is that the lower layer flow is halted by the state of higher layer. Since this type of queueing network does not have exact solutions for performance measure, the lower bound and upper bound on the mean waiting time are checked by comparing them with the mean waiting time in the transformed nested queueing network. Simulation estimates are obtained assuming Poisson arrivals and other phase-type arrival process, i.e., Erlang and hyper-exponential distributions. The bounds obtained can be applied to get more close approximation using the suitable approach.

키워드

참고문헌

  1. M. Reiser, A queueing network analysis of computer communication networks with window flow control, IEEE Trans. on Comm., 27, pp.1199-1209, 1979. https://doi.org/10.1109/TCOM.1979.1094531
  2. M. Pennotti, M. Schwartz, Congestion control in store and forward tandem link, IEEE Trans. on Comm., 23, pp.1434-1443, 1975. https://doi.org/10.1109/TCOM.1975.1092752
  3. M, Schwartz, Performance analysis of the SNA virtual routing pacing control, IEEE Trans. on Comm., 30, pp.172-184, 1982. https://doi.org/10.1109/TCOM.1982.1095377
  4. A. Thomasian, P. Bay, Analysis of Queueing network models with population size constraint and delayed blocked customers, ACM SIGMETRICS conference, pp.202-216, 1984.
  5. G. Varghee, W. Chou and A. Nilsson, Queueing delays on virtual circuits using a sliding window flow control scheme, ACM SIGMETRICS conf. Minneapolis, pp.275-281, 1983.
  6. O. Gihr, P. Kuehn, Comparison of communication services with connection-oriented and connectionless data transmission, Processing of the International Seminar on Computer Networking and Performance Evaluation, Tokyo Japan, pp.431-444, Sep. 1985.
  7. Y. Rhee and H. Perros, Analysis of an Open Tandem Queueing Network with Population Constraint and Constant Service Times, European J. Of Operations Research, vol.92, pp.99-111, 1996. https://doi.org/10.1016/0377-2217(95)00291-X
  8. L. Mitchell, and D. Lide, End-to-end performance modeling of local area networks, IEEE J. Select. Comm., vol.SAC-4, pp.305-320, 1986.
  9. S. Fdida, H. Perros, A. Wilk, Semaphore Queue; modeling multilayered window flow control mechanism, IEEE Trans. on Comm., 83(3), pp.309-317, 1990.
  10. G.W. Shapiro and H.G. Perros, Nested sliding window protocols with packet fragmentation, IEEE Trans. Comm., vol.41, no.1, pp.99-109, 1993.
  11. Y. Rhee and H. Perros, On the Mean Waiting Time of a Population Constrained Open Tandem Queueing Network with Constant Service Times, IIE Trans. on Design and Manufacturing, vol.30-10, pp.973-979, 1998.
  12. Y. Rhee, Some notes on the reduction of the network dimensionality in the nested open queueing network, European J. Of Operations Research, vol. 174, pp.124-131, 2006. https://doi.org/10.1016/j.ejor.2005.03.019
  13. K.T. Marshall, Some inequalities in queueing, Operations Research, vol.16, pp.651-665, 1968. https://doi.org/10.1287/opre.16.3.651
  14. W.G. Marchal, Some simpler bounds on the mean queueing time, Operations Research, vol.26, no.6, pp.1083-1088, 1978. https://doi.org/10.1287/opre.26.6.1083
  15. Kramer and Langenbach-Belz, Approximate formulae for the delay in the queueing system GI/G/1. 8 Int. Tele. Con. Melbourne, 235/1-8, 1976.