Please use this identifier to cite or link to this item:
Type: Artigo de Evento
Title: Ridge: High-throughput, Low-latency Atomic Multicast
Author: Bezerra C.E.
Cason D.
Pedone F.
Abstract: It has been shown that the highest throughput for broadcasting messages in a point-To-point network is achieved with a ring topology. Although several ring-based group communication protocols have benefited from this observation, broadcasting messages along a ring overlay may lead to high latencies: In a system with n processes, at least n-1 communication steps are necessary for all processes to deliver a message. In this work, we argue that it is possible to reach optimal throughput without resorting to a ring topology (or to ip-multicast, typically unavailable in wide-Area networks). This can be done by routing messages through different paths, while carefully using the available bandwidth at each process, resulting in a significantly lower latency for every message (potentially a single communication step). Based on this idea, we propose Ridge, a Paxos-based atomic multicast protocol where each message is initially forwarded to a single destination, the distributor, whose responsibility is to propagate the message to all other destinations. To utilize all bandwidth available in the system, processes alternate in the role of distributor. By doing this, the maximum system throughput matches that of ring-based protocols, with a latency that is not significantly dependent on the size of the system. Finally, we show that Ridge can also deliver messages optimistically, with even lower latency. © 2015 IEEE.
Subject: Atomic Multicast
Fault - Tolerance
Editor: IEEE Computer Society
Citation: Proceedings Of The Ieee Symposium On Reliable Distributed Systems. Ieee Computer Society, v. 2016-January, p. 256 - 265, 2016.
Rights: fechado
Identifier DOI: 10.1109/SRDS.2015.13
Date Issue: 2016
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
2-s2.0-84960955249.pdf249.15 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.