C. Général-de-la-thèse, Au début, iíií etait imprévisible que l'Internet aurait une telle croissance En effet, dans les années 1970s Internetétait Internet´Internetétait un réseau académique appelé ARPANET [1], qui a ´ eté conçu pour répondre aux besoins de la période, comme le partage de ressources rares et coûteuses, tel que des périphériques, des ordinateurs centraux et des liaisons de communication longue distance. Il a ´ egalementétéegalement´egalementété utilisé pour la transmission de paquets de données entre un nombre limité de machines fixes [2]. En conséquence, l'architecture conçue a ´ eté centrée sur l'hôte, 1960.

. Formulation-duprobì-eme-nous-formulons-le-routage-avec-qds-dans-le-réseau-ndn-comme-suit, G. Soit, U. Le-graphe-constitué-d-'un, |. , and |. Liens, Les noeuds représentent les routeurs, les consommateurs ou les fournisseurs, tandis que les liens représentent les canaux de communication Un lien spécifique de l'ensemble U entre les noeuds u et v est noté (u, v) Chaque lien (u, v) de U est caractérisé par un vecteur m-dimensionnel W Si (u, v) appartientàappartient`appartientà U et m réfère les composants renvoient aux critères QdS tels que delai et coût fournis par le lien, Enfin, soit L(u, v) = [L 1

. Le-consommateur-exprime-les-données-désirées-en-envoyant-au-réseau-un-paquet-d, intérêt qui contient le nom de la donnée ainsi que les contraintes de qualité de service. Si la donnée demandée existe, elle prend le même chemin parcouru par l'Intérêt, mais dans la direction opposée. En effet

P. Un-chemin-dans-la-topologie-g-est-noté and . Cons, Il connecte le noeud consommateur (noté Cons), qui a demandé la donnée et X, qui est le noeud qui a une

L. Algorithmes-de-routage-avec-qds-permettent-de-calculer-le-chemin and P. Qui-optimise-un-ou-plusieurs-critères-de-qds, L'idée principale de notre travail est de collecter en temps réel différents paramètres dynamiques de QdS et de les exploiter pour guider les différentes demandes de données utilisateur vers des sources potentielles de données via le meilleur chemin P et pour rediriger les données trouvées vers les consommateurs avec la qualité de service requise. Pour atteindre cet objectif, nous procédons parétapespar´parétapes

R. Les-paramètres and . La-bande-passante-et-le-coût-ontégalementont´ontégalement-la-même-importance, En outre, nous avons défini ? = 0, 2 et Q = 100. Ces résultats sont représentés dans les Tableaux 6.3, 6

. Comme-mentionné-précédement,-puisque-le-coût, le nombre de sauts et le RTT ne sont mesurés que pour les paquets reçus par les consommateurs, et en vue la différence expressive concernant la quantité de paquets supprimés, il est clair que le FCR-QoS-FS est plus efficace que le AC-QoS-FS

A. Etant-donné-que and F. , QoS-FS sont conçues suivant le même modèle sauf que FCR-QoS-FS prend en considération les paramères IAR et DSR en plus aux paramètres prise par AC-QoS-FS, il estévidentest´estévident que l'addition de ces deux paramètres conduitàconduit`conduità minimiser la quantité des paquets supprimés, parce que FCR-QoS-FS

M. Handley, Why the Internet only just works, BT Technology Journal, vol.1, issue.3, pp.119-129, 2006.
DOI : 10.1007/s10550-006-0084-z

G. Xylomenos, C. Ververidis, V. Siris, N. Fotiou, C. Tsilopoulos et al., A Survey of Information-Centric Networking Research, IEEE Communications Surveys & Tutorials, vol.16, issue.2, pp.1024-1049, 2014.
DOI : 10.1109/SURV.2013.070813.00063

. Statistic, Internet of things (iot) : number of connected devices worldwide from 2012 to 2020 (in billions)

J. Rexford and C. Dovrolis, Future Internet architecture, Communications of the ACM, vol.53, issue.9, pp.36-40, 2010.
DOI : 10.1145/1810891.1810906
URL : http://dl.acm.org/ft_gateway.cfm?id=1810906&type=pdf

A. Taran and D. Lavrov, Future internet architecture : Clean-slate vs evolutionary design, p.2016

V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs et al., Networking named content, Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies, CoNEXT '09, pp.1-12, 2009.
DOI : 10.1145/2063176.2063204

V. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs et al., Networking named content, Proceedings of the 5th international conference on Emerging networking experiments and technologies, pp.1-12, 2009.
DOI : 10.1145/2063176.2063204

L. Zhang, D. Estrin, J. Burke, V. Jacobson, J. D. Thornton et al., Named data networking (ndn) project, 2010.

L. Zhang, A. Afanasyev, J. Burke, V. Jacobson, P. Crowley et al., Named data networking, ACM SIGCOMM Computer Communication Review, vol.44, issue.3, pp.66-73, 2014.
DOI : 10.1145/2656877.2656887
URL : https://hal.archives-ouvertes.fr/hal-01182997

N. D. Team, Named data networking project

M. F. Bari, S. R. Chowdhury, R. Ahmed, R. Boutaba, and B. Mathieu, A survey of naming and routing in information-centric networks, IEEE Communications Magazine, vol.50, issue.12, pp.44-53, 2012.
DOI : 10.1109/MCOM.2012.6384450

V. Jacobson, A new way to look at networking, Google Tech Talk, vol.30, 2006.

T. Koponen, M. Chawla, B. Chun, A. Ermolinskiy, K. H. Kim et al., A data-oriented (and beyond) network architecture, ACM SIGCOMM Computer Communication Review, vol.37, issue.4, pp.181-192, 2007.
DOI : 10.1145/1282427.1282402
URL : http://iris.csail.mit.edu/irisbib/papers/dataoriented:sigcomm07/paper.pdf

N. Fotiou, P. Nikander, D. Trossen, and G. C. Polyzos, Developing Information Networking Further: From PSIRP to PURSUIT, International Conference on Broadband Communications, Networks and Systems, pp.1-13, 2010.
DOI : 10.1145/1764873.1764878
URL : http://mm.aueb.gr/publications/2010-pursuit-BROADNETS.pdf

D. Lagutin, K. Visala, and S. Tarkoma, Publish/subscribe for internet : Psirp perspective, Future internet assembly, vol.84, 2010.

C. Dannewitz, J. Golic, B. Ohlman, and B. Ahlgren, Secure Naming for a Network of Information, 2010 INFOCOM IEEE Conference on Computer Communications Workshops, pp.1-6, 2010.
DOI : 10.1109/INFCOMW.2010.5466661

S. Farrell, D. Kutscher, C. Dannewitz, B. Ohlman, A. Keranen et al., Naming things with hashes, 2013.
DOI : 10.17487/rfc6920
URL : https://www.rfc-editor.org/rfc/pdfrfc/rfc6920.txt.pdf

B. Ahlgren, C. Dannewitz, C. Imbrenda, D. Kutscher, and B. Ohlman, A survey of information-centric networking, IEEE Communications Magazine, vol.50, issue.7, pp.26-36, 2012.
DOI : 10.1109/MCOM.2012.6231276

M. D. Ambrosio, C. Dannewitz, H. Karl, and V. Vercellone, Mdht : a hierarchical name resolution service for information-centric networks, Proceedings of the ACM SIGCOMM workshop on Information-centric networking, pp.7-12, 2011.

G. Tyson, N. Sastry, I. Rimac, R. Cuevas, and A. Mauthe, A survey of mobility in information-centric networks, Proceedings of the 1st ACM workshop on Emerging Name-Oriented Mobile Networking Design, Architecture, Algorithms, and Applications, NoM '12, pp.1-6, 2012.
DOI : 10.1145/2248361.2248363

M. F. Team, Nsf mobility first project

C. Yi, A. Afanasyev, I. Moiseenko, L. Wang, B. Zhang et al., A case for stateful forwarding plane, Computer Communications, vol.36, issue.7, pp.779-791, 2013.
DOI : 10.1016/j.comcom.2013.01.005
URL : http://named-data.net/techreport/TR002-forward.pdf

C. Yi, A. Afanasyev, L. Wang, B. Zhang, and L. Zhang, Adaptive forwarding in named data networking, ACM SIGCOMM Computer Communication Review, vol.42, issue.3, pp.62-67, 2012.
DOI : 10.1145/2317307.2317319
URL : http://www.cs.arizona.edu/%7Ebzhang/paper/12-ccr-forwarding.pdf

V. Jacobson, J. Burke, D. Estrin, L. Zhang, B. Zhang et al., Named data networking (ndn) project 2012-2013 annual report, 2014.

M. Meisel, V. Pappas, and L. Zhang, Ad hoc networking via named data, Proceedings of the fifth ACM international workshop on Mobility in the evolving internet architecture, MobiArch '10, pp.3-8, 2010.
DOI : 10.1145/1859983.1859986
URL : http://www.cs.ucla.edu/~lixia/papers/10MobiArch.pdf

C. Team, The convergence project

S. Team, Scalable and adaptive internet solutions (sail)

C. Team, Content mediator architecture for content-aware networks (comet)

T. F. Team, The fp7 4ward project

A. Team, Reseaux du futur et services (verso) 2010 projet connect

C. Yi, J. Abraham, A. Afanasyev, L. Wang, B. Zhang et al., On the role of routing in named data networking, Proceedings of the 1st international conference on Information-centric networking, INC '14, pp.27-36, 2014.
DOI : 10.1145/2660129.2660140

S. Mastorakis, A. Afanasyev, I. Moiseenko, and L. Zhang, Ns-3 based named data networking (ndn) simulator ndnsim : simulation of ndn, icn, information-centric networking

L. Wang, A. Hoque, C. Yi, A. Alyyan, and B. Zhang, Ospfn : An ospf based routing protocol for named data networking, 2012.

A. Hoque, S. O. Amin, A. Alyyan, B. Zhang, L. Zhang et al., Nlsr : nameddata link state routing protocol, Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking, pp.15-20, 2013.

V. Lehman, A. Hoque, Y. Yu, L. Wang, B. Zhang et al., A secure link state routing protocol for ndn, 2016.

V. Lehman, A. M. Hoque, Y. Yu, L. Wang, B. Zhang et al., A secure link state routing protocol for ndn

N. P. Team, The ndn platform

S. Abraham and . Dibenedetto, Nfd developer's guide

Z. Zhu and A. Afanasyev, Let's ChronoSync: Decentralized dataset state synchronization in Named Data Networking, 2013 21st IEEE International Conference on Network Protocols (ICNP), pp.1-10, 2013.
DOI : 10.1109/ICNP.2013.6733578

D. Krioukov, F. Papadopoulos, M. Kitsak, A. Vahdat, and M. Boguná, Hyperbolic geometry of complex networks, Physical Review E, vol.6, issue.3, p.36106, 2010.
DOI : 10.1038/ncomms1063

M. Boguná, F. Papadopoulos, and D. Krioukov, Sustaining the internet with hyperbolic mapping, Nature communications, vol.1, p.62, 2010.

V. Lehman, A. Gawande, B. Zhang, L. Zhang, R. Aldecoa et al., An experimental investigation of hyperbolic routing with a smart forwarding plane in NDN, 2016 IEEE/ACM 24th International Symposium on Quality of Service (IWQoS), pp.1-10, 2016.
DOI : 10.1109/IWQoS.2016.7590394

N. Team, Named data networking (ndn) project 2012-2013 annual report, 2013.

V. Jacobson, J. Burke, L. Zhang, B. Zhang, K. Claffy et al., Named data networking (ndn) project, 2013.

V. Jacobson, J. Burke, L. Zhang, B. Zhang, K. Claffy et al., Named data networking next phase (ndn-np)

M. R. Gary and D. S. Johnson, Computers and intractability : A guide to the theory of np-completeness, 1979.

F. A. Kuipers and P. F. Van-mieghem, Conditions that impact the complexity of QoS routing, IEEE/ACM Transactions on Networking, vol.13, issue.4, pp.717-730, 2005.
DOI : 10.1109/TNET.2005.852882

A. Udugama, X. Zhang, K. Kuladinithi, and C. Goerg, An On-demand Multi-Path Interest Forwarding strategy for content retrievals in CCN, 2014 IEEE Network Operations and Management Symposium (NOMS), pp.1-6, 2014.
DOI : 10.1109/NOMS.2014.6838389

D. Posch, B. Rainer, and H. Hellwagner, SAF: Stochastic Adaptive Forwarding in Named Data Networking, IEEE/ACM Transactions on Networking, vol.25, issue.2, 2015.
DOI : 10.1109/TNET.2016.2614710
URL : http://arxiv.org/pdf/1505.05259

R. Chiocchetti, D. Perino, G. Carofiglio, D. Rossi, and G. Rossini, INFORM, Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking, ICN '13, pp.9-14, 2013.
DOI : 10.1145/2491224.2491227
URL : https://hal.archives-ouvertes.fr/hal-00858185

R. Chiocchetti, D. Rossi, G. Rossini, G. Carofiglio, and D. Perino, Exploit the known or explore the unknown?, Proceedings of the second edition of the ICN workshop on Information-centric networking, ICN '12, pp.7-12, 2012.
DOI : 10.1145/2342488.2342491

G. Rossini and D. Rossi, Coupling caching and forwarding, Proceedings of the 1st international conference on Information-centric networking, INC '14, pp.127-136, 2014.
DOI : 10.1145/2660129.2660153
URL : https://hal.archives-ouvertes.fr/hal-01116270

E. J. Rosensweig, J. Kurose, and D. Towsley, Approximate Models for General Cache Networks, 2010 Proceedings IEEE INFOCOM, pp.1-9, 2010.
DOI : 10.1109/INFCOM.2010.5461936
URL : http://gaia.cs.umass.edu/networks/papers/CacheModels_INFOCOM10.pdf

R. Chiocchetti, D. Rossi, and G. Rossini, ccnSim: An highly scalable CCN simulator, 2013 IEEE International Conference on Communications (ICC), pp.2309-2314, 2013.
DOI : 10.1109/ICC.2013.6654874
URL : https://hal.archives-ouvertes.fr/hal-00858189

G. Carofiglio, M. Gallo, and L. Muscariello, ICP: Design and evaluation of an Interest control protocol for content-centric networking, 2012 Proceedings IEEE INFOCOM Workshops, pp.304-309, 2012.
DOI : 10.1109/INFCOMW.2012.6193510

L. Saino, C. Cocora, and G. Pavlou, CCTCP: A scalable receiver-driven congestion control protocol for content centric networking, 2013 IEEE International Conference on Communications (ICC), pp.3775-3780, 2013.
DOI : 10.1109/ICC.2013.6655143
URL : http://www.ee.ucl.ac.uk/~gpavlou/Publications/Conference-papers/Saino-13b.pdf

G. Carofiglio, M. Gallo, L. Muscariello, and M. Papali, Multipath congestion control in content-centric networks, 2013 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp.363-368, 2013.
DOI : 10.1109/INFCOMW.2013.6970718
URL : http://perso.rd.francetelecom.fr/muscariello/papers/paper-M-CC.pdf

S. Braun, M. Monti, M. Sifalakis, and C. Tschudin, An Empirical Study of Receiver-Based AIMD Flow-Control Strategies for CCN, 2013 22nd International Conference on Computer Communication and Networks (ICCCN), pp.1-8, 2013.
DOI : 10.1109/ICCCN.2013.6614106

G. Carofiglio, M. Gallo, and L. Muscariello, Joint hop-by-hop and receiver-driven interest control protocol for content-centric networks, Proceedings of the second edition of the ICN workshop on Information-centric networking, pp.37-42, 2012.
DOI : 10.1145/2377677.2377772
URL : http://conferences.sigcomm.org/sigcomm/2012/paper/icn/p37.pdf

N. Rozhnova and S. Fdida, An effective hop-by-hop Interest shaping mechanism for CCN communications, 2012 Proceedings IEEE INFOCOM Workshops, pp.322-327, 2012.
DOI : 10.1109/INFCOMW.2012.6193514
URL : https://hal.archives-ouvertes.fr/hal-00997088

Y. Wang, N. Rozhnova, A. Narayanan, D. Oran, and I. Rhee, An improved hop-by-hop interest shaper for congestion control in named data networking, ACM SIGCOMM Computer Communication Review, pp.55-60, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00997214

Y. Wang, Caching,routing and congestion control in a future information-centric internet, 2013.

G. Carofiglio, M. Gallo, L. Muscariello, M. Papalini, and S. Wang, Optimal multipath congestion control and request forwarding in Information-Centric Networks, 2013 21st IEEE International Conference on Network Protocols (ICNP), pp.1-10, 2013.
DOI : 10.1109/ICNP.2013.6733576

G. Carofiglio, M. Gallo, and L. Muscariello, Optimal multipath congestion control and request forwarding in information-centric networks: Protocol design and experimentation, Computer Networks, vol.110, pp.104-117, 2016.
DOI : 10.1016/j.comnet.2016.09.012

K. Schneider, C. Yi, B. Zhang, and L. Zhang, A Practical Congestion Control Scheme for Named Data Networking, Proceedings of the 2016 conference on 3rd ACM Conference on Information-Centric Networking, ACM-ICN '16, p.2016
DOI : 10.1109/ICC.2015.7249156
URL : http://dl.acm.org/ft_gateway.cfm?id=2984369&type=pdf

I. M. Spyridon-mastorakis, A. Afanasyev, and L. A. , Lixia Zhang University of California0 : A new version of the ndn simulator for ns-3, NDN, 2015.

A. Afanasyev, I. Moiseenko, and L. Zhang, ndnsim : Ndn simulator for ns-3, NDN, 2012.

L. Chengming, L. Wenjing, and K. Okamura, A greedy ant colony forwarding algorithm for named data networking, Proceedings of the Asia-Pacific advanced network, pp.17-26, 2013.

C. Li, K. Okamura, and W. Liu, Ant colony based forwarding method for content-centric networking, Advanced Information Networking and Applications Workshops (WAINA), 2013 27th International Conference on, pp.306-311, 2013.

M. Dorigo, V. Maniezzo, and A. Colorni, Ant system: optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), vol.26, issue.1, pp.29-41, 1996.
DOI : 10.1109/3477.484436

J. Lv, X. Wang, and M. Huang, Ant Colony Optimization-Inspired ICN Routing with Content Concentration and Similarity Relation, IEEE Communications Letters, vol.21, issue.6, 2016.
DOI : 10.1109/LCOMM.2016.2631515

S. Shanbhag, N. Schwan, I. Rimac, and M. Varvello, SoCCeR, Proceedings of the ACM SIGCOMM workshop on Information-centric networking, ICN '11, pp.62-67, 2011.
DOI : 10.1145/2018584.2018600

J. Eymann and A. Timm, Multipath Transmission in Content Centric Networking Using a Probabilistic Ant-Routing Mechanism, International Conference on Mobile Networks and Management, pp.45-56, 2013.
DOI : 10.1002/ett.1062

H. Qian, R. Ravindran, G. Wang, and D. Medhi, Probability-based adaptive forwarding strategy in named data networking, 2013 IFIP/IEEE International Symposium on Integrated Network Management, pp.1094-1101, 2013.

K. M. Schneider and U. R. Krieger, Beyond Network Selection, Proceedings of the 2nd International Conference on Information-Centric Networking, ICN '15, pp.137-146, 2015.
DOI : 10.1145/2018584.2018601

A. Detti, C. Pisa, and N. B. Melazzi, Modeling multipath forwarding strategies in Information Centric Networks, 2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp.324-329, 2015.
DOI : 10.1109/INFCOMW.2015.7179405

A. Udugama and C. Goerg, Adaptation of multi-path forwarding strategies for ccn to operate under mobility, 2013.

G. Rossini and D. Rossi, Evaluating CCN multi-path interest forwarding strategies, Computer Communications, vol.36, issue.7, pp.771-778, 2013.
DOI : 10.1016/j.comcom.2013.01.008
URL : https://hal.archives-ouvertes.fr/hal-00858180

Q. Huang and F. Luo, Ant-colony optimization based QoS routing in named data networking, Journal of Computational Methods in Sciences and Engineering, vol.8, issue.6, pp.1-12, 2016.
DOI : 10.1109/ICC.2016.7511441

A. Bouacherine, M. R. Senouci, and B. Merabti, Parallel multi-path forwarding strategy for named data networking, Proceedings of the 13th International Joint Conference on e-Business and Telecommunications, pp.36-46, 2016.

Z. Zhang, C. Sanchez, B. Salkewicz, and E. Crawley, Quality of service extensions to ospf or quality of service path first routing (qospf), 1997.

L. P. Kaelbling, M. L. Littman, and A. W. Moore, Reinforcement learning : A survey, Journal of artificial intelligence research, vol.4, pp.237-285, 1996.

R. S. Sutton and A. G. Barto, Reinforcement Learning: An Introduction, IEEE Transactions on Neural Networks, vol.9, issue.5, 1998.
DOI : 10.1109/TNN.1998.712192

M. L. Littman, Markov games as a framework for multi-agent reinforcement learning, Proceedings of the eleventh international conference on machine learning, pp.157-163, 1994.
DOI : 10.1016/B978-1-55860-335-6.50027-1
URL : http://www.ee.duke.edu/~lcarin/emag/seminar_presentations/Markov_Games_Littman.pdf

R. S. Sutton, Learning to predict by the methods of temporal differences, Machine Learning, vol.34, issue.1, pp.9-44, 1988.
DOI : 10.3758/BF03205056

C. J. Watkins and P. Dayan, Q-learning, Machine Learning, vol.22, issue.3-4, pp.279-292, 1992.
DOI : 10.1007/BF00992698

R. Bellman and R. Kalaba, On adaptive control processes, IRE Transactions on Automatic Control, vol.4, issue.2, pp.1-9, 1959.
DOI : 10.1109/TAC.1959.1104847

A. Mellouk, Etude des Systèmes modulaires Neuro-Prédictif : applicationàapplication`applicationà la Reconnaissance Automatique de la Palire Continue, 1994.

J. A. Boyan and M. L. Littman, Packet routing in dynamically changing networks : A reinforcement learning approach, Advances in Neural Information Processing Systems, pp.671-678, 1994.

L. Bottou, Stochastic Learning, Advanced lectures on machine learning, pp.146-168, 2004.
DOI : 10.1007/978-1-4757-2440-0

M. Dorigo, Optimization, learning and natural algorithms, 1992.

J. Deneubourg, J. M. Pasteels, and J. Verhaeghe, Probabilistic behaviour in ants: A strategy of errors?, Journal of Theoretical Biology, vol.105, issue.2, pp.259-271, 1983.
DOI : 10.1016/S0022-5193(83)80007-1

S. Goss, S. Aron, J. Deneubourg, and J. M. Pasteels, Self-organized shortcuts in the Argentine ant, Naturwissenschaften, vol.2, issue.12, pp.579-581, 1989.
DOI : 10.1007/BF00462870

R. Beckers, J. Deneubourg, and S. Goss, Trails and U-turns in the selection of a path by the ant Lasius niger, Journal of Theoretical Biology, vol.159, issue.4, pp.397-415, 1992.
DOI : 10.1016/S0022-5193(05)80686-1

N. Monmarché, Algorithmes de fourmis artificielles : applicationsàapplications`applicationsà la classification etàet`età l'optimisation, 2000.

M. Dorigo and L. M. Gambardella, Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation, vol.1, issue.1, pp.53-66, 1997.
DOI : 10.1109/4235.585892

L. Gambardella and M. Dorigo, Solving symmetric and asymmetric TSPs by ant colonies, Proceedings of IEEE International Conference on Evolutionary Computation
DOI : 10.1109/ICEC.1996.542672

C. Fricker, P. Robert, J. Roberts, and N. Sbihi, Impact of traffic mix on caching performance in a content-centric network, 2012 Proceedings IEEE INFOCOM Workshops, pp.310-315, 2012.
DOI : 10.1109/INFCOMW.2012.6193511
URL : https://hal.archives-ouvertes.fr/hal-00666169