Optical paths supporting quorums for efficient communication

Abstract

In this paper we propose a topology that is advantageous to distributed algorithms while still supporting arbitrary communication. Grouping nodes into sets called quorums is a step in some distributed algorithms. We establish cycles in a network to support cyclic quorums. All nodes in a quorum can then be contacted by simply doing a broadcast on one cycle. In cyclic quorums all possible node pairs appear in at least one quorum. Allowing them to communicate by transmitting on the correct cycle.