检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张建伟 王文倩 蔡增玉 Zhang Jianwei;Wang Wenqian;Cai Zengyu(School of Software,Zhengzhou University of Light Industry;School of Computer and Communication Engineering,Zhengzhou University of Light Industry,Zhengzhou 450002,China)
机构地区:[1]郑州轻工业大学软件学院 [2]郑州轻工业大学计算机与通信工程学院,河南郑州450002
出 处:《长江信息通信》2021年第6期93-95,105,共4页Changjiang Information & Communications
摘 要:针对内容中心网络(Content Centric Networking,CCN)中路由检索过程造成大量低效的冗余问题,进行了更深一层的研究,结合节点相似度、标签传播等方法,将CCN网络拓扑划分为多个社区。该方法首先将CCN网络中各个请求节点以及节点内容进行名字解析,以便获取用户的兴趣偏好,并将节点中影响力较高的节点作为社区核心节点,再将节点划分社区,实现内容快速缓存,有效地避免了CCN网络检索所造成的数据冗余问题,进一步提高整个网络速度,提高资源利用率,减少数据冗余。In this paper, aiming at the redundant problem of low efficiency caused by the route retrieval process in Content Centric Networking(CCN), a deeper research was conducted by combining the methods of Content similarity and tag propagation,the CCN network topology is divided into multiple communities. This method first resolves the name of each request node and the content of each node in CCN network, in order to obtain the user’s interests and preferences, and takes the node with higher influence as the core node of the community, and then divides the node into communities to achieve fast content caching, which effectively avoids the problem of data redundancy caused by CCN network retrieval, and further im-proves the speed of the whole content center network, improve resource utilization and reduce data redundancy.
分 类 号:TP393.02[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.119.122.164