Answers are grounded in this paper and cite their sources.
Consider a network of n processes, each of which has a d-dimensional vector of reals as its input. Each process can communicate directly with all the processes in the system; thus the communication network is a complete graph. All the communication channels are reliable and FIFO (first-in-first-out).
No takes yet. Share an insight, caveat, or question.
Vaidya et al. (2013) studied this question.