他山之石之Byzantine Generals Problem
论文出处: https://people.eecs.berkeley.edu/~luca/cs174/byzantine.pdf
Reliable computer systems must handle malfunctioning components that give confilicting information to different parts of the system. This situation can be expressed abstractly in terms of a group of generals of the Byzantine army camped with their troops around an enmemy city. Communicating only by messenger, the generals must agree upon a common battle plan. However, one or more of them may be traitors who will try to confuse the others. The problem is to find an algorithm to ensure that the loyal generals will reach agreement.
一个可靠的计算系统需要得当的处理其子部件因紊乱而向系统的其他部分发送相左的消息的情况。 这种情况可以抽象为以下场景:
一群拜占庭将军围着一座敌城驻扎了多个军团,每个军团存在一位将军。在只能通过信使通信的情况下,他们需要决定一个共同的作战行动。 其中的几位将军有可能是叛徒,会不遗余力得误导其他人。 问题的关键就是找出一个算法,从而确保所有的忠将作出一致的决定。