THROUGHPUT EQUIVALENCIES IN FORK JOIN QUEUING-NETWORKS WITH FINITE BUFFERS AND GENERAL SERVICE TIMES

Abstract

We consider finite-buffered fork/join queueing networks under the so-called 'blocking before service' mechanism. For such networks with exponential servers, Ammar and Gershwin (1989) showed some throughput equivalencies between different network configurations. We show that their result also holds even when service time distributions are general, using the sample path argument. Additional equivalencies are also suggested along with a remark on a multi-server case.