Comparing Statistical, Analytical, and Learning-Based Routing Approaches for Delay-Tolerant Networks - Archive ouverte HAL
Article Dans Une Revue ACM Transactions on Modeling and Computer Simulation Année : 2024

Comparing Statistical, Analytical, and Learning-Based Routing Approaches for Delay-Tolerant Networks

Résumé

In delay-tolerant networks (DTNs) with uncertain contact plans, the communication episodes and their reliabilities are known a priori. To maximise the end-to-end delivery probability, a bounded network-wide number of message copies are allowed. The resulting multi-copy routing optimization problem is naturally modelled as a Markov decision process with distributed information. In this paper, we provide an in-depth comparison of three solution approaches: statistical model checking with scheduler sampling, the analytical RUCoP algorithm based on probabilistic model checking, and an implementation of concurrent Q-learning. We use an extensive benchmark set comprising random networks, scalable binomial topologies, and realistic ring-road low Earth orbit satellite networks. We evaluate the obtained message delivery probabilities as well as the computational effort. Our results show that all three approaches are suitable tools for obtaining reliable routes in DTN, and expose a trade-off between scalability and solution quality.
Fichier principal
Vignette du fichier
DSSRUCOP_TOMACS.pdf (1.45 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04711324 , version 1 (26-09-2024)

Identifiants

Citer

Pedro R d'Argenio, Juan A Fraire, Arnd Hartmanns, Fernando Raverta. Comparing Statistical, Analytical, and Learning-Based Routing Approaches for Delay-Tolerant Networks. ACM Transactions on Modeling and Computer Simulation, 2024, ⟨10.1145/3665927⟩. ⟨hal-04711324⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More