Academic project
Distributed asynchronous routing
Seattle University
Implemented a distance-vector routing algorithm across a simulated network of four nodes.
THE BRIEF
What needed to be built.
Keep routing information updated as nodes exchange packets asynchronously.
MY CONTRIBUTIONS
My contribution.
Routing & message handling
- Implemented routing-table initialization and updates from incoming routing packets.
- Exchanged minimum-cost paths with neighboring nodes.
- Handled packet delays and tracked packets in transit to support reliable updates.
THE RESULT
Routing across four simulated nodes.
Implemented route discovery across four simulated nodes, with asynchronous updates and delayed-packet handling that kept routing tables current as messages arrived.