GOSSIP: Gossiping Over Storage Systems Is PracticalShow others and affiliations
2007 (English)In: ACM SIGOPS Operating Systems Review, Vol. 41, p. 75-81Article in journal (Refereed) Published
Abstract [en]
Gossip-based mechanisms are touted for their simplicity, limited resource usage, robustness to failures, and tunable system behavior. These qualities make gossiping an ideal mechanism for storage systems that are responsible for maintaining and updating data in a mist of failures and limited resources (e.g., intermittent network connectivity, limited bandwidth, constrained communication range, or limited battery power). We focus on persistent storage systems that, unlike mere caches, are responsible for both the durability and the consistency of data. Examples of such systems may be encountered in many different environments, in particular: wide-area networks (constrained by limited bandwidth), wireless sensor networks (characterized by limited resources), and mobile ad hoc networks (suffering from intermittent connectivity). In this paper, we demonstrate the qualities of gossiping in these three respective environments.
Place, publisher, year, edition, pages
2007, 1. Vol. 41, p. 75-81
Keyword [en]
distributed storage, durability, gossip-based storage, gossiping, mobile ad hoc networks, persistent storage, update propagation, wide-area networks, wireless sensor networks
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-22277DOI: 10.1145/1317379.1317391OAI: oai:DiVA.org:ri-22277DiVA, id: diva2:1041822
2016-10-312016-10-312018-01-14Bibliographically approved