Introduction To ROUTING PROTOCOLS

1
Introduction ToROUTING PROTOCOLS

• 
  BY
• ADUAIT POKHRIYAL
• ID. No 34915
• 3rd Year
• COMPUTER ENGINEERING

2

• Routers Routers are used to connect networks
  together and route packets of data from one
  network to another providing best available path
  for transmission.
• Protocols Protocols are set of rules that
  govern data communications. It represents an
  agreement between the communicating devices.
  Without a protocol, two devices may be connected
  but not communicating.

3
Types of Routers

• Core Layer
• Distribution Layer
• Access Layer
• Fixed 2500 Series(2503,2509)
• Modular 2600 Series(2620)

4
Study of Router

• Routing Protocols Protocols that defines
  algorithms to be used for updating routing tables
  between routers.
• Examples IGRP, RIP, OSPF
• Routed Protocols Routed protocols are used to
  transmit user data through an internetwork.
• Examples SPX(Sequecne packet exchange),
  IPX(Internet packet exchange)
• Routed protocols travels with the data.

5
(No Transcript)
6
A routing protocol defines the set of rules used
by a router when it communicates routing
information between neighbour routers.
7
Default Routing

• Use for only stub networks. (i.e., with only one
  exit path.)
• It is easy to impliment.
• Can be implimented on cheap router.
• Not much changes in configuration for small
  change in network.

8
Static Routing

• Manually add routes in router's routing table.
• Secure
• Administrator should have knowledge how router is
  connected in order to configure routes correctly.
• Can be applied to cheap routers.

9
Dynamic Routing

• Find Network and Update.
• Cost CPU processes.
• Types Distance Vector
• Link State
• Hybrid

10
Distance Vector

• Best Path by judging Distance.
• Example RIP,IGRP
• Send entire Routing table to directly connected
  neighbours.

11
Link State

• Shortest Path first
• 3 seperate tables.
• (1) Track of directly attached neighbors
• (2) Topology of entire network
• (3) Routing Table
• Example OSPF

12
Hybrid

• Use aspects of both distance vector and link
  state.
• Example EIGRP

13

• RIP V1(Routing Information Protocol)
• Public Protocol
• Classfull i.e.,No Subnetting/VLSM/IPv6
• Max Hop Count 15
• Update Time 30 sec
• Administrative Distance 120
• RIP V2
• Classless
• public
• IGRP(Interior Gateway Routing Protocol)
• Autonomous Number
• Update Time 90 sec
• Administrative Distance 100
• Max Hop Count 255
• Cisco
• OSPF(Open Shortest path First)
• Hop count limit None
• Public
• EIGRP

14
Simulations