Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Implementing $\Diamond P$ with Bounded Messages on a Network of ADD
  Channels   We present an implementation of the eventually perfect failure detector
($\Diamond P$) from the original hierarchy of the Chandra-Toueg oracles on an
arbitrary partitionable network composed of unreliable channels that can lose
and reorder messages. Prior implementations of $\Diamond P$ 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 $\Diamond P$ under very weak assumptions on an
arbitrary, partitionable network composed of Average Delayed/Dropped (ADD)
channels 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.

36
The categories of this paper are: cmp-lg
24
The categories of this paper are: dg-ga
7
The categories of this paper are: hep-th
10
The categories of this paper are: q-bio
23
The categories of this paper are: solv-int
19
The categories of this paper are: eess
28
The categories of this paper are: alg-geom
0
The categories of this paper are: hep-ph
4
The categories of this paper are: cond-mat
2
The categories of this paper are: math
17
The categories of this paper are: q-fin
34
The categories of this paper are: chem-ph
35
The categories of this paper are: mtrl-th
8
The categories of this paper are: hep-ex
13
The categories of this paper are: quant-ph
37
The categories of this paper are: supr-con