Scribd
Upload
21 views

Routing Protocols

Uploaded by

abinayaa.s
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
21 views

Routing Protocols

Uploaded by

abinayaa.s
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Routing Protocols

Routing protocols are fundamental to the operation of computer networks,


enabling data packets to traverse complex network topologies and reach their
intended destinations. They define the rules and algorithms that routers use to
make routing decisions, ensuring efficient and reliable data transmission.

by Ms.S.S.Abinayaa ECE
Routing Protocol
Requirements
1 Loop Freedom
Routing protocols must prevent routing loops, where data packets
endlessly circulate within the network without reaching their
destination. This is achieved through mechanisms like hop count limits
and path cost calculations.

2 Convergence
Routing protocols should converge quickly to a stable routing state
after network changes, such as link failures or new node additions.
This ensures minimal disruption to data flow and network
performance.

3 Scalability
Routing protocols should be scalable to handle large networks with
numerous nodes and links. They should efficiently manage routing
information and avoid excessive overhead as the network grows.

4 Security
Routing protocols must incorporate security measures to prevent
malicious attacks, such as route poisoning or denial-of-service attacks.
Authentication and encryption mechanisms are essential for
maintaining network integrity.
Classification of Routing Protocols
Distance-Vector Link-State Path-Vector
Distance-vector protocols, such as Link-state protocols, such as OSPF Path-vector protocols, such as BGP,
RIP and IGRP, rely on each router and IS-IS, use a more sophisticated are used for inter-domain routing.
maintaining a routing table that approach. Each router broadcasts They focus on exchanging path
contains the distance (hop count) to link-state information about its information, including the AS path
each destination network. Routers directly connected neighbors to all traversed by a route, allowing routers
periodically exchange their routing other routers in the network. Routers to make decisions based on policy
tables with their neighbors, updating then build a complete map of the and network preferences.
their knowledge of the network network topology and calculate the
topology. shortest paths to all destinations.
SPIN: Scalable, Probabilistic,
and Incremental Network
Protocol
SPIN is a routing protocol designed for wireless sensor networks. It leverages
a probabilistic approach to route discovery, where nodes randomly select
neighbors to forward data packets. This approach reduces the overhead
associated with traditional routing protocols and improves scalability in large
sensor networks.
SPIN: Key Features
Scalability
SPIN's probabilistic approach allows it to scale efficiently to large sensor
networks, as it reduces the need for complex routing table maintenance
and information exchange.

Energy Efficiency
By minimizing the number of routing messages exchanged, SPIN
conserves energy in sensor nodes, which are often battery-powered and
have limited resources.

Fault Tolerance
SPIN's probabilistic nature makes it resilient to node failures. If a node
fails, data packets can be rerouted through alternative paths, ensuring
continued data transmission.
Directed Diffusion in Wireless Sensor
Networks
Directed diffusion is another routing protocol specifically designed for wireless sensor networks. It utilizes a data-centric
approach, where data packets are routed based on their content and the interests of the sink node (the node collecting
data).
Directed Diffusion: Key Concepts
1 2 3

Data Interest Gradient Formation Reinforcement


The sink node broadcasts its data Sensor nodes that have data The sink node reinforces the path
interests to the network, specifying matching the sink's interests with the highest data concentration
the type of data it requires. This respond by sending data packets by sending positive
information is propagated back to the sink. As data packets acknowledgments (ACKs) to the
throughout the network. are forwarded, a gradient is formed, nodes along that path. This
indicating the path with the highest encourages data flow along the
data concentration. most efficient route.
Directed Diffusion:
Advantages
1 Adaptive Routing
Directed diffusion adapts to changing network conditions and data
patterns, dynamically adjusting routes to optimize data flow and
minimize latency.

2 Data Aggregation
Directed diffusion supports data aggregation, where sensor nodes can
combine data before forwarding it to the sink, reducing communication
overhead and conserving energy.

3 Scalability
Directed diffusion scales well to large sensor networks, as it relies on
local communication and data-driven routing decisions.
Routing Protocol Comparison
Protocol Type Advantages Disadvantages

RIP Distance- Simple to Limited


Vector implement, scalability,
easy to slow
configure convergence,
susceptible to
routing loops

OSPF Link-State Scalable, fast More complex


convergence, to configure,
secure higher
computational
overhead

SPIN Probabilistic Scalable, May have


energy- higher latency,
efficient, fault- less
tolerant predictable
routing

Directed Data-Centric Adaptive Requires data


Diffusion routing, data interest
aggregation, broadcasting,
scalable may have
higher
overhead
Conclusion
Routing protocols are essential for the efficient and reliable operation of
computer networks. Different protocols cater to specific network
requirements and characteristics. Understanding the advantages and
disadvantages of various routing protocols is crucial for selecting the most
appropriate solution for a given network environment.

You might also like