Topology Based Caching Optimizing Strategy in Named Data Networking

Xin WEI; Yong YAN; Shaoyong GUO; Zhuo YU; Xuesong QIU

doi:10.11999/JEIT170967

Volume 40 Issue 9

Aug. 2018

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2018 > 40(9): 2057-2063

Xin WEI, Yong YAN, Shaoyong GUO, Zhuo YU, Xuesong QIU. Topology Based Caching Optimizing Strategy in Named Data Networking[J]. Journal of Electronics & Information Technology, 2018, 40(9): 2057-2063. doi: 10.11999/JEIT170967

Citation:

Xin WEI, Yong YAN, Shaoyong GUO, Zhuo YU, Xuesong QIU. Topology Based Caching Optimizing Strategy in Named Data Networking[J]. Journal of Electronics & Information Technology, 2018, 40(9): 2057-2063. doi: 10.11999/JEIT170967

Citation:

PDF( 1319 KB)

Topology Based Caching Optimizing Strategy in Named Data Networking

doi: 10.11999/JEIT170967

1.
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
2.
Electric Power Research Institute of State Grid Zhejiang Electric Power Company, Hangzhou 310009, China
3.
Beijing China-Power Information Technology Co.Ltd., Beijing 100192, China

Funds: National Natural Science Foundation of China (61702048), State Grid Corporation of Science and Technology Project (5211DS17002D)

Received Date: 2017-10-19
Rev Recd Date: 2018-06-11

Available Online: 2018-07-12

Publish Date: 2018-09-01

Abstract

Abstract

In order to utilize storage space and fetch content effectively in Named Data Networking (NDN), this paper constructs a model for caching problem and proposes a greedy algorithm based on topology information. To optimize the algorithm, content popularity is introduced into execution. Furthermore, content hit distance is shortened effectively. This paper simulates a NDN network based on some real topology data with ndnSIM, and compares the proposed algorithm with traditional prob algorithm, default Cache Everything Everywhere (CEE) algorithm and degree based Heterogeneous Storage Size (HSS) algorithm through simulation. The results show that the algorithm proposed in this paper has better performance.
- Internet,
- Named Data Networking (NDN),
- Content cache,
- Topology

FullText(HTML)

References(18)

References

JACOBSON V, SMETTERS D K, THORNTON J D, et al. Networking named content[C]. International Conference on Emerging NETWORKING Experiments and Technologies, New York, USA, 2009: 1–12.

CHIOCCHETTI R, PERINO D, CAROFIGLIO G, et al. INFORM: A dynamic interest forwarding mechanism for information centric networking[C]. ACM SIGCOMM Workshop on Information-Centric NETWORKING, Hong Kong, China, 2013: 9–14.

IOANNOU A and WEBER S. A survey of caching policies and forwarding mechanisms in information-centric networking[J]. IEEE Communications Surveys&Tutorials, 2016, 18(4): 2847–2886 doi: 10.1109/COMST.2016.2565541

ZHANG Meng, LUO Hongbin, and ZHANG Hongke. A survey of caching mechanisms in information-centric networking[J]. IEEE Communications Surveys&Tutorials, 2015, 17(3): 1473–1499 doi: 10.1109/COMST.2015.2420097

LAOUTARIS N, CHE H, and STAVRAKAKIS I. The LCD interconnection of LRU caches and its analysis[J]. Performance Evaluation, 2006, 63(7): 609–634 doi: 10.1016/j.peva.2005.05.003

PSARAS I, WEI K C, and PAVLOUS G. In-network cache management and resource allocation for information-centric networks[J].IEEE Transactions on Parallel&Distributed Systems, 2014, 25(11): 2920–2931 doi: 10.1109/TPDS.2013.304

WEI K C, DILIANG H, and IOANNIS P. Cache " less for more” in information-centric networks[C]. International IFIP TC 6 Conference on NETWORKING, Prague, 2012: 27–40.

WANG Sen, BI Jun, WU Jianping, et al. CPHR: In-network caching for information-centric networking with partitioning and hash-routing[J]. IEEE/ ACM Transactions on Networking, 2016, 24(5): 2742–2755 doi: 10.1109/TNET.2015.2480093

ROSSI D and ROSSINI G. On sizing CCN content stores by exploiting topological information[C]. Computer Communications Workshops, Orlando, USA, 2012: 280–285.

SOURLAS V, GKATZIKIS L, FLEGKAS P, et al. Distributed cache management in information-centric networks[J]. IEEE Transactions on Network&Service Management, 2013, 10(3): 286–299 doi: 10.1109/TNSM.2013.052113.120382

LLORCA J, TULINO A M, GUAN K, et al. Dynamic in-network caching for energy efficient content delivery[C]. IEEE International Conference on Computer Communications, Turin, 2013: 245–249.

KHREISHAH A, CHAKARESKI J, GHARAIBEH A, et al. Joint data placement and flow control for cost-efficient data center networks[C]. International Conference on Information and Communication Systems, Beijing, 2015: 274–279.

GHARAIBEH A, KHREISHAH, JI Bo, et al. A provably efficient online collaborative caching algorithm for multicell-coordinated systems[J]. IEEE Transactions on Mobile Computing, 2016, 15(8): 1863–1876 doi: 10.1109/TMC.2015.2474364

LIU Yinlong, ZHU Dali, MA Wei, et al. A novel cooperative caching scheme for content centric mobile Ad hoc networks[C]. Computers and Communication, Messina, 2016: 824–829.

WANG Yonggang, LI Zhenyu, TYSON G, et al. Design and evaluation of the optimal cache allocation for content-centric networking[J]. IEEE Transactions on Computers, 2015, 65(1): 95–107 doi: 10.1109/TC.2015.2409848

MASTORAKIS S, AFANASYEV A, MOSIEENKO I, et al. ndnSIM 2.0: A new version of the NDN simulator for NS-3[R]. NDN, Technical Report NDN-0028, Revision 2, 2016. https://named-data.net/wp-content/uploads/2016/11/ndn-0028-2-ndnsim-v2.pdf, 2016.

The University of Adelaide. DFN[OL]. http://www.topology-zoo.org/maps 2017.7.

LI Yanhua, XIE Haiyong, WEN Yonggang, et al. Coordinating in-network caching in content-centric networks: Model and analysis[C]. IEEE, International Conference on Distributed Computing Systems, Philadelphia, 2013: 62–72.

Relative Articles

Supplements(0)

Cited By

Proportional views