5 citations · 6 across the 14 of their papers we have counts for
20 papers
La ROUTOURNE va tourner
Quentin Bramas, Jean-Romain Luttringer, Pascal Mérindol
Segment routing (SR) offers precise control over the paths taken: it specifies a list of detours, called segments, in IP packets. However, the number of detours that can be specifi…
Stand-Up Indulgent Gathering on Rings
Quentin Bramas, Sayaka Kamei, Anissa Lamani +1
We consider a collection of robots that evolve in a ring-shaped network without common orientation, and address a variant of the crash-tolerant gathering problem called…
Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots
Quentin Bramas, Hirotsugu Kakugawa, Sayaka Kamei +4
We consider a strong variant of the crash fault-tolerant gathering problem called stand-up indulgent gathering (SUIG), by robots endowed with limited visibility sensors and lights…
A Simple and General Operational Framework to Deploy Optimal Routes with Source Routing
Quentin Bramas, Jean-Romain Luttringer, Pascal Mérindol
Source Routing, currently facilitated by Segment Routing (SR), enables precise control of forwarding paths by specifying detours (or segments) to deviate IP packets along routes wi…
Stand-Up Indulgent Gathering on Lines
Quentin Bramas, Sayaka Kamei, Anissa Lamani +1
We consider a variant of the crash-fault gathering problem called stand-up indulgent gathering (SUIG). In this problem, a group of mobile robots must eventually gather at a single…
Stand Up Indulgent Gathering
Quentin Bramas, Anissa Lamani, Sébastien Tixeuil
We consider a swarm of mobile robots evolving in a bidimensional Euclidean space. We study a variant of the crash-tolerant gathering problem: if no robot crashes, robots have to me…
Constrained Backward Time Travel Planning is in P
Quentin Bramas, Jean-Romain Luttringer, Sébastien Tixeuil
We consider transportation networks that are modeled by dynamic graphs, and introduce the possibility for traveling agents to use Backward Time-Travel (BTT) devices at any node to…
Efficient and Secure TSA for the Tangle
Quentin Bramas
The Tangle is the data structure used to store transactions in the IOTA cryptocurrency. In the Tangle, each block has two parents. As a result, the blocks do not form a chain, but…
Deploying Near-Optimal Delay-Constrained Paths with Segment Routing in Massive-Scale Networks
Jean-Romain Luttringer, Thomas Alfroy, Pascal Mérindol +3
With a growing demand for quasi-instantaneous communication services such as real-time video streaming, cloud gaming, and industry 4.0 applications, multi-constraint Traffic Engine…
A Fast-Convergence Routing of the Hot-Potato
Jean-Romain Luttringer, Quentin Bramas, Cristel Pelsser +1
Interactions between the intra- and inter-domain routing protocols received little attention despite playing an important role in forwarding transit traffic. More precisely, by def…
Computing Delay-Constrained Least-Cost Paths for Segment Routing is Easier Than You Think
Jean-Romain Luttringer, Thomas Alfroy, Pascal Mérindol +3
With the growth of demands for quasi-instantaneous communication services such as real-time video streaming, cloud gaming, and industry 4.0 applications, multi-constraint Traffic E…
Stand Up Indulgent Rendezvous
Quentin Bramas, Anissa Lamani, Sébastien Tixeuil
We consider two mobile oblivious robots that evolve in a continuous Euclidean space. We require the two robots to solve the rendezvous problem (meeting in finite time at the same l…
Stateless Distributed Ledgers
François Bonnet, Quentin Bramas, Xavier Défago
In public distributed ledger technologies (DLTs), such as Blockchains, nodes can join and leave the network at any time. A major challenge occurs when a new node joining the networ…
On the improvement of the in-place merge algorithm parallelization
Berenger Bramas, Quentin Bramas
In this paper, we present several improvements in the parallelization of the in-place merge algorithm, which merges two contiguous sorted arrays into one with an O(T) space complex…
Blockchain using Proof-of-Interaction
Jean-Philippe Abegg, Quentin Bramas, Thomas Noel
This paper we define a new Puzzle called Proof-of-Interaction and we show how it can replace, in the Bitcoin protocol, the Proof-of-Work algorithm.
Infinite Grid Exploration by Disoriented Robots
Quentin Bramas, Stephane Devismes, Pascal Lafourcade
We deal with a set of autonomous robots moving on an infinite grid. Those robots are opaque, have limited visibility capabilities, and run using synchronous Look-Compute-Move cycle…
Distributed Online Data Aggregation in Dynamic Graphs
Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil
We consider the problem of aggregating data in a dynamic graph, that is, aggregating the data that originates from all nodes in the graph to a specific node, the sink. We are inter…
Probabilistic Asynchronous Arbitrary Pattern Formation
Quentin Bramas, Sébastien Tixeuil
We propose a new probabilistic pattern formation algorithm for oblivious mobile robots that operates inthe ASYNC model. Unlike previous work, our algorithm makes no assumptions abo…
Packet Efficient Implementation of the Omega Failure Detector
Quentin Bramas, Dianne Foreback, Mikhail Nesterenko +1
We assume that a message may be delivered by packets through multiple hops and investigate the feasibility and efficiency of an implementation of the Omega Failure Detector under s…
The Random Bit Complexity of Mobile Robots Scattering
Quentin Bramas, Sébastien Tixeuil
We consider the problem of scattering robots in a two dimensional continuous space. As this problem is impossible to solve in a deterministic manner, all solutions must be prob…