PPT - Introduction to IP Routing Protocols Computer Science Engineering (CSE) Notes | EduRev

 Page 1


IP Routing Tutorial
Introduction to IP Routing Protocols
Stefan Fouant
ShortestPathFirst Consulting Services
www.shortestpathfirst.com
Page 2


IP Routing Tutorial
Introduction to IP Routing Protocols
Stefan Fouant
ShortestPathFirst Consulting Services
www.shortestpathfirst.com
Agenda
• Routing – The 10,000 Foot View
• Routing in the Internet: A Brief History
» Static Routing and the evolution of Dynamic Routing Protocols
• Interior Gateway Protocols
» Purpose
» Distance-Vector vs. Link-State
• Exterior Gateway Protocols
ShortestPathFirst Consulting Services
www.shortestpathfirst.net
ShortestPathFirst Consulting Services
www.shortestpathfirst.net
» Purpose
» Autonomous Systems
» Policy
• Multi-Protocol Label Switching
» Shortest-Cost Routing vs. Traffic-Engineering
» MPLS VPNs
• Quality of Service
• The Future of Internet Routing
Page 3


IP Routing Tutorial
Introduction to IP Routing Protocols
Stefan Fouant
ShortestPathFirst Consulting Services
www.shortestpathfirst.com
Agenda
• Routing – The 10,000 Foot View
• Routing in the Internet: A Brief History
» Static Routing and the evolution of Dynamic Routing Protocols
• Interior Gateway Protocols
» Purpose
» Distance-Vector vs. Link-State
• Exterior Gateway Protocols
ShortestPathFirst Consulting Services
www.shortestpathfirst.net
ShortestPathFirst Consulting Services
www.shortestpathfirst.net
» Purpose
» Autonomous Systems
» Policy
• Multi-Protocol Label Switching
» Shortest-Cost Routing vs. Traffic-Engineering
» MPLS VPNs
• Quality of Service
• The Future of Internet Routing
Introduction
• How does data go from one place on the Internet to 
another?
ShortestPathFirst Consulting Services
www.shortestpathfirst.net
ShortestPathFirst Consulting Services
www.shortestpathfirst.net
Page 4


IP Routing Tutorial
Introduction to IP Routing Protocols
Stefan Fouant
ShortestPathFirst Consulting Services
www.shortestpathfirst.com
Agenda
• Routing – The 10,000 Foot View
• Routing in the Internet: A Brief History
» Static Routing and the evolution of Dynamic Routing Protocols
• Interior Gateway Protocols
» Purpose
» Distance-Vector vs. Link-State
• Exterior Gateway Protocols
ShortestPathFirst Consulting Services
www.shortestpathfirst.net
ShortestPathFirst Consulting Services
www.shortestpathfirst.net
» Purpose
» Autonomous Systems
» Policy
• Multi-Protocol Label Switching
» Shortest-Cost Routing vs. Traffic-Engineering
» MPLS VPNs
• Quality of Service
• The Future of Internet Routing
Introduction
• How does data go from one place on the Internet to 
another?
ShortestPathFirst Consulting Services
www.shortestpathfirst.net
ShortestPathFirst Consulting Services
www.shortestpathfirst.net
Routing – The Easy Explanation?
• The “Easy” answer:
» If the shortest path from node i to 
node j, with distance D(i,j) 
passes through neighbor k, with link cost 
c(i,k), then:
D(i,j) = c(i,k) + D(k,j) (Distance-Vector Protocols)
ShortestPathFirst Consulting Services
www.shortestpathfirst.net
ShortestPathFirst Consulting Services
www.shortestpathfirst.net
D(i,j) = c(i,k) + D(k,j) (Distance-Vector Protocols)
or
D(i,j) = D(i,k) + c(k,j) (Link-State Protocols)
Page 5


IP Routing Tutorial
Introduction to IP Routing Protocols
Stefan Fouant
ShortestPathFirst Consulting Services
www.shortestpathfirst.com
Agenda
• Routing – The 10,000 Foot View
• Routing in the Internet: A Brief History
» Static Routing and the evolution of Dynamic Routing Protocols
• Interior Gateway Protocols
» Purpose
» Distance-Vector vs. Link-State
• Exterior Gateway Protocols
ShortestPathFirst Consulting Services
www.shortestpathfirst.net
ShortestPathFirst Consulting Services
www.shortestpathfirst.net
» Purpose
» Autonomous Systems
» Policy
• Multi-Protocol Label Switching
» Shortest-Cost Routing vs. Traffic-Engineering
» MPLS VPNs
• Quality of Service
• The Future of Internet Routing
Introduction
• How does data go from one place on the Internet to 
another?
ShortestPathFirst Consulting Services
www.shortestpathfirst.net
ShortestPathFirst Consulting Services
www.shortestpathfirst.net
Routing – The Easy Explanation?
• The “Easy” answer:
» If the shortest path from node i to 
node j, with distance D(i,j) 
passes through neighbor k, with link cost 
c(i,k), then:
D(i,j) = c(i,k) + D(k,j) (Distance-Vector Protocols)
ShortestPathFirst Consulting Services
www.shortestpathfirst.net
ShortestPathFirst Consulting Services
www.shortestpathfirst.net
D(i,j) = c(i,k) + D(k,j) (Distance-Vector Protocols)
or
D(i,j) = D(i,k) + c(k,j) (Link-State Protocols)
Routing – the 10,000 Foot View
• Computers use numerical Internet Protocol (IP) addresses to reach each other
• DNS provides a mechanism whereby a user-friendly DNS name (i.e. www.amazon.com) can be 
translated to a numerical IP address (i.e. 72.21.210.250) which can than be used to reach the 
intended destination
• Once we have the destination IP address, we need to package our data into IP packets
ShortestPathFirst Consulting Services
www.shortestpathfirst.net
ShortestPathFirst Consulting Services
www.shortestpathfirst.net