Telecommunication network and searching arrangement for finding the path of least cost

Claim 2

A telecommunication network comprising nodes interconnected by communication links, and a decentralized arrangement for finding the path of least cost for transmission between two nodes based on an adaptive search, wherein each path includes at least one of said links, and each node comprises means for storing cost data for each of said links, characterized in that: each of the nodes comprises a cellular automaton formed by a respective plurality of cells interconnected by simulated links, the cells and simulated links being respectively arranged to represent the nodes and communication links, all the simulated links connected to a particular cell being defined as simulated neighbor links extending to neighbor cells, each of the nodes comprises means, associated with each of the cells in that node, for calculating the cost of respective paths to each of the other cells in that node, a plurality of the paths being formed by respective pluralities of simulated links serially connected through respective cells, each said neighbor cell comprises means for transmitting to said particular cell cost data for paths from that neighbor cell to other cells in that node, one of said plurality of paths extends from a first cell over a first said simulated neighbor link to a first said neighbor cell, and thence over a path portion to a second cell, and the means for calculating associated with the first cell calculates cost over the one path based on cost from the first cell to the first neighbor cell, and cost data provided from the first neighbor cell for the path portion to the second cell.

Claim 3

A network as claimed in claim 1, characterized in that each cell comprises means for communicating with only its respective neighbor cells to which it is directly connected by said simulated neighbor links.

Claim 4

A telecommunication network comprising nodes interconnected by communication links, and a decentralized arrangement for finding the path of least cost for transmission between two nodes based on an adaptive search, wherein each path includes at least one of said links, and each node comprises means for storing cost data for each of said links, characterized in that: each of the nodes comprises a cellular automaton formed by a respective plurality of cells interconnected by simulated links, the cells and simulated links being respectively arranged to represent the nodes and communication links, all the simulated links connected to a particular cell being defined as simulated neighbor links extending to neighbor cells, each of the nodes comprises means, associated with each of the cells in that node, for calculating the cost of respective paths to each of the other cells in that node, a plurality of the paths being formed by respective pluralities of simulated links serially connected through respective cells, each said neighbor cell comprises means for transmitting to said particular cell cost data for paths from that neighbor cell to other cells in that node, to determine the path of at least cost from a node i to a node j, the cell i corresponding to node i receives, from each neighbor cell k, the cost data for the lowest cost path from cell k to cell j which is most recently calculated in said cell k, and identification of said lowest cost path from cell k to cell j, cell i comprises means for selecting, from the respective sums of the cost from cell i to each respective neighbor cell k plus the cost data to cell j respectively received from each of the neighbor cells, the lowest cost data and corresponding path from cell i to cell j, and for storing the selected lowest cost data and path, and cell i comprises means for subsequently transmitting, to each of its neighbor cells, the stored lowest cost data and corresponding path from cell i to cell j.

Claim 5

A telecommunication network comprising nodes interconnected by communication links, and a decentralized arrangement for finding the path of least cost for transmission between two nodes based on an adaptive search, wherein each path includes at least one of said links, and each node comprises means for storing cost data for each of said links, characterized in that: each of the nodes comprises a cellular automaton formed by a respective plurality of cells interconnected by simulated links, the cells and simulated links being respectively arranged to represent the nodes and communication links, all the simulated links connected to a particular cell being defined as simulated neighbor links extending to neighbor cells, each of the nodes comprises means, associated with each of the cells in that node, for calculating the cost of respective paths to each of the other cells in that node, a plurality of the paths being formed by respective pluralities of simulated links serially connected through respective cells, each said neighbor cell comprises means for transmitting to said particular cell cost data for paths from that neighbor cell to other cells in that node, to determine the path of at least cost from a node i to a node j, the cell i corresponding to node i receives, from each neighbor cell k, the cost data for the lowest cost path from cell k to cell j which is most recently calculated in said cell k, and identification of said lowest cost path from cell k to cell j, cell i comprises means for selecting, from the respective sums of the cost from cell i to each respective neighbor cell k plus the cost data to cell j respectively received from each of the neighbor cells, the lowest cost data and corresponding path from cell i to cell j, and for storing the selected lowest cost data and path, and cell i comprises means for subsequently transmitting, to each of its neighbor cells, the stored lowest cost data and corresponding path from cell i to cell j.

Claim 6

A network as claimed in claim 3, characterized in that the calculating means in each cell comprises means for communicating with the respective calculating means in only its respective neighbor cells.

Claim 7

A network as claimed in claim 3, characterized in that the calculating means in cell i is asynchronous with respect to the calculating means in the cells other than cell i.

Claim 8

A network as claimed in claim 3, wherein each cellular automaton is formed by a respective sequential computing machine, characterized in that the sequential computing machines are respectively programmed to select the order in cost data for cells are calculated, based on the minimum number of links to be traversed to connect two nodes.

Claim 9

A network as claimed in claim 6, characterized in that the sequential computing machines are respectively programmed to make the automaton run when the states of the simulated links are respectively equal.

Claim 10

A network as claimed in claim 6, characterized in that the calculating means in cell i is asynchronous with respect to the calculating means in the cells other than cell i.

Claim 11

A network as claimed in claim 6, characterized in that the calculating means in each cell comprises means for communicating with the respective calculating means in only its respective neighbor cells.

Claim 12

A network as claimed in claim 9, characterized in that the calculating means in cell i is asynchronous with respect to the calculating means in the cells other than cell i.

Claim 13

A decentralized arrangement in a first node of a telecommunication network comprising a plurality of said nodes interconnected by communication links, for finding the path of least cost for transmission between the first node and another node based on an adaptive search, wherein each path includes at least one of said links, and each node comprises means for storing cost data for each of said links, characterized in that the arrangement comprises: a cellular automaton formed by a respective plurality of cells interconnected by simulated links, the cells and simulated links being respectively arranged to represent the nodes and communication links, all the simulated links connected to a particular cell being defined as simulated neighbor links extending to neighbor cells, means, associated with each of the cells, for calculating the cost of respective paths to each of the other cells, a plurality of the paths being formed by respective pluralities of simulated links serially connected through respective cells, each said neighbor cell comprises means for transmitting to said particular cell cost data for paths from that neighbor cell to other cells, to determine the path of least cost from the first node to a node j, the cell i corresponding to the first node receives, from each neighbor cell k, the cost data for the lowest cost path from cell k to cell j which is most recently calculated in said cell k, and identification of said lowest cost path from cell k to cell j, cell i comprises means for selecting, from the respective sums of the cost from cell i to each respective neighbor cell k plus the cost data to cell j respectively received from each of the neighbor cells, the lowest cost data and corresponding path from cell i to cell j, and for storing the selected lowest cost data and path, and cell i comprises means for subsequently transmitting, to each of its neighbor cells, the stored lowest cost data and corresponding path from cell i to cell j.

Claim 14

A decentralized arrangement in a first node of a telecommunication network comprising a plurality of said nodes interconnected by communication links, for finding the path of least cost for transmission between the first node and another node based on an adaptive search, wherein each path includes at least one of said links, and each node comprises means for storing cost data for each of said links, characterized in that the arrangement comprises: a cellular automaton formed by a respective plurality of cells interconnected by simulated links, the cells and simulated links being respectively arranged to represent the nodes and communication links, all the simulated links connected to a particular cell being defined as simulated neighbor links extending to neighbor cells, means, associated with each of the cells, for calculating the cost of respective paths to each of the other cells, a plurality of the paths being formed by respective pluralities of simulated links serially connected through respective cells, each said neighbor cell comprises means for transmitting to said particular cell cost data for paths from that neighbor cell to other cells, to determine the path of least cost from the first node to a node j, the cell i corresponding to the first node receives, from each neighbor cell k, the cost data for the lowest cost path from cell k to cell j which is most recently calculated in said cell k, and identification of said lowest cost path from cell k to cell j, cell i comprises means for selecting, from the respective sums of the cost from cell i to each respective neighbor cell k plus the cost data to cell j respectively received from each of the neighbor cells, the lowest cost data and corresponding path from cell i to cell j, and for storing the selected lowest cost data and path, and cell i comprises means for subsequently transmitting, to each of its neighbor cells, the stored lowest cost data and corresponding path from cell i to cell j.

Claim 15

An arrangement as claimed in claim 11, characterized in that the calculating means in each cell comprises means for communicating with the respective calculating means in only its respective neighbor cells.

Claim 16

An arrangement as claimed in claim 11, characterized in that the calculating means in cell i is asynchronous with respect to the calculating means in the cells other than cell i.

Claim 17

An arrangement as claimed in claim 11, wherein each cellular automaton is formed by a respective sequential computing machine, characterized in that the sequentially computing machines are respectively programmed to select the order in cost data for cells are calculated, based on the minimum number of links to be traversed to connect two nodes.

Claim 18

An arrangement as claimed in claim 14, characterized in that the sequentially computing machines are respectively programmed to make the automaton run when the states of the simulated links are respectively equal.

Claim 19

A network as claimed in claim 14, characterized in that the calculating means in cell i is asynchronous with respect to the calculating means in the cells other than cell i.

Claim 20

An arrangement as claimed in claim 14, characterized in that the calculating means in each cell comprises means for communicating with the respective calculating means in only its respective neighbor cells.

Claim 21

An arrangement as claimed in claim 17, characterized in that the calculating means in cell i is asynchronous with respect to the calculating means in the cells other than cell i.