The Stability of Randomly Addressed Polling Protocol
Summary :
In this paper, we first prove that the Randomly Addressed Polling (RAP) protocol is unstable under the random access channel with heavy traffic. We also show that network stability can be ensured by controlling the arrival rate λ or by expanding the available addresses p on the assumption that there are M finite stations within the coverage of the controller (the base station). From analyses and results, we see the equilibrium of arrival rate is inversely proportional to the product of users (stations) and the exponent of stations. We also see that the maximum throughput can be derived at the point of λ
- Publication
- IEICE TRANSACTIONS on Communications Vol.E80-B No.10 pp.1502-1508
- Publication Date
- 1997/10/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Network Interworking)
- Category
- Communication protocol
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
Jiang-Whai DAI, "The Stability of Randomly Addressed Polling Protocol" in IEICE TRANSACTIONS on Communications,
vol. E80-B, no. 10, pp. 1502-1508, October 1997, doi: .
Abstract: In this paper, we first prove that the Randomly Addressed Polling (RAP) protocol is unstable under the random access channel with heavy traffic. We also show that network stability can be ensured by controlling the arrival rate λ or by expanding the available addresses p on the assumption that there are M finite stations within the coverage of the controller (the base station). From analyses and results, we see the equilibrium of arrival rate is inversely proportional to the product of users (stations) and the exponent of stations. We also see that the maximum throughput can be derived at the point of λ
URL: https://global.ieice.org/en_transactions/communications/10.1587/e80-b_10_1502/_p
Copy
@ARTICLE{e80-b_10_1502,
author={Jiang-Whai DAI, },
journal={IEICE TRANSACTIONS on Communications},
title={The Stability of Randomly Addressed Polling Protocol},
year={1997},
volume={E80-B},
number={10},
pages={1502-1508},
abstract={In this paper, we first prove that the Randomly Addressed Polling (RAP) protocol is unstable under the random access channel with heavy traffic. We also show that network stability can be ensured by controlling the arrival rate λ or by expanding the available addresses p on the assumption that there are M finite stations within the coverage of the controller (the base station). From analyses and results, we see the equilibrium of arrival rate is inversely proportional to the product of users (stations) and the exponent of stations. We also see that the maximum throughput can be derived at the point of λ
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - The Stability of Randomly Addressed Polling Protocol
T2 - IEICE TRANSACTIONS on Communications
SP - 1502
EP - 1508
AU - Jiang-Whai DAI
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E80-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 1997
AB - In this paper, we first prove that the Randomly Addressed Polling (RAP) protocol is unstable under the random access channel with heavy traffic. We also show that network stability can be ensured by controlling the arrival rate λ or by expanding the available addresses p on the assumption that there are M finite stations within the coverage of the controller (the base station). From analyses and results, we see the equilibrium of arrival rate is inversely proportional to the product of users (stations) and the exponent of stations. We also see that the maximum throughput can be derived at the point of λ
ER -
English
