Chapter 4: outline

4.1 introduction 4.5 routing algorithms

4.2 virtual circuit and ▪ link state
datagram networks ▪ distance vector
4.3 what’s inside a router ▪ hierarchical routing
4.4 IP: Internet Protocol 4.6 routing in the Internet
▪ datagram format ▪ RIP
▪ IPv4 addressing ▪ OSPF
▪ ICMP ▪ BGP
▪ IPv6 4.7 broadcast and multicast
routing

Network Layer 4-74

Interplay between routing, forwarding
routing algorithm determines
routing algorithm
end-end-path through network
forwarding table determines
local forwarding table
local forwarding at this router
dest address output link
address-range 1 3
address-range 2 2
address-range 3 2
address-range 4 1

IP destination address in
arriving packet’s header
1
3 2

Network Layer 4-75

Graph abstraction
5

v 3 w
2 5
u 2 1 z
3
1 2
x 1
y
graph: G = (N,E)

N = set of routers = { u, v, w, x, y, z }

E = set of links ={ (u,v), (u,x), (v,x), (v,w), (x,w), (x,y), (w,y), (w,z), (y,z) }

aside: graph abstraction is useful in other network contexts, e.g.,

P2P, where N is set of peers and E is set of TCP connections

Network Layer 4-76

Graph abstraction: costs
5
c(x,x’) = cost of link (x,x’)
3 e.g., c(w,z) = 5
v w 5
2
u cost could always be 1, or
2
3
1 z inversely related to bandwidth,
1 2 or inversely related to
x 1
y
congestion

cost of path (x1, x2, x3,…, xp) = c(x1,x2) + c(x2,x3) + … + c(xp-1,xp)

key question: what is the least-cost path between u and z

?
routing algorithm: algorithm that finds that least cost
path Network Layer 4-77
Routing algorithm classification
Q: global or decentralized Q: static or dynamic?
information? static:
global: ❖ routes change slowly over
❖ all routers have complete time
topology, link cost info dynamic:
❖ “link state” algorithms ❖ routes change more
decentralized: quickly
❖ router knows ▪ periodic update
physically-connected ▪ in response to link cost
neighbors, link costs to changes
neighbors
❖ iterative process of
computation, exchange of
info with neighbors
❖ “distance vector” algorithms
Network Layer 4-78
Chapter 4: outline
4.1 introduction 4.5 routing algorithms
4.2 virtual circuit and ▪ link state
datagram networks ▪ distance vector
4.3 what’s inside a router ▪ hierarchical routing
4.4 IP: Internet Protocol 4.6 routing in the Internet
▪ datagram format ▪ RIP
▪ IPv4 addressing ▪ OSPF
▪ ICMP ▪ BGP
▪ IPv6 4.7 broadcast and multicast
routing

Network Layer 4-79

A Link-State Routing Algorithm
Dijkstra’s algorithm notation:
❖ net topology, link costs ❖ c(x,y): link cost from
known to all nodes node x to y; = ∞ if not
▪ accomplished via “link state direct neighbors
broadcast” ❖ D(v): current value of
▪ all nodes have same info cost of path from source
❖ computes least cost paths to dest. v
from one node (‘source”) ❖ p(v): predecessor node
to all other nodes along path from source to
▪ gives forwarding table for v
that node ❖ N': set of nodes whose
❖ iterative: after k iterations, least cost path definitively
know least cost path to k known
dest.’s

Network Layer 4-80

Dijsktra’s Algorithm
1 Initialization:
2 N' = {u}
3 for all nodes v
4 if v adjacent to u
5 then D(v) = c(u,v)
6 else D(v) = ∞
7
8 Loop
9 find w not in N' such that D(w) is a minimum
10 add w to N'
11 update D(v) for all v adjacent to w and not in N' :
12 D(v) = min( D(v), D(w) + c(w,v) )
13 /* new cost to v is either old cost to v or known
14 shortest path cost to w plus cost from w to v */
15 until all nodes in N'

Network Layer 4-81

Dijkstra’s algorithm: example
D(v) D(w) D(x) D(y) D(z)
Step N' p(v) p(w) p(x) p(y) p(z)
0 u 7,u 3,u 5,u ∞ ∞
1 uw 6,w 5,u 11,w ∞
2 uwx 6,w 11,w 14,x
3 uwxv 10,v 14,x
4 uwxvy 12,y
5 uwxvyz x
9

notes: 5
4
7
❖ construct shortest path tree by
tracing predecessor nodes 8
❖ ties can exist (can be broken 3 w
u y z
arbitrarily) 2
3
7 4
v
Network Layer 4-82
 Dijkstra’s algorithm: another example
Step N' D(v),p(v) D(w),p(w) D(x),p(x) D(y),p(y) D(z),p(z)
0 u 2,u 5,u 1,u ∞ ∞
1 ux 2,u 4,x 2,x ∞
2 uxy 2,u 3,y 4,y
3 uxyv 3,y 4,y
4 uxyvw 4,y
5 uxyvwz

v 3 w
2 5
u 2 1 z
3
1 2
x 1
y

Network Layer 4-83

Dijkstra’s algorithm: example (2)
resulting shortest-path tree from u:

v w
u z
x y

resulting forwarding table in u:

destination link
v (u,v)
x (u,x)
y (u,x)
w (u,x)
z (u,x)
Network Layer 4-84
 Dijkstra’s algorithm, discussion
algorithm complexity: n nodes
❖ each iteration: need to check all nodes, w, not in N
❖ n(n+1)/2 comparisons: O(n2)
❖ more efficient implementations possible: O(nlogn)
oscillations possible:
❖ e.g., support link cost equals amount of carried traffic:

1
A 1+e A A A
2+e 0 0 2+e 2+e 0
D 0 0 B D 1+e 1 B D B D 1+e 1 B
0 0
0 e 0 0
C 0 1 0
1 C C 1+e C
1
e
given these costs, given these costs, given these costs,
initially find new routing…. find new routing…. find new routing….
resulting in new costs resulting in new costs resulting in new costs
Network Layer 4-85
Chapter 4: outline
4.1 introduction 4.5 routing algorithms
4.2 virtual circuit and ▪ link state
datagram networks ▪ distance vector
4.3 what’s inside a router ▪ hierarchical routing
4.4 IP: Internet Protocol 4.6 routing in the Internet
▪ datagram format ▪ RIP
▪ IPv4 addressing ▪ OSPF
▪ ICMP ▪ BGP
▪ IPv6 4.7 broadcast and multicast
routing

Network Layer 4-86

Distance vector algorithm
Bellman-Ford equation (dynamic programming)

let
dx(y) := cost of least-cost path from x to y
then
dx(y) = min {c(x,v) + dv(y) }
v

cost from neighbor v to destination y

cost to neighbor v

min taken over all neighbors v of

x
Network Layer 4-87
Bellman-Ford example
5
3
clearly, dv(z) = 5, dx(z) = 3, dw(z) = 3
v w 5
2
u 2 1 z B-F equation says:
3
1 2 du(z) = min { c(u,v) + dv(z),
x y
1 c(u,x) + dx(z),
c(u,w) + dw(z) }
= min {2 + 5,
1 + 3,
5 + 3} = 4
node achieving minimum is next
hop in shortest path, used in forwarding table
Network Layer 4-88
Distance vector algorithm
❖ Dx(y) = estimate of least cost from x to y
▪ x maintains distance vector Dx = [Dx(y): y є N ]
❖ node x:
▪ knows cost to each neighbor v: c(x,v)
▪ maintains its neighbors’ distance vectors. For
each neighbor v, x maintains
Dv = [Dv(y): y є N ]

Network Layer 4-89

 Distance vector algorithm
key idea:
❖ from time-to-time, each node sends its own
distance vector estimate to neighbors
❖ when x receives new DV estimate from neighbor,
it updates its own DV using B-F equation:
Dx(y) ← minv{c(x,v) + Dv(y)} for each node y ∊ N

❖ under minor, natural conditions, the estimate

Dx(y) converge to the actual least cost dx(y)

Network Layer 4-90

Distance vector algorithm
iterative, asynchronous: each
each local iteration node:
caused by:
❖ local link cost change wait for (change in local link
cost or msg from neighbor)
❖ DV update message from
neighbor
distributed: recompute estimates
❖ each node notifies
neighbors only when its
DV changes if DV to any dest has
▪ neighbors then notify their changed, notify neighbors
neighbors if necessary

Network Layer 4-91

 Dx(z) = min{c(x,y) +
Dx(y) = min{c(x,y) + Dy(y), c(x,z) + Dz(y)}
= min{2+0 , 7+1} = 2 Dy(z), c(x,z) + Dz(z)}
= min{2+1 , 7+0} = 3
node x cost to cost to
table x y z x y z
x 0 2 7 x 0 2 3

from
from

y ∞∞ ∞ y 2 0 1
z ∞∞ ∞ z 7 1 0

node y cost to
table x y z y
2 1
x ∞ ∞ ∞
x z
from

y 2 0 1 7
z ∞∞ ∞

node z cost to
table x y z
x ∞∞ ∞
from

y ∞∞ ∞
z 7 1 0
time
Network Layer 4-92
 Dx(z) = min{c(x,y) +
Dx(y) = min{c(x,y) + Dy(y), c(x,z) + Dz(y)}
= min{2+0 , 7+1} = 2 Dy(z), c(x,z) + Dz(z)}
= min{2+1 , 7+0} = 3
node x cost to cost to cost to
table x y z x y z x y z
x 0 2 7 x 0 2 3 x 0 2 3

from
from

y ∞∞ ∞ y 2 0 1 y 2 0 1

from
z ∞∞ ∞ z 7 1 0 z 3 1 0

node y cost to cost to cost to

table x y z x y z x y z y
2 1
x ∞ ∞ ∞ x 0 2 7 x 0 2 3 x z
from

from

y 2 0 1 y 2 0 1 7

from
y 2 0 1
z ∞∞ ∞ z 7 1 0 z 3 1 0

node z cost to cost to cost to

table x y z x y z x y z

x ∞∞ ∞ x 0 2 7 x 0 2 3
from

from

y 2 0 1 y 2 0 1
from

y ∞∞ ∞
z 7 1 0 z 3 1 0 z 3 1 0
time
Network Layer 4-93
 Distance vector: link cost changes
link cost changes: 1
❖ node detects local link cost change y
4 1
❖ updates routing info, recalculates x z
distance vector 50
❖ if DV changes, notify neighbors

“good t0 : y detects link-cost change, updates its DV, informs its

news neighbors.
travels t1 : z receives update from y, updates its table, computes new
fast” least cost to x , sends its neighbors its DV.

t2 : y receives z’s update, updates its distance table. y’s least costs
do not change, so y does not send a message to z.

Network Layer 4-94

Distance vector: link cost changes
link cost changes: 60
❖ node detects local link cost change y
4 1
❖ bad news travels slow - “count to x z
infinity” problem! 50
❖ 44 iterations before algorithm
stabilizes: see text

poisoned reverse:
❖ If Z routes through Y to get to X :
▪ Z tells Y its (Z’s) distance to X is infinite (so Y won’t route to
X via Z)
❖ will this completely solve count to infinity problem?

Network Layer 4-95

Comparison of LS and DV algorithms
message complexity robustness: what happens if
❖ LS: with n nodes, E links, O(nE) router malfunctions?
msgs sent LS:
❖ DV: exchange between neighbors ▪ node can advertise incorrect
only link cost
▪ convergence time varies ▪ each node computes only its
own table
speed of convergence
❖ LS: O(n2) algorithm requires
DV:
O(nE) msgs ▪ DV node can advertise
▪ may have oscillations incorrect path cost
❖ DV: convergence time varies ▪ each node’s table used by
others
▪ may be routing loops
• error propagate thru
▪ count-to-infinity problem network

Network Layer 4-96

Chapter 4: outline
4.1 introduction 4.5 routing algorithms
4.2 virtual circuit and ▪ link state
datagram networks ▪ distance vector
4.3 what’s inside a router ▪ hierarchical routing
4.4 IP: Internet Protocol 4.6 routing in the Internet
▪ datagram format ▪ RIP
▪ IPv4 addressing ▪ OSPF
▪ ICMP ▪ BGP
▪ IPv6 4.7 broadcast and multicast
routing

Network Layer 4-97

Hierarchical routing
our routing study thus far - idealization
❖ all routers identical
❖ network “flat”
… not true in practice

scale: with 600 million administrative autonomy

destinations: ❖ internet = network of
❖ can’t store all dest’s in networks
routing tables! ❖ each network admin may
❖ routing table exchange want to control routing in
would swamp links! its own network

Network Layer 4-98

Hierarchical routing
❖ aggregate routers into gateway router:
regions, “autonomous ❖ at “edge” of its own AS
systems” (AS) ❖ has link to router in
❖ routers in same AS another AS
run same routing
protocol
▪ “intra-AS” routing
protocol
▪ routers in different AS
can run different
intra-AS routing
protocol

Network Layer 4-99

Interconnected ASes

3c
3a 2c
3b 2a
AS3 2b
1c AS2
1a 1b AS1
1d ❖ forwarding table
configured by both intra-
and inter-AS routing
Intra-AS Inter-AS algorithm
Routing
▪ intra-AS sets entries
Routing
algorithm algorithm

Forwarding
for internal dests
table ▪ inter-AS & intra-AS
sets entries for
external dests
Network Layer 4-100
 Inter-AS tasks
❖ suppose router in AS1 AS1 must:
receives datagram 1. learn which dests are
destined outside of AS1: reachable through AS2,
▪ router should forward which through AS3
packet to gateway 2. propagate this
router, but which one? reachability info to all
routers in AS1
job of inter-AS routing!

3c
3a
3b
AS3 2c other
1c 2a networks
other 1a 2b
networks 1b AS2
AS1 1d

Network Layer 4-101

 Example: setting forwarding table in router 1d
❖ suppose AS1 learns (via inter-AS protocol) that subnet x
reachable via AS3 (gateway 1c), but not via AS2
▪ inter-AS protocol propagates reachability info to all internal
routers
❖ router 1d determines from intra-AS routing info that its
interface I is on the least cost path to 1c
▪ installs forwarding table entry (x,I)

3c … x
3a
3b
AS3 2c other
1c 2a networks
other 1a 2b
networks 1b AS2
AS1 1d

Network Layer 4-102

Example: choosing among multiple ASes

❖ now suppose AS1 learns from inter-AS protocol that subnet

x is reachable from AS3 and from AS2.
❖ to configure forwarding table, router 1d must determine
which gateway it should forward packets towards for dest x
▪ this is also job of inter-AS routing protocol!

3c … x …
3b
3a …
AS3 2c other
1c 2a networks
other 1a 2b
networks 1b AS2
AS1 1d
?
Network Layer 4-103
 Example: choosing among multiple ASes
❖ now suppose AS1 learns from inter-AS protocol that subnet
x is reachable from AS3 and from AS2.
❖ to configure forwarding table, router 1d must determine
towards which gateway it should forward packets for dest x
▪ this is also job of inter-AS routing protocol!
❖ hot potato routing: send packet towards closest of two
routers.

use routing info determine from

learn from inter-AS hot potato routing: forwarding table the
from intra-AS
protocol that subnet choose the gateway interface I that leads
protocol to determine
x is reachable via that has the to least-cost gateway.
costs of least-cost
multiple gateways smallest least cost Enter (x,I) in
paths to each
of the gateways forwarding table

Network Layer 4-104

Chapter 4: outline
4.1 introduction 4.5 routing algorithms
4.2 virtual circuit and ▪ link state
datagram networks ▪ distance vector
4.3 what’s inside a router ▪ hierarchical routing
4.4 IP: Internet Protocol 4.6 routing in the Internet
▪ datagram format ▪ RIP
▪ IPv4 addressing ▪ OSPF
▪ ICMP ▪ BGP
▪ IPv6 4.7 broadcast and multicast
routing

Network Layer 4-105

Intra-AS Routing
❖ also known as interior gateway protocols (IGP)
❖ most common intra-AS routing protocols:
▪ RIP: Routing Information Protocol
▪ OSPF: Open Shortest Path First
▪ IGRP: Interior Gateway Routing Protocol
(Cisco proprietary)

Network Layer 4-106

 RIP ( Routing Information Protocol)
❖ included in BSD-UNIX distribution in 1982
❖ distance vector algorithm
▪ distance metric: # hops (max = 15 hops), each link has cost 1
▪ DVs exchanged with neighbors every 30 sec in response message (aka
advertisement)
▪ each advertisement: list of up to 25 destination subnets (in IP addressing
sense)

from router A to destination subnets:

u v subnet hops
w u 1
A B
v 2
w 2
x x 3
z C D y 3
y z 2
Network Layer 4-107
RIP: example

z
w x y
A D B

C
routing table in router D
destination subnet next router # hops to dest
w A 2
y B 2
z B 7
x -- 1
…. …. ....
Network Layer 4-108
RIP: example
A-to-D advertisement
dest next hops
w - 1
x - 1
z C 4
…. … ... z
w x y
A D B

C
routing table in router D
destination subnet next router # hops to dest
w A 2
y B 2
A 5
z B 7
x -- 1
…. …. ....
Network Layer 4-109
RIP: link failure, recovery
if no advertisement heard after 180 sec -->
neighbor/link declared dead
▪ routes via neighbor invalidated
▪ new advertisements sent to neighbors
▪ neighbors in turn send out new advertisements (if tables
changed)
▪ link failure info quickly (?) propagates to entire net
▪ poison reverse used to prevent ping-pong loops (infinite
distance = 16 hops)

Network Layer 4-110

RIP table processing
❖ RIP routing tables managed by application-level
process called route-d (daemon)
❖ advertisements sent in UDP packets, periodically
repeated
routed routed

transport transprt
(UDP) (UDP)
forwardin
network forwarding network
g
(IP) table (IP)
table
link link
physical physical

Network Layer 4-111

OSPF (Open Shortest Path First)
❖ “open”: publicly available
❖ uses link state algorithm
▪ LS packet dissemination
▪ topology map at each node
▪ route computation using Dijkstra’s algorithm
❖ OSPF advertisement carries one entry per neighbor
❖ advertisements flooded to entire AS
▪ carried in OSPF messages directly over IP (rather than
TCP or UDP
❖ IS-IS routing protocol: nearly identical to OSPF

Network Layer 4-112

OSPF “advanced” features (not in RIP)
❖ security: all OSPF messages authenticated (to
prevent malicious intrusion)
❖ multiple same-cost paths allowed (only one path in
RIP)
❖ for each link, multiple cost metrics for different TOS
(e.g., satellite link cost set “low” for best effort ToS;
high for real time ToS)
❖ integrated uni- and multicast support:
▪ Multicast OSPF (MOSPF) uses same topology data
base as OSPF
❖ hierarchical OSPF in large domains.

Network Layer 4-113

Hierarchical OSPF
boundary router
backbone router

backbone
area
border
routers

area 3

internal
area 1 routers

area 2

Network Layer 4-114

Hierarchical OSPF
❖ two-level hierarchy: local area, backbone.
▪ link-state advertisements only in area
▪ each nodes has detailed area topology; only know
direction (shortest path) to nets in other areas.
❖ area border routers: “summarize” distances to nets
in own area, advertise to other Area Border routers.
❖ backbone routers: run OSPF routing limited to
backbone.
❖ boundary routers: connect to other AS’s.

Network Layer 4-115

Internet inter-AS routing: BGP
❖ BGP (Border Gateway Protocol): the de facto
inter-domain routing protocol
▪ “glue that holds the Internet together”
❖ BGP provides each AS a means to:
▪ eBGP: obtain subnet reachability information from
neighboring ASs.
▪ iBGP: propagate reachability information to all
AS-internal routers.
▪ determine “good” routes to other networks based on
reachability information and policy.
❖ allows subnet to advertise its existence to rest of
Internet: “I am here”

Network Layer 4-116

 BGP basics
❖ BGP session: two BGP routers (“peers”) exchange BGP
messages:
▪ advertising paths to different destination network prefixes (“path vector”
protocol)
▪ exchanged over semi-permanent TCP connections

❖ when AS3 advertises a prefix to AS1:

▪ AS3 promises it will forward datagrams towards that prefix
▪ AS3 can aggregate prefixes in its advertisement

3c
BGP
3a message
3b
AS3 2c other
1c 2a networks
other 1a 2b
networks 1b AS2
AS1 1d

Network Layer 4-117

BGP basics: distributing path information
❖ using eBGP session between 3a and 1c, AS3 sends prefix
reachability info to AS1.
▪ 1c can then use iBGP do distribute new prefix info to all routers
in AS1
▪ 1b can then re-advertise new reachability info to AS2 over
1b-to-2a eBGP session
❖ when router learns of new prefix, it creates entry for
prefix in its forwarding table.

eBGP session
3a iBGP session
3b
AS3 2c other
1c 2a networks
other 1a 2b
networks 1b AS2
AS1 1d

Network Layer 4-118

Path attributes and BGP routes
❖ advertised prefix includes BGP attributes
▪ prefix + attributes = “route”
❖ two important attributes:
▪ AS-PATH: contains ASs through which prefix
advertisement has passed: e.g., AS 67, AS 17
▪ NEXT-HOP: indicates specific internal-AS router to
next-hop AS. (may be multiple links from current AS to
next-hop-AS)
❖ gateway router receiving route advertisement uses
import policy to accept/decline
▪ e.g., never route through AS x
▪ policy-based routing

Network Layer 4-119

BGP route selection
❖ router may learn about more than 1 route to
destination AS, selects route based on:
1. local preference value attribute: policy decision
2. shortest AS-PATH
3. closest NEXT-HOP router: hot potato routing
4. additional criteria

Network Layer 4-120

BGP messages
❖ BGP messages exchanged between peers over TCP
connection
❖ BGP messages:
▪ OPEN: opens TCP connection to peer and authenticates
sender
▪ UPDATE: advertises new path (or withdraws old)
▪ KEEPALIVE: keeps connection alive in absence of
UPDATES; also ACKs OPEN request
▪ NOTIFICATION: reports errors in previous msg; also used
to close connection

Network Layer 4-121

 Putting it Altogether:
How Does an Entry Get Into a
Router’s Forwarding Table?
❖ Answer is complicated!

❖ Ties together hierarchical routing (Section 4.5.3)

with BGP (4.6.3) and OSPF (4.6.2).

❖ Provides nice overview of BGP!

How does entry get in forwarding table?

routing algorithms

Assume prefix
local forwarding table is
entry prefix output port
138.16.64/22 3
in another AS.
124.12/16 2
212/8 4
………….. …

Dest IP
1

3 2
How does entry get in forwarding table?

High-level overview
1. Router becomes aware of prefix
2. Router determines output port for prefix
3. Router enters prefix-port in forwarding table
Router becomes aware of prefix

3c
BGP
3a message
3b
AS3 2c other
1c 2a networks
other 1a 2b
networks 1b AS2
AS1 1d

❖ BGP message contains “routes”

❖ “route” is a prefix and attributes: AS-PATH,
NEXT-HOP,…
❖ Example: route:
❖ Prefix:138.16.64/22 ; AS-PATH: AS3 AS131 ;
NEXT-HOP: [Link]
Router may receive multiple routes

3c
BGP
3a message
3b
AS3 2c other
1c 2a networks
other 1a 2b
networks 1b AS2
AS1 1d

❖ Router may receive multiple routes for same prefix

❖ Has to select one route
Select best BGP route to prefix
❖ Router selects route based on shortest AS-PATH

❖ Example: selec
❖ AS2 AS17 to 138.16.64/22 t
❖ AS3 AS131 AS201 to 138.16.64/22

❖ What if there is a tie? We’ll come back to that!

Find best intra-route to BGP route
❖ Use selected route’s NEXT-HOP attribute
▪ Route’s NEXT-HOP attribute is the IP address of the
router interface that begins the AS PATH.
❖ Example:
❖ AS-PATH: AS2 AS17 ; NEXT-HOP: [Link]
❖ Router uses OSPF to find shortest path from 1c to
[Link]

3c
3a 111.99.86.
3b
AS3 55 2c other
1c 2a networks
other 1a 2b
networks 1b AS2
AS1 1d
Router identifies port for route

❖ Identifies port along the OSPF shortest path

❖ Adds prefix-port entry to its forwarding table:
▪ (138.16.64/22 , port 4)

3c router
3a port
3b
AS3 1 2c other
1c 4 2a networks
2 3
other 1a 2b
networks 1b AS2
AS1 1d
 Hot Potato Routing
❖ Suppose there two or more best inter-routes.
❖ Then choose route with closest NEXT-HOP
▪ Use OSPF to determine which gateway is closest
▪ Q: From 1c, chose AS3 AS131 or AS2 AS17?
▪ A: route AS3 AS201 since it is closer

3c
3a
3b
AS3 2c other
1c 2a networks
other 1a 2b
networks 1b AS2
AS1 1d
How does entry get in forwarding table?

Summary
1. Router becomes aware of prefix
▪ via BGP route advertisements from other routers
2. Determine router output port for prefix
▪ Use BGP route selection to find best inter-AS route
▪ Use OSPF to find best intra-AS route leading to best
inter-AS route
▪ Router identifies router port for that best route
3. Enter prefix-port entry in forwarding table
 BGP routing policy
legend: provider
B network
X
W A
customer
C network
:
Y

❖ A,B,C are provider networks

❖ X,W,Y are customer (of provider networks)
❖ X is dual-homed: attached to two networks
▪ X does not want to route from B via X to C
▪ .. so X will not advertise to B a route to C

Network Layer 4-132

 BGP routing policy (2)
legend: provider
B network
X
W A
customer
C network
:
Y

❖ A advertises path AW to B
❖ B advertises path BAW to X
❖ Should B advertise path BAW to C?
▪ No way! B gets no “revenue” for routing CBAW since neither W nor
C are B’s customers
▪ B wants to force C to route to w via A
▪ B wants to route only to/from its customers!

Network Layer 4-133

Why different Intra-, Inter-AS routing ?
policy:
❖ inter-AS: admin wants control over how its traffic
routed, who routes through its net.
❖ intra-AS: single admin, so no policy decisions needed
scale:
❖ hierarchical routing saves table size, reduced update
traffic
performance:
❖ intra-AS: can focus on performance
❖ inter-AS: policy may dominate over performance

Network Layer 4-134

Chapter 4: outline
4.1 introduction 4.5 routing algorithms
4.2 virtual circuit and ▪ link state
datagram networks ▪ distance vector
4.3 what’s inside a router ▪ hierarchical routing
4.4 IP: Internet Protocol 4.6 routing in the Internet
▪ datagram format ▪ RIP
▪ IPv4 addressing ▪ OSPF
▪ ICMP ▪ BGP
▪ IPv6 4.7 broadcast and multicast
routing

Network Layer 4-135

Broadcast routing
❖ deliver packets from source to all other nodes
❖ source duplication is inefficient:
duplicate
duplicate R1 creation/transmission R1
duplicate
R2 R2

R3 R4 R3 R4

source in-network
duplication duplication

❖ source duplication: how does source determine

recipient addresses?
Network Layer 4-136
In-network duplication
❖ flooding: when node receives broadcast packet,
sends copy to all neighbors
▪ problems: cycles & broadcast storm
❖ controlled flooding: node only broadcasts pkt if it
hasn’t broadcast same packet before
▪ node keeps track of packet ids already broadacsted
▪ or reverse path forwarding (RPF): only forward packet
if it arrived on shortest path between node and source
❖ spanning tree:
▪ no redundant packets received by any node

Network Layer 4-137

Spanning tree
❖ first construct a spanning tree
❖ nodes then forward/make copies only along
spanning tree

A A

B B
c c

D D
F E F E

G G
(a) broadcast initiated at A (b) broadcast initiated at D

Network Layer 4-138

Spanning tree: creation
❖ center node
❖ each node sends unicast join message to center
node
▪ message forwarded until it arrives at a node already
belonging to spanning tree

A A
3
B B
c c
4
2
D D
F E F E
1 5
G G
(a) stepwise construction of (b) constructed spanning
spanning tree (center: E) tree
Network Layer 4-139
Multicast routing: problem statement
goal: find a tree (or trees) connecting routers having
local mcast group members legend
❖ tree: not all paths between routers used group
❖ shared-tree: same tree used by all group members member
not group
❖ source-based: different tree from each sender to rcvrs member
router
with a
group
member
router
without
group
member

shared tree source-based trees

Network Layer 4-140
Approaches for building mcast trees
approaches:
❖ source-based tree: one tree per source
▪ shortest path trees
▪ reverse path forwarding
❖ group-shared tree: group uses one tree
▪ minimal spanning (Steiner)
▪ center-based trees

…we first look at basic approaches, then specific protocols

adopting these approaches

Network Layer 4-141

Shortest path tree
❖ mcast forwarding tree: tree of shortest path routes
from source to all receivers
▪ Dijkstra’s algorithm

s: source LEGEND
R1 2 router with attached
1 R4
group member
R2 5 router with no attached
3 4 group member
R5
i link used for forwarding,
R3 6
i indicates order link
R6 R7 added by algorithm

Network Layer 4-142

Reverse path forwarding

❖ rely on router’s knowledge of unicast shortest path

from it to sender
❖ each router has simple forwarding behavior:

if (mcast datagram received on incoming link on

shortest path back to center)
then flood datagram onto all outgoing links
else ignore datagram

Network Layer 4-143

Reverse path forwarding: example
s: source LEGEND
R1
R4 router with attached
group member
R2
router with no attached
R5 group member
R3 datagram will be forwarded
R6 R7
datagram will not be
forwarded

❖ result is a source-specific reverse SPT

▪ may be a bad choice with asymmetric links

Network Layer 4-144

Reverse path forwarding: pruning
❖ forwarding tree contains subtrees with no mcast group
members
▪ no need to forward datagrams down subtree
▪ “prune” msgs sent upstream by router with no
downstream group members
s: source
LEGEND
R1
R4
router with attached
group member
R2
P
router with no attached
R5 group member
P
R3 P prune message
R6 links with multicast
R7 forwarding

Network Layer 4-145

Shared-tree: steiner tree

❖ steiner tree: minimum cost tree connecting all

routers with attached group members
❖ problem is NP-complete
❖ excellent heuristics exists
❖ not used in practice:
▪ computational complexity
▪ information about entire network needed
▪ monolithic: rerun whenever a router needs to
join/leave

Network Layer 4-146

Center-based trees
❖ single delivery tree shared by all
❖ one router identified as “center” of tree
❖ to join:
▪ edge router sends unicast join-msg addressed to center
router
▪ join-msg “processed” by intermediate routers and
forwarded towards center
▪ join-msg either hits existing tree branch for this center,
or arrives at center
▪ path taken by join-msg becomes new branch of tree for
this router

Network Layer 4-147

Center-based trees: example
suppose R6 chosen as center:

LEGEND

R1 router with attached

R4
3 group member

R2 router with no attached

2 group member
1
R5 path order in which join
messages generated
R3
1 R6
R7

Network Layer 4-148

Internet Multicasting Routing: DVMRP

❖ DVMRP: distance vector multicast routing

protocol, RFC1075
❖ flood and prune: reverse path forwarding,
source-based tree
▪ RPF tree based on DVMRP’s own routing tables
constructed by communicating DVMRP routers
▪ no assumptions about underlying unicast
▪ initial datagram to mcast group flooded everywhere
via RPF
▪ routers not wanting group: send upstream prune msgs

Network Layer 4-149

DVMRP: continued…
❖ soft state: DVMRP router periodically (1 min.)
“forgets” branches are pruned:
▪ mcast data again flows down unpruned branch
▪ downstream router: reprune or else continue to receive
data
❖ routers can quickly regraft to tree
▪ following IGMP join at leaf
❖ odds and ends
▪ commonly implemented in commercial router

Network Layer 4-150

Tunneling
Q: how to connect “islands” of multicast routers in a
“sea” of unicast routers?

physical topology logical topology

❖ mcast datagram encapsulated inside “normal”

(non-multicast-addressed) datagram
❖ normal IP datagram sent thru “tunnel” via regular IP unicast
to receiving mcast router (recall IPv6 inside IPv4 tunneling)
❖ receiving mcast router unencapsulates to get mcast
datagram
Network Layer 4-151
PIM: Protocol Independent Multicast
❖ not dependent on any specific underlying unicast
routing algorithm (works with all)
❖ two different multicast distribution scenarios :

dense: sparse:
❖ group members densely ❖ # networks with group
packed, in “close” members small wrt #
proximity. interconnected networks
❖ bandwidth more plentiful ❖ group members “widely
dispersed”
❖ bandwidth not plentiful

Network Layer 4-152

Consequences of sparse-dense dichotomy:
dense sparse:
❖ group membership by ❖ no membership until routers
routers assumed until explicitly join
routers explicitly prune ❖ receiver- driven construction
❖ data-driven construction on of mcast tree (e.g.,
mcast tree (e.g., RPF) center-based)
❖ bandwidth and ❖ bandwidth and
non-group-router non-group-router processing
processing profligate conservative

Network Layer 4-153

PIM- dense mode
flood-and-prune RPF: similar to DVMRP but…
❖ underlying unicast protocol provides RPF info
for incoming datagram
❖ less complicated (less efficient) downstream
flood than DVMRP reduces reliance on
underlying routing algorithm
❖ has protocol mechanism for router to detect it
is a leaf-node router

Network Layer 4-154

PIM - sparse mode
❖ center-based approach
❖ router sends join msg to R1
R4
rendezvous point (RP) join
▪ intermediate routers R2
update state and join
forward join R5
❖ after joining via RP, router join
R3
can switch to R6
source-specific tree R7
all data multicast
▪ increased performance: from rendezvous
rendezvous
point
less concentration, point
shorter paths

Network Layer 4-155

PIM - sparse mode
sender(s):
R1
❖ unicast data to RP, R4
join
which distributes
down RP-rooted tree R2
join
❖ RP can extend mcast R5
tree upstream to join
R3
source R6
❖ RP can send stop msg all data multicast R7
rendezvous
if no attached from rendezvous point
point
receivers
▪ “no one is listening!”

Network Layer 4-156

Chapter 4: done!
4.1 introduction 4.5 routing algorithms
4.2 virtual circuit and ▪ link state, distance vector,
datagram networks hierarchical routing
4.3 what’s inside a router 4.6 routing in the Internet
▪ RIP, OSPF, BGP
4.4 IP: Internet Protocol
▪ datagram format, IPv4 4.7 broadcast and multicast
addressing, ICMP, IPv6 routing

❖ understand principles behind network layer services:

▪ network layer service models, forwarding versus routing
how a router works, routing (path selection), broadcast,
multicast
❖ instantiation, implementation in the Internet

Network Layer 4-157