Leader election in the presence of link failures

被引：52

作者：

Singh, G

机构：

[1] Department of Computing and Information Sciences, Kansas State University, Manhattan

来源：

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | 1996年 / 7卷 / 03期

基金：

美国国家科学基金会;

关键词：

election; complete networks; intermittent link failures; distributed algorithms; message complexity;

D O I：

10.1109/71.491576

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We study the problem of leader election in the presence of intermittent link failures. We assume that up to N/2-1 links incident on each node may fail during the execution of the protocol. We present a message optimal algorithm with message complexity O(N-2).

引用

页码：231 / 236

页数：6

共 7 条

[1] FAULT-TOLERANT DISTRIBUTED ALGORITHM FOR ELECTION IN COMPLETE NETWORKS
ABUAMARA, HH
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1988, 37 (04) : 449 - 453
[2] TIME AND MESSAGE BOUNDS FOR ELECTION IN SYNCHRONOUS AND ASYNCHRONOUS COMPLETE NETWORKS
AFEK, Y
GAFNI, E
[J]. SIAM JOURNAL ON COMPUTING, 1991, 20 (02) : 376 - 394
[3] BARYEHUDA R, 1987, STACS
[4] GOLDREICH O, 1986, P ACM S PRINC DISTR
[5] KORACH E, 1984, 3RD ACM S PRINC DIST, P199
[6] MASUZAWA T, 1989, P 3 INT WORKSH DISTR
[7] SINGH G, 1992, ACM S PRINC DISTR CO, P179

← 1 →