Optical Paths Supporting Quorums for Efficient Communication
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.
Arun K. Somani David Lastine
Department of Electrical and Computer Engineering Iowa State University,Ames,Iowa 50011
国际会议
苏州
英文
1-4
2014-11-09(万方平台首次上网日期,不代表论文的发表时间)