We state the Problem of Knot Identification as a way to achieve consensus in dynamic networks. The network adversary is asynchronous and not oblivious. The network may be disconnected throughout the computation. We determine the necessary and sufficient conditions for the existence of a solution to the Knot Identification Problem: the knots must be observable by all processes and the first observed knot must be the same for all processes. We present an algorithm KIA that solves it. We conduct KIA performance evaluation.

翻译：我们提出结识别问题作为在动态网络中实现共识的一种方式。网络对手是异步且非遗忘的，网络在计算过程中可能始终处于断开状态。我们确定了结识别问题存在解的必要充分条件：所有进程必须能够观察到结，且所有进程首次观察到的结必须相同。我们提出了解决该问题的KIA算法，并对KIA进行了性能评估。