Network-Layer Routing Routing tasks are methods of finding the paths for packet from their sources...
-
Upload
francis-nelson -
Category
Documents
-
view
216 -
download
0
description
Transcript of Network-Layer Routing Routing tasks are methods of finding the paths for packet from their sources...
![Page 1: Network-Layer Routing Routing tasks are methods of finding the paths for packet from their sources to their destinations. Routers are responsible mainly.](https://reader036.fdocuments.net/reader036/viewer/2022082622/5a4d1b927f8b9ab0599c17ef/html5/thumbnails/1.jpg)
Network-Layer Routing
Routing tasks are methods of finding the paths for packet from their sources to their destinations.
Routers are responsible mainly for implementing
routing algorithms.
![Page 2: Network-Layer Routing Routing tasks are methods of finding the paths for packet from their sources to their destinations. Routers are responsible mainly.](https://reader036.fdocuments.net/reader036/viewer/2022082622/5a4d1b927f8b9ab0599c17ef/html5/thumbnails/2.jpg)
Classification of Routing Algorithms
We can classify different routing Algorithms as
1.Static Routing and Dynamic Routing2.Least Cost Path and Non-Least Cost Path3.Intra Domain and Inter Domain Routing
![Page 3: Network-Layer Routing Routing tasks are methods of finding the paths for packet from their sources to their destinations. Routers are responsible mainly.](https://reader036.fdocuments.net/reader036/viewer/2022082622/5a4d1b927f8b9ab0599c17ef/html5/thumbnails/3.jpg)
Static routing performs routing decisions with preconfigured routes in the routing table, which
can be changed manually only by administrators. Static routes are normally
implemented in those situations where there is no need for route change in the future. Also, if a
failure happens in the network, it is unable to react immediately. e.g. shortest path, flooding
In dynamic routing, the state of the network is
learned through the communication of each router with its neighbors. Dynamic routing continuously updates its routing table with paths and their cost/metric e.g. distance
vector, link state
![Page 4: Network-Layer Routing Routing tasks are methods of finding the paths for packet from their sources to their destinations. Routers are responsible mainly.](https://reader036.fdocuments.net/reader036/viewer/2022082622/5a4d1b927f8b9ab0599c17ef/html5/thumbnails/4.jpg)
Routing
Static Routing ( shortest path
Algo , Flooding )
and
Dynamic Routing ( Distance vector ,
Link state )
Least Cost Path ( Dijkstras , Bellman
Ford )and
Non-Least Cost Path (Flood Routing ,
Deflection Routing )
Interior ( RIP , OSPF )and
Exterior ( B G P )
![Page 5: Network-Layer Routing Routing tasks are methods of finding the paths for packet from their sources to their destinations. Routers are responsible mainly.](https://reader036.fdocuments.net/reader036/viewer/2022082622/5a4d1b927f8b9ab0599c17ef/html5/thumbnails/5.jpg)
Flooding
Flooding requires no network information whatsoever. Every incoming packet to a node is sent out on every outgoing line except the one it arrived on. After the first transmission all the router which are 1 hop distance receive the packet.After second transmission all the routers which are at 2 hop distance receive the packet .
![Page 6: Network-Layer Routing Routing tasks are methods of finding the paths for packet from their sources to their destinations. Routers are responsible mainly.](https://reader036.fdocuments.net/reader036/viewer/2022082622/5a4d1b927f8b9ab0599c17ef/html5/thumbnails/6.jpg)
Limitation
Main limitation flooding is that it generates vast number of duplicate packets due to which bandwidth gets wasted . It is necessary to use suitable mechanism to overcome this limitation.
![Page 7: Network-Layer Routing Routing tasks are methods of finding the paths for packet from their sources to their destinations. Routers are responsible mainly.](https://reader036.fdocuments.net/reader036/viewer/2022082622/5a4d1b927f8b9ab0599c17ef/html5/thumbnails/7.jpg)
Solution1. Use hop-count :- a hop counter may be contained in the packet header, which is decremented at each hop, with the packet being discarded when the counter becomes zero.
2. Use Sequence Number :- Avoid forwarding of same packet second time .
![Page 8: Network-Layer Routing Routing tasks are methods of finding the paths for packet from their sources to their destinations. Routers are responsible mainly.](https://reader036.fdocuments.net/reader036/viewer/2022082622/5a4d1b927f8b9ab0599c17ef/html5/thumbnails/8.jpg)
hop-count=3
![Page 9: Network-Layer Routing Routing tasks are methods of finding the paths for packet from their sources to their destinations. Routers are responsible mainly.](https://reader036.fdocuments.net/reader036/viewer/2022082622/5a4d1b927f8b9ab0599c17ef/html5/thumbnails/9.jpg)
D
G
A
F
E
B
C=router
=link
X
31
1
11
1
1
1
Distance Vector Routing
![Page 10: Network-Layer Routing Routing tasks are methods of finding the paths for packet from their sources to their destinations. Routers are responsible mainly.](https://reader036.fdocuments.net/reader036/viewer/2022082622/5a4d1b927f8b9ab0599c17ef/html5/thumbnails/10.jpg)
Distance Vector Routing Algorithm
• In routing table , initially each router Initialize neighbors with known cost, others with infinity .
• Periodically send copy of routing table to neighbors• On reception of a table , if neighbors path to a destination plus
neighbor cost is better, then switch to better path
![Page 11: Network-Layer Routing Routing tasks are methods of finding the paths for packet from their sources to their destinations. Routers are responsible mainly.](https://reader036.fdocuments.net/reader036/viewer/2022082622/5a4d1b927f8b9ab0599c17ef/html5/thumbnails/11.jpg)
Example
Dest Cost Next
B 3 BC 1 CD -E 1 EF 1 FG -
Initial Table at A
![Page 12: Network-Layer Routing Routing tasks are methods of finding the paths for packet from their sources to their destinations. Routers are responsible mainly.](https://reader036.fdocuments.net/reader036/viewer/2022082622/5a4d1b927f8b9ab0599c17ef/html5/thumbnails/12.jpg)
Dest Cost Next
B 2 CC 1 CD 2 CE 1 EF 1 FG 2 F
Table at A after single iteration