首页> 外文期刊>Peer-to-peer networking and applications >Pulp: An adaptive gossip-based dissemination protocol for multi-source message streams - Springer
【24h】

Pulp: An adaptive gossip-based dissemination protocol for multi-source message streams - Springer

机译:Pulp:用于多源消息流的基于自适应八卦的分发协议-Springer

获取原文
获取原文并翻译 | 示例
       

摘要

Gossip-based protocols provide a simple, scalable, and robust way to disseminate messages in large-scale systems. In such protocols, messages are spread in an epidemic manner. Gossiping may take place between nodes using push, pull, or a combination. Push-based systems achieve reasonable latency and high resilience to failures but may impose an unnecessarily large redundancy and overhead on the system. At the other extreme, pull-based protocols impose a lower overhead on the network at the price of increased latencies. A few hybrid approaches have been proposed—typically pushing control messages and pulling data—to avoid the redundancy of high-volume content and single-source streams. Yet, to the best of our knowledge, no other system intermingles push and pull in a multiple-senders scenario, in such a way that data messages of one help in carrying control messages of the other and in adaptively adjusting its rate of operation, further reducing overall cost and improving both on delays and robustness. In this paper, we propose an efficient generic push-pull dissemination protocol, Pulp, which combines the best of both worlds. Pulp exploits the efficiency of push approaches, while limiting redundant messages and therefore imposing a low overhead, as pull protocols do. Pulp leverages the dissemination of multiple messages from diverse sources: by exploiting the push phase of messages to transmit information about other disseminations, Pulp enables an efficient pulling of other messages, which themselves help in turn with the dissemination of pending messages. We deployed Pulp on a cluster and on PlanetLab. Our results demonstrate that Pulp achieves an appealing trade-off between coverage, message redundancy, and propagation delay.
机译:基于八卦的协议提供了一种简单,可扩展且健壮的方式来在大型系统中传播消息。在这样的协议中,消息以流行的方式传播。使用推,拉或组合可以在节点之间进行闲聊。基于推的系统可实现合理的延迟和对故障的高度恢复力,但可能会给系统带来不必要的大冗余和开销。在另一个极端,基于拉的协议以增加的延迟为代价在网络上施加了较低的开销。为了避免大量内容和单源流的冗余,已经提出了几种混合方法(通常是推送控制消息和提取数据)。然而,据我们所知,在多发送者场景中,没有其他系统会混合推拉,从而使一个消息的数据消息有助于携带另一个消息的控制消息并自适应地调整其操作速率。降低总体成本,同时提高延迟和稳定性。在本文中,我们提出了一种有效的通用推挽式传播协议Pulp,该协议结合了两个方面的优点。 Pulp充分利用了推方法的效率,同时限制了冗余消息,因此像拉协议一样,降低了开销。 Pulp充分利用了来自不同来源的多个消息的传播:通过利用消息的推送阶段来传输有关其他传播的信息,Pulp可以有效地提取其他消息,而这些消息本身又有助于传播挂起的消息。我们在集群和PlanetLab上部署了Pulp。我们的结果表明,Pulp在覆盖范围,消息冗余和传播延迟之间实现了吸引人的折衷。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号