Method and apparatus for preventing loops in a full-duplex bus
First Claim
1. A network of a plurality of nodes, each node in communication with other nodes in the network via a full-duplex communications bus, at least one node comprising computer instructions which, when executed by on a computer, perform loop breaking, by:
- the plurality of nodes selecting the untested connection to join the bus;
establishing dominance of the full-duplex bus by those nodes that selected said untested connection;
testing for loops through said untested connection by said dominant nodes; and
joining said untested connection to said full-duplex bus by said dominant nodes if no loops are found in said bus.
1 Assignment
0 Petitions
Accused Products
Abstract
A method and apparatus is disclosed for preventing loops in a full-duplex bus. One method has the acts of: selecting at least two candidates to join said bus; establishing a dominant candidate from one of said at least two candidates; testing for loops in said bus; and joining said dominant candidate if no loops are found in said bus.
Another method has the acts of: selecting a plurality candidates to join said bus; establishing at least one dominant candidate; testing for loops in said bus; and joining said at least one dominant candidate if no loops are found in said bus. Alternative embodiments are shown that utilize unique identifiers to facilitate candidate selection and to establish dominance on the bus.
-
Citations
13 Claims
-
1. A network of a plurality of nodes, each node in communication with other nodes in the network via a full-duplex communications bus, at least one node comprising computer instructions which, when executed by on a computer, perform loop breaking, by:
-
the plurality of nodes selecting the untested connection to join the bus;
establishing dominance of the full-duplex bus by those nodes that selected said untested connection;
testing for loops through said untested connection by said dominant nodes; and
joining said untested connection to said full-duplex bus by said dominant nodes if no loops are found in said bus. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
Specification