Skip to content

Routing scheme, where packets are forwarded to the next hop router by longest prefix matching using a binary trie and Dikstra's alogirhm implemented using Fibonacci heaps is used to construct the router tables and get the shortest path to each destination router.

License

Notifications You must be signed in to change notification settings

jnagi-intel/routing

Repository files navigation

Routing

To compile both ssp and routing make all To compile only ssp make ssp To compile only routing make routing Delete all executables and object files make clean

To run ssp ./ssp input_1000000.txt 0 999999 To run routing ./routing input_graphsmall_part2.txt input_ipsmall_part2.txt 0 99

About

Routing scheme, where packets are forwarded to the next hop router by longest prefix matching using a binary trie and Dikstra's alogirhm implemented using Fibonacci heaps is used to construct the router tables and get the shortest path to each destination router.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published