Method of parallel packet switching

FIELD OF THE INVENTION

[0001] The present invention relates to methods of parallel data processing, switching and distribution in telecommunication switching systems and can be usable at development new broadband high-speed telecommunication systems and devices.

BACKGROUND OF THE INVENTION

[0002] The modern telecommunication systems should support high-speed transmission of various data types. To take advantages of the high-speed transmission and high-speed channels, switching devices should provide minimum time of making routing decision and processing capabilities of dynamically varying traffic. Existing systems are based on n-relations of the graph G=(M, L), L⊂Mnn, n>2, as bipartite graphs. These systems perform sequential data processing. The general packet-switching techniques cannot be applied for high-speed networks. New modes and methods of information processing, switching and distribution are required. The offered method is intended for increasing of switching speed and for reaching high and ultra-high rates of processing and distribution of information.

SUMMARY OF THE INVENTION

[0003] The present invention proposes the method of parallel processing, switching and distribution of information of high-speed packet switching systems. The method is based on a mathematical apparatus of the associative theory and algebra of groups. The offered method of parallel packet switching covers new conceptual framework of switching systems, self-routing algorithm and parallel switching. Switching structure is described, as associative switching system and switching procedures are parallel executed as operations of multiplicative group.

BRIEF DESCRIPTION OF THE DRAWINGS

[0004]
FIG. 1 shows the base structure of associative network,

[0005]

FIG. 2

a
shows switching function T,

[0006]

FIG. 2

b
and FIG. 2c show properties of associativity and transitivity of function T,

[0007]

FIG. 2

d
shows property of symmetry (or property of inverse element),

[0008]

FIG. 2

e
shows property of reflexivity (or property of unit element),

[0009]
FIG. 3 shows the set-factor of associative switching structure,

[0010]
FIG. 4 shows scheme of finite state automaton of node input,

[0011]
FIG. 5 shows the substitution system of associative switching structure.

DETAILED DESCRIPTION OF THE INVENTION

[0012] Detailed description of offered method will be represented with accompanying drawings.

[0013] Present invention considers the grouping of switching system. System is described as scheme of nodes with binary relations in the graph G=(M, L), L⊂M2. Initially, arithmetic space with base coordinates i, i∈(1, 2, . . . , k), alphabet A={1, 2, . . . , a} and system F of conversion, F={1-1, 1-2, 2-2, 2-3, etc} should be assigned. The specified switching system will be set up as associative iterative and k-dimensional system. The number k of coordinates determines the dimension of associative space of switching structure: at k=2, it is the 2-D iterative network; at k=3 it is the 3-D iterative network, etc. Network nodes are represented by words of associative calculus and marked as a-bit words, according to number of coordinates. The relations of words are defined by system F. The total N number of network nodes is equal N=ak. FIG. 1 shows the iterative network at parameters: k=3, a=3, N=27. This is base structure of network extension. The word of set N can be transformed to another word of set N. If the word R∈N can be transformed to word S∈N by means of single application of permissible conversion of F, then the word S also can be transformed into word R by the same way. Let R=111, S=112, the words “111” and “112” will be converted as R->S and S->R by means of conversion 1-1, 1-2 of system F. In this case, words R and S are adjacent words, and the network nodes, which are mapping by these words, are adjacent ones. If there is the sequence of pair wise adjacent words R1, R2 . . . Rk (R->R2; R2->R3; . . . , Rk-1->Rk, then this sequence is the deductive chain from node R1 to node Rk. Apparently, there is an oppositely directed deductive chain from node Rk to node R1. In this case, words become equivalent ones, and they are marked as R1∞Rk. If the iterative network has properties of transitivity and associability S∞R and R∞T, then S∞T, (S∞R)*(R∞T)=(S∞T) and (S∞R)=(R∞T)*(S∞T) are valid. The iterative network with binary relations is the iterative associative network. The number of connecting lines of one node is equal to (N-1) number of adjacent nodes. Thus, the deductive chain from any of Si-node to Sj-node; Si, Sj∈N, represents inter-nodal network path. The equivalence of words corresponds to mutual accessibility of each couple of nodes. The switching procedure is implemented in the nodes and relatively each node information transformation will create its own “network configuration”. As it is shown in FIG. 2a, the switching function T transfers the information from node A to uniquely defined node B, B=T (A), where node A is argument A, and function T is function of switching. The associative iterative network is characterized by the next properties. FIG. 2b and FIG. 2c show properties of associativity and transitivity. Property of symmetry (or property of inverse element) is shown in FIG. 2d. Property of reflexivity (or property of unit element) is shown in FIG. 2e.

1Association and transitivity:TSR = (TS) R=T (SR)Symmetry (property of inverse element):function T − S and ST −TS are symmetric onesReflexivity (property of unit element):IA=A, B=B (I), IT=TI

[0014] In an associative iterative network, the word conversion requires the digit-by-digit analysis of words for definition of a full set of deductive chains. This operation can be hard warily realized with the finite state automaton or microprocessor-based hardware. Inter-nodal binary relations designate the set-factor of structure. FIG. 3 shows set-factor of associative switching structure. Set-factor of node describes all connected nodes in numerical order of its outputs and a node set-factor is represented as table's column. Binary relations also can be described relatively to reciprocity relation of node inputs/outputs and connecting lines. Single radius neighborhood (SRN) of node describes one-to-one mapping of current node outputs and lines. Any connecting line is bi-directional one and it connects 2 contiguous nodes. Therefore, input/output line numbers are equal to corresponding numbers of node inputs/outputs and SRN describes ordinal number of connecting lines of current node:

[0015] SRNil={aii, bii, cii, . . . , zll, Sll}, i-node number, i∈N.

[0016] Here, range of definition of node set and single radius neighborhood of each node are equal among themselves. Each node has additional input/output line S for incoming and outgoing traffics. There are two types of data flows. Information data enters and goes out of node through line S and connecting lines {a, b, c, . . . , z} of adjacent nodes. During processing of received packet the address of a receiving node is extracted from the packet's header. If the address of a receiving node coincides with the address of current node, the packet is sent through line S. Otherwise, packet routing decision is carried out and packet will be transferred to another node or it will be buffered. The offered method of parallel packet switching provides the following algorithm of routing. The base structure consists of 27 nodes. Each node is connected to all adjacent nodes by 26 connecting lines. Each couple of nodes has corresponding substitution of SRN from units a, b, c . . . z., which is connecting links. Thus, described structure is the associative iterative switching structure with inter-nodal and exterior lines linking nodes among themselves and information destination ports. The node can be imaged as 3-D uniformly structured “processor”, which implements specialized functions of processing, switching and distribution of information. Each node input is functionally implemented by the scheme of finite state automaton. The total number of internal states of finite state automaton is equal N. The transition from one state in another occurs as result of effect of a pair of signals of (SRN) and Si on an internal condition Sj of the automaton. Then, the automaton produces signal Si (SRN) on one of the outputs, for example, xSi->ySl, where x, y∈(SRN). In this case automaton function is defined by four elements (x, y, Si, Sj) and is implemented by the operator Q: y=Q (x, Si, Sj). Operator Q is determined by multiplicative group of substitution xSl->Sl*Sj->ySj, where *- sign of substitution operation of values (SRN) on itself. FIG. 4 shows the scheme of the automaton for a node input, where L, Q, P—logical, operational, control sub-units, accordingly. All node automatons operate parallel and independently and so, the system data processing rate is sped up. The block Q implements steps of algorithm, P-execution of switching and information transfer. The logical block L realizes the function xSi->ySl of conversion each pair of signals xSl in a signal ySl. Total number of such pairs of signals is defined by number of node inputs/outputs and equal N2.

Substitution of i - node (\begin{matrix} a_{ii}, b_{ii}, c_{cii}, \dots, z_{i} \\ a_{ji}, b_{j}, c_{cji}, \dots, z_{j} \end{matrix}) \begin{matrix} defines inter - nodal connection of inputs / outputs \\ of i - transmitting and j - receiving nodes . \end{matrix}

[0017] This substitution is unique one for couple of nodes. FIG. 5 shows the substitution system of structure. The first column is empty. For definition of substitution system of transmitting node, the corresponding column of set-factor table should be selected and placed instead of the first column of substitution system table. Then, the one-to-one connectivity of inputs and outputs of transmitting and receiving nodes is defined by two rows of system of substitutions. First row is the first row of substitution table, because it appropriates to transmitting node and second row is the row, corresponding to receiving node. Any substitution of transmitting and receiving nodes is divided into cycles of deductive chains. For each couple of nodes there are 9 cycles of total 26 paths. The routing and switching can be done using one of 26 paths:

[0018] Through direct connecting line: <<node >>-<<line>>-<<node>>.

[0019] Through one of 25 routes path: <<node>>-<<1stst line>>-<<intermediate node>>-<<2ndnd line>>-<<node>>.

[0020] Deductive chains are independent chains. That is why path-searching procedures can be parallel executed. If the states of input and output lines of adjacent nodes are known, parallel switching procedures can be performed. Let's designate by X the result of multiplication operation ∫:

X=K

lmn

∫K

st
(lmn),

[0021] where

[0022] Klmn—substitution of lmn-receiving node,

[0023] ∫—multiplication sign of permutation in substitution of receiving node,

[0024] Kstst(lmn)—state of input lines of lmn-receiving node.

[0025] Let matrix I is column matrix as result of matrix logical product of X and Ksoso (ijk)

I=X
({circumflex over ( )})Ksoso(ijk)

[0026] where:

[0027] ({circumflex over ( )})—sign of matrix logical multiplying,

[0028] Ksoso(ijk)—state of output lines of ijk-transmitting node.

[0029] Matrix I consists of “1” and “0” signs, which display in numerical order the idle and busy states of deductive chains through output lines of a transmitting node. Selection of an idle chain can be realized through selection of first of several unities in single-column matrix I. The matrix I should be modified to one-column matrix W, containing only one “1”sign, defining serial number the first idle and accessible path, i.e. that output of transmitting node, through which it is possible to set-up connection between transmitting and receiving nodes. Let matrix P is a triangular unitary matrix of dimension 26×26. Matrix W, as product of logical matrix multiplying, is obtained:

W=|P
({circumflex over ( )})I|{circumflex over ( )}A

[0030] If matrix W doesn't include a “1” sign, it means that, at the present situation, there are no accessible path, and processed packet should be buffered. Parallel processors can realize these procedures of matrix calculation.

[0031] The parallel switching algorithm is described as:

[0032] Algorithm: Parallel switching algorithm (PSA)

21.PSA(packet)2.{3.select addresses (ijk) and (lmn)4.if(lmn==ijk)5.send packet to line S6.stop7.end /* if */8.if(lmn != ijk)9.assign address ijk10.check states Kso (ijk) and Kst (lmn)11.select SRNijk and SRNlmn12.Execute permutation operation in Kso according SRNlmn : X = Klmn ∫ Kst(lmn)13.Execute I = X ({circumflex over ( )}) Kso(ijk)—14.Execute W = | P ({circumflex over ( )}) I | {circumflex over ( )} I15.for I:= 1 to k17.setup path through i-output.18.stop19.end /* if */20.buffer packet21.end /* if */22.}

[0033] The multiple paths between nodes complicate communication protocols. Existing routing protocols are based on processing of packet header and address TAG ⊕ of transmitter and receiver nodes and procedures of paths selection on the basis of the tables, cost optimization functions or self-routing. The offered method belongs to the class of self-routing algorithms. During processing of packet header, all paths between transmitter and receiver nodes and their states/accessibility have being simultaneously checked. Parallel execution of switching is based on: 1) analysis of states and selection of independent deductive chains of different pairs of network nodes; 2) parallel function of node input automatons. The system data processing is sped up to N22 time, according to number of node and parallel processing blocks of each node.

[0034] Scope of invention is limited only by the attached claims.

Method of parallel packet switching

Information

Publication Number

Date Filed

Date Published

Inventors

Original Assignees

CPC

US Classifications

International Classifications

Abstract

Description

Claims