Per-Flow Throughput Fairness in Ring Aggregation Network with Multiple Edge Routers
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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2018-07-01
|
| Series: | Big Data and Cognitive Computing |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2504-2289/2/3/17 |
| _version_ | 1818304602515177472 |
|---|---|
| author | Yu Nakayama Kaoru Sezaki |
| author_facet | Yu Nakayama Kaoru Sezaki |
| author_sort | Yu Nakayama |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-13T06:13:18Z |
| format | Article |
| id | doaj.art-68dcb497d91849d092c60c12c9266973 |
| institution | Directory Open Access Journal |
| issn | 2504-2289 |
| language | English |
| last_indexed | 2024-12-13T06:13:18Z |
| publishDate | 2018-07-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Big Data and Cognitive Computing |
| spelling | doaj.art-68dcb497d91849d092c60c12c92669732022-12-21T23:57:01ZengMDPI AGBig Data and Cognitive Computing2504-22892018-07-01231710.3390/bdcc2030017bdcc2030017Per-Flow Throughput Fairness in Ring Aggregation Network with Multiple Edge RoutersYu Nakayama0Kaoru Sezaki1neko 9 Laboratories, Tokyo 140-0001, JapanInstitute of Industrial Science, The University of Tokyo, Tokyo 153-8505, JapanRing 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.http://www.mdpi.com/2504-2289/2/3/17fairnessring networkthroughput |
| spellingShingle | Yu Nakayama Kaoru Sezaki Per-Flow Throughput Fairness in Ring Aggregation Network with Multiple Edge Routers Big Data and Cognitive Computing fairness ring network throughput |
| title | Per-Flow Throughput Fairness in Ring Aggregation Network with Multiple Edge Routers |
| title_full | Per-Flow Throughput Fairness in Ring Aggregation Network with Multiple Edge Routers |
| title_fullStr | Per-Flow Throughput Fairness in Ring Aggregation Network with Multiple Edge Routers |
| title_full_unstemmed | Per-Flow Throughput Fairness in Ring Aggregation Network with Multiple Edge Routers |
| title_short | Per-Flow Throughput Fairness in Ring Aggregation Network with Multiple Edge Routers |
| title_sort | per flow throughput fairness in ring aggregation network with multiple edge routers |
| topic | fairness ring network throughput |
| url | http://www.mdpi.com/2504-2289/2/3/17 |
| work_keys_str_mv | AT yunakayama perflowthroughputfairnessinringaggregationnetworkwithmultipleedgerouters AT kaorusezaki perflowthroughputfairnessinringaggregationnetworkwithmultipleedgerouters |