IEICE TRANSACTIONS on transactions
An Approximation Method for Queueing Networks with Nonpreemptive Priority and Its Performance
Summary :
An approximation method for analyzing open queueing networks with nonpreemptive priority is presented. This method takes into account the variability of the arrival processes and service times for each node in the network, and hence a general class of non-Markovian models can be analyzed. The approximation procedure has following three steps: (1) the separation of the two-class priority network into two single-class networks, (2) the analysis of the flow rates and variability parameters of internal arrival processes for each class network, (3) calculation of traffic characteristics for each node in the single-class networks. For the first step, a two-parameter virtual server method is established, in which the arrival processes and service times are approximately characterized by the first and second moments. The second step is based on the decomposition method for single-class non-Markovian networks. At the third step, traffic characteristics for the entire networks are obtained by assuming that the nodes are independent. It is possible to quickly analyze large network models by this approach, because the procedure does not require iteration or a great amount of calculation. Numerical results are given and validated by exact and simulation results for a tandem network model and by simulatons for the basic component models of complex networks. Also, we apply our approximation method to an end-to-end delay analysis for a packet-switching network for voice and data. The results indicates that the accuracy of the approximation method is sufficient for practical use.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E73-E No.3 pp.386-394
- Publication Date
- 1990/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Switching and Communication Processing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Hideaki YOSHINO, "An Approximation Method for Queueing Networks with Nonpreemptive Priority and Its Performance" in IEICE TRANSACTIONS on transactions,
vol. E73-E, no. 3, pp. 386-394, March 1990, doi: .
Abstract: An approximation method for analyzing open queueing networks with nonpreemptive priority is presented. This method takes into account the variability of the arrival processes and service times for each node in the network, and hence a general class of non-Markovian models can be analyzed. The approximation procedure has following three steps: (1) the separation of the two-class priority network into two single-class networks, (2) the analysis of the flow rates and variability parameters of internal arrival processes for each class network, (3) calculation of traffic characteristics for each node in the single-class networks. For the first step, a two-parameter virtual server method is established, in which the arrival processes and service times are approximately characterized by the first and second moments. The second step is based on the decomposition method for single-class non-Markovian networks. At the third step, traffic characteristics for the entire networks are obtained by assuming that the nodes are independent. It is possible to quickly analyze large network models by this approach, because the procedure does not require iteration or a great amount of calculation. Numerical results are given and validated by exact and simulation results for a tandem network model and by simulatons for the basic component models of complex networks. Also, we apply our approximation method to an end-to-end delay analysis for a packet-switching network for voice and data. The results indicates that the accuracy of the approximation method is sufficient for practical use.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e73-e_3_386/_p
Copy
@ARTICLE{e73-e_3_386,
author={Hideaki YOSHINO, },
journal={IEICE TRANSACTIONS on transactions},
title={An Approximation Method for Queueing Networks with Nonpreemptive Priority and Its Performance},
year={1990},
volume={E73-E},
number={3},
pages={386-394},
abstract={An approximation method for analyzing open queueing networks with nonpreemptive priority is presented. This method takes into account the variability of the arrival processes and service times for each node in the network, and hence a general class of non-Markovian models can be analyzed. The approximation procedure has following three steps: (1) the separation of the two-class priority network into two single-class networks, (2) the analysis of the flow rates and variability parameters of internal arrival processes for each class network, (3) calculation of traffic characteristics for each node in the single-class networks. For the first step, a two-parameter virtual server method is established, in which the arrival processes and service times are approximately characterized by the first and second moments. The second step is based on the decomposition method for single-class non-Markovian networks. At the third step, traffic characteristics for the entire networks are obtained by assuming that the nodes are independent. It is possible to quickly analyze large network models by this approach, because the procedure does not require iteration or a great amount of calculation. Numerical results are given and validated by exact and simulation results for a tandem network model and by simulatons for the basic component models of complex networks. Also, we apply our approximation method to an end-to-end delay analysis for a packet-switching network for voice and data. The results indicates that the accuracy of the approximation method is sufficient for practical use.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - An Approximation Method for Queueing Networks with Nonpreemptive Priority and Its Performance
T2 - IEICE TRANSACTIONS on transactions
SP - 386
EP - 394
AU - Hideaki YOSHINO
PY - 1990
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E73-E
IS - 3
JA - IEICE TRANSACTIONS on transactions
Y1 - March 1990
AB - An approximation method for analyzing open queueing networks with nonpreemptive priority is presented. This method takes into account the variability of the arrival processes and service times for each node in the network, and hence a general class of non-Markovian models can be analyzed. The approximation procedure has following three steps: (1) the separation of the two-class priority network into two single-class networks, (2) the analysis of the flow rates and variability parameters of internal arrival processes for each class network, (3) calculation of traffic characteristics for each node in the single-class networks. For the first step, a two-parameter virtual server method is established, in which the arrival processes and service times are approximately characterized by the first and second moments. The second step is based on the decomposition method for single-class non-Markovian networks. At the third step, traffic characteristics for the entire networks are obtained by assuming that the nodes are independent. It is possible to quickly analyze large network models by this approach, because the procedure does not require iteration or a great amount of calculation. Numerical results are given and validated by exact and simulation results for a tandem network model and by simulatons for the basic component models of complex networks. Also, we apply our approximation method to an end-to-end delay analysis for a packet-switching network for voice and data. The results indicates that the accuracy of the approximation method is sufficient for practical use.
ER -
English
