Journal of the Korea Society for Simulation (한국시뮬레이션학회논문지)

The Korea Society for Simulation (한국시뮬레이션학회)
권호 표지
DOI QR코드

DOI QR Code

Stationary Waiting Times in Simple Fork-and-Join Queues with Finite Buffers and Communication Blocking

통신차단규칙을 따르는 유한버퍼 단순 조립형 대기행렬 망에서의 안정대기시간

  • Received : 2010.07.28
  • Accepted : 2010.09.18
  • Published : 2010.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

In this study, we consider stationary waiting times in a simple fork-and-join type queue which consists of three single-server machines, Machine 1, Machine 2, and Assembly Machine. We assume that the queue has a renewal arrival process and that independent service times at each node are either deterministic or non-overlapping. We also assume that the Machines 1 and 2 have an infinite buffer capacity whereas the Assembly Machine has two finite buffers, one for each machine. Services at each machine are given by FIFO service discipline and a communication blocking policy. We derive the explicit expressions for stationary waiting times at all nodes as a function of finite buffer capacities by using (max,+)-algebra. Various characteristics of stationary waiting times such as mean, higher moments, and tail probability can be computed from these expressions.

본 연구에서는 3개의 단일서버 노드(기계 1, 기계 2, 조립기계)로 구성된 단순 조립형 대기행렬 망의 안정대기시간에 대해 분석한다. 하나의 재생도착과정을 가정하며, 각 기계의 서비스시간은 서로 독립이며 상수 또는 겹침이 없는 시간으로 가정한다. 기계 1과 기계 2는 무한크기의 버퍼를 가지며, 조립기계는 각 기계로부터의 이송되는 부품을 위해 2개의 유한버퍼를 가진다. 각 기계는 FIFO 규칙과 통신차단규칙에 따라 서비스를 제공한다. 단순 조립형 대기행렬 망의 안정대기시간에 대한 간결한 표현식을 (max,+)-대수를 활용하여 유한버퍼의 크기에 대한 함수의 형태로 도출하였다. 이러한 표현식으로부터 평균, 고차평균, 꼬리확률과 같은 다양한 성능 특성치들의 값을 구할 수 있다.

Keywords

References

  1. Ayhan, H. and D.-W. Seo, "Laplace transform and moments of waiting times in poisson driven (max,+)-linear systems" Queueing Systems, Vol. 37, No. 4, pp. 405-438, 2001. https://doi.org/10.1023/A:1010845618420
  2. Ayhan, H. and D.-W. Seo, "Tail probability of transient and stationary waiting times in (max,+)-linear systems," IEEE Transactions on Automatic Control, Vol. 47, No. 1, pp. 151-157, 2002. https://doi.org/10.1109/9.981736
  3. Baccelli, F., G. Cohen, G. J. Olsder, and J-P. Quadrat, Synchronization and Linearity: An Algebra for Discrete Event Systems, John Wiley and Sons, 1992.
  4. Baccelli, F., S. Hasenfuss, and V. Schmidt, "Transient and stationary waiting times in (max,+) linear systems with poisson input," Queueing Systems, Vol. 26, pp. 301-342, 1997. https://doi.org/10.1023/A:1019141510202
  5. Baccelli, F., S. Hasenfuss, and V. Schmidt, "Expansions for steady state characteristics in (max,+) linear systems," Stochastic Models, Vol. 14, pp. 1-24, 1998. https://doi.org/10.1080/15326349808807458
  6. Baccelli, F. and A. M. Makowski, Simple computable bounds for the fork-Join queue, In proc. Johns Hopkins Conf. Inf. Sci., Johns Hopkins University Press, Baltimore, MD, 1985.
  7. Baccelli, F., A. M. Makowski and A. Shwartz, "The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds," Advanced Applied Probability, Vol. 21, pp. 629-660, 1989. https://doi.org/10.2307/1427640
  8. Baccelli, F. and V. Schmidt, "Taylor series expansions for poisson driven (max,+) linear systems," Annals of Applied Probability, Vol. 6, No. 1, pp. 138-185, 1996. https://doi.org/10.1214/aoap/1034968069
  9. Balsamo, S., L. Donatietllo, and N. M. Van Dijk, "Bound performance models of heterogeneous parallel processing systems," IEEE transactions on Parallel Distributed Systems, Vol. 9, pp. 1041-1056, 1998. https://doi.org/10.1109/71.730531
  10. Flatto, L., "Two parallel queues created by arrivals with two demands II," SIAM Journal of Applied Mathematics, Vol. 45, pp. 861-878, 1985. https://doi.org/10.1137/0145052
  11. Flatto, L. and S. Hahn, "Two parallel queues created by arrivals with two demands I," SIAM Journal of Applied Mathematics, Vol. 44, pp. 1041-1053, 1984. Erratum: Vol. 45, pp. 168, 1985. https://doi.org/10.1137/0144074
  12. Hasenfuss, S., "Performance analysis of (max,+)-linear systems via taylor series expansions," Ph.D. thesis, Shaker Verlag, Ulm, 1997.
  13. Heidergott, B., Max-plus linear stochastic systems and perturbation analysis, Springer, 2006.
  14. Nelson, R. and A. N. Tantawi, "Approximation analysis of fork/join synchronization in parallel queues," IEEE Transactions on Computers, Vol. 37, pp. 739-743, 1998.
  15. Raghavan, N. R. S. and N. Viswanadham, "Generalized queueing network analysis of integrated supply chains," International Journal of Production Research, Vol. 39, pp. 205-224, 2001. https://doi.org/10.1080/00207540010003846
  16. Seo, D.‐W., "Application of (max,+)-algebra to the waiting times in deterministic 2-node tandem queues with blocking," J. KORMS Society, Vol. 30, No. 1, pp. 149- 159, 2005.
  17. Seo, D.-W., "Application of (max,+)-algebra to the waiting times in deterministic 3-node tandem queues with blocking," J. KORMS Society, Vol. 30, No. 2, pp. 73-80, 2005.
  18. Varma, S. and A. Makowski, "Interpolation approximations for symmetric fork-join queues," Performance Evaluation, Vol. 20, pp. 245-2654, 1994. https://doi.org/10.1016/0166-5316(94)90016-7
  19. Wan, Y.-W., and R. W. Wolff, "Bounds for different arrangements of tandem queues with non-overlapping service times," Management Science, Vol. 39, No. 9, pp. 1173-1178, 1993. https://doi.org/10.1287/mnsc.39.9.1173
  20. Whitt, W., "The best order for queues in series," Management Science, Vol. 31, No. 4, pp. 475-487, 1985. https://doi.org/10.1287/mnsc.31.4.475