• Publications
  • Influence
Gossip-based aggregation in large dynamic networks
We propose a gossip-based protocol for computing aggregate values over network components in a fully decentralized fashion and demonstrate its efficiency and robustness under a variety of scenarios including node and communication failures. Expand
T-Man: Gossip-based fast overlay topology construction
We present a gossip protocol called T-Man that can build a wide range of overlay networks from scratch, relying only on minimal assumptions. Expand
Anthill: a framework for the development of agent-based peer-to-peer systems
We describe Anthill, a framework to support the design, implementation and evaluation of P2P applications based on ideas such as multi-agent and evolutionary programming borrowed from CAS. Expand
T-Man: Gossip-Based Overlay Topology Management
In this paper we propose a generic protocol, T-MAN, for constructing and maintaining a large class of topologies. Expand
Messor: Load-Balancing through a Swarm of Autonomous Agents
This paper presents Messor, a decentralized load-balancing algorithm based on techniques such as multi-agent systems drawn from CAS. Expand
On the Optimum Checkpoint Selection Problem
We consider a model of computation consisting of a sequence of n tasks. Expand
Online reconfiguration in replicated databases based on group communication
Over the last years, many replica control protocols have been developed that take advantage of the ordering and reliability semantics of group communication primitives to simplify database systemExpand
Design patterns from biology for distributed computing
We propose a conceptual framework that captures several basic biological processes in the form of a family of design patterns. Expand
Group Communication in Partitionable Systems: Specification and Algorithms
Gives a formal specification and an implementation for a partitionable group communication service in asynchronous distributed systems where certain stability conditions hold. Expand
Robust aggregation protocols for large-scale overlay networks
In this paper we introduce a robust and adaptive protocol for proactive aggregation, including the calculation of average, product and extremal values. Expand