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
Ogawa, H. ., Shima, C. ., & Doi, M. . (2018). On Synchronization Queues. CURRENT APPLIED SCIENCE AND TECHNOLOGY, 55-66.

https://cast.kmitl.ac.th/articles/144348