A new adaptive hybrid routing strategy for datagram service

In this paper, a new bounded-hop-count routing strategy for datagram service has been developed. The hybrid routing technique for datagram is
obtained by combining store-and-forward and deflection routing. It shows good adaptability to change in the network and does not require any
specific measures of the network dynamics to be computed. Under the technique for datagram, packets are routed on a suboptimal route towards
the destination instead of discarding them or wasting time in buffer because of congestion, link failure etc. This strategy is very much suitable for
networks with limited or no buffer space at all, especially optical networks. Two algorithms are proposed to select a suboptimal or deflected route.
Simulations are performed for both the proposed strategies which shows better results in terms of packet delivery, discarding, average delay when
compared with the simple store-and-forward routing.