{"title":"基于有限多播的Chord算法","authors":"Shihui Duan, Jinlin Wang","doi":"10.1109/ICCEE.2008.18","DOIUrl":null,"url":null,"abstract":"Chord is known to be limited in routing efficiency since all nodes are on the overlay without considering the underlying network topology. In this paper, a Chord routing algorithm based on limited network layer multicast, called MChord, is proposed, which uses multicast technology to obtain physical neighbor information for routing. Simulation shows that it can shorten network search delay greatly, reduce routing hops effectively and improve the routing performance.","PeriodicalId":365473,"journal":{"name":"2008 International Conference on Computer and Electrical Engineering","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"MChord: Chord Algorithm Based on Limited Multicasting\",\"authors\":\"Shihui Duan, Jinlin Wang\",\"doi\":\"10.1109/ICCEE.2008.18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Chord is known to be limited in routing efficiency since all nodes are on the overlay without considering the underlying network topology. In this paper, a Chord routing algorithm based on limited network layer multicast, called MChord, is proposed, which uses multicast technology to obtain physical neighbor information for routing. Simulation shows that it can shorten network search delay greatly, reduce routing hops effectively and improve the routing performance.\",\"PeriodicalId\":365473,\"journal\":{\"name\":\"2008 International Conference on Computer and Electrical Engineering\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Conference on Computer and Electrical Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCEE.2008.18\",\"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 Conference on Computer and Electrical Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCEE.2008.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
MChord: Chord Algorithm Based on Limited Multicasting
Chord is known to be limited in routing efficiency since all nodes are on the overlay without considering the underlying network topology. In this paper, a Chord routing algorithm based on limited network layer multicast, called MChord, is proposed, which uses multicast technology to obtain physical neighbor information for routing. Simulation shows that it can shorten network search delay greatly, reduce routing hops effectively and improve the routing performance.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
