Shortest Path Routing- Distance Vector

From the course by Система университетов штата Колорадо
Packet Switching Networks and Algorithms
9 ratings
Система университетов штата Колорадо
9 ratings
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

Ознакомьтесь с нашим каталогом

Присоединяйтесь бесплатно и получайте персонализированные рекомендации, обновления и предложения.