Signaling Based Discard with Flags: Per-Flow Fairness in Ring Aggregation Networks

Yu NAKAYAMA  Ken-Ichi SUZUKI  Jun TERADA  Akihiro OTAKA  

Publication
IEICE TRANSACTIONS on Communications   Vol.E98-B   No.12   pp.2431-2438
Publication Date: 2015/12/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E98.B.2431
Type of Manuscript: PAPER
Category: Network
Keyword: 
metro access networks,  ring aggregation,  fairness,  flag,  

Full Text: PDF(1.4MB)>>
Buy this Article




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.