CEDO: Content-Centric Dissemination Algorithm for Delay-Tolerant Networks
Résumé
Emerging challenged networks require new protocols and strategies to cope with a high degree of mobility, high de- lays and unknown, possibly non-existing routes within the network. Researchers have proposed di erent store-carry- and-forward protocols for data delivery in challenged net- works. These have been complemented with appropriate drop and scheduling policies that deal with the limitations of the nodes' bu ers and the limited duration of opportunis- tic encounters in these networks. Nevertheless, the vast majority of these protocols and strategies are designed for end-to-end transmissions. Yet, a paradigm shift from the traditional way of addressing the endpoints in the network has been occurring towards content-centric networking. To this end, we present CEDO, a content-centric dissemination algorithm for challenged networks. CEDO aims at maximiz- ing the total delivery-rate of distributed content in a setting where a range of contents of di erent popularity may be requested and stored, but nodes have limited resources. It achieves this by maintaining a delivery-rate utility per con- tent that is proportional to the content miss rate and that is used by the nodes to make appropriate drop and scheduling decisions. This delivery-rate utility can be estimated locally by each node using unbiased estimators fed by sampled infor- mation on the mobile network obtained by gossiping. Both simulations and theory suggest that CEDO achieves its set goal, and outperforms a baseline LRU-based policy by 72%, even in relatively small scenarios. The framework followed by CEDO is general enough to be applied to other global performance objectives as well.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...