This paper studies the behaviour of a first-come-first-served queueing network with arrivals in batches of variable size and a certain service time distribution. The arrivals and departures of customers can take place only at the transition time marks and the intertransition time obeys a general distribution. The Laplace transforms of the probability generating functions for the queue length are obtained in the two cases; (i) when departures are correlated; (ii) when departures are uncorrelated; and the steady state results are derived therefrom. It has also been shown that the steady state continuous time solution is the same as the steady state discrete time solution.