Metro networks are based on SONET/SDH which uses the circuit switching technology. Circuit switching is inappropriate for the Internet traffic which is very bursty nature. Therefore, metro networks can become a bottleneck. In order to resolve this problem, the IEEE 802.17 working group has proposed the Resilient Packet Ring (RPR) technology. In order to provide fairness among stations in the RPR network, two types of RPR fairness mechanisms have been defined. However, the IEEE 802.17 RPR fairness mechanisms have the problem of inefficient use of the available bandwidth after the congestion at a node has been resolved. In this paper, we propose an improved bandwidth allocation in which, after the congestion resolution at a node, the node estimates the number of effective nodes transmitting traffic, measures the remaining bandwidth and fairly allocates the available bandwidth to effective nodes. To show the performance of our proposed mechanism, we have performed simulation and show that the proposed mechanism gives higher bandwidth utilization than the existing RPR fairness mechanisms.
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
Dong-Hun LEE, Jae-Hwoon LEE, "A Novel Fairness Mechanism Based on the Number of Effective Nodes for Efficient Bandwidth Allocation in the Resilient Packet Ring" in IEICE TRANSACTIONS on Communications,
vol. E89-B, no. 5, pp. 1526-1533, May 2006, doi: 10.1093/ietcom/e89-b.5.1526.
Abstract: Metro networks are based on SONET/SDH which uses the circuit switching technology. Circuit switching is inappropriate for the Internet traffic which is very bursty nature. Therefore, metro networks can become a bottleneck. In order to resolve this problem, the IEEE 802.17 working group has proposed the Resilient Packet Ring (RPR) technology. In order to provide fairness among stations in the RPR network, two types of RPR fairness mechanisms have been defined. However, the IEEE 802.17 RPR fairness mechanisms have the problem of inefficient use of the available bandwidth after the congestion at a node has been resolved. In this paper, we propose an improved bandwidth allocation in which, after the congestion resolution at a node, the node estimates the number of effective nodes transmitting traffic, measures the remaining bandwidth and fairly allocates the available bandwidth to effective nodes. To show the performance of our proposed mechanism, we have performed simulation and show that the proposed mechanism gives higher bandwidth utilization than the existing RPR fairness mechanisms.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.5.1526/_p
Copy
@ARTICLE{e89-b_5_1526,
author={Dong-Hun LEE, Jae-Hwoon LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={A Novel Fairness Mechanism Based on the Number of Effective Nodes for Efficient Bandwidth Allocation in the Resilient Packet Ring},
year={2006},
volume={E89-B},
number={5},
pages={1526-1533},
abstract={Metro networks are based on SONET/SDH which uses the circuit switching technology. Circuit switching is inappropriate for the Internet traffic which is very bursty nature. Therefore, metro networks can become a bottleneck. In order to resolve this problem, the IEEE 802.17 working group has proposed the Resilient Packet Ring (RPR) technology. In order to provide fairness among stations in the RPR network, two types of RPR fairness mechanisms have been defined. However, the IEEE 802.17 RPR fairness mechanisms have the problem of inefficient use of the available bandwidth after the congestion at a node has been resolved. In this paper, we propose an improved bandwidth allocation in which, after the congestion resolution at a node, the node estimates the number of effective nodes transmitting traffic, measures the remaining bandwidth and fairly allocates the available bandwidth to effective nodes. To show the performance of our proposed mechanism, we have performed simulation and show that the proposed mechanism gives higher bandwidth utilization than the existing RPR fairness mechanisms.},
keywords={},
doi={10.1093/ietcom/e89-b.5.1526},
ISSN={1745-1345},
month={May},}
Copy
TY - JOUR
TI - A Novel Fairness Mechanism Based on the Number of Effective Nodes for Efficient Bandwidth Allocation in the Resilient Packet Ring
T2 - IEICE TRANSACTIONS on Communications
SP - 1526
EP - 1533
AU - Dong-Hun LEE
AU - Jae-Hwoon LEE
PY - 2006
DO - 10.1093/ietcom/e89-b.5.1526
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2006
AB - Metro networks are based on SONET/SDH which uses the circuit switching technology. Circuit switching is inappropriate for the Internet traffic which is very bursty nature. Therefore, metro networks can become a bottleneck. In order to resolve this problem, the IEEE 802.17 working group has proposed the Resilient Packet Ring (RPR) technology. In order to provide fairness among stations in the RPR network, two types of RPR fairness mechanisms have been defined. However, the IEEE 802.17 RPR fairness mechanisms have the problem of inefficient use of the available bandwidth after the congestion at a node has been resolved. In this paper, we propose an improved bandwidth allocation in which, after the congestion resolution at a node, the node estimates the number of effective nodes transmitting traffic, measures the remaining bandwidth and fairly allocates the available bandwidth to effective nodes. To show the performance of our proposed mechanism, we have performed simulation and show that the proposed mechanism gives higher bandwidth utilization than the existing RPR fairness mechanisms.
ER -