检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:齐卫宁[1] 王劲林[1] QI Weining WANG Jinlin(National Network New Media Engineering Research Center, Chinese Academy of Sciences, Beijing, 100190, China)
机构地区:[1]中国科学院声学研究所国家网络新媒体工程技术中心,北京100190
出 处:《网络新媒体技术》2017年第1期1-6,共6页Network New Media Technology
基 金:中国科学院战略性先导科技专项课题:未来网络架构研究与边缘设备研制;(编号:XDA06010302)
摘 要:在内容中心网络(CCN)中,内容的名字作为转发和路由的依据。以名字代替IP地址解决了IP地址有限、扩展性差的问题,但是引发了命名空间无限性与路由表空间有限性之间的矛盾。本文提出了一种按需的距离矢量路由协议。当路由器有到所需内容的路由表项时,无需产生任何开销。当路由器收到一个新的兴趣分组而没有对应的路由表项时,该兴趣分组将触发路由发现过程。缓存有相应内容的路由器或者有有效路径的路由器都可以通过路由应答消息终止路由发现过程。仿真结果和planetlab上的实验结果均表明,该路由协议在端到端延迟和开销方面性能较好。In Content- centric network (CCN), maintaining routes to all contents is unnecessary and very difficult, and routing and scalability problems are usually concerned. To address these problems, we propose a CCN routing protocol in this paper. First, it is an on - demand routing protocol. It does not produce any route item and control overhead as long as the routers have valid routes to the content. An Interest for a new content triggers a route discovery process by transmitting a route request merged in the Interest. A route can be determined by unicasting a route reply to the consumer when the route request reaches either the provider itself, or an intermedi- ate router with a valid route to the content provider. Second, a hierarchical name mechanism is designed. With containment relation- ship in different hierarchies for content, it assists routers to reduce route discovery frequencies and to compress route items in route ta- bles when a route request hits a provider with more integral content. Experiments done on planet - lab show that it is efficient in terms of end- to- end delay and control overhead.
分 类 号:TN915.04[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:52.14.184.10