Network Routing/Forwarding using Rateless Codes
-
Updated
Mar 18, 2016 - C++
Network Routing/Forwarding using Rateless Codes
Routing optimization solution for the Knoxville Ale Trail
This a sample code of implementing CPLEX algorithm on capacitated vehicle routing problem with time window constraints (VRPTW)
NFOpt is a tool for optimizing network flows by formulating and solving several types of optimization problems as well as multicommodity flow routing.
Publisher - Subscriber on top of a self-routing node network (C++ 14)
Capacitated Vehicle Routing Problem Solver
Implementation of Distance-Vector networking algorithm in Python.
A Routing algorithm based on Wireless networks which routes packets by creating a route on-demand from the source instead of relying on Traditional Routing Tables.
BROT is a self-adaptation algorithm that trade offs traffic mitigation and shortest path length on transportation networks
🚀 Frontend magician with Angular and backend enthusiast with Spring Boot. Crafting seamless e-Commerce experiences that captivate users. Let's build something extraordinary!
Разработка landing page на фреймворке Laravel (пользовательская и административная часть)
Webapp2 Routing Backend.
I'll regroup most of my activities here, notes/articles/publications and of course puzzles!
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
Optimizing the allocation and routing of running dinner participants. In a 'running dinner', groups of three host two other groups for one course and visit two other groups for the remaining courses. The objective is to minimize the distance travelled between groups.
All the assignments of Computer Network course
A VHDL model for Hopfield Neural Networks (HNN) for Routing in Communication Networks
A basic data router modelling program written for university laboratory learning
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…
Modelling mobile network communication hierarchy and simulating mobile location tracking.
Add a description, image, and links to the routing-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the routing-algorithm topic, visit your repo's landing page and select "manage topics."