{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:01:15Z","timestamp":1760241675703,"version":"build-2065373602"},"reference-count":20,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2018,7,18]],"date-time":"2018-07-18T00:00:00Z","timestamp":1531872000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BDCC"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/bdcc2030017","type":"journal-article","created":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T03:50:43Z","timestamp":1531972243000},"page":"17","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Per-Flow Throughput Fairness in Ring Aggregation Network with Multiple Edge Routers"],"prefix":"10.3390","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6945-7055","authenticated-orcid":false,"given":"Yu","family":"Nakayama","sequence":"first","affiliation":[{"name":"neko 9 Laboratories, Tokyo 140-0001, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaoru","family":"Sezaki","sequence":"additional","affiliation":[{"name":"Institute of Industrial Science, The University of Tokyo, Tokyo 153-8505, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,7,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/2427036.2427041","article-title":"Comments on bufferbloat","volume":"43","author":"Allman","year":"2013","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Jiang, H., Liu, Z., Wang, Y., Lee, K., and Rhee, I. (2012, January 13). Understanding bufferbloat in cellular networks. Proceedings of the 2012 ACM SIGCOMM Workshop on Cellular Networks: Operations, Challenges, and Future Design, Helsinki, Finland.","DOI":"10.1145\/2342468.2342470"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/2063176.2063196","article-title":"Bufferbloat: Dark buffers in the internet","volume":"55","author":"Gettys","year":"2012","journal-title":"Commun. ACM"},{"key":"ref_4","unstructured":"Hohlfeld, O., Pujol, E., Ciucu, F., Feldmann, A., and Barford, P. (2012). BufferBloat: How Relevant? A QoE Perspective on Buffer Sizing, Technische Universit\u00e4t Berlin. Technical Report."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Alfredsson, S., Del Giudice, G., Garcia, J., Brunstrom, A., De Cicco, L., and Mascolo, S. (2013, January 4\u20137). Impact of TCP congestion control on bufferbloat in cellular networks. Proceedings of the 2013 IEEE 14th International Symposium and Workshops on a World of Wireless, Mobile and Multimedia Networks (WoWMoM), Madrid, Spain.","DOI":"10.1109\/WoWMoM.2013.6583408"},{"key":"ref_6","unstructured":"Shalunov, S., Hazel, G., Iyengar, J., and Kuehlewind, M. (2010). Low extra delay background transport (LEDBAT). IETF Draft."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Chirichella, C., Rossi, D., Testa, C., Friedman, T., and Pescap\u00e9, A. (2013). Remotely gauging upstream bufferbloat delays. Passive and Active Measurement, Springer.","DOI":"10.1007\/978-3-642-36516-4_25"},{"key":"ref_8","unstructured":"ITU-T Recommendation G.8032\/Y.1344 (2008). Ethernet Ring Protection Switching, International Telecommunication Union."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1109\/MCOM.2008.4623718","article-title":"Ethernet ring protection for carrier ethernet networks","volume":"46","author":"Ryoo","year":"2008","journal-title":"IEEE Commun. Mag."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/2209249.2209264","article-title":"Controlling queue delay","volume":"55","author":"Nichols","year":"2012","journal-title":"Commun. ACM"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Pan, R., Natarajan, P., Piglione, C., Prabhu, M.S., Subramanian, V., Baker, F., and VerSteeg, B. (2013, January 8\u201311). PIE: A lightweight control scheme to address the bufferbloat problem. Proceedings of the 2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR), Taipei, Taiwan.","DOI":"10.1109\/HPSR.2013.6602305"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/75247.75248","article-title":"Analysis and simulation of a fair queueing algorithm","volume":"19","author":"Demers","year":"1989","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1109\/TGCN.2017.2678207","article-title":"Joint customized price and power control for energy-efficient multi-service wireless networks via S-modular theory","volume":"1","author":"Tsiropoulou","year":"2017","journal-title":"IEEE Trans. Green Commun. Netw."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1049\/iet-com.2015.0549","article-title":"Weighted sum throughput maximisation for cooperative relay-aided multi-cell orthogonal frequency division multiple access cellular networks considering partial fairness","volume":"10","author":"Moghaddam","year":"2016","journal-title":"IET Commun."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2656","DOI":"10.1109\/TMC.2016.2622263","article-title":"Supermodular game-based distributed joint uplink power and rate allocation in two-tier femtocell networks","volume":"16","author":"Tsiropoulou","year":"2017","journal-title":"IEEE Trans. Mob. Comput."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Fukunaga, T., Yuda, Y., Hoshino, M., and Higuchi, K. (2015, January 25\u201328). Decentralized user association for (p, \u03b1)-proportional fair-based system throughput maximization in cellular networks. Proceedings of the 2015 International Symposium on Wireless Communication Systems (ISWCS), Brussels, Belgium.","DOI":"10.1109\/ISWCS.2015.7454314"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"4401","DOI":"10.1109\/TCOMM.2014.2369038","article-title":"N Rate N+1 Color Marking: Per-Flow Fairness in Ring Aggregation Networks","volume":"62","author":"Nakayama","year":"2014","journal-title":"IEEE Trans. Commun."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Nakayama, Y., and Sezaki, K. (2015, January 14\u201316). Avoiding bufferbloat with frame-drop threshold notification in ring aggregation networks. Proceedings of the 2015 21st Asia-Pacific Conference on Communications (APCC), Kyoto, Japan.","DOI":"10.1109\/APCC.2015.7412562"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1587\/transcom.2016EBP3237","article-title":"Bufferbloat Avoidance with Frame-Dropping Threshold Notification in Ring Aggregation Networks","volume":"100","author":"Nakayama","year":"2017","journal-title":"IEICE Trans. Commun."},{"key":"ref_20","unstructured":"(2016, July 01). Network Simulator ns-2. Available online: http:\/\/www.isi.edu\/nsnam\/ns\/."}],"container-title":["Big Data and Cognitive Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2504-2289\/2\/3\/17\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:12:46Z","timestamp":1760195566000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2504-2289\/2\/3\/17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,18]]},"references-count":20,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2018,9]]}},"alternative-id":["bdcc2030017"],"URL":"https:\/\/doi.org\/10.3390\/bdcc2030017","relation":{},"ISSN":["2504-2289"],"issn-type":[{"type":"electronic","value":"2504-2289"}],"subject":[],"published":{"date-parts":[[2018,7,18]]}}}