[Do not hesitate to forward to your colleagues, students...]
=============================================================================
CALL FOR PARTICIPATION
DGDC 2016 -- First Workshop on Dynamic Graphs in Distributed Computing
Workshop held in conjunction with DISC'16
Paris, September 30th, 2016
https://pages.lip6.fr/Swan.Dubois/DGDC/index.html
=============================================================================
WARNING ! Early registration soon ends: July, 21 !
http://www.disc-conference.org/wp/disc2016/registration/
=============================================================================
Mobile ad-hoc networks, sensor networks, or peer-to-peer systems are some
examples of distributed systems that share a very challenging property:
they
are dynamic in the sense that their underlying topology changes
unpredictably
with time. Due to the great development of such systems in many fields,
distributed computing practitioners must take dynamicity into account.
The challenge is that it is not sufficient to adapt existing solutions from
static systems due to the intrinsic nature of these systems, in which
dynamics
is not an exception. Even basic assumptions like the availability of
paths may
sometimes become irrelevant in highly-dynamic networks, leading to
reconsider
the meaning of basic tasks like election, broadcast, or routing.
From an algorithmic point of view, the first step is to correctly model
the
dynamicity of the underlying topology. In some cases, it can be
reformulated in
terms of classical properties (e.g. scheduling). However, numerous works
in the
field of distributed computing (and beyond) recently considered
graph-theoretical
approaches to capture various definitions of dynamics and their impact on
distributed computing.
The DGDC workshop precisely focuses on these dynamic graph models and
formalisms
and their implications in distributed computing. Topics of interest
include, but
are not limited to:
- New models or improvement of existing models of dynamic graphs
- Computability and/or complexity in distributed computing based on
dynamic graph assumptions
- Relations among dynamic graph properties and concepts
- Property testing in dynamic graphs
- Modelization and/or verification in dynamic systems
- Fault-tolerance in dynamic systems
List of invited speakers and title of their talks are available:
https://pages.lip6.fr/Swan.Dubois/DGDC/program.html
-------------------
Swan DUBOIS
DGDC co-organizer
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
