Efficient reconfiguration technique for redundant ring networks

Consider a redundant ring network where each node is also connected to the nodes at distance d. In the presence of faulty nodes, the goal of a reconfiguration scheme is to construct the largest subring among the non-faulty nodes using both regular and bypass links. If the faults partition the network into components, such a subring will be entirely within a component. The set of faulty nodes delimiting a component is called a “cut”. In the literature, reconfiguration of 2-redundant rings has been studied only for the special case where d=2. We consider the general case of an arbitrary d⩾2. We present efficient reconfiguration algorithms and analyze the size of the resulting subring