BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:589a53f6-d867-4f0b-b3bb-47bf0abc726a
X-WR-CALNAME:GT AlgoDist\, «FIFO and Atomic broadcast algorithms with bound
 ed message size for dynamic systems»\, Colette Johnen
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20251026T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20231029T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20241027T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20230326T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20240331T020000
RDATE:20250330T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:589a53f6-d867-4f0b-b3bb-47bf0abc726a
DTSTAMP:20260918T214559Z
CLASS:PUBLIC
DESCRIPTION:Colette Johnen (LaBRI)\n\nTitle: FIFO and Atomic broadcast algo
 rithms with bounded message size for dynamic systems\n\nAbstract:\n\n\nFIF
 O broadcast provides application ordering semantics of messages broadcast 
 by the same sender and have been mostly implemented on top of unreliable s
 tatic networks.\n\nA round-based FIFO broadcast algorithm with both termin
 ation detection and bounded message size for dynamic networks with recurre
 nt connectivity is presented. Initially\, processes only know the number o
 f processes N in the system and their identifier. Due to the dynamics of t
 he network links\, messages can be lost. The size of any message is bounde
 d to 2N+msgSize+O(log(N)) bits where msgSize is the bound size in bits of 
 the broadcast data.\n\nWe also present an FIFO atomic broadcast algorithm 
 that uses the proposed FIFO broadcast and deliver primitives.\n\n\n\nhttps
 ://algodist.labri.fr/index.php/Main/GT
DTSTART;TZID=Europe/Paris:20240214T110000
DTEND;TZID=Europe/Paris:20240214T120000
LOCATION:LaBRI salle 073 - lien visio https://webconf.u-bordeaux.fr/b/arn-4
 tr-7gp
SEQUENCE:0
SUMMARY:GT AlgoDist\, «FIFO and Atomic broadcast algorithms with bounded me
 ssage size for dynamic systems»\, Colette Johnen
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR