ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine.

Slides:



Advertisements
Similar presentations
Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 22 Omar Meqdadi Department of Computer Science and Software Engineering University.
Advertisements

Routing Protocol.
Courtesy: Nick McKeown, Stanford
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts – Chapter.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.1 Routing Working at a Small-to-Medium Business or ISP – Chapter 6.
Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What’s inside a router 4.4 IP: Internet Protocol –Datagram format.
4a-1 CSE401: Computer Networks Hierarchical Routing & Routing in Internet S. M. Hasibul Haque Lecturer Dept. of CSE, BUET.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization –All routers are identical –Network is flat. Not true in Practice Hierarchical.
CCNA 2 v3.1 Module 6.
Routing and Routing Protocols
Routing.
14 – Inter/Intra-AS Routing
Lecture Week 3 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)
1 Semester 2 Module 6 Routing and Routing Protocols YuDa college of business James Chen
1 Relates to Lab 4. This module covers link state routing and the Open Shortest Path First (OSPF) routing protocol. Dynamic Routing Protocols II OSPF.
Fundamentals of Networking Discovery 2, Chapter 6 Routing.
Each computer and router interface maintains an ARP table for Layer 2 communication The ARP table is only effective for the broadcast domain (or LAN)
ROUTING BASICS. Why are Routers Necessary? One of the key components of the technical infrastructure of the network One of the key components of the technical.
Interior Gateway Protocols: RIP & OSPF
Introduction to Routing and Routing Protocols By Ashar Anwar.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Routing and Routing Protocols Routing Protocols Overview.
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.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 2 Module 6 Routing and Routing Protocols.
Introduction to Dynamic Routing Protocol
1 Routing. 2 Routing is the act of deciding how each individual datagram finds its way through the multiple different paths to its destination. Routing.
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
Objectives: Chapter 5: Network/Internet Layer  How Networks are connected Network/Internet Layer Routed Protocols Routing Protocols Autonomous Systems.
1. 2 Anatomy of an IP Packet IP packets consist of the data from upper layers plus an IP header. The IP header consists of the following:
CCNA 1 Module 10 Routing Fundamentals and Subnets.
10/8/2015CST Computer Networks1 IP Routing CST 415.
Routing in the Internet The Global Internet consists of Autonomous Systems (AS) interconnected with eachother: Stub AS: small corporation Multihomed AS:
1 Routing Table  The seven fields Mask: for finding (sub)network address of the destination l Host-specific routing: (/32) l Default routing:
1 Network Layer Lecture 13 Imran Ahmed University of Management & Technology.
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.
CCNA 2 Week 6 Routing Protocols. Copyright © 2005 University of Bolton Topics Static Routing Dynamic Routing Routing Protocols Overview.
6: Routing Working at a Small to Medium Business.
Routing and Routing Protocols
Routing protocols. Static Routing Routes to destinations are set up manually Route may be up or down but static routes will remain in the routing tables.
Internet Protocols. ICMP ICMP – Internet Control Message Protocol Each ICMP message is encapsulated in an IP packet – Treated like any other datagram,
1 Version 3.1 Module 6 Routed & Routing Protocols.
4: Network Layer4b-1 OSPF (Open Shortest Path First) r “open”: publicly available r Uses Link State algorithm m LS packet dissemination m Topology map.
Routing protocols. 1.Introduction A routing protocol is the communication used between routers. A routing protocol allows routers to share information.
Transport Layer3-1 Network Layer Every man dies. Not every man really lives.
Routing Algorithms and IP Addressing Routing Algorithms must be ▪ Correctness ▪ Simplicity ▪ Robustness ▪ Stability ▪ Fairness ▪ Optimality.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 1 Module 10 Routing Fundamentals and Subnets.
1 Chapter 4: Internetworking (IP Routing) Dr. Rocky K. C. Chang 16 March 2004.
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 25 Internet Routing. Static Routing manually configured routes that do not change Used by hosts whose routing table contains one static route.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.1 Routing Working at a Small-to-Medium Business or ISP – Chapter 6.
Routing and Routing Protocols CCNA 2 v3 – Module 6.
+ Dynamic Routing Protocols 2 nd semester
1 Computer Networks Chapter 5. Network layer The network layer is concerned with getting packets from the source all the way to the destination. Getting.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Chapter 4: Network Layer
Working at a Small-to-Medium Business or ISP – Chapter 6
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 6 Delivery & Forwarding of IP Packets
CCNA 2 v3.1 Module 6 Routing and Routing Protocols
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Introduction to Dynamic Routing Protocol
Routing.
Delivery and Routing of IP Packets
Chapter 4: Network Layer
Working at a Small-to-Medium Business or ISP – Chapter 6
Routing.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Presentation transcript:

ICS 156: Networking Lab Magda El Zarki Professor, ICS UC, Irvine

Course Outline n Ch 1: Introduction n Ch 2:Bridges n Ch 3:Routers n Ch 4: Transport Protocols

Ch. 3 Routers n The role of Routers n Routing n The Role of ICMP in Routing n RIP n OSPF

3.1 What are Routers n Routers are network devices that operate at layer 3. n They route (“forward”) IP datagrams hop- by-hop through a network from source to destination over different subnets and autonomous systems.

Router in Operation

3.2 Routers and Routing

3.2.1 Functions of Routers n Routers have an IP address per network connection n Routers are used to create subnets or interconnect two or more different networks n Subnet masks are used for routing purposes. A mask will indicate whether the host is on the same subnet or needs to be forwarded to another subnet.

3.2.2 Operation of Routers (1/2) n Each network connection has associated with it an ARP module if it is connected to a broadcast network such as Ethernet n ARP: Address Resolution Protocol. Used to find the physical address. Creates a cache in which it stores all its IP to physical address mappings. n IP routing tables identify what to do with each packet (i.e., what interface to use for transmitting the datagram).

3.2.2 Operation of Routers (2/2) n Routing mechanism: the action of looking an address up in a table and deciding what to do with the IP datagram -> Performed by IP n Routing policy: the actual algorithms that are use to make routing calculations and fill the routing table with forwarding entries -> Performed by a routing daemon

Ch 3. Routers n The role of Routers n Routing n The Role of ICMP in Routing n RIP n OSPF

3.3 IP Routing Mechanism n Search for a matching host address n Search for a matching network address n Search for a default entry (default is specified by a net_address of “0”)

3.4 A Routing Table For Host : DestinationMaskGatewayFlagsUseInterf ace UGH171eth UG113eth UG544eth *U913eth *UH95lo default UG786eth0

3.4.1 Flags n U: The route is up n G: The router is to a gateway (router). If this flag is not set the destination is directly connected n H: The route is to a host, that is the destination is a complete host address. If this flag is not set, the route is to a network, and the destination is a network address (net ID or net ID and subnet ID)

3.4.1 Flags contd. n D: The route was created by a redirect n M: The route was modified by a redirect.

Routers n The role of Routers n Routing n The Role of ICMP in Routing n RIP n OSPF

3.5 ICMP and Routing n ICMP is used to indicate an error condition related to routing. n If a solution is feasible, i.e., a route is available, then ICMP is used to indicate the new route to the source, redirect message. n If a solution is not feasible, i.e., a route is not available, then it is used to indicate that the destination host is unreachable.

3.5.1 ICMP Redirects n When a source sends a packet to a gateway for forwarding, and that gateway is not the default next hop, then the gateway will forward the packet to the appropriate gateway. It then uses ICMP to send a message to the source giving it the gateway IP address that should be used next time in conjunction with that destination. n If one examines the routing table after an ICMP redirect, we see that a new entry has been added and the flag “D” inserted to indicate its source.

3.5.2 ICMP Discovery Messages n To initialize a routing table, one can use manually entered routes or the host can use what is called a router solicitation message. n The locally connected routers will respond with a router advertisement message. n Usually routers periodically broadcast their router advertisements so that hosts can update their tables. n Each advertisement can carry several addresses and a lifetime that indicates how long an address will be valid for.

3. Routers n The role of routers n Routing n ICMP and Routing n Types of routers n RIP n OSPF

3.6 Types of Routers (1/5)

3.6 Types of Routers (2/5) n Customer, regional and backbone networks are all called autonomous systems (AS). n An AS consists of a collection of interconnected networks run by a single organization. n ASs are interconnected via gateways. n Several regional networks can exist in an area. n Several backbone networks make up the core backbone.

3.6 Types of Routers (3/5) n Gateways (routers) interconnect the different parts of the internet n Border gateways (BG) are used to connect to the backbone. n Interior gateways (IG) are used within a single AS.

3.6 Types of Routers (4/5) n Note that they are all routers, but, because they have different responsibilities, they are given different names. n BGs use the BG protocol (BGP) for routing. n IGs use IG protocol (IGP) for routing.

3.6 Types of Routers (5/5) n If two routers are attached over a point to point link, this is still considered as a network to the routers, it just does not have any other network devices on it except for the router at the other end. n Because of the way the internet has grown, most ASs don’t have a single network ID. They generally have several. This means that the gateways have to have many subnet masks, each one associated with every net ID in its AS. E.g., & are 2 class B addresses that maybe used by an AS.

3.7 RIP Protocol Stack

3.8 IGP n There are two routing protocols associated with IGP: –Routing information protocol (RIP): vector distance –Open shortest path first (OSPF): link state n RIP is the oldest and is still being used. OSPF was introduced later because it was felt that RIP would not able to handle the needs of the growing internet (not scalable).

3. Routers n The role of routers n Routing n ICMP and Routing n Types of routers n RIP n OSPF

3.9 RIP (1/4) n It uses distance vectors. The distance is measured in terms of hops, independent of link speed, or physical distance. Max. is 15 hops. n Each gateway sends its routing table to its neighbors every 30 secs. n Based on this local information it calculates routes. (Bellman-Ford Algorithm)

3.9 RIP (2/4) n Upon receipt of a neighbor’s routing table, the gateway checks to see if distances are shorter than what it has in its table. If a shorter distance is found, the entry is updated to reflect the new distance and corresponding gateway address. n Only one route to each destination. No alternate routes.

3.9 RIP (3/4) n The RIP protocol (routed daemon) is used to create/maintain the RIP routing table. n Then the IP routing table is constructed based upon the shortest hop path to each destination, i.e., the RIP routing tables. n The IP table entries consist of: Dest. IP address with appropriate mask (i.e net ID), Gateway IP address and interface identifier (i.e. which NIC).

3.9 RIP (4/4) n The IP routing table is used by the router when forwarding a packet. This constitutes the actual routing function within a router. n The IP address is then looked up in the NIC ARP table for the physical address.

3.9.1 Disadvantages of RIP (1/2) n Only one route - no load balancing n Only one measure for distance - hop count n Table changes only occur for major failures not net status n Formation of loops - slow convergence

3.9.1 Disadvantages of RIP (2/2) n Limited in its scope, cannot handle large internets (cannot take advantage of hierarchies) n No routing based on service type

3. Routers n The role of routers n Routing n ICMP and Routing n Types of routers n RIP n OSPF

3.10 OSPF (1/2) n This protocol solves many of the problems facing RIP, particularly scalability. It detects changes quicker and converges faster. n It is able to handle QoS: –Uses the service type field in IP packet to route different classes of traffic over different paths. n It was designed to allow for dynamic routing: –different types of metrics can be used to define the “shortest” path, e.g., delay, link utilization, physical distance, link bit rate, etc.

3.10 OSPF (2/2) n It allows for multiple routes per destination -> load balancing n Supports hierarchical structures n It was adopted as the IGP default routing protocol in 1990 and most routers now implement it. (RFC 1247)

3.10 Operation of OSPF (1/4) n Runs directly on top of IP. n Every AS has a backbone area “ ” and is organized in a star fashion. n Any router connecting to two or more areas is called an area border router (ABR). n Routers that have an interface to the backbone are called backbone routers.

3.10 Operation of OSPF (2/4) n Routers within an area are called internal routers. n A router connected to the outside world, i.e., other AS, is called a boundary router. n Within an area, each router knows its route to every other router in the area including the backbone router(s) connecting the area to the backbone. All routers in an area have identical linkstate databases. n Routers connecting several areas must have the link status database of each area it is connected too.

3.10 Operation of OSPF (3/4) n As OSPF allows for type of service routing, each router maintains 3 link status databases: one for delay, one for throughput and one for reliability. n A packet may require an intraarea path, or an intraarea-interarea path or an intraarea-interarea- interAS path dpending on where the host is. n Routers in areas exchange link status packets (LSP) periodically. Each packet contains the following information: ID of node that created LSP, list of directly connected routers with the link cost, a sequence number and a time to live.

3.10 Operation of OSPF (4/4 n The routers use controlled flooding to reach every other router in the area. Note that only newer (higher sequence number) LSP are sent and they are not sent over the link that they were received from. n Given that each router has the LSP of all the other routers in the area, it can calculate independently what the shortest path to each router is. The LSP describe the network topology. (Dijkstra’s algorithm)