System for routing messages in a vertex symmetric network by using addresses formed from permutations of the transmission line indicees

Claim 2

A computer implemented method for electronically connecting a source processor computer and a destination processor computer located in a network of a plurality of processor computers interconnected by a plurality of transmission lines for transmitting a message, where each of said plurality of transmission lines has a path between two nodes in a vertex symmetric network consisting of networks defined by graphs C d (k) with degree d, diameter k, and (d+1)!/(d-k+1)! of said processor computers for each d≧k and C d (k,-1) with degree d-1, diameter k+1, and (d+1)!/(d-k+1)! of said processor computers for each d≧k≧4 and one of said processor computers is electronically connected to ones of said transmission lines arriving at each of said nodes, comprising the computer implemented steps of: electronically identifying each processor computer with a unique process address having a permutation of indices chosen a selected number at a time from a predetermined sequence of indices T k ={(a 0 ,a 1 , . . . , a n }, where said source processor computer address is S=(s 0 ,s 1 , . . . ,s k-1 ) and said destination processor computer address is D=(x 0 ,x 1 , . . . ,x k-1 ), k-1≦n and {s,x ε T k }; electronically computing the sequence of addresses of intermediate processor computers defining said routing, wherein said route is directed from a current processor computer process address S M =(s 0 ',s 1 ', . . . ,s k-1 '), where S M is the Mth intermediate processor computer in the routing path from said source processor S, to next processor computer software address S M+1 determined from truncated D M =(X 0 ,X 1 , . . . ,x k-M-1 ) by a first software routine placing x k-M-1 at the front of S M , where s i =x k-M-1 is removed from S M if s i is in S M or s k-1 is dropped if s i is not in S M , and truncating D M to D M+1 =(x 0 ,x 1 , . . . ,x k-M-2 ) for use with S M+1 to electronically compute a next processor computer address; and connecting said S M processor computer to said S M+1 processor computer for transmitting said message and D M+1 .

Claim 3

A method for electronically connecting said processors according to claim 1, including the step of determining a shortest routing path through said network uniquely from said source address S and said destination address D.

Claim 4

A method of electronically connecting said processors according to claim 2, further including the steps of: initiating a second software routine for determining from the relationship of said destination processor computer address D to said source processor computer address S an intermediate initiation processor computer address for initiating said sequence of addresses of said intermediate processor computers and truncating said destination processor address D according to said relationship; transmitting said message and said truncated destination address to said determined intermediate processor computer address; and thereafter initiating said steps of electronically determining said sequence of addresses of intermediate processor computers defining said routing.

Claim 5

A method for electronically routing messages according to claim 3, wherein said second software routine for determining the relationship of said destination processor address to said source processor address includes the following source computer processing steps: comparing the last element of the destination address to the first two elements of said source address; if said last element is found in said first two elements, then comparing said last element with said first element of said source computer address; if said last element is identical with said first element, identifying a first intermediate initiation processor computer as a first special case, else identifying a second intermediate initiation processor computer as a second special case; if said last element is not found in said first two elements, then comparing the next to last element of said destination address with said first element of said source computer address; if said last element is the same as said first element, identifying a third intermediate initiation processor computer address as a third special case, else setting said initiation processor computer address as said source computer address for route determination.

Claim 6

A computer implemented method for electronically connecting a message path between a source electronic processor computer and a destination electronic processor computer located in a network of a plurality of processor computers each having a message routing computer and a connected set of transmission lines, where each of said transmission lines is a path between two processor computers, each located at a node in a vertex symmetric network consisting of networks defined by graphs C d (k) with degree d, diameter k, and (d+1)!/(d-k+1)! of said plurality of electronic processors for each d≧k and C d (k,-1) with degree d-1, diameter k+1, and (d+1)!/(d-k+1)! of said plurality of electronic processor computers for each d≧k≧4 where each processor computer has a process address having a permutation of indices chosen a selected number at a time by a first processor routine from a predetermined sequence of indices T k ={a 0 ,a 1 , . . . ,a n }, where said source processor computer address is S=(s 0 ,s 1 , . . . ,s k-1 ) and said destination processor computer address is D=(x 0 ,x 1 , . . . ,x k-1 ), k-1≦n and {s,x ε T k } and each transmission line in said set of transmission lines has an identifying index selected from a different position in T k , comprising the computer implemented steps of: electronically storing in said message routing computer for each said processor computer a routing table with a sequence of numbers corresponding to the position of each element of said processor computer address in said predetermined sequence of indices; performing a second process routine in said message routing computer for selecting a message transmission line at a processor computer S M after M routing steps from a truncated destination computer address D=(x 0 ,x 1 , . . . ,x k-M-1 ) by locating the element in position x k-M-1 in said table to identify said corresponding transmission line index for message transmission to a subsequent processor computer; and connecting said processor computer S M through said identified transmission line with processor computer S M+1 .

Claim 7

A computer implemented method for electronically connecting a message path between a source electronic processor computer and a destination electronic processor computer located in a network of a plurality of processor computers each having a message routing computer and a connected set of transmission lines, where each of said transmission lines is a path between two processor computers, each located at a node in a vertex symmetric network consisting of networks defined by graphs C d (k) with degree d, diameter k, and (d+1)!/(d-k+1)! of said plurality of electronic processors for each d≧k and C d (k,-1) with degree d-1, diameter k+1, and (d+1)!/(d-k+1)! of said plurality of electronic processor computers for each d≧k≧4 where each processor computer has a process address having a permutation of indices chosen a selected number at a time by a first processor routine from a predetermined sequence of indices T k ={a 0 ,a 1 , . . . ,a n }, where said source processor computer address is S=(s 0 ,s 1 , . . . ,s k-1 ) and said destination processor computer address is D=(x 0 ,x 1 , . . . ,x k-1 ), k-1≦n and {s,x ε T k } and each transmission line in said set of transmission lines has an identifying index selected from a different position in T k , comprising the computer implemented steps of: electronically storing in said message routing computer for each said processor computer a routing table with a sequence of numbers corresponding to the position of each element of said processor computer address in said predetermined sequence of indices; performing a second process routine in said message routing computer for selecting a message transmission line at a processor computer S M after M routing steps from a truncated destination computer address D=(x 0 ,x 1 , . . . ,x k-M-1 ) by locating the element in position x k-M-1 in said table to identify said corresponding transmission line index for message transmission to a subsequent processor computer; and connecting said processor computer S M through said identified transmission line with processor computer S M+1 .

Claim 8

A date transmission network, comprising: a plurality of transmission line sets, each said set consisting of a number of transmission lines one less than the number of indices in a preselected sequence of indices where each transmission line in said set has an identifying index from a different position in said sequence of indices except the zero position; and a plurality of processor computers interconnected by said transmission line sets, where each said processor computer has a first electronic address formed by a unique one of the permutations of indices chosen a selected number at a time from said sequence of indices and a first extended process address formed by appending to said first address the remaining indices from said sequence of indices and is electrically connected by said transmission lines in a one of said sets to second processor computers, each one of said connected second computers having a unique second computer address formed from said first extended address and said identifying index of said connecting transmission line by moving to the zero position of said first extended address the index found at the position within said first extended address corresponding with said connecting transmission line identifying index and then truncating the resulting sequence if indices to the number of indices in said first process address; said plurality of transmission line sets defining a vertex symmetric network with each of said processor computers forming a node of said vertex symmetric network.

Claim 9

A date transmission network, comprising: a plurality of transmission line sets, each said set consisting of a number of transmission lines one less than the number of indices in a preselected sequence of indices where each transmission line in said set has an identifying index from a different position in said sequence of indices except the zero position; and a plurality of processor computers interconnected by said transmission line sets, where each said processor computer has a first electronic address formed by a unique one of the permutations of indices chosen a selected number at a time from said sequence of indices and a first extended process address formed by appending to said first address the remaining indices from said sequence of indices and is electrically connected by said transmission lines in a one of said sets to second processor computers, each one of said connected second computers having a unique second computer address formed from said first extended address and said identifying index of said connecting transmission line by moving to the zero position of said first extended address the index found at the position within said first extended address corresponding with said connecting transmission line identifying index and then truncating the resulting sequence if indices to the number of indices in said first process address; said plurality of transmission line sets defining a vertex symmetric network with each of said processor computers forming a node of said vertex symmetric network.

Claim 10

A data communications network according to claim 6, wherein said vertex symmetric network is selected from graphs C d (k) with degree d, diameter k, and (d+1)!/(d-k+1)!of said plurality of processor computers for each d≧k and C d (k, -1) with degree d-1, diameter k+1, and (d+1)!/(d-k+1)! of said plurality of processor computers for each d≧k≧4.

Claim 11

A data communications network according to claim 7, wherein each said processor computer includes a message routing computer for connecting a first processor computer having a first extended address to a second processor computer having a second extended address determined solely by the extended addresses of a message source processor computer and a message destination processor computer.

Claim 12

A data communications network according to claim 8, wherein a sequence of addresses formed by said message routing computers in said process computers provides a message path along the least number of said transmission lines between said source processor computer and said destination processor computer.

Claim 13

A data communications network according to claim 6, wherein said vertex symmetric network is selected from graphs C d (k), where d is the number of transmission lines in each transmission line set connected to each said processor computer and the least number of transmission lines connecting any two said processor computers in said network is at most k, where d≧k.

Claim 14

A data communications network according to claim 6 where said vertex symmetric network is selected from graphs C d (k,-1), where d is one more than the number of transmission lines in each transmission line set connected to each said processor computer and the least number of transmission channels connecting any two said processor computers in said network is at most k+1, where d≧k≧4.

Claim 15

A communications network according to claim 11, where no processor computer has a transmission line connected to another processor computer to form a network edge in a direction d 1 .