An Analysis of a Multilayered Open Queueing Network with Population Constraint and Constraint and Constant Service Times

사용자수 제한을 갖는 개방형 다중계층구조의 대기행렬 네트워크 분석에 관한 연구

  • Published : 1999.12.01

Abstract

In this paper, we consider a queueing network model. where the population constraint within each subnetwork is controlled by a semaphore queue. The total number of customers that may be present in the subnetwork can not exceed a given value. Each node has a constant service time and the arrival process to the queueing network is an arbitrary distribution. A major characteristics of this model is that the lower layer flow is halted by the state of higher layer. We present some properties that the inter-change of nodes does not make any difference to customer's waiting time in the queueing network under a certain condition. The queueing network can be transformed into a simplified queueing network. A dramatic simplification of the queueing network is shown. It is interesting to see how the simplification developed for sliding window flow control, can be applied to multi-layered queueing network.

Keywords

References

  1. IEEE Transaction on comm. v.38 no.3 Semaphore queue : Modeling multilayered window flow control mechanisms Fdida, S.;H. Perros;A. Wilk
  2. Proceedings of the international seminar on computer networking and performance evaluation Comparison of communication services with connection-oriented and connectionless data transmission Gihr, O.;P. Kuehn
  3. IEEE J. Select. Comm. v.SAC-4 End-to-end performance modeling of local area networks Mitchell, L.;D. Lide
  4. IEEE Transaction on comm. v.23 Congestion control in store and forward tandem link Pennotti, M.;M. Schwartz
  5. IEEE Transaction on comm. v.27 A queueing network analysis of computer communication networks with window flow control Reiser, M.
  6. Proceeding of the IEEE v.70 no.2 Performance evaluation of data communication systems Reiser, M.
  7. European Journal of O.R. v.92 Analysis of an open tandem queueing network with population constraint and constant service times Rhee, Y.;H. Perros
  8. IIE Transaction v.30 On the mean waiting time of a population constrained open tandem queueing network with constant service times Rhee, Y.;H. Perros
  9. IEEE Transaction on comm. v.30 Performance analysis of the SNA virtual routing pacing control Schwartz, M.
  10. IEEE Trans. Comm. v.41 no.1 Nested sliding window protocols with packet fragmentation Shapiro, G.W.;H.G. Perros
  11. ACM SIGMETRICS conf. Analysis of queueing network models with population size constraints and delayed blocked customers Thomasian, A.;P. Bay
  12. ACM SIGMETRICS conf. Queueing delays on virtual circuits using a sliding window flow control scheme Varghee, G.;W. Chou;A. Nilsson