Home

Person

Seth Gilbert

This person is no longer with EPFL

About
Privacy
Disclaimer

Graph Chatbot

Related publications (38)

Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The impossibility of fault-tolerant set agreement in asynchronous networks is one of the seminal ...

Springer2009

The Wireless Synchronization Problem

Rachid Guerraoui, Seth Gilbert

In this paper, we study the wireless synchronization prob- lem which requires devices activated at different times on a congested single-hop radio network to synchronize their round numbering. We assume a collection of n synchronous devices with access to ...

2009

Online Topological Ordering

Seth Gilbert

2009

Self-Stabilizing Robot Formations over Unreliable Networks

Seth Gilbert

We describe how a set of mobile robots can arrange themselves on any specified curve on the plane in the presence of dynamic changes both in the underlying ad hoc network and in the set of participating robots. Our strategy is for the mobile robots to impl ...

2009

Reconfigurable Distributed Storage for Dynamic Networks

Seth Gilbert, Vincent Gramoli

This paper presents a new algorithm for implementing a reconfigurable distributed shared memory in an asynchronous dynamic network. The algorithm guarantees atomic consistency (linearizability) in all executions in the presence of arbitrary crash failures ...

2009

Interference-Resilient Information Exchange

Rachid Guerraoui, Seth Gilbert

This paper presents an efficient protocol for reliably exchanging information in a single-hop, multi-channel radio network subject to unpredictable interference. We model the interference by an adversary that can simultaneously disrupt up to t of the C ava ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Consensus and collision detectors in radio networks

Seth Gilbert

We consider the fault-tolerant consensus problem in radio networks with crash-prone nodes. Specifically, we develop lower bounds and matching upper bounds for this problem in single-hop radios networks, where all nodes are located within broadcast range of ...

2008

Extensible Encoding of Type Hierarchies

Rachid Guerraoui, Seth Gilbert

2008

Secure Communication Over Radio Channels

Rachid Guerraoui, Seth Gilbert

We study the problem of secure communication in a multi-channel, single-hop radio network with a malicious adversary that can cause collisions and spoof messages. We assume no pre-shared secrets or trusted-third-party infrastructure. The main contribution ...

2008

Self-Stabilizing Mobile Robot Formations with Virtual Nodes

Seth Gilbert

2008

On Fault Tolerance and Wireless Networks

Seth Gilbert

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2008

On the Complexity of Asynchronous Gossip

Rachid Guerraoui, Seth Gilbert

In this paper, we study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. In short, we show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. In the ...

2008

How to solve consensus in the smallest window of synchrony

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

This paper addresses the following question: what is the minimum-sized synchronous window needed to solve consensus in an otherwise asynchronous system? In answer to this question, we present the first optimally-resilient algorithm ASAP that solves consens ...

2008

Virtual Infrastructure for Collision-Prone Wireless Networks

Seth Gilbert

Wireless ad hoc networks pose several significant challenges: devices are unreliable; deployments are unpredictable; and communication is erratic. One proposed solution is Virtual Infrastructure, an abstraction in which unpredictable and unreliable devices ...

2008

Gossiping in a Multi-Channel Radio Network (An Oblivious Approach to Coping With Malicious Interference)

Rachid Guerraoui, Seth Gilbert

We study oblivious deterministic gossip algorithms for multi-channel radio networks with a malicious adversary. In a multi-channel network, each of the n processes in the system must choose, in each round, one of the c channels of the system on which to pa ...

Springer2007

On the Message Complexity of Indulgent Consensus

Rachid Guerraoui, Seth Gilbert

Many recommend planning for the worst and hoping for the best. In this paper we devise efficient indulgent consensus algorithms that can tolerate crash failures and arbitrarily long periods of asynchrony, and yet perform (asymptotically) optimally in well- ...

Springer2007

Of Malicious Motes and Suspicious Sensors

Rachid Guerraoui, Seth Gilbert

How efficiently can a malicious device disrupt communication in a wireless network? Imagine a basic game involving two honest players, Alice and Bob, who want to exchange information, and an adversary, Collin, who can disrupt communication using a limited ...

2006

Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks

Rachid Guerraoui, Seth Gilbert

How efficiently can a malicious device disrupt a single-hop wireless network? Imagine two honest players attempting to exchange information in the presence of a malicious adversary that can disrupt communication by jamming or overwriting messages. Assume t ...

2006

Page 2 of 2