2. #ROUTING#
Thursday, August 29, 2013Swapnil Thaware
Routing is a mechanism that finding out most
cost effective path bet source to destination.
Routing is the one of the most complex and
crusial aspect of packet switched network-
design.
3. Desirable properties:
Thursday, August 29, 2013Swapnil Thaware
Correctness and simplicity:It is necessary to
make routing algo. Simple.
Robustness:Ability of n/w to deliver packets via
some route even in the face of failure.
Stability: Next algo. Should converge to
equilibrium.
Priority to nodes:
4. Design parameter:
Thursday, August 29, 2013
Swapnil
Thaware
Performance criteria:no. of hopes ,cost ,
Bandwidth is inversaly prop. To cost.
Throughtput:no. of packets sending per unit
time.
Network info. Source: adjuscent nodes , all
nodes
5. Routing algorithms:
Thursday, August 29, 2013Swapnil Thaware
• The Optimality Principle
• Shortest Path Routing
• FLOODING
• Distance Vector Routing
• Link State Routing
• Hierarchical Routing
• Broadcast Routing
• Multicast Routing
• Routing for Mobile Hosts
• Routing in Ad Hoc Networks
6. Characteristic of flooding
Thursday, August 29, 2013Swapnil Thaware
• Not require any n/w info ,neither cost of diff. paths
neither topology.
• Here all routers are tried atleast one packet will pass
through shortest path.
• First delivered packets is means it have min. delay and
shortest path.
• Flooding generates vast no. of duplicates packets.
(so we have to overcum this problem………)
7. Utilities Of flooding
Thursday, August 29, 2013Swapnil Thaware
Flooding is highly robust and could be used to
send emergency messeges.
Flooding always chooses the shortest path.
