Sébastien Tixeuil

Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks (2009)

We define and explore the concept of ideal stabilization. The program is ideally stabilizing if its every state is legitimate. Ideal stabilization allows the specification designer to prescribe with...

Bouzid, Zohir, Potop-Butucaru, Maria, Tixeuil, Sébastien

We propose the first deterministic algorithm that tolerates up to $f$ byzantine faults in $3f+1$-sized networks and performs in the asynchronous CORDA model. Our solution matches the previously...

Optimal byzantine resilient convergence in oblivious robot networks (2009)

Bouzid, Zohir, Potop-Butucaru, Maria, Tixeuil, Sébastien

Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, but unknown...

A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property (2009)

Blin, Lélia, Potop-Butucaru, Maria Gradinariu, Rovedakis, Stephane, Tixeuil, Sébastien

The minimum spanning tree (MST) construction is a classical problem in Distributed Computing for creating a globally minimized structure distributedly. Self-stabilization is versatile technique for...

Dynamic FTSS in Asynchronous Systems: the Case of Unison (2009)

Dubois, Swan, Potop-Butucaru, Maria, Tixeuil, Sébastien

Distributed fault-tolerance can mask the effect of a limited number of per- manent faults, while self-stabilization provides forward recovery after an arbitrary number of transient fault hit the...

Stabilizing Maximal Independent Set in Unidirectional Networks is Hard (2009)

Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots (2009)

A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the system recovers from this catastrophic situation without...

Devismes, Stéphane, Petit, Franck, Tixeuil, Sébastien

We consider a team of $k$ identical, oblivious, asynchronous mobile robots that are able to sense (\emph{i.e.}, view) their environment, yet are unable to communicate, and evolve on a constrained...

Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots (2009)

Devismes, Stéphane, Petit, Franck, Tixeuil, Sébastien

We consider a team of $k$ identical, oblivious, asynchronous mobile robots that are able to sense (\emph{i.e.}, view) their environment, yet are unable to communicate, and evolve on a constrained...

Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots (2009)

Devismes, Stéphane, Petit, Franck, Tixeuil, Sébastien

We consider a team of $k$ identical, oblivious, asynchronous mobile robots that are able to sense (\emph{i.e.}, view) their environment, yet are unable to communicate, and evolve on a constrained...

Stabilizing Maximal Independent Set in Unidirectional Networks is Hard (2009)

Stabilizing Maximal Independent Set in Unidirectional Networks is Hard (2009)

A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the system recovers from this catastrophic situation without...

Dynamic FTSS in Asynchronous Systems: the Case of Unison (2009)

A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the system recovers from this catastrophic situation without...

Dubois, Swan, Potop-Butucaru, Maria, Tixeuil, Sébastien

Distributed fault-tolerance can mask the effect of a limited number of per- manent faults, while self-stabilization provides forward recovery after an arbitrary number of transient fault hit the...

Dynamic FTSS in Asynchronous Systems: the Case of Unison (2009)

Dubois, Swan, Potop-Butucaru, Maria, Tixeuil, Sébastien

Distributed fault-tolerance can mask the effect of a limited number of per- manent faults, while self-stabilization provides forward recovery after an arbitrary number of transient fault hit the...

Sur le Coloriage Auto-stabilisant dans les Réseaux Unidirectionnels Anonymes (2009)

Bernard, Samuel, Devismes, Stéphane, Paroux, Katy, Tixeuil, Sébastien

Nous considérons des réseaux unidirectionnels anonymes. Nous démontrons que contrairement aux réseaux bidirectionnels, l'auto-stabilisation de tâches locales peut y être aussi difficile que...

A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property (2009)

Blin, Lélia, Rovedakis, Stephane, Tixeuil, Sébastien

The minimum spanning tree (MST) construction is a classical problem in Distributed Computing for creating a globally minimized structure distributedly. Self-stabilization is versatile technique for...

Exploration Optimale Probabiliste d'un Anneau \\par des Robots Semi-Synchrones et Amnésiques (2009)

Devismes, Stéphane, Petit, Franck, Tixeuil, Sébastien

Nous considérons une cohorte de $k$ robots mobiles identiques, amnésiques et semi-synchrones, capables de percevoir leur environnement mais pas de communiquer, qui évoluent sur des chemins...

Stabilisation instantanée dans les systèmes à passage de messages (2009)

Delaët, Sylvie, Devismes, Stéphane, Nesterenko, Mikhail, Tixeuil, Sébastien

Nous abordons le problème de la \emph{stabilisation instantanée} dans les systèmes répartis à passage de messages. Notre contribution est double. Tout d'abord, nous montrons que la stabilisation...

Sur le Coloriage Auto-stabilisant dans les Réseaux Unidirectionnels Anonymes (2009)

Bernard, Samuel, Devismes, Stéphane, Paroux, Katy, Tixeuil, Sébastien

Nous considérons des réseaux unidirectionnels anonymes. Nous démontrons que contrairement aux réseaux bidirectionnels, l'auto-stabilisation de tâches locales peut y être aussi difficile que...

A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-free Property (2009)

Blin, Lélia, Rovedakis, Stephane, Tixeuil, Sébastien

The minimum spanning tree (MST) construction is a classical problem in Distributed Computing for creating a globally minimized structure distributedly. Self-stabilization is versatile technique for...

Exploration Optimale Probabiliste d'un Anneau \\par des Robots Semi-Synchrones et Amnésiques (2009)

Devismes, Stéphane, Petit, Franck, Tixeuil, Sébastien

Nous considérons une cohorte de $k$ robots mobiles identiques, amnésiques et semi-synchrones, capables de percevoir leur environnement mais pas de communiquer, qui évoluent sur des chemins...

Stabilisation instantanée dans les systèmes à passage de messages (2009)

Delaët, Sylvie, Devismes, Stéphane, Nesterenko, Mikhail, Tixeuil, Sébastien

Nous abordons le problème de la \emph{stabilisation instantanée} dans les systèmes répartis à passage de messages. Notre contribution est double. Tout d'abord, nous montrons que la stabilisation...

Optimal byzantine resilient convergence in oblivious robot networks (2009)

Bouzid, Zohir, Potop-Butucaru, Maria, Tixeuil, Sébastien

Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, but unknown...

Optimal byzantine resilient convergence in oblivious robot networks (2009)

Bouzid, Zohir, Potop-Butucaru, Maria, Tixeuil, Sébastien

Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, but unknown...

Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks (2009)

Bouzid, Zohir, Potop-Butucaru, Maria, Tixeuil, Sébastien

We propose the first deterministic algorithm that tolerates up to $f$ byzantine faults in $3f+1$-sized networks and performs in the asynchronous CORDA model. Our solution matches the previously...

Optimal Byzantine Resilient Convergence in Asynchronous Robot Networks (2009)

Bouzid, Zohir, Potop-Butucaru, Maria, Tixeuil, Sébastien

We propose the first deterministic algorithm that tolerates up to $f$ byzantine faults in $3f+1$-sized networks and performs in the asynchronous CORDA model. Our solution matches the previously...

Ideal Stabilization (2009)

Ideal Stabilization (2009)

We define and explore the concept of ideal stabilization. The program is ideally stabilizing if its every state is legitimate. Ideal stabilization allows the specification designer to prescribe with...

Byzantine Convergence in Robots Networks: The Price of Asynchrony (2009)

We define and explore the concept of ideal stabilization. The program is ideally stabilizing if its every state is legitimate. Ideal stabilization allows the specification designer to prescribe with...

Bouzid, Zohir, Potop-Butucaru, Maria, Tixeuil, Sébastien

We study the convergence problem in fully asynchronous, uni-dimensional robot networks that are prone to Byzantine (i.e. malicious) failures. In these settings, oblivious anonymous robots with...

Byzantine Convergence in Robots Networks: The Price of Asynchrony (2009)

Bouzid, Zohir, Potop-Butucaru, Maria, Tixeuil, Sébastien

We study the convergence problem in fully asynchronous, uni-dimensional robot networks that are prone to Byzantine (i.e. malicious) failures. In these settings, oblivious anonymous robots with...

Optimal deterministic ring exploration with oblivious asynchronous robots (2009)

Lamani, Anissa, Potop-Butucaru, Maria, Tixeuil, Sébastien

We consider the problem of exploring an anonymous unoriented ring of size $n$ by $k$ identical, oblivious, asynchronous mobile robots, that are unable to communicate, yet have the ability to sense...

Optimal deterministic ring exploration with oblivious asynchronous robots (2009)

Lamani, Anissa, Potop-Butucaru, Maria, Tixeuil, Sébastien

We consider the problem of exploring an anonymous unoriented ring of size $n$ by $k$ identical, oblivious, asynchronous mobile robots, that are unable to communicate, yet have the ability to sense...

The Reduced Automata Technique for Graph Exploration Space Lower Bounds (2008)

Fraigniaud, Pierre, Ilcinkas, David, Rajsbaum, Sergio, Tixeuil, Sébastien

We consider the task of exploring graphs with anonymous nodes by a team of non-cooperative robots, modeled as finite automata. For exploration to be completed, each edge of the graph has to be...

Communication Efficiency in Self-stabilizing Silent Protocols (2008)

Devismes, Stéphane, Masuzawa, Toshimitsu, Tixeuil, Sébastien

Self-stabilization is a general paradigm to provide forward recovery capabilities to distributed systems and networks. Intuitively, a protocol is self-stabilizing if it is able to recover without...

Bounds for self-stabilization in unidirectional networks (2008)

Bernard, Samuel, Devismes, Stéphane, Tixeuil, Sébastien

A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the systems recovers from this catastrophic situation without...

Bounds for self-stabilization in unidirectional networks (2008)

Bernard, Samuel, Devismes, Stéphane, Tixeuil, Sébastien

A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the systems recovers from this catastrophic situation without...

Bounds for self-stabilization in unidirectional networks (2008)

Bernard, Samuel, Devismes, Stéphane, Potop-Butucaru, Maria Gradinariu, Tixeuil, Sébastien

A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the systems recovers from this catastrophic situation without...

Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks (2008)

Vora, Adnan, Nesterenko, Mikhail, Tixeuil, Sébastien, Delaët, Sylvie

The Sybil attack in unknown port networks such as wireless is not considered tractable. A wireless node is not capable of independently differentiating the universe of real nodes from the universe of...

Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks (2008)

Vora, Adnan, Nesterenko, Mikhail, Tixeuil, Sébastien, Delaët, Sylvie

The Sybil attack in unknown port networks such as wireless is not considered tractable. A wireless node is not capable of independently differentiating the universe of real nodes from the universe of...

Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks (2008)

Vora, Adnan, Nesterenko, Mikhail, Tixeuil, Sébastien, Delaët, Sylvie

The Sybil attack in unknown port networks such as wireless is not considered tractable. A wireless node is not capable of independently differentiating the universe of real nodes from the universe of...

Conflict Managers for Self-stabilization without Fairness Assumption (2008)

Gradinariu M, Paris Sud, Maria Gradinariu, Sébastien Tixeuil

In this paper, we specify the conflict manager abstraction. Informally, a conflict manager guarantees that any two neighboring nodes can not enter their critical simultaneously (safety), and that at...

A New Self-Stabilizing Maximal Matching Algorithm (2008)

Fredrik Manne, Morten Mjelde, Laurence Pilard, Sébastien Tixeuil, Thème Num, Fredrik Manne, ...

apport de recherche ISSN 0249-6399 ISRN INRIA/RR--6111--FR+ENG

A Self-Stabilizing Link-Coloring Protocol Resilient to Unbounded Byzantine Faults in Arbitrary Networks 1 (2008)

Paris Sud, Toshimitsu Masuzawa, Sébastien Tixeuil

Self-stabilizing protocols can tolerate any type and any number of transient faults. However, in general, self-stabilizing protocols provide no guarantee about their behavior against permanent...

Optimal Self-stabilizing Mutual Exclusion on Synchronous Rings (2008)

Paris Sud, Nicolas Hanusse, Sébastien Tixeuil

We propose several self-stabilizing protocols for unidirectional, anonymous, and uniform synchronous rings of arbitrary size, where processors communicate by exchanging messages. When the size of the...

Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs (2008)

Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs (2008)

This paper considers gossiping among mobile agents in graphs: agents move on the graph and have to disseminate their initial information to every other agent. We focus on self-stabilizing solutions...

Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs (2008)

This paper considers gossiping among mobile agents in graphs: agents move on the graph and have to disseminate their initial information to every other agent. We focus on self-stabilizing solutions...

Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs (2008)

This paper considers gossiping among mobile agents in graphs: agents move on the graph and have to disseminate their initial information to every other agent. We focus on self-stabilizing solutions...

Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs (2008)

This paper considers gossiping among mobile agents in graphs: agents move on the graph and have to disseminate their initial information to every other agent. We focus on self-stabilizing solutions...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

This paper considers gossiping among mobile agents in graphs: agents move on the graph and have to disseminate their initial information to every other agent. We focus on self-stabilizing solutions...

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Snap-Stabilization in Message-Passing Systems (2008)

Delaët, Sylvie, Devismes, Stéphane, Nesterenko, Mikhail, Tixeuil, Sébastien

In this paper, we tackle the open problem of snap-stabilization in message-passing systems. Snap-stabilization is a nice approach to design protocols that withstand transient faults. Compared to the...

Snap-Stabilization in Message-Passing Systems (2008)

Delaët, Sylvie, Devismes, Stéphane, Nesterenko, Mikhail, Tixeuil, Sébastien

In this paper, we tackle the open problem of snap-stabilization in message-passing systems. Snap-stabilization is a nice approach to design protocols that withstand transient faults. Compared to the...

Snap-Stabilization in Message-Passing Systems (2008)

Delaët, Sylvie, Devismes, Stéphane, Nesterenko, Mikhail, Tixeuil, Sébastien

In this paper, we tackle the open problem of snap-stabilization in message-passing systems. Snap-stabilization is a nice approach to design protocols that withstand transient faults. Compared to the...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables : Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables : Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Snap-Stabilization in Message-Passing Systems (2008)

Delaët, Sylvie, Devismes, Stéphane, Nesterenko, Mikhail, Tixeuil, Sébastien

In this paper, we tackle the open problem of snap-stabilization in message-passing systems. Snap-stabilization is a nice approach to design protocols that withstand transient faults. Compared to the...

Snap-Stabilization in Message-Passing Systems (2008)

Delaët, Sylvie, Devismes, Stéphane, Nesterenko, Mikhail, Tixeuil, Sébastien

In this paper, we tackle the open problem of snap-stabilization in message-passing systems. Snap-stabilization is a nice approach to design protocols that withstand transient faults. Compared to the...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs (2008)

Quiescence of Self-stabilizing Gossiping among Mobile Agents in Graphs (2008)

This paper considers gossiping among mobile agents in graphs: agents move on the graph and have to disseminate their initial information to every other agent. We focus on self-stabilizing solutions...

Bounds for self-stabilization in unidirectional networks (2008)

This paper considers gossiping among mobile agents in graphs: agents move on the graph and have to disseminate their initial information to every other agent. We focus on self-stabilizing solutions...

Bernard, Samuel, Devismes, Stéphane, Tixeuil, Sébastien

A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the systems recovers from this catastrophic situation without...

Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks (2008)

Vora, Adnan, Nesterenko, Mikhail, Tixeuil, Sébastien, Delaët, Sylvie

The Sybil attack in unknown port networks such as wireless is not considered tractable. A wireless node is not capable of independently differentiating the universe of real nodes from the universe of...

Bounds for self-stabilization in unidirectional networks (2008)

Bernard, Samuel, Devismes, Stéphane, Tixeuil, Sébastien

A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the systems recovers from this catastrophic situation without...

Universe Detectors for Sybil Defense in Ad Hoc Wireless Networks (2008)

Vora, Adnan, Nesterenko, Mikhail, Tixeuil, Sébastien, Delaët, Sylvie

The Sybil attack in unknown port networks such as wireless is not considered tractable. A wireless node is not capable of independently differentiating the universe of real nodes from the universe of...

Communication Efficiency in Self-stabilizing Silent Protocols (2008)

Devismes, Stéphane, Masuzawa, Toshimitsu, Tixeuil, Sébastien

Self-stabilization is a general paradigm to provide forward recovery capabilities to distributed systems and networks. Intuitively, a protocol is self-stabilizing if it is able to recover without...

Communication Efficiency in Self-stabilizing Silent Protocols (2008)

Devismes, Stéphane, Masuzawa, Toshimitsu, Tixeuil, Sébastien

Self-stabilization is a general paradigm to provide forward recovery capabilities to distributed systems and networks. Intuitively, a protocol is self-stabilizing if it is able to recover without...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Weak vs. Self vs. Probabilistic Stabilization (2007)

Devismes, Stéphane, Tixeuil, Sébastien, Yamashita, Masafumi

Self-stabilization is a strong property that guarantees that a network always resume correct behavior starting from an arbitrary initial state. Weaker guarantees have later been introduced to cope...

Deterministic Secure Positioning in Wireless Sensor Networks (2007)

Delaët, Sylvie, Mandal, Partha Sarathi, Rokicki, Mariusz, Tixeuil, Sébastien

Properly locating sensor nodes is an important building block for a large subset of wireless sensor networks (WSN) applications. As a result, the performance of the WSN degrades significantly when...

Deterministic Secure Positioning in Wireless Sensor Networks (2007)

Delaët, Sylvie, Mandal, Partha Sarathi, Rokicki, Mariusz, Tixeuil, Sébastien

Properly locating sensor nodes is an important building block for a large subset of wireless sensor networks (WSN) applications. As a result, the performance of the WSN degrades significantly when...

Deterministic Secure Positioning in Wireless Sensor Networks (2007)

Delaët, Sylvie, Mandal, Partha Sarathi, Rokicki, Mariusz, Tixeuil, Sébastien

Properly locating sensor nodes is an important building block for a large subset of wireless sensor networks (WSN) applications. As a result, the performance of the WSN degrades significantly when...

On the Self-stabilization of Mobile Robots in Graphs (2007)

On the Self-stabilization of Mobile Robots in Graphs (2007)

Self-stabilization is a versatile technique to withstand any transient fault in a distributed system. Mobile robots (or agents) are one of the emerging trends in distributed computing as they mimic...

On the Self-stabilization of Mobile Robots in Graphs (2007)

Self-stabilization is a versatile technique to withstand any transient fault in a distributed system. Mobile robots (or agents) are one of the emerging trends in distributed computing as they mimic...

Blin, Lélia, Potop-Butucaru, Maria Gradinariu, Tixeuil, Sébastien

Self-stabilization is a versatile technique to withstand any transient fault in a distributed system. Mobile robots (or agents) are one of the emerging trends in distributed computing as they mimic...

A New Self-Stabilizing Maximal Matching Algorithm (2007)

Manne, Fredrik, Mjelde, Morten, Pilard, Laurence, Tixeuil, Sébastien

The maximal matching problem has received considerable attention in the self-stabilizing community. Previous work has given different self-stabilizing algorithms that solves the problem for both the...

Auto-stabilisation Efficace (2007)

Vers l'auto-stabilisation des systèmes à grande échelle (2007)

Quand un système réparti est sujet à des défaillances transitoires qui modifient arbitrairement son état, il est crucial de pouvoir retrouver un comportement correct au bout d'un temps fini....

A New Self-Stabilizing Maximal Matching Algorithm (2007)

Vers l'auto-stabilisation des systèmes à grande échelle.

Manne, Fredrik, Mjelde, Morten, Pilard, Laurence, Tixeuil, Sébastien

The maximal matching problem has received considerable attention in the self-stabilizing community. Previous work has given different self-stabilizing algorithms that solves the problem for both the...

A New Self-Stabilizing Maximal Matching Algorithm (2007)

Manne, Fredrik, Mjelde, Morten, Pilard, Laurence, Tixeuil, Sébastien

The maximal matching problem has received considerable attention in the self-stabilizing community. Previous work has given different self-stabilizing algorithms that solves the problem for both the...

A New Self-Stabilizing Maximal Matching Algorithm (2007)

Manne, Fredrik, Mjelde, Morten, Pilard, Laurence, Tixeuil, Sébastien

The maximal matching problem has received considerable attention in the self-stabilizing community. Previous work has given different self-stabilizing algorithms that solves the problem for both the...

A New Self-Stabilizing Maximal Matching Algorithm (2007)

Manne, Fredrik, Mjelde, Morten, Pilard, Laurence, Tixeuil, Sébastien

The maximal matching problem has received considerable attention in the self-stabilizing community. Previous work has given different self-stabilizing algorithms that solves the problem for both the...

On the Self-stabilization of Mobile Robots in Graphs (2007)

On the Self-stabilization of Mobile Robots in Graphs (2007)

Self-stabilization is a versatile technique to withstand any transient fault in a distributed system. Mobile robots (or agents) are one of the emerging trends in distributed computing as they mimic...

Deterministic Secure Positioning in Wireless Sensor Networks (2007)

Self-stabilization is a versatile technique to withstand any transient fault in a distributed system. Mobile robots (or agents) are one of the emerging trends in distributed computing as they mimic...

Delaët, Sylvie, Mandal, Partha Sarathi, Rokicki, Mariusz, Tixeuil, Sébastien

Properly locating sensor nodes is an important building block for a large subset of wireless sensor networks (WSN) applications. As a result, the performance of the WSN degrades significantly when...

Deterministic Secure Positioning in Wireless Sensor Networks (2007)

Delaët, Sylvie, Mandal, Partha Sarathi, Rokicki, Mariusz, Tixeuil, Sébastien

Properly locating sensor nodes is an important building block for a large subset of wireless sensor networks (WSN) applications. As a result, the performance of the WSN degrades significantly when...

Weak vs. Self vs. Probabilistic Stabilization (2007)

Devismes, Stéphane, Tixeuil, Sébastien, Yamashita, Masafumi

Self-stabilization is a strong property that guarantees that a network always resume correct behavior starting from an arbitrary initial state. Weaker guarantees have later been introduced to cope...

Weak vs. Self vs. Probabilistic Stabilization (2007)

Devismes, Stéphane, Tixeuil, Sébastien, Yamashita, Masafumi

Self-stabilization is a strong property that guarantees that a network always resume correct behavior starting from an arbitrary initial state. Weaker guarantees have later been introduced to cope...

On the Self-stabilization of Mobile Robots in Graphs (2007)

Lélia Blin, Thème Num, Sébastien Tixeuil, Lélia Blin, ...

apport de recherche

Processes (2007)

Fabiola Greve, Sébastien Tixeuil, Π {p

} is the set of processes ◮ known network: Π is known to all processes ◮ unknown network: each p i knows Π i ⊂ Π

Discovering Network Topology in the Presence of Byzantine Faults (2006)

FAIL-MPI: How fault-tolerant is fault-tolerant MPI ? (2006)

We study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. We formally state the weak and strong versions of the problem. The weak version requires that either...

Hérault, Thomas, Hoarau, William, Lemarinier, Pierre, Rodriguez, Eric, Tixeuil, Sébastien

One of the topics of paramount importance in the development of Cluster and Grid middleware is the impact of faults since their occurrence probability in a Grid infrastructure and in large-scale...

FAIL-MPI: How fault-tolerant is fault-tolerant MPI ? (2006)

Hérault, Thomas, Hoarau, William, Lemarinier, Pierre, Rodriguez, Eric, Tixeuil, Sébastien

One of the topics of paramount importance in the development of Cluster and Grid middleware is the impact of faults since their occurrence probability in a Grid infrastructure and in large-scale...

Evaluating complex MAC protocols for sensor networks with APMC (2006)

Cadilhac, Michaël, Hérault, Thomas, Lassaigne, Richard, Peyronnet, Sylvain, Tixeuil, Sébastien

In this paper we present an analysis of a MAC (Medium Access Control) protocol for wireless sensor networks. The purpose of this protocol is to manage wireless media access by constructing a Time...

Evaluating complex MAC protocols for sensor networks with APMC (2006)

Cadilhac, Michaël, Hérault, Thomas, Lassaigne, Richard, Peyronnet, Sylvain, Tixeuil, Sébastien

In this paper we present an analysis of a MAC (Medium Access Control) protocol for wireless sensor networks. The purpose of this protocol is to manage wireless media access by constructing a Time...

FAIL-MPI: How fault-tolerant is fault-tolerant MPI ? (2006)

Hérault, Thomas, Hoarau, William, Lemarinier, Pierre, Rodriguez, Eric, Tixeuil, Sébastien

One of the topics of paramount importance in the development of Cluster and Grid middleware is the impact of faults since their occurrence probability in a Grid infrastructure and in large-scale...

Evaluating complex MAC protocols for sensor networks with APMC (2006)

Cadilhac, Michaël, Hérault, Thomas, Lassaigne, Richard, Peyronnet, Sylvain, Tixeuil, Sébastien

In this paper we present an analysis of a MAC (Medium Access Control) protocol for wireless sensor networks. The purpose of this protocol is to manage wireless media access by constructing a Time...

Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks (2006)

Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks (2006)

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 to coordinate actions of nodes...

Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks (2006)

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 to coordinate actions of nodes...

Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks (2006)

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 to coordinate actions of nodes...

Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks (2006)

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 to coordinate actions of nodes...

Vers l'auto-stabilisation des systèmes à grande échelle (2006)

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 to coordinate actions of nodes...

Vers l'auto-stabilisation des systèmes à grande échelle (2006)

Vers l'auto-stabilisation des systèmes à grande échelle.

Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks (2006)

Vers l'auto-stabilisation des systèmes à grande échelle.

Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks (2006)

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 to coordinate actions of nodes...

Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks (2006)

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 to coordinate actions of nodes...

Vers l'auto-stabilisation des systèmes à grande échelle (2006)

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 to coordinate actions of nodes...

The Reduced Automata Technique for Graph Exploration Space Lower Bounds (2006)

Vers l'auto-stabilisation des systèmes à grande échelle.

Fraigniaud, Pierre, Ilcinkas, David, Rajsbaum, Sergio, Tixeuil, Sébastien

We consider the task of exploring graphs with anonymous nodes by a team of non-cooperative robots, modeled as finite automata. For exploration to be completed, each edge of the graph has to be...

The Reduced Automata Technique for Graph Exploration Space Lower Bounds (2006)

Fraigniaud, Pierre, Ilcinkas, David, Rajsbaum, Sergio, Tixeuil, Sébastien

We consider the task of exploring graphs with anonymous nodes by a team of non-cooperative robots, modeled as finite automata. For exploration to be completed, each edge of the graph has to be...

An Overview of Existing Tools for Fault-Injection and Dependability Benchmarking in Grids", CoreGRID (2006)

Sébastien Tixeuil, Sébastien Tixeuil, William Hoarau, William Hoarau, Luis Silva, Luis Silva, ...

In this paper we review several existing tools for fault injection and dependability benchmarking in grids. We emphasis on the FAIL-FCI fault-injection software that has been developed in INRIA Grand...

Bounds on Topology Discovery in the Presence of Byzantine Faults (2006)

Sébastien Tixeuil

Abstract. This report is a companion to another technical report [3] to present the formal proofs that could not fit into the conference proceedings of this article [4] due to space limitations. In...

Self-stabilizing Philosophers with Generic Conflicts (2006)

Praveen Danturi, Mikhail Nesterenko, Sébastien Tixeuil

Abstract. We generalize the classic dining philosophers problem to separate the conflict and communication neighbors of each process. Communication neighbors may directly exchange information while...

Discovering network topology in the presence of Byzantine faults (2006)

Mikhail Nesterenko, Sébastien Tixeuil

Abstract. We study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. We formally state the weak and strong versions of the problem. The weak version requires...

Discovering network topology in the presence of Byzantine faults (2006)

Sébastien Tixeuil

Abstract. We study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. We formally state the weak and strong versions of the problem. The weak version requires...

Project no. FP6-004265 Benchmarking the OGSA-DAI Middleware (2006)

William Hoarau, Sébastien Tixeuil, Nuno Rodrigues, Décio Sousa, Luis Silva, William Hoarau, ...

One important contribution to the community that is developing Grid middleware is the definition and implementation of benchmarks and tools to assess the performance and dependability of Grid...

Fast Convergence in Self-stabilizing Wireless Networks. (2006)

Mitton, Nathalie, Fleury, Eric, Guérin-Lassous, Isabelle, Sericola, Bruno, Tixeuil, Sébastien

The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed systems, motivating designs that autonomously recover from transient faults and...

Fast Convergence in Self-stabilizing Wireless Networks. (2006)

Mitton, Nathalie, Fleury, Eric, Guérin-Lassous, Isabelle, Sericola, Bruno, Tixeuil, Sébastien

The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed systems, motivating designs that autonomously recover from transient faults and...

Space Lower Bounds for Graph Exploration via Reduced Automata (2005)

Fraigniaud, Pierre, Ilcinkas, David, Rajsbaum, Sergio, Tixeuil, Sébastien

We consider the task of exploring graphs with anonymous nodes by a team of non-cooperative robots modeled as finite automata. These robots have no \emph{a priori} knowledge of the topology of the...

Space Lower Bounds for Graph Exploration via Reduced Automata (2005)

Fraigniaud, Pierre, Ilcinkas, David, Rajsbaum, Sergio, Tixeuil, Sébastien

We consider the task of exploring graphs with anonymous nodes by a team of non-cooperative robots modeled as finite automata. These robots have no \emph{a priori} knowledge of the topology of the...

Self-Stabilizing Mutual Exclusion Under Arbitrary Scheduler (2004)

Datta, Ajoy K., Gradinariu, Maria, Tixeuil, Sébastien

A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate. The mutual exclusion problem is fundamental in...

Auto-stabilisation Efficace (2000)

Auto-stabilisation Efficace (2000)

Quand un système réparti est sujet à des défaillances transitoires qui modifient arbitrairement son état, il est crucial de pouvoir retrouver un comportement correct au bout d'un temps fini....

Auto-stabilisation Efficace (2000)

Quand un système réparti est sujet à des défaillances transitoires qui modifient arbitrairement son état, il est crucial de pouvoir retrouver un comportement correct au bout d'un temps fini....