| | |
Summary: On the Power of Anonymous One-Way Communication
Dana Angluin1
, James Aspnes1
, David Eisenstat2
, and Eric Ruppert3
1
Yale University, Department of Computer Science
2
University of Rochester, Department of Computer Science
3
York University, Department of Computer Science and Engineering
Abstract. We consider a population of anonymous processes communicating
via anonymous message-passing, where the recipient of each message is cho-
sen by an adversary and the sender is not identified to the recipient. Even with
unbounded message sizes and process states, such a system can compute only
limited predicates on inputs held by the processes. In the finite-state case, we
show how the exact strength of the model depends critically on design choices
that are irrelevant in the unbounded-state case, such as whether messages are de-
livered immediately or after a delay, whether a sender can record that it has sent
a message, and whether a recipient can queue incoming messages, refusing to
|
