chapter 5 - network layer: control plane Flashcards

(11 cards)

1
Q

What is the goal of a routing protocol?

A

Find good paths from source to destination (least cost, fastest)

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

How does traditional per-router control work?

A

Each router runs its own routing algorithm and interacts locally

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

How is an internet control message protocol (ICMP) message delivered?

A

It is carried inside an IP packet
back to the original sender with error message

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

How does logically centralized control (SDN) work

A

A central controller computes and installs forwarding rules in routers

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

What info does an ICMP error message include?

A

shows the path your data takes from your device to a destination
—-
* Type, code, first 8 bytes of the IP datagram that caused the error

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

How does traceroute use ICMP?

A

TTL=1, for each hop TTL=-1. when TTL = 0 drops packet and sends back an ICMP msg to sender, so sender knows which is the first packet. then TTL=2, hopper 2 hopp og sender ICMP message to sender which is router nr 2

(time to live) = TTL

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

When does traceroute stop?

A

When the destination replies with “port unreachable” (ICMP type 3, code 3)

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

What is network management?

A

Monitoring, configuring, and controlling network devices to ensure performance

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

Difference between global and decentralized routing?

A

Global: all routers know the network topology and link costs
Decentralized: routers know only neighbors and iteratively update info

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

What kind of algorithm is Dijkstra’s? + goal of the algorithm

A

Global link-state routing algorithm
The least-cost path from a source node to all other nodes

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

Key difference between link-state and distance-vector routing?

A

Link-state: full topology knowledge, fast convergence
Distance-vector: local knowledge, simpler, but slower convergence

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