一种有效的内容搜索方案，以扩大以内容为中心的网络的搜索范围

2015 11th International Conference on the Design of Reliable Communication Networks (DRCN) Pub Date : 2015-03-24 DOI:10.1109/DRCN.2015.7148988

Yurino Sato, T. Kawano, H. Koga

{"title":"一种有效的内容搜索方案，以扩大以内容为中心的网络的搜索范围","authors":"Yurino Sato, T. Kawano, H. Koga","doi":"10.1109/DRCN.2015.7148988","DOIUrl":null,"url":null,"abstract":"Our proposed content search scheme expands the search range so that content can be obtained from caches on routers not on the default path in CCN. Simulations have indicated that this scheme can drastically reduce the number of hops needed to obtain content within a limited search range. In our future work, we will consider effective ways to control the search range according to content popularity.","PeriodicalId":123545,"journal":{"name":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An efficient content search scheme to expand the search range in content-centric networking\",\"authors\":\"Yurino Sato, T. Kawano, H. Koga\",\"doi\":\"10.1109/DRCN.2015.7148988\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Our proposed content search scheme expands the search range so that content can be obtained from caches on routers not on the default path in CCN. Simulations have indicated that this scheme can drastically reduce the number of hops needed to obtain content within a limited search range. In our future work, we will consider effective ways to control the search range according to content popularity.\",\"PeriodicalId\":123545,\"journal\":{\"name\":\"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)\",\"volume\":\"98 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-03-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DRCN.2015.7148988\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DRCN.2015.7148988","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

我们提出的内容搜索方案扩展了搜索范围，以便可以从不在CCN默认路径上的路由器上的缓存中获取内容。仿真结果表明，该方案可以大大减少在有限搜索范围内获取内容所需的跳数。在未来的工作中，我们会根据内容的受欢迎程度考虑有效的方法来控制搜索范围。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An efficient content search scheme to expand the search range in content-centric networking

Our proposed content search scheme expands the search range so that content can be obtained from caches on routers not on the default path in CCN. Simulations have indicated that this scheme can drastically reduce the number of hops needed to obtain content within a limited search range. In our future work, we will consider effective ways to control the search range according to content popularity.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2015 11th International Conference on the Design of Reliable Communication Networks (DRCN)

自引率

0.00%

发文量