Publication

Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures

Rachid Guerraoui
2009
Conference Papers

Abstract

We introduce a new theoretical model of ad hoc mobile computing in which agents have severely restricted memory, highly unpredictable movement and no initial knowledge of the system. Each agent’s memory can store O(1) bits, plus a unique identiﬁer, and O(1) other agents’ identiﬁers. Inputs are distributed across n agents, and all agents must converge to the correct output value. We give a universal construction that proves the model is surprisingly strong: It can solve any decision problem in NSPACE(n log n). Moreover, the construction is robust with respect to Byzantine failures of a constant number of agents.

Official source

https://infoscience.epfl.ch/entities/publication/69cea937-a827-4b0f-b0aa-9b330bc5fe8d

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures

Chat with Graph Search

Planetary-Scale Byzantine Fault Tolerance

An aircraft assembly process formalism and verification method based on semantic modeling and MBSE

Quartiers rhodaniens en transition