Abstract
For a general class of closed feed-forward fork and join queueing networks, we derive the tail asymptotics of transient cycle times and waiting times under the assumption that the service time distribution of at least one station is subexponential. We also argue that under certain conditions, the asymptotic tail distributions remain the same for stationary cycle times and waiting times.
Keywords:
Mathematics Subject Classification:
ACKNOWLEDGMENTS
We would like to thank the editor and two anonymous referees for their suggestions which have greatly improved and shortened the paper. Research was supported by the National Science Foundation under Grant DMI-9984352.