The project simulates a network traffic in a given topology where the distance vector algorithm is used for path computations, routing and forwarding.
-
Updated
Oct 18, 2020 - Java
8000
The project simulates a network traffic in a given topology where the distance vector algorithm is used for path computations, routing and forwarding.
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.
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.
this is a simulation of distributed routing algorithm(distance vector or RIP) described in "internetworking" chapter of the book "computer networks a systems approach"
Add a description, image, and links to the distance-vector topic page so that developers can more easily learn about it.
To associate your repository with the distance-vector topic, visit your repo's landing page and select "manage topics."