Throughput equivalencies in fork/join queueing networks with finite buffers and general service times

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