ENROUTE: An Entropy Aware Routing Scheme for Information-Centric Networks (ICN)

被引:0
|
作者
Bitan Banerjee
Sibendu Paul
Omar Alfandi
Arnab Raha
Amitava Mukherjee
机构
[1] University of Alberta,Department of Electrical and Computer Engineering
[2] Purdue University,Department of Electrical and Computer Engineering
[3] Zayed University,undefined
[4] Intel Corporation,undefined
[5] College of Nano Science and Engineering,undefined
[6] SUNY Polytechnic Institute,undefined
来源
关键词
ICN; Routing; Entropy; Delay; Throughput;
D O I
暂无
中图分类号
学科分类号
摘要
With the exponential growth of end users and web data, the internet is undergoing the change of paradigm from a user-centric model to a content-centric one, popularly known as information-centric networks (ICN). Current ICN research evolves around three key-issues namely (i) content request searching, (ii) content routing, and (iii) in-network caching scheme to deliver the requested content to the end user. This would improve the user experience to obtain requested content because it lowers the download delay and provides higher throughput. Existing researches have mainly focused on on-path congestion or expected delivery time of a content to determine the optimized path towards custodian. However, it ignores the cumulative effect of the link-state parameters and the state of the cache, and consequently it leads to degrade the delay performance. In order to overcome this shortfall, we consider both the congestion of a link and the state of on-path caches to determine the best possible routes. We introduce a generic term entropy to quantify the effects of link congestion and state of on-path caches. Thereafter, we develop a novel entropy dependent algorithm namely ENROUTE for searching of content request triggered by any user, routing of this content, and caching for the delivery this requested content to the user. The entropy value of an intra-domain node indicates how many popular contents are already cached in the node, which, in turn, signifies the degree of enrichment of that node with the popular contents. On the other hand, the entropy for a link indicates how much the link is congested with the traversal of contents. In order to have reduced delay, we enhance the entropy of caches in nodes, and also use path with low entropy for downloading contents. We evaluate the performance of our proposed ENROUTE algorithm against state-of-the-art schemes for various network parameters and observe an improvement of 29–52% in delay, 12–39% in hit rate, and 4–39% in throughput.
引用
收藏
页码:1171 / 1195
页数:24
相关论文
共 50 条
  • [41] LAC: Introducing Latency-Aware Caching in Information-Centric Networks
    Carofiglio, Giovanna
    Mekinda, Leonce
    Muscariello, Luca
    [J]. 40TH ANNUAL IEEE CONFERENCE ON LOCAL COMPUTER NETWORKS (LCN 2015), 2015, : 422 - 425
  • [42] A cache-aware social-based QoS routing scheme in Information Centric Networks
    Qu, Dapeng
    Wang, Xingwei
    Huang, Min
    Li, Keqin
    Das, Sajal K.
    Wu, Sijin
    [J]. JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2018, 121 : 20 - 32
  • [43] Integrated network coding and caching in information-centric networks: revisiting pervasive caching in the ICN framework
    Ravi, Abhiram
    Ramanathan, Parmesh
    Sivalingam, Krishna M.
    [J]. PHOTONIC NETWORK COMMUNICATIONS, 2015, 30 (03) : 416 - 427
  • [44] SD-ICN: An Interoperable Deployment Framework for Software-Defined Information-Centric Networks
    Wang, Jinfan
    Gao, Wei
    Liang, Yuqing
    Qin, Rui
    Wang, Jianping
    Liu, Shucheng
    [J]. 2014 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), 2014, : 149 - +
  • [45] Integrated network coding and caching in information-centric networks: revisiting pervasive caching in the ICN framework
    Abhiram Ravi
    Parmesh Ramanathan
    Krishna M. Sivalingam
    [J]. Photonic Network Communications, 2015, 30 : 416 - 427
  • [46] Popularity and centrality based selective caching scheme for information-centric networks
    Rui L.
    Peng H.
    Huang H.
    Qiu X.
    Shi R.
    [J]. Peng, Hao (heypardon@bupt.edu.cn), 1600, Science Press (38): : 325 - 331
  • [47] Improving Network Throughput by Hardware Realization of a Dynamic Content Caching Scheme for Information-Centric Networking (ICN)
    Archisman Ghosh
    Biswadeep Chakraborty
    Arnab Raha
    Amitava Mukherjee
    [J]. Wireless Personal Communications, 2021, 116 : 2873 - 2898
  • [48] Improving Network Throughput by Hardware Realization of a Dynamic Content Caching Scheme for Information-Centric Networking (ICN)
    Ghosh, Archisman
    Chakraborty, Biswadeep
    Raha, Arnab
    Mukherjee, Amitava
    [J]. WIRELESS PERSONAL COMMUNICATIONS, 2021, 116 (04) : 2873 - 2898
  • [49] Greedy Caching: A Latency-aware Caching Strategy for Information-centric Networks
    Banerjee, Bitan
    Seetharam, Anand
    Tellambura, Chintha
    [J]. 2017 IFIP NETWORKING CONFERENCE (IFIP NETWORKING) AND WORKSHOPS, 2017,
  • [50] An Efficient Lookup Search and Forwarding Mechanism for Information-Centric Networking (ICN)
    Kumari Nidhi Lal
    Anoj Kumar
    [J]. Arabian Journal for Science and Engineering, 2018, 43 : 6849 - 6861