Automatic Recovery From Failure for Address Independent Networks
Original Publication Date: 1989-Apr-01
Included in the Prior Art Database: 2005-Jan-27
Disclosed is an algorithm that allows address independent networks configured on a tree  to automatically reconfigure themselves after the failure of a node or a link. The key to the scheme is the observation that every connected undirected graph possesses one or more spanning trees, and consequently supports an address independent routing . An address independent network may therefore be configured on an undirected (or bidirectional) network of point-to-point links that contains one or more redundant links by first finding a spanning tree in a distributed manner, and then routing messages along this spanning tree using a predetermined address independent routing.