Scribd
Upload
4 views12 pages

Computer Networks Ii: Dr. Mohanad Naser Al-Hasanat

The document covers advanced topics in computer networks, focusing on routing algorithms including Flow Based Routing, Distance Vector Routing, and Link State Routing. It discusses the complexities introduced by mobile hosts in routing, as well as various methods for broadcast and multicast routing, including Flooding, Multi-Destination Routing, and Reverse Path Forwarding. Additionally, it highlights the importance of spanning trees in efficient routing for both broadcast and multicast scenarios.

Uploaded by

ibrahim.m.alzoubi01
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
4 views12 pages

Computer Networks Ii: Dr. Mohanad Naser Al-Hasanat

The document covers advanced topics in computer networks, focusing on routing algorithms including Flow Based Routing, Distance Vector Routing, and Link State Routing. It discusses the complexities introduced by mobile hosts in routing, as well as various methods for broadcast and multicast routing, including Flooding, Multi-Destination Routing, and Reverse Path Forwarding. Additionally, it highlights the importance of spanning trees in efficient routing for both broadcast and multicast scenarios.

Uploaded by

ibrahim.m.alzoubi01
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/ 12

COMPUTER NETWORKS II

Dr. Mohanad Naser Al-Hasanat


Faculty of Engineering
Al-Hussein Bin Talal University | http://www.ahu.edu.jo
[email protected]
LAST CLASS
• Flow Based Routing (Queuing theory)
• Distance Vector Routing
• Link State Routing:
1. Discover neighbors (Hello)
2. Measure line cost (ECHO)
3. Building Link State Packet
1. Sender ID
2. Packet’s Sequence number
3. Age
4. List of neighbors, and the delays to that neighbors
4. Distribute the LSP
5. Computing the new rout
CHAPTER 1: NETWORK LAYER
LECTURE 3: ROUTING ALGORITHMS-PART3
Routing for Mobile Hosts
Mobile hosts introduce a new complications in
routing algorithms
- One fact is that, mobile users are basically
stationary users within their cells
- Thus, every mobile has a permanent location
(home cell)
- Every area has one or more foreign agent and
home agent
- Foreign agent keeps track of every users visiting
its area
Routing for Mobile Hosts
Broadcast Routing
Sending a packet to all possible destinations simultaneously
is called BROADCASTING
– One possible solution is by using Flooding
• However, Flooding generate too many duplicate packets
– Another solution is Multi-Destination Routing
• Every Router checks all the packet destinations to
determine the needed output lines (the needed output
lines are the best rout to at least one destination)
• Every router creates a new copy of the packet for each
packet destinations
• The destination set is partitioned among the output lines
• After sufficient number of hops, each packet will carry only
one destination and can be treated as a normal packet
Broadcast Routing
Another broadcast routing algorithm proposed
to use the Sink Tree ‘Source Routing’
– Spanning tree, a subnet of a subnet that contains all
routers but no loops
– The router copy incoming packets into all spanning
tree’s lines except the one it comes on
– This method generates the minimum number of
packets
– On the other hand, this method required each router
to have knowledge of its spanning trees, sometime
this information are available by Link State Packet
Broadcast Routing
The last broadcast routing algorithm is used when the
routers know nothing about router’s Spanning Trees
– The router forwards copies of incoming packets into all
out lines except the one it arrived on
– The router checks the line of the arrived packet:
• If packets arrived from a line other than the preferred one for
reaching sources, the packet is discarded
– This method is used the Revers Path Forwarding
mechanism
– This routing method is preferred because:
1. It is easy to implement
2. It dose not have the overhead of the destination lists
Reverse Path Forwarding
Broadcast Routing

Reverse path forwarding. (a) A subnet. (b) A sink tree (Spanning).


(c) The tree built by reverse path forwarding.
Multicast Routing
Include methods of routing packets to well-defined
group that are numerically large in size but small
compared to the network as whole
• Routers must know which of their hosts are in
which group
• Routers compute a spanning tree covering all
other routers in the subnet
• When a process sends a multicast packet to a
group, the first router examine its spanning tree
and prunes it
– It will remain all the lines that led to the group router
Multicast ROUTING

You might also like