Throughput analysis of a server with heterogeneous inputs for facsimile communication networks

We present a throughput analysis of a multi-address call extraction server in F-NET. The extraction server splits a multi-address call into individual calls. Since the actual operation mechanisms of the server are complicated, it is difficult to directly apply the standard Markov chain technique. Restricting ourselves to the case where the server is offered by a saturated input process, we propose a simple probabilistic method to investigate the departure process of the server and its asymptotic behavior. Numerical examples evaluated by the method are compared with simulations, which demonstrate the accuracy of our modeling approach.