Overview
What this challenge is about.
Implement distance-vector routing in Python: each simulated router maintains a distance vector, exchanges vectors with neighbors every 1 second of simulated time, and updates its routing table on receipt. Include split-horizon and poisoned-reverse to mitigate count-to-infinity. Demonstrate on 3 topologies: 5-node mesh (initial convergence), 12-node hierarchical (convergence under random link cost changes), 28-node with a planned link failure at t=30s (recovery). Visualize routing-table evolution with a small animation. Deliver source, the 3 topology configurations, animation outputs, and an 8-page teaching guide.
The Brief
What you'll do, and what you'll demonstrate.
Implement distance-vector routing with split-horizon + poisoned-reverse and demonstrate convergence on 3 topologies including a link-failure recovery case.
Earning criteria — what you'll demonstrate
- Implement Bellman-Ford-based distance-vector routing
- Apply split-horizon and poisoned-reverse against count-to-infinity
- Visualize distributed-algorithm state over time
- Communicate networking concepts in teaching-grade material
Program Fit
Where this fits in your program.
Sharpens the same skills your degree expects you to demonstrate.
Skills
Skills you'll demonstrate.
Each one shows up on your verified credential.
Careers
Roles this prepares you for.
Real titles. Real skill bridges. Pick the one closest to your trajectory.
Career mappings coming soon.