A Lightweight Prefix-based Routing for Content-Centric Networking

被引:0
作者
Lee, Sung-Won [1 ]
Ha, Ji-Soo [2 ]
Ko, Young-Bae [1 ]
机构
[1] Ajou Univ, Grad Sch Informat & Commun, Suwon 441749, South Korea
[2] Ajou Univ, Dept Informat & Comp Engn, Suwon 441749, South Korea
来源
2013 FIFTH INTERNATIONAL CONFERENCE ON UBIQUITOUS AND FUTURE NETWORKS (ICUFN) | 2013年
基金
新加坡国家研究基金会;
关键词
Content-Centric Networking; Information-Centric Networking; Prefix-based Routing; Content-based Routing;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a lightweight prefix-based routing (LPR) for content-centric networking. In CCN, every communication with the named data is based on hierarchical naming convention and forwarding decision using the longest-prefix matching mechanism. However, there are no comprehensive researches on designing a general routing protocol over such a naming hierarchy. Our LPR scheme provides a lightweight management of routing table and Forwarding Information Base (FIB) table that manage a lower number of routes enough to perform the longest-prefix matching. Also, a method is proposed to cope with connections between CCN routers in different hierarchies. We evaluate the proposed LPR against the existing routing approaches and show that it leads to less control overhead and FIB size.
引用
收藏
页码:656 / 660
页数:5
相关论文
共 6 条
[1]  
Jacobson V., 2009, Proc. ACM CoNEXT
[2]  
Lee M., 2011, IEEE ICC, P1
[3]  
Liu H., 2012, ACM SIGCOMM WORKSHOP
[4]  
ZEGURA EW, 1996, IEEE INFOCOM
[5]  
Zhang L., 2010, NDN001
[6]  
Zhu Z., 2011, ACM SIGCOMM WORKSHOP