IEICE TRANSACTIONS on Communications
A Waste-Free Fairness Control for Rings with Spatial Reuse
Summary :
While spatial reuse in a high-speed ring increases the throughput performance, it leads to a fairness problem in distributing the network bandwidth among distinct nodes. To alleviate this problem, fairness control algorithms based on a packet window have been developed. Under these algorithms, satisfied nodes are forced to pass empty slots to starved downstream nodes until their windows are refilled by a reset signal. This regulation incurs a bandwidth waste corresponding to the travel distance of those empty slots. In this paper, a waste-free fairness control method based on a two-layer window composed of the cycle and packet windows is developed. Using the proposed method, packets allocated to multiple fairness cycles are simultaneously transferred and, in consequence, the otherwise wasted bandwidth can be reused to carry, in advance, packets allocated to future fairness cycles. This method is applied to two typical ring protocols with only the packet window, ATMR and MetaRing, and their performances are investigated. The simulation results show that the cycle window is very effective to improve the performance of the ATMR and MetaRing protocols.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E84-B No.2 pp.305-316
- Publication Date
- 2001/02/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Network
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
Tae-Joon KIM, Dong-Ho CHO, "A Waste-Free Fairness Control for Rings with Spatial Reuse" in IEICE TRANSACTIONS on Communications,
vol. E84-B, no. 2, pp. 305-316, February 2001, doi: .
Abstract: While spatial reuse in a high-speed ring increases the throughput performance, it leads to a fairness problem in distributing the network bandwidth among distinct nodes. To alleviate this problem, fairness control algorithms based on a packet window have been developed. Under these algorithms, satisfied nodes are forced to pass empty slots to starved downstream nodes until their windows are refilled by a reset signal. This regulation incurs a bandwidth waste corresponding to the travel distance of those empty slots. In this paper, a waste-free fairness control method based on a two-layer window composed of the cycle and packet windows is developed. Using the proposed method, packets allocated to multiple fairness cycles are simultaneously transferred and, in consequence, the otherwise wasted bandwidth can be reused to carry, in advance, packets allocated to future fairness cycles. This method is applied to two typical ring protocols with only the packet window, ATMR and MetaRing, and their performances are investigated. The simulation results show that the cycle window is very effective to improve the performance of the ATMR and MetaRing protocols.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e84-b_2_305/_p
Copy
@ARTICLE{e84-b_2_305,
author={Tae-Joon KIM, Dong-Ho CHO, },
journal={IEICE TRANSACTIONS on Communications},
title={A Waste-Free Fairness Control for Rings with Spatial Reuse},
year={2001},
volume={E84-B},
number={2},
pages={305-316},
abstract={While spatial reuse in a high-speed ring increases the throughput performance, it leads to a fairness problem in distributing the network bandwidth among distinct nodes. To alleviate this problem, fairness control algorithms based on a packet window have been developed. Under these algorithms, satisfied nodes are forced to pass empty slots to starved downstream nodes until their windows are refilled by a reset signal. This regulation incurs a bandwidth waste corresponding to the travel distance of those empty slots. In this paper, a waste-free fairness control method based on a two-layer window composed of the cycle and packet windows is developed. Using the proposed method, packets allocated to multiple fairness cycles are simultaneously transferred and, in consequence, the otherwise wasted bandwidth can be reused to carry, in advance, packets allocated to future fairness cycles. This method is applied to two typical ring protocols with only the packet window, ATMR and MetaRing, and their performances are investigated. The simulation results show that the cycle window is very effective to improve the performance of the ATMR and MetaRing protocols.},
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - A Waste-Free Fairness Control for Rings with Spatial Reuse
T2 - IEICE TRANSACTIONS on Communications
SP - 305
EP - 316
AU - Tae-Joon KIM
AU - Dong-Ho CHO
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E84-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 2001
AB - While spatial reuse in a high-speed ring increases the throughput performance, it leads to a fairness problem in distributing the network bandwidth among distinct nodes. To alleviate this problem, fairness control algorithms based on a packet window have been developed. Under these algorithms, satisfied nodes are forced to pass empty slots to starved downstream nodes until their windows are refilled by a reset signal. This regulation incurs a bandwidth waste corresponding to the travel distance of those empty slots. In this paper, a waste-free fairness control method based on a two-layer window composed of the cycle and packet windows is developed. Using the proposed method, packets allocated to multiple fairness cycles are simultaneously transferred and, in consequence, the otherwise wasted bandwidth can be reused to carry, in advance, packets allocated to future fairness cycles. This method is applied to two typical ring protocols with only the packet window, ATMR and MetaRing, and their performances are investigated. The simulation results show that the cycle window is very effective to improve the performance of the ATMR and MetaRing protocols.
ER -
English
