12 citations · 27 across the 9 of their papers we have counts for
10 papers
The quest for scaling BFT Consensus through Tree-Based Vote Aggregation
Ray Neiheiser, Miguel Matos, Luís Rodrigues
With the growing commercial interest in blockchain, permissioned implementations have received increasing attention. Unfortunately, existing BFT consensus protocols that are the ba…
Lynceus: Cost-efficient Tuning and Provisioning of Data Analytic Jobs
Maria Casimiro, Diego Didona, Paolo Romano +3
Modern data analytic and machine learning jobs find in the cloud a natural deployment platform to satisfy their notoriously large resource requirements. Yet, to achieve cost effici…
Unobtrusive Deferred Update Stabilization for Efficient Geo-Replication
Chathuri Gunawardhana, Manuel Bravo, Luís Rodrigues
In this paper we propose a novel approach to manage the throughput vs latency tradeoff that emerges when managing updates in geo-replicated systems. Our approach consists in allowi…
A Distributed Auctioneer for Resource Allocation in Decentralized Systems
Amin M. Khan, Xavier Vilaça, Luís Rodrigues +1
In decentralized systems, nodes often need to coordinate to access shared resources in a fair manner. One approach to perform such arbitration is to rely on auction mechanisms. Alt…
Accountability in Dynamic Networks
Xavier Vilaça, Luís Rodrigues
We take a game theoretical approach to determine necessary and sufficient conditions under which we can persuade rational agents to exchange messages in pairwise exchanges over lin…
On the Range of Equilibria Utilities of a Repeated Epidemic Dissemination Game with a Mediator
Xavier Vilaca, Luis Rodrigues
We consider eager-push epidemic dissemination in a complete graph. Time is divided into synchronous stages. In each stage, a source disseminates events. Each event is sent by t…
On the Effectiveness of Punishments in a Repeated Epidemic Dissemination Game
Xavier Vilaça, Luís Rodrigues
This work uses Game Theory to study the effectiveness of punishments as an incentive for rational nodes to follow an epidemic dissemination protocol. The dissemination process is m…
Order-preserving Renaming in Synchronous Message Passing Systems with Byzantine Faults
Oksana Denysyuk, Luis Rodrigues
Renaming is a fundamental problem in distributed computing, which consists of a set of processes picking distinct names from a given namespace. The paper presents algorithms that s…
Asynchrony and Collusion in the N-party BAR Transfer Problem
Xavier Vilaça, Oksana Denysyuk, Luís Rodrigues
The problem of reliably transferring data from a set of producers to a set of consumers in the BAR model, named N-party BAR Transfer (NBART), is an important building b…
Random Walk on Directed Dynamic Graphs
Oksana Denysyuk, Luis Rodrigues
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re…