Some Theoretical Results on the Algorithm for the Tree-like Queueing Networks with Blocking

봉쇄가 존재하는 나무형태 대기행렬 네트워크 알고리듬의 이론적 고찰

  • Published : 1997.12.01

Abstract

Recently Lee et al[5] developed an approximation algorithm for the performance evaluation of the open queueing networks with blocking. This algorithm, which solves the exponential queueing networks with general configuration is developed based on the symmetrical decomposition approach and is reported to have many advantages over the previous algorithmsf. In addition to being very accurate, this algorithm is reported to be quite simple, pretty fast and solves very general configurations. In this study, we show that if a network has a tree-like configurations, the algorithm developed by Lee at al, always converges to the unique solution. To prove the theoretical results pertaining to the algorithm, some properties associated with symmetrical decomposition approach are exploited. The results obtained in this study such as the proofs of convergence of the algorithm as well as uniquences of the solution would contribute to the theoretical study for the non-tandem configurating of open queueing network.

Keywords

References

  1. Annals of Opns. Res. v.9 Approximate Analysis of Arbitrary Configurations of Open Queueing Networks with Blocking T. Altiok;H. G. Perros
  2. Opns. Res. v.41 On Decomposition Methods for Tandem Queueing Networks with Blocking Y. Dallery;Y. Frein
  3. Queueing Sys. v.12 Manufacturing Flow Line Systems : a review of models and analytical results Y. Dallery;S. B. Gershwin
  4. Opns. Res. v.38 Approximate Analysis of Open Acyclic Exponential Queueing Networks with Blocking H. S. Lee;S. M. Pollock
  5. Annals of Opns. Res. Performance Evaluation of Open Queueing Networks with Arbitrary Configuration and Finite Buffers H. S. Lee;A. Bouhchouch;Y. Frein;Y. Dallery
  6. ACM Computing Surveys v.22 Survey of Closed Queueing Networks with Blocking K. O. Onvural
  7. Perf. Eval. Rev. v.12 Queueing Networks with Blocking: A Bibliography H. G. Perros
  8. Queueing Networks with Blocking H. G. Perros
  9. Performance Evaluation A Computationally Efficient Approximation Algorithm for Analyzing Open Queueing Networks with Blocking H. G. Perros;P. M. Snyder
  10. Opns. Res. v.28 An Approximation Method for Open Restricted Queueing Networks Y. Takahashi;H. Miyahara;J. Hasegawa