Search

Your search keyword '"Roberto Baldoni"' showing total 457 results
Start Over Author "Roberto Baldoni"
457 results on '"Roberto Baldoni"'

452. An Optimal Broadcast Algorithm for Content-Addressable Networks

Author

Ludovic Henrio, Fabrice Huet, Justine Rochas, Active objects, semantics, Internet and security (OASIS), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Inria, Roberto Baldoni, Maarten van Steen, Université Nice Sophia Antipolis (1965 - 2019) (UNS), and COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)

Subjects
Spanning tree, Computer science, Distributed computing, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Broadcast domain, 020206 networking & telecommunications, Context (language use), 02 engineering and technology, Peer-to-peer, computer.software_genre, Content addressable network, Atomic broadcast, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA], 020204 information systems, Broadcast communication network, 0202 electrical engineering, electronic engineering, information engineering, Broadcast radiation, computer
Abstract

International audience; Structured peer-to-peer networks are powerful underlying structures for communication and storage systems in large-scale setting. In the context of the Content-Addressable Network (CAN), this paper addresses the following challenge: how to perform an efficient broadcast while the local view of the network is restricted to a set of neighbours? In existing approaches, either the broadcast is inefficient (there are dupli- cated messages) or it requires to maintain a particular structure among neighbours, e.g. a spanning tree. We define a new broadcast primitive for CAN that sends a minimum number of messages while covering the whole network, without any global knowledge. Currently, no other al- gorithm achieves those two goals in the context of CAN. In this sense, the contribution we propose in this paper is threefold. First, we pro- vide an algorithm that sends exactly one message per recipient without building a global view of the network. Second, we prove the absence of duplicated messages and the coverage of the whole network when using this algorithm. Finally, we show the practical benefits of the algorithm throughout experiments.

Published
2013

453. Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)

Author

Baldoni, Roberto, Nisse, Nicolas, van Steen, Maarten, Middleware Laboratory (MIDLAB), Università degli Studi di Roma 'La Sapienza' = Sapienza University [Rome], Combinatorics, Optimization and Algorithms for Telecommunications (COATI), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-COMmunications, Réseaux, systèmes Embarqués et Distribués (Laboratoire I3S - COMRED), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (... - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA), Department of Computer Science [Amsterdam], Vrije Universiteit Amsterdam [Amsterdam] (VU), Roberto Baldoni and Nicolas Nisse and Maarten van Steen, Università degli Studi di Roma 'La Sapienza' = Sapienza University [Rome] (UNIROMA), Université Nice Sophia Antipolis (1965 - 2019) (UNS), and COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS)

Subjects
ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2013

454. α-Register

Author

Bonnin, David, Travers, Corentin, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), As Scalable As Possible: foundations of large scale dynamic distributed systems (ASAP), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Télécom Bretagne-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), and Roberto Baldoni and Nicolas Nisse and Maarten van Steen

Subjects
[INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Hardware_REGISTER-TRANSFER-LEVELIMPLEMENTATION
Abstract

International audience; It is well known that in an asynchronous message-passing system, one can emulate an atomic register providing that more than half of the processes are non-faulty. By contrast, when a majority of the processes may fail, simulating atomic register is not possible. This paper investigates weak variants of atomic registers that can be simulated tolerating a majority of processes failures. Specifically, the paper introduces a new class of registers, called α-register and shows how to emulate them. For atomic registers, a read operation returns the last written value when there is no concurrent write operations. α-registers generalize atomic registers in the following sense: In any interval I, at most α values written before I are returned by the read operations in I. A simulation of an α-register tolerating f failures in a n-processes system is presented for α = 2M −1, where M = max(1, 2f −n+2). The simulation is optimal up to a constant multiplicative factor: the paper establishes that α-registers cannot be simulated tolerating f failures if α ≤ M .

Published
2013

455. Eventual Leader Election in Evolving Mobile Networks

Author

Pierre Sens, Véronique Simon, Luciana Arantes, Fabíola Greve, Large-Scale Distributed Systems and Applications (Regal), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Computer Science Department [Bahía] (DCC), Universidade Federal da Bahia (UFBA), and Roberto Baldoni and Nicolas Nisse and Maarten van Steen

Subjects
020203 distributed computing, Leader election, Process (engineering), Computer science, Node (networking), dynamic networks, 0102 computer and information sciences, 02 engineering and technology, Computer security, computer.software_genre, 01 natural sciences, Fault-tolerant leader election, 010201 computation theory & mathematics, 0202 electrical engineering, electronic engineering, information engineering, Spite, asynchronous systems, Distributed services, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], process mobility, Set (psychology), Protocol (object-oriented programming), computer, Abstraction (linguistics)
Abstract

International audience; Many reliable distributed services rely on an eventual leader election to coordinate actions. The eventual leader detector has been proposed as a way to implement such an abstraction. It ensures that, eventually, each process in the system will be provided by an unique leader, elected among the set of correct processes in spite of crashes and uncertainties. A number of eventual leader election protocols were suggested. Nonetheless, as far as we are aware of, no one of these protocols tolerates a free pattern of node mobility. This paper proposes a new protocol for this scenario of dynamic and mobile unknown networks

Published
2013

456. Crash Resilient and Pseudo-Stabilizing Atomic Registers

Author

Swan Dubois, Shlomi Dolev, Maria Potop-Butucaru, Sébastien Tixeuil, Department of Computer Science [Beer-Sheva], Ben-Gurion University of the Negev (BGU), Laboratoire d'Informatique de Paris 6 (LIP6), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Large-Scale Distributed Systems and Applications (Regal), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Networks and Performance Analysis (NPA), Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Institut Universitaire de France (IUF), Ministère de l'Education nationale, de l’Enseignement supérieur et de la Recherche (M.E.N.E.S.R.), Laboratory of Information, Network and Communication Sciences (LINCS), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT), Roberto Baldoni and Paola Flocchini and Ravindran Binoy, and ANR-08-VERS-0015,SHAMAN,Architectures auto-* pour les réseaux adverses et malicieux(2008)

Subjects
Scheme (programming language), Linearizability, Computer science, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Fault tolerance, Crash, 0102 computer and information sciences, 02 engineering and technology, Parallel computing, 01 natural sciences, [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing, [INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], 010201 computation theory & mathematics, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Atomic register, Transient (computer programming), Message passing system, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], computer, computer.programming_language, Abstraction (linguistics)
Abstract

International audience; We propose a crash safe and pseudo-stabilizing algorithm for implementing an atomic memory abstraction in a message passing system. Our algorithm is particularly appealing for multi-core architectures where both processors and memory contents (including stale messages in transit) are prone to errors and faults. Our algorithm extends the classical fault-tolerant implementation of atomic memory that was originally proposed by Attiya, Bar-Noy, and Dolev (ABD) to a stabilizing setting where memory can be initially corrupted in an arbitrary manner. The original ABD algorithm provides no guaranties when started in such a corrupted configuration. Interestingly, our scheme preserves the same properties as ABD when there are no transient faults, namely the linearizability of operations. When started in an arbitrarily corrupted initial configuration, we still guarantee eventual yet suffix-closed linearizability.

Published
2012

457. A Synchronization Protocol For Supporting Peer-to-Peer Multiplayer Online Games in Overlay Networks

Author

Stefano Ferretti, ROBERTO BALDONI, ALEJANDRO P. BUCHMANN, SARA TUCCI PIERGIOVANNI, ELIEZER DEKEL, ANNIKA HINZE, GERO MUHL, LEONARDO QUERZONI, VIVIEN QUEMA, and S. Ferretti

Subjects
Background information, Virtual world, business.industry, Computer science, Distributed computing, EVENT DISTRIBUTION, ComputingMilieux_PERSONALCOMPUTING, Overlay network, Peer-to-peer, computer.software_genre, SYNCHRONIZATION ALGORITHMS, PEER-TO-PEER, Gossip protocol, Synchronization algorithm, business, computer, Computer network
Abstract

We propose a new synchronization protocol devised to support multiplayer online games (MOGs) over peer-to-peer architectures. The dissemination of game events is performed through an overlay network. Peers are kept synchronized thanks to an optimistic mechanism which is able to drop obsolete events (i.e., events that lose their importance as the game goes on) and to allow different processing orders for non-correlated events (i.e., events which do not represent competing actions in the virtual world). To allow a fast identification of obsolete events, a gossip protocol is added to the synchronization mechanism, which is in charge of spreading in background information on generated game events. Results coming from extensive simulations confirm the viability of our approach.

Published
2008

Catalog

Books, media, physical & digital resources
See catalog results