<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:contributor>Pedone, Fernando</dc:contributor>
  <dc:creator>Coelho, Paulo</dc:creator>
  <dc:date>2019-05-06</dc:date>
  <dc:description xmlns:ns0="xml" ns0:lang="en">Many current online services need to serve clients distributed across geographic areas. Coordinating highly available and  scalable geographically distributed replicas, however, is challenging. While State Machine Replication is the most direct way of  achieving availability, no scalability comes from the traditional approach. Typically, scalability is obtained by partitioning the  original application state among groups of servers, which leads to further challenges. Atomic multicast is a group  communication abstraction that groups processes, providing reliability and ordering guarantees, and can be explored to  provide partially replicated applications a scalable and consistent alternative. This work confronts the challenges of providing  practical group communication abstractions for crash fault-tolerant and Byzantine fault-tolerant (BFT) models. Although there  are plenty of atomic multicast algorithms that tolerate crash failures, they suffer from two major issues: (a) high latency for  messages addressed to multiple groups, and (b) low performance when proportion of messages to multiple groups is high. To  solve the first problem and reduce the latency of multi-group messages, this work presents FastCast, an algorithm with  unprecedented four communication delays. The second problem can be addressed by maximizing the proportion of single- group messages and eliminating additional communication among groups to execute operations. In this direction, this  document introduces GeoPaxos, a protocol that partitions the ordering of operations like atomic multicast while still keeping  the state fully replicated. In the BFT model, the task is more challenging, since servers can behave arbitrarily. This thesis  presents ByzCast, the first algorithm that tolerates Byzantine failures. ByzCast is hierarchical and introduces a new class of  atomic multicast defined as partially genuine. Lastly, since at the very core of most strong consistent replicated system resides  a consensus protocol, the thesis concludes with Kernel Paxos, a Paxos implementation provided as a loadable kernel module,  providing at the same time high performance, and abstracting ordering from the application execution.</dc:description>
  <dc:format>application/pdf</dc:format>
  <dc:identifier>https://localhost:5000/ark:/12658/srd1319040</dc:identifier>
  <dc:identifier>https://susi.usi.ch/global/documents/319040</dc:identifier>
  <dc:identifier>https://susi.usi.ch/documents/319040/files/2019INFO004.pdf</dc:identifier>
  <dc:language>eng</dc:language>
  <dc:relation>info:eu-repo/semantics/altIdentifier/urn/urn:nbn:ch:rero-006-118466</dc:relation>
  <dc:relation>info:eu-repo/semantics/altIdentifier/ark/12658/srd1319040</dc:relation>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>License undefined</dc:rights>
  <dc:subject xmlns:ns1="xml" ns1:lang="en">Distributed systems</dc:subject>
  <dc:subject xmlns:ns2="xml" ns2:lang="en">Group communication</dc:subject>
  <dc:subject xmlns:ns3="xml" ns3:lang="en">Atomic multicast</dc:subject>
  <dc:subject xmlns:ns4="xml" ns4:lang="en">Consensus</dc:subject>
  <dc:subject xmlns:ns5="xml" ns5:lang="en">State machine replication</dc:subject>
  <dc:subject>info:eu-repo/classification/udc/004</dc:subject>
  <dc:title xmlns:ns6="xml" ns6:lang="en">On the many faces of atomic multicast</dc:title>
  <dc:type>http://purl.org/coar/resource_type/c_db06</dc:type>
</oai_dc:dc>
