{"references": ["1.\tV. Jacobson, D. K. Smetters, J. D. Thornton, M. F. Plass, N. H. Briggs, and R. L. Braynard, \"Networking named content\", in Proc. ACM 5th Int. Conf. Emerg. Netw. Experim. Technol., Rome, Italy, 2009, pp. 1 12. 2.\tE. Baccelli, C. Mehlis, O. Hahm, T. C. Schmidt, and M. W\u00e4hlisch, ``Information centric networking in the IoT: Experiments with NDN in the wild,'' in Proc. 1st ACM Conf. Inf.Centric Netw., Paris, France, 2014, pp. 77 86. 3.\t(Oct. 2017). Cicn. [Online]. Available: https://wiki.fd.io/view/Cicn 4.\tL. Wang, A. K. M. M. Hoque, C. Yi, A. Alyyan, and B. Zhang, ``OSPFN: An OSPF based routing protocol for named data networking,'' Univ. Memphis/Univ. Arizona, Tech. Rep. NDN-0003, Jul. 2012. 5.\tD. Rossi and G. Rossini, ``Caching performance of content centric net-works under multi-path routing (and more),'' T\u00e9l\u00e9com Paris Tech, Paris, France, Tech. Rep. CCN-TR11a, Jul. 2011 6.\tR. Chiocchetti, D. Rossi, G. Rossini, G. Caro glio, and D. Perino, ``Exploit the known or explore the unknown?: Hamlet-like doubts in ICN,'' in Proc. 2nd Ed. ICN Workshop Inf.-Centric Netw., Helsinki, Finland, 2012 7.\t(May 2017). Japan Photonic Network Model. [Online]. Available: http://www.ieice.org/cs/pn/jpn/ jpnm.html 8.\t(Oct. 2016). CPLEX Optimizer. [Online]. Available: http:// www-01.ibm.com/software/commerce/opti mization/cplex-optimizer/"]}

Internet users consider content information to be useful, but the current Internet approach treats location information as more important as so ties the former to the latter. A Content-Centric Network (CCN) allows the user to obtain content without regard to its location. CCN caches the contents information at its intermediate nodes. If any cache node is located on the shortest path, the content can be obtained from the nearest cache node; so far fewer hops are needed compared to the network without any cache node. However, this efficiency is not achieved if no cache node is located on the shortest path one proposal sets cache nodes that broadcast their contents to surrounding nodes; the user is able to obtain the content from the cache node, rather than the node that has the original content, if the cache node is closer to the user. Since large ILPs cannot be solved in practical time, we introduce a Betweeness Centrality (BC) approach that determines the location of cache nodes by computing the BC value of each node and ranks the nodes in descending BC order. Simulations show that the BC approach offers drastically reduced computation time, while the average number of hops is just 5.8% higher than that determined with the ILP approach.