{"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}
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.