Research Article
SS-Drop: A Novel Message Drop Policy to Enhance Buffer Management in Delay Tolerant Networks
Algorithm 1
Algorithm of SS-Drop policy.
| ββInput = ππ | | ββOutput = ππ, >= π | | 1: ππ (Incoming message) | | 2: for iβ=1 to N do | | 3:βββCompute ππ.ππ (check size of incoming message) | | 4: end for | | 5: for iβ=1 to k do | | 6:βββCompute ππ.ππ (Check size of incoming message) | | 7:βββππ΅π = ππ.ππ + ππ΅π (Occupied buffer size) | | 8:βββππ΅π = ππ΅π β ππ΅π (Unoccupied Buffer Size) | | 9: end for | | 10: for jβ=1 to k do | | 11:βββifππ < ππ΅πthen | | 12:ββββEnqueue ππ | | 13:βββelse | | 14:ββββCompute πΌπ = ππ.ππ β ππ΅π | | 15:ββββfor I to n do | | 16:βββββifπΌππ == ππ.ππthen | | 17:ββββββDrop ππ | | 18:ββββββEnqueue πΌππ | | 19:βββββelse | | 20:ββββββππ’πππππππ(πΌππ,ππ.ππ) | | 21:βββββend if | | 22:ββββend for | | 23:βββend if | | 24: end for |
|