The project simulates a network traffic in a given topology where the distance vector algorithm is used for path computations, routing and forwarding.

The described project is a network simulation program that focuses on network traffic within a predefined topology. The key components of the program are the Distance Vector Computation and the Flow Routing Algorithm.

Implementation of distance vector routing algorithm

Calculates the distance vectors for routers in a network, based upon link costs. The algorithm allows you to change a link cost and then updates the distance vector table.

this is a simulation of distributed routing algorithm(distance vector or RIP) described in "internetworking" chapter of the book "computer networks a systems approach"

A simple NodeJS implementation of the Distance-vector routing protocol which uses the Bellman-Ford algorithm.

Autoencoder to compress distance matrices of pretrained embedding files.