• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Bar fault tolerance for cooperative services (2005)

Cached

  • Download as a PDF

Download Links

  • [cs.nyu.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.research.microsoft.com]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [cs.brown.edu]
  • [netlab.cse.yzu.edu.tw]
  • [research.microsoft.com]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.princeton.edu]
  • [www.cs.princeton.edu]
  • [www.cs.umass.edu]
  • [www.cs.utexas.edu]
  • [people.cs.umass.edu]
  • [www.cs.cornell.edu]
  • [people.cs.vt.edu]
  • [research.cs.wisc.edu]
  • [www.cs.utexas.edu]
  • [people.cs.vt.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Amitanand S. Aiyer , Lorenzo Alvisi , Allen Clement , Michael Dahlin , Jean-Philippe Martin , Carl Porth
Venue:IN SOSP’05 20TH ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES (P
Citations:16 - 2 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Aiyer05barfault,
    author = {Amitanand S. Aiyer and Lorenzo Alvisi and Allen Clement and Michael Dahlin and Jean-Philippe Martin and Carl Porth},
    title = {Bar fault tolerance for cooperative services},
    booktitle = {IN SOSP’05 20TH ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES (P},
    year = {2005},
    pages = {45--58},
    publisher = {ACM}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantine behaviors when broken, misconfigured, or malicious nodes arbitrarily deviate from their specification and rational behaviors when selfish nodes deviate from their specification to increase their local benefit. The paper makes three contributions: (1) It introduces the BAR (Byzantine, Altruistic, Rational) model as a foundation for reasoning about cooperative services; (2) It proposes a general three-level architecture to reduce the complexity of building services under the BAR model; and (3) It describes an implementation of BAR-B, the first cooperative backup service to tolerate both Byzantine users and an unbounded number of rational users. At the core of BAR-B is an asynchronous replicated state machine that provides the customary safety and liveness guarantees despite nodes exhibiting both

Keyphrases

cooperative service    bar fault tolerance    first cooperative backup service    unbounded number    customary safety    byzantine behavior    rational behavior    general three-level architecture    asynchronous replicated state machine    local benefit    malicious node    rational user    building service    multiple administrative domain    byzantine user    selfish node    general approach    bar model    liveness guarantee   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University