BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Asynchronous Convergence of Policy-Rich Distributed Bellman-Ford R
 outing Protocols - Timothy Griffin (University of Cambridge)\, Matthew Dag
 gitt
DTSTART:20180814T121500Z
DTEND:20180814T124500Z
UID:TALK107446@talks.cam.ac.uk
CONTACT:Gemma Gordon
DESCRIPTION:Several modern day routing protocols suffer from convergence p
 roblems. This talk will explain the algebraic approach to routing protocol
  design that allows one to reason about the behaviour of whole families of
  routing protocols at the same time. The talk will then discuss the algebr
 aic conditions sufficient to guarantee desirable convergence guarantees fo
 r the protocol. In particular we take the "strictly increasing" condition 
 of Sobrinho and show that several new results for distance and path-vector
  protocols including a weaker asynchronous model and a guarantee of a uniq
 ue final state. Finally\, the talk will discuss how the results have been 
 fully formalised in the Agda theorem prover and the resulting library is p
 ublicly available for others to use and extend.\n\nPaper: https://dl.acm.o
 rg/authorize.cfm?key=N666832.
LOCATION:Computer Laboratory\, William Gates Building\, Room FW11
END:VEVENT
END:VCALENDAR