BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260913T092210Z
UID:Seminar-dept-342@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20140211T160000
DTEND:20140211T170000
SUMMARY:School Seminar Series
DESCRIPTION:Dr Ioannis Chatzigiannakis: Counting in Dynamic Networks\n\nCounting is a fundamental problem of every distributed system as it represents a basic building block to implement high level abstractions. In this talk we focus on synchronous distributed systems where the network topology constantly changes (dynamic network). Changes are driven by a powerful adversary that can look at internal process states and add and remove edges in order to contrast the convergence of the algorithm to the correct count. We look into the case where the processes belonging to the distributed system may be completely anonymous (i.e., they execute identical code) or they may be identified through a set of labels L={1, 2 ... k} (with 1 < k < n). We present a set of counting algorithms that are based on a technique that mimics an energy-transfer between network nodes.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=342
LOCATION:Ashton Lecture Theater
END:VEVENT
END:VCALENDAR