4-Routing Flashcards

1
Q

ISP, Content Provider, Campus network or any independently operated network

A

Autonomous Systems (AS) or ASes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Routing within an AS

A

Intradomain Routing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Routing traffic between ASes

A

Interdomain Routing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

A high-performance backbone network created by the Internet2 community in the late 1990s. In 2007 it was retired and the upgraded network became known as the “Internet2 Network”.

A

Abeline network (A Single AS research network in US)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

There are 2 types of Intradomain routing

A

1) Distance Vector

2) Link State

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Distance Vector Routing

A

1) Each node sends multiple distance vectors to each of its neighbors (copies of own routing table)
2) Routers compute costs to each destination based on shortest available path

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Distance Vector Routing is based on

A

Bellman-Ford algorithm

dx(y) = minv(c(x1v)+dv(y))

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

What is the solutiopn to the “Count to infinity problem?”

A

Poison Reverse

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q
  • Circa 1982
  • edges have unit cost
  • “infinity” = 16
  • table refresh: 30 seconds (or when updates occur)
A

Routing Information Protocol (RIP)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

More on RIP

A

When an entry changes, it sends the copy of that update to all of it’s neighbors except the one that caused the update (also known as the “split Horizon” rule)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Alternative to RIP

A

Link-State routing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Link-State Routing (scale is an issue though)

A
  • Each node distributes a network map to every other node in the network
  • Each node performs a shortest path computation between itself and all other nodes in the network
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Shortest path computation

A

Dijkstra algorithm

D(v) = min(c(v,w)*D(w), D(v))

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

2 common link-state routing protocols

A

1) Open Shortest Paths First (OSPF) ->Areas
2) Intermediate System- Intermediate System (IS-IS) -large ISP and most commonly used in large transit networks today ->Levels

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Coping with Scale

A

Hierarchy

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

ASes advertise reach-ability to some destination by sending announcements or route advertisements. the protocol used to advertise these announcements is called

A

Border Gateway Protocol (BGP)

17
Q

Sequence of AS numbers that describe the route to the destination (Sequence of ASes that the route traversed to reach the recipient AS)

A

AS Path (1 BGP route attributes)

18
Q

The last AS

A

The origin AS

19
Q

Responsible for transmitting routing information between border routers of adjacent ASes about external destinations

A

external BGP or eBGP

20
Q

Responsible for disseminating BGP route advertisements about external destinations to routers inside any particular AS

A

internal BGP or iBGP

21
Q

Routes inside an AS to internal destinations

A

Intradomain routing protocol or IGP

22
Q

BGP Route Selection Process

A

1) Prefer a route with the higher “local preference” value
2) Shortest AS path length
3) Multi-exit discriminator (MED)
- Lower values
- Only comparable among routes from same AS
4) Shortest IGP path (“hot potato” routing)
5) Tiebreak -> “most stable” or advertised the longest -> lowest router ID typically

23
Q

Local Preference (Local Pref)

A

Allows operator to configure the router to assign different preference values to each of the routes that it learns

24
Q

Local Preference (Local Pref)

A

Sometimes used to control OUTBOUND traffic

25
Q

Local Preference (Local Pref)

A

Extremely useful for configuring Primary and Backup route

26
Q

Tag on a route

A

“Community”

27
Q

Multiple Exit Discriminator (MED)

A

To override “hot potato” routing behavior - ASes may use MED values (remember NY and SF example)

28
Q

Interdomain Routing Business Models

A

3 types and their rankings:
1) Customer, > 2) Peering (settlement free peering) , > 3) Provider

Money is flowing in the direction of the provider

29
Q

Interdomain Routing Business Models

A

From Customer: Everyone
Provider: only Customers
Peer: other customers

30
Q

Interdomain Routing Can Oscillate

A

BGP corrective property called “Saftey” by Griffin

But regional and paid peering can violate - so BGP is not guaranteed to be stable… due to Oscillation.