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.
Virtual try-on tool for makeup products
The system consists of a face detection and segmentation model and an algorithm that allows recoloring objects without losing their original texture.
The Rundown platform redesign
UI/UX redesign for TheRundown betting aggregator platform
P2P worm propagation model
Modification of the algorithm that simulates propagation of topology-aware P2P worms.