4-Routing Flashcards
ISP, Content Provider, Campus network or any independently operated network
Autonomous Systems (AS) or ASes
Routing within an AS
Intradomain Routing
Routing traffic between ASes
Interdomain Routing
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”.
Abeline network (A Single AS research network in US)
There are 2 types of Intradomain routing
1) Distance Vector
2) Link State
Distance Vector Routing
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
Distance Vector Routing is based on
Bellman-Ford algorithm
dx(y) = minv(c(x1v)+dv(y))
What is the solutiopn to the “Count to infinity problem?”
Poison Reverse
- Circa 1982
- edges have unit cost
- “infinity” = 16
- table refresh: 30 seconds (or when updates occur)
Routing Information Protocol (RIP)
More on RIP
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)
Alternative to RIP
Link-State routing
Link-State Routing (scale is an issue though)
- 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
Shortest path computation
Dijkstra algorithm
D(v) = min(c(v,w)*D(w), D(v))
2 common link-state routing protocols
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
Coping with Scale
Hierarchy