A method of communication route switching by a distributed algorithm
Hiroto Kawahara · Systems and Computers in Japan · 1996
Abstract In the field of computer‐network routing methods, there has been less research on fixed routing systems than on adaptive ones. However, there are a great many fixed routing systems in use on actual networks because they are simple. In fixed routing, a principal issue is which method should be used for switching to alternate routes in cases where damage to links or nodes blocks off primary routes. In the majority of cases, routing is changed by switching the links over which the packets are sent (called outgoing links). However, the methods have not yet been perfected—ping pong, looping, and other erroneous‐routing phenomena arise occasionally. This paper presents a distributed algorithm to solve these problems. An algorithm will be given for restoring the original routes after recovery from damage. Finally, it will be proved that erroneous routing will not arise even when multiple chains of operations based on the algorithms presented are in progress at the same time.