P2P网络中基于优先级策略的多跳BFS搜索算法研究

2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007) Pub Date : 2007-09-18 DOI:10.1109/NPC.2007.15

Zhe Chen, Shize Guo, Yixian Yang, K. Zheng

{"title":"P2P网络中基于优先级策略的多跳BFS搜索算法研究","authors":"Zhe Chen, Shize Guo, Yixian Yang, K. Zheng","doi":"10.1109/NPC.2007.15","DOIUrl":null,"url":null,"abstract":"Peer-to-Peer (P2P) network is a fast developing branch of Computer Science and many researchers are developing new algorithms for such systems. After the success of systems like Napster, Kazza, the use of such networks became a necessity. This paper analyses the reason of the redundant search packets in the area of resource discovery and search of the P2P system, details in the Multi-hop BFS algorithm and the apriority policy-based model, puts forward the apriority policy-based multi-hop BFS search algorithm and gives the correctness proof of APM-MHBFS.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Research of the Apriority Policy-based Multi-hop BFS Search Algorithm in P2P Network\",\"authors\":\"Zhe Chen, Shize Guo, Yixian Yang, K. Zheng\",\"doi\":\"10.1109/NPC.2007.15\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Peer-to-Peer (P2P) network is a fast developing branch of Computer Science and many researchers are developing new algorithms for such systems. After the success of systems like Napster, Kazza, the use of such networks became a necessity. This paper analyses the reason of the redundant search packets in the area of resource discovery and search of the P2P system, details in the Multi-hop BFS algorithm and the apriority policy-based model, puts forward the apriority policy-based multi-hop BFS search algorithm and gives the correctness proof of APM-MHBFS.\",\"PeriodicalId\":278518,\"journal\":{\"name\":\"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)\",\"volume\":\"90 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NPC.2007.15\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NPC.2007.15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

点对点(P2P)网络是计算机科学的一个快速发展的分支，许多研究人员正在为这种系统开发新的算法。在Napster、Kazza等系统获得成功之后，这种网络的使用成为一种必要。分析了P2P系统在资源发现和搜索领域中搜索包冗余的原因，详细介绍了多跳BFS算法和优先级策略模型，提出了基于优先级策略的多跳BFS搜索算法，并给出了APM-MHBFS的正确性证明。

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

查看原文本刊更多论文

Research of the Apriority Policy-based Multi-hop BFS Search Algorithm in P2P Network

Peer-to-Peer (P2P) network is a fast developing branch of Computer Science and many researchers are developing new algorithms for such systems. After the success of systems like Napster, Kazza, the use of such networks became a necessity. This paper analyses the reason of the redundant search packets in the area of resource discovery and search of the P2P system, details in the Multi-hop BFS algorithm and the apriority policy-based model, puts forward the apriority policy-based multi-hop BFS search algorithm and gives the correctness proof of APM-MHBFS.

求助全文

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

来源期刊

2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)

自引率

0.00%

发文量