Local Tree Hunting: Finding Closest Contents from In-Network Cache

[1]  Yanghee Choi,et al.  SCAN: Scalable Content Routing for Content-Aware Networking , 2011, 2011 IEEE International Conference on Communications (ICC).

[2]  Bengt Ahlgren,et al.  A survey of information-centric networking , 2012, IEEE Communications Magazine.

[3]  Jianping Wu,et al.  Could in-network caching benefit information-centric networking? , 2011, AINTEC '11.

[4]  James F. Kurose,et al.  Breadcrumbs: Efficient, Best-Effort Content Location in Cache Networks , 2009, IEEE INFOCOM 2009.

[5]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[6]  Hiroshi Shimizu,et al.  Content hunting for in-network cache: Design and performance analysis , 2014, 2014 IEEE International Conference on Communications (ICC).

[7]  Nicola Blefari-Melazzi,et al.  Information centric networking over SDN and OpenFlow: Architectural aspects and experiments on the OFELIA testbed , 2013, Comput. Networks.

[8]  Raouf Boutaba,et al.  A survey of naming and routing in information-centric networks , 2012, IEEE Communications Magazine.

[9]  Dipankar Raychaudhuri,et al.  Optimal Caching with Content Broadcast in Cache-and-Forward Networks , 2011, 2011 IEEE International Conference on Communications (ICC).

[10]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[11]  Tode Hideki,et al.  A study on a photonic network model based on the regional characteristics of Japan , 2013 .