Credit based routing in Delay Tolerant Networks

Abstract

The Delay Tolerant Networks (DTNs) are a kind of network where a continuous end-to-end path between any two nodes does not exist. Therefore reaching the destination becomes chancy and time taking. Hence the existing algorithms rely upon making many replicas of the same message so that its chance of reaching the destination increases. On the other hand this also increases cost of the network due to so many replications. So another extreme is to use just one replica and route it through the network to the destination. But here chances of reaching the destination are reduced by manifolds. This paper discusses and provides a new routing algorithm that is a mezzo between the two techniques such that it gives a higher probability of reaching the destination than the single message method and at the same time reduces the number of replications.