一个新的点对点网络

Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07) Pub Date : 2007-03-19 DOI:10.1109/PERCOMW.2007.9

Hovhannes A. Harutyunyan, Junlei He

{"title":"一个新的点对点网络","authors":"Hovhannes A. Harutyunyan, Junlei He","doi":"10.1109/PERCOMW.2007.9","DOIUrl":null,"url":null,"abstract":"In this paper we propose a new peer-to-peer network based on Knodel graphs Wd,n of even order n and degree d, where 1 les d les lfloorlog2nrfloor. We then present routing algorithms in the P2P network based on the Knodel graph. The algorithm takes advantage of the routing heuristics in the Knodel graph and reduces the routing length of the P2P network by half. This P2P network can be configured flexibly to be based on the partial Knodel graph, where each peer is connected to the selected dimensions, thus decrease the size of the routing table with trading off the routing length. The applications may choose the configuration according to the computing ability of the peers and other requirements","PeriodicalId":352348,"journal":{"name":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A New Peer-to-Peer Network\",\"authors\":\"Hovhannes A. Harutyunyan, Junlei He\",\"doi\":\"10.1109/PERCOMW.2007.9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we propose a new peer-to-peer network based on Knodel graphs Wd,n of even order n and degree d, where 1 les d les lfloorlog2nrfloor. We then present routing algorithms in the P2P network based on the Knodel graph. The algorithm takes advantage of the routing heuristics in the Knodel graph and reduces the routing length of the P2P network by half. This P2P network can be configured flexibly to be based on the partial Knodel graph, where each peer is connected to the selected dimensions, thus decrease the size of the routing table with trading off the routing length. The applications may choose the configuration according to the computing ability of the peers and other requirements\",\"PeriodicalId\":352348,\"journal\":{\"name\":\"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-03-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PERCOMW.2007.9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PERCOMW.2007.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

本文提出了一种新的点对点网络，该网络基于偶阶n次d的Knodel图Wd,n，其中1阶为lfloorlog2nrfloor。然后，我们提出了基于Knodel图的P2P网络路由算法。该算法利用了诺德尔图中的路由启发式算法，将P2P网络的路由长度缩短了一半。这种P2P网络可以灵活地配置为基于部分Knodel图，其中每个对等点都连接到选定的维度，从而在折衷路由长度的同时减少路由表的大小。应用程序可以根据对等体的计算能力和其他需求选择配置

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

查看原文本刊更多论文

A New Peer-to-Peer Network

In this paper we propose a new peer-to-peer network based on Knodel graphs Wd,n of even order n and degree d, where 1 les d les lfloorlog2nrfloor. We then present routing algorithms in the P2P network based on the Knodel graph. The algorithm takes advantage of the routing heuristics in the Knodel graph and reduces the routing length of the P2P network by half. This P2P network can be configured flexibly to be based on the partial Knodel graph, where each peer is connected to the selected dimensions, thus decrease the size of the routing table with trading off the routing length. The applications may choose the configuration according to the computing ability of the peers and other requirements

求助全文

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

来源期刊

Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07)

自引率

0.00%

发文量