Browse by author
Lookup NU author(s): Francois Bonnet, Dr Paul EzhilchelvanORCiD, Einar Vollset
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
We solve the consensus problem using a new class of broad-casts that are very appropriate to ad-hoc networking: every broadcast message is eventually ensured to be garbage-collected, thus freeing buffers in the resource-constrained mobile devices. We identify an impossibility result, the conditions in which a consensus protocol that assumes normal, message-keeping broadcasts can work using the new broadcast, and the adaptation such a protocol would require when these conditions do not hold. The cost of achieving quiescent consensus, estimated through simulations, is shown to be affordable for hosting practical dependable applications. Copyright 2006 ACM.
Author(s): Bonnet F, Ezhilchelvan P, Vollset E
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: Proceedings of the ACM Symposium on Applied Computing
Year of Conference: 2006
Pages: 670-674
Publisher: Association for Computing Machinery
Library holdings: Search Newcastle University Library for this item
ISBN: 1595931082
