Routing So how does the network layer do its business?

Slides:



Advertisements
Similar presentations
Computer Networks with Internet Technology William Stallings
Advertisements

Courtesy: Nick McKeown, Stanford
© 2007 Cisco Systems, Inc. All rights reserved.ICND2 v1.0—3-1 Medium-Sized Routed Network Construction Reviewing Routing Operations.
Chapter 11 Unicast Routing Protocols
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization –All routers are identical –Network is flat. Not true in Practice Hierarchical.
Unicast Routing Protocols: RIP, OSPF, and BGP
CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 22 Introduction to Computer Networks.
Internet Networking Spring 2002
Unicast Routing Protocols: RIP, OSPF, and BGP
CSE 461: Distance Vector Routing. Next Topic  Focus  How do we calculate routes for packets?  Routing is a network layer function  Routing Algorithms.
Delivery, Forwarding, and Routing
MULTICASTING Network Security.
ROUTING ON THE INTERNET COSC Aug-15. Routing Protocols  routers receive and forward packets  make decisions based on knowledge of topology.
NETWORK LAYER (2) T.Najah AlSubaie Kingdom of Saudi Arabia Prince Norah bint Abdul Rahman University College of Computer Since and Information System NET331.
TCP/IP Protocol Suite1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Unicast Routing Protocols.
Delivery, Forwarding and
Chapter 22 Network Layer: Delivery, Forwarding, and Routing
22.1 Chapter 22 Network Layer: Delivery, Forwarding, and Routing Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Multicast Routing Protocols NETE0514 Presented by Dr.Apichan Kanjanavapastit.
Routing Information Protocol (RIP). Intra-and Interdomain Routing An internet is divided into autonomous systems. An autonomous system (AS) is a group.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Computer Networks22-1 Chapter 22. Network Layer: Delivery, Forwarding, and Routing 21.1 Delivery 21.2 Forwarding 21.3 Unicast Routing Protocols 21.4 Multicast.
Packet-Switching Networks Routing in Packet Networks.
Unicast Routing Protocols  A routing protocol is a combination of rules and procedures that lets routers in the internet inform each other of changes.
1 Chapter 22 Network layer Delivery, Forwarding and Routing (part2)
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
M.Menelaou CCNA2 ROUTING. M.Menelaou ROUTING Routing is the process that a router uses to forward packets toward the destination network. A router makes.
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
Network Layer4-1 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside a router r 4.4 IP: Internet.
Chapter 22 Network Layer: Delivery, Forwarding, and Routing Part 5 Multicasting protocol.
TCP/IP Protocol Suite 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 11 Unicast Routing Protocols.
Chapter 15 Multicasting and Multicast Routing
Static versus Dynamic Routes Static Route Uses a protocol route that a network administrators enters into the router Static Route Uses a protocol route.
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.
Routing and Routing Protocols
22.1 Chapter 22 Routing Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
1 Computer Communication & Networks Lecture 21 Network Layer: Delivery, Forwarding, Routing Waleed.
Networking and internetworking devices. Repeater.
Routing protocols. 1.Introduction A routing protocol is the communication used between routers. A routing protocol allows routers to share information.
1 Kyung Hee University Chapter 11 Unicast Routing Protocols (RIP, OSPF, and BGP)
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.
Computer Networks22-1 Network Layer Delivery, Forwarding, and Routing.
Ch 22. Routing Direct and Indirect Delivery.
Spring 2000CS 4611 Routing Outline Algorithms Scalability.
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
1. 2  An autonomous system is a region of the Internet that is administered by a single entity.  Examples of autonomous regions are:  UVA’s campus.
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
TCP/IP Protocol Suite 1 Multicasting and Multicast Routing Protocols Differentiate between a unicast and a multicast message Understand multicast link.
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.
22.1 Network Layer Delivery, Forwarding, and Routing.
ROUTING ON THE INTERNET COSC Jun-16. Routing Protocols  routers receive and forward packets  make decisions based on knowledge of topology.
Chapter 14 Routing Protocols (RIP, OSPF, and BGP)
Routing BY, P.B.SHANMATHI.
(How the routers’ tables are filled in)
9 Network Layer Part VI Computer Networks Tutun Juhana
Routing Information Protocol (RIP)
COMP 3270 Computer Networks
Delivery, Forwarding, and Routing
Intra-Domain Routing Jacob Strauss September 14, 2006.
Routing: Distance Vector Algorithm
UNIT III ROUTING.
(How the routers’ tables are filled in)
Delivery, Forwarding, and Routing
UNICAST ROUTING PROTOCOLS
Routing Protocols (RIP, OSPF, BGP).
Chapter 11 Unicast Routing Protocols (RIP, OSPF, and BGP)
Intradomain Routing Outline Introduction to Routing
RFC 1058 & RFC 2453 Routing Information Protocol
Communication Networks
Communication Networks
Presentation transcript:

Routing So how does the network layer do its business?

Forwarding The actual “routing” part of routing is pretty straightforward. A packet arrives. The router gets the destination address of the packet and looks up its entry in the routing table The routing table tells the router what machine to forward the packet to, and on what port.

Routing table The actual guts of routing is the routing table. The routing table is what tells the router where to forward packets it receives, based on the destination address. Static routing tables are ones where all the entries are manually entered by a system administrator. Dynamic routing tables are ones where the router builds the table itself. When we talk about a “routing protocol” we are referring to a system for building dynamic routing tables.

Stages of construction All routing protocols involve three stages: –Initialization: Setting the initial state of the routing table depends on what the later steps of the protocol are. –Sharing: For any dynamic routing to work, routers must share some or part of their routing tables with their neighbors. –Updating: Based on the information a router gets from its neighbors, it needs to update its own routing table.

Unicast routing All routing wants to find the least-cost route between any two nodes of the network. They differ in how they define “least cost.” The majority of communication is from one source to a single destination. This is unicast communication, and requires unicast routing. There are three main systems of unicast routing: –Distance vector –Link State –Path vector

Distance vector routing Distance vector routing defines the least-cost route as the one with the shortest distance. In the initialization phase, routers know the distance to their immediate neighbors, and assume all other nodes are an infinite distance away.

In the sharing phase, each node shares its routing table with all of its neighbors. This generally happens immediately when there is a change. Otherwise, on a periodic basis. Updating is relatively straightforward. Presume node B sends it’s table to node A. A then: 1.Adds the distance from A to B to all of the distances in B’s table. 2.A adds B as the next-hop for every entry in B’s table. 3.A compares each row of its table with the corresponding row of B’s table. a)If the next-hop entry is different, A keeps the row with the lower cost. b)If it is the same, A keeps the new row.

One problem with distance vector routing is the two- node loop instability, which is a form of a race condition. Solutions include: Redefine infinity so eventually the system stops. Split horizon: B does not need bother telling A about routes to X that go through A. Split horizon w/ poison reverse

Routing Information Protocol RIP implements distance vector routing for parts of the internet. Distance is defined as the number of hops. Each hop has a distance of 1. Infinity is defined as 16.

Link State Routing Each node in the network knows the full network topology - nodes, links, costs of links, etc. Each node uses Dijkstra’s algorithm to build its routing table. Initialization involves each node generating a description of its link states. Each node shares its link states with every other node using the Link State Packet (LSP). Each node updates its table using Dijkstra’s algorithm for calculating a shortest path tree.

Dijkstra’s algorithm

Path Vector Routing Distance vector and Link State routing do not scale upwards very well. For large networks (like the internet) we need something else. Path vector routing works like distance vector routing, except that each LAN has one router called a speaker node that advertises its routing table to its neighboring speaker nodes.

Border Gateway Protocol BGP implements path vector routing on the internet. It divides autonomous systems into three types: –Stub AS: The end of the line (Carthage) –Multihomed AS: Connections to multiple other AS’s, but no thru traffic allowed (Google) –Transient AS: Thru traffic permitted (backbones)

Multicast link-state routing Source-based SPTs: Each router has one shortest path tree for each group. A group is a set of destinations for a multicast packet. Essentially, the table maintains a list of next hops for all destinations. Group-shared trees: One central router distributes all multicast packets. MOSPF implements source- based trees using a special packet associating the unicast address of a host with its group address(es).

Multicast Distance Vector DVMRP uses source-based trees, but the routing tables are not kept. They are created whenever a multicast packet arrives using one of four methods: 1.Flooding: The packet is forwarded on every interface except the one it was received from. 2.Reverse Path Forwarding: Only the copy of a packet that has traveled the shortest possible distance when it arrives at the router is forwarded. 3.Reverse Path Broadcasting: Define a parent router for each network. The network will only accept multicast packets from a given source through this designated parent router 4.Reverse Path Multicasting: The designated parent router maintains information about which of its hosts belong to which groups.