CN105187160A - Encoding method used for grouping and regrouping algebraic exchange engine data packet - Google Patents

Abstract

The invention discloses an encoding method used for grouping and regrouping algebraic exchange engine data packets, which belongs to the technical field of communication and relates to the fields of algebraic exchange and network encoding. The encoding method is an encoding algorithm with a network encoding function in an algebraic exchange system. The encoding algorithm has the functions and characteristics of adding effective redundant information through encoding data cells, and recovering lost cells by using the redundant information when data cell loss occurs, thereby achieving the purpose of enhancing the throughput of the exchange engine.

Description

A kind of coding method for algebraically switching engine packet packet recombining

Technical field

The application relates to communication technical field, refers more particularly to algebraically and exchanges and network code field.

Background technology

Algebraically exchange be a kind of multipath from route switching structure, algebraically distributive lattice theory is applied to from route matrix by this structure, and this structure has completely distributed from route, without advantages such as inner buffer, linear speed and non-jitters.Under guarantee provides the condition of QoS, be applicable to extensive expansion.But this structure can produce internal contention and external blocking, thus result in certain packet loss.In existing algebraically switching system, directly cannot recover for the packet lost, this packet can only be obtained by the mode retransmitted, thus reduce communication efficiency.In order to reduce packet loss, a kind of effective method is merged network code and algebraically switching fabric, utilizes network code to recover the packet lost, thus the packet loss of effective reduction system.

Summary of the invention

The application provides a kind of coding method for algebraically switching engine packet packet recombining, the present invention is exactly the encryption algorithm of packet packet recombining in the algebraically switching engine of coding Network Based, its core is by encoding to packet, add effective redundant information, reduce the Loss Rate of packet in transmitting procedure, thus reach increase network throughput, improve the target of communication quality.

Particularly, the coding method for algebraically switching engine packet packet recombining that the application provides, comprising:

To pretreated cell, according to the information that packet header provides, all cells belonging to same packet are encoded according to the mode of step-by-step XOR, to produce a new coding cell, wherein, described new coding cell comprises certain redundant information, for recovering the cell lost when described redundant information is used for occurring the situation of cell loss concealment in exchange process;

Described new coding cell is encapsulated according to set form.

The beneficial effect of the application is:

The present invention, by encoding to cell of data, adds effective redundant information, thus when there is cell of data loss, can utilize these redundant informations to recover the cell lost, thus reaches the target of the throughput promoting switching engine.

Accompanying drawing explanation

Fig. 1 is the structural representation of the algebraically switching engine in an embodiment with network code function;

Fig. 2 is the schematic diagram of the cataloged procedure of cell in an embodiment;

The schematic diagram of cell format in Fig. 3 (a) embodiment;

The schematic diagram of header definition in Fig. 3 (b) embodiment;

The schematic diagram that in Fig. 3 (c) embodiment, header illustrates.

Embodiment

By reference to the accompanying drawings the application is described in further detail below by embodiment.

Please refer to Fig. 1, is the structural representation of the algebraically switching engine of the coding Network Based in the present invention.The IP packet of standard from N number of input port 1.1.1,1.1.2 ..., 1.1.N enters, and in data preprocessing module 1.2, will add synchronous control signal, and packet is cut into the equal data slice of length and adds packet header control information, and wherein N is positive integer.In Fig. 1, the thick arrow 1 of black represents package, i.e. the Ethernet data bag of standard; After packet enters data preprocessing module 1.2, the thick arrow 2 of grey represents the data slice after being cut, i.e. cell; The thin arrow 3 of grey represents Flow Control, i.e. data synchronizing signal.Coding module 1.3 pairs of coding for information element, the redundant information of generation enters post-module with raw data packets.N number of parallel VOQ module 1.4.1,1.4.2 ..., data are shunted according to output port by 1.4.N, packet are sent into algebraically Switching Module 1.5 by certain dispatching algorithm simultaneously.At N number of Knockdown block 1.6.1,1.6.2 ..., in 1.6.N, the cell belonging to same packet is re-assemblied in a certain order, recovers original packet.Only having when a cell loss concealment having been detected in assembling process, just can start N number of decoder module 1.7.1,1.7.2 ..., 1.7.N, recovers the cell of loss by decoding.

The coding method for algebraically switching engine packet packet recombining in the application, comprising:

To pretreated cell, according to the information that packet header provides, all cells belonging to same packet are encoded according to the mode of step-by-step XOR, to produce a new coding cell, wherein, described new coding cell comprises certain redundant information, for recovering the cell lost when described redundant information is used for occurring the situation of cell loss concealment in exchange process; Described new coding cell is encapsulated according to set form.

As shown in Figure 2, the IP packet Packet1 of a standard is cut into the fixing cell of N number of length to cataloged procedure in data preprocessing module, represents cell in figure with cell.Each cell is made up of, as shown in Fig. 3 (a) header (cellhead) and data (payload).Then data (payload) the part step-by-step XOR of N number of cell is produced the data block of a new coding cell, then be that this coded data block produces a new header and before being attached to this new coded data block according to the form shown in Fig. 3 (b), this creates the terminal a new cell, i.e. N+1 cell cell_N+1.The definition of each flag bit of header is as shown in Fig. 3 (c).We can represent whole cataloged procedure so simply: cell_N+1=cell_1 ⊕ cell_2 ⊕ ... ⊕ cell_N.

Above content is the further description done the application in conjunction with concrete execution mode, can not assert that the concrete enforcement of the application is confined to these explanations.For the application person of an ordinary skill in the technical field, under the prerequisite not departing from the present application design, some simple deduction or replace can also be made.

Claims (1)

1., for a coding method for algebraically switching engine packet packet recombining, it is characterized in that, comprising:

To pretreated cell, according to the information that packet header provides, all cells belonging to same packet are encoded according to the mode of step-by-step XOR, to produce a new coding cell, wherein, described new coding cell comprises certain redundant information, for recovering the cell lost when described redundant information is used for occurring the situation of cell loss concealment in exchange process;

Described new coding cell is encapsulated according to set form.