In tree-based multicast systems, a relatively small number of interior nodes carry the load of
forwarding multicast messages. This works well when the interior nodes are highly …

Gossip-based communication protocols are appealing in large-scale distributed applications
such as information dissemination, aggregation, and overlay topology management. This …

Availability is a storage system property that is both highly desired and yet minimally
engineered. While many systems provide mechanisms to improve availability-such as …

This paper presents the design of Mercury, a scalable protocol for supporting multi-attribute
range-based searches. Mercury differs from previous range-based query systems in that it …

Previous approaches for computing duplicate-sensitive aggregates in wireless sensor
networks have used a tree topology, in order to conserve energy and to avoid double …

In recent years, overlay networks have become an effective alternative to IP multicast for
efficient point to multipoint communication across the Internet. Typically, nodes self-organize …

We present an approach to support massively multiplayer games on peer-to-peer overlays.
Our approach exploits the fact that players in MMGs display locality of interest, and therefore …

Bugs in distributed systems are often hard to find. Many bugs reflect discrepancies between
a system's behavior and the programmer's assumptions about that behavior. We present …

In this paper, we present Chainsaw, a p2p overlay multicast system that completely
eliminates trees. Peers are notified of new packets by their neighbors and must explicitly …

Modern software model checkers find safety violations: breaches where the system enters
some bad state. However, we argue that checking liveness properties offers both a richer …