Network routing simulation
Simulation of several data transmission protocols over a network with multi-path routing depending on the channel capacity and the transmission information bit value.
A network model was used in the form of a directed graph, for which a model of optimal distribution of information flow has been created, taking into account the transmission delays, cost and reliability of channels as well as the maximum possible bandwidth. These parameters were measured in experiments in the network with one source and one receiver. For comparison purposes, the conventional routing algorithms have been used, such as Short Path First and Equal Cost Multi-Path. The experimental results were visualized using graphs and charts.
TheRundown platform redesign
UI/UX redesign for TheRundown betting aggregator platform
Transmission power scheduling system simulation
The implementation of the algorithm for the optimal choice of power transmitters in the network
P2P worm propagation model
Modification of the algorithm that simulates propagation of topology-aware P2P worms.