BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Canopus and RCanopus: Scalable Consensus for Permissioned Blockcha
 ins - University of Waterloo
DTSTART:20190424T090000Z
DTEND:20190424T100000Z
UID:TALK123085@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:A critical problem with the consensus protocols underlying blo
 ckchains is that they do not scale well. As the number of transactions nee
 ding linearization increases\, network traffic from topology-oblivious bro
 adcasts can quickly overwhelm the network or a central coordinator. Thus\,
  achieving strong linearizabiilty is typically restricted to a handful of 
 participants\, or systems must resort to weaker forms of consensus\, such 
 as those using proof of work. To address this problem\, we propose Canopus
 \, a highly-parallel consensus protocol that exploits modern data center n
 etwork topology\, parallelism\, and consensus semantics to achieve scalabi
 lity. Our key insight is to make network communication patterns topology-a
 ware. In our prototype implementation\, Canopus achieves rates as high as 
 5m linearizable transactions/second over 21 nodes distributed across 7 dat
 acenters. I will also outline an extension\, Resilient Canopus\, that make
 s Canopus Byzantine Fault Tolerant as well as network partition tolerant.
LOCATION:Small Lecture Theatre\, Microsoft Research Ltd\, 21 Station Road\
 , Cambridge\, CB1 2FB
END:VEVENT
END:VCALENDAR