TODAY’S TENTATIVE AGENDA

Slides:



Advertisements
Similar presentations
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization –All routers are identical –Network is flat. Not true in Practice Hierarchical.
Advertisements

Routing So how does the network layer do its business?
Unicast Routing Protocols: RIP, OSPF, and BGP
Chapter 27 Q and A Victor Norman IS333 Spring 2015.
INTRA- AND INTERDOMAIN ROUTING Routing inside an autonomous system is referred to as intradomain routing. Routing between autonomous systems is.
Delivery, Forwarding and
1 Chapter 27 Internetwork Routing (Static and automatic routing; route propagation; BGP, RIP, OSPF; multicast routing)
Transport Layer 3-1 Chapter 4 Network Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012  CPSC.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 14 Routing Protocols RIP, OSPF, BGP.
Unicast Routing Protocols  A routing protocol is a combination of rules and procedures that lets routers in the internet inform each other of changes.
Dr. Clincy1 Chapter 6 Delivery & Forwarding of IP Packets Lecture #4 Items you should understand by now – before routing Physical Addressing – with in.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Network Layer Protocols: Unicast and Multicast Routing Protocols 21.1 Unicast Routing 21.2 Unicast Routing.
TCP/IP Protocol Suite 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Unicast Routing Protocols.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 13 Routing Protocols (RIP, OSPF, BGP)
資 管 Lee Lesson 10 RIP, OSPF, and BGP. 資 管 Lee Routing in Internet An internet is divided into autonomous systems. An autonomous system(AS) is a group.
1 Routing Table  The seven fields Mask: for finding (sub)network address of the destination l Host-specific routing: (/32) l Default routing:
1 Internet Routing. 2 Terminology Forwarding –Refers to datagram transfer –Performed by host or router –Uses routing table Routing –Refers to propagation.
Link State Routing NETE0521 Presented by Dr.Apichan Kanjanavapastit.
TCOM 509 – Internet Protocols (TCP/IP) Lecture 06_a Routing Protocols: RIP, OSPF, BGP Instructor: Dr. Li-Chuan Chen Date: 10/06/2003 Based in part upon.
Internet Protocols. ICMP ICMP – Internet Control Message Protocol Each ICMP message is encapsulated in an IP packet – Treated like any other datagram,
An internet is a combination of networks connected by routers. When a datagram goes from a source to a destination, it will probably pass through many.
Transport Layer3-1 Network Layer Every man dies. Not every man really lives.
Chapter 20 Unicast Routing Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
(How the routers’ tables are filled in)
Computer Networks22-1 Network Layer Delivery, Forwarding, and Routing.
Ch 22. Routing Direct and Indirect Delivery.
1 INTRA- AND INTERDOMAIN ROUTING Routing inside an autonomous system is referred to as intradomain routing. Routing between autonomous systems is referred.
CS4500CS4500 Dr. Clincy1 Continuing Chapter 11 Unicast Routing Protocols (RIP, OSPF, BGP) (How the routers’ tables are filled in) Lecture 6.
TCP/IP Protocol Suite 1 Chapter 14 Upon completion you will be able to: Unicast Routing Protocols: RIP, OSPF, and BGP Distinguish between intra and interdomain.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Network Layer Routing Networks: Routing.
Chapter 4: Network Layer
Working at a Small-to-Medium Business or ISP – Chapter 6
Chapter 6 Delivery & Forwarding of IP Packets
Chapter 14 Routing Protocols (RIP, OSPF, and BGP)
Networking CS 3470, Section 1 Sarah Diesburg
Routing Protocols (RIP, OSPF, and BGP)
(How the routers’ tables are filled in)
(How the routers’ tables are filled in)
9 Network Layer Part VI Computer Networks Tutun Juhana
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
ICMP ICMP – Internet Control Message Protocol
Chapter 4: Network Layer
COMP 3270 Computer Networks
Chapter 6 Delivery & Forwarding of IP Packets
Distance Vector Routing
Net 323 D: Networks Protocols
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Routing.
STRUCTURE OF A ROUTER We represent a router as a black box that accepts incoming packets from one of the input ports (interfaces), uses a routing table.
(How the routers’ tables are filled in)
STRUCTURE OF A ROUTER We represent a router as a black box that accepts incoming packets from one of the input ports (interfaces), uses a routing table.
Delivery, Forwarding, and Routing
Will Review Exam 3 Dr. Clincy Lecture.
Chapter 13 Routing Protocols (RIP, OSPF, and BGP)
Routing Protocols (RIP, OSPF, BGP).
CS 3700 Networks and Distributed Systems
Chapter 4: Network Layer
CS 3700 Networks and Distributed Systems
Chapter 4: Network Layer
Network Layer Routing Networks: Routing.
Chapter 4: Network Layer
Working at a Small-to-Medium Business or ISP – Chapter 6
STRUCTURE OF A ROUTER We represent a router as a black box that accepts incoming packets from one of the input ports (interfaces), uses a routing table.
Computer Networks Protocols
Routing.
STRUCTURE OF A ROUTER We represent a router as a black box that accepts incoming packets from one of the input ports (interfaces), uses a routing table.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Network Layer Routing.
Chapter 6 Delivery & Forwarding of IP Packets
Presentation transcript:

TODAY’S TENTATIVE AGENDA 5pm-515pm 1. Return graded project 1 2. Lecture 14: I know you are anxious and want to only focus on taking the exam – so I will briefly cover OSPF and post the details 515pm-630pm 3. Exam Dr. Clincy

(How the routers’ tables are filled in) Chapter 11 Unicast Routing Protocols (RIP, OSPF, BGP) (How the routers’ tables are filled in) Dr. Clincy

Popular Unicast Routing protocols RIP (already covered) – Routing Information Protocol – treats each network the same (assigns the same cost for each network) OSPF – Open Shortest Path First protocol – assigns a cost for passing through a network based on the type of service required – routes through the network can have different cost – each router would have several tables BGP – Border Gateway Protocol – is an exterior routing protocol that uses a policy that defines what paths should be chosen Dr. Clincy

OSPF: Open Shortest Path First Similar to RIP however, divide autonomous system into areas Routers with in an area floods the area with routing info – router sends to all it’s neighbors and each neighbor sends to all it’s neighbors and etc.. At the border of an area, special routers called area border routers are used to (1) summarize info about an area and (2) send info amongst areas A special area called the backbone is used to tie together all of the areas – backbone is primary area and all other areas are secondary areas – backbone area uses backbone routers Note: backbone router can also be an area border router Each area has an ID (backbone’s Id is 0) Explain Current Real World Practices relating to this topic Dr. Clincy

Recall OSPF: Open Shortest Path First The OSPF is similar to RIP however, it allows the admin the ability to assign a cost or metric to each route. The metric can be based on a type of service (ie . Min delay, max throughput, etc..) For OSPF, a router will have multiple routing tables – one for each TOS Unlike RIP, sharing or updating is done when there is a change (not periodically) For OSPF, the objective is for the routers to contain the full picture or topology of the Internet – by having this, the router can figure out the “shortest path” or “least cost” route between itself and each network To do this, the Internet is represented by a graph – set of edges and nodes Dr. Clincy

You Can Now Start Exam 2 Dr. Clincy

Defining edges or connections/links Point-to-point link Virtual link Direct connection between two routers, no IP address needed Bi-directional Edge When link between two routers are broken, admin creates a new route across multiple routers Transient link Stub link Represents the network Connects to only one router – packets enter and leave through this same router Dr. Clincy

Graphical representation of an internet Dr. Clincy

OSPF uses Dijkstra’s Shortest Path Algorithm Dr. Clincy

Dijkstra’s Algorithm Cont.. Dr. Clincy

Dijkstra’s Algorithm Continued At this point, we would have the least cost path from A to all other nodes Note: to find the least cost paths from E to all other nodes, Disjkstra’s algorithm has to run again Dr. Clincy

Answer in Hyphen Format A-D A-D-N3 A-D-N3-F A-D-N3-F-N5 A-N1 A-N1-B A-N1-B-E A-N1-B-E-N4 A-N1-C A-N1-C-N2 Dr. Clincy

How do the OSPF packets travel across the network(s) ?????????????? A re-occurring theme How do the OSPF packets travel across the network(s) ?????????????? Dr. Clincy

OSPF packets are encapsulated in IP datagrams. Dr. Clincy

BGP: Border Gateway Protocol BPG is an inter-autonomous system routing protocol that makes use of path vector routing For BPG, each routing entry contains (1) destination network, (2) next router (hop) and (3) entire path to reach destination Path is an ordered list of autonomous systems that the packet should travel through to make it to the destination Dr. Clincy