BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260625T105811Z
UID:Seminar-networks-641@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Giorgos Christodoulou:MAILTO:G.Christodoulou@liverpool.ac.uk
DTSTART:20180531T140000
DTEND:20180531T150000
SUMMARY:Networks and Distributed Computing Series
DESCRIPTION:Dr Giuseppe Di Luna: Gathering in dynamic ring\n\nThanks to wireless communication technologies networks that continuously and frequently change their topologies are a reality. An example is a p2p network made with mobile smartphones. Such networks can be modelled using the formalism of time-varying graphs. The study of time-varying graphs has been, and it still is, a hot research topic.\n\nIn this talk we will focus on the specific application of Gathering. In the Gathering problem a set of mobile agents, initially dispersed on arbitrary locations, has to regroup on the same node. We consider weak agents that have only local view and are oblivious of network changes. We will discuss the Gathering problem on dynamic rings, investigating how and when our agents can solve the problem. We will show that the agreement on common orientation and the ability to detect agents crossing on edges are key assumptions that modify the solvability landscape of Gathering.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=641
LOCATION:
END:VEVENT
END:VCALENDAR