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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Ken'ichi KAWANISHI, Yoshitaka TAKAHASHI, Toyofumi TAKENAKA, "Throughput Analysis of a Server with Heterogeneous Inputs for Facsimile Communication Networks" in IEICE TRANSACTIONS on Communications,
vol. E81-B, no. 10, pp. 1850-1858, October 1998, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e81-b_10_1850/_p
Copy
@ARTICLE{e81-b_10_1850,
author={Ken'ichi KAWANISHI, Yoshitaka TAKAHASHI, Toyofumi TAKENAKA, },
journal={IEICE TRANSACTIONS on Communications},
title={Throughput Analysis of a Server with Heterogeneous Inputs for Facsimile Communication Networks},
year={1998},
volume={E81-B},
number={10},
pages={1850-1858},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Throughput Analysis of a Server with Heterogeneous Inputs for Facsimile Communication Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1850
EP - 1858
AU - Ken'ichi KAWANISHI
AU - Yoshitaka TAKAHASHI
AU - Toyofumi TAKENAKA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E81-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 1998
AB - 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.
ER -