Lecture 6: Facebook & IGP Flashcards

1
Q

What kind of networking system does facebook use?

A

A singular administrative control

(one autonomous system)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is the first assumption of the cause for the FB being taking offline?

A

DNS

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

How do we know that DNS was not the cause of shut down?

A

The underlying IP address should have been reachable directly.

FBs began to become unresolvable

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What caused FB shut down?

A

They accidentally withdrew all their routes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How did they fix the BGP?

A

Relied on system admins and onsite network engineers to update the routing software at each FB datacenter

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What was the first protocol developed for IGP routing?

A

Distance-vector protocols

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What type of protocol has distance-vector lost favor to over the years?

A

link-state protocols

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What benefit did distance vectors have for when hardware had limited memory and access speed?

A

Didnt require that routers keep full maps of the network topology

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is the algorithm that is the core of Distance-Vector protocols?

A

Bellman Ford algorithm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

What is the bellman ford algorithm

A

Determines the shortest path in a weighted graph

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What are the 4 steps of bellman ford?

A
  1. assign infinite cost to getting to every vertex in the graph
  2. From the starting vertex, calculate costs to get to neighboring vertices based on the edge weight
  3. Recalculate vertex costs as necessary when new paths to that vertex lower the cost to get there
  4. After N-1 repetitions (n=# of nodes) the weights are properly assigned
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

What is the oldest IGP protocol?

A

RIP

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

How does RIP protocol work?

A

Uses 1 metirc - The hop count

Each edge in the RIP graph has a cost of one, so the total number of edges traversed = total number of hops

How well did you know this?
1
Not at all
2
3
4
5
Perfectly