一种加速热点资源查询的优化Chord算法

Jiajing Li, Xudong Yang
{"title":"一种加速热点资源查询的优化Chord算法","authors":"Jiajing Li, Xudong Yang","doi":"10.1109/ISCSCT.2008.351","DOIUrl":null,"url":null,"abstract":"Chord is the most essential and efficient peer-to-peer routing algorithm that, however, cannot reflect the hot resources problem in practical networks. To solve the problem, an optimized Chord algorithm has been put forward in this paper to accelerate locating the hot resources. The optimized Chord algorithm records the access time of resources and categories the resources into three classes. As for the class of hot resources, the optimized Chord would broadcast its location information and shorten its query hops. As a result, the average query hops would be shorter than the original Chord algorithm.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"81 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An Optimized Chord Algorithm for Accelerating the Query of Hot Resources\",\"authors\":\"Jiajing Li, Xudong Yang\",\"doi\":\"10.1109/ISCSCT.2008.351\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Chord is the most essential and efficient peer-to-peer routing algorithm that, however, cannot reflect the hot resources problem in practical networks. To solve the problem, an optimized Chord algorithm has been put forward in this paper to accelerate locating the hot resources. The optimized Chord algorithm records the access time of resources and categories the resources into three classes. As for the class of hot resources, the optimized Chord would broadcast its location information and shorten its query hops. As a result, the average query hops would be shorter than the original Chord algorithm.\",\"PeriodicalId\":228533,\"journal\":{\"name\":\"2008 International Symposium on Computer Science and Computational Technology\",\"volume\":\"81 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Computer Science and Computational Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCSCT.2008.351\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Computer Science and Computational Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCSCT.2008.351","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

Chord是最基本、最高效的点对点路由算法,但它不能反映实际网络中的热资源问题。为了解决这一问题,本文提出了一种优化的Chord算法来加速热资源的定位。优化后的Chord算法记录资源的访问时间,并将资源分为三类。对于热点资源类,优化后的Chord会广播其位置信息,缩短查询跳数。因此,平均查询跳数将比原始Chord算法短。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Optimized Chord Algorithm for Accelerating the Query of Hot Resources
Chord is the most essential and efficient peer-to-peer routing algorithm that, however, cannot reflect the hot resources problem in practical networks. To solve the problem, an optimized Chord algorithm has been put forward in this paper to accelerate locating the hot resources. The optimized Chord algorithm records the access time of resources and categories the resources into three classes. As for the class of hot resources, the optimized Chord would broadcast its location information and shorten its query hops. As a result, the average query hops would be shorter than the original Chord algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信