Caching efficiency of information-centric networking

In-network caching leveraged in information-centric networking (ICN) is one key difference between ICN and the current Internet. Taken into account the complexity and practicality of technology, cooperatively in-network caching is yet so far. However, caching efficiency of current uncooperative caching scheme is disappointing. Network coding is considered as the most promising information theoretic approach to improve performance in current Internet. The authors’ previous work has proposed information-centric networking built network coding (ICN-NC). In this study, the authors will prove that ICN-NC can also improve caching efficiency besides network performance. First, a theoretical model is proposed to evaluate caching efficiency of ICN and ICN-NC, and compare the caching efficiency between ICN and ICN-NC both analytically and by simulations. Then effect of different parameters on caching efficiency, such as file size, copy size and probability of replacement etc., are also extensively researched. Furthermore, the authors formulate the overall caching efficiency as a multi-objective optimisation problem with constraints, and then Pareto optimal set to achieve an optimal allocation of network-wide caching is obtained.

[1]  Baochun Li,et al.  Priority Random Linear Codes in Distributed Storage Systems , 2009, IEEE Transactions on Parallel and Distributed Systems.

[2]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

[3]  Jehoshua Bruck,et al.  EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures , 1995, IEEE Trans. Computers.

[4]  Yunnan Wu,et al.  A Survey on Network Codes for Distributed Storage , 2010, Proceedings of the IEEE.

[5]  Alexandros G. Dimakis,et al.  Network Coding for Distributed Storage Systems , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[6]  K. Jain,et al.  Practical Network Coding , 2003 .

[7]  Yueh-Min Huang,et al.  A neighbor caching mechanism for handoff in IEEE 802.11 wireless networks , 2007, 2007 International Conference on Multimedia and Ubiquitous Engineering (MUE'07).

[8]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[9]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[10]  Ankit Singla,et al.  Information-centric networking: seeing the forest for the trees , 2011, HotNets-X.

[11]  Baochun Li,et al.  How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.

[12]  George Pavlou,et al.  Modelling and Evaluation of CCN-Caching Trees , 2011, Networking.

[13]  Dan Guo,et al.  A sensing policy based on the statistical property of licensed channel in cognitive network , 2010, Int. J. Internet Protoc. Technol..

[14]  I. Reed,et al.  Polynomial Codes Over Certain Finite Fields , 1960 .

[15]  Scott Shenker,et al.  A data-oriented (and beyond) network architecture , 2007, SIGCOMM 2007.

[16]  Muriel Medard,et al.  How good is random linear coding based distributed networked storage , 2005 .

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

[18]  Cheng Huang,et al.  STAR : An Efficient Coding Scheme for Correcting Triple Storage Node Failures , 2005, IEEE Transactions on Computers.

[19]  Gary B. Lamont,et al.  Evolutionary Algorithms for Solving Multi-Objective Problems , 2002, Genetic Algorithms and Evolutionary Computation.

[20]  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).

[21]  Jianliang Xu,et al.  Cache Invalidation and Replacement Strategies for Location-Dependent Data in Mobile Environments , 2002, IEEE Trans. Computers.

[22]  Gang Feng,et al.  Optimizing Caching Policy for Loss Recovery in Reliable Multicast , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[23]  Yunnan Wu.  Existence and construction of capacity-achieving network codes for distributed storage , 2009, 2009 IEEE International Symposium on Information Theory.

[24]  Hirotaka Nakayama,et al.  Theory of Multiobjective Optimization , 1985 .

[25]  Diego Perino,et al.  Experimental Evaluation of Memory Management in Content-Centric Networking , 2011, 2011 IEEE International Conference on Communications (ICC).

[26]  Donald F. Towsley,et al.  Approximate Models for General Cache Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[27]  Dario Rossi,et al.  Caching performance of content centric networks under multi-path routing (and more) , 2011 .

[28]  Richard Demo Souza,et al.  Unequal error protection for LZSS compressed data using Reed-Solomon codes , 2007, IET Commun..

[29]  Chin-Feng Lai,et al.  Detection of Cognitive Injured Body Region Using Multiple Triaxial Accelerometers for Elderly Falling , 2011, IEEE Sensors Journal.

[30]  R. K. Ursem.  Multi-objective Optimization using Evolutionary Algorithms , 2009 .