.png){kind=icon}
返回
Radient: Scalable, memory efficient name lookup algorithm for named data networking
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jnca.2015.12.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Named Data Networking (NDN) aims to discard the existing host-centric networking paradigm just to replace it with a more practical Content-Centric Networking (CCN) paradigm. CCN allows users to fetch and distribute contents directly using their names. NDN router stores all incoming content requests ('/'-delimited string components) in the Pending Interest Table (PIT) until they are satisfied. Multiple requests for the same content are merged in a single PIT entry and when the requested content is available, it is forwarded simultaneously to all the requesters. Although NDN has several benefits over the existing IP-based network, replacing IP addresses with names increases memory consumption and lookup cost. One possible way to restrict memory usage is to use name encoding, i.e., to encode identical components of a name with a unique integer. In this paper, we proposed a novel memory efficient name encoding scheme (called, Radient) for PIT and evaluated it extensively. Our results show that the Radient scheme can reduce memory consumption by 35.45% compared to the ENPT for 29 million names. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Named data networking (NDN)
Name encoding
Pending interest table (PIT)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8
论文数:
3.6K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
查看更多内容