This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
37th Annual IEEE Conference on Local Computer Networks
LPS and LRF: Efficient buffer management policies for Delay and Disruption Tolerant Networks
Clearwater Beach, FL, USA USA
October 22-October 25
ISBN: 978-1-4673-1565-4
In Delay and Disruption Tolerant Networks (DTNs), the message delivery rate is impacted by the buffer management policy adopted by nodes once buffer overflows occur frequently. This paper proposes two new buffer management policies. The first one, called LPS (Less Probable Sprayed), uses the messages delivery probability and estimates the number of replicas already disseminated to decide which message to drop. The second one, named LRF (Least Recently Forwarded), drops the least recently forwarded message based on the assumption that messages not forwarded over a certain period of time have already reached several next hops. These two policies are implemented and compared with existing proposals found in the literature. The analysis considers traces of three real networks in which LPS and LRF policies provide higher delivery rates up to 75% and 37%, respectively, than the rate provided by the second best policy, with less overhead.
Index Terms:
Routing protocols,Buffer storage,Delay,Estimation,Probability,Bluetooth
Citation:
"LPS and LRF: Efficient buffer management policies for Delay and Disruption Tolerant Networks," lcn, pp.368-375, 37th Annual IEEE Conference on Local Computer Networks, 2012
Usage of this product signifies your acceptance of the Terms of Use.