This paper proposes an improved dynamic bandwidth allocation algorithm for dual Quality of Service (QoS) classes to maximize the utilization rate of the Resilient Packet Ring (RPR). To achieve dynamic bandwidth allocation for the two QoS classes in the RPR, each node measures the high priority traffic flow and assigns the appropriate bandwidth; the remaining bandwidth is used for low priority traffic. It passes a control frame containing the measured bandwidth of the high priority traffic to the other nodes. Based on the advertised high priority traffic bandwidth, any node that is congested transmits, to the other nodes, a fairness message to fairly allocate the remaining low priority bandwidth. Simulations demonstrate that the proposed algorithm enhances the utilization rate and reduces the delay of high priority frames.
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.
Copy
Yasuyuki OKUMURA, "Dynamic Bandwidth Allocation Performance for Dual QoS Classes in Resilient Packet Ring" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 10, pp. 3226-3231, October 2008, doi: 10.1093/ietcom/e91-b.10.3226.
Abstract: This paper proposes an improved dynamic bandwidth allocation algorithm for dual Quality of Service (QoS) classes to maximize the utilization rate of the Resilient Packet Ring (RPR). To achieve dynamic bandwidth allocation for the two QoS classes in the RPR, each node measures the high priority traffic flow and assigns the appropriate bandwidth; the remaining bandwidth is used for low priority traffic. It passes a control frame containing the measured bandwidth of the high priority traffic to the other nodes. Based on the advertised high priority traffic bandwidth, any node that is congested transmits, to the other nodes, a fairness message to fairly allocate the remaining low priority bandwidth. Simulations demonstrate that the proposed algorithm enhances the utilization rate and reduces the delay of high priority frames.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.10.3226/_p
Copy
@ARTICLE{e91-b_10_3226,
author={Yasuyuki OKUMURA, },
journal={IEICE TRANSACTIONS on Communications},
title={Dynamic Bandwidth Allocation Performance for Dual QoS Classes in Resilient Packet Ring},
year={2008},
volume={E91-B},
number={10},
pages={3226-3231},
abstract={This paper proposes an improved dynamic bandwidth allocation algorithm for dual Quality of Service (QoS) classes to maximize the utilization rate of the Resilient Packet Ring (RPR). To achieve dynamic bandwidth allocation for the two QoS classes in the RPR, each node measures the high priority traffic flow and assigns the appropriate bandwidth; the remaining bandwidth is used for low priority traffic. It passes a control frame containing the measured bandwidth of the high priority traffic to the other nodes. Based on the advertised high priority traffic bandwidth, any node that is congested transmits, to the other nodes, a fairness message to fairly allocate the remaining low priority bandwidth. Simulations demonstrate that the proposed algorithm enhances the utilization rate and reduces the delay of high priority frames.},
keywords={},
doi={10.1093/ietcom/e91-b.10.3226},
ISSN={1745-1345},
month={October},}
Copy
TY - JOUR
TI - Dynamic Bandwidth Allocation Performance for Dual QoS Classes in Resilient Packet Ring
T2 - IEICE TRANSACTIONS on Communications
SP - 3226
EP - 3231
AU - Yasuyuki OKUMURA
PY - 2008
DO - 10.1093/ietcom/e91-b.10.3226
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2008
AB - This paper proposes an improved dynamic bandwidth allocation algorithm for dual Quality of Service (QoS) classes to maximize the utilization rate of the Resilient Packet Ring (RPR). To achieve dynamic bandwidth allocation for the two QoS classes in the RPR, each node measures the high priority traffic flow and assigns the appropriate bandwidth; the remaining bandwidth is used for low priority traffic. It passes a control frame containing the measured bandwidth of the high priority traffic to the other nodes. Based on the advertised high priority traffic bandwidth, any node that is congested transmits, to the other nodes, a fairness message to fairly allocate the remaining low priority bandwidth. Simulations demonstrate that the proposed algorithm enhances the utilization rate and reduces the delay of high priority frames.
ER -