Method and apparatus for eliminating unsuccessful tries in a search tree
AssigneeCalifornia Institute of Technology
InventorsJohn C. Peterson, Edward Chow, Herb S. Madan
Life of this patent
Estimating the term…
Loading patent…
AssigneeCalifornia Institute of Technology
InventorsJohn C. Peterson, Edward Chow, Herb S. Madan
Estimating the term…
A circuit switching system in an M-ary, n-cube connected network completes a best-first path from an originating node to a destination node by latching valid legs of the path as the path is being sought out. Each network node is provided with a routing hyperswitch sub-network, ("HSN") connected between that node and bidirectional high capacity communication channels of the n-cube network. The sub-networks are all controlled by routing algorithms which respond to message identification headings ("headers") on messages to be routed along one or more routing legs. The header includes information embedded therein which is interpreted by each sub-network to route and historically update the header. A logic circuit, available at every node, implements the algorithm and automatically forwards or back-tracks the header in the network legs of various paths until a completed path is latched.
A method of searching for a best-first path from an originating computer ("node") through any number of intermediate node(s) to a destination node, when said nodes are connected in a cube-configured network having a plurality of path sections interconnecting the originating, intermediate and destination nodes, comprising the steps of:
A circuit switching system for completing a plurality of data-handling sections of a communication link between connected in a cube-configured network, with any node being capable of originating a message header having embedded therein an identifier of a destination node so that data may be sent from said originating to said destination node after a connected communication link has been completed therebetween, said system comprising:
A circuit switching system having a best-first message routing algorithm for a plurality of cube-connected nodes, said system comprising:
A circuit switching system for a plurality of cube-connected computers nodes, said system comprising:
A circuit switching system for a cube-connected network of a plurality of concurrently-operable computers nodes, said switching system comprising:
A searching system for locating a best-first path from an originating computer ("node") through any number of intermediate node(s) to a destination node, when said nodes are connected in a cube-configured network having a plurality of path sections interconnecting an originating, intermediate and destination nodes, comprising:
Dependencies are inferred from the claim text.