An OSPF Neighbor Simulator

Document Type



Dr. Christian Trefftz, trefftzc@gvsu.edu

Embargo Period



The world of dynamic routing protocols can be split into two basic groups: Distance vector protocols and link-state routing protocols. Link-state routing protocols have gained popularity over the years due to their ability to calculate a more accurate routing table and an ability to do it quickly. The ability to do so however comes with a price. The price is one of complexity and a process of steps that have to be taken before they will exchange their routing information with a neighbor.

The process of establishing a neighbor relation is a complex one and requires a series of steps that must be taken in order to form a full neighbor relation. This project implements this process in a network programming language that involves responding with the necessary neighbor information in order to form a full adjacency and receive complete routing information from its' newly formed peer.

This document is currently not available here.