Assembly-like queues with finite capacity: bounds, asymptotics and approximations
Queueing Systems: Theory and Applications
Finite capacity assembly like queues
Queueing Systems: Theory and Applications
Acyclic fork-join queuing networks
Journal of the ACM (JACM)
Simulation model for extended double-ended queueing
Computers and Industrial Engineering
Performance evaluation of a synchronization station with multiple inputs and population constraints
Computers and Operations Research
| Hi-index | 0.00 |
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.