T. Achterberg, SCIP: solving constraint integer programs, Mathematical Programming Computation, vol.29, issue.2, pp.1-41, 2009.
DOI : 10.1287/ijoc.6.4.445

URL : http://mpc.zib.de/index.php/MPC/article/viewFile/4/6/

B. Ahlgren, Design considerations for a network of information, Proceedings of the 2008 ACM CoNEXT Conference on, CONEXT '08, 2008.
DOI : 10.1145/1544012.1544078

D. R. Amancio, C. H. Comin, D. Casanova, G. Travieso, O. M. Bruno et al., A Systematic Comparison of Supervised Classifiers, PLoS ONE, vol.5, issue.3, p.94137, 2014.
DOI : 10.1371/journal.pone.0094137.s001

URL : http://doi.org/10.1371/journal.pone.0094137

M. Badov, A. Seetharam, J. Kurose, V. Firoiu, and S. Nanda, Congestionaware caching and search in information-centric networks, Proceedings of the 1st International Conference on Information-centric Networking, ICN '14, pp.37-46, 2014.
DOI : 10.1145/2660129.2660145

S. Bansal and D. S. Modha, CAR: Clock with adaptive replacement, Proceedings of the 3rd USENIX Conference on File and Storage Technologies, pp.187-200, 2004.

U. Ben-porat, A. Bremler-barr, and H. Levy, Vulnerability of Network Mechanisms to Sophisticated DDoS Attacks, IEEE Transactions on Computers, vol.62, issue.5, pp.1031-1043, 2013.
DOI : 10.1109/TC.2012.49

D. P. Bertsekas, Nonlinear programming, Athena scientific Belmont, 1999.

D. P. Bertsekas, R. G. Gallager, and P. Humblet, Data networks, 1992.

G. Bianchi, A. Detti, A. Caponi, B. Melazzi, and N. , Check before storing, ACM SIGCOMM Computer Communication Review, vol.43, issue.3, pp.59-67, 2013.
DOI : 10.1145/2500098.2500106

M. Blaze, J. Feigenbaum, L. , and J. , Decentralized trust management, Proceedings 1996 IEEE Symposium on Security and Privacy, pp.164-173, 1996.
DOI : 10.1109/SECPRI.1996.502679

S. Boyd and L. Vandenberghe, Convex optimization, 2004.

L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, Web caching and zipflike distributions: Evidence and implications, INFOCOM'99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, pp.126-134, 1999.
DOI : 10.1109/infcom.1999.749260

URL : http://www.ieee-infocom.org/1999/papers/01d_03.pdf

B. Briscoe, A. Brunstrom, A. Petlund, D. Hayes, D. Ros et al., Reducing Internet Latency: A Survey of Techniques and Their Merits, IEEE Communications Surveys & Tutorials, vol.18, issue.3, 2014.
DOI : 10.1109/COMST.2014.2375213

G. Carlucci, L. De-cicco, and S. Mascolo, HTTP over UDP, Proceedings of the 30th Annual ACM Symposium on Applied Computing , SAC '15, pp.609-614, 2015.
DOI : 10.1145/2079296.2079317

G. Carofiglio, M. Gallo, and L. Muscariello, Joint hop-by-hop and receiverdriven interest control protocol for content-centric networks, 2012.
DOI : 10.1145/2377677.2377772

URL : http://conferences.sigcomm.org/sigcomm/2012/paper/icn/p37.pdf

G. Carofiglio, M. Gallo, and L. Muscariello, Bandwidth and Storage Sharing Performance in Information Centric Networking, Computer Networks Journal, vol.57, issue.17, 2013.

G. Carofiglio, M. Gallo, and L. Muscariello, On the performance of bandwidth and storage sharing in information-centric networks, Computer Networks, vol.57, issue.17, pp.3743-3758, 2013.
DOI : 10.1016/j.comnet.2013.08.018

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

G. Carofiglio, L. Mekinda, and L. Muscariello, Analysis of latency-aware caching strategies in information-centric networking, Proceedings of the 1st Workshop on Content Caching and Delivery in Wireless Networks, CCDWN '16, 2015.
DOI : 10.1145/2656877.2656887

URL : https://hal.archives-ouvertes.fr/hal-01249439

G. Carofiglio, L. Mekinda, and L. Muscariello, FOCAL: Forwarding and Caching with Latency Awareness in Information-Centric Networking, 2015 IEEE Globecom Workshops (GC Wkshps), 2015.
DOI : 10.1109/GLOCOMW.2015.7413972

URL : https://hal.archives-ouvertes.fr/hal-01249441

G. Carofiglio, L. Mekinda, and L. Muscariello, LAC: Introducing latency-aware caching in Information-Centric Networks, 2015 IEEE 40th Conference on Local Computer Networks (LCN), 2015.
DOI : 10.1109/LCN.2015.7366343

URL : https://hal.archives-ouvertes.fr/hal-01249435

V. Cerf, S. Burleigh, A. Hooke, L. Torgerson, R. Durst et al., Delay-tolerant networking architecture, 2007.
DOI : 10.17487/rfc4838

URL : https://www.rfc-editor.org/rfc/pdfrfc/rfc4838.txt.pdf

H. Che, Y. Tung, W. , and Z. , Hierarchical Web caching systems: modeling, design and experimental results, IEEE Journal on Selected Areas in Communications, vol.20, issue.7, pp.1305-1314, 2006.
DOI : 10.1109/JSAC.2002.801752

C. Fofack, N. E. Nain, P. Neglia, G. Towsley, and D. , Analysis of TTL-based Cache Networks, ValueTools -6th International Conference on Performance Evaluation Methodologies and Tools -2012, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00676735

E. Cinlar, Introduction to stochastic processes. Courier Corporation, 2013.

V. N. Cisco, The zettabyte era?trends and analysis, 2016.

A. Dan and D. Towsley, An approximate analysis of the lru and fifo buffer replacement schemes, Proc of. SIGMETRICS, 1990.
DOI : 10.1145/98460.98525

URL : http://www.seattle.intel-research.net/%7Ejjung/paper/p143-dan.pdf

M. Dehghan, L. Massoulie, D. Towsley, D. Menasche, and Y. Tay, A utility optimization approach to network cache design. arXiv preprint, 2016.
DOI : 10.1109/infocom.2016.7524445

URL : https://hal.archives-ouvertes.fr/hal-01377841

M. Dehghan, A. Seetharam, B. Jiang, T. He, T. Salonidis et al., On the complexity of optimal routing and content caching in heterogeneous networks, 2015 IEEE Conference on Computer Communications (INFOCOM), pp.936-944, 2015.
DOI : 10.1109/INFOCOM.2015.7218465

L. Deng and D. Yu, Deep learning: Methods and applications. Found. Trends Signal Process, pp.197-387, 2014.
DOI : 10.1561/2000000039

URL : http://research.microsoft.com/pubs/209355/DeepLearning-NowPublishing-Vol7-SIG-039.pdf

S. Elayoubi and J. Roberts, Performance and Cost Effectiveness of Caching in Mobile Access Networks, Proceedings of the 2nd International Conference on Information-Centric Networking, ICN '15, pp.79-88, 2015.
DOI : 10.1145/319344.319153

URL : https://hal.archives-ouvertes.fr/hal-01291397

C. Ellison, Establishing identity without certification authorities, USENIX Security Symposium, pp.67-76, 1996.

S. Eum, K. Nakauchi, M. Murata, Y. Shoji, and N. Nishinaga, CATT, Proceedings of the second edition of the ICN workshop on Information-centric networking, ICN '12, 2012.
DOI : 10.1145/2342488.2342500

S. K. Fayazbakhsh, Y. Lin, A. Tootoonchian, A. Ghodsi, T. Koponen et al., Less pain, most of the gain: Incrementally deployable icn, Proceedings of the ACM SIGCOMM 2013 Conference on SIG- COMM, SIGCOMM '13, pp.147-158, 2013.
DOI : 10.1145/2486001.2486023

S. Floyd and K. Fall, Promoting the use of end-to-end congestion control in the Internet, IEEE/ACM Transactions on Networking, vol.7, issue.4, pp.458-472, 1999.
DOI : 10.1109/90.793002

S. B. Fredj, T. Bonald, A. Proutiere, G. Régnié, and J. W. Roberts, Statistical bandwidth sharing, ACM SIGCOMM Computer Communication Review, vol.31, issue.4, pp.111-122, 2001.
DOI : 10.1145/964723.383068

URL : https://hal.archives-ouvertes.fr/hal-01266470

C. Fricker, P. Robert, and J. Roberts, A versatile and accurate approximation for LRU cache performance, Proceedings of the 24th International Teletraffic Congress, ITC '12, pp.1-8, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00671937

S. Habib, J. Qadir, A. Ali, D. Habib, M. Li et al., The past, present, and future of transport-layer multipath. arXiv preprint, 2016.

R. Hamilton, J. Iyengar, I. Swett, and A. Wilk, QUIC: A UDP-based secure and reliable transport for HTTP/2. IETF, draft-tsvwg-quic-protocol-02, 2016.

J. He and J. Rexford, Toward internet-wide multipath routing, IEEE network, vol.22, issue.2, pp.16-21, 2008.

E. Hemmati and J. Garcia-luna-aceves, A new approach to name-based linkstate routing for information-centric networks, Proceedings of the 2nd International Conference on Information-Centric Networking, pp.29-38, 2015.
DOI : 10.1145/2810156.2810173

URL : https://cloudfront.escholarship.org/dist/prd/content/qt89g4x3qm/qt89g4x3qm.pdf

D. S. Hochbaum, Complexity and algorithms for nonlinear optimization??problems, Annals of Operations Research, vol.72, issue.3, pp.257-296, 2007.
DOI : 10.1142/9789812798190_0015

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

R. Housley, W. Polk, W. Ford, and D. Solo, Internet x. 509 public key infrastructure certificate and certificate revocation list (crl) profile, 2002.
DOI : 10.17487/rfc3280

C. Imbrenda, L. Muscariello, and D. Rossi, Analyzing cacheable traffic in isp access networks for micro cdn applications via content-centric networking, Proceedings of the 1st international conference on Information-centric networking, INC '14, 2014.
DOI : 10.1145/2660129.2660146

URL : https://hal.archives-ouvertes.fr/hal-01137871

A. Ioannou and S. Weber, Towards on-path caching alternatives in informationcentric networks, Proc. of IEEE LCN (Poster), 2014.
DOI : 10.1109/lcn.2014.6925792

URL : https://www.scss.tcd.ie/publications/tech-reports/reports.14/TCD-CS-2014-03.pdf

M. Ion, J. Zhang, and E. M. Schooler, Toward content-centric privacy in icn: Attribute-based encryption and routing, Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking, pp.39-40, 2013.
DOI : 10.1145/2486001.2491717

V. Jacobson, D. Smetters, and J. Thornton, Networking named content, Proc. of ACM CoNEXT, 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, CoNEXT '09, pp.1-12, 2009.
DOI : 10.1145/2063176.2063204

K. Jang, S. Han, S. Han, S. B. Moon, and K. Park, Sslshader: Cheap ssl acceleration with commodity processors, NSDI, 2011.

P. R. Jelenkovi´cjelenkovi´c, Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities, Annals of Applied Probability, pp.430-464, 1999.

P. R. Jelenkovi´cjelenkovi´c and X. Kang, Characterizing the miss sequence of the lru cache, Proc. of ACM SIGMETRICS, MAMA Workshop, 2008.

P. R. Jelenkovi´cjelenkovi´c and A. Radovanovi´cradovanovi´c, Optimizing LRU caching for variable document sizes, Comb. Probab. Comput, vol.13, pp.4-5627, 2004.

K. V. Katsaros, W. K. Chai, N. Wang, G. Pavlou, H. Bontius et al., Information-centric networking for machine-to-machine data delivery: a case study in smart grid applications, IEEE Network, vol.28, issue.3, pp.58-64, 2014.

F. P. Kelly, A. K. Maulloo, and D. K. Tan, Rate control for communication networks: shadow prices, proportional fairness and stability, Journal of the Operational Research society, issue.3, pp.49237-252, 1998.
DOI : 10.1038/sj.jors.2600523

R. Kleinberg, Geographic Routing Using Hyperbolic Space, IEEE INFOCOM 2007, 26th IEEE International Conference on Computer Communications, pp.1902-1909, 2007.
DOI : 10.1109/INFCOM.2007.221

URL : http://www.mpi-inf.mpg.de/departments/d1/teaching/ws10/models_of_computation/hyperbolic.pdf

T. Koch, Rapid Mathematical Prototyping, 2004.

T. Koponen, M. Chawla, B. Chun, A. Ermolinskiy, K. Kim et al., A data-oriented (and beyond) network architecture, Proc. of ACM SIGCOMM, 2007.
DOI : 10.1145/1282380.1282402

URL : http://iris.csail.mit.edu/irisbib/papers/dataoriented:sigcomm07/paper.pdf

S. B. Kotsiantis, I. Zaharakis, and P. Pintelas, Supervised machine learning: A review of classification techniques, 2007.

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

URL : http://arxiv.org/pdf/1006.5169

J. Kurose, Information-centric networking: The evolution from circuits to packets to content, Computer Networks, vol.66, pp.112-120, 2014.
DOI : 10.1016/j.comnet.2014.04.002

D. Kutscher, It's the network: Towards better security and transport performance in 5G, 2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp.656-661, 2016.
DOI : 10.1109/INFCOMW.2016.7562158

A. Kuzmin, M. Luisier, and O. Schenk, Fast Methods for Computing Selected Elements of the Green???s Function in Massively Parallel Nanoelectronic Device Simulations, Euro-Par 2013 Parallel Processing, pp.533-544, 2013.
DOI : 10.1007/978-3-642-40047-6_54

N. Laoutaris, H. Che, and I. Stavrakakis, The LCD interconnection of LRU caches and its analysis, Performance Evaluation, vol.63, issue.7, 2006.
DOI : 10.1016/j.peva.2005.05.003

URL : http://cs-people.bu.edu/nlaout/analysis_PEVA.pdf

N. Laoutaris, S. Syntila, and I. Stavrakakis, Meta algorithms for hierarchical Web caches, IEEE International Conference on Performance, Computing, and Communications, 2004, pp.445-452, 2004.
DOI : 10.1109/PCCC.2004.1395054

URL : http://cgi.di.uoa.gr/~istavrak/publications/2004IPCCC.lss.pdf

M. Leconte, G. Paschos, L. Gkatzikis, M. Draief, S. Vassilaras et al., Placing dynamic content in caches with small population, IEEE INFOCOM 2016, The 35th Annual IEEE International Conference on Computer Communications, 2016.
DOI : 10.1109/INFOCOM.2016.7524380

URL : http://arxiv.org/pdf/1601.03926

E. Leonardi and G. L. Torrisi, Least recently used caches under the Shot Noise Model, 2015 IEEE Conference on Computer Communications (INFOCOM), pp.2281-2289, 2015.
DOI : 10.1109/INFOCOM.2015.7218615

URL : http://porto.polito.it/2583367/1/arxiv.pdf

Z. Li and G. Simon, Time-Shifted TV in Content Centric Networks: The Case for Cooperative In-Network Caching, 2011 IEEE International Conference on Communications (ICC), pp.1-6, 2011.
DOI : 10.1109/icc.2011.5963380

URL : https://hal.archives-ouvertes.fr/hal-00609275

J. Llorca, A. M. Tulino, K. Guan, J. Esteban, M. Varvello et al., Dynamic in-network caching for energy efficient content delivery, 2013 Proceedings IEEE INFOCOM, pp.245-249, 2013.
DOI : 10.1109/INFCOM.2013.6566772

R. Lychev, S. Jero, A. Boldyreva, N. , and C. , How Secure and Quick is QUIC? Provable Security and Performance Analyses, 2015 IEEE Symposium on Security and Privacy, pp.214-231, 2015.
DOI : 10.1109/SP.2015.21

V. Martina, M. Garetto, and E. Leonardi, A unified approach to the performance analysis of caching systems, IEEE INFOCOM 2014, IEEE Conference on Computer Communications, 1307.
DOI : 10.1109/INFOCOM.2014.6848145

URL : http://porto.polito.it/2643479/2/arxiv.pdf

L. Massoulié and J. Roberts, Bandwidth sharing: objectives and algorithms, INFOCOM'99. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, pp.1395-1403, 1999.

M. Maternia, E. Ayoubi, and S. E. , 5G-PPP use cases and performance evaluation models, p.5, 2016.

M. Médard, Delay Models and Queueing, 2008.

N. Megiddo and D. S. Modha, ARC: A self-tuning, low overhead replacement cache, Proceedings of the 2Nd USENIX Conference on File and Storage Technologies , FAST '03, pp.115-130, 2003.

P. Megyesi, Z. Krämer, and S. Molnár, How quick is QUIC?, 2016 IEEE International Conference on Communications (ICC), 2016.
DOI : 10.1109/ICC.2016.7510788

N. B. Melazzi, A. Detti, and M. Pomposini, Scalability measurements in an information-centric network, Measurement Methodology and Tools, pp.81-106, 2013.

R. C. Merkle, A Digital Signature Based on a Conventional Encryption Function, Conference on the Theory and Application of Cryptographic Techniques, pp.369-378, 1987.
DOI : 10.1007/3-540-48184-2_32

Z. Ming, M. Xu, W. , and D. , Age-based cooperative caching in informationcentric networks, Proc. of IEEE INFOCOM NOMEN Workshop, 2012.

S. Mitra, M. Agrawal, A. Yadav, N. Carlsson, D. Eager et al., Characterizing web-based video sharing workloads, ACM Trans. Web, vol.58, issue.2, pp.1-827, 2011.
DOI : 10.1145/1526709.1526923

URL : http://www.cs.usask.ca/faculty/eager/TWEB.pdf

J. Mo and J. Walrand, Fair end-to-end window-based congestion control, IEEE/ACM Transactions on Networking, vol.8, issue.5, 2000.
DOI : 10.1109/90.879343

URL : http://www.ecse.rpi.edu/Homepages/shivkuma/teaching/sp2001/readings/mo-walrand.pdf

D. R. Morrison, PATRICIA---Practical Algorithm To Retrieve Information Coded in Alphanumeric, Journal of the ACM, vol.15, issue.4, pp.514-534, 1968.
DOI : 10.1145/321479.321481

M. Naor and B. Pinkas, Oblivious Transfer with Adaptive Queries, Annual International Cryptology Conference, pp.573-590, 1999.
DOI : 10.1007/3-540-48405-1_36

URL : https://link.springer.com/content/pdf/10.1007%2F3-540-48405-1_36.pdf

D. Naylor, A. Finamore, I. Leontiadis, Y. Grunenberger, M. Mellia et al., The Cost of the "S" in HTTPS, Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies, CoNEXT '14, pp.133-140, 2014.
DOI : 10.1109/MNET.2011.5772055

D. Naylor, K. Schomp, M. Varvello, I. Leontiadis, J. Blackburn et al., Multi-Context TLS (mcTLS), ACM SIGCOMM Computer Communication Review, vol.45, issue.5, pp.199-212, 2015.
DOI : 10.1007/978-3-319-04918-2_18

D. Nguyen, K. Sugiyama, and A. Tagami, Congestion price for cache management in information-centric networking, 2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp.287-292, 2015.
DOI : 10.1109/INFCOMW.2015.7179399

F. Olmos, C. Graham, and A. Simonian, Cache miss estimation for nonstationary request processes. arXiv preprint, 2015.
DOI : 10.1287/stsy.2017.0009

URL : https://hal.archives-ouvertes.fr/hal-01232173

F. Olmos, B. Kauffmann, A. Simonian, C. , and Y. , Catalog dynamics: Impact of content publishing and perishing on the performance of a LRU cache, 2014 26th International Teletraffic Congress (ITC), pp.1-9, 2014.
DOI : 10.1109/ITC.2014.6932936

D. Papadimitriou, M. Welzl, M. Scharf, and B. Briscoe, Open research issues in internet congestion control, 2011.
DOI : 10.17487/rfc6077

F. Papadopoulos, D. Krioukov, M. Boguna, and A. Vahdat, Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces, 2010 Proceedings IEEE INFOCOM, pp.1-9, 2010.
DOI : 10.1109/INFCOM.2010.5462131

URL : http://www.cs.ucsd.edu/~vahdat/papers/hyperbolics-infocom10.pdf

G. Paschos, E. Bastug, I. Land, G. Caire, and M. Debbah, Wireless caching: technical misconceptions and business barriers, IEEE Communications Magazine, vol.54, issue.8, pp.5416-5438, 2016.
DOI : 10.1109/MCOM.2016.7537172

URL : http://arxiv.org/pdf/1602.00173

D. Perino, M. Varvello, L. Linguaglossa, R. Laufer, and R. Boislaigue, Caesar, Proceedings of the tenth ACM/IEEE symposium on Architectures for networking and communications systems, ANCS '14, pp.137-148, 2014.
DOI : 10.1145/2658260.2658267

URL : https://hal.archives-ouvertes.fr/hal-01101460

I. Psaras, W. K. Chai, and G. Pavlou, Probabilistic in-network caching for information-centric networks, Proceedings of the second edition of the ICN workshop on Information-centric networking, ICN '12, pp.55-60, 2012.
DOI : 10.1145/2342488.2342501

URL : http://www.ee.ucl.ac.uk/~gpavlou/Publications/Conference-papers/Psar-12.pdf

J. Qadir, A. Ali, K. A. Yau, A. Sathiaseelan, C. et al., Exploiting the Power of Multiplicity: A Holistic Survey of Network-Layer Multipath, IEEE Communications Surveys & Tutorials, vol.17, issue.4, pp.2176-2213, 2015.
DOI : 10.1109/COMST.2015.2453941

S. Radhakrishnan, Y. Cheng, J. Chu, A. Jain, and B. And-raghavan, TCP fast open, Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies on, CoNEXT '11, p.21, 2011.
DOI : 10.1145/2079296.2079317

B. Radunovi´cradunovi´c and J. L. Boudec, A unified framework for max-min and minmax fairness with applications, IEEE/ACM Transactions on Networking, issue.5, pp.151073-1083, 2007.

C. Raiciu, D. Niculescu, M. Bagnulo, and M. J. Handley, Opportunistic mobility with multipath TCP, Proceedings of the sixth international workshop on MobiArch, MobiArch '11, pp.7-12, 2011.
DOI : 10.1145/1999916.1999919

URL : http://www0.cs.ucl.ac.uk/staff/M.Handley/papers/mobiarch2011.pdf

M. Riedmiller, Advanced supervised learning in multi-layer perceptrons ??? From backpropagation to adaptive learning algorithms, Computer Standards & Interfaces, vol.16, issue.3, pp.265-278, 1994.
DOI : 10.1016/0920-5489(94)90017-5

URL : http://www.lce.hut.fi/~jlampine/papers/Riedmiller_rprop.ps.gz

J. Roberts and N. Sbihi, Exploring the memory-bandwidth tradeoff in an information-centric network, Proceedings of the 2013 25th International Teletraffic Congress (ITC), 2013.
DOI : 10.1109/ITC.2013.6662936

URL : https://hal.archives-ouvertes.fr/hal-00870506

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

D. E. Rumelhart, G. E. Hinton, W. , and R. J. , Learning internal representations by error propagation, 1985.

L. Saino, I. Psaras, and G. Pavlou, Hash-routing schemes for information centric networking, Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking, ICN '13, pp.27-32, 2013.
DOI : 10.1145/2491224.2491232

URL : http://conferences.sigcomm.org/sigcomm/2013/papers/icn/p27.pdf

O. Schenk, M. Bollhöfer, and R. A. Römer, On Large-Scale Diagonalization Techniques for the Anderson Model of Localization, SIAM Review, vol.50, issue.1, pp.91-112, 2008.
DOI : 10.1137/070707002

URL : http://arxiv.org/pdf/math/0508111

O. Schenk, A. Wächter, and M. Hagemann, Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization, Computational Optimization and Applications, vol.16, issue.1, pp.321-341, 2007.
DOI : 10.1007/b98874

A. Sengupta, R. Tandon, and O. Simeone, Cloud RAN and edge caching: Fundamental performance trade-offs, 2016 IEEE 17th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2016.
DOI : 10.1109/SPAWC.2016.7536885

V. Shah and G. De-veciana, Performance evaluation and asymptotics for Content Delivery Networks, IEEE INFOCOM 2014, IEEE Conference on Computer Communications, pp.2607-2615, 2014.
DOI : 10.1109/INFOCOM.2014.6848208

V. Shah and G. De-veciana, Impact of fairness and heterogeneity on delays in large-scale content delivery networks, Proceedings of the 2015 ACM SIGMET- RICS International Conference on Measurement and Modeling of Computer Systems, pp.375-387, 2015.
DOI : 10.1145/2745844.2745857

J. Sherry, C. Lan, R. A. Popa, R. , and S. , BlindBox, ACM SIGCOMM Computer Communication Review, vol.45, issue.5, pp.213-226, 2015.
DOI : 10.1109/SFCS.1986.25

Y. Shi, J. Zhang, K. B. Letaief, B. Bai, C. et al., Large-scale convex optimization for ultra-dense cloud-RAN, IEEE Wireless Communications, vol.22, issue.3, pp.84-91, 2015.
DOI : 10.1109/MWC.2015.7143330

URL : http://arxiv.org/pdf/1506.04243

M. Shreedhar and G. Varghese, Efficient fair queueing using deficit round robin, 1995.
DOI : 10.1145/217382.217453

A. Singla, B. Chandrasekaran, P. Godfrey, and B. Maggs, The Internet at the Speed of Light, Proceedings of the 13th ACM Workshop on Hot Topics in Networks, HotNets-XIII, p.1, 2014.
DOI : 10.1145/637201.637232

A. Singla, B. Chandrasekaran, P. Godfrey, and B. Maggs, Towards a speed of light internet. arXiv preprint, 2015.

W. So, A. Narayanan, and D. Oran, Named data networking on a router: Fast and DoS-resistant forwarding with hash tables, Architectures for Networking and Communications Systems, pp.215-226, 2013.
DOI : 10.1109/ANCS.2013.6665203

T. Song, H. Yuan, P. Crowley, and B. Zhang, Scalable Name-Based Packet Forwarding, Proceedings of the 2nd International Conference on Information-Centric Networking, ICN '15, pp.19-28, 2015.
DOI : 10.1109/INFCOM.2013.6566742

V. Sourlas, P. Flegkas, and L. Tassiulas, A novel cache aware routing scheme for Information-Centric Networks, Computer Networks, vol.59, pp.44-61, 2014.
DOI : 10.1016/j.bjp.2013.12.002

D. Starobinski and D. Tse, Probabilistic methods for web caching, Performance Evaluation, vol.46, issue.2-3, pp.125-137, 2001.
DOI : 10.1016/S0166-5316(01)00045-1

URL : http://people.bu.edu/staro/webcaching.pdf

L. Tassiulas and A. Ephremides, Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks, 1992.
DOI : 10.1109/cdc.1990.204000

URL : http://drum.lib.umd.edu/bitstream/1903/5346/1/TR_92-129.pdf

M. Tortelli, I. Cianci, L. Grieco, G. Boggia, C. et al., A fairness analysis of content centric networks, 2011 International Conference on the Network of the Future, pp.117-121, 2011.
DOI : 10.1109/NOF.2011.6126670

S. Traverso, M. Ahmed, M. Garetto, P. Giaccone, E. Leonardi et al., Temporal locality in today's content caching, ACM SIGCOMM Computer Communication Review, vol.43, issue.5, pp.435-447, 2013.
DOI : 10.1145/2541468.2541470

H. G. Tucker, A graduate course in probability, 2013.

A. Wächter and L. T. Biegler, On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming, Mathematical Programming, vol.10, issue.1, pp.25-57, 2006.
DOI : 10.1007/BFb0120945

Y. Wang, K. He, H. Dai, W. Meng, J. Jiang et al., Scalable Name Lookup in NDN Using Effective Name Component Encoding, 2012 IEEE 32nd International Conference on Distributed Computing Systems, pp.688-697, 2012.
DOI : 10.1109/ICDCS.2012.35

URL : http://www.cs.northwestern.edu/~ychen/Papers/NDN_ICDCS12.pdf

Y. Wang, Z. Li, G. Tyson, S. Uhlig, and G. Xie, Optimal cache allocation for content-centric networking, Proc. of IEEE ICNP, 2013.

Y. Wang, N. Rozhnova, A. Narayanan, D. Oran, R. et al., An improved hop-by-hop interest shaper for congestion control in named data networking, ACM SIGCOMM Computer Communication Review, vol.43, issue.4, pp.55-60, 2013.
DOI : 10.1109/ICC.2013.6655143

URL : https://hal.archives-ouvertes.fr/hal-00997214

A. C. Yao and -. , How to generate and exchange secrets, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), pp.162-167, 1986.
DOI : 10.1109/SFCS.1986.25

E. Yeh, T. Ho, Y. Cui, M. Burd, R. Liu et al., VIP, Proceedings of the 1st international conference on Information-centric networking, INC '14, pp.117-126, 2014.
DOI : 10.1145/2660129.2660151

Y. Yu, F. Bronzino, R. Fan, C. Westphal, and M. Gerla, Congestion-aware edge caching for adaptive video streaming in information-centric networks, Proc. of IEEE CCNC Conference, 2015.

H. Yuan and P. Crowley, Reliably scalable name prefix lookup, 2015 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), pp.111-121, 2015.
DOI : 10.1109/ANCS.2015.7110125

L. Zhang, A. Afanasyev, J. Burke, V. Jacobson, P. Crowley et al., Named data networking, ACM SIGCOMM Computer Communication Review, vol.44, issue.3, 2014.
DOI : 10.1145/2656877.2656887

URL : https://hal.archives-ouvertes.fr/hal-01182997

L. Zhang, Named Data Networking (NDN) Project, 2010.

. Jacobson, 2014] sont deux architectures majeures et très similaires de réseaux centrés sur l'information. NDN commença en tant que branche du code de CCN, CCNx, avant d'être entièrement redéveloppé. En revanche, d'un point de vue architectural, CCN et NDN n'ont pas divergé. Dans les deux architectures, chaque morceau de contenus est identifié par un nom unique, Content-Centric Networking (CCN) requis via des paquets dits Intérêts et rapportés encapsulés dans des paquets de Données, à travers des (inter)faces. Parce que chaque paquet encapsule aussi son nom, il peut être persisté à chaque saut dans un Content Store, un cache, et livré du noeud local à tous ceux qui l'on requis, 2009.

C. Si-un-morceau-de-contenu-est-trouvé-dans-le and . Store, il s'agit d'un évènement nommé hit. La donnée est alors acheminée en utilisant les informations d'états contenus dans l'entrée du PIT correspondante. Par contre, si le morceau de contenu n'est pas trouvé dans le Content Store, il s'agit d'un évènement miss, Dès lors, le plus long préfixe incluant le nom du contenu est recherché dans la Forwarding Information Base (FIB) du noeud. La FIB est remplie par un protocole de routage orienté nom et renvoie, pour chaque préfixe routable, les faces de sortie pour les morceaux de contenus manquants

. Ensuite, intérêt est transmis selon la stratégie de diffusion configurée qui peut-être par exemple, Meilleure route, diffusion large, équilibrage de charge (LB), équilibrage de charge (LB) avec transmission persistante