Someone designs a new failure detector where processes are organized in a binary tree. In a binary tree, there is one node (process) at the root (level 1), which has 2 children (nodes or processes) at level 2, which in turn each have 2 children at level 3, and so on. If node a is a child of node b, then b is a parent of a (and vice-versa). In this heartbeat protocol, every process sends heartbeats to its parent in the tree. Heartbeats are not relayed or gossiped. This protocol is:
Answers
Answered by
0
Answer:
Someone designs a new failure detector where processes are organized in a binary tree. In a binary tree, there is one node (process) at the root (level 1), which has 2 children (nodes or processes) at level 2, which in turn each have 2 children at level 3, and so on. If node A is a child of node B, then B is a parent of A (and vice-versa). In this heartbeat protocol, every process sends heartbeats to its parent in the tree. Heartbeats are not relayed or gossiped. This protocol is:
Similar questions