Computer Science

Document Type

Conference Paper

Abstract

Consider an asynchronous incomplete directed network. We study the feasibility and efficiency of approximate crash-tolerant consensus under different restrictions on topology knowledge and relay depth, i.e., the maximum number of hops any message can be relayed.

Publication Title

Leibniz International Proceedings in Informatics, LIPIcs

Publication Date

2018

Volume

121

ISSN

1868-8969

ISBN

9783959770927

DOI

10.4230/LIPIcs.DISC.2018.51

Keywords

and phrases asynchrony, consensus, crash fault, relay, topology knowledge

APA Citation

Sakavalas, D., Tseng, L., & Vaidya, N. H. (2018). Brief Announcement: Effects of Topology Knowledge and Relay Depth on Asynchronous Consensus. In 32nd International Symposium on Distributed Computing (DISC 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.

Creative Commons License

Creative Commons Attribution 3.0 License
This work is licensed under a Creative Commons Attribution 3.0 License.

Download

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.