This repository is having one main.c code which basically giving the demo of static routing using C language.
-
Updated
May 5, 2020 - C
#
routing-algorithm
Here are 21 public repositories matching this topic...
This repository contains all my work from Computer Network Lab
networking topology checksum tcp-server tcp-client tcp-protocol tcp-socket ftp-client crc-calculation ftp-server routing-algorithm sliding-windows routing-protocols stop-and-wait client-server-example reno tahoe
-
Updated
Aug 26, 2017 - C
Routing algorithm based on Two-level hardware multi-bit trie
-
Updated
Oct 30, 2022 - C
The published IEEE paper tells about the basic details of this project
cad data-structures switching memory-management oops fpga-soc clustering-algorithm routing-algorithm exception-handling fpga-programming fpga-designs switching-pattern
-
Updated
Feb 15, 2023 - C
Sorting Fast Data on Sequential Sensors
raspberry-pi data-science localization sockets scheduling socket-communication priority-queue sorting-algorithms priorityqueue arduino-uno operating-systems sorting-network routing-algorithm geometric-meshes wireless-sensor-networks routing-protocols priority-scheduler preemptive queuing-theory non-premtive
-
Updated
Aug 25, 2017 - C
A program can calculate OSPF with variable edge code and consider edge loading
-
Updated
Nov 21, 2017 - C
CLI Dijkstra-algorithm with map parser in C for programming assignment
-
Updated
Feb 24, 2025 - C
Practical activity #3, Computer Networks, in Computer Engineering graduation.
-
Updated
Sep 9, 2017 - C
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
This assignment implements a forwarding routing algorithm for IPv4 packets using Longest Prefix Match and uses ARP requests
-
Updated
Jun 4, 2022 - C
Bellman-Ford algorithm is used to find the shortest paths from a single source vertex to all other vertices in a weighted graph.
-
Updated
Jun 4, 2024 - C
Implementation of flooding routing, based on 'motelib' framework of https://gitlab.com/cjaikaeo/motelib
-
Updated
Feb 19, 2022 - C
A basic data router modelling program written for university laboratory learning
-
Updated
Apr 1, 2017 - C
Router implemented with static forwarding tables. It handles IPV4 , ARP, ICMP packets, and uses Longest Prefix Match for routing decisions.
-
Updated
Mar 15, 2024 - C
Final project for the subject "Introduction to Switching". Grade 10/10 (Honours)
-
Updated
May 25, 2023 - C
Lab programs done in Networking Lab
-
Updated
Apr 6, 2025 - C
Routing Algorithms for Operating Systems
-
Updated
Apr 10, 2023 - C
An Open Shortest Path First algorithm is implemented for routing in Software Defined Networking
-
Updated
Dec 12, 2024 - C
A simplified implementation of OSPF (Open Shortest Path First)
-
Updated
Jul 6, 2017 - C
UC3M "Introduction to Switching" Lab Project
-
Updated
Jul 11, 2024 - C
Improve this page
Add a description, image, and links to the routing-algorithm topic page so that developers can more easily learn about it.
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."