ETRI Journal

  • 제31권1호
  • /
  • Pages.86-88
  • /
  • 2009
  • /
  • 1225-6463(pISSN)
  • /
  • 2233-7326(eISSN)
한국전자통신연구원 (Electronics and Telecommunications Research Institute)
권호 표지

Optimal Buffer Allocation in Tandem Queues with Communication Blocking

  • Seo, Dong-Won (College of Management and International Relations, Kyung Hee University) ;
  • Ko, Sung-Seok (Department of Industrial Engineering, Konkuk University) ;
  • Jung, Uk (Department of Management, Dongguk University)
  • 투고 : 2008.07.28
  • 심사 : 2008.10.21
  • 발행 : 2009.02.28
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this letter, we consider an m-node tandem queue (queues in series) with a Poisson arrival process and either deterministic or non-overlapping service times. With the assumption that each node has a finite buffer except for the first node, we show the non-increasing convex property of stationary waiting time with respect to the finite buffer capacities. We apply it to an optimization problem which determines the smallest buffer capacities subject to probabilistic constraints on stationary waiting times.

키워드

참고문헌

  1. D.-W. Seo, H. Lee, and S.-S. Ko, "Stationary Waiting Times in m-Node Tandem Queues with Communication Blocking," Int'l J. Manage. Sci., vol. 14, no. 1, 2008, pp. 23-34.
  2. F. Baccelli et al., Synchronization and Linearity: An Algebra for Discrete Event Systems, John Wiley & Sons, 1992.
  3. F. Baccelli and V. Schmidt, "Taylor Series Expansions for Poisson Driven (Max,+) Linear Systems," Annals of Applied Probability, vol. 6, no. 1, 1996, pp. 138-185. https://doi.org/10.1214/aoap/1034968069
  4. H. Ayhan and D.-W. Seo, "Tail Probability of Transient and Stationary Waiting Times in (Max,+)-Linear Systems," IEEE Trans. Automatic Control, vol. 47, no. 1, 2002, pp. 151-157. https://doi.org/10.1109/9.981736
  5. Y.-W. Wan and R.W. Wolff, "Bounds for Different Arrangements of Tandem Queues with Nonoverlapping Service Times," Management Science, vol. 39, no. 9, 1993, pp. 1173-1178. https://doi.org/10.1287/mnsc.39.9.1173