On a synchronization queue with two finite buffers |
| |
Authors: | Takahashi Misa Ōsawa Hideo Fujisawa Takehisa |
| |
Affiliation: | (1) Department of Systems Engineering, The University of Electro-Communications, Tokyo 182-8585, Japan;(2) College of Business Administration, Aichi-Gakusen University, Toyota 471-8532, Japan |
| |
Abstract: | In this paper, we consider a synchronization queue (or synchronization node) consisting of two buffers with finite capacities. One stream of tokens arriving at the system forms a Poisson process and the other forms a PH-renewal process. The tokens are held in the buffers until one is available from each flow, and then a group-token is instantaneously released as a synchronized departure. We show that the output stream of a synchronization queue is a Markov renewal process, and that the time between consecutive departures has a phase type distribution. Thus, we obtain the throughput of this synchronization queue and the loss probabilities of each type of tokens. Moreover, we consider an extended synchronization model with two Poisson streams where a departing group-token consists of several tokens in each buffer. This revised version was published online in June 2006 with corrections to the Cover Date. |
| |
Keywords: | synchronization queue output process Markov renewal process matrix analytical method phase-type distribution |
本文献已被 SpringerLink 等数据库收录! |
|