Network routing (without failures) 
Network routing (without failures)
by MIT
Video Lecture 19 of 24
Copyright Information: Hari Balakrishnan, and George Verghese. 6.02 Introduction to EECS II: Digital Communication Systems, Fall 2012. (Massachusetts Institute of Technology: MIT OpenCourseWare), http://ocw.mit.edu (Accessed 2 Mar, 2015). License: Creative Commons BY-NC-SA
Not yet rated
Views: 763
Date Added: March 2, 2015

Lecture Description

Instructor: Hari Balakrishnan

This lecture covers networking routing in multi-hop networks. After an interactive simulation game, distributed routing, distance-vector routing, and link-state routing are discussed with minimum cost path in mind.

Course Index

Course Description

An introduction to several fundamental ideas in electrical engineering and computer science, using digital communication systems as the vehicle. The three parts of the course—bits, signals, and packets—cover three corresponding layers of abstraction that form the basis of communication systems like the Internet.

The course, taught by Prof. George Verghese, teaches ideas that are useful in other parts of EECS: abstraction, probabilistic analysis, superposition, time and frequency-domain representations, system design principles and trade-offs, and centralized and distributed algorithms. The course emphasizes connections between theoretical concepts and practice using programming tasks and some experiments with real-world communication channels.

Comments

There are no comments. Be the first to post one.
  Post comment as a guest user.
Click to login or register:
Your name:
Your email:
(will not appear)
Your comment:
(max. 1000 characters)
Are you human? (Sorry)