Skip to content
#

distance-vector-routing

Here are 21 public repositories matching this topic...

To implement a simplified version of a routing protocol in a static network. You are required to write a program which builds its routing table based on the distances (i.e., edge weights) to other nodes in the network. The Bellman-Ford algorithm should be used to build and update the routing tables.

  • Updated Jun 15, 2023
  • Python

This repository contains three projects that explore different aspects of networking. The first project provides an understanding of how client-server communication works using sockets. The second project provides familiarity with capturing network packets using Wireshark. The third project provides an understanding of routing protocols via sockets

  • Updated May 16, 2023
  • Python

Improve this page

Add a description, image, and links to the distance-vector-routing topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the distance-vector-routing topic, visit your repo's landing page and select "manage topics."

Learn more