CS168: Longest Prefix Matching / Compacting Routing Tables

Subscribers:
7,390
Published on ● Video Link: https://www.youtube.com/watch?v=1VMJt2-Kvq4



Duration: 34:03
18,761 views
218


0:00 Background
3:50 Problem 1 (Demonstration)
21:36 Problem 2 (Disc. 5, Q4)

http://cs168.io (Was from Fall 2016, so site may have changed)
Link to discussion folder: https://drive.google.com/drive/folders/0B0Grh6fTZTFwOGhGOU5kOXd6Xzg?usp=sharing

Annotations highly recommended







Tags:
cs168
cs 168
computer science
internet
networking
ip addresses
longest prefix matching
routing
routing protocol
uc berkeley
University of California Berkeley
Ross Teixeira
Algorithm
layer 3
osi
l3
l3 routing
IPv4
binary tree
data structure
university of california
undergrad teaching
berkeley undergrad teaching
ugsi
TA
teaching assistant
berkeley teaching assistant
IP
CIDR addressing
CIDR
classless routing
classless