Packet Efficient Implementation of the Omega Failure Detector

Abstract : We assume that a message may be delivered by packets through multiple hops and investigate the feasibility and efficiency of an Omega Failure Detector implementation. We prove the existence and sustainability of a leader is exponentially more probable in a multi-hop than in a single-hop implementation. An implementation is: message efficient if all but finitely many messages are sent by a single process; packet efficient if the number of packets used to transmit a message in all but finitely many messages is linear w.r.t. the number of processes; super packet efficient if the number of channels used by packets to transmit all but finitely many messages is linear. Our results for deterministic algorithms implementing Omega follow. If reliability and timeliness of messages do not correlate, packet efficiency is impossible. We establish necessary and sufficient conditions for the existence of message and packet efficiency and prove correct our deterministic implementation. We prove the eventuality of channels’ timeliness makes super packet efficiency impossible.
Complete list of metadatas

https://hal.sorbonne-universite.fr/hal-01491817
Contributor : Sébastien Tixeuil <>
Submitted on : Friday, March 17, 2017 - 2:08:48 PM
Last modification on : Tuesday, May 14, 2019 - 10:14:07 AM

Identifiers

Citation

Quentin Bramas, Dianne Foreback, Mikhail Nesterenko, Sébastien Tixeuil. Packet Efficient Implementation of the Omega Failure Detector. International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2016), Nov 2016, Lyon, France. pp.70-87, ⟨10.1007/978-3-319-49259-9_6⟩. ⟨hal-01491817⟩

Share

Metrics

Record views

487