非结构化P2P网络覆盖中的分布式消息路由

M. Ciglarič, M. Pancur, M. Trampus, T. Vidmar
{"title":"非结构化P2P网络覆盖中的分布式消息路由","authors":"M. Ciglarič, M. Pancur, M. Trampus, T. Vidmar","doi":"10.1109/EURCON.2003.1248152","DOIUrl":null,"url":null,"abstract":"The paper presents an alternative message routing approach in unstructured peer-to-peer overlay networks. Unstructured peer-to-peer systems are loosely coupled, highly autonomous systems without hierarchy. Usually, flooding-based routing mechanisms are used for sending messages through the application layer overlay. Due to the limited scalability and high network load experiences, the paper suggests an improvement to reduce the traffic and overall performance: a peer remembers recently forwarded answers, so that he may route the next query messages with the same contents only to the relevant neighbor, not to all of them. Preliminary network simulations have shown promising results.","PeriodicalId":337983,"journal":{"name":"The IEEE Region 8 EUROCON 2003. Computer as a Tool.","volume":"279 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Distributed message routing in unstructured P2P network overlays\",\"authors\":\"M. Ciglarič, M. Pancur, M. Trampus, T. Vidmar\",\"doi\":\"10.1109/EURCON.2003.1248152\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper presents an alternative message routing approach in unstructured peer-to-peer overlay networks. Unstructured peer-to-peer systems are loosely coupled, highly autonomous systems without hierarchy. Usually, flooding-based routing mechanisms are used for sending messages through the application layer overlay. Due to the limited scalability and high network load experiences, the paper suggests an improvement to reduce the traffic and overall performance: a peer remembers recently forwarded answers, so that he may route the next query messages with the same contents only to the relevant neighbor, not to all of them. Preliminary network simulations have shown promising results.\",\"PeriodicalId\":337983,\"journal\":{\"name\":\"The IEEE Region 8 EUROCON 2003. Computer as a Tool.\",\"volume\":\"279 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The IEEE Region 8 EUROCON 2003. Computer as a Tool.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EURCON.2003.1248152\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The IEEE Region 8 EUROCON 2003. Computer as a Tool.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EURCON.2003.1248152","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种非结构化点对点覆盖网络中的备选消息路由方法。非结构化点对点系统是松散耦合的、高度自治的、没有层次结构的系统。通常,基于泛洪的路由机制用于通过应用层覆盖发送消息。由于有限的可扩展性和高网络负载经验,本文提出了一种改进方法来减少流量和整体性能:对等体记住最近转发的答案,以便他可以将具有相同内容的下一个查询消息路由到相关的邻居,而不是所有的邻居。初步的网络模拟显示了有希望的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Distributed message routing in unstructured P2P network overlays
The paper presents an alternative message routing approach in unstructured peer-to-peer overlay networks. Unstructured peer-to-peer systems are loosely coupled, highly autonomous systems without hierarchy. Usually, flooding-based routing mechanisms are used for sending messages through the application layer overlay. Due to the limited scalability and high network load experiences, the paper suggests an improvement to reduce the traffic and overall performance: a peer remembers recently forwarded answers, so that he may route the next query messages with the same contents only to the relevant neighbor, not to all of them. Preliminary network simulations have shown promising results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信