Cookies
O website necessita de alguns cookies e outros recursos semelhantes para funcionar. Caso o permita, o INESC TEC irá utilizar cookies para recolher dados sobre as suas visitas, contribuindo, assim, para estatísticas agregadas que permitem melhorar o nosso serviço. Ver mais
Aceitar Rejeitar
  • Menu
Publicações

Publicações por Paulo Sérgio Almeida

2009

Fault-Tolerant Aggregation by Flow Updating

Autores
Jesus, P; Baquero, C; Almeida, PS;

Publicação
DISTRIBUTED APPLICATIONS AND INTEROPERABLE SYSTEMS, PROCESSINGS

Abstract
Data aggregation plays an important role in the design of scalable systems, allowing the determination of meaningful system-wide properties to direct the execution of distributed applications. In the particular case of wireless sensor networks, data collection is often only practicable if aggregation is performed. Several aggregation algorithms have been proposed in the last few years, exhibiting different properties in terms of accuracy, speed and communication tradeoffs. Nonetheless, existing approaches are found lacking in terms of fault tolerance. In this paper, we introduce a novel fault-tolerant averaging based data aggregation algorithm. It tolerates substantial message loss (link failures), while competing algorithms in the same class can be affected by a Single lost message. The algorithm is based on manipulating flows (in the graph theoretical sense), that are updated using idempotent messages, providing it with unique robustness capabilities. Furthermore, evaluation results obtained by comparing it with other averaging approaches have revealed that it outperforms them in terms of time and message complexity.

2011

Fault-Tolerant Aggregation: Flow-Updating Meets Mass-Distribution

Autores
Almeida, PS; Baquero, C; Farach Colton, M; Jesus, P; Mosteiro, MA;

Publicação
PRINCIPLES OF DISTRIBUTED SYSTEMS

Abstract
Flow-Updating (FU) is a fault-tolerant technique that has proved to be efficient in practice for the distributed computation of aggregate functions in communication networks where individual processors do not have access to global information. Previous distributed aggregation protocols, based on repeated sharing of input values (or mass) among processors, sometimes called Mass-Distribution (MD) protocols, are not resilient to communication failures (or message loss) because such failures yield a loss of mass. In this paper, we present a protocol which we call Mass-Distribution with Flow-Updating (MDFU). We obtain MDFU by applying FU techniques to classic MD. We analyze the convergence time of MDFU showing that stochastic message loss produces low overhead. This is the first convergence proof of an FU-based algorithm. We evaluate MDFU experimentally, comparing it with previous MD and FU protocols, and verifying the behavior predicted by the analysis. Finally, given that MDFU incurs a fixed deviation proportional to the message-loss rate, we adjust the accuracy of MDFU heuristically in a new protocol called MDFU with Linear Prediction (MDFU-LP). The evaluation shows that both MDFU and MDFU-LP behave very well in practice, even under high rates of message loss and even changing the input values dynamically.

2004

Bounded version vectors

Autores
Almeida, JB; Almeida, PS; Baquero, C;

Publicação
DISTRIBUTED COMPUTING, PROCEEDINGS

Abstract
Version vectors play a central role in update tracking under optimistic distributed systems, allowing the detection of obsolete or inconsistent versions of replicated data. Version vectors do not have a bounded representation; they are based on integer counters that grow indefinitely as updates occur. Existing approaches to this problem are scarce; the mechanisms proposed are either unbounded or operate only under specific settings. This paper examines version vectors as a mechanism for data causality tracking and clarifies their role with respect to vector clocks. Then, it introduces bounded stamps and proves them to be a correct alternative to integer counters in version vectors. The resulting mechanism, bounded version vectors, represents the first bounded solution to data causality tracking between replicas subject to local updates and pairwise symmetrical synchronization.

2010

Dependability in Aggregation by Averaging

Autores
Jesus, Paulo; Baquero, Carlos; Almeida, PauloSergio;

Publicação
CoRR

Abstract

2010

Dotted Version Vectors: Logical Clocks for Optimistic Replication

Autores
Preguiça, NunoM.; Baquero, Carlos; Almeida, PauloSergio; Fonte, Victor; Gonçalves, Ricardo;

Publicação
CoRR

Abstract

2000

Panasync: dependency tracking among file copies

Autores
Almeida, PS; Baquero, C; Fonte, V;

Publicação
Proceedings of the ACM SIGOPS European Workshop, Kolding, Denmark, September 17-20, 2000

Abstract

  • 8
  • 9