/
/
/
On Synchronization Queues

On Synchronization Queues

Original Research ArticleMar 30, 2018Vol. 3 No. 1 (2003)

Abstract

This paper considers synchronization queues (or synchronization nodes) with two input flows and finite or infinite buffers. There is one flow of tokens for each buffer, called a stream. Each stream is assumed to be a point process with finite intensity. Tokens are held in the buffer until one is available from each flow and a group-token is instantaneously released as a synchronized departure. In this paper, we review the system state and the output processes of synchronization queues.

 Keywords: Synchronization queues, output process, Markov renewal process, matrix analytical method, phase-type distribution, point process, rate conservation law.

E-mail: cast@kmitl.ac.th

How to Cite

Ogawa, H. ., Shima, C. ., & Doi, M. . (2018). On Synchronization Queues. CURRENT APPLIED SCIENCE AND TECHNOLOGY, 55-66.

References

  • Bhat, U.N. (1986). Finite capacity assembly-like queues, Queueing Systems 1, 85-101.
  • Baccelli, F., Massey, W.A. and Towsley, D. (1989). Acyclic fork-join queueing networks, J. of A.C.M. 36, 615-542.
  • Hopp, W.J. and Simon, J.T. (1989). Bounds and heuristics for heuristics for assembly-like queues, Queueing Systems 4, 137-156.
  • Latouche, G. (1981). Queues with paired customers, Journal of Applied Probability 18. 684-696.
  • Lipper, E.H. and Sengupta, B. (1986). Assembly-like queues with finite capacity: bounds, asymptotic and approximations, Queueing Systems 1, 67-83.

Author Information

Hideo Ogawa

College of Economics, Nihon University, Japan

Chikayoshi Shima

College of Science and Engineering, Nihon University, Japan

Makoto Doi

Faculty of Science, Tokai University, Japan

About this Article

Journal

Vol. 3 No. 1 (2003)

Type of Manuscript

Original Research Article

Keywords

Synchronization queues, output process, Markov renewal process, matrix analytical method, phase-type distribution, point process, rate conservation law

Published

30 March 2018