Download 3rd Edition: Chapter 4

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Net bias wikipedia , lookup

Asynchronous Transfer Mode wikipedia , lookup

CAN bus wikipedia , lookup

Distributed firewall wikipedia , lookup

Deep packet inspection wikipedia , lookup

IEEE 1355 wikipedia , lookup

Piggybacking (Internet access) wikipedia , lookup

Network tap wikipedia , lookup

Peering wikipedia , lookup

Zero-configuration networking wikipedia , lookup

Spanning Tree Protocol wikipedia , lookup

Wake-on-LAN wikipedia , lookup

Computer network wikipedia , lookup

Cracking of wireless networks wikipedia , lookup

List of wireless community networks by region wikipedia , lookup

Internet protocol suite wikipedia , lookup

Multiprotocol Label Switching wikipedia , lookup

Airborne Networking wikipedia , lookup

IEEE 802.1aq wikipedia , lookup

Recursive InterNetwork Architecture (RINA) wikipedia , lookup

Routing wikipedia , lookup

Routing in delay-tolerant networking wikipedia , lookup

Transcript
Chapter 4: outline
4.1 introduction
4.2 virtual circuit and
datagram networks
4.3 what’s inside a router
4.4 IP: Internet Protocol




datagram format
IPv4 addressing
ICMP
IPv6
4.5 routing algorithms
 link state
 distance vector
 hierarchical routing
4.6 routing in the Internet
 RIP
 OSPF
 BGP
4.7 broadcast and multicast
routing
Network Layer 4-1
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
 contains link cost to each neighbor

advertisements (LSA) flooded to entire AS
 carried in OSPF messages directly over IP, protocol 89
(rather than TCP or UDP)

IS-IS routing protocol: nearly identical to OSPF
 also uses Dijkstra’s shortest path first algorithm
 routing data encapsulated in Layer 2 (link layer)
Network Layer 4-2
OSPF “advanced” features (not in RIP)

security: all OSPF messages authenticated (to prevent
malicious intrusion)
 uses MD5 message digest authentication




multiple same-cost paths allowed (only one path in
RIP) - can be used to load balance
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-3
OSPF (Open Shortest Path First)

5 types of OSPF packets
 “HELLO”, describe, request, update, ack (see RFC 2328)

Common header for each type
Network Layer 4-4
Hierarchical OSPF
boundary router
backbone router
backbone
area
border
routers
area 3
internal
routers
area 1
area 2
Network Layer 4-5
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-6
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:
 obtain subnet reachability information from
neighboring ASs (eBGP)
 propagate reachability information to all AS-internal
routers (iBGP)
 determine “good” routes to other networks based on
reachability information and policy.

allows subnets to advertise existence to rest of
Internet: “I am here”
Network Layer 4-7
Interconnected ASes
3c
3a
3b
AS3
2a
1c
1a
1d
2c
2b
AS2
1b AS1
Intra-AS
Routing
algorithm
Inter-AS
Routing
algorithm
Forwarding
table

forwarding table
configured by both intraand inter-AS routing
algorithm
 intra-AS sets entries
for internal dests
 inter-AS & intra-AS
sets entries for
external dests
Network Layer 4-8
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 toward that prefix
 AS3 can aggregate prefixes in its advertisement
3c
3b
other
networks
3a
BGP
message
AS3
2c
1c
1a
AS1
1d
2a
1b
2b
other
networks
AS2
Network Layer 4-9
BGP basics: distributing path information

using eBGP session between 3a and 1c, AS3 sends prefix
reachability info to AS1.
 1c can then use iBGP to distribute new prefix info to all routers in
AS1
 1b can then re-advertise new reachability info to AS2 over 1b-to2a eBGP session

when router learns of new prefix, it creates entry for
prefix in its forwarding table.
eBGP session
3b
other
networks
3a
AS3
iBGP session
2c
1c
1a
AS1
1d
2a
1b
2b
other
networks
AS2
Network Layer 4-10
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 nexthop AS. (may be multiple links from current AS to nexthop-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-11
BGP route selection

router may learn about more than 1 route to
destination AS, selects route based on:
1.
2.
3.
4.
local preference value attribute: policy decision
shortest AS-PATH
closest NEXT-HOP router: hot potato routing
additional criteria
Network Layer 4-12
BGP messages


BGP messages exchanged between peers over TCP
connection (port 179)
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 message; also
used to close connection
Network Layer 4-13
BGP routing policy, example
legend:
provider (“backbone”)
network
B
W
X
A
customer (“stub”)
network:
C
Y



A,B,C are provider networks
X,W,Y are customers (of provider networks)
X is dual-homed: reachable by 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-14
BGP routing policy (2)
legend:
provider (“backbone”)
network
B
W
X
A
customer (“stub”)
network:
C
Y



A advertises path AW to peer B
B advertises path BAW to customer X
Should B advertise path BAW to peer 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-15
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-16
Chapter 4: outline
4.1 introduction
4.2 virtual circuit and
datagram networks
4.3 what’s inside a router
4.4 IP: Internet Protocol




datagram format
IPv4 addressing
ICMP
IPv6
4.5 routing algorithms
 link state
 distance vector
 hierarchical routing
4.6 routing in the Internet
 RIP
 OSPF
 BGP
4.7 broadcast and multicast
routing
Network Layer 4-17
Broadcast routing: source duplication


source delivers packets to all other nodes
source duplication is inefficient:
duplicate
duplicate
creation/transmission
R1
R1
duplicate
R2
R2
R3
R4
source
duplication

R3
R4
in-network
duplication
source duplication problem: how does source
determine how many recipients and their addresses?
Network Layer 4-18
In-network duplication

flooding: when node receives broadcast packet,
sends copy to all neighbors
 problems: cycles & broadcast storm

controlled flooding: node only broadcasts packet if
it hasn’t broadcast same packet before
 node keeps track of packet ids already broadcast
 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-19
Spanning tree


first construct a spanning tree
nodes then forward/make copies only along
spanning tree
A
c
prune
A
B
c
prune
F
prune
prune
D
B
prune
E
F
G
(a) broadcast initiated at A
prune
D
E
G
(b) broadcast initiated at D
Network Layer 4-20
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
E
F
1
2
D
D
F
5
E
G
(a) stepwise construction of
spanning tree (center: E)
G
(b) constructed spanning
tree
Network Layer 4-21
Multicast routing: problem statement
goal: find a tree (or trees) connecting routers having
local multicast group members
legend



tree: not all paths between routers used
shared-tree: same tree used by all group members
source-based: different tree from each sender to rcvrs
group
member
not group
member
router
with a
group
member
router
without
group
member
shared tree
source-based trees
Role of IGMP?
Network Layer 4-22
IGMPv4 Message Format

RFC 2236
Type
 Membership Query: learn group members on network
 Membership Report: declare group membership
 Leave Group: declare departure from group

Max Response Time
 in Membership Query only
 max time before sending response in 1/10 second units


Checksum: 16-bit ones complement
Group Address: IP multicast address (zero in request
message)
Chapter 16b Multicasting
23
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-24
Shortest path tree

mcast forwarding tree: tree of shortest path
routes from source to all receivers
 Dijkstra’s algorithm
LEGEND
s: source
R1
1
2
R2
3
router with attached
group member
R4
5
4
R3
R6
router with no attached
group member
R5
6
R7
i
link used for forwarding,
i indicates order link
added by algorithm
Network Layer 4-25
Reverse path forwarding
rely on router’s knowledge of unicast shortest
path from it to sender
 each router has simple forwarding behavior:

if (multicast datagram received on incoming link on
shortest path back to center)
then flood datagram onto all outgoing links
else ignore datagram
Network Layer 4-26
Reverse path forwarding: example
s: source
LEGEND
R1
R4
router with attached
group member
R2
R5
router with no attached
group member
datagram will be forwarded
R3
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-27
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
R2
router with attached
group member
P
R5
R3
P
R6
R7
router with no attached
group member
P
prune message
links with multicast
forwarding
Network Layer 4-28
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-30
Center-based trees: example
suppose R6 chosen as center:
LEGEND
R1
3
R2
router with attached
group member
R4
router with no attached
group member
2
R5
R3
1
1
path order in which join
messages generated
R6
R7
Network Layer 4-31
Internet Multicasting Routing: DVMRP


DVMRP: distance vector multicast routing
protocol, RFC1075
flood and prune: reverse path forwarding, sourcebased tree
 RPF tree based on DVMRP’s own routing tables
constructed by communicating DVMRP routers
 no assumptions about underlying unicast
 initial datagram to multicast group flooded
everywhere via RPF
 routers not wanting group: send upstream prune
messages
Network Layer 4-32
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-33
PIM: Protocol Independent Multicast


not dependent on any specific underlying unicast
routing algorithm (works with all)
two different multicast distribution scenarios :
dense:


group members densely
packed, in “close”
proximity.
bandwidth more plentiful
sparse:



# networks with group
members small wrt #
interconnected networks
group members “widely
dispersed”
bandwidth not plentiful
Network Layer 4-34
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-35
PIM - sparse mode



center-based approach
router sends join msg to
rendezvous point (RP)
 intermediate routers
update state and
forward join
after joining via RP, router
can switch to sourcespecific tree
 increased
performance: less
concentration, shorter
paths
R1
R4
join
R2
join
R5
R3
join
R6
all data multicast
from rendezvous
point
R7
rendezvous
point
Network Layer 4-36
PIM - sparse mode
sender(s):



unicast data to RP,
which distributes
down RP-rooted tree
RP can extend
multicast tree
upstream to source
RP can send stop
message if no attached
receivers
R1
R4
join
R2
join
R5
R3
join
R6
all data multicast
from rendezvous
point
R7
rendezvous
point
 “no one is listening!”
Network Layer 4-37
Chapter 4: done!
4.1 introduction
4.2 virtual circuit and
datagram networks
4.3 what’s inside a router
4.4 IP: Internet Protocol
 datagram format, IPv4
addressing, ICMP, IPv6


4.5 routing algorithms
 link state, distance vector,
hierarchical routing
4.6 routing in the Internet
 RIP, OSPF, BGP
4.7 broadcast and multicast
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-38