Article ID: | iaor20023166 |
Country: | United States |
Volume: | 15 |
Issue: | 3 |
Start Page Number: | 295 |
End Page Number: | 310 |
Publication Date: | Jan 2001 |
Journal: | Probability in the Engineering and Informational Sciences |
Authors: | Takahashi Y., Kawanishi K. |
Keywords: | simulation: applications, communication |
We present a performance analysis of a multiaddress call extraction server. The extraction server splits a multiaddress call into individual calls. The operation mechanisms of the server are complicated, and it is difficult to apply the standard Markov chain technique directly. Assuming the case when the server is offered by saturated input, we propose a simple probabilistic method to give the probability distribution that is related to the number of extracted calls. Applying the method, we also obtain the throughput of the extraction server. Assuming an unsaturated input, we evaluate the mean waiting time of an individual call using a diffusion approximation. Numerical simulations are performed and compared with our results. These results indicate the accuracy of our modeling approach.