This paper considers the election problem on asynchronous ring networks in which one link may undetectably fail. It is assumed that the size of the ring in inexact form is known to the processes, i.e., a lower and/or upper bound. For the case of u/2 >
['Gary L. Peterson', 'Byungho Yi']
Election on faulty rings with incomplete size information