Scribd
Upload
35 views

CN Routing Algorithms

This document summarizes four routing algorithms: hierarchical routing, which divides routers into regions to reduce routing table sizes; broadcast routing, which uses flooding or spanning trees to transmit packets to all destinations; multicast routing, which efficiently transmits packets to group members using trees; and anycast routing, which delivers packets to the nearest member of a destination group.

Uploaded by

Chandana Chandu
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
35 views

CN Routing Algorithms

This document summarizes four routing algorithms: hierarchical routing, which divides routers into regions to reduce routing table sizes; broadcast routing, which uses flooding or spanning trees to transmit packets to all destinations; multicast routing, which efficiently transmits packets to group members using trees; and anycast routing, which delivers packets to the nearest member of a destination group.

Uploaded by

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

ROUTING ALGORITHM

1. Hierarchical Routing

2. Broadcast Routing

3. Multicast Routing

4. Anycast Routing

1. Hierarchical Routing :

1. As networks grow in size, the router routing tables grow


proportionally.
2. Not only is router memory consumed by ever-increasing tables,
but more CPU time is needed to scan them and more bandwidth
is needed to send status reports about them.
3. When hierarchical routing is used, the routers are divided into
what we will call regions.
4. Each router knows all the details about how to route packets to
destinations within its own region but knows nothing about the
internal structure of other regions.
5. When different networks are interconnected, it is natural to regard
each one as a separate region to free the routers in one network
from having to know the topological structure of the other ones.
6. Figure gives a quantitative example of routing in a two-level
hierarchy with five regions.
7. The full routing table for router 1A has 17 entries, as shown in
Fig (b).

8. When routing is done hierarchically, as in Fig (c), there are entries


for all the local routers, as before, but all other regions are
condensed into a single router, so all traffic for region 2 goes via
the 1B-2A line, but the rest of the remote traffic goes via the 1C-
3B line.
9. Hierarchical routing has reduced the table from 17 to 7 entries.
As the ratio of the number of regions to the number of routers per
region grows, the savings in table space increase.

Hierarchical Routing
2. Broadcast Routing :

1. Point to Point transmission:


• This method simply sends a distinct packet to each destination
separately.
• hence causing waste of bandwidth due to storage of complete list
of all destinations
2. Flooding :
• Flooding algorithm sends a packet on every outgoing line except
the line on which it arrived.
• Drawback more bandwidth consumed with duplicate packets.
3. Multi Destination Routing:
• Here each packet contains either a list of destinations or a bit map
indicating the desired destination.
• When a packet is received from broadCasting, it decides the
number of output lines that are needed, by examining each
destination.
• Based on that router generates a new copy of the packet to each
output line.
4. Spanning Trees :
• Here we use the sink tree for the router willing to broadcast a
packet (use of spanning tree).
• A spanning tree is a subset of the subset that includes all the
routers but contains no Loops.
5. Reverse Path Forwarding:
• Upon receiving the packet, router will reverse back and checks,
weather corresponding distance is shorter from the Source router.
• If yes, then the packet will be accepted.
• If not then the packet is discarded or rejected.

Broadcast Routing

3. Multicast Routing :

1. Multicast is a method of group communication where the sender


sends data to multiple receivers or nodes present in the network
simultaneously.
2. Multicasting is a type of one-to-many and many-to-many
communication as it allows sender or senders to send data packets
to multiple receivers at once across LANs or WANs
3. sending individual copies to each user is inefficient and might
increase the network latency. To overcome these shortcomings,
multicasting allows a single transmission that can be split up
among the multiple users, consequently, this reduces the
bandwidth of the signal.
4. Multicast routing schemes use spanning trees to deliver packets
to members of a group efficiently, based on the group's density or
sparsity.
5. A spanning tree for the leftmost router can be used for broadcast
but is overkill for multicast.
6. This is an example of a link state protocol called MOSPF
(Multicast OSPF).

Multicast Routing

Applications:
• Internet protocol (IP)
• Streaming Media
• It also supports video conferencing applications and webcasts.
4. Anycast Routing :

1. Delivery models such as unicast, broadcast, and multicast are


used to send packets to specific destinations.
2. Anycast, a variant, delivers a packet to the nearest member of a
group.
3. Anycast routing schemes find these paths.
4. This is useful when nodes provide services like time of day or
content distribution, where the right information is received
regardless of the contact node.
5. Anycast is used in the Internet as part of DNS.
6. Regular distance vector and link state routing can produce anycast
routes.

Anycast Routing
7. The distance vector routing procedure is used to assign addresses
to group 1 members, resulting in nodes sending to the nearest
instance of destination 1.
8. This is because the routing protocol doesn't recognize multiple
instances of destination 1, believing all instances of node 1 are
the same.

You might also like