Skip to content

Latest commit

 

History

History
51 lines (36 loc) · 1.74 KB

readme.md

File metadata and controls

51 lines (36 loc) · 1.74 KB
Raw

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.