Computer Science ›› 2019, Vol. 46 ›› Issue (9): 137-142.doi: 10.11896/j.issn.1002-137X.2019.09.019

• Network & Communication • Previous Articles     Next Articles

ICN Energy Efficiency Optimization Strategy Based on Content Field of Complex Networks

ZHAO Lei, ZHOU Jin-he   

  1. (School of Information Communication Engineering,Beijing Information Science and Technology University,Beijing 100101,China)
  • Received:2018-10-17 Online:2019-09-15 Published:2019-09-02

Abstract: The current network architecture still adopts end-to-end communication based on location.With the rapid growth of network data and load,there are many problems in the traditional TCP/IP network architecture, such as the low transmission efficiency of the Internet and the low ability of real-time data processing,which are mainly reflected in the lack of guaranteed quality of service for network users,large network energy consumption,etc.Information-Centric Networking (ICN) will become the research hotspot of the next generation Internet architecture.This paper used complex networks to model ICN,and proposed a content-field-based energy efficiency optimization strategy (CFS) to find the best path according to the content field strength of neighbor nodes,and decide whether to cache content on request path by using the proposed caching strategy based on content popularity.The caching strategy takes into account both the content popularity and the distance among users.The simulation results show that compared with the existing ICN strategies,CFS has relative advantages in network throughput,average request delay,average network energy consumption and data packet distribution,especially when the network has a large amount of data,because this algorithm will choice the path close to the content and with low congestion firstly,and its performance is more outstanding.

Key words: Information center network, Content field, Complex networks, Routing algorithms, Caching strategy, Optimization of energy efficiency

CLC Number: 

  • TP393
[1]FORECAST C V N I.Cisco visual networking index:Globalmobile data traffic forecast update 2015-2020[EB/OL].https://www.cisco.com/c/en/us/solutions/collateral/service-provider/visual-networking-index-vni/mobile-white-paper-c11-520862.html.
[2]KUTSCHER D,EUM S,PENTIKOUSIS K,et al.Information-centric networking (icn) research challenges[R].2016.
[3]DIN I U,HASSAN S,KHAN M K,et al.Caching in Information-Centric Networking:Strategies,Challenges,and Future Research Directions[J].IEEE Communications Surveys & Tuto-rials,2017,PP(99):1-1.
[4]MORELLI A,TORTONESI M,STEFANELLI C,et al.Information-Centric Networking in next-generation communications scenarios[J].Journal of Network & Computer Applications,2017,80(C):232-250.
[5]EUM S,NAKAUCHI K,MURATA M,et al.CATT:potential based routing with content caching for ICN[C]//Edition of the Icn Workshop on Information-Centric Networking.ACM,2012:49-54.
[6]BANERJEE B,SEETHARAM A,MUKHERJEE A,et al.Characteristic Time Routing in Information Centric Networks[J].Computer Networks,2016,113:148-158.
[7]WANG S,BI J,WU J,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.
[8]SUKSOMBOON K,TARNOI S,JI Y,et al.PopCache:Cache more or less based on content popularity for information-centric networking[C]//Local Computer Networks.IEEE,2014:236-243.
[9]TARNOI S,KUMWILAISAK W,YUSHENG J.Optimal Coo-perative Routing Protocol Based on Prefix Popularity for Content Centric Networking[C]//Proceedings-Conference on Local Computer Networks.IEEE LCN,2014:414-417.
[10]NEWMAN M E J.The structure and function of complex networks[J].Siam Review,2003,45(2):167-256.
[11]MITCHELL M.Complex systems:Network thinking[J].Artificial Intelligence,2006,170(18):1194-1212.
[12]GUIMERÀR,DÍAZGUILERA A,VEGAREDONDO F,et al.Optimal Network Topologies for Local Search with Congestion[J].Physical Review Letters,2002,89(24):248701.
[13]SONG H Q,GUO J.Improved routing strategy based on gravitational field theory[J].Chinese Physics,2015,24(10):651-658.
[14]LENDERS V,MAY M,PLATTNER B.Service discovery inmobile ad hoc networks:A field theoretic approach[J].Pervasive and Mobile Computing,2005,1(3):343-370.
[15]JACOBSON V,SMETTERS D K,THORNTON J D,et al.Networking named content[C]//International Conference on Emerging Networking Experiments and Technologies.ACM,2009:117-124.
[16]LAOUTARIS N,CHE H,STAVRAKAKIS I.The LCD interconnection of LRU caches and its analysis[J].Performance Evaluation,2006,63(7):609-634.
[17]PSARAS I,WEI K C,PAVLOU G.Probabilistic in-networkcaching for information-centric networks[C]//Edition of the Icn Workshop on Information-Centric Networking.ACM,2012:55-60.
[18]ARENAS A,DÍAZ-GUILERA A,GUIMERÀ R.Communication in networks with hierarchical branching[J].Physical Review Letters,2001,86(14):3196-3199.
[19]ZHANG F,ANTA A F,WANG L,et al.Network energy consumption models and energy efficient algorithms[J].Chinese Journal of Computers,2012,35(3):603-615.(in Chinese)张法,Anta A F,王林,等.网络能耗系统模型及能效算法[J].计算机学报,2012,35(3):603-615.
[20]SEETHARAM A.On Caching and Routing in Information-Centric Networks[J].IEEE Communications Magazine,2017,PP(99):1-6.
[1] LIU Xiao-dong, WEI Hai-ping, CAO Yu. Modeling and Stability Analysis for SIRS Model with Network Topology Changes [J]. Computer Science, 2019, 46(6A): 375-379.
[2] SHAN Na, LI Long-jie, LIU Yu-yang, CHEN Xiao-yun. Link Prediction Based on Correlation of Nodes’ Connecting Patterns [J]. Computer Science, 2019, 46(12): 20-25.
[3] FU Li-dong, LI Dan, LI Zhan-li. Following-degree Tree Algorithm to Detect Overlapping Communities in Complex Networks [J]. Computer Science, 2019, 46(12): 322-326.
[4] GAO Hua-bing, SONG Cong-cong, CHEN Bo, LIU Zhi. Traffic Efficiency Analysis of Traffic Road Network Based on Percolation Theory [J]. Computer Science, 2019, 46(11A): 127-133.
[5] SONG Yan-qiu, LI Gui-jun, LI Hui-jia. Community Label Detection Algorithm Based on Potential Background Information [J]. Computer Science, 2018, 45(6A): 314-317.
[6] LUO Jin-liang, JIN Jia-cai and WANG Lei. Evaluation Method for Node Importance in Air Defense Networks Based on Functional Contribution Degree [J]. Computer Science, 2018, 45(2): 175-180.
[7] CEHN Jun-hua, BIAN Zhai-an, LI Hui-jia, GUAN Run-dan. Measuring Method of Node Influence Based on Relative Entropy [J]. Computer Science, 2018, 45(11A): 292-298.
[8] LV Ya-nan, HAN Hua, JIA Cheng-feng, WAN Yan-juan. Link Prediction Algorithm Based on Node Intimate Degree [J]. Computer Science, 2018, 45(11): 92-96.
[9] LU Yi-hong, ZHANG Zhen-ning and YANG Xiong. Community Structure Detection Algorithm Based on Nodes’ Eigenvectors [J]. Computer Science, 2017, 44(Z6): 419-423.
[10] JIANG Mao-sheng, GE Jian-fei and CHEN Ling. Link Prediction in Networks with Node Attributes Based on Space Mapping [J]. Computer Science, 2017, 44(7): 257-261.
[11] FANG Juan, LIU Shi-jian and LIU Si-tong. Routing Algorithm Research on Heterogeneous Network on Chip [J]. Computer Science, 2017, 44(3): 70-72.
[12] TONG Lin-ping, XU Shou-zhi, ZHOU Huan and JIANG Ting-yao. Research on Temporal Centrality Prediction of Nodes in Complex Networks [J]. Computer Science, 2017, 44(10): 122-126.
[13] CHEN Xu and CHEN Ke-jia. Improved Link Prediction Method for Weighted Networks [J]. Computer Science, 2017, 44(10): 96-98.
[14] ZHANG Li and AN Xin-lei. Research on Adaptive Synchronization Based on Complex Network with Multi-weights [J]. Computer Science, 2016, 43(Z11): 286-289.
[15] CHEN Yong-xiang and CHEN Ling. Link Prediction in Networks with Node Attributes Based on Random Walks Algorithm [J]. Computer Science, 2016, 43(6): 199-203.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[2] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[3] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[4] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[5] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[6] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[7] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[8] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[9] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .
[10] WANG Zhen-chao, HOU Huan-huan and LIAN Rui. Path Optimization Scheme for Restraining Degree of Disorder in CMT[J]. Computer Science, 2018, 45(4): 122 -125 .