Skip to content
#

routing-algorithm

Here are 200 public repositories matching this topic...

Overview For this assignment you will be developing and implementing : An On-Demand shortest-hop Routing (ODR) protocol for networks of fixed but arbitrary and unknown connectivity, using PF_PACKET sockets. The implementation is based on (a simplified version of) the AODV algorithm. Time client and server applications that send requests and replies

  • Updated Dec 9, 2021
  • C

Project to design and implement a simulation of an OpenFlow network system with a Controller, multiple clients and an MxN grid of routers. All links between routers are assigned an arbritray time and routing is calculated with the famous Dijkstra Algorithm for the shortest path based on these times. App can be run with java -cp tcdlib.jar:. Main…

  • Updated Jan 7, 2020
  • Java

Improve this page

Add a description, image, and links to the routing-algorithm 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 routing-algorithm topic, visit your repo's landing page and select "manage topics."

Learn more