OMOlivier Marin

Olivier Marin

*This is an algorithmically generated author record based on publicly available information.

Olivier Marin has a total of 52 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Pushing Boundaries: Quantum-Enhanced Leader Election and the Limits of Consensus

    by Chandrashekar Radhakrishnan, Yuhang Zheng, Olivier Marin

    This work addresses the complexities involved in designing distributed quantum algorithms, highlighting that quantum entanglement does not bypass the Fischer-Lynch-Paterson (FLP) impossibility theorem in asynchronous networks. Although quantum resources such as entanglement offer potential speedups, the inherent constraints of classical communication remain. We develop a leader election algorithm as a proof of concept, demonstrating how entanglement can enhance efficiency while still contending with asynchronous delays. This algorithm serves as a foundation for a broader blueprint for future distributed quantum algorithms, providing insights into both the real performance gains and the limitations that entanglement offers in a distributed setting.

  • Open Access

    Towards Implementing ML-Based Failure Detectors

    by Xiaonan Li, Olivier Marin

    Most existing failure detection algorithms rely on statistical methods, and very few use machine learning (ML). This paper explores the viability of ML in the field of failure detection: is it possible to implement an ML-based detector that achieves a satisfactory quality of service? We implement a prototype that uses a basic long short-term memory neural network algorithm, and study its behavior with real traces. Although ML model has comparatively longer computing time, our prototype performs well in terms of accuracy and detection time.

  • Open Access

    ASCENT: A Provably Terminating Decentralized Logging Service

    by Xavier Bonnaire, Rudyar Cortés, Fabrice Kordon, Olivier Marin

    Building a certification authority that is both decentralized and fully reliable is impossible. However, the limitation thus imposed on scalability is unacceptable for many types of information systems, such as e-government services, which require an infrastructure able to support heavy computation loads while remaining highly reliable. Our scalable approach opts for the next best thing to full reliability: a certification authority with a probability of arbitrary failure so low that, in practice, false positives should never occur.

  • Open Access

    Probabilistic Byzantine Tolerance Scheduling in Hybrid Cloud Environments

    by Luciana Arantes, Roy Friedman, Olivier Marin, Pierre Sens

    This work explores scheduling challenges in providing probabilistic Byzantine fault tolerance in a hybrid cloud environment, consisting of nodes with varying reliability levels, compute power, and monetary cost. In this context, the probabilistic Byzantine fault tolerance guarantee refers to the confidence level that the result of a given computation is correct despite potential Byzantine failures. We formally define a family of such scheduling problems distinguished by whether they insist on meeting a given latency limit and trying to optimize the monetary budget or vice versa. For the case where the latency bound is a restriction and the budget should be optimized, we present several heuristic protocols and compare between them using extensive simulations.


  • Crowdsourcing-based architecture for post-disaster geolocation: A comparative performance evaluation

    by Florent Coriat, Anne Fladenmuller, Luciana Arantes, Olivier Marin

    In the aftermath of a natural or industrial disaster, locating individuals is crucial. However, disasters can cause extensive damage to the network infrastructures and a generalized loss of communication among survivors. In this article, we present a network support solution that provides a post-disaster geolocation-collecting service that relies on inter mobile device connections. On top of this dynamically built network, survivors' mobile devices exchange information about geolocation of others they have encountered. Such information is routed towards predefined data collection centers using either the DTN Epidemic or Spray and Wait DTN protocol. Experiments were conducted on the ONE simulator and performance evaluation results confirm the effectiveness of our proposal.


  • GeoTrie: A scalable architecture for location-temporal range queries over massive geotagged data sets

    by Rudyar Cortes, Xavier Bonnaire, Olivier Marin, Luciana Arantes, Pierre Sens

    The proliferation of GPS-enabled devices leads to the massive generation of geotagged data sets recently known as Big Location Data. It allows users to explore and analyse data in space and time, and requires an architecture that scales with the insertions and location-temporal queries workload from thousands to millions of users. Most large scale key-value data storage solutions only provide a single one-dimensional index which does not natively support efficient multidimensional queries. In this paper, we propose GeoTrie, a scalable architecture built by coalescing any number of machines organized on top of a Distributed Hash Table. The key idea of our approach is to provide a distributed global index which scales with the number of nodes and provides natural load balancing for insertions and location-temporal range queries. We assess our solution using the largest public multimedia data set released by Yahoo! which includes millions of geotagged multimedia files.


  • Towards Distributed Geolocation for Large Scale Disaster Management

    by Florent Coriat, Luciana Arantes, Olivier Marin, Anne Fladenmuller, Nicolas Hidalgo, Erika Rosas

    In the aftermath of major disasters such as earthquakes, locating individuals is crucial for passing on vital information, for example warnings and safety announcements. However, large scale disasters cause extensive damage to the network infrastructures and a generalized loss of communications in the chaos that ensues. This position paper presents a preliminary study for a geolocation service that relies on inter-device connections: mobile devices exchange positions of previously encountered devices when they come into contact. Every device thus builds a partial map of device locations and can use it to enforce geographic routing protocols that are resilient to large scale disasters.


  • Survey on Simulation for Mobile Ad-Hoc Communication for Disaster Scenarios

    by Erika Rosas, Nicolás Hidalgo, Veronica Gil-Costa, Carolina Bonacic, Mauricio Marin, Hermes Senger, Luciana Arantes, Cesar Marcondes, Olivier Marin


  • Mobility-aware DTN protocols for post-disaster scenarios

    by Erika Rosas, Felipe Garay, Nicolas Hidalgo, Olivier Marin

    Collecting and disseminating critical information in the direct aftermath of a disaster is very challenging: communication infrastructures are very likely to fail, and mobility becomes severely limited. Current solutions rely on traditional delay tolerant network (DTN) protocols amongst mobile devices to gather and relay vital data, but they induce an irreconcilable trade-off between delivery ratios and cost-efficiency. This paper proposes to combine protocols on every device: the mobility behavior of the device determines the routing protocol that it enforces. Simulations show that our hybrid approach minimizes message overhead and energy consumption whilst ensuring fair delivery ratios.


  • A Scalable Architecture for Spatio-Temporal Range Queries over Big Location Data

    by Rudyar Cortes, Olivier Marin, Xavier Bonnaire, Luciana Arantes, Pierre Sens

    Spatio-temporal range queries over Big Location Data aim to extract and analyze relevant data items generated around a given location and time. They require concurrent processing of massive and dynamic data flows. Current solutions for Big Location Data are ill-suited for continuous spatio-temporal processing because (i) most of them follow a batch processing model and (ii) they rely on spatial indexing structures maintained on a central master server. In this paper, we propose a scalable architecture for continuous spatio-temporal range queries built by coalescing multiple computing nodes on top of a Distributed Hash Table. The key component of our architecture is a distributed spatio-temporal indexing structure which exhibits low insertion and low index maintenance costs. We assess our solution with a public data set released by Yahoo! which comprises millions of geotagged multimedia files.