A New Recursive Method for the Mean Waiting Time in a Polling Network with Gated General Order Service
Summary :
A new recursive method for obtaining the mean waiting time in a polling system with general service order and gated service discipline is proposed. The analytical approach used to obtain the mean waiting time is via an imbedded Markov chain and a new recursive method is used to obtain the moments of pseudocycle time which are parameters in the formula for the mean waiting time. This method is computationally tractable, so the analytical results can cover a wide range of applications. Simulations are also conducted to verify the validity of the analysis.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E77-B No.8 pp.985-991
- Publication Date
- 1994/08/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Communication Networks and Service
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
Chung-Ju CHANG, Lain-Chyr HWANG, "A New Recursive Method for the Mean Waiting Time in a Polling Network with Gated General Order Service" in IEICE TRANSACTIONS on Communications,
vol. E77-B, no. 8, pp. 985-991, August 1994, doi: .
Abstract: A new recursive method for obtaining the mean waiting time in a polling system with general service order and gated service discipline is proposed. The analytical approach used to obtain the mean waiting time is via an imbedded Markov chain and a new recursive method is used to obtain the moments of pseudocycle time which are parameters in the formula for the mean waiting time. This method is computationally tractable, so the analytical results can cover a wide range of applications. Simulations are also conducted to verify the validity of the analysis.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e77-b_8_985/_p
Copy
@ARTICLE{e77-b_8_985,
author={Chung-Ju CHANG, Lain-Chyr HWANG, },
journal={IEICE TRANSACTIONS on Communications},
title={A New Recursive Method for the Mean Waiting Time in a Polling Network with Gated General Order Service},
year={1994},
volume={E77-B},
number={8},
pages={985-991},
abstract={A new recursive method for obtaining the mean waiting time in a polling system with general service order and gated service discipline is proposed. The analytical approach used to obtain the mean waiting time is via an imbedded Markov chain and a new recursive method is used to obtain the moments of pseudocycle time which are parameters in the formula for the mean waiting time. This method is computationally tractable, so the analytical results can cover a wide range of applications. Simulations are also conducted to verify the validity of the analysis.},
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - A New Recursive Method for the Mean Waiting Time in a Polling Network with Gated General Order Service
T2 - IEICE TRANSACTIONS on Communications
SP - 985
EP - 991
AU - Chung-Ju CHANG
AU - Lain-Chyr HWANG
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E77-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 1994
AB - A new recursive method for obtaining the mean waiting time in a polling system with general service order and gated service discipline is proposed. The analytical approach used to obtain the mean waiting time is via an imbedded Markov chain and a new recursive method is used to obtain the moments of pseudocycle time which are parameters in the formula for the mean waiting time. This method is computationally tractable, so the analytical results can cover a wide range of applications. Simulations are also conducted to verify the validity of the analysis.
ER -
English
