Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-27T08:21:06.371Z Has data issue: false hasContentIssue false
  • English
  • Français

PERFORMANCE ANALYSIS OF A SERVER FOR FACSIMILE COMMUNICATION NETWORKS

Published online by Cambridge University Press:  27 July 2001

Ken'ichi Kawanishi  and
Yoshitaka Takahashi
Ken'ichi Kawanishi
Affiliation:
NTT Service Integration Laboratories, 3-9-11, Midori-cho, Musashino-shi, Tokyo 180-8585, Japan, E-mail: [email protected]
Yoshitaka Takahashi
Affiliation:
NTT Service Integration Laboratories, 3-9-11, Midori-cho, Musashino-shi, Tokyo 180-8585, Japan, E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 15 , Issue 3 , July 2001 , pp. 295 - 310
Copyright
© 2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)