Scribd
Upload
76 views

RIPv1 Slides PDF

The document outlines the schedule and content for a computer systems engineering lecture at MUST Mirpur on 19/01/2019. The topics covered include repeating a previous lecture, dynamic routing, dynamic routing protocols, configuring the Routing Information Protocol, a presentation, prayer break, practice, quiz, and attendance. Dynamic routing allows automatic updates of network changes to find optimized routes using metrics and convergence of routes. Types of dynamic routing protocols discussed are distance vector, link state, and hybrid routing.

Uploaded by

ahsan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
76 views

RIPv1 Slides PDF

The document outlines the schedule and content for a computer systems engineering lecture at MUST Mirpur on 19/01/2019. The topics covered include repeating a previous lecture, dynamic routing, dynamic routing protocols, configuring the Routing Information Protocol, a presentation, prayer break, practice, quiz, and attendance. Dynamic routing allows automatic updates of network changes to find optimized routes using metrics and convergence of routes. Types of dynamic routing protocols discussed are distance vector, link state, and hybrid routing.

Uploaded by

ahsan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

Department of Computer Systems Engineering

MUST Mirpur

19/01/2019
19/01/2019
 Repeat From Last Lecture(20 Minutes)
 Dynamic Routing(10 Minutes)
 Dynamic Routing Protocols(5 Minutes)
 Configuration of Routing Information Protocol
(RIP)(25 Minutes)
 Presentation(20 Minutes)
 Prayer Break (15 Minutes)
 Practice(50 Minutes)
 Quiz(20 Minutes)
 Attendance(5 Minutes)

19/01/2019
 Go to previous slides…

19/01/2019
 Automatic Updates of network
 Finding the optimized route
 Metric or cost
 Convergence of a route
 Types of Dynamic Routing
◦ Distance Vector Routing
◦ Link State Routing
◦ Hybrid Routing

19/01/2019
EGP

Hybrid
EIGRP, IS-IS

19/01/2019
 Distance Vector Protocols
◦ Routing Information Protocol (RIPv1)
◦ Routing Information Protocol (RIPv2)
◦ Routing Information Protocol (RIPng)
◦ IGRP
 Link State Protocols
◦ Open Shortest Path First Protocol (OSPF)
◦ Border Gateway Protocol
◦ Exterior Gateway Protocol
 Hybrid Protocols
◦ Is-Is
◦ EIGRP
 Path Vector Protocols
◦ Border Gateway Protocol
◦ Exterior Gateway Protocol

19/01/2019
 A distance vector protocol
 Classful protocol
 Administrative distance 120
 Cost/metric is based on hop count(max 15) -limited by traffic generated
 Broadcasts routing table every 30 seconds
 A change in network is also broadcasted
 Hold down time is 180 seconds
 Problems are lot of traffic, poor convergence, routing loops and no
scalability
 Bellman-Ford algorithm is used to calculate shortest path
◦ Bellman’s algorithm finds the shortest path from one node to another node of a
weighted graph by counting the intermediate nodes
 Load balancing is enable by default
◦ Load balancing is done, when there are two equal cost paths/routes from one
network to another
◦ Load balancing can be done per-packet or per-destination base
◦ Max 6 equal cost paths are entertained-default is 4

19/01/2019
 User mode



 Done

19/01/2019
19/01/2019
 What is Dynamic Routing
 Configuration of Dynamic Routing

19/01/2019

You might also like