CN111294292A

CN111294292A - Data processing method, device, equipment and storage medium

Info

Publication number: CN111294292A
Application number: CN201811505783.3A
Authority: CN
Inventors: 胡超博; 王萌
Original assignee: Sanechips Technology Co Ltd
Current assignee: Sanechips Technology Co Ltd
Priority date: 2018-12-10
Filing date: 2018-12-10
Publication date: 2020-06-16
Also published as: WO2020119418A1

Abstract

The embodiment of the application provides a data processing method, a device, equipment and a storage medium, wherein the method comprises the following steps: the SA node cuts and marks the data packet sent by the input node to obtain at least one marked cell; transmitting the at least one tag information element to at least one switching node and receiving at least one return information element transmitted by the at least one switching node based on the at least one tag information element; wherein the return information element is obtained after the at least one switching node performs switching processing on the label information element; performing label removal processing and recombination processing on the at least one returned cell to obtain a recombined data packet; and sending the recombined data packet to a target node.

Description

Data processing method, device, equipment and storage medium

Technical Field

The embodiment of the application relates to the technical field of internet, and relates to but is not limited to a data processing method, a device, equipment and a storage medium.

Background

Along with the improvement of broadband requirements and service scale, the industry puts higher requirements on efficient data transmission, and ensuring the stability of data in data transmission under a high-rate channel is the key for realizing efficient data transmission.

The existing switching network design is switched by using cells as basic units, so that a Switching Access (SA) node needs to cut data packets into cells and send the cells to the switching network for switching. Then, after the cells reach their destination, the cells need to be reassembled into a complete data packet.

Since all cells of a data packet need to be sent to different switching nodes load-balanced, the delay for different cells to reach the destination via different switching nodes will be different. Without special handling, cells of the same packet will arrive at the destination node out of order and cells of different packets will be interleaved.

Disclosure of Invention

In view of this, embodiments of the present application provide a data processing method, apparatus, device, and storage medium.

The technical scheme of the embodiment of the application is realized as follows:

in a first aspect, an embodiment of the present application provides a data processing method, which is applied to a data processing system, where the system includes an SA node, an input node, a switching node, and a target node; the method comprises the following steps:

the SA node cuts and marks a data packet sent by an input node to obtain at least one marked cell;

the SA node sending the at least one tag information element to at least one switching node and receiving at least one return information element sent by the at least one switching node based on the at least one tag information element; wherein the return information element is obtained after the at least one switching node performs switching processing on the label information element;

the SA node carries out label removal processing and recombination processing on the at least one returned cell to obtain a recombined data packet;

and the SA node sends the recombined data packet to a target node.

In other embodiments, the SA node performs a cutting and marking process on a data packet sent by an input node to obtain at least one marked cell, including:

the SA node cuts the data packet to obtain at least one cell;

adopting a preset label to mark each cell in the at least one cell to obtain the marked cell;

wherein the preset tag comprises at least one of: destination identification, time identification, pseudo label identification and type identification.

In other embodiments, the method further comprises:

determining the type identifier of the corresponding cell according to the data version of the data packet;

wherein the data version of the data packet comprises: unicast data packets and multicast data packets;

correspondingly, the type identification comprises: unicast and multicast.

In other embodiments, the pseudo tag identification is used to hide a type identification of the cell, the method further comprising:

marking each marked cell as a data cell by the pseudo-mark identification; wherein the pseudo label identification of each of the data cells is the same.

In other embodiments, the method further comprises:

the SA node groups the returned cells according to the preset label of each returned cell to obtain at least one cell group;

correspondingly, the SA node performs label removal processing and reassembly processing on the at least one returned cell to obtain a reassembled data packet, including:

the SA node carries out label removal processing on the returned cells in each cell group;

and according to the time identifier of each returned cell in each cell group, performing recombination processing on the returned cells subjected to the label removal processing to obtain the recombined data packet.

In other embodiments, the SA node groups the return cells according to a preset tag of each return cell to obtain at least one cell group, including:

and the SA node groups the returned cells according to the destination identifier and/or the type identifier in the preset label of each returned cell to obtain at least one cell group.

In other embodiments, the method further comprises:

when the data version of the data packet comprises a unicast data packet and a multicast data packet at the same time, the SA node determines a control label in a preset label corresponding to the unicast data packet and a preset label corresponding to the multicast data packet according to a preset rule;

controlling the data transmission sequence of the unicast data packet and the multicast data packet according to the control label and a preset comparison label; and/or the presence of a gas in the gas,

and determining to delete the preset label corresponding to the unicast data packet or delete the preset label corresponding to the multicast data packet according to the control label and the preset comparison label.

In a second aspect, an embodiment of the present application provides a data processing apparatus, where the apparatus includes:

the first processing unit is used for cutting and marking the data packet sent by the input node to obtain at least one marked cell;

a first sending unit, configured to send the at least one tag cell to at least one switching node;

a receiving unit for receiving at least one return cell sent by the at least one switching node based on the at least one tag cell; wherein the return information element is obtained after the at least one switching node performs switching processing on the label information element;

the second processing unit is used for performing label removal processing and recombination processing on the at least one return cell to obtain a recombined data packet;

and the second sending unit is used for sending the recombined data packet to a target node.

In a third aspect, an embodiment of the present application provides a data processing apparatus, where the apparatus at least includes: a processor and a storage medium configured to store executable instructions, wherein: the processor is configured to execute stored executable instructions;

the executable instructions are configured to perform the data processing method described above.

In a fourth aspect, an embodiment of the present application provides a storage medium, where computer-executable instructions are stored in the storage medium, and the computer-executable instructions are configured to execute the data processing method.

The embodiment of the application provides a data processing method, a device, equipment and a storage medium, wherein the method comprises the following steps: the SA node cuts and marks a data packet sent by an input node to obtain at least one marked cell; the SA node sending the at least one tag information element to at least one switching node and receiving at least one return information element sent by the at least one switching node based on the at least one tag information element; wherein the return information element is obtained after the at least one switching node performs switching processing on the label information element; the SA node carries out label removal processing and recombination processing on the at least one returned cell to obtain a recombined data packet; and the SA node sends the recombined data packet to a target node. Therefore, as the SA node cuts and marks the data packet, the obtained marked cell has a preset label, and when the marked cell is subjected to data exchange processing and returned to a destination node, the marked cell can be distinguished according to the preset label, so that different cells can be ensured to orderly reach the destination node, and the increase of new node resources can be avoided to the greatest extent, thereby improving the application efficiency of the SA node and reducing the quality risk.

Drawings

In the drawings, which are not necessarily drawn to scale, like reference numerals may describe similar components in different views. Like reference numerals having different letter suffixes may represent different examples of similar components. The drawings illustrate generally, by way of example, but not by way of limitation, various embodiments discussed herein.

Fig. 1A is a schematic flow chart illustrating an implementation of a data processing method according to an embodiment of the present application;

FIG. 1B is a block diagram of a data processing system according to an embodiment of the present application;

fig. 2 is a schematic flow chart illustrating an implementation of a data processing method according to a second embodiment of the present application;

fig. 3 is a schematic flow chart illustrating an implementation of a data processing method according to a third embodiment of the present application;

fig. 4 is a schematic flow chart illustrating an implementation of a data processing method according to a fourth embodiment of the present application;

fig. 5 is a schematic structural diagram of an SA-IP node according to an embodiment of the present application;

FIG. 6 is a diagram illustrating a structure of a tag cell according to an embodiment of the present application;

FIG. 7 is a schematic diagram of a tag label according to an embodiment of the present disclosure;

FIG. 8A is a diagram illustrating a structure of a tag cell according to an embodiment of the present application;

FIG. 8B is a schematic diagram of another tag cell according to an embodiment of the present application;

FIG. 9 is a timing diagram of cells formed after fragmentation of a data packet according to an embodiment of the present application;

fig. 10 is a schematic structural diagram of a data processing apparatus according to an embodiment of the present application;

fig. 11 is a schematic structural diagram of a data processing apparatus according to an embodiment of the present application.

Detailed Description

In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the following describes specific technical solutions of the present invention in detail with reference to the accompanying drawings in the embodiments of the present invention. The following examples are intended to illustrate the invention but are not intended to limit the scope of the invention.

In the following description, suffixes such as "module", "component", or "unit" used to denote elements are used only for the convenience of description of the present application, and have no specific meaning by themselves. Thus, "module", "component" or "unit" may be used mixedly.

The design of the switching network is that cells are used as basic units for switching, and the realization process is that the cells are formed by cutting input data packets, for example, the received data packets are cut by SA nodes; then, the SA node sends the cell formed by cutting to a switching node in a switching network, the cell is switched by the switching node, and the processed cell is sent to a target node. After the cells reach the destination node, the destination node reassembles the cells into a complete data packet.

In the current design of the switching network, because a plurality of cells corresponding to one data packet need to be sent to one or more switching nodes in the switching network, when a plurality of switching nodes exist, the cells are switched by the plurality of nodes, and therefore, due to the asynchronous processing process of the plurality of nodes and the different timeliness of the processing of the plurality of nodes, the cells are sent to the target node with different delays after passing through the plurality of nodes. That is, the plurality of cells cannot arrive at the destination node in sequence in the original order in which the cells were fragmented. In addition, when a plurality of data packets are received by the SA node at the same time, the SA node may process and send the plurality of data packets to the switching node at the same time, so that cells in the plurality of data packets are inserted together, and then, when cells corresponding to the plurality of data packets are sent to the target node, the target node combines the cells to form the data packet, a Code Analysis Mode (CAM) technique is required.

Based on at least one of the above problems in the related art, embodiments of the present application provide a data processing method, where a cell is marked by a preset tag, and the marking process enables a unicast data packet and a multicast data packet to be marked and synchronized in a coordinated manner, so that different cells can arrive at a destination node in an orderly manner, and the coordinated and ordered transmission of different packet data can be ensured, thereby implementing an extremely perfect cell order-preserving scheme.

Before describing the data processing method according to the embodiment of the present application, a data processing system applied in the present application is described, and as shown in fig. 1B, the data processing system includes an SA node 11, an input node 12, a switching node 13, and a target node 14.

The SA node 11 is configured to implement the data processing method of the present application, the input node 12 is configured to input a data packet to the SA node 11, the switch node 13 is configured to perform switching processing on a cell sent by the SA node 11, and the target node 14 is configured to receive the cell sent by the switch node 13 through the SA node 11.

In the embodiment of the present application, the number of the input nodes 12 may be one or more, the number of the switching nodes 13 may be one or more, and the number of the target nodes 14 may be one or more. The number of the input nodes 12, the switching nodes 13 and the target nodes 14 can be set according to actual needs, and the embodiment is not limited.

Fig. 1A is a schematic flow chart illustrating an implementation of a data processing method according to an embodiment of the present application, where the method is applied to the data processing system shown in fig. 1B, and as shown in fig. 1A, the method includes:

step S101, the SA node cuts and marks the data packet sent by the input node to obtain at least one marked cell.

Here, the SA node includes a Receive (RC) processing module, a Transmit (TC) processing module, a computation (MAC) processing module, and an Automatic Storage Management (ASM) processing module. Wherein, the process in step S101 is implemented by the RC processing module. Thus, step S101 may be implemented by:

in step S1011, the RC processing module in the SA node obtains the data packet sent by the input node.

Step S1012, the RC processing module performs cutting and marking on the data packet.

In this embodiment, the data packet may be a data packet of any version, such as a unicast data packet or a multicast data packet.

The number of the data packets sent by the input node may be one or more, and when there are a plurality of data packets, the data packets may be data packets of the same version, or data packets of different versions, which is not limited in this embodiment.

When the number of the data packets is multiple, the RC processing module may perform cutting and marking on the multiple data packets at the same time, or the RC processing module may perform cutting and marking on the multiple data packets sequentially according to a preset sequence.

In this embodiment, each tag cell carries a tag label, and the tag label is a preset label. The marked cell is obtained by performing marking processing on a cell formed by cutting the data packet. The characteristic information of the marked cell can be identified through the mark label, and then the cell can be distinguished.

Step S102, the SA node sends the at least one tag information element to at least one switching node, and receives at least one return information element sent by the at least one switching node based on the at least one tag information element.

Here, the at least one switching node forms a switching network, and the switching network is configured to perform switching processing on cell data, where the switching processing may be any existing data processing procedure, and this embodiment does not limit this.

In this embodiment, the return cell is obtained after the at least one switching node performs switching processing on the tag cell. When the at least one label cell is sent to the switching network, at least one switching node in the switching network performs the switching processing on the label cell to obtain a processed cell, namely the return cell, and returns the return cell to the SA node.

In this embodiment, the return cell includes a tag label that is the same as the corresponding tag cell.

In an embodiment of the present application, after the switch node performs switching processing on the tagged cell to obtain the return cell, the MAC processing module in the SA node receives the return cell sent by the switch node, and then sends the return information to the TC processing module, so that the TC processing module performs corresponding processing on the at least one return cell.

Step S103, the SA node carries out label removing processing and recombination processing on the at least one return cell to obtain a recombined data packet.

Here, the de-tagging is used for de-tagging tags in the return cell to form the return cell into an untagged cell. The de-labeling process is the reverse of the labeling process. The de-tagging process does not change the cell information of the returned cell.

The reassembly process is used to combine the unlabeled cells to form a reassembled data packet.

In an embodiment of the present application, an arrangement order of all cells in the reassembled data packet may be the same as an arrangement order of all cells in the data packet sent by the input node, or the arrangement order of all cells in the reassembled data packet has a preset association relationship with the arrangement order of all cells in the data packet sent by the input node.

For example, when the arrangement order of all the cells in the reassembled packet has a preset association relationship with the arrangement order of all the cells in the packet sent by the input node, the association relationship may be a reverse order relationship or a relationship arranged according to a certain rule. The preset association relationship may be stored in the tag, and when the SA node receives the return cell, the SA node may obtain the preset association relationship carried in the return cell, and then sort the return cells after the label removal processing based on the preset association relationship.

In an embodiment of the present application, the number of all cells in the reassembled packet may be the same as or different from the number of cells in the packet sent by the input node.

When the number of all cells in the reassembled data packet is different from the number of cells in the data packet sent by the input node, the following scenario may be corresponded to: the SA node cuts and marks a data packet sent by an input node to obtain M marked cells; the SA node sends the M marked cells to a plurality of switching nodes, the switching nodes mark the M marked cells to obtain N return cells, and the N return cells are sent to the SA node; the SA node carries out label removing processing on the N returned cells to obtain N unlabelled cells, and the N unlabelled cells are recombined to form the recombined data packet. At this time, the number of all cells in the reassembled packet is N, and the number of cells in the packet sent by the input node is M, where M is not equal to N.

In an embodiment of the present application, after the MAC processing module in the SA node receives the return cell, the MAC processing module sends the return cell to the TC processing module, and the TC processing module performs label removal processing on the return cell; then, the TC processing module sends the label-free cell formed after the label removal processing to the ASM processing module; and the ASM processing module carries out the reorganization processing on the label-free cells to obtain the reorganized data packet.

And step S104, the SA node sends the recombined data packet to a target node.

Here, the target node has a correspondence relationship with the transmission node, and the target node has been determined from the data packet when the transmission node transmits the data packet; or, the target node and the switch node have a corresponding relationship, and when the switch node performs the switching processing on the label cell, the target node is determined according to the return cell formed by the switching processing.

In the data processing method provided by the embodiment of the application, the SA node cuts and marks a data packet sent by an input node to obtain at least one marked cell; the SA node sending the at least one tag information element to at least one switching node and receiving at least one return information element sent by the at least one switching node based on the at least one tag information element; the SA node carries out label removal processing and recombination processing on the at least one returned cell to obtain a recombined data packet; and the SA node sends the recombined data packet to a target node. Therefore, as the SA node cuts and marks the data packet, the obtained marked cell has a preset label, and when the marked cell is subjected to data exchange processing and returned to a target node, the marked cell can be identified and distinguished according to the preset label, so that different cells can be ensured to orderly reach the target node, and the increase of new node resources can be avoided to the greatest extent, thereby improving the application efficiency of the SA node and reducing the quality risk.

Fig. 2 is a schematic view of an implementation flow of a data processing method according to a second embodiment of the present application, where the data processing method is applied to a data processing system, and the data processing system includes an SA node, an input node, a switching node, and a target node. As shown in fig. 2, the data processing method includes the steps of:

in step S201, the SA node receives a data packet sent by an input node.

Here, the number of the input nodes may be one or more, and the number of the data packets sent by the input nodes may also be one or more.

Step S202, the SA node cuts the data packet to obtain at least one cell.

Here, the SA node may divide the data packet into cells having a preset length according to an attribute of the data packet. Each cell consists of a header, in which control information is contained, and a field, in which user information or other management information is contained, which is broken down into data blocks.

It should be noted that, when there are a plurality of data packets, the SA node cuts the plurality of data packets to form at least two cells.

Step S203, according to the data version of the data packet, determining the type identifier of the corresponding cell.

Here, the data version of the data packet includes: unicast data packets and multicast data packets; alternatively, the data version of the data packet includes a Time Division Multiplexing (TDM) unicast data packet and a TDM multicast data packet.

When the SA node receives the data packet, the SA node acquires a data version of the data packet, and then determines a type identifier of a corresponding cell according to the data version, wherein the type identifier comprises unicast and multicast; or the type identification comprises TDM unicast and TDM multicast.

Step S204, adopting a preset label to mark each cell in the at least one cell to obtain the marked cell.

Here, the preset tag includes at least one of: destination identification, time identification, pseudo label identification and type identification.

The destination identifier is used for recording an input node Identification (ID) and a target node ID of the cell. Therefore, the input node and the target node of the corresponding cell can be quickly and accurately determined according to the target identifier in the preset label, and the cell can be accurately transmitted to the target node in the transmission process.

The time stamp is used for marking the sending sequence of each cell when a plurality of cells exist. For example, in the process of cutting the data packet, the cells obtained by cutting may be sequentially marked with time marks according to the cutting sequence and the time marks, so that when the cells finally reach the target node, the cells may be reassembled according to the time marks of each cell to form a reassembled data packet having the same arrangement sequence as the original data packet.

The pseudo mark identifier is used for hiding the data type of the cell, that is, the same pseudo mark identifier is used for marking all cells of the data packet, so that all the cells have the same data type, and in the transmission process of the cells, the data types can not be distinguished and different transmission paths are adopted, so that various types of data can be transmitted simultaneously under the same condition, and resources can be effectively saved.

The type identifier is determined according to the data version of the data packet sent by the input node, and the type of each cell represents the same as the data version of the corresponding data packet. For example, when the data version of the data packet is a TDM unicast data packet, the type identifier of the cell is TDM unicast; and when the data version of the data packet is a TDM multicast data packet, the type identifier of the cell is TDM multicast. The type identification is used for distinguishing the type of the corresponding information element. To prevent the occurrence of the condition of different types of cell interleaving combination after the cells of a plurality of types arrive at the target node at the same time.

In this embodiment, a preset tag is used to label each cell, and the labeling process can be implemented by the following steps:

step S2041, the SA node acquires attribute information of a packet sent by the input node.

Here, the attribute information includes at least one of: the data packet generation method comprises the steps of inputting a node ID, a target node ID, the sending time of an input node to a data packet, the time of an SA node receiving the data packet and the data version of the data packet.

Step S2042, determining a preset label according to the attribute information.

In this embodiment, determining the preset tag according to the attribute information may be: determining a destination identifier according to the input node ID and the target node ID; determining a time identifier according to the sending time of the input node to the data packet and the time of the SA node for receiving the data packet; and determining the type identification according to the data version of the data packet. And finally, determining the preset label according to the determined destination identifier, the time identifier, the type identifier and the preset pseudo mark identifier.

Step S2043, according to the preset label, each cell is marked to obtain the marked cell.

Here, the tagging process may be to carry the preset tag on a corresponding cell to form the tagged cell. Thus, by detecting the preset label carried in the marked cell, the attribute information of the corresponding cell can be obtained.

Step S205, the SA node sends the at least one tag information element to at least one switching node and receives at least one return information element sent by the at least one switching node based on the at least one tag information element.

Here, the return cell is obtained after the at least one switching node performs switching processing on the tag cell.

Step S206, the SA node carries out label removing processing and recombination processing on the at least one return cell to obtain a recombined data packet.

Step S207, the SA node sends the reassembled data packet to a target node.

It should be noted that steps S206 to S207 are the same as steps S103 to S104, and the description of this embodiment is omitted.

In the data processing method provided by the embodiment of the application, the SA node cuts the data packet to obtain at least one cell; determining the type identifier of the corresponding cell according to the data version of the data packet; adopting a preset label to mark each cell in the at least one cell to obtain the marked cell; wherein the preset tag comprises at least one of: destination identification, time identification, pseudo label identification and type identification. Therefore, after the cells are marked by the preset labels, the marked cells with the marked attribute information can be obtained, so that the cells can be effectively identified and distinguished when the corresponding cells return to the target node, different cells can be ensured to orderly reach the target node, and a plurality of data packets and various types of data packets can be effectively processed by one SA node, so that the increase of new SA node resources can be avoided to the greatest extent, the application efficiency of the SA node is improved, and the quality risk is reduced.

Fig. 3 is a schematic view of an implementation flow of a data processing method according to a third embodiment of the present application, where the data processing method is applied to a data processing system, and the data processing system includes an SA node, an input node, a switching node, and a target node. As shown in fig. 3, the data processing method includes the steps of:

step S301, the SA node cuts the data packet to obtain at least one cell.

It should be noted that step S301 is the same as step S202, and the description of this embodiment is omitted.

Step S302, a preset label is adopted to mark each cell in the at least one cell to obtain the marked cell.

The pseudo mark is used for hiding the type mark of the cell, so that a plurality of cells of different types are of the same type as a whole, and therefore, the cells of different types can be simultaneously transmitted and processed, and the time delay is greatly reduced.

Step S303, each marked cell is marked as a data cell by the pseudo mark identification.

Here, the pseudo tag identifier is used to tag each tagged cell into a data cell, so that when the tagged cell is transmitted to the switching node, all cells can be transmitted simultaneously without distinguishing data from a message because all cells externally represent a data type. In this embodiment, the pseudo tag identifier of each data cell is the same, that is, the types of tagged cells tagged by the pseudo tag identifier are the same.

Step S304, the SA node sends the at least one tag information element to at least one switching node and receives at least one return information element sent by the at least one switching node based on the at least one tag information element.

Step S305, the SA node groups the return cells according to the preset label of each return cell to obtain at least one cell group.

Here, since the preset tag includes at least one of: destination identification, time identification, pseudo label identification and type identification. Wherein the destination identifier comprises an input node ID and a target node ID; the type identification comprises unicast and multicast, or the type identification comprises TDM unicast and TDM multicast. Then, grouping the return cells in step S305 can be implemented by the following three ways:

the first method is as follows: and grouping the returned cells according to the target identifier in the preset label of each returned cell to obtain at least one cell group.

Here, the destination identifier includes an input node ID and a destination node ID, and therefore, all return cells can be grouped according to the input node ID and/or the destination node ID, and return cells having the same input node ID and/or the same destination node ID are divided into one cell group.

The second method comprises the following steps: and grouping the returned cells according to the type identifier in the preset label of each returned cell to obtain at least one cell group.

Here, the type identifier includes unicast and multicast, or the type identifier includes TDM unicast and TDM multicast, so it may be determined whether the type identifier in the return node is unicast or multicast, or whether the type identifier in the return node is TDM unicast or TDM multicast, and return nodes with the same type identifier are divided into the same tuple.

The third method comprises the following steps: and grouping the returned cells according to the destination identifier and the type identifier in the preset label of each returned cell to obtain at least one cell group.

Here, the destination identifier includes an input node ID and a destination node ID, and the type identifier includes unicast and multicast, or the type identifier includes TDM unicast and TDM multicast, so that return nodes having the same destination identifier and the same type identifier can be divided into the same tuple.

Step S306, the SA node performs label removal processing on the returned cells in each cell group.

Because each cell group comprises the return nodes with the same purpose identification and/or the same type identification, the label removing processing can be carried out by taking the cell group as a unit, and the label removing processing can be carried out on all the return cells in one cell group at the same time.

Step S307, according to the time mark of each returned cell in each cell group, the returned cells after the label removal processing are recombined to obtain the recombined data packet.

After each returned cell is subjected to label removal processing, the time identifiers of all returned cells in each cell group are determined, all returned cells subjected to label removal processing are sorted according to the sequence of the time identifiers of all returned cells, and the returned cells subjected to label removal processing are recombined according to the sequence of arrangement to obtain the recombined data packet.

Step S308, the SA node sends the recombined data packet to a target node.

The data processing method provided by the embodiment of the application adopts the pseudo label identifier to hide the type identifier of the cell, so that the cells of different types have the same type as the whole, and therefore, the cells of different types can be simultaneously sent and processed, and the time delay is greatly reduced. And the preset label comprises a time identifier, so that when the returned cells are recombined, all the returned cells can be sorted according to the time identifier, and the returned cells after the label removal processing are recombined according to the arranging sequence to obtain the recombined data packet. Therefore, the arrangement sequence of the cells in the recombined data packet can be ensured to be consistent with the arrangement sequence of the cells in the data packet sent by the input node, and the transmission sequence of the cells is ensured.

Fig. 4 is a schematic view of an implementation flow of a data processing method according to a fourth embodiment of the present application, where the data processing method is applied to a data processing system, and the data processing system includes an SA node, an input node, a switching node, and a target node. As shown in fig. 4, the data processing method includes the steps of:

step S401, the SA node cuts the data packet to obtain at least one cell.

Step S402, according to the data version of the data packet, determining the type identification of the corresponding cell.

Here, the data version of the data packet includes: unicast data packets and multicast data packets; the type identification of the information element comprises: unicast and multicast.

Step S403, using a preset label to label each cell in the at least one cell to obtain the labeled cell.

Step S404, the SA node sends the at least one tag information element to at least one switching node and receives at least one return information element sent by the at least one switching node based on the at least one tag information element.

Step S405, when the data version of the data packet includes a unicast data packet and a multicast data packet at the same time, the SA node determines a control label according to a preset rule.

It should be noted that this embodiment is performed after the ASM processing module in the SA node receives the return cell.

Here, when the data version of the packet transmitted by the input node includes both the unicast packet and the multicast packet, or the packet is plural and the data versions of the plural packets are different, the ASM processing module in the SA node determines the control tag among the preset tags corresponding to the unicast packet and the preset tags corresponding to the multicast packet according to a preset rule, or the SA node determines the control tag among the preset tags corresponding to the plural packets according to a preset rule.

Step S406, controlling the data transmission sequence of the unicast data packet and the multicast data packet according to the control label and a preset comparison label.

Here, the preset comparison tag is a tag preset by the system, and the preset comparison tag can be adjusted according to the service requirement.

In this embodiment, the relationship between the control tag and the preset comparison tag is determined, and the transmission sequence of the cells corresponding to the data packet is determined according to the determination result.

For example, the time identifier in the control tag and the time identifier in the preset comparison tag may be determined, and when the time identifier in the control tag is greater than the time identifier in the preset comparison tag, if the data packet corresponding to the control tag is a multicast data packet, the cell of the multicast data packet is controlled to be preferentially transmitted.

Step S407, according to the control tag and a preset comparison tag, determining to delete the preset tag corresponding to the unicast data packet, or delete the preset tag corresponding to the multicast data packet.

In this embodiment, the relationship between the control tag and the preset comparison tag is determined, and whether to delete the preset tag corresponding to the cell of the data packet is determined according to the determination result.

For example, the time identifier in the control tag and the time identifier in the preset comparison tag may be determined, and when the time identifier in the control tag is greater than the time identifier in the preset comparison tag, if the data packet corresponding to the control tag is a multicast data packet, the preset tag corresponding to the cell of the multicast data packet is deleted.

Step S408, the SA node carries out label removing processing and recombination processing on the at least one returned cell to obtain a recombined data packet.

And step S409, the SA node sends the recombined data packet to a target node.

It should be noted that steps S408 to S409 are the same as steps S103 to S104, and the description of this embodiment is omitted.

According to the data processing method provided by the embodiment of the application, when the data version of the data packet comprises a unicast data packet and a multicast data packet at the same time, the SA node determines a control label according to a preset rule; and controlling the data transmission sequence of the unicast data packet and the multicast data packet according to the control label and a preset comparison label, and/or determining to delete one of the preset labels corresponding to the unicast data packet and the multicast data packet, so that the risk caused by the fact that the unicast data packet guarantees that the preset labels of the cell receiving sequence and the multicast data packet guarantees that the preset labels of the cell receiving sequence are possibly inconsistent can be avoided.

Based on the foregoing embodiments, the embodiments of the present application further provide a data processing method, so that a unicast data packet and a multicast data packet can be labeled and synchronized in a relatively coordinated manner, thereby implementing an extremely perfect order preserving scheme for ensuring a cell receiving order. Solving the problem that different cells may arrive at the target node out of order; and because the TDM plane and the single multicast plane are not used simultaneously, the TDM plane and the single multicast plane are equivalent to mutual exclusion, resources of a marking plane are multiplexed, including statistics, logic, configuration and the like, and new resources are prevented from being increased to the maximum extent, so that the node application efficiency is improved, and the quality risk is reduced.

The data processing method provided by the embodiment of the application comprises the steps of overall multiplexing labels and synchronous coordination of the multiplexing labels to unicast and multicast.

The data processing method is completed by an SA-IP node (i.e., the SA node) whose protocol is predefined, as shown in fig. 5, which is a schematic view of a composition structure of the SA-IP node provided in the embodiment of the present application. The SA-IP node 50 is mainly composed of the following 4 modules: an RC processing module 51; a TC processing module 52; a MAC processing module 53; an ASM processing module 54. The RC processing module has the main functions of cutting data cells and marking the cells with labels; the main function of the TC processing module is to restore the cell and remove the label; the ASM processing module is mainly used for recombining the cells; the MAC module is responsible for supporting 36 high-speed serses links.

In this embodiment, in the process of synchronously coordinating unicast and multicast by multiplexing the label, the processing path of the single multicast (including unicast and multicast) serving as the RC processing module on the sending side is unchanged, the RC processing module applies the flow control (including internal mark flow control) of the TDM plane to the single multicast sending plane at the same time, so that the mark counts of the two planes are completely the same, and the sending mark is loaded by using the unicast mark as the TDM mark.

The TC processing module as the receiving side separates the received version cells into unicast and multicast label planes, so that the ASM basically does not need to be modified. And the single multicast plane flow control generated by the ASM is combined to the TDM plane.

The method of the embodiment guarantees the normalization of the SA-IP time sequence from the level of the label marking scheme, and realizes the optimization of the link adaptation state and the convergence of the code stream by initializing the strict RC sending and TC receiving side time sequence control constraints, thereby guaranteeing the precision and stability of the link quality.

In this embodiment, the SA node is taken as an SA chip as an example for explanation. In the data processing method provided in this embodiment, cells formed after a data packet is cut are marked by a mark label to form a mark cell, as shown in fig. 6, to apply for the structure schematic diagram of the mark cell provided in this embodiment, a data packet is cut into A, B, C, D four cells in an SA chip, each cell is marked by a label 61 and a label 62, where a is marked as 0, B is marked as 1, C is marked as 2, and D is marked as 3, and finally, the marked mark cell is sent to a target chip 63.

Fig. 7 is a schematic diagram of a tag label structure provided in an embodiment of the present application, and as shown in fig. 7, a data cell 71 and a tag label together form a tag cell, where the tag label includes a destination tag 72, a time tag 73, a pseudo tag identifier 74, and a type tag 75.

The destination tag is mainly used for recording a source chip ID (i.e., the input node ID) and a destination chip ID. The time stamps are mainly used for confirming the sequence of sending out different cells. The pseudo mark is used for displaying whether a pseudo type mark is used. Type labels, which are mainly classified into four types: unicast, multicast, TDM unicast, TDM multicast.

Fig. 8A is a schematic diagram illustrating a structure of a tagged cell provided in an embodiment of the present application, and fig. 8B is a schematic diagram illustrating a structure of another tagged cell provided in an embodiment of the present application, as shown in fig. 8A and 8B, the structure of the tagged cell includes two parts of information (WORD1 and WORD1), where the two parts of information of the tagged cell include a TYPE (TYPE), a Version (VER), a PACKET SIZE (PACKET _ SIZE), a source chip ID (SRC _ SA _ ID), and a destination chip information (FABRIC _ DEST _ INFO) of the cell.

In addition, it should be noted that the numbers "3322222222221111111111981098765432109876543210" and "210" located at the upper part of the tag cell are the codes of the tag cell for identifying the tag cell.

The upper part of fig. 8A is the structure of the tag cell, and the lower part of fig. 8A is the structure of the tag chip of type 2' B00. As shown in fig. 8A, the 2' B00 flag cell is MULTICAST type, and thus, the corresponding destination chip is MULTICAST chip ID (MULTICAST _ ID).

FIG. 8B shows a tag cell structure of type 2' B01, the egress nodes of which are OUT _ PORT [ 7: 0] and OUT _ PORT [ 9: 8].

In the embodiment of the present application, a unicast plane and a TDM plane may be combined based on the multiplexing label scheme. In the merging scheme, the RC processing module, the TC processing module, the MAC processing module, and the ASM processing module respectively execute different actions.

The RC processing module is configured to configure version 3 (where version 3 is a version type with Unicast, multicast, TDM Unicast, and TDM multicast), the Unicast and multicast data stream processing path is unchanged, and a TDM label derived from a Unicast Timestamp (UTS) packet is loaded at a label loading location. And the handling of the UTS and the Multicast Timestamp (MTS) must be consistent, i.e., the UTS and MTS are locked regardless of TDM unicast or TDM Multicast.

In addition, in a cell sent out through a link provided by the MAC processing module, when a unicast validity Time (UTV) and a Multicast validity Time (MTV) are kept to be 0 and secondary label is loaded alternately, a header of the cell mainly has two label fields, one is a TDM Time Stamp (OTS) label field, and this field is always present, and the other field is determined by the delivered content. That is, when the UTV is 0, the cell header has the UTS flag field, and when the MTV is 0, the cell header has the MTV flag field, and the two fields alternately contain a band.

FIG. 9 is a timing diagram of cells formed after the data packet is cut according to the embodiment of the present invention, as shown in FIG. 9, under a conventional condition, the data packet is cut into

cells

91, 92, 93 within a predetermined period (the circumference of the circle in the figure is a predetermined period), wherein the cell 91 is the earliest cut cell, and thus the cell 91 has the oldest mark after marking. And a plurality of

cells

94, 95, 96 formed within a predetermined period under the condition of the timestamp overflow. As can be seen from fig. 9, due to the overflow of the time stamps, it is not possible to determine which cell is the oldest cut cell for a plurality of cells, and thus it is not possible to determine which cell is the oldest cut cell when marking a plurality of cells.

Based on the above problem of cell cutting under the condition of timestamp overflow, in this embodiment, if the delay transmission count is performed after the link transmission Timestamp (TV) is pulled high, the part of logic is multiplexed. It should be noted that, after each time of the version configuration switching, the state of sending the delay count (including unicast and multicast) is backed off, that is, both the link _ UTV (link _ OTV) and the link _ MTV generated here are temporarily pulled low. The scheduling state machine of link selection does not need to be modified, and the response of local flow control is not changed. Finally, the link uplink tag is extracted, and for the release 3 cell, the TDM tag is simultaneously extracted to the link tags UTS _ link and MTS _ link. Thereby enabling correct generation of internally marked fluidics.

In the statistical process, for the statistics of the sending flag, the TDM Valid Time (OTV) and the OTS may be listed separately, but the resource is not increased, and the existing resource is multiplexed. Detection of tag misordering also lists TDM tags separately, but statistically multiplexed on resources. Without modifying the statistics of the transmitted cells.

And the TC processing module is used for copying the TDM mark fields (including OTV, OTS, O _ SRC _ ID and O _ SEQ) in the mark information into a unicast mark and a multicast mark and sending the unicast mark and the multicast mark to the ASM. For TDM unicast cells, the type is unchanged, and both the unicast flag field and the multicast flag field sent to the ASM are filled with TDM flag fields. For TDM multicast cells, the type is unchanged, and both the unicast flag field and the multicast flag field sent to the ASM are filled with TDM flag fields. For null cells, the type is unchanged, and both the unicast flag and multicast flag fields sent to the ASM are filled with TDM flag fields. If receiving unicast/multicast data cell, defining it as illegal, reporting and discarding after interruption.

In the statistical treatment, the statistical method for the TDM cell statistical multiplexing single multicast cell, TDM unicast multiplexing unicast, TDM multicast multiplexing multicast.

The MAC processing module supports not only the transmission and reception of version 0 (where version 0 is a version type with unicast and multicast) cells, but also the transmission and reception of version 3 cells. The MAC processing module increases the extraction and statistics of TDM link and mark flow control.

And the ASM processing module is added with new configuration, and if the ASM processing module is configured in a version 3 cell receiving mode, the unicast oldest mark is compared with the multicast oldest mark to obtain a unique oldest mark for controlling the generation of mark flow control and mark deletion.

Here, the oldest label refers to an earliest label in a plurality of cells. In this embodiment, the unique oldest flag may be determined by comparing the unicast oldest flag with the multicast oldest flag, determining the smallest flag as the unique oldest flag, or selecting one oldest flag that meets a preset condition as the unique oldest flag. The preset condition is determined according to actual needs, and this embodiment is not limited.

In this embodiment, the reason for modifying the mark flow control is that the oldest marks of the unicast order-preserving and the multicast order-preserving may not be consistent, and thus there is a risk. Modifications to the marker stream control are required to avoid risk. Wherein, the risk is that one deletion and one non-deletion of the unicast oldest mark and the multicast oldest mark occur, and the following explains possible situations:

the first condition is as follows: if the oldest label of a unicast is 10, the oldest label of a multicast is 5, and the label inserted in the two oldest labels is 100, it is clear that the inserted label 100 is far beyond 10 and 5. Assuming that the deletion threshold for the oldest mark is 95, then 100 is back-pressed for 10 and 100 is deleted for 5. If 100 comes from the newly inserted SA chip, since the SA has the back-pressure reset or back-pressure low link sending TV function, the joining can be retried. Whereas 100 would not come from a newly inserted Switch Fabric (SF) chip because existing chips in the entire network can control the source tag to be within a certain range, and the tag of the inserted SF chip comes from the source SA chip and cannot reach the deletion threshold with any ASM oldest tag.

Here, the back pressure refers to who has the authority of preferential transmission between the cell of the inserted SA chip and the cell corresponding to the oldest flag, that is, if the flag of the inserted SA chip is back-pressure by the oldest flag of unicast, the cell of the unicast data is preferentially transmitted, and after the transmission of the cell of the unicast data is completed, the cell of the inserted SA chip is retransmitted.

Case two: the inserted marker is between the two oldest markers. This is more common, for example, if the two oldest tags are 5 and 10, respectively, and the inserted tag is 8, then the inserted tag is deleted for 10. If 8 is not subjected to a back pressure of 5, 8 advances to 10 or more, and this state can be released. However, the problem is that 10 and 5 do not exclude a large gap. Theoretically, in the switching network, the maximum value of the mark jump is around a mark back pressure threshold, so that the two oldest marks may have a larger difference, so that the added mark is deleted relative to 10 and is back pressure relative to 5. Since all are from the same link, this link will be back-pressured and the flag will not be updated and will lock.

Based on the above two cases, it can be seen that since there is a possibility that two oldest marks may be back-pressed or deleted from the inserted marks, the two oldest marks need to be unified, that is, a unique oldest mark needs to be determined among the two oldest marks.

The data statistical method provided by the embodiment of the application solves the problem that different cells can arrive at a target node out of order. In addition, as the situation that the TDM plane and the single multicast plane are used simultaneously does not exist, the TDM plane and the single multicast plane are equivalent to mutual exclusion, and the multiplexing of the resources of the marking plane, including statistics, logic, configuration and the like, can avoid the increase of new resources to the maximum extent, thereby improving the efficiency of chip application and reducing the quality risk.

Based on the foregoing embodiments, the present application provides a data processing apparatus, where the apparatus includes units and modules included in the units, and may be implemented by a processor in a data processing device; of course, it may also be implemented by logic circuitry; in implementation, the processor may be a Central Processing Unit (CPU), a Microprocessor (MPU), a Digital Signal Processor (DSP), a Field Programmable Gate Array (FPGA), or the like.

Fig. 10 is a schematic diagram of a configuration of a data processing apparatus according to an embodiment of the present application, and as shown in fig. 10, the data processing apparatus 1000 includes:

a first processing unit 1001, configured to perform cutting and marking on a data packet sent by an input node, to obtain at least one marked cell;

a first sending unit 1002, configured to send the at least one tag information element to at least one switching node;

a receiving unit 1003, configured to receive at least one return cell sent by the at least one switch node based on the at least one tag cell; wherein the return information element is obtained after the at least one switching node performs switching processing on the label information element;

a second processing unit 1004, configured to perform label removal processing and reassembly processing on the at least one returned cell to obtain a reassembled data packet;

a second sending unit 1005, configured to send the reassembled packet to a target node.

In other embodiments, the first processing unit comprises:

the cutting module is used for cutting the data packet to obtain at least one cell;

the marking module is used for marking each cell in the at least one cell by adopting a preset label to obtain the marked cell; wherein the preset tag comprises at least one of: destination identification, time identification, pseudo label identification and type identification.

In other embodiments, the apparatus further comprises: a first determining unit, configured to determine a type identifier of a corresponding cell according to a data version of the data packet; wherein the data version of the data packet comprises: unicast data packets and multicast data packets; correspondingly, the type identification comprises: unicast and multicast.

In other embodiments, the pseudo tag identification is used to hide a type identification of the cell, the apparatus further comprising: a marking unit for marking each marked cell as a data cell by the pseudo mark identifier; wherein the pseudo label identification of each of the data cells is the same.

In other embodiments, the apparatus further comprises: the grouping unit is used for grouping the returned cells according to the preset label of each returned cell to obtain at least one cell group; correspondingly, the second processing unit comprises:

the label removing module is used for carrying out label removing processing on the returned cells in each cell group;

and the recombination module is used for recombining the returned cells after the label removal processing according to the time identifier of each returned cell in each cell group to obtain the recombined data packet.

In other embodiments, the grouping unit includes: and the grouping module is used for grouping the returned cells according to the destination identifier and/or the type identifier in the preset label of each returned cell to obtain at least one cell group.

In other embodiments, the apparatus further comprises:

a second determining unit, configured to, when the data version of the data packet includes both a unicast data packet and a multicast data packet, determine, by the SA node, a control tag in a preset tag corresponding to the unicast data packet and a preset tag corresponding to the multicast data packet according to a preset rule;

the control unit is used for controlling the data transmission sequence of the unicast data packet and the multicast data packet according to the control label and a preset comparison label; and/or determining to delete the preset label corresponding to the unicast data packet or delete the preset label corresponding to the multicast data packet according to the control label and a preset comparison label.

It should be noted that, in the embodiment of the present application, if the data processing method is implemented in the form of a software functional module and sold or used as a standalone product, the data processing method may also be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the embodiments of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a terminal to execute all or part of the methods according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read Only Memory (ROM), a magnetic disk, or an optical disk. Thus, embodiments of the invention are not limited to any specific combination of hardware and software.

Correspondingly, an embodiment of the present application provides a data processing apparatus, fig. 11 is a schematic diagram of a composition structure of the data processing apparatus provided in the embodiment of the present application, and as shown in fig. 11, the data processing apparatus 1100 at least includes: a processor 1101, a communication interface 1102, and a storage medium 1103 configured to store executable instructions, wherein:

the processor 1101 generally controls the overall operation of the data processing device 1100.

The communication interface 1102 may enable the data processing apparatus to communicate with other terminals or servers via a network.

The storage medium 1103 is configured to store instructions and applications executable by the processor 1101, and may also cache data to be processed or already processed by each module in the data processing apparatus 1100 and the processor 1101, and may be implemented by a FLASH Memory (FLASH) or a Random Access Memory (RAM).

It should be appreciated that reference throughout this specification to "one embodiment" or "an embodiment" means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, the appearances of the phrases "in one embodiment" or "in an embodiment" in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. It should be understood that, in various embodiments of the present invention, the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation on the implementation process of the embodiments of the present invention. The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.

It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.

In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. The above-described device embodiments are merely illustrative, for example, the division of the unit is only a logical functional division, and there may be other division ways in actual implementation, such as: multiple units or components may be combined, or may be integrated into another system, or some features may be omitted, or not implemented. In addition, the coupling, direct coupling or communication connection between the components shown or discussed may be through some interfaces, and the indirect coupling or communication connection between the devices or units may be electrical, mechanical or other forms.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units; can be located in one place or distributed on a plurality of network units; some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment. In addition, all the functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may be separately regarded as one unit, or two or more units may be integrated into one unit; the integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.

Those of ordinary skill in the art will understand that: all or part of the steps for realizing the method embodiments can be completed by hardware related to program instructions, the program can be stored in a computer readable storage medium, and the program executes the steps comprising the method embodiments when executed; and the aforementioned storage medium includes: various media that can store program codes, such as a removable Memory device, a Read Only Memory (ROM), a magnetic disk, or an optical disk. Alternatively, the integrated unit of the present invention may be stored in a computer-readable storage medium if it is implemented in the form of a software functional module and sold or used as a separate product. Based on such understanding, the technical solutions of the embodiments of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a terminal to execute all or part of the methods according to the embodiments of the present invention. And the aforementioned storage medium includes: a removable storage device, a ROM, a magnetic or optical disk, or other various media that can store program code.

The above description is only an embodiment of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of changes or substitutions within the technical scope of the present invention, and all such changes or substitutions are included in the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the appended claims.

Claims

1. A data processing method is characterized in that the method is applied to a data processing system, and the system comprises a Switching Access (SA) node, an input node, a switching node and a target node; the method comprises the following steps:

and the SA node sends the recombined data packet to a target node.

2. The method of claim 1, wherein the SA node performs a process of cutting and marking the data packet sent by the input node to obtain at least one marked cell, comprising:

the SA node cuts the data packet to obtain at least one cell;

3. The method of claim 2, further comprising:

correspondingly, the type identification comprises: unicast and multicast.

4. The method of claim 2, wherein the pseudo tag identifies a type identifier used to conceal the cell, the method further comprising:

5. The method of claim 2, further comprising:

6. The method of claim 5, wherein the SA node groups the returned cells according to the preset tag of each returned cell to obtain at least one cell group, comprising:

7. The method of claim 3, further comprising:

and determining to delete the preset label corresponding to the unicast data packet or delete the preset label corresponding to the multicast data packet according to the control label and a preset comparison label.

8. A data processing apparatus, characterized in that the apparatus comprises:

9. A data processing device, characterized in that it comprises at least: a processor and a storage medium configured to store executable instructions, wherein: the processor is configured to execute stored executable instructions;

the executable instructions are configured to perform the data processing method provided by any of the above claims 1 to 7.

10. A storage medium having stored therein computer-executable instructions configured to perform the data processing method provided in any one of claims 1 to 7.