一种基于名字前缀长度的NDN路由查表算法
首发时间:2013-12-27
摘要:命名数据网络(Named Data Network, NDN)中信息对象取代IP网络中的主机成为了核心实体,其路由转发模型使用的转发信息库(Forwarding Information Base, FIB)中包含的条目在数量级和增速上都远超IP网络中的路由表;而且FIB中存储的是层级且可变长的内容名字前缀,与IP路由表中存储固定位数的主机地址前缀大不相同。因此传统的IP路由表查找算法无法适应NDN路由转发的需要。本文提出了一种适用于NDN的路由查表算法,在名字前缀长度空间内进行二分查找,平均及最坏查找次数为logW(W为待查找名字包含的名字单元数)。模拟实验结果表明,该算法应用于NDN中超大规模的路由表时表现出稳定、较好的运行效率。
For information in English, please click here
A Name Prefix Length Based Route Lookup Algorithm for NDN
Abstract:The core entity of named data network (NDN) is information object rather than host to IP network. Forwarding information base in NDN contains orders of magnitude more entries than IP routing table and has a much higher growth rate. Moreover, NDN names consisting of a series of delimited components are hierarchical and have variable lengths, which are different from IPv4/6 addresses and much longer, making fast name lookup a challenging issue. Traditional IP route lookup algorithms are no longer suitable for NDN. In this paper, we propose a name prefix length based route lookup algorithm for NDN, which performs a binary search in the name prefix length space, requiring an average and worst case time of logW lookups, with W being the number of components in a name. Simulation results demonstrate that the algorithm manifests stable and high performance when it is applied to super large-scale routing table in NDN.
Keywords: Computer network NDN Route Lookup
基金:
论文图表:
引用
No.****
同行评议
共计0人参与
勘误表
一种基于名字前缀长度的NDN路由查表算法
评论
全部评论0/1000