结构化P2P系统中路由方案的仿真与分析

2008 ISECS International Colloquium on Computing, Communication, Control, and Management Pub Date : 2008-08-03 DOI:10.1109/CCCM.2008.241

Yinbo Cheng, X. Wen, Yong Sun

{"title":"结构化P2P系统中路由方案的仿真与分析","authors":"Yinbo Cheng, X. Wen, Yong Sun","doi":"10.1109/CCCM.2008.241","DOIUrl":null,"url":null,"abstract":"A number of routing schemes have been proposed to improve the lookup performance of distributed hash table (DHT). There are three representative routing schemes among existing DHTs: recursive routing, semi-recursive routing and iterative routing. To know which routing scheme is more efficient, this paper takes one of the most important DHTs -- Chord as an example to simulate the three representative routing schemes and discusses the effectiveness of them from the aspects of lookup latency, effect of churn and difficulty of NAT traversal. The simulations and analysis show that they have advantages in different situations.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Simulation and Analysis of Routing Schemes in Structured P2P System\",\"authors\":\"Yinbo Cheng, X. Wen, Yong Sun\",\"doi\":\"10.1109/CCCM.2008.241\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A number of routing schemes have been proposed to improve the lookup performance of distributed hash table (DHT). There are three representative routing schemes among existing DHTs: recursive routing, semi-recursive routing and iterative routing. To know which routing scheme is more efficient, this paper takes one of the most important DHTs -- Chord as an example to simulate the three representative routing schemes and discusses the effectiveness of them from the aspects of lookup latency, effect of churn and difficulty of NAT traversal. The simulations and analysis show that they have advantages in different situations.\",\"PeriodicalId\":326534,\"journal\":{\"name\":\"2008 ISECS International Colloquium on Computing, Communication, Control, and Management\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-08-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 ISECS International Colloquium on Computing, Communication, Control, and Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCCM.2008.241\",\"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 ISECS International Colloquium on Computing, Communication, Control, and Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCCM.2008.241","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

为了提高分布式哈希表(DHT)的查找性能，已经提出了许多路由方案。现有dht中有三种代表性的路由方案:递归路由、半递归路由和迭代路由。为了了解哪种路由方案效率更高，本文以最重要的dht之一Chord为例，对三种具有代表性的路由方案进行了仿真，并从查找延迟、流失影响和NAT遍历难度等方面对它们的有效性进行了讨论。仿真和分析表明，它们在不同情况下都具有优势。

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

查看原文本刊更多论文

Simulation and Analysis of Routing Schemes in Structured P2P System

A number of routing schemes have been proposed to improve the lookup performance of distributed hash table (DHT). There are three representative routing schemes among existing DHTs: recursive routing, semi-recursive routing and iterative routing. To know which routing scheme is more efficient, this paper takes one of the most important DHTs -- Chord as an example to simulate the three representative routing schemes and discusses the effectiveness of them from the aspects of lookup latency, effect of churn and difficulty of NAT traversal. The simulations and analysis show that they have advantages in different situations.

求助全文

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

来源期刊

2008 ISECS International Colloquium on Computing, Communication, Control, and Management

自引率

0.00%

发文量