Leader election in complete networks.

Leader election is a fundamental problem in distributed computing and has a number of applications. This paper studies the problem of leader election in complete asynchronous networks. We present a message-optimal protocol that requires O (N log N) messages and O (N/log N) time, where N is the numbe...

詳細記述

書誌詳細

出版年:	SIAM journal on computing. 26, 3 (1997).
第一著者:	Singh, Gurdip
フォーマット:	論文
言語:	English
主題:	Distributed algorithms. Leader election. Time complexity. Complete networks.