EUVIMEDEUVIMED entdecken
Crossref

Commensal cuckoo

Siddhartha Sen, Michael J. Freedman

ACM SIGOPS Operating Systems Review · 16.02.2012 · 46 (1) · 33-39

DOI: 10.1145/2146382.2146389 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM SIGOPS Operating Systems Review, online erschienen am 16.02.2012. Verfasst von Siddhartha Sen und 1 weiteren Autor:innen. Die Arbeit wurde bisher 44-mal zitiert (Crossref) und nennt 44 Literaturangaben.

AbstractBibliografische AngabenZitieren

Abstract (Originalsprache)

We present commensal cuckoo,* a secure group partitioning scheme for large-scale systems that maintains the correctness of many small groups, despite a Byzantine adversary that controls a constant (global) fraction of all nodes. In particular, the adversary is allowed to repeatedly rejoin faulty nodes to the system in an arbitrary adaptive manner, e.g., to collocate them in the same group. Commensal cuckoo addresses serious practical limitations of the state-ofthe- art scheme, the cuckoo rule of Awerbuch and Scheideler, tolerating 32x--41x more faulty nodes with groups as small as 64 nodes (as compared to the hundreds required by the cuckoo rule). Secure group partitioning is a key component of highly-scalable, reliable systems such as Byzantine faulttolerant distributed hash tables (DHTs).

Zitieren

APA

Sen, S., & Freedman, M. J. (2012). Commensal cuckoo. ACM SIGOPS Operating Systems Review, 46(1), 33-39. https://doi.org/10.1145/2146382.2146389

Vancouver

Sen S, Freedman MJ. Commensal cuckoo. ACM SIGOPS Operating Systems Review. 2012;46(1):33-39. doi:10.1145/2146382.2146389

BibTeX
@article{Sen2012,
  author = {Sen, Siddhartha and Freedman, Michael J.},
  title = {Commensal cuckoo},
  journal = {ACM SIGOPS Operating Systems Review},
  year = {2012},
  volume = {46},
  number = {1},
  pages = {33--39},
  doi = {10.1145/2146382.2146389}
}
Kostenlos starten →