IEICE TRANSACTIONS on Communications
Signaling Based Discard with Flags: Per-Flow Fairness in Ring Aggregation Networks
Summary :
Ring aggregation networks are widely employed for metro access networks. A layer-2 ring with Ethernet Ring Protection is a popular topology for carrier services. Since frames are forwarded along ring nodes, a fairness scheme is required to achieve throughput fairness. Although per-node fairness algorithms have been developed for the Resilient Packet Ring, the per-node fairness is insufficient if there is bias in a flow distribution. To achieve per-flow fairness, N Rate N+1 Color Marking (NRN+1CM) was proposed. However, NRN+1CM can achieve fairness in case there are sufficient numbers of available bits on a frame header. It cannot be employed if the frame header cannot be overwritten. Therefore, the application range of NRN+1CM is limited. This paper proposes a Signaling based Discard with Flags (SDF) scheme for per-flow fairness. The objective of SDF is to eliminate the drawback of NRN+1CM. The key idea is to attach a flag to frames according to the input rate and to discard them selectively based on the flags and a dropping threshold. The flag is removed before the frame is transmitted to another node. The dropping threshold is cyclically updated by signaling between ring nodes and a master node. The SDF performance was confirmed by employing a theoretical analysis and computer simulations. The performance of SDF was comparable to that of NRN+1CM. It was verified that SDF can achieve per-flow throughput fairness without using a frame header in ring aggregation networks.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E98-B No.12 pp.2431-2438
- Publication Date
- 2015/12/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E98.B.2431
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Yu NAKAYAMA
NTT Corporation
Ken-Ichi SUZUKI
NTT Corporation
Jun TERADA
NTT Corporation
Akihiro OTAKA
NTT Corporation
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
Yu NAKAYAMA, Ken-Ichi SUZUKI, Jun TERADA, Akihiro OTAKA, "Signaling Based Discard with Flags: Per-Flow Fairness in Ring Aggregation Networks" in IEICE TRANSACTIONS on Communications,
vol. E98-B, no. 12, pp. 2431-2438, December 2015, doi: 10.1587/transcom.E98.B.2431.
Abstract: Ring aggregation networks are widely employed for metro access networks. A layer-2 ring with Ethernet Ring Protection is a popular topology for carrier services. Since frames are forwarded along ring nodes, a fairness scheme is required to achieve throughput fairness. Although per-node fairness algorithms have been developed for the Resilient Packet Ring, the per-node fairness is insufficient if there is bias in a flow distribution. To achieve per-flow fairness, N Rate N+1 Color Marking (NRN+1CM) was proposed. However, NRN+1CM can achieve fairness in case there are sufficient numbers of available bits on a frame header. It cannot be employed if the frame header cannot be overwritten. Therefore, the application range of NRN+1CM is limited. This paper proposes a Signaling based Discard with Flags (SDF) scheme for per-flow fairness. The objective of SDF is to eliminate the drawback of NRN+1CM. The key idea is to attach a flag to frames according to the input rate and to discard them selectively based on the flags and a dropping threshold. The flag is removed before the frame is transmitted to another node. The dropping threshold is cyclically updated by signaling between ring nodes and a master node. The SDF performance was confirmed by employing a theoretical analysis and computer simulations. The performance of SDF was comparable to that of NRN+1CM. It was verified that SDF can achieve per-flow throughput fairness without using a frame header in ring aggregation networks.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E98.B.2431/_p
Copy
@ARTICLE{e98-b_12_2431,
author={Yu NAKAYAMA, Ken-Ichi SUZUKI, Jun TERADA, Akihiro OTAKA, },
journal={IEICE TRANSACTIONS on Communications},
title={Signaling Based Discard with Flags: Per-Flow Fairness in Ring Aggregation Networks},
year={2015},
volume={E98-B},
number={12},
pages={2431-2438},
abstract={Ring aggregation networks are widely employed for metro access networks. A layer-2 ring with Ethernet Ring Protection is a popular topology for carrier services. Since frames are forwarded along ring nodes, a fairness scheme is required to achieve throughput fairness. Although per-node fairness algorithms have been developed for the Resilient Packet Ring, the per-node fairness is insufficient if there is bias in a flow distribution. To achieve per-flow fairness, N Rate N+1 Color Marking (NRN+1CM) was proposed. However, NRN+1CM can achieve fairness in case there are sufficient numbers of available bits on a frame header. It cannot be employed if the frame header cannot be overwritten. Therefore, the application range of NRN+1CM is limited. This paper proposes a Signaling based Discard with Flags (SDF) scheme for per-flow fairness. The objective of SDF is to eliminate the drawback of NRN+1CM. The key idea is to attach a flag to frames according to the input rate and to discard them selectively based on the flags and a dropping threshold. The flag is removed before the frame is transmitted to another node. The dropping threshold is cyclically updated by signaling between ring nodes and a master node. The SDF performance was confirmed by employing a theoretical analysis and computer simulations. The performance of SDF was comparable to that of NRN+1CM. It was verified that SDF can achieve per-flow throughput fairness without using a frame header in ring aggregation networks.},
keywords={},
doi={10.1587/transcom.E98.B.2431},
ISSN={1745-1345},
month={December},}
Copy
TY - JOUR
TI - Signaling Based Discard with Flags: Per-Flow Fairness in Ring Aggregation Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2431
EP - 2438
AU - Yu NAKAYAMA
AU - Ken-Ichi SUZUKI
AU - Jun TERADA
AU - Akihiro OTAKA
PY - 2015
DO - 10.1587/transcom.E98.B.2431
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E98-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2015
AB - Ring aggregation networks are widely employed for metro access networks. A layer-2 ring with Ethernet Ring Protection is a popular topology for carrier services. Since frames are forwarded along ring nodes, a fairness scheme is required to achieve throughput fairness. Although per-node fairness algorithms have been developed for the Resilient Packet Ring, the per-node fairness is insufficient if there is bias in a flow distribution. To achieve per-flow fairness, N Rate N+1 Color Marking (NRN+1CM) was proposed. However, NRN+1CM can achieve fairness in case there are sufficient numbers of available bits on a frame header. It cannot be employed if the frame header cannot be overwritten. Therefore, the application range of NRN+1CM is limited. This paper proposes a Signaling based Discard with Flags (SDF) scheme for per-flow fairness. The objective of SDF is to eliminate the drawback of NRN+1CM. The key idea is to attach a flag to frames according to the input rate and to discard them selectively based on the flags and a dropping threshold. The flag is removed before the frame is transmitted to another node. The dropping threshold is cyclically updated by signaling between ring nodes and a master node. The SDF performance was confirmed by employing a theoretical analysis and computer simulations. The performance of SDF was comparable to that of NRN+1CM. It was verified that SDF can achieve per-flow throughput fairness without using a frame header in ring aggregation networks.
ER -
English
