A tandem network with MAP inputs

This paper studies a tandem queue with MAP inputs. A novel formulation is proposed to model it into a level-dependent quasi-birth–death process with expanding blocks. This allows us to analyze the joint time-dependent and steady-state queue length distributions efficiently. We also obtain the network sojourn time of an arbitrary customer.