Download now Free registration required
The previous routing approaches like Purely Random Propagation (PRP), Non-Repetitive purely Random Propagation (NRRP), Directed Random Propagation (DRP) perform the routing of packets without considering congestion might occur. When the intermediate nodes receive a huge amount of packets they directly drop the packets. The second problem is that there will be back and forth propagation which decreases the efficiency of the network and increases route discovery time. The aim is to find out the routes in the network without any back and forth propagation so that the packet will not be send back and forth between nodes (optimized routing algorithm).
- Format: PDF
- Size: 721.61 KB