Abstract
Disrupted and disconnected networks cannot utilize traditional routing protocols due to long delays and frequent disconnections. It is from the start of this decade that proposition of routing protocols, capable of communicating data in disrupted networks, have been started. These routing protocols either suffer from high data delivery latency or lays undue burden upon the already stressed environment. The paper explains some of the prominent disruption tolerant routing protocols via algorithms and compares their performances with respect to average load laid upon a network in terms of number of bundle copies generated, number of contacts utilized during message delivery, average delivery rate and data delivery latency.