Next Article in Journal
Digitalisation and Big Data Mining in Banking
Previous Article in Journal
From Big Data to Deep Learning: A Leap Towards Strong AI or ‘Intelligentia Obscura’?
Article Menu
Issue 3 (September) cover image

Export Article

Open AccessArticle
Big Data Cogn. Comput. 2018, 2(3), 17; https://doi.org/10.3390/bdcc2030017

Per-Flow Throughput Fairness in Ring Aggregation Network with Multiple Edge Routers

1
neko 9 Laboratories, Tokyo 140-0001, Japan
2
Institute of Industrial Science, The University of Tokyo, Tokyo 153-8505, Japan
*
Author to whom correspondence should be addressed.
Received: 11 June 2018 / Revised: 12 July 2018 / Accepted: 17 July 2018 / Published: 18 July 2018
Full-Text   |   PDF [933 KB, uploaded 18 July 2018]   |  

Abstract

Ring aggregation networks are often employed by network carriers because of their efficiency and high fault tolerance. A fairness scheme is required in ring aggregation to achieve per-flow throughput fairness and bufferbloat avoidance, because frames are forwarded along multiple ring nodes. N Rate N + 1 Color Marking (NRN + 1CM) was proposed to achieve fairness in ring aggregation networks consisting of Layer-2 Switches (SWs). With NRN + 1CM, frames are selectively discarded based on color and the frame-dropping threshold. To avoid the accumulation of a queuing delay, frames are discarded at upstream nodes in advance through the notification process for the frame-dropping threshold. However, in the previous works, NRN + 1CM was assumed to be employed in a logical daisy chain topology linked to one Edge Router (ER). The currently available threshold notification process of NRN + 1CM cannot be employed for ring networks with multiple ERs. Therefore, this paper proposes a method for applying NRN + 1CM to a ring aggregation network with multiple ERs. With the proposed algorithm, an SW dynamically selects the dropping threshold to send in order to avoid excess frame discarding. The performance of the proposed scheme was confirmed through computer simulations. View Full-Text
Keywords: fairness; ring network; throughput fairness; ring network; throughput
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Nakayama, Y.; Sezaki, K. Per-Flow Throughput Fairness in Ring Aggregation Network with Multiple Edge Routers. Big Data Cogn. Comput. 2018, 2, 17.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Big Data Cogn. Comput. EISSN 2504-2289 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top