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.
CredentialBlockchain-anchored
ShareableLinkedIn-ready
LanguageEnglish
PaceSelf-paced
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.