https://github.com/isopropylcyanide/rip-posix-threads

An attempt to implement the routing information protocol using POSIX Threads (C Language).
https://github.com/isopropylcyanide/rip-posix-threads

c c-programming makefile network networking posix posix-threads router routing-protocols

Last synced: 3 months ago
JSON representation

An attempt to implement the routing information protocol using POSIX Threads (C Language).

• Host: GitHub
• URL: https://github.com/isopropylcyanide/rip-posix-threads
• Owner: isopropylcyanide
• Created: 2015-12-15T14:10:13.000Z (almost 10 years ago)
• Default Branch: master
• Last Pushed: 2018-06-08T09:28:54.000Z (over 7 years ago)
• Last Synced: 2025-05-03T07:37:11.504Z (5 months ago)
• Topics: c, c-programming, makefile, network, networking, posix, posix-threads, router, routing-protocols
• Language: C
• Homepage:
• Size: 13.7 KB
• Stars: 4
• Watchers: 2
• Forks: 2
• Open Issues: 0
• Metadata Files:
  • Readme: readme.md

Awesome Lists containing this project

README

          
### An attempt to implement the routing information protocol using POSIX Threads (C Language). ###

## Contribute ##

You are free to suggest changes.

* Clone the repository

* Create a new branch on local

* Merge changes from remote on to the local branch

* Work and push changes 

----

## Usage ##

* Type 'make' in the terminal for the output (already provided makefile)

* Add the changes to the C source

----

## About ##

This is a very light implementation of Routing Information Protocol (Networking) using POSIX Threads.

The idea is to have some n number of files in the directory names ($n.txt). These files represent routers. 

In each file there are three space separated columns.

Col-1 Col-2 Col-3

* Col-1: This is the name of the router file. 

* Col-2: This is the distance between the router whose name is specified in col-1        and with the router whose file you have currently opened. 

	If this distance is:

		"1" : directly connected

		"2" : connected at a distance of 2 metres. (1 metre for directly connected)

		...

		"16": not reachable, infinite distance.

	Hence, the maximum distance reachable is 15

* Col-3: This specifies the next hop destination to reach the router whose name is specifies in Col-1. A hop of 0 , means no hop is required. Initially, there are obviously no hops

----

#### What all can I do ####

* Add a router. You don't create a new file. The new router remains in memory. 

The initial router files are just for initiation since I needed File Handling as the initialisation approach. 

* Fail a link:

* Add a link:

* Invalidate a router

* Revalidate a router

* Exit simulation:

All of these actions have been carefully studies and implemented. I would appreciate if someone could come up with their bugs or an efficient code perhaps.