Towards More Effective Flow Allocation in RINA

This master's thesis focuses on design and implementation of a flow allocator policy which supports bandwidth reservation for the Recursive InterNetwork Architecture (RINA). Each flow has some dedicated bandwidth, which is guaranteed to be available during the whole lifetime of the flow. The allocator, which operates as a distributed system, attempts to find a suitable path in the network graph. To achieve this goal, it must keep the information about link utilization up to date. The proposed allocator has been implemented in the open source project rlite. The first half of the thesis is concerned with congestion control theory, and also studies a number of algorithms used in TCP. Additionally, it contains an overview of the structure of RINA and the Raft consensus algorithm