Professional Documents
Culture Documents
Network Layer:
Control Plane
Computer Networking: A
Top-Down Approach
8th edition
Jim Kurose, Keith Ross
Pearson, 2020
Network layer: “control plane” roadmap
introduction
routing protocols
link state
distance vector
Routing
Algorithm
control
plane
data
plane
values in arriving
packet header
0111 1
2
3
congested” application
transport
routing: a “top-10” networking enterprise
network
link
5 uwxvyz v
notes:
construct least-cost-path tree by tracing predecessor nodes
ties can exist (can be broken arbitrarily)
Network Layer: 5-14
Network layer: “control plane” roadmap
introduction
routing protocols
link state
distance vector
t=0 Da(e) = ∞
Da(f) = ∞ 1 1
Da(g) = ∞
All nodes have
Da(h) = ∞
distance estimates
Da(i) = ∞ A few asymmetries:
to nearest d e f missing link
neighbors (only) 1 1
larger cost
All nodes send
their local
distance vector to 1 1 1
their neighbors
g h i
1 1