Tandem Behaviour of a Telecommunication System with Repeated Calls: A Markovian Case with Buffers
研究了一个由有限容量缓冲区发射机组成的电信系统，用马尔可夫排队网络建模其稳态串联行为，其中部分遇忙呼叫会延迟重试，并通过递归算法近似系统性能，与仿真结果对比验证了近似方法的有效性。
The performance of a telecommunication system consisting of a set of transmitters with finite capacity buffers is modelled with a Markovian queueing network, and its tandem behaviour is approximated, in steady state. In this system, a fraction of the units which, at 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, in steady state. Furthermore, the approximation outcomes are compared against those from a simulation study. In summary, our numerical results indicate that approximating the non-renewal superposition arrival, the non-renewal overflow and the non-renewal departure processes at each node of the network can be approximated with compatible Poisson processes.