Mikel Larrea
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mikel Larrea has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Michel Raynal
Univ Rennes (IRISA, CNRS, Inria), Rennes, France
2 shared publications - Christian Fernández-Campusano
Department of Electrical Engineering, Faculty of Engineering, University of Santiago de Chile (USACH), Santiago 9170124, Chile
1 shared publication - Ernesto Jiménez
Universidad Politecnica de Madrid, Madrid, Spain
1 shared publication - Jian Tang
Universidad Politecnica de Madrid, Madrid, Spain
1 shared publication - Roberto Cortiñas
Computer Science Faculty, University of the Basque Country UPV/EHU, Paseo M. Lardizábal 1, 20018 Donostia-San Sebastián, Spain
1 shared publication - Sergio Arévalo
Universidad Politécnica de Madrid
1 shared publication
Latest Publications
- Open Access
- 3 February 2023
- Published by Springer Nature in Wireless Networks
- Vol. 29 (4) , 1831-1842
Using publish/subscribe for message routing in mobile environments
Publish/subscribe is a mature communication paradigm to route and deliver events from publishers to interested subscribers. Initially conceived for large scale systems, e.g., the Internet, it has been used more recently in new scenarios, e.g., wireless sensor networks and the Internet of Things (IoT), where mobility and dynamicity are the norm. The loose-coupling and asynchronicity of publish/subscribe makes it an interesting choice for IoT scenarios, i.e., each node in an IoT network can choose a different role depending on its location, capabilities, etc. This paper presents MFT-PubSub, a fully mobile and fault tolerant content-based publish/subscribe protocol. Our proposal is a purely reactive solution for mobility in a publish/subscribe system without any kind of limits on the mobility patterns of the nodes. A wireless ad hoc network is created without the need of any previous connections or knowledge on the nodes. Handling the mobility, be it physical or logical, of both clients and brokers. We prove the validity of our solution by experimentation, and compare it with AODV, a routing protocol for mobile ad hoc networking. The simulations show an improvement on message delivery rate over previously used protocols.
- 3 February 2023
- Published by Springer Nature in Wireless Networks
- Vol. 29 (4) , 1831-1842
Open AccessUsing publish/subscribe for message routing in mobile environments
Publish/subscribe is a mature communication paradigm to route and deliver events from publishers to interested subscribers. Initially conceived for large scale systems, e.g., the Internet, it has been used more recently in new scenarios, e.g., wireless sensor networks and the Internet of Things (IoT), where mobility and dynamicity are the norm. The loose-coupling and asynchronicity of publish/subscribe makes it an interesting choice for IoT scenarios, i.e., each node in an IoT network can choose a different role depending on its location, capabilities, etc. This paper presents MFT-PubSub, a fully mobile and fault tolerant content-based publish/subscribe protocol. Our proposal is a purely reactive solution for mobility in a publish/subscribe system without any kind of limits on the mobility patterns of the nodes. A wireless ad hoc network is created without the need of any previous connections or knowledge on the nodes. Handling the mobility, be it physical or logical, of both clients and brokers. We prove the validity of our solution by experimentation, and compare it with AODV, a routing protocol for mobile ad hoc networking. The simulations show an improvement on message delivery rate over previously used protocols.
- 8 June 2020
- Published by Springer Nature in Computing
- Vol. 102 (9) , 1967-1999
Uniform reliable broadcast in anonymous distributed systems with fair lossy channels
- 8 June 2020
- Published by Springer Nature in Computing
- Vol. 102 (9) , 1967-1999
Uniform reliable broadcast in anonymous distributed systems with fair lossy channels
- Open Access
DBFT: Efficient Byzantine Consensus with a Weak Coordinator and its Application to Consortium Blockchains
This paper introduces a deterministic Byzantine consensus algorithm that relies on a new weak coordinator. As opposed to previous algorithms that cannot terminate in the presence of a faulty or slow coordinator, our algorithm can terminate even when its coordinator is faulty, hence the name weak coordinator. The key idea is to allow processes to complete asynchronous rounds as soon as they receive a threshold of messages, instead of having to wait for a message from a coordinator that may be slow. The resulting algorithm assumes partial synchrony, is resilience optimal, time optimal and does not need signatures. Our presentation is didactic: we first present a simple safe binary Byzantine consensus algorithm, modify it to ensure termination, and finally present an optimized reduction from multivalue consensus to binary consensus that may terminate in 4 message delays. To evaluate our algorithm, we deployed it on 100 machines distributed in 5 datacenters across different continents and compared its performance against the randomized solution from Mostefaoui, Moumem and Raynal [PODC14] that terminates in O(1) rounds in expectation. Our algorithm always outperforms the latter even in the presence of Byzantine behaviors. Our algorithm has a subsecond average latency in most of our geo-distributed experiments, even when attacked by a well-engineered coalition of Byzantine processes.
Open AccessDBFT: Efficient Byzantine Consensus with a Weak Coordinator and its Application to Consortium Blockchains
This paper introduces a deterministic Byzantine consensus algorithm that relies on a new weak coordinator. As opposed to previous algorithms that cannot terminate in the presence of a faulty or slow coordinator, our algorithm can terminate even when its coordinator is faulty, hence the name weak coordinator. The key idea is to allow processes to complete asynchronous rounds as soon as they receive a threshold of messages, instead of having to wait for a message from a coordinator that may be slow. The resulting algorithm assumes partial synchrony, is resilience optimal, time optimal and does not need signatures. Our presentation is didactic: we first present a simple safe binary Byzantine consensus algorithm, modify it to ensure termination, and finally present an optimized reduction from multivalue consensus to binary consensus that may terminate in 4 message delays. To evaluate our algorithm, we deployed it on 100 machines distributed in 5 datacenters across different continents and compared its performance against the randomized solution from Mostefaoui, Moumem and Raynal [PODC14] that terminates in O(1) rounds in expectation. Our algorithm always outperforms the latter even in the presence of Byzantine behaviors. Our algorithm has a subsecond average latency in most of our geo-distributed experiments, even when attacked by a well-engineered coalition of Byzantine processes.
- 1 February 2017
- Published by Elsevier in Information Processing Letters
- Vol. 118, 100-104
A distributed leader election algorithm in crash-recovery and omissive systems
- 1 February 2017
- Published by Elsevier in Information Processing Letters
- Vol. 118, 100-104
A distributed leader election algorithm in crash-recovery and omissive systems