Scribd
Upload
11 views13 pages

Basic Routing For IPv4

The document provides an overview of routing protocols, classifying them into static and dynamic types, and detailing various protocols such as RIP, EIGRP, OSPF, IS-IS, and BGP. It explains the characteristics and functionalities of each protocol, including metrics used for routing decisions and their operational mechanisms. Additionally, it introduces MPLS as a technique for efficient data forwarding, highlighting its key features and common uses.

Uploaded by

Sadik Chowdhury
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
11 views13 pages

Basic Routing For IPv4

The document provides an overview of routing protocols, classifying them into static and dynamic types, and detailing various protocols such as RIP, EIGRP, OSPF, IS-IS, and BGP. It explains the characteristics and functionalities of each protocol, including metrics used for routing decisions and their operational mechanisms. Additionally, it introduces MPLS as a technique for efficient data forwarding, highlighting its key features and common uses.

Uploaded by

Sadik Chowdhury
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/ 13

1

CONTENTS
1 Routing Classification(3)

2 Types of routing protocol(5-6)

3 RIP(7)

4 EIGRP(8)

5 OSPF(9)

6 IS-IS(10)

7 BGP(11) 2
 Routing can be classified into two main types
 Static
 Dynamic

 Static Routing
 Manually configures routes instead of dynamic
route.
 Dynamic Routing
 A process that uses routing protocols to
automatically determine the best path.
3
• Automatically update routes based on
the network condition
• Dynamic routing can adjust to changes
in network topology
• Dynamic routing networks can grow
larger more quickly than static routing
networks.

4
Distance
Interior or Exterior Vector or Link-
Protocol Name Gateway Protocol State Protocol
Routing Information Interior
Protocol (RIPv2) Distance Vector
Enhanced Interior Interior Distance Vector
Gateway Routing
Protocol (EIGRP)

Open Shortest Path First Interior Link-State


(OSPF)

Intermediate System to Interior Link-State


Intermediate System (IS-
IS)

Border Gateway Exterior Path-Vector


Protocol (BGP)

5
 Distance vector routing– A network
protocol that determines the best path for
data to travel by using the shortest distance
to a destination. Example- RIP
Link state routing – A dynamic routing
algorithm that builds a complete network
map by exchanging link-state information
between router. Example- OSPF
 Path vector routing– a routing protocol that
allows nodes to exchange information about
the distance and path to a destination.

6
 one of the oldest distance-vector routing
protocols
 employs the hop count as a routing metric
 maximum hop count allowed in the RIP is 15.
 mostly used in small to medium-sized networks.
 Updates (routing information) are always
broadcast
 Full routing tables are sent in updates.
 AD value 120
 Default interval 30 seconds
7
• It was developed by Cisco Systems
• The maximum hop count is 224 (default maximum of 100)
• Uses five packet types to pass messages (HELLO packets,
QUERY packets, REPLY packets, REQUEST packets and
UPDATE packets)
• EIGRP uses metrics like bandwidth, delay, load, reliability and
MTU to select routes.
• AD value 90( Internal)
• Neighbor table shows which interface to use to reach
neighboring routers.
• Hello interval 5 seconds for all networks except low-speed,
non-broadcast multiaccess
• Hello interval 60 seconds for all networks except low-speed,
non-broadcast multiaccess

8
• Link state routing protocol
• Sends hello packets every 10 seconds
• Dead timer is 40 seconds
• Work as a hierarchical network design
using areas
• Uses the Dijkstra Shortest Path First
algorithm to determine the shortest path.
• AD value 110
• OSPF has no hop-count limit.

9
• Uses link-state information to determine
routing decisions
• Builds a link-state database
• Flood link state information throughout the
network
• Runs the Dijkstra SPF algorithm to find the
best path like OSPF
• AD value is 115
• Default hello interval is 10 seconds. But we
change it by command
• It has strong technical safety features to
prevent black-holing

10
• Path vector routing protocol that use multiple
paths to send packets
• It chooses the best path based on attributes
like hop counts
• BGP has two flavors- EBGP & IBGP
• Different AS & AD value is 20(EBGP)
• Same AS & Ad value is 200(IBGP)
• BGP Messages are transmitted based on TCP
(Port 179)
• BGP peer established through five message
• Connect, Active, Open Sent, Open Confirm &
Established

11
 MPLS is a technique for efficient data forwarding using labels instead of IP addresses.
 How it Works:
 --Label Assignment: Data packets are tagged with labels when entering the MPLS network.
 --Label Forwarding: Routers use these labels to forward packets through the network.
 --Label Swapping: Labels are changed at each hop to route packets efficiently.
 Key Features:
 --Faster Routing: Labels speed up forwarding decisions.
 --Traffic Engineering: Control data flow and optimize bandwidth.
 --Supports Multiple Protocols: Works with IPv4, IPv6, and more.
 --Quality of Service (QoS): Prioritizes critical traffic.
 --Reliability: Fast rerouting in case of network failure.
 Common Uses:
 --VPNs: Secure private networks over the internet.
 --Traffic Management: Optimize bandwidth and network efficiency.

12
13

You might also like