Tandem behavior of a telecommunication system with repeated calls: II, A general case without buffers

The performance of a telecommunication system consisting of a set of transmitters without local buffers is modelled by a queueing network, and its tandem behavior is approximated in steady state. In this system, a fraction of the units which as the instants of their arrival at each transmitter find it busy may retry to be processed by merging with the incoming arrival units at the same transmitter, after a fixed delay time. The performance of this system is approximated by a recursive algorithm. Furthermore, a numerical example is presented and the approximation outcomes are compared against those from a simulation study.