Result Details
Addressing Bandwidth-driven Flow Allocation in RINA
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.
RINA, TCP, congestion control, flow allocation, rlite
@article{BUT168157,
author="KOUTENSKÝ, M. and VESELÝ, V. and MAFFIONE, V.",
title="Addressing Bandwidth-driven Flow Allocation in RINA",
journal="Computers",
year="2020",
volume="9",
number="3",
pages="1--23",
doi="10.3390/computers9030063",
issn="2073-431X",
url="https://www.mdpi.com/2073-431X/9/3/63"
}