1.

RIP (Routing Information Protocol)

Overview: RIP is one of the oldest distance-vector routing protocols, designed for small and simple
networks. It uses a hop count as its routing metric, with a maximum of 15 hops. If a packet reaches 16
hops, it is considered unreachable. RIP relies on routing updates, sent every 30 seconds, which can
cause slower convergence and the potential for routing loops.

How It Works:

 Metric (Hop Count): RIP chooses the best path based on the number of routers (hops) a packet
has to pass through. The route with the fewest hops is preferred.
 Routing Table: Each router maintains a routing table that lists all known destinations and the
next hop.
 Periodic Updates: RIP routers broadcast their routing table to all neighbors every 30 seconds.
This can cause issues like bandwidth waste and slow convergence.
 Routing Loops Prevention: Techniques like split horizon, route poisoning, and hold-down
timers help prevent routing loops.

Versions:

 RIP v1: Classful protocol, doesn’t support Variable Length Subnet Masking (VLSM) or
CIDR.
 RIP v2: Classless, supports VLSM and multicast updates.

Advantages:

 Easy to configure and simple to understand.

 Works well in small networks with limited routing demands.

Disadvantages:

 Limited scalability: With a 15-hop limit, it’s not suitable for large networks.
 Slow convergence: Because updates happen every 30 seconds, RIP is slow to adapt to
network changes.
 Inefficient use of bandwidth: Sending the full routing table regularly can consume
unnecessary bandwidth.
Usage:

 Best suited for small networks where simplicity is more important than performance.

2. EIGRP (Enhanced Interior Gateway Routing Protocol)

Overview: EIGRP is a Cisco-proprietary protocol that combines the best features of both distance-
vector and link-state protocols, hence being termed a “hybrid.” It offers faster convergence,
scalability, and improved bandwidth utilization compared to RIP.

How It Works:

 Metric Calculation: EIGRP uses a composite metric considering bandwidth, delay, reliability,
and load. By default, only bandwidth and delay are used.
 DUAL (Diffusing Update Algorithm): EIGRP uses DUAL to ensure loop-free, fast
convergence and to calculate the best path and feasible successor (backup paths).
 Hello Packets: EIGRP routers maintain neighbor relationships by sending hello packets every
few seconds. Neighbor relationships allow routers to exchange updates only when a change
occurs.
 Partial Updates: Unlike RIP, EIGRP doesn’t send full routing table updates. It only sends
updates when there are changes in the network, making it more efficient.

Advantages:

 Fast convergence: DUAL ensures that EIGRP converges quickly after network changes.
 Efficient use of resources: EIGRP only sends partial updates, minimizing bandwidth usage.
 Scalable: Suitable for large networks, it supports VLSM and CIDR.
 Multiple network layer support: EIGRP works for both IPv4 and IPv6.

Disadvantages:

 Proprietary (originally): EIGRP was Cisco-proprietary, limiting its use in non-Cisco

environments. It became an open standard in 2013 but is still most commonly used in Cisco
environments.
 More complex configuration: Compared to RIP, configuring EIGRP requires more planning.
Usage:

 Typically used in medium to large enterprise networks, especially in Cisco environments.

3. OSPF (Open Shortest Path First)

Overview: OSPF is a widely-used link-state protocol designed for large and complex networks. It
operates within an Autonomous System (AS) and supports a hierarchical design using areas to
optimize routing.

How It Works:

 Link-State Advertisements (LSAs): OSPF routers exchange LSAs, which contain information
about directly connected networks. These LSAs are used to build a complete map of the
network.
 Areas: OSPF networks are divided into areas to reduce routing table size and minimize the
scope of routing updates. Area 0 (backbone area) connects all other areas.
 Shortest Path First (SPF) Algorithm: OSPF uses the Dijkstra algorithm to calculate the
shortest path to each network based on link cost. The cost is typically calculated based on
bandwidth, with lower costs representing better paths.
 Convergence: OSPF converges quickly due to its use of triggered updates, which only occur
when there are topology changes.

Advantages:

 Scalability: OSPF is highly scalable, suitable for large networks with many routers.
 Fast convergence: OSPF updates are event-driven, allowing for quick adjustments to changes.
 Open standard: OSPF is vendor-neutral, meaning it can be implemented across a variety of
devices.

Disadvantages:

 Complex configuration: OSPF requires careful planning and configuration, particularly when
implementing multiple areas.
  Resource-intensive: OSPF consumes more memory and CPU compared to RIP and EIGRP.

Usage:

 Ideal for large, complex enterprise networks with multiple subnets and areas.

4. BGP (Border Gateway Protocol)

Overview: BGP is the protocol that powers the internet. It is a path-vector protocol, primarily used
between Autonomous Systems (ASes). Unlike RIP, EIGRP, or OSPF, which are Interior Gateway
Protocols (IGPs), BGP is an Exterior Gateway Protocol (EGP), designed to handle large-scale routing
between ISPs and large organizations.

How It Works:

 Path Vector: BGP uses the AS-path as the primary metric. When a route passes through
different ASes, each AS is added to the AS-path. This allows routers to make routing
decisions based on the number of AS hops and policies.
 Policy-based Routing: BGP doesn’t always choose the shortest path. Instead, it can use
policies set by the network administrator to control routing decisions based on factors like
AS-path, local preference, or weights.
 eBGP vs. iBGP:
o eBGP (External BGP): Used between different ASes, such as ISPs.
o iBGP (Internal BGP): Used within a single AS to ensure that all routers in the AS
know about the external routes.
 Route Aggregation: BGP supports route aggregation to minimize the size of routing tables,
which is critical for scalability.
 Convergence: BGP is slower to converge compared to IGPs. This is by design to prevent
instability and route flapping.

Advantages:
  Highly scalable: BGP is the only protocol that can manage the vast routing information of the
global internet.
 Policy-driven routing: BGP allows fine-grained control over routing decisions based on
policies.
 Supports CIDR: BGP handles large-scale IP networks efficiently with route summarization.

Disadvantages:

 Complex configuration: BGP is difficult to configure and manage, especially for large-scale
networks.
 Slow convergence: BGP prioritizes stability over fast convergence, which can lead to delays
in routing updates.

Usage:

 Essential for ISPs and organizations that manage multiple internet connections or engage in
multi-homing.
 Used for routing between large networks, such as between different ISPs.

Sample Questions

RIP (Routing Information Protocol)

1. What is the main metric used by RIP to select the best path in a network?
2. How does RIP define the term “hop count,” and what is its maximum limit?
3. Explain why a hop count of 16 is considered unreachable in RIP.
4. How often do RIP routers broadcast their routing table updates?
5. What are the main disadvantages of RIP’s periodic updates?
6. How does RIP handle routing loops? Mention three techniques used.
7. Compare RIP v1 and RIP v2 in terms of classful and classless routing.
8. Why is RIP v1 not suitable for networks using Variable Length Subnet Masking (VLSM)?
9. What are the advantages of using RIP in small networks?
10. Why is RIP considered inefficient in terms of bandwidth usage?
 11. Explain the concept of “split horizon” in RIP.
12. What is route poisoning, and how does it prevent routing loops in RIP?
13. Describe the purpose of a hold-down timer in RIP.
14. In which type of networks would RIP be most effective, and why?
15. Why is RIP not considered scalable for large networks?

EIGRP (Enhanced Interior Gateway Routing Protocol)

16. What makes EIGRP a hybrid routing protocol?

17. List the metrics EIGRP considers when selecting the best path.
18. How does EIGRP's Diffusing Update Algorithm (DUAL) contribute to fast convergence?
19. What is a “feasible successor” in EIGRP, and how does it aid in network recovery?
20. Explain how EIGRP uses hello packets to maintain neighbor relationships.
21. How does EIGRP improve bandwidth utilization compared to RIP?
22. What is the significance of partial updates in EIGRP?
23. Describe the difference between EIGRP’s treatment of IPv4 and IPv6.
24. How does EIGRP support large-scale networks?
25. What were the limitations of EIGRP when it was Cisco-proprietary?
26. Why is EIGRP more complex to configure compared to RIP?
27. How does EIGRP handle network layer protocols (e.g., IPv4 and IPv6)?
28. How does EIGRP prevent routing loops in comparison to RIP?
29. What is the default value for the EIGRP hello timer on a LAN?
30. What impact did EIGRP’s transition to an open standard in 2013 have on its use?

OSPF (Open Shortest Path First)

31. What is the primary algorithm used by OSPF to calculate the shortest path?
32. Explain the purpose of Link-State Advertisements (LSAs) in OSPF.
33. What is the significance of Area 0 in an OSPF network design?
34. How does OSPF’s area structure contribute to scalability?
35. What type of networks benefit most from using OSPF?
36. Why is OSPF considered resource-intensive compared to RIP and EIGRP?
37. How does OSPF ensure fast convergence after a topology change?
38. Explain how OSPF determines the cost of a link.
 39. What are the advantages of OSPF being an open standard?
40. Why does OSPF require more planning and configuration than RIP and EIGRP?

Multiple choice Questions

1. What is the maximum hop count in RIP?

a) 10
b) 15
c) 16
d) 20

2. What metric does RIP use to determine the best path?

a) Bandwidth
b) Latency
c) Hop count
d) Delay

3. How often do RIP routers broadcast their routing tables?

a) Every 15 seconds
b) Every 30 seconds
c) Every 60 seconds
d) Every 120 seconds

4. Which version of RIP supports VLSM and multicast updates?

a) RIP v1
b) RIP v2
c) RIP v3
d) None

5. What technique in RIP is used to prevent routing loops by prohibiting routes learned from an
interface from being advertised back out of that same interface?
a) Route poisoning
b) Split horizon
 c) Hold-down timer
d) Poison reverse
6. Which of the following is a disadvantage of RIP?
a) Fast convergence
b) Supports large networks
c) Slow convergence
d) Supports CIDR
7. What is "route poisoning" in RIP?
a) Sending a route with an infinite metric to indicate it is unreachable
b) Advertising false routes to confuse neighbors
c) Sending all routes back to their origin
d) Blocking updates for unreachable routes

EIGRP (Enhanced Interior Gateway Routing Protocol)

8. Which algorithm does EIGRP use to ensure loop-free and fast convergence?
a) Bellman-Ford
b) Dijkstra
c) Diffusing Update Algorithm (DUAL)
d) Distance-Vector Algorithm
9. By default, which two metrics does EIGRP use to calculate the best path?
a) Bandwidth and delay
b) Hop count and reliability
c) Bandwidth and reliability
d) Latency and bandwidth
10. What is a "feasible successor" in EIGRP?
a) A backup route with a higher cost
b) A route that is guaranteed to cause a loop
c) A backup route that is loop-free
d) A route that is no longer used
11. EIGRP sends updates to neighbors when:
a) A new route is added
b) The routing table is full
c) There is a topology change
d) At regular intervals
12. Which type of update does EIGRP use to minimize bandwidth consumption?
a) Full updates
b) Incremental updates
c) Partial updates
d) Immediate updates
13. What is one key advantage of EIGRP over RIP?
a) EIGRP is simpler to configure
b) EIGRP converges faster
c) EIGRP has a lower hop count limit
d) EIGRP doesn’t support IPv6
14. What is the default hello timer for EIGRP on a LAN?
a) 10 seconds
b) 15 seconds
c) 5 seconds
d) 60 seconds
15. In which year did EIGRP become an open standard?
a) 2010
b) 2013
c) 2015
d) 2009
16. Which of the following is NOT true about EIGRP?
a) It supports both IPv4 and IPv6
b) It uses DUAL for fast convergence
c) It sends periodic updates like RIP
d) It was originally Cisco-proprietary
 True or False

RIP (Routing Information Protocol)

1. RIP uses hop count as its only metric to determine the best path.
2. RIP has a maximum hop count of 20, beyond which a route is considered unreachable.
3. RIP v1 supports Variable Length Subnet Masking (VLSM).
4. RIP routers broadcast their entire routing table every 30 seconds.
5. Route poisoning in RIP is used to advertise unreachable routes with an infinite metric.
6. RIP is ideal for large-scale networks with complex routing requirements.

EIGRP (Enhanced Interior Gateway Routing Protocol)

7. EIGRP uses the Diffusing Update Algorithm (DUAL) to ensure loop-free routes and fast
convergence.
8. EIGRP only uses hop count as its metric for selecting the best path.
9. EIGRP sends periodic updates like RIP.
10. EIGRP supports both IPv4 and IPv6 routing.
11. Feasible successors in EIGRP are backup routes that are guaranteed to be loop-free.
12. EIGRP was originally a Cisco-proprietary protocol but became an open standard in 2013.
13. EIGRP is not suitable for use in large networks.
14. EIGRP supports classless routing and VLSM.

OSPF (Open Shortest Path First)

15. OSPF is a distance-vector routing protocol.

16. OSPF uses the Dijkstra algorithm to calculate the shortest path.
17. OSPF networks must have a backbone area, known as Area 0, that connects all other areas.
18. OSPF uses periodic updates to exchange routing information.
Answer: False (OSPF uses triggered updates after topology changes)
19. Dividing OSPF networks into areas helps reduce routing table size and limits the scope of
updates.
20. OSPF is less resource-intensive than RIP.