Distance Vector Routing — Study Resources & PYQs
Distance vector routing
- Estimated study time: 32 minutes
Study resources
- Distance Vector Routing (Article) — Covers the Bellman-Ford based distance vector routing algorithm, routing tables, updates, and count-to-infinity problem.
- Distance Vector vs Link State Routing (Article) — Side-by-side comparison of both routing algorithms: convergence, scalability, and real-world use.
- Computer Networks PYQs: Comprehensive Review — Studocu (Distance Vector Routing, count-to-infinity problem explained) (PDF) — Computer Networks PYQs: Comprehensive Review — Studocu (Distance Vector Routing, count-to-infinity problem explained) — selected because the supplied resource topic is directly aligned with Distance…
- NPTEL — Computer Networks (IIT Madras) (Article) — IIT Madras NPTEL Computer Networks course covering layering, physical media, error control, flow control, ALOHA, Ethernet, routing, congestion control, IP, CIDR and application protocols.
Distance Vector Routing previous year questions
Taught in these subjects
- Computer Networks — CST-3502 · Government College of Engineering and Technology, Jammu
- Computer Networks — ECT-1803 · Government College of Engineering and Technology, Jammu