Chapter 4

Network Layer

Computer
Networking: A Top
Down Approach
6th edition
Jim Kurose, Keith Ross
Addison-Wesley
March 2012

Network Layer 4-1

Chapter 4: network layer
chapter goals:
v understand principles behind network layer
services:
§ network layer service models
§ forwarding versus routing
§ how a router works
§ routing (path selection)
§ broadcast, multicast
v instantiation, implementation in the Internet

Network Layer 4-2

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
§ BGP
§ ICMP
§ IPv6 4.7 broadcast and multicast
routing

Network Layer 4-3

Network layer
application
v transport segment from transport
network

sending to receiving host data link

physical
network network

v on sending side network

data link
data link
physical
data link
physical

encapsulates segments physical network

data link
network
data link

into datagrams physical physical

v on receiving side, delivers network

data link
network
data link

segments to transport physical physical

network
data link

layer network
physical
application
transport

v network layer protocols network

data link
physical
network
data link
network
data link

in every host, router data link

physical
physical physical

v router examines header

fields in all IP datagrams
passing through it
Network Layer 4-4
Two key network-layer functions
v forwarding: move packets analogy:
from router’s input to
appropriate router v routing: process of
output planning trip from source
to dest
v routing: determine route
taken by packets from v forwarding: process of
source to dest. getting through single
interchange
§ routing algorithms

Network Layer 4-5

Interplay between routing and forwarding

routing algorithm routing algorithm determines

end-end-path through network

local forwarding table forwarding table determines

header value output link local forwarding at this router
0100 3
0101 2
0111 2
1001 1

value in arriving
packet’s header
0111 1

3 2

Network Layer 4-6

Connection setup
v 3rd important function in some network
architectures:
§ ATM, frame relay, X.25
v before datagrams flow, two end hosts and
intervening routers establish virtual connection
§ routers get involved
v network vs transport layer connection service:
§ network: between two hosts (may also involve intervening
routers in case of VCs)
§ transport: between two processes

Network Layer 4-7

Network service model
Q: What service model for “channel” transporting
datagrams from sender to receiver?
example services for example services for a flow
individual datagrams: of datagrams:
v guaranteed delivery v in-order datagram
v guaranteed delivery with delivery
less than 40 msec delay v guaranteed minimum
bandwidth to flow
v restrictions on changes in
inter-packet spacing

Network Layer 4-8

 Network layer service models:
Guarantees ?
Network Service Congestion
Architecture Model Bandwidth Loss Order Timing feedback

Internet best effort none no no no no (inferred

via loss)
ATM CBR constant yes yes yes no
rate congestion
ATM VBR guaranteed yes yes yes no
rate congestion
ATM ABR guaranteed no yes no yes
minimum
ATM UBR none no yes no no

Network Layer 4-9

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
§ BGP
§ ICMP
§ IPv6 4.7 broadcast and multicast
routing

Network Layer 4-10

Connection, connection-less service
v datagram network provides network-layer
connectionless service
v virtual-circuit network provides network-layer
connection service
v analogous to TCP/UDP connecton-oriented /
connectionless transport-layer services, but:
§ service: host-to-host
§ no choice: network provides one or the other
§ implementation: in network core

Network Layer 4-11

Virtual circuits
“source-to-dest path behaves much like telephone
circuit”
§ performance-wise
§ network actions along source-to-dest path

v call setup, teardown for each call before data can flow
v each packet carries VC identifier (not destination host
address)
v every router on source-dest path maintains “state” for
each passing connection
v link, router resources (bandwidth, buffers) may be
allocated to VC (dedicated resources = predictable
service)
Network Layer 4-12
VC implementation
a VC consists of:
1. path from source to destination
2. VC numbers, one number for each link along path
3. entries in forwarding tables in routers along path
v packet belonging to VC carries VC number
(rather than dest address)
v VC number can be changed on each link.
§ new VC number comes from forwarding table

Network Layer 4-13

 VC forwarding table
12 22 32

1 3
2
VC number
interface
forwarding table in number
northwest router:
Incoming interface Incoming VC # Outgoing interface Outgoing VC #

1 12 3 22
2 63 1 18
3 7 2 17
1 97 3 87
… … … …

VC routers maintain connection state information!

Network Layer 4-14
Virtual circuits: signaling protocols
v used to setup, maintain teardown VC
v used in ATM, frame-relay, X.25
v not used in today’s Internet

application application
5. data flow begins 6. receive data
transport transport
network 4. call connected 3. accept call
1. initiate call network
data link 2. incoming call
data link
physical physical

Network Layer 4-15

Datagram networks
v no call setup at network layer
v routers: no state about end-to-end connections
§ no network-level concept of “connection”
v packets forwarded using destination host address

application application
transport transport
network 1. send datagrams 2. receive datagrams network
data link data link
physical physical

Network Layer 4-16

Datagram forwarding table
4 billion IP addresses, so
routing algorithm rather than list individual
destination address
local forwarding table
list range of addresses
dest address output link
(aggregate table entries)
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-17

Datagram forwarding table
Destination Address Range Link Interface
11001000 00010111 00010000 00000000
through 0
11001000 00010111 00010111 11111111

11001000 00010111 00011000 00000000

through 1
11001000 00010111 00011000 11111111

11001000 00010111 00011001 00000000

through 2
11001000 00010111 00011111 11111111

otherwise 3

Q: but what happens if ranges don’t divide up so nicely?

Network Layer 4-18
Longest prefix matching
longest prefix matching
when looking for forwarding table entry for given
destination address, use longest address prefix that
matches destination address.

Destination Address Range Link interface

11001000 00010111 00010*** ********* 0

11001000 00010111 00011000 ********* 1

11001000 00010111 00011*** ********* 2

3
otherwise

examples:
DA: 11001000 00010111 00010110 10100001 which interface?
DA: 11001000 00010111 00011000 10101010 which interface?
Network Layer 4-19
Datagram or VC network: why?
Internet (datagram) ATM (VC)
v data exchange among v evolved from telephony
computers v human conversation:
§ “elastic” service, no strict § strict timing, reliability
timing req. requirements
§ need for guaranteed service
v many link types v “dumb” end systems
§ different characteristics § telephones
§ uniform service difficult § complexity inside
v “smart” end systems network
(computers)
§ can adapt, perform control,
error recovery
§ simple inside network,
complexity at “edge”

Network Layer 4-20

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
§ BGP
§ ICMP
§ IPv6 4.7 broadcast and multicast
routing

Network Layer 4-21

Router architecture overview
two key router functions:
v run routing algorithms/protocol (RIP, OSPF, BGP)
v forwarding datagrams from incoming to outgoing link

forwarding tables computed, routing

pushed to input ports routing, management
processor
control plane (software)

forwarding data
plane (hardware)

high-seed
switching
fabric

router input ports router output ports

Network Layer 4-22
Router images

Network Layer 4-23

 Input port functions
lookup,
link forwarding
line layer switch
termination protocol fabric
(receive)
queueing

physical layer:
bit-level reception
data link layer: decentralized switching:
e.g., Ethernet v given datagram dest., lookup output port
see chapter 5 using forwarding table in input port
memory (“match plus action”)
v goal: complete input port processing at
‘line speed’
v queuing: if datagrams arrive faster than
forwarding rate into switch fabric
Network Layer 4-24
Switching fabrics
v transfer packet from input buffer to appropriate
output buffer
v switching rate: rate at which packets can be
transfer from inputs to outputs
§ often measured as multiple of input/output line rate
§ N inputs: switching rate N times line rate desirable
v three types of switching fabrics

memory

memory bus crossbar

Network Layer 4-25

Switching via memory
first generation routers:
v traditional computers with switching under direct control
of CPU
v packet copied to system’s memory
v speed limited by memory bandwidth (2 bus crossings per
datagram)

input output
port memory port
(e.g., (e.g.,
Ethernet) Ethernet)

system bus

Network Layer 4-26

Switching via a bus
v datagram from input port memory
to output port memory via a
shared bus
v bus contention: switching speed
limited by bus bandwidth
v 32 Gbps bus, Cisco 5600: sufficient bus
speed for access and enterprise
routers

Network Layer 4-27

Switching via interconnection network
v overcome bus bandwidth limitations
v banyan networks, crossbar, other
interconnection nets initially
developed to connect processors in
multiprocessor
v advanced design: fragmenting
datagram into fixed length cells, crossbar
switch cells through the fabric.
v Cisco 12000: switches 60 Gbps
through the interconnection
network

Network Layer 4-28

Output ports This slide in HUGELY important!

datagram
switch buffer link
fabric layer line
protocol termination
queueing (send)

v buffering required when datagrams

Datagram arrive
(packets) can be lost
from fabric faster than the
due to transmission
congestion, lack of buffers
rate
v scheduling discipline chooses
Priority among
scheduling – who queued
gets best
datagrams for transmission
performance, network neutrality
Network Layer 4-29
Output port queueing

switch
switch
fabric
fabric

at t, packets more one packet time later

from input to output

v buffering when arrival rate via switch exceeds

output line speed
v queueing (delay) and loss due to output port buffer
overflow!
Network Layer 4-30
Input port queuing
v fabric slower than input ports combined -> queueing may
occur at input queues
§ queueing delay and loss due to input buffer overflow!
v Head-of-the-Line (HOL) blocking: queued datagram at front
of queue prevents others in queue from moving forward

switch switch
fabric fabric

output port contention: one packet time later:

only one red datagram can be green packet
transferred. experiences HOL
lower red packet is blocked blocking

Network Layer 4-32

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
§ BGP
§ ICMP
§ IPv6 4.7 broadcast and multicast
routing

Network Layer 4-33

The Internet network layer
host, router network layer functions:

transport layer: TCP, UDP

routing protocols IP protocol

• path selection • addressing conventions
• RIP, OSPF, BGP • datagram format
network • packet handling conventions
layer forwarding
table
ICMP protocol
• error reporting
• router
“signaling”
link layer

physical layer

Network Layer 4-34

 IP datagram format
IP protocol version 32 bits
number total datagram
header length type of length (bytes)
ver head. length
(bytes) len service for
“type” of data fragment fragmentation/
16-bit identifier flgs
offset
max number time to upper reassembly
header
remaining hops live layer checksum
(decremented at
each router) 32 bit source IP address
32 bit destination IP address
upper layer protocol
to deliver payload to options (if any) e.g. timestamp,
record route
how much overhead? data taken, specify
(variable length, list of routers
v 20 bytes of TCP
typically a TCP to visit.
v 20 bytes of IP
or UDP segment)
v = 40 bytes + app
layer overhead

Network Layer 4-35

 IP fragmentation, reassembly
v network links have MTU
(max.transfer size) -
largest possible link-level fragmentation:
frame

…
in: one large datagram
§ different link types, out: 3 smaller datagrams
different MTUs
v large IP datagram divided
(“fragmented”) within net reassembly
§ one datagram becomes
several datagrams
§ “reassembled” only at …
final destination
§ IP header bits used to
identify, order related
fragments
Network Layer 4-36
 IP fragmentation, reassembly
length ID fragflag offset
example: =4000 =x =0 =0
v 4000 byte datagram
one large datagram becomes
v MTU = 1500 bytes several smaller datagrams

1480 bytes in length ID fragflag offset

data field =1500 =x =1 =0

offset = length ID fragflag offset

1480/8 =1500 =x =1 =185

length ID fragflag offset

=1040 =x =0 =370

Network Layer 4-37

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
§ BGP
§ ICMP
§ IPv6 4.7 broadcast and multicast
routing

Network Layer 4-38

IP addressing: introduction
223.1.1.1
v IP address: 32-bit 223.1.2.1
identifier for host, router
interface 223.1.1.2
223.1.1.4 223.1.2.9
v interface: connection
between host/router and 223.1.3.27
physical link 223.1.1.3
223.1.2.2
§ router’s typically have
multiple interfaces
§ host typically has one or
223.1.3.1 223.1.3.2
two interfaces (e.g., wired
Ethernet, wireless 802.11)
v IP addresses associated
with each interface 223.1.1.1 = 11011111 00000001 00000001 00000001

223 1 1 1

Network Layer 4-39

Subnets
v IP address: 223.1.1.1
§subnet part - high order
bits 223.1.1.2 223.1.2.1
223.1.1.4 223.1.2.9
§host part - low order
bits 223.1.2.2
223.1.3.27
v what ’s a subnet ? 223.1.1.3

§device interfaces with subnet

same subnet part of IP
223.1.3.2
address 223.1.3.1
§can physically reach
each other without
intervening router network consisting of 3 subnets

Network Layer 4-41

Subnets
223.1.1.0/24
223.1.2.0/24
recipe 223.1.1.1

v to determine the 223.1.1.2 223.1.2.1

subnets, detach each 223.1.1.4 223.1.2.9

interface from its host 223.1.2.2

or router, creating 223.1.1.3 223.1.3.27

islands of isolated subnet

networks
223.1.3.2
v each isolated network 223.1.3.1

is called a subnet
223.1.3.0/24

subnet mask: /24

Network Layer 4-42
Subnets 223.1.1.2

how many? 223.1.1.1 223.1.1.4

223.1.1.3

223.1.9.2 223.1.7.0

223.1.9.1 223.1.7.1
223.1.8.1 223.1.8.0

223.1.2.6 223.1.3.27

223.1.2.1 223.1.2.2 223.1.3.1 223.1.3.2

Network Layer 4-43

IP Addresses
given notion of “network”, let’s re-examine IP addresses:

“class-full” addressing:

class
1.0.0.0 to
A 0 network host 127.255.255.255

B network 128.0.0.0 to
10 host
191.255.255.255
192.0.0.0 to
C 110 network host
223.255.255.255
224.0.0.0 to
D 1110 multicast address
239.255.255.255

32 bits

4: Network Layer 4a-44

IP addressing: CIDR
CIDR: Classless InterDomain Routing
§ subnet portion of address of arbitrary length
§ address format: a.b.c.d/x, where x is # bits in
subnet portion of address

subnet host
part part
11001000 00010111 00010000 00000000
200.23.16.0/23

Network Layer 4-45

IP addresses: how to get one?
Q: How does a host get IP address?

v hard-coded by system admin in a file

§ Windows: control-panel->network->configuration-
>tcp/ip->properties
§ UNIX: /etc/rc.config
v DHCP: Dynamic Host Configuration Protocol:
dynamically get address from as server
§ “plug-and-play”

Network Layer 4-46

DHCP: Dynamic Host Configuration Protocol
goal: allow host to dynamically obtain its IP address from network
server when it joins network
§ can renew its lease on address in use
§ allows reuse of addresses (only hold address while
connected/“on”)
§ support for mobile users who want to join network (more
shortly)
DHCP overview:
§ host broadcasts “DHCP discover” msg [optional]
§ DHCP server responds with “DHCP offer” msg [optional]
§ host requests IP address: “DHCP request” msg
§ DHCP server sends address: “DHCP ack” msg

Network Layer 4-47

DHCP client-server scenario

DHCP
223.1.1.0/24
server
223.1.1.1 223.1.2.1

223.1.1.2 arriving DHCP

223.1.1.4 223.1.2.9
client needs
address in this
223.1.1.3 223.1.3.27
223.1.2.2 network

223.1.2.0/24

223.1.3.1 223.1.3.2

223.1.3.0/24

Network Layer 4-48

DHCP client-server scenario
DHCP server: 223.1.2.5 DHCP discover arriving
client
src : 0.0.0.0, 68
Broadcast: is there a
dest.: 255.255.255.255,67
DHCPyiaddr:
server 0.0.0.0
out there?
transaction ID: 654

DHCP offer
src: 223.1.2.5, 67
Broadcast: I’m a DHCP
dest: 255.255.255.255, 68
server! Here’s an IP
yiaddrr: 223.1.2.4
transaction
address youID:can
654 use
lifetime: 3600 secs
DHCP request
src: 0.0.0.0, 68
dest:: 255.255.255.255, 67
Broadcast: OK. I’ll take
yiaddrr: 223.1.2.4
that IP address!
transaction ID: 655
lifetime: 3600 secs

DHCP ACK
src: 223.1.2.5, 67
dest: 255.255.255.255,
Broadcast: 68
OK. You’ve
yiaddrr: 223.1.2.4
got that IPID:
transaction address!
655
lifetime: 3600 secs
Network Layer 4-49
DHCP: more than IP addresses
DHCP can return more than just allocated IP
address on subnet:
§ address of first-hop router for client
§ name and IP address of DNS sever
§ network mask (indicating network versus host portion
of address)

Network Layer 4-50

IP addresses: how to get one?
Q: how does network get subnet part of IP addr?
A: gets allocated portion of its provider ISP’s address
space

ISP's block 11001000 00010111 00010000 00000000 200.23.16.0/20

Organization 0 11001000 00010111 00010000 00000000 200.23.16.0/23

Organization 1 11001000 00010111 00010010 00000000 200.23.18.0/23
Organization 2 11001000 00010111 00010100 00000000 200.23.20.0/23
... ….. …. ….
Organization 7 11001000 00010111 00011110 00000000 200.23.30.0/23

Network Layer 4-54

Hierarchical addressing: route aggregation
hierarchical addressing allows efficient advertisement of routing
information:

Organization 0
200.23.16.0/23
Organization 1
“Send me anything
200.23.18.0/23 with addresses
Organization 2 beginning
200.23.20.0/23 . Fly-By-Night-ISP 200.23.16.0/20”
.
. . Internet
.
Organization 7 .
200.23.30.0/23
“Send me anything
ISPs-R-Us
with addresses
beginning
199.31.0.0/16”

Network Layer 4-55

Hierarchical addressing: more specific routes

ISPs-R-Us has a more specific route to Organization 1

Organization 0
200.23.16.0/23

“Send me anything
with addresses
Organization 2 beginning
200.23.20.0/23 . Fly-By-Night-ISP 200.23.16.0/20”
.
. . Internet
.
Organization 7 .
200.23.30.0/23
“Send me anything
ISPs-R-Us
with addresses
Organization 1 beginning 199.31.0.0/16
or 200.23.18.0/23”
200.23.18.0/23

Network Layer 4-56

IP addressing: the last word...

Q: how does an ISP get block of addresses?

A: ICANN: Internet Corporation for Assigned
Names and Numbers http://www.icann.org/
§ allocates addresses
§ manages DNS
§ assigns domain names, resolves disputes

Network Layer 4-57

 NAT: network address translation
rest of local network
Internet (e.g., home network)
10.0.0/24 10.0.0.1

10.0.0.4
10.0.0.2
138.76.29.7

10.0.0.3

all datagrams leaving local datagrams with source or

network have same single destination in this network
source NAT IP address: have 10.0.0/24 address for
138.76.29.7,different source source, destination (as usual)
port numbers
Network Layer 4-58
 NAT: network address translation
motivation: local network uses just one IP address as far
as outside world is concerned:
§ range of addresses not needed from ISP: just one
IP address for all devices
§ can change addresses of devices in local network
without notifying outside world
§ can change ISP without changing addresses of
devices in local network
§ devices inside local net not explicitly addressable,
visible by outside world (a security plus)

Network Layer 4-59

NAT: network address translation
implementation: NAT router must:

§ outgoing datagrams: replace (source IP address, port #) of

every outgoing datagram to (NAT IP address, new port #)
. . . remote clients/servers will respond using (NAT IP
address, new port #) as destination addr

§ remember (in NAT translation table) every (source IP address,

port #) to (NAT IP address, new port #) translation pair

§ incoming datagrams: replace (NAT IP address, new port #) in

dest fields of every incoming datagram with corresponding
(source IP address, port #) stored in NAT table

Network Layer 4-60

 NAT: network address translation
NAT translation table 1: host 10.0.0.1
2: NAT router WAN side addr LAN side addr
changes datagram sends datagram to
source addr from 138.76.29.7, 5001 10.0.0.1, 3345 128.119.40.186, 80
10.0.0.1, 3345 to …… ……
138.76.29.7, 5001,
updates table S: 10.0.0.1, 3345
D: 128.119.40.186, 80
10.0.0.1
1
S: 138.76.29.7, 5001
2 D: 128.119.40.186, 80 10.0.0.4
10.0.0.2
138.76.29.7 S: 128.119.40.186, 80
D: 10.0.0.1, 3345 4
S: 128.119.40.186, 80
D: 138.76.29.7, 5001 3 10.0.0.3
4: NAT router
3: reply arrives changes datagram
dest. address: dest addr from
138.76.29.7, 5001 138.76.29.7, 5001 to 10.0.0.1, 3345

Network Layer 4-61

NAT: network address translation
v 16-bit port-number field:
§ 60,000 simultaneous connections with a single
LAN-side address!
v NAT is controversial:
§ routers should only process up to layer 3
§ violates end-to-end argument
• NAT possibility must be taken into account by app
designers, e.g., P2P applications
§ address shortage should instead be solved by
IPv6

Network Layer 4-62

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
§ BGP
§ ICMP
§ IPv6 4.7 broadcast and multicast
routing

Network Layer 4-66

ICMP: internet control message protocol

v used by hosts & routers

to communicate network- Type Code description
0 0 echo reply (ping)
level information 3 0 dest. network unreachable
§ error reporting: 3 1 dest host unreachable
unreachable host, network, 3 2 dest protocol unreachable
port, protocol 3 3 dest port unreachable
§ echo request/reply (used by 3 6 dest network unknown
ping) 3 7 dest host unknown
v network-layer “above” IP: 4 0 source quench (congestion
§ ICMP msgs carried in IP control - not used)
datagrams 8 0 echo request (ping)
9 0 route advertisement
v ICMP message: type, code 10 0 router discovery
plus first 8 bytes of IP 11 0 TTL expired
datagram causing error 12 0 bad IP header

Network Layer 4-67

Traceroute and ICMP
v source sends series of v when ICMP messages
UDP segments to dest arrives, source records
§ first set has TTL =1 RTTs
§ second set has TTL=2, etc.
§ unlikely port number stopping criteria:
v when nth set of datagrams v UDP segment eventually
arrives to nth router: arrives at destination host
§ router discards datagrams v destination returns ICMP
§ and sends source ICMP “port unreachable”
messages (type 11, code 0) message (type 3, code 3)
§ ICMP messages includes
v source stops
name of router & IP address

3 probes 3 probes

3 probes
Network Layer 4-68
 IPv6: motivation
v initial motivation: 32-bit address space soon to be
completely allocated.
v additional motivation:
§ header format helps speed processing/forwarding
§ header changes to facilitate QoS

IPv6 datagram format:

§ fixed-length 40 byte header
§ no fragmentation allowed

Network Layer 4-69

IPv6 datagram format
priority: identify priority among datagrams in flow
flow Label: identify datagrams in same “flow.”
(concept of“flow” not well defined).
next header: identify upper layer protocol for data
ver pri flow label
payload len next hdr hop limit
source address
(128 bits)
destination address
(128 bits)

data

32 bits
Network Layer 4-70
Other changes from IPv4
v checksum: removed entirely to reduce processing
time at each hop
v options: allowed, but outside of header, indicated
by “Next Header” field
v ICMPv6: new version of ICMP
§ additional message types, e.g. “Packet Too Big”
§ multicast group management functions

Network Layer 4-71

IPv6: adoption
v US National Institutes of Standards estimate [2013]:
§ ~3% of industry IP routers
§ ~11% of US gov’t routers

v Long (long!) time for deployment, use

§ 20 years and counting!
§ think of application-level changes in last 20 years: WWW,
Facebook, …
§ Why?

Network Layer 4-75

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
§ BGP
§ ICMP
§ IPv6 4.7 broadcast and multicast
routing

Network Layer 4-76

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-77

Graph abstraction
5

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

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-78

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

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-79

Routing algorithm classification
Q: global or decentralized Q: static or dynamic?
information?
static:
global: v routes change slowly over
v all routers have complete time
topology, link cost info dynamic:
v “link state” algorithms v routes change more
decentralized: quickly
v router knows physically- § periodic update
connected neighbors, link § in response to link
costs to neighbors cost changes
v iterative process of
computation, exchange of
info with neighbors
v “distance vector” algorithms
Network Layer 4-80
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
§ BGP
§ ICMP
§ IPv6 4.7 broadcast and multicast
routing

Network Layer 4-81

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

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 7
4
v construct shortest path tree by
tracing predecessor nodes 8
v ties can exist (can be broken u 3 w y z
arbitrarily) 2
3
7 4
v
Network Layer 4-84
 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 y
1

Network Layer 4-85

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-86
 Dijkstra’s algorithm, discussion
algorithm complexity: n nodes
v each iteration: need to check all nodes, w, not in N
v n(n+1)/2 comparisons: O(n2)
v more efficient implementations possible: O(nlogn)
oscillations possible:
v 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 B
0 0 1+e 1
0 e 0 0
C C 0 1
C 1+e C 0
1 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-87
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
§ BGP
§ ICMP
§ IPv6 4.7 broadcast and multicast
routing

Network Layer 4-88

Distance vector algorithm
Bellman-Ford equation (dynamic programming)

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

cost from neighbor v to destination y

cost to neighbor v

min taken over all neighbors v of x

Network Layer 4-89
Bellman-Ford example
5
3
clearly, dv(z) = 5, dx(z) = 3, dw(z) = 3
v w
2 5
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-90
Distance vector algorithm
v Dx(y) = estimate of least cost from x to y
§ x maintains distance vector Dx = [Dx(y): y є N ]
v 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-91

Distance vector algorithm
key idea:
v from time-to-time, each node sends its own
distance vector estimate to neighbors
v 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

v under minor, natural conditions, the estimate Dx(y)

converge to the actual least cost dx(y)

Network Layer 4-92

Distance vector algorithm
iterative, asynchronous: each node:
each local iteration
caused by:
v local link cost change wait for (change in local link
cost or msg from neighbor)
v DV update message from
neighbor
distributed: recompute estimates
v 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-93

 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
y ∞∞ ∞ y 2 0 1
from

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-94
 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
y ∞∞ ∞ y 2 0 1
from

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

y 2 0 1 y 2 0 1 7
from

y 2 0 1

from
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-95
 Distance vector: link cost changes
link cost changes: 1
v node detects local link cost change 4
y
1
v updates routing info, recalculates x z
distance vector 50
v 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-96

Distance vector: link cost changes
link cost changes: 60
v node detects local link cost change 4
y
1
v bad news travels slow - “count to x z
infinity” problem! 50
v 44 iterations before algorithm
stabilizes: see text
poisoned reverse:
v 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)
v will this completely solve count to infinity problem?

Network Layer 4-97

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

Network Layer 4-98

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
§ BGP
§ ICMP
§ IPv6 4.7 broadcast and multicast
routing

Network Layer 4-99

Hierarchical routing
our routing study thus far - idealization
v all routers identical

v network “flat”
… not true in practice

scale: with 600 million administrative autonomy

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

Network Layer 4-100

Hierarchical routing
v aggregate routers into gateway router:
regions, “autonomous v at “edge” of its own AS
systems” (AS) v has link to router in
v 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-101

Interconnected ASes

3c
3a 2c
3b 2a
AS3 2b
1c AS2
1a 1b AS1
1d v forwarding table
configured by both intra-
and inter-AS routing
Intra-AS Inter-AS algorithm
Routing Routing
algorithm algorithm § intra-AS sets entries
Forwarding
for internal dests
table § inter-AS & intra-AS
sets entries for
external dests
Network Layer 4-102
 Inter-AS tasks
v 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-103

 Example: setting forwarding table in router 1d
v 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
v 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-104

Example: choosing among multiple ASes

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

x is reachable from AS3 and from AS2.
v 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-105
 Example: choosing among multiple ASes
v now suppose AS1 learns from inter-AS protocol that subnet
x is reachable from AS3 and from AS2.
v 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!
v hot potato routing: send packet towards closest of two
routers.

use routing info determine from

learn from inter-AS from intra-AS hot potato routing: forwarding table the
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-106

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
§ BGP
§ ICMP
§ IPv6 4.7 broadcast and multicast
routing

Network Layer 4-107

Intra-AS Routing
v also known as interior gateway protocols (IGP)
v 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-108

 RIP ( Routing Information Protocol)
v included in BSD-UNIX distribution in 1982
v 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-109
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-110
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-111
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-112

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

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

Network Layer 4-113

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

Network Layer 4-114

OSPF “advanced” features (not in RIP)
v security: all OSPF messages authenticated (to prevent
malicious intrusion)
v multiple same-cost paths allowed (only one path in
RIP)
v 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)
v integrated uni- and multicast support:
§ Multicast OSPF (MOSPF) uses same topology data
base as OSPF
v hierarchical OSPF in large domains.

Network Layer 4-115

Hierarchical OSPF
boundary router
backbone router

backbone
area
border
routers

area 3

internal
routers
area 1
area 2

Network Layer 4-116

Hierarchical OSPF
v 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.
v area border routers: “summarize” distances to nets in
own area, advertise to other Area Border routers.
v backbone routers: run OSPF routing limited to
backbone.
v boundary routers: connect to other AS’s.

Network Layer 4-117

Internet inter-AS routing: BGP
v BGP (Border Gateway Protocol): the de facto
inter-domain routing protocol
§ “glue that holds the Internet together”
v 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.
v allows subnet to advertise its existence to rest of
Internet: “I am here”
Network Layer 4-118
 BGP basics
v 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

v 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-119
BGP basics: distributing path information
v 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
v 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-120
Path attributes and BGP routes
v advertised prefix includes BGP attributes
§ prefix + attributes = “route”
v 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)
v gateway router receiving route advertisement uses
import policy to accept/decline
§ e.g., never route through AS x
§ policy-based routing

Network Layer 4-121

BGP route selection
v 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-122

BGP messages
v BGP messages exchanged between peers over TCP
connection
v 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-123

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

v Ties together hierarchical routing (Section 4.5.3)

with BGP (4.6.3) and OSPF (4.6.2).

v Provides nice overview of BGP!

How does entry get in forwarding table?

routing algorithms

Assume prefix is
local forwarding table in another AS.
entry prefix output port
138.16.64/22 3
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

v BGP message contains “routes”

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

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

v Router may receive multiple routes for same prefix

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

v Example: select

v AS2 AS17 to 138.16.64/22

v AS3 AS131 AS201 to 138.16.64/22

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

Find best intra-route to BGP route
v 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.
v Example:
v AS-PATH: AS2 AS17 ; NEXT-HOP: 111.99.86.55
v Router uses OSPF to find shortest path from 1c to
111.99.86.55

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

v Identifies port along the OSPF shortest path

v 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
v Suppose there two or more best inter-routes.
v 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 AS131 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:

v A,B,C are provider networks

v X,W,Y are customer (of provider networks)
v 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-134

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

v A advertises path AW to B
v B advertises path BAW to X
v 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-135

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

Network Layer 4-136

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

v understand principles behind network layer services:

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

Network Layer 4-159