Waiting-Time Analysis of the Demand-Priority Access Method

Winston Khoon-Guan SEAH; Yutaka TAKAHASHI; Toshiharu HASEGAWA

Waiting-Time Analysis of the Demand-Priority Access Method

Winston Khoon-Guan SEAH, Yutaka TAKAHASHI, Toshiharu HASEGAWA

Full Text Views

0

Share
Cite this

Summary :

In this paper, we derive the mean message waiting times in a local area network that uses the Demand-Priority Access Method. We model the system as a two-priority M/G/1 queue with switchover time between service periods. This switchover time accounts for the polling and port selection performed by the repeater after each message transmission. The service discipline is non-preemptive and the length of the switchover time is dependent upon the priority class of the preceding message served as well as that of the message to be served next. The dependency in the switchover times is motivated by the polling and port selection operation of the protocol and it makes the analysis much more involved. In order to avoid the complexities of an exact analysis, we make some independence assumptions and thus obtain an approximate solution. Laplace-Stieltjes transforms of the stationary probability distribution functions for the waiting time of high- and normal-priority messages are derived, and subsequently, the expressions for the mean message waiting times. Numerical results computed using these expressions are verified using simulations which model the actual protocol. These numerical results which are shown to be accurate can be easily computed with widely available mathematical software.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E80-A No.9 pp.1684-1697

Publication Date: 1997/09/25

Publicized

Online ISSN

DOI

Type of Manuscript

Category: Modeling and Simulation

Cite this

Copy

Winston Khoon-Guan SEAH, Yutaka TAKAHASHI, Toshiharu HASEGAWA, "Waiting-Time Analysis of the Demand-Priority Access Method" in IEICE TRANSACTIONS on Fundamentals, vol. E80-A, no. 9, pp. 1684-1697, September 1997, doi: .
Abstract: In this paper, we derive the mean message waiting times in a local area network that uses the Demand-Priority Access Method. We model the system as a two-priority M/G/1 queue with switchover time between service periods. This switchover time accounts for the polling and port selection performed by the repeater after each message transmission. The service discipline is non-preemptive and the length of the switchover time is dependent upon the priority class of the preceding message served as well as that of the message to be served next. The dependency in the switchover times is motivated by the polling and port selection operation of the protocol and it makes the analysis much more involved. In order to avoid the complexities of an exact analysis, we make some independence assumptions and thus obtain an approximate solution. Laplace-Stieltjes transforms of the stationary probability distribution functions for the waiting time of high- and normal-priority messages are derived, and subsequently, the expressions for the mean message waiting times. Numerical results computed using these expressions are verified using simulations which model the actual protocol. These numerical results which are shown to be accurate can be easily computed with widely available mathematical software.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e80-a_9_1684/_p

Copy

@ARTICLE{e80-a_9_1684,
author={Winston Khoon-Guan SEAH, Yutaka TAKAHASHI, Toshiharu HASEGAWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Waiting-Time Analysis of the Demand-Priority Access Method},
year={1997},
volume={E80-A},
number={9},
pages={1684-1697},
abstract={In this paper, we derive the mean message waiting times in a local area network that uses the Demand-Priority Access Method. We model the system as a two-priority M/G/1 queue with switchover time between service periods. This switchover time accounts for the polling and port selection performed by the repeater after each message transmission. The service discipline is non-preemptive and the length of the switchover time is dependent upon the priority class of the preceding message served as well as that of the message to be served next. The dependency in the switchover times is motivated by the polling and port selection operation of the protocol and it makes the analysis much more involved. In order to avoid the complexities of an exact analysis, we make some independence assumptions and thus obtain an approximate solution. Laplace-Stieltjes transforms of the stationary probability distribution functions for the waiting time of high- and normal-priority messages are derived, and subsequently, the expressions for the mean message waiting times. Numerical results computed using these expressions are verified using simulations which model the actual protocol. These numerical results which are shown to be accurate can be easily computed with widely available mathematical software.},
keywords={},
doi={},
ISSN={},
month={September},}

Copy

TY - JOUR
TI - Waiting-Time Analysis of the Demand-Priority Access Method
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1684
EP - 1697
AU - Winston Khoon-Guan SEAH
AU - Yutaka TAKAHASHI
AU - Toshiharu HASEGAWA
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E80-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 1997
AB - In this paper, we derive the mean message waiting times in a local area network that uses the Demand-Priority Access Method. We model the system as a two-priority M/G/1 queue with switchover time between service periods. This switchover time accounts for the polling and port selection performed by the repeater after each message transmission. The service discipline is non-preemptive and the length of the switchover time is dependent upon the priority class of the preceding message served as well as that of the message to be served next. The dependency in the switchover times is motivated by the polling and port selection operation of the protocol and it makes the analysis much more involved. In order to avoid the complexities of an exact analysis, we make some independence assumptions and thus obtain an approximate solution. Laplace-Stieltjes transforms of the stationary probability distribution functions for the waiting time of high- and normal-priority messages are derived, and subsequently, the expressions for the mean message waiting times. Numerical results computed using these expressions are verified using simulations which model the actual protocol. These numerical results which are shown to be accurate can be easily computed with widely available mathematical software.
ER -