P2P覆盖网络中的节能协议

A. Aikebaier, T. Enokido, M. Takizawa, S. Deen
{"title":"P2P覆盖网络中的节能协议","authors":"A. Aikebaier, T. Enokido, M. Takizawa, S. Deen","doi":"10.1109/ICDCSW.2010.47","DOIUrl":null,"url":null,"abstract":"The peer-to-peer (P2P) model is a fully distributed system which is composed of peer processes (peers) which cooperate with each other to achieve a common goal. Here, peers have to efficiently and flexibly make an agreement on one common value which satisfies an agreement condition. We discuss a novel approach to efficiently making an agreement where each peer sends a package of multiple possible values to the other peers at ongoing rounds. By exchanging multiple possible values at once, we can significantly reduce time and number of messages and increase the possibility to reach an agreement. We take advantage of the multipoint relaying (MPR) mechanism to reduce the number of messages to broadcast the messages. Here, if a peer which forwards messages to other peers is faulty, the peers cannot receive messages. In this paper, we newly discuss a broadcast scheme where only the trustworthy peers forward messages. Here, the transmission fault implied by faults of untrustworthy peers can be reduced.","PeriodicalId":133907,"journal":{"name":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","volume":"120 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Energy-Efficient Agreement Protocols in P2P Overlay Networks\",\"authors\":\"A. Aikebaier, T. Enokido, M. Takizawa, S. Deen\",\"doi\":\"10.1109/ICDCSW.2010.47\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The peer-to-peer (P2P) model is a fully distributed system which is composed of peer processes (peers) which cooperate with each other to achieve a common goal. Here, peers have to efficiently and flexibly make an agreement on one common value which satisfies an agreement condition. We discuss a novel approach to efficiently making an agreement where each peer sends a package of multiple possible values to the other peers at ongoing rounds. By exchanging multiple possible values at once, we can significantly reduce time and number of messages and increase the possibility to reach an agreement. We take advantage of the multipoint relaying (MPR) mechanism to reduce the number of messages to broadcast the messages. Here, if a peer which forwards messages to other peers is faulty, the peers cannot receive messages. In this paper, we newly discuss a broadcast scheme where only the trustworthy peers forward messages. Here, the transmission fault implied by faults of untrustworthy peers can be reduced.\",\"PeriodicalId\":133907,\"journal\":{\"name\":\"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops\",\"volume\":\"120 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDCSW.2010.47\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 30th International Conference on Distributed Computing Systems Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCSW.2010.47","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

点对点(P2P)模型是一个完全分布式的系统,它是由相互协作以实现共同目标的对等进程组成的。在这里,对等体必须有效而灵活地就一个满足协议条件的共同价值达成协议。我们讨论了一种有效达成协议的新方法,其中每个对等点在正在进行的回合中向其他对等点发送包含多个可能值的包。通过一次交换多个可能的值,我们可以大大减少消息的时间和数量,并增加达成协议的可能性。我们利用多点中继(MPR)机制来减少广播消息的数量。在这种情况下,如果向其他对等体转发消息的对等体出现故障,则其他对等体无法接收消息。本文讨论了一种只有可信节点转发消息的广播方案。这样可以减少由于不可信的对等体的错误所隐含的传输错误。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Energy-Efficient Agreement Protocols in P2P Overlay Networks
The peer-to-peer (P2P) model is a fully distributed system which is composed of peer processes (peers) which cooperate with each other to achieve a common goal. Here, peers have to efficiently and flexibly make an agreement on one common value which satisfies an agreement condition. We discuss a novel approach to efficiently making an agreement where each peer sends a package of multiple possible values to the other peers at ongoing rounds. By exchanging multiple possible values at once, we can significantly reduce time and number of messages and increase the possibility to reach an agreement. We take advantage of the multipoint relaying (MPR) mechanism to reduce the number of messages to broadcast the messages. Here, if a peer which forwards messages to other peers is faulty, the peers cannot receive messages. In this paper, we newly discuss a broadcast scheme where only the trustworthy peers forward messages. Here, the transmission fault implied by faults of untrustworthy peers can be reduced.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信