Analysis of a High-Speed Slotted Ring with Single Packet Buffers

Woo Young JUNG; Chong Kwan UN

Analysis of a High-Speed Slotted Ring with Single Packet Buffers

Woo Young JUNG, Chong Kwan UN

Full Text Views

0

Cite this

Summary :

In this paper, we present an analysis of a high-speed slotted ring with a single packet buffer at each station. Assuming that distances between stations affect the network performance only through the sum of themselves (this will be called the "lumpability assumption"), we introduce a model system called the lumped model in which stations are aggregated at a single point on the ring with their relative positions preserved. At the instant when each slot visits the aggregated point of the lumped model, we build a Markov chain by recording the system state of buffers and slots. From the steady state probabilities of the Markov chain, we obtain the mean waiting time and the blocking probability of each station. It will be shown analytically and by simulation that the analysis based on the lumped model yields accurate results for various network conditions.

Publication: IEICE TRANSACTIONS on Communications Vol.E78-B No.6 pp.877-882

Publication Date: 1995/06/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Communication Networks and Service

Cite this

Copy

Woo Young JUNG, Chong Kwan UN, "Analysis of a High-Speed Slotted Ring with Single Packet Buffers" in IEICE TRANSACTIONS on Communications, vol. E78-B, no. 6, pp. 877-882, June 1995, doi: .
Abstract: In this paper, we present an analysis of a high-speed slotted ring with a single packet buffer at each station. Assuming that distances between stations affect the network performance only through the sum of themselves (this will be called the "lumpability assumption"), we introduce a model system called the lumped model in which stations are aggregated at a single point on the ring with their relative positions preserved. At the instant when each slot visits the aggregated point of the lumped model, we build a Markov chain by recording the system state of buffers and slots. From the steady state probabilities of the Markov chain, we obtain the mean waiting time and the blocking probability of each station. It will be shown analytically and by simulation that the analysis based on the lumped model yields accurate results for various network conditions.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e78-b_6_877/_p

Copy

@ARTICLE{e78-b_6_877,
author={Woo Young JUNG, Chong Kwan UN, },
journal={IEICE TRANSACTIONS on Communications},
title={Analysis of a High-Speed Slotted Ring with Single Packet Buffers},
year={1995},
volume={E78-B},
number={6},
pages={877-882},
abstract={In this paper, we present an analysis of a high-speed slotted ring with a single packet buffer at each station. Assuming that distances between stations affect the network performance only through the sum of themselves (this will be called the "lumpability assumption"), we introduce a model system called the lumped model in which stations are aggregated at a single point on the ring with their relative positions preserved. At the instant when each slot visits the aggregated point of the lumped model, we build a Markov chain by recording the system state of buffers and slots. From the steady state probabilities of the Markov chain, we obtain the mean waiting time and the blocking probability of each station. It will be shown analytically and by simulation that the analysis based on the lumped model yields accurate results for various network conditions.},
keywords={},
doi={},
ISSN={},
month={June},}

Copy

TY - JOUR
TI - Analysis of a High-Speed Slotted Ring with Single Packet Buffers
T2 - IEICE TRANSACTIONS on Communications
SP - 877
EP - 882
AU - Woo Young JUNG
AU - Chong Kwan UN
PY - 1995
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E78-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 1995
AB - In this paper, we present an analysis of a high-speed slotted ring with a single packet buffer at each station. Assuming that distances between stations affect the network performance only through the sum of themselves (this will be called the "lumpability assumption"), we introduce a model system called the lumped model in which stations are aggregated at a single point on the ring with their relative positions preserved. At the instant when each slot visits the aggregated point of the lumped model, we build a Markov chain by recording the system state of buffers and slots. From the steady state probabilities of the Markov chain, we obtain the mean waiting time and the blocking probability of each station. It will be shown analytically and by simulation that the analysis based on the lumped model yields accurate results for various network conditions.
ER -