In order to easily send data between two end elements without congestion, methods that suitably control flow of date and evaluate possible overload state are necessary. One such method is to control the data flow directly on the transport layer. This layer offers a range of mechanisms dedicated to deal with this issue. The aim of this paper is divided into three parts. The first part describes the integration of transport layer TCP/IP model, and the ability to process TCP data stream. The second part describes methods to manage congestion, their integration by usage environment. It mainly focuses on methods of TCP Reno and TCP Vegas. Their simulation and analysis on transmission the data stream stream. The third part deals with the analysis in detail of TCP Vegas. Analyzes possible parameters for alpha a beta within the TCP Vegas, and a combination of TCP Vegas and TCP Reno.

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.