Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

An Impact Analysis of Window Mechanism and End to End Delay of Tandem Queueing Network with Constant Service Times

상수 서비스 시간을 갖는 개방형 대기행렬의 종대종 지연과 윈도우 구조의 영향 분석

  • 이영 (계명대학교 산업시스템공학과)
  • Published : 2004.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we investigate the impact of window mechanisms on end to end delay in a series of nodes with constant service times. It is shown that arbitrary combinations of window mechanisms, each applying to an arbitrary subset of data, can be embedded on the nodes without affecting the departure instants from the system if the windows are at least as large as the number of nodes spanned. The window mechanisms are shown to have no impact on the average end to end delay of data. As the condition on the windows is a minimal necessary requirement for full parallelism, the results show that the transparent operation from viewpoint of data transmission can be achieved with minimal resources.

Keywords

References

  1. Baynat, B. and Dallery, Y., 'On product form approximation techniques for general closed queueing networks,' Tech Rep. MASI, 1987
  2. Bertsekas, D. and Gallager, R., Data Networks, Prentice-Hall, 1992
  3. Dalleη, Y., 'Approximate analysis of general open queueing networks with restricted capacity,' Tech Rep., LAG, N 87-08, 1987, revised Feb. 1989
  4. Fdida, S., Perros, H. and Wilk, A., 'Semaphore queue: modeling multilayered window flow mechanisms,' IEEE Trans. on comm., Vol.38, No.3(1990), pp.309-317 https://doi.org/10.1109/26.48888
  5. Kant, K., Introduction to computer performance evaluation, McGraw-Hill, New York, 1992
  6. Liberropoulos, G. and Dallery, Y., 'A unified framework for pull control mechanism in multi-stage manufacturing systems,' Annals of OR., Vol.93(2000), pp.325-355
  7. Reiser, M., 'A queueing network analysis of computer communication networks with window flow control,' IEEE Trans. on comm., Vol.23(1975), pp.1199-1209
  8. Reiser, M., 'Performance evaluation of data communication systems,' Proceeding of the IEEE, Vol.70-2(1982), pp.171-182
  9. Rhee, Y. and Perros, H., 'Analysis of an open tandem queueing network with population constraint and constant service times,' European Journal of OR., Vol.92(1996), pp.99-111
  10. Rhee, Y. and Perros, H., 'On the mean wait ing time of a population constrained open tandem queueing network with constant service times,' IIE Transaction, Vol.30(1998), pp.973-979
  11. Shapiro, G. and Perros, H., 'Nested Sliding window protocols with packet fragmentation,' IEEE Trans. on comm., Vol.41, No.1(1993), pp.99-109 https://doi.org/10.1109/26.212369
  12. Thomasian, A. and Bay, P., 'Analysis of queueing network models with population size constraints and delayed block customers,' ACM SIGMETRICS conf., Cambridge, 1984, pp.202-216
  13. Varge, G., Chou, W. and Nilsson, A., 'Queueing delays on circuits using a sliding win dow flow control scheme,' ACM SIGMETRICS conf., Minneapolis, 1983, pp.275-281