A Study of Departure Process on the Open and Nested Population Constrained Tandem Queueing Network with Constant Service Times

사용자 제한이 적용되는 2계층 대기행렬 네트워크 구조의 이탈과정에 관한 분석

  • 이영 (계명대학교 공과대학 경영공학과)
  • Published : 2009.12.31

Abstract

In this paper, we consider the departure process from the open and nested tandem Queueing network with population constraint and constant service times. It is known that the Queueing network can be transformed into a simple Queueing network which can be easy to analyze. Using this simple Queueing network, upper and lower bounds on the interdeparture time are obtained. We prove that the variance of the interdeparture time is bounded within these two bounds. Validation against simulation data is shown that how it works the variance of the interdeparture time within two bounds. These bounds can be applied to obtain the better variance of the interdeparture time using a suitable method.

Keywords

References

  1. Fdida, S., H. Perros, and A. Wilk, 'Semaphore Queue : modeling multilayered window flow control mechanism,' IEEE Trans. on Comm., Vol.83, No.3(1990), pp.309-317
  2. Gihr, O. and 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, (1985) pp.431-444
  3. Liberopoulos, G. and Y. Dallery, 'A unified framework for pull control mechanism in multi-stage manufacturing systems,' Annals of OR, Vol.93(2000), pp.325-355 https://doi.org/10.1023/A:1018980024795
  4. Marchal, W.G., 'Some simpler bounds on the mean queueing time,' Operations Research, Vol.26, No.6(1978), pp.1083-1088 https://doi.org/10.1287/opre.26.6.1083
  5. Pennotti, M and M Schwartz, 'Congestion control in store and forward tandem link,' IEEE Trans. on Commm., Vol.23(1975), pp.1434-1443 https://doi.org/10.1109/TCOM.1975.1092752
  6. Reiser, M., 'A queueing network analysis of computer communication networks with window flow control,' IEEE Trans. on Comm., Vol.27(1979), pp.1199-1200 https://doi.org/10.1109/TCOM.1979.1094531
  7. Rhee, Y. and H. Perros, 'Analysis of an Open Tandem Queueing Network with Population Constraint and Constant Service Tines,' European J. of Operations Research, Vol.92(1996), pp.99-111 https://doi.org/10.1016/0377-2217(95)00291-X
  8. Rhee, Y. 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(1998), pp.973-979 https://doi.org/10.1023/A:1007537208927
  9. Rhee, Y., 'Some notes on the reduction of the network dimensionality in the nested open queueing network,' European J. Of Operations Research, Vol.174(2006), pp.124-131 https://doi.org/10.1016/j.ejor.2005.03.019
  10. Schwartz, M., 'Performance analysis of the SNA virtual routing pacing control,' IEEE Trans. on Comm., Vol.30(1982), pp.172-184 https://doi.org/10.1109/TCOM.1982.1095377
  11. Thomasian, A. and P. Bay, 'Analysis of Queueing network models with population size constraint and delayed blocked customers,' ACM SIGMETRICS conference, (1984), pp. 202-216 https://doi.org/10.1145/1031382.809329
  12. Whitt, W., 'The Queueing Network Analyzer,' The Bell System Tech. J., Vol.62-9(1983), pp.2779-2815 https://doi.org/10.1002/j.1538-7305.1983.tb03204.x
  13. Rhee, Y., 'PhD. Thesis,' North Carolina State University, 1994