Shortest Path Routing- Distance Vector

Loading...
From the course by University of Colorado System
Packet Switching Networks and Algorithms
1 rating
University of Colorado System

Packet Switching Networks and Algorithms

1 rating
Course 3 of 4 in the Specialization Computer Communications
From the lesson
Routing in Packet Networks
This module examines the other basic packet switching approach - virtual circuit, introduces basic approaches for selecting routes across the network, discusses the Bellman-ford algorithm for distance vector based shortest path routing.

Meet the Instructors

  • Xiaobo Zhou
    Xiaobo Zhou
    Professor, Interim Dean
    College of Engineering and Applied Sciences