distance-vector

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

Python implementations of socket-based chat, routing protocol simulation, and a distributed hash table with test harnesses and Docker support.

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

This project implements a virtual router based on the Distance Vector routing algorithm, inspired by the RIP protocol. Routers communicate through TCP connections, forming an overlay network capable of dynamically establishing routes, forwarding messages, and adapting to topology changes.

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.

Autoencoder to compress distance matrices of pretrained embedding files.

Explainable adaptive routing and network resilience simulator (Python, NetworkX, Streamlit)

Distributed Distance Vector (Bellman-Ford with poisoned reverse) and Link State (Dijkstra SPF) routing protocols in Python

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

[⚠️MOVED] NDN Distance Vector Router