Data communication routing method and device

Claim 2

A routing method for determining communication paths between nodes in a communication network having a plural number of nodes connected by links, wherein a number from 1 to N is assigned to each node in said communication network, and wherein an upper hop limit is set for a number of links that are to be passed by transmitted data, said routing method comprising the steps of: establishing an N×N adjacency matrix, wherein for each element in said adjacency matrix there exists a row number i and a column number j, each of which corresponds to one of said nodes in said communication network, wherein each element in said adjacency matrix is set to a first value if one of said links connects said node corresponding to said row number i and said node corresponding to said column number j associated with that element; copying said adjacency matrix to a temporary adjacency matrix; determining, based on said temporary adjacency matrix, whether there is at least one path between desired nodes in said communication network in which a number of nodes in said path does not exceed said upper hop limit; calculating higher powers of said temporary adjacency matrices if said at least one path does not exist, so long as a number of higher powers of said temporary adjacency matrices does not exceed said upper hop limit, and determining whether there is at least one path between said desired nodes in said communication network in which said number of nodes in said path does not exceed said upper hop limit based said higher powers of said temporary adjacency matrix; selecting elements in said temporary adjacency matrix corresponding to links in said communication network that are included in said at least one path, if is it established that said at least one path exists; deleting said selected elements from said temporary adjacency matrix by altering a value of said selected elements from said first value; and repeating said determining, establishing, selecting and deleting steps using a matrix resulting from a preceding deleting step as a new temporary adjacency matrix until there are no paths between said desired nodes in which a number of nodes traversed by said path is within said upper limit.

Claim 3

A routing method as set forth in claim 1, wherein matrices associated with said higher powers of said temporary adjacency matrix serve as passed nodes information matrices, and if said at least one path between said desired nodes is determined to exist, said routing method further comprises a step of determining a route for said at least one path between said desired nodes based on said matrices associated with said higher powers of said temporary adjacency matrix.

Claim 4

A routing method as set forth in claim 1, wherein if said at least one path between said desired nodes is determined to exist, said routing method further comprises the step of determining a route for said at least path between said desired nodes by: obtaining an immediately previous passed node in said route from a product of a higher power of said temporary adjacency matrix and an inverse of said temporary adjacency matrix; using said product as a new higher power of said temporary adjacency matrix and repeating said obtaining step to obtain additional nodes in said route.

Claim 5

A routing method as set forth in claim 1, wherein said value of said selected elements of said temporary adjacency matrix that correspond to said links in said connection network are deleted by changing said value of said selected elements from said first value to a second value.

Claim 6

A routing method as set forth in claim 4, wherein said deleting step includes deleting one link in said connection network which forms a part of said at least one path between desired nodes, if it is determined that said at least one path between desired nodes exists.

Claim 7

A routing method as set forth in claim 4, wherein said deleting step includes deleting all links in said connection network corresponding to said at least one path between desired, if it is determined that said at least one path between desired nodes exists.

Claim 8

A routing method as set forth in claim 1, further comprising the steps of: setting a predetermined number for said at least one path between desired nodes in said communication network; and terminating said repeating step if said number of paths between desired nodes reaches said predetermined number.

Claim 9

A routing method as set forth in claim 1, further comprising the steps of: storing a process for establishing said higher powers of said temporary adjacency matrix, and if said at least one path between desired nodes is determined to exist in said establishing step based on said higher powers of said temporary adjacency matrix, a route of said at least one path between desired nodes is determined by obtaining an immediately previous passed node using an immediately previous higher power calculation result and said temporary adjacency matrix; again obtaining an immediately previous passed node using said immediately previous higher power calculation result for this passed node and said temporary adjacency matrix; and repeating said obtaining procedures until all passed nodes in said route have been determined.

Claim 10

A routing method as set forth in claim 1, wherein said step of establishing higher powers of said temporary adjacency matrices whereby paths between node i and node j are calculated, is performed for elements of row i only.

Claim 11

A routing method as set forth in claim 8, further comprising a step of storing only a process for establishing said higher powers for row i elements.

Claim 12

A routing method as set forth in claim 8, wherein, if there are two or more nodes suitable for selection as said immediately previous passed node, a node having a fewest entering links connected thereto is selected.

Claim 13

A routing method as set forth in claim 11, wherein, if there are two or more nodes suitable for selection as said immediately previous passed node and a number of entering links connected to these nodes is equal, any node from among said suitable nodes is selected.

Claim 14

A routing method as set forth in claim 11 or 12, wherein said routes of said paths between said desired nodes are determined for each predetermined hop limit.

Claim 15

A routing method as set forth in claim 8, wherein, if there are two or more paths reaching from an origin node to a destination node, a path with a smallest total number of entering links for its passed nodes is selected.

Claim 16

A routing method as set forth in claim 14, wherein said routes of said paths are selected for each predetermined hop limit.

Claim 17

A routing device for determining paths between nodes in a communication network having a plural number of nodes connected by links, and wherein an upper hop limit is set for the number of links that are to be passed by transmitted data; said routing device comprising: means for establishing an adjacency matrix, wherein for each element in said adjacency matrix there exists a row number i and a column number j, each of which corresponds to a node in said communication network, wherein an element in said matrix is set to a first value if there is a link connecting said node corresponding to said row number i and said node corresponding to said column number j associated with that element; means for copying said adjacency matrix to a temporary adjacency matrix; means for determining, based on said temporary adjacency matrix, whether there is at least one path between desired nodes in said communication network in which a number of nodes traversed by said path does not exceed said upper hop limit; means for calculating higher powers of said temporary adjacency matrices if said at least one path does not exist, so long as a number of said higher powers of said temporary adjacency matrices does not exceed said upper hop limit, and determining whether there is at least one path between said desired nodes in said communication network in which said number of nodes in said path does not exceed said upper hop limit based on information in said higher powers of said temporary adjacency matrix; means for selecting elements in said temporary adjacency matrix corresponding to links in said communication network that are included in said at least one path, if is it established that said at least one path exists; means for deleting said selected elements from said temporary adjacency matrix by altering a value of said selected elements from said first value; and means for repeating operations performed by said determining, establishing, selecting and deleting means, wherein a matrix resulting from a preceding operation of said deleting means is used as a new temporary adjacency matrix until there are no paths between said desired nodes in which a number of nodes traversed by said path is within said upper hop limit.

Claim 18

A routing device for determining paths between nodes in a communication network having a plural number of nodes connected by links, and wherein an upper hop limit is set for the number of links that are to be passed by transmitted data; said routing device comprising: means for establishing an adjacency matrix, wherein for each element in said adjacency matrix there exists a row number i and a column number j, each of which corresponds to a node in said communication network, wherein an element in said matrix is set to a first value if there is a link connecting said node corresponding to said row number i and said node corresponding to said column number j associated with that element; means for copying said adjacency matrix to a temporary adjacency matrix; means for determining, based on said temporary adjacency matrix, whether there is at least one path between desired nodes in said communication network in which a number of nodes traversed by said path does not exceed said upper hop limit; means for calculating higher powers of said temporary adjacency matrices if said at least one path does not exist, so long as a number of said higher powers of said temporary adjacency matrices does not exceed said upper hop limit, and determining whether there is at least one path between said desired nodes in said communication network in which said number of nodes in said path does not exceed said upper hop limit based on information in said higher powers of said temporary adjacency matrix; means for selecting elements in said temporary adjacency matrix corresponding to links in said communication network that are included in said at least one path, if is it established that said at least one path exists; means for deleting said selected elements from said temporary adjacency matrix by altering a value of said selected elements from said first value; and means for repeating operations performed by said determining, establishing, selecting and deleting means, wherein a matrix resulting from a preceding operation of said deleting means is used as a new temporary adjacency matrix until there are no paths between said desired nodes in which a number of nodes traversed by said path is within said upper hop limit.

Claim 19

A routing device as set forth in claim 16, further comprising: means for storing passed node information in accordance with matrices corresponding to each higher power of said temporary adjacency matrix; and means for determining a route of said path between said desired nodes in accordance with information in said storing means, if an existence of said path between desired nodes has been established.

Claim 20

A routing device as set forth in claim 16, further comprising means for determining said route of said at least one path, if an existence of said at least one path between desired nodes has been established, by obtaining an immediately previous passed node from a product of a current higher power calculation result and an inverse of said temporary adjacency matrix; using said product as a new higher power calculation result and again obtaining an immediately previous passed node from said product of said new higher power calculation result and said inverse of said temporary adjacency matrix; and repeating this procedure until all passed nodes in said route have been determined.

Claim 21

A routing device as set forth-in claim 16, wherein said means for inputting an adjacency matrix also changes said value of elements of said temporary adjacency matrix that correspond to said selected links that are to be deleted to a second value.

Claim 22

A routing device as set forth in claim 19, wherein said selected links are links which form part of said path between desired nodes, an existence of which has been determined by said means for deciding.

Claim 23

A routing device as set forth in claim 19, wherein said selected links include all links connected to nodes contained within said path between desired nodes, an existence of which has been determined by said means for deciding.

Claim 24

A routing device as set forth in claim 16, wherein said repeating means includes: means for setting a required number of said paths to a predetermined number; and means for stopping operation of said repeating means in accordance with said required number of paths set by this setting means.

Claim 25

A routing device as set forth in claim 16, further comprising: means for storing a process for establishing said higher powers; and means for, if the existence of said at least one path between desired nodes has been established, determining a route of said at least one path by: obtaining an immediately previous passed node using an immediately previous higher power calculation result and said temporary adjacency matrix; again obtaining an immediately previous passed node using said immediately previous higher power calculation result for this passed node and said temporary adjacency matrix; and repeating said obtaining procedures until all passed nodes in said route have been determined.

Claim 26

A routing device as set forth in claim 16, wherein said higher power calculation, whereby paths between node i and node j are calculated, is performed for row i elements only.

Claim 27

A routing device as set forth in claim 23, further comprising means for storing a process for said higher power calculation for row i elements only.

Claim 28

A routing device as set forth in claim 23, further comprising means for selecting a node with a fewest entering links connected thereto, if there are two or more nodes suitable for selection as said immediately previous passed node.

Claim 29

A routing device as set forth in claim 26, further comprising means for, if there are two or more suitable nodes for selection as said immediately previous passed node and a number of entering links connected to said suitable nodes is equal, selecting any one of these suitable nodes.

Claim 30

A routing device as set forth in claims 26 or 27, wherein said routes of said paths are determined for each predetermined hop number.

Claim 31

A routing device as set forth in claim 16, further comprising means for, if there are two or more paths reaching from an origin node to a destination node, selecting a path with a smallest total number of entering links for its passed nodes.

Claim 32

A routing device as set forth in claim 29, wherein said routes of said paths are selected for each predetermined hop number.