Professional Documents
Culture Documents
Jennifer Rexford
Princeton University
http://www.cs.princeton.edu/~jrex/bgp-tutorial
Local Control
Intradomain routing,
interdomain policies
Global Properties
Performance, security,
reliability, scalability
BGP security
BGP convergence
Internet Addressing
and Routing Architecture
Hierarchical Addressing
IP Address (IPv4)
A unique 32-bit number
Identifies an interface (on a host, router, )
Represented in dotted-quad notation
12
34
158
host ...
host
host
host ...
host
LAN 2
LAN 1
router
WAN
router
WAN
router
Scalability Challenge
Suppose hosts had arbitrary addresses
Every router would need a lot of information
to direct packets toward every host
1.2.3.4
5.6.7.8
host
host ...
2.4.6.8
host
1.2.3.5
5.6.7.9
host
host ...
2.4.6.9
host
LAN 2
LAN 1
router
WAN
router
WAN
router
1.2.3.4
1.2.3.5
forwarding table
The solution:
Introduce hierarchy
9
34
158
Host (8 bits)
10
34
158
Mask
255
255
255
0
11
1.2.3.4
1.2.3.7 1.2.3.156
host ...
host
host
host
host ...
host
LAN 2
LAN 1
router
WAN
router
WAN
router
1.2.3.0/24
5.6.7.0/24
forwarding table
12
1.2.3.4
1.2.3.7 1.2.3.156
host ...
host
host
host
host ...
host
LAN 2
LAN 1
router
WAN
router
WAN
router
host
5.6.7.213
1.2.3.0/24
5.6.7.0/24
forwarding table
13
14
Classful Addressing
In the olden days, only fixed allocation sizes
Class A: 0*
Class B: 10*
Class C: 110*
Class D: 1110*
Multicast groups
Class E: 11110*
15
IP Address : 12.4.0.0
Address
Mask
IP Mask: 255.254.0.0
for hosts
16
:
:
:
12.254.0.0/16
12.3.0.0/24
12.3.1.0/24
:
:
:
:
:
12.3.254.0/24
12.253.0.0/19
12.253.32.0/19
12.253.64.0/19
12.253.96.0/19
12.253.128.0/19
12.253.160.0/19
17
18
Ways to query
UNIX: whois h whois.arin.net 128.112.136.35
http://www.arin.net/whois/
http://www.geektools.com/whois.php
19
20
Provider
201.10.0.0/22
201.10.4.0/24
201.10.5.0/24
201.10.6.0/23
Provider 1
Provider 2
Provider 1
Provider 2
201.10.6.0/23
201.10.7.0/24
201.10.6.0/23
201.10.6.0/24
201.10.6.0/23
Provider 1
Provider 2
24
4.0.0.0/8
4.83.128.0/17
201.10.0.0/21
201.10.6.0/23
126.255.103.0/24
outgoing link
Serial0/0.1
25
Non-uniform hierarchy
For heterogeneous networks of different sizes
Initial class-based addressing was far too coarse
Classless InterDomain Routing (CIDR) helps
26
27
31
32
33
34
35
Routing architecture
36
Internet Structure
37
38
Level 3: 1
MIT: 3
Harvard: 11
Yale: 29
Princeton: 88
AT&T: 7018, 6341, 5074,
UUNET: 701, 702, 284, 12199,
Sprint: 1239, 1240, 6211, 6242,
39
AS-Level Topology
Node: Autonomous System
Edge: Two ASes that connect to each other
4
3
5
2
40
AS 1
Exchange Point
AS 2
AS 2
AS 3
41
Customer-Provider Relationship
Customer needs to be reachable from everyone
provider
provider
traffic
customer
customer
43
Peer-Peer Relationship
Peers exchange traffic between customers
AS lets its peer reach (only) its customers
AS can reach its peers customers
Often the relationship is settlement-free (i.e., no $$$)
Traffic to/from the peer and its customers
peer
traffic
peer
44
peer-peer
peer-peer
peer-peer
45
Stub ASes
Routing Architecture
47
48
3
5
49
50
5
2
51
52
53
Shortest-Path Routing
Path-selection model
Destination-based
Load-insensitive (e.g., static link weights)
Minimum hop count or sum of link weights
Main approaches
Link-state routing
Path-vector routing
3
2
1
1
4
4
5
3
54
Shortest-Path Problem
Compute: path costs to all nodes
From a given source u to all other nodes
Cost of path through each outgoing link
Next hop along the least-cost path to s
2
3
u
2
6
4
s
3
55
Link-State Routing
Flooding of topology information
Shortest-path computation
Next-hop forwarding
Router forwards packets to
next hop in (shortest) path
3
2
1
1
4
4
5
3
56
Distance-Vector Routing
Dissemination of path-cost information
Shortest-path selection
Next-hop forwarding
Router forwards packets to
next hop in (shortest) path
3
s
5
d
3
57
Source Routing
Flooding of topology information
58
Path-Vector Routing
Extension of distance-vector routing
Support flexible routing policies
Avoid count-to-infinity problem
Next-hop forwarding
Forward packets to next hop
Example: BGP
2
3
s
5
d
6
59
Interdomain routing
Between different ASes
Cooperating only for end-to-end reachability
Policy-based path selection
Different ASes need to run a common protocol
60
Conclusions
IP address
A 32-bit number
Allocated in prefixes
Non-uniform hierarchy (for scalability & flexibility)
Scalability challenges
Overhead of 300,000 prefixes on IP routers
Running out of IPv4 addresses
61