RD-CSY3021 Comparing Routing Protocols. RD-CSY3021 Criteria used to compare routing protocols includes  Time to convergence  Proprietary/open standards.

Slides:



Advertisements
Similar presentations
 Two types  Distance Vector ◦ Examples:  RIP v1 and RIPv2 (Routing Information Protocol)  IGRP (Interior Gateway Routing Protocol)  Link State ◦
Advertisements

Lecture 9 Overview. Hierarchical Routing scale – with 200 million destinations – can’t store all dests in routing tables! – routing table exchange would.
Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 22 Omar Meqdadi Department of Computer Science and Software Engineering University.
Routing Protocol.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 RIPv2 Routing Protocols and Concepts – Chapter 7.
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.
TDC365 Spring 2001John Kristoff - DePaul University1 Interconnection Technologies Routing I.
Network Layer4-1 Chapter 4 roadmap 4.1 Introduction and Network Service Models 4.2 Routing Principles 4.3 Hierarchical Routing 4.4 The Internet (IP) Protocol.
RD-CSY /09 Distance Vector Routing Protocols.
14 – Inter/Intra-AS Routing
1 CCNA 3 v3.1 Module 2. 2 CCNA 3 Module 2 Single Area OSPF.
Routing Algorithms & Routing Protocols  Shortest Path Routing  Flooding  Distance Vector Routing  Link State Routing  Hierarchical Routing  Broadcast.
1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)
Objectives After completing this chapter you will be able to: Describe hierarchical routing in OSPF Describe the 3 protocols in OSPF, the Hello, Exchange.
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.
Switching and Routing Technique
14 – Inter/Intra-AS Routing Network Layer Hierarchical Routing scale: with > 200 million destinations: can’t store all dest’s in routing tables!
Interior Gateway Protocols: RIP & OSPF
Chapter 7: Routing Dynamically
Distance Vector Routing Protocols W.lilakiatsakun.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Dynamic Routing Protocols  Function(s) of Dynamic Routing Protocols: – Dynamically share information between routers (Discover remote networks). – Automatically.
1 Routing Protocols. 2 Distributed Routing Protocols Rtrs exchange control info Use it to calculate forwarding table Two basic types –distance vector.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Distance Vector Routing Protocols Routing Protocols and Concepts –
Routing/Routed Protocols. Remember: A Routed Protocol – defines logical addressing. Most notable example on the test – IP A Routing Protocol – fills the.
Review Routing fundamental W.lilakiatsakun. Review Routing Fundamental VLSM VLSM Route Summarization Route Summarization Static & Dynamic Routing Static.
Routing protocols Basic Routing Routing Information Protocol (RIP) Open Shortest Path First (OSPF)
1 3-Oct-15 Distance Vector Routing CCNA Exploration Semester 2 Chapter 4.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 RIPv2 Routing Protocols and Concepts – Chapter 7.
1 Network Layer Lecture 13 Imran Ahmed University of Management & Technology.
RIP2 (Routing Information Protocol) Team Agile. Routing Protocols Link State – OSPF – ISIS Distance vector – RIP (version 1 and 2) – IGRP (Cisco Proprietary)
Routing in the Internet The Global Internet consists of Autonomous Systems (AS) interconnected with eachother: Stub AS: small corporation Multihomed AS:
Distance Vector Routing Protocols Routing Protocols and Concepts Lecture Week 4.
CCNA 3 Week 2 Link State Protocols OSPF. Copyright © 2005 University of Bolton Distance Vector vs Link State Distance Vector –Copies Routing Table to.
1 Module 4: Implementing OSPF. 2 Lessons OSPF OSPF Areas and Hierarchical Routing OSPF Operation OSPF Routing Tables Designing an OSPF Network.
Network Layer4-1 Intra-AS Routing r Also known as Interior Gateway Protocols (IGP) r Most common Intra-AS routing protocols: m RIP: Routing Information.
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.
7400 Samsung Confidential & Proprietary Information Copyright 2006, All Rights Reserved. -0/35- OfficeServ 7x00 Enterprise IP Solutions Quick Install Guide.
Distance Vector Routing Protocols Dynamic Routing.
Cisco Systems Networking Academy S2 C 11 Routing Basics.
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 Algorithms and IP Addressing Routing Algorithms must be ▪ Correctness ▪ Simplicity ▪ Robustness ▪ Stability ▪ Fairness ▪ Optimality.
Routing Protocols and Concepts – Chapter 7
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.
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.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Routing Protocols and Concepts Dr. Muazzam A. Khan.
Chapter 4: Network Layer
Routing Protocols and Concepts
Distance Vector Routing Protocols
Link State Routing protocol
Routing Protocols and Concepts
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Dynamic Routing Protocols part2
Chapter 5: Dynamic Routing
Chapter 5: Dynamic Routing
Dynamic Routing Protocols part2
Distance Vector Routing Protocols
Chapter 4: Network Layer
Chapter 4: Network Layer
Chapter 4: Network Layer
Routing Protocols and Concepts – Chapter 7
Communication Networks
Distance Vector Routing Protocols
Routing Protocols and Concepts – Chapter 7
Chapter 4: Network Layer
Computer Networks Protocols
Presentation transcript:

RD-CSY3021 Comparing Routing Protocols

RD-CSY3021 Criteria used to compare routing protocols includes  Time to convergence  Proprietary/open standards  Scalability  Classful/Classless  Metric used  Resource usage  Implementation & maintenance

RD-CSY3021 Two Main Approaches  Distance Vector Protocols ◦ E.g., RIP V1 and v2 (Routing Information Protocol) ◦ EIGRP  Link State Protocols ◦ E.g., OSPF (Open Shortest Path First)  Our Focus ◦ Comparing them

 Classful vs. Classless Routing Behavior -It is recommended to use classless routing behavior  Reason: so supernet and default routes can be used whenever needed

 Classless Routing Protocol Routing updates include the subnet mask  Supports VLSM  Supports Route Summarization

RD-CSY3021 Algorithm - procedure for accomplishing a certain task

 Link State (LS) advantages:  More stable (aka fewer routing loops)  Faster convergence than distance vector  Easier to discover network topology, troubleshoot network.

 Uses hop count as metric (max: 16 is infinity)  Tables (vectors) “advertised” to neighbors every 30 s.  Each advertisement: upto 25 entries  No advertisement for 180 sec: neighbor/link declared dead  routes via neighbor invalidated  new advertisements sent to neighbors (Triggered updates)  neighbors in turn send out new advertisements (if tables changed)  link failure info quickly propagates to entire net  poison reverse used to prevent ping- pong loops (infinite distance = 16 hops)

 Split horizon/poison reverse does not guarantee to solve count-to-infinity problem ◦ 16 = infinity => RIP for small networks only! ◦ Slow convergence  Broadcasts consume non-router resources  RIPv1 does not support subnet masks (VLSMs) ◦ No authentication

RD-CSY3021

 Why ? Installed base of RIP routers  Provides: ◦ VLSM support ◦ Authentication ◦ Multicasting  Uses reserved fields in RIPv1 header.  Supports authentication.

 Key: Create a network “map” at each node.  1. Node collects the state of its connected links and forms a “Link State Packet” (LSP)  2. Flood LSP => reaches every other node in the network and everyone now has a network map.  3. Given map, run Dijkstra’s shortest path algorithm (SPF) => get paths to all destinations  4. Routing table = next-hops of these paths.  5. Hierarchical routing: organization of areas, and filtered control plane information flooded.

 Reliable Flooding: sequence #s, age  Neighbor discovery and maintenance (hello)  Efficiency in Broadcast LANs ◦ designated router (DR) concept  Areas and Hierarchy ◦ Area types: Normal, Stub, NSSA: filtering ◦ External Routes (from other ASs), interaction with inter-domain routing.

 Information hiding (filtered) => ◦ less computation, =>  less bandwidth requirement =>  Less storage =>  Improved efficiency => leads to scalable networks

 Two-level hierarchy: local area, backbone.  Link-state advertisements only in area  each nodes has detailed area topology; only know direction (shortest path) to nets in other areas.  Two-level restriction avoids count-to-infinity issues in backbone routing.  Area border routers (ABR): “summarize” distances to networks in own area, advertise to other Area Border routers.  Backbone routers: uses a DV-style routing between backbone routers  Boundary routers connect to other ASs (generate “external” records)

/24