Overview
What this challenge is about.
Build a distance-vector routing algorithm in Python with split-horizon, test on three topologies, and earn a verifiable certificate.
The scenario
The course's current implementation is a Java applet from 2008 that nobody can run anymore — the new version is a free-standing Python tool with web-friendly visualizations.
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.
Aligned coursework coming soon.
Skills
Skills you'll demonstrate.
Each one shows up on your verified credential.
- Routing
Apply routing to solve real industry problems and demonstrate production-level capability.
- Distance Vector
Apply distance vector to solve real industry problems and demonstrate production-level capability.
- Network Simulation
Apply network simulation to solve real industry problems and demonstrate production-level capability.
- Python
Write clean, efficient Python for data processing, automation, and backend services.
- Data Visualization
Transform complex data into clear, insightful visual representations.
- Algorithms
Apply algorithms to solve real industry problems and demonstrate production-level capability.
Careers
Career paths this challenge builds toward
Completing this challenge demonstrates skills that transfer directly to these roles: