A5073883755- Distributed systems and fault tolerance
- Optimization and Search Problems
- Modular Robots and Swarm Intelligence
- Advanced Data Storage Technologies
- Parallel Computing and Optimization Techniques
- Caching and Content Delivery
- Age of Information Optimization
- Interconnection Networks and Systems
- Distributed Control Multi-Agent Systems
- Peer-to-Peer Network Technologies
- Mobile Ad Hoc Networks
- Cryptography and Data Security
- Mobile Agent-Based Network Management
- Cooperative Communication and Network Coding
- Distributed and Parallel Computing Systems
- Petri Nets in System Modeling
- Opportunistic and Delay-Tolerant Networks
- Energy Efficient Wireless Sensor Networks
- Robotic Path Planning Algorithms
- Software System Performance and Reliability
- Network Security and Intrusion Detection
- Real-Time Systems Scheduling
- Formal Methods in Verification
- DNA and Biological Computing
- Cloud Computing and Resource Management
Laboratoire de Recherche en Informatique de Paris 6
2015-2025
Centre National de la Recherche Scientifique
2016-2025
Sorbonne Université
2016-2025
Institut Universitaire de France
2014-2025
Sorbonne Paris Cité
2025
Maison Interuniversitaire des Sciences de l'Homme
2025
Laboratoire interdisciplinaire en études culturelles
2025
Sorbonne University Abu Dhabi
2023
Université Paris Cité
2001-2022
Technical University of Munich
2020
We study distributed coordination among autonomous mobile robots, focussing on the problem of gathering robots at a single location. The has been solved previously using deterministic algorithms even for that are anonymous, oblivious, disoriented, and operate in semi-synchronous ATOM model. However these solutions require all to be fault-free. recent results Agmon Peleg [1] show how gather correct when one may crash permanently. n-robot systems with f crashes any <; n. In such scenario, no...
We survey existing scheduling hypotheses made in the literature self-stabilization, commonly referred to under notion of daemon. show that four main characteristics (distribution, fairness, boundedness, and enabledness) are enough encapsulate various differences presented work. Our naming scheme makes it easy compare daemons particular classes, extend possibility or impossibility results new daemons. further examine daemon transformer schemes provide exact transformed those transformers our taxonomy.
In self-organizing systems, such as mobile ad-hoc and peer-to-peer networks, consensus is a fundamental building block to solve agreement problems. It contributes coordinate actions of nodes distributed in an manner order take consistent decisions. well known that classical environments, which entities behave asynchronously where identities are known, cannot be solved the presence even one process crash. appears systems less favorable because set identity participants not known. We define...
ABSTRACT We consider the network construction process by selfish players. Each player is associated with a vertex of communication graph and can simultaneously remove one incident edge add new edge. interested in subset players goal each to minimize average or maximum distance these Starting from given initial graph, sequence swaps generates an evolution graph. Due non‐uniform interest, this game may converge disconnected Nash equilibrium, which attain infinite social costs. In paper, we...
In this paper, we specify the conflict manager abstraction. Informally, a guarantees that any two nodes are in cannot enter their critical section simultaneously (safety), and at least one node is able to execute its (progress). The problem strictly weaker than classical local mutual exclusion problem, where requests eventually does so (fairness). We argue managers useful mechanism transform large class of self-stabilizing algorithms operate an essentially sequential model, into algorithm...