Scribd
Upload
20 views

Dynamic Routing

Computer network

Uploaded by

cropx330
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
20 views

Dynamic Routing

Computer network

Uploaded by

cropx330
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Computer Engineering (3150710) 220760107139

Practical 7
RIP Dynamic routing :
• RIP (Routing Information Protocol) is a distance-vector dynamic
routing protocol that uses hop count as its metric, with a
maximum hop limit of 15. Routers using RIP exchange routing
information every 30 seconds, allowing them to dynamically
update their routing tables based on network changes. It's simple
to implement but has limitations, including slow convergence and
scalability issues, making it less suitable for larger networks. There
are two versions: RIP v1 (Classful) and RIP v2 (Classless), with the
latter supporting subnetting.

Page | 1
Computer Engineering (3150710) 220760107139

OSPF:
• OSPF (Open Shortest Path First) is a link-state dynamic routing
protocol that uses the Dijkstra algorithm to find the shortest path
between routers. Unlike RIP, OSPF considers various factors such
as bandwidth and link cost to determine the best route, not just
hop count. It divides networks into areas to optimize efficiency
and reduces routing overhead. OSPF exchanges information only
when there are changes in the network, making it faster and more
scalable for large, complex networks. It's classless, supports VLSM
(Variable Length Subnet Masking), and ensures faster convergence.

Page | 2
Computer Engineering (3150710) 220760107139

BGP:
• BGP (Border Gateway Protocol) is a path-vector dynamic routing
protocol primarily used for exchanging routing information
between different autonomous systems (AS) on the Internet.
Unlike interior gateway protocols, BGP uses policies and path
attributes to determine the best route for data transmission,
making it highly scalable and flexible. It maintains a table of
network paths and employs a process called route advertisement,
where routers exchange information about reachable networks.
BGP supports various features, including loop prevention, route
aggregation, and policy-based routing, allowing for fine-grained
control over routing decisions. Its complexity and configuration
requirements make it suitable for large-scale networks, such as
those operated by ISPs and large enterprises.

Page | 3

You might also like