The joint distribution of sojourn times for a customer traversing an overtake-free series of queues: The discrete time case

We investigate a cycle of Bernoulli servers in discrete time. We show that the joint distribution of a customer’s sojourn times at the nodes during a round trip is of product form and can explicitly be written down. The results are used to prove independence of sojourn times in an open series of Bernoulli servers. This revised version was published online in June 2006 with corrections to the Cover Date.