Adaptive Routing Engine

I implemented both Distance Vector and Link-State routing in C/C++, including Dijkstra for shortest-path computation.

Routers exchange routing information, send heartbeats to detect failed neighbors, invalidate stale routes, and recompute paths when the topology changes. Poison reverse helps prevent bad Distance Vector loops.

The network rerouted traffic through alternate paths during simulated failures and returned to better routes when links recovered. I tested the recovery behavior across more than twenty failure scenarios.