Hamiltonian Cycle Synthesis In Failure Prone Communication Networks
Original Publication Date: 1979-Sep-01
Included in the Prior Art Database: 2005-Feb-20
This article describes a method for synthesizing a Hamiltonian cycle in a connected graph, such as a distributed communication system, for the purpose of maintaining communications in a failure-prone environment. The method steps include (1) ascertaining the existence of a Hamiltonian cycle in a given connected graph representation of a network, (2) synthesizing one of several cycles for a predetermined number of failing links or nodes using a minimum number of redundant links, and (3) causing an appropriate circuit configuration or reconfiguration mechanism to switch in the redundant links necessary to complete the calculated cycle.