Implementing (sic)P with Bounded Messages on a Network of ADD Channels Academic Article

abstract

• We present an implementation of the eventually perfect failure detector [Formula: see text] from the original hierarchy of the Chandra-Toueg [3] oracles on an arbitrary partitionable network composed of unreliable channels that can lose and reorder messages. Prior implementations of [Formula: see text] have assumed different partially synchronous models ranging from bounded point-to-point message delay and reliable communication to unbounded message size and known network topologies. We implement [Formula: see text] under very weak assumptions on an arbitrary, partitionable network composed of Average Delayed/Dropped (ADD) channels [11] to model unreliable communication. Unlike older implementations, our failure detection algorithm uses bounded-sized messages to eventually detect all nodes that are unreachable (crashed or disconnected) from it.

authors

• Welch, Jennifer

published proceedings

• PARALLEL PROCESSING LETTERS

altmetric score

• 0.5

author list (cited authors)

• Kumar, S., & Welch, J. L.

citation count

• 5

complete list of authors

• Kumar, Saptaparni||Welch, Jennifer L

publication date

• March 2019

publisher

• World Scientific Publishing  Publisher

published in

• Parallel Processing Letters  Journal

keywords

• Add Channels
• Distributed Computing
• Failure Detector
• Partitionable Network

Digital Object Identifier (DOI)

• 10.1142/S0129626419500026

start page

• 1950002

end page

• 1950002

volume

• 29

issue

• 1

URL

• http://dx.doi.org/10.1142/s0129626419500026