{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:07:55Z","timestamp":1760238475281,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T00:00:00Z","timestamp":1597017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers"],"abstract":"<jats:p>Effective capacity allocation is essential for a network to operate properly, providing predictable quality of service guarantees and avoiding bottlenecks. Achieving capacity allocation fairness is a long-standing problem extensively researched in the frame of transport and network layer protocols such as TCP\/IP. The Recursive InterNetwork Architecture offers programmable policies that enable more flexible control on the mechanics of network flow allocation. In this paper, we present our version of one of these policies, which provides flow allocation according to the bandwidth requirements of requesting applications. We implement the bandwidth-aware flow allocation policy by extending rlite, an open source RINA implementation. Our evaluation shows how the policy can prevent links from becoming oversaturated and use alternate paths to achieve high total link data-rate use.<\/jats:p>","DOI":"10.3390\/computers9030063","type":"journal-article","created":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T09:04:16Z","timestamp":1597050256000},"page":"63","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Addressing Bandwidth-Driven Flow Allocationin RINA"],"prefix":"10.3390","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6912-8713","authenticated-orcid":false,"given":"Michal","family":"Koutensk\u00fd","sequence":"first","affiliation":[{"name":"Department of Information Systems, Brno University of Technology, 61200 Brno, Czech Republic"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6346-2152","authenticated-orcid":false,"given":"Vladim\u00edr","family":"Vesel\u00fd","sequence":"additional","affiliation":[{"name":"Department of Information Systems, Brno University of Technology, 61200 Brno, Czech Republic"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0020-8664","authenticated-orcid":false,"given":"Vincenzo","family":"Maffione","sequence":"additional","affiliation":[{"name":"Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 di Pisa, 56122 Pisa, Italy"}]}],"member":"1968","published-online":{"date-parts":[[2020,8,10]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Welzl, M. (2005). Network Congestion Control: Managing Internet Traffic, John Wiley & Sons Ltd.","DOI":"10.1002\/047002531X"},{"key":"ref_2","unstructured":"Pouzin Society (2020, May 30). RINA Specifications. Available online: https:\/\/github.com\/PouzinSociety\/RINASpecifications."},{"key":"ref_3","unstructured":"Day, J.D. (2008). Patterns In Network Architecture: A Return to Fundamentals, Prentice Hall."},{"key":"ref_4","unstructured":"(2020, May 30). IRATI. Available online: https:\/\/irati.github.io\/stack\/."},{"key":"ref_5","unstructured":"(2020, May 30). Rlite: A Light RINA Implementation. Available online: https:\/\/github.com\/rlite\/rlite."},{"key":"ref_6","unstructured":"(2020, May 30). Ouroboros. Available online: https:\/\/ouroboros.rocks\/."},{"key":"ref_7","unstructured":"(2020, May 30). ProtoRINA. Available online: https:\/\/csr.bu.edu\/rina\/protorina\/2.0\/."},{"key":"ref_8","unstructured":"(2020, May 30). RINASim. Available online: https:\/\/rinasim.omnetpp.org\/."},{"key":"ref_9","unstructured":"Keshav, S. (1991). Congestion Control in Computer Networks. [Ph.D. Thesis, University of California at Berkeley]."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Jacobson, V. (1988, January 16\u201318). Congestion Avoidance and Control. Proceedings of the SIGCOMM \u201988, Symposium Proceedings on Communications Architectures and Protocols, Stanford, CA, USA.","DOI":"10.1145\/52324.52356"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Braden, R. (1989). Requirements for Internet Hosts\u2014Communication Layers. RFC 1122, IETF.","DOI":"10.17487\/rfc1122"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/1400097.1400105","article-title":"CUBIC: A New TCP-friendly High-speed TCP Variant","volume":"42","author":"Ha","year":"2008","journal-title":"SIGOPS Oper. Syst. Rev."},{"key":"ref_13","unstructured":"Xu, L., Harfoush, K., and Rhee, I. (2004, January 7\u201311). Binary increase congestion control (BIC) for fast long-distance networks. Proceedings of the IEEE INFOCOM 2004, Hong Kong, China."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/3012426.3022184","article-title":"BBR: Congestion-Based Congestion Control","volume":"14","author":"Cardwell","year":"2016","journal-title":"Queue"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1109\/90.251892","article-title":"Random Early Detection Gateways for Congestion Avoidance","volume":"1","author":"Floyd","year":"1993","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Scholz, D., J\u00e4ger, B., Schwaighofer, L., Raumer, D., Geyer, F., and Carle, G. (2018, January 14\u201316). Towards a Deeper Understanding of TCP BBR Congestion Control. Proceedings of the 2018 IFIP Networking Conference (IFIP Networking) and Workshops, Zurich, Switzerland.","DOI":"10.23919\/IFIPNetworking.2018.8696830"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/INFCOM.1996.497876","article-title":"On optimal call admission control in cellular networks","volume":"Volume 1","author":"Ramjee","year":"1996","journal-title":"Proceedings of the IEEE INFOCOM \u201996. Conference on Computer Communications"},{"key":"ref_18","unstructured":"Kalmanek, C.R., Kanakia, H., and Keshav, S. (1990, January 2\u20135). Rate Controlled Servers for Very High-Speed Networks. Proceedings of the GLOBECOM \u201990: IEEE Global Telecommunications Conference and Exhibition, San Diego, CA, USA."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Braden, B., Clark, D., and Shenker, S. (1994). Integrated Services in the Internet Architecture: An Overview. RFC 1633, IETF.","DOI":"10.17487\/rfc1633"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Braden, B., Zhang, L., Berson, S., Herzog, S., and Jamin, S. (1997). Resource ReSerVation Protocol (RSVP)\u2014Version 1 Functional Specification. RFC 2205, IETF.","DOI":"10.17487\/rfc2209"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Mankin, A., Baker, F., Braden, B., Bradner, S., O\u2019Dell, M., Romanow, A., Weinrib, A., and Zhang, L. (1997). Resource ReSerVation Protocol (RSVP)\u2014Version 1 Applicability Statement Some Guidelines on Deployment. RFC 2208, IETF.","DOI":"10.17487\/rfc2208"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Nichols, K., Blake, S., Baker, F., and Black, D.L. (1998). Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers. RFC 2474, IETF.","DOI":"10.17487\/rfc2474"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Blake, S., Black, D.L., Carlson, M.A., Davies, E., Wang, Z., and Weiss, W. (1998). An Architecture for Differentiated Services. RFC 2475, IETF.","DOI":"10.17487\/rfc2475"},{"key":"ref_24","unstructured":"Group, I.W. (2018). IEEE Standard for Local and Metropolitan Area Network\u2013Bridges and Bridged Networks, IEEE. Technical Report; Technical Report Std 802.1 Q-2018; Revision."},{"key":"ref_25","unstructured":"Faucheur, F.L., Wu, L., Davie, B., Davari, S., Vaananen, P., Krishnan, R., Cheval, P., and Heinanen, J. (2002). Multi-Protocol Label Switching (MPLS) Support of Differentiated Services. RFC 3270, IETF."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Heinanen, J., and Guerin, R. (1999). A Single Rate Three Color Marker. RFC 2697, IETF.","DOI":"10.17487\/rfc2697"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Baker, F., and Fairhurst, G. (2015). IETF Recommendations Regarding Active Queue Management. RFC 7567, IETF.","DOI":"10.17487\/RFC7567"},{"key":"ref_28","unstructured":"Day, J. (2020, May 30). The Interina Reference Model. Available online: https:\/\/github.com\/PouzinSociety\/RINASpecifications."},{"key":"ref_29","unstructured":"Ongaro, D., and Ousterhout, J.K. (2014, January 19\u201320). In search of an understandable consensus algorithm. Proceedings of the USENIX Annual Technical Conference, Philadelphia, PA, USA."},{"key":"ref_30","unstructured":"Ongaro, D. (2014). Consensus: Bridging Theory and Practice. [Ph.D. Thesis, Stanford University]."}],"container-title":["Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-431X\/9\/3\/63\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:58:51Z","timestamp":1760176731000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-431X\/9\/3\/63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,10]]},"references-count":30,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2020,9]]}},"alternative-id":["computers9030063"],"URL":"https:\/\/doi.org\/10.3390\/computers9030063","relation":{},"ISSN":["2073-431X"],"issn-type":[{"type":"electronic","value":"2073-431X"}],"subject":[],"published":{"date-parts":[[2020,8,10]]}}}