
Veuillez utiliser cette adresse pour citer ce document :
http://dspace.univ-tiaret.dz:80/handle/123456789/16856Affichage complet
| Élément Dublin Core | Valeur | Langue |
|---|---|---|
| dc.contributor.author | BENALI, NOUR EL HOUDA | - |
| dc.date.accessioned | 2025-11-19T14:05:10Z | - |
| dc.date.available | 2025-11-19T14:05:10Z | - |
| dc.date.issued | 2025-06-16 | - |
| dc.identifier.uri | http://dspace.univ-tiaret.dz:80/handle/123456789/16856 | - |
| dc.description.abstract | Can we develop intelligent strategies specific to NDN networks that outperform traditional approaches and optimize the performance of these NDN networks? This question guided the course of this dissertation, driven by the inherent limits of the present IP-based Internet paradigm and the rising shift toward data-centric architectures. The significance of this question derives from the crucial role caching plays in improving latency, bandwidth utilization, and scalability in NDN, and the inability of traditional caching techniques to adapt to dynamic user behavior. This research tested and confirmed several hypotheses: (1) reinforcement learning methods can dynamically outperform fixed cache replacement strategies, and (2) combining spatial and temporal learning components—specifically CNNs and LSTMs—improves the decision-making capability of RL-based caching models | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | University of Ibn Khaldoun Tiaret | en_US |
| dc.subject | Named data networking (NDN) | en_US |
| dc.subject | caching | en_US |
| dc.subject | intelligent caching replacement policies, | en_US |
| dc.subject | Deep reinforcement learning (DRL) | en_US |
| dc.title | Towards intelligent caching in NDN networks | en_US |
| dc.type | Thesis | en_US |
| Collection(s) : | Master | |
Fichier(s) constituant ce document :
| Fichier | Description | Taille | Format | |
|---|---|---|---|---|
| TH.M.INF.2025.04.pdf | 1,98 MB | Adobe PDF | Voir/Ouvrir |
Tous les documents dans DSpace sont protégés par copyright, avec tous droits réservés.