利用弦叠加中的幂律节点度分布

2009 Next Generation Internet Networks Pub Date : 2009-07-01 DOI:10.1109/NGI.2009.5175761

S. Ktari, A. Hecker, H. Labiod

{"title":"利用弦叠加中的幂律节点度分布","authors":"S. Ktari, A. Hecker, H. Labiod","doi":"10.1109/NGI.2009.5175761","DOIUrl":null,"url":null,"abstract":"In this paper, we propose to extend the topology of Chord to a bidirectional graph to provide a super-peer based lookup algorithm and a scalable broadcast search support. We consider routing algorithms for a bidirectional variant of Chord network and show how the resulting structure extends the search region and provides an efficient resource lookup service at a very little additional cost.","PeriodicalId":162766,"journal":{"name":"2009 Next Generation Internet Networks","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Exploiting Power-Law Node Degree Distribution in Chord Overlays\",\"authors\":\"S. Ktari, A. Hecker, H. Labiod\",\"doi\":\"10.1109/NGI.2009.5175761\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose to extend the topology of Chord to a bidirectional graph to provide a super-peer based lookup algorithm and a scalable broadcast search support. We consider routing algorithms for a bidirectional variant of Chord network and show how the resulting structure extends the search region and provides an efficient resource lookup service at a very little additional cost.\",\"PeriodicalId\":162766,\"journal\":{\"name\":\"2009 Next Generation Internet Networks\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Next Generation Internet Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NGI.2009.5175761\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Next Generation Internet Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NGI.2009.5175761","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

在本文中，我们提出将Chord的拓扑扩展为双向图，以提供基于超级对等的查找算法和可扩展的广播搜索支持。我们考虑了Chord网络的双向变体的路由算法，并展示了结果结构如何扩展搜索区域，并以很少的额外成本提供有效的资源查找服务。

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

查看原文本刊更多论文

Exploiting Power-Law Node Degree Distribution in Chord Overlays

In this paper, we propose to extend the topology of Chord to a bidirectional graph to provide a super-peer based lookup algorithm and a scalable broadcast search support. We consider routing algorithms for a bidirectional variant of Chord network and show how the resulting structure extends the search region and provides an efficient resource lookup service at a very little additional cost.

求助全文

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

来源期刊

2009 Next Generation Internet Networks

自引率

0.00%

发文量