CN114124307A

CN114124307A - Data processing method and device, electronic equipment and storage medium

Info

Publication number: CN114124307A
Application number: CN202111438537.2A
Authority: CN
Inventors: 邓杰
Original assignee: New H3C Semiconductor Technology Co Ltd
Current assignee: New H3C Semiconductor Technology Co Ltd
Priority date: 2021-11-30
Filing date: 2021-11-30
Publication date: 2022-03-01
Anticipated expiration: 2041-11-30
Also published as: CN114124307B

Abstract

The embodiment of the application provides a data processing method, a device, an electronic device and a storage medium, wherein in the scheme, a sending end reads data of a channel corresponding to a current time slot according to a corresponding relation between the time slot and the channel recorded in a first physical calendar table to obtain data of a first data structure, and the first data structure is a data structure obtained by organizing the data of the channel corresponding to the current time slot according to the sequence of the current time slot in the first physical calendar table; according to a first mapping relation between the first physical calendar table and the first gasket calendar table, mapping data of the first data structure into data of a second data structure, wherein the second data structure is a data structure obtained by organizing data of a channel corresponding to a current time slot according to the sequence of the current time slot in the first gasket calendar table; the data of the second data structure is transmitted. By applying the technical scheme provided by the embodiment of the application, the complexity of a function realization circuit can be reduced under the condition of keeping the flexibility of FlexE.

Description

Data processing method and device, electronic equipment and storage medium

Technical Field

The present application relates to the field of communications technologies, and in particular, to a data processing method and apparatus, an electronic device, and a storage medium.

Background

The Flexible Ethernet (Flexible Ethernet) technology is a Flexible Ethernet interface standard defined by OIF (Optical internet Forum), and is an interface technology for implementing service isolation and network fragmentation in a bearer network.

The FlexE protocol defines a calendar (calendar) table, which is configured very flexibly, one timeslot can be configured to any one channel, and one channel can contain any number of timeslots within a configurable range, which requires that a function implementation circuit can be designed to meet the maximum burst processing capability, which results in higher complexity of the function implementation circuit and becomes a bottleneck restricting the overall performance or power consumption.

Disclosure of Invention

An object of the embodiments of the present application is to provide a data processing method, an apparatus, an electronic device, and a storage medium, so as to reduce the complexity of a function implementation circuit while maintaining the FlexE flexibility. The specific technical scheme is as follows:

in a first aspect, an embodiment of the present application provides a data processing method, which is applied to a sending end, and the method includes:

reading data of a channel corresponding to a current time slot according to a corresponding relation between the time slot and the channel recorded in a first physical calendar table to obtain data of a first data structure, wherein the first data structure is a data structure obtained by organizing the data of the channel corresponding to the current time slot according to the sequence of the current time slot in the first physical calendar table;

according to a first mapping relation between the first physical calendar table and a first gasket calendar table, mapping data of the first data structure into data of a second data structure, wherein the second data structure is a data structure obtained by organizing data of a channel corresponding to a current beat time slot according to the sequence of the current beat time slot in the first gasket calendar table;

and sending the data of the second data structure.

In a second aspect, an embodiment of the present application provides a data processing method, which is applied to a receiving end, and the method includes:

receiving data of a channel corresponding to a current beat time slot according to a corresponding relation between the time slot and the channel recorded in a first gasket calendar table to obtain data of a second data structure, wherein the second data structure is a data structure obtained by organizing the data of the channel corresponding to the current beat time slot according to a sequence of the current beat time slot in the first gasket calendar table;

mapping the data of the second data structure into data of a first data structure according to a first mapping relation between a first physical calendar table and the first gasket calendar table, wherein the first data structure is a data structure obtained by organizing the data of a channel corresponding to a current time slot according to the sequence of the current time slot in the first physical calendar table;

processing data of the first data structure.

In a third aspect, an embodiment of the present application provides a data processing apparatus, which is applied to a sending end, and the apparatus includes:

the reading unit is used for reading the data of the channel corresponding to the current shooting time slot according to the corresponding relation between the time slot and the channel recorded in the first physical calendar table to obtain the data of a first data structure, wherein the first data structure is a data structure obtained by organizing the data of the channel corresponding to the current shooting time slot according to the sequence of the current shooting time slot in the first physical calendar table;

a mapping unit, configured to map data of the first data structure into data of a second data structure according to a first mapping relationship between the first physical calendar table and a first shim calendar table, where the second data structure is a data structure obtained by organizing data of a channel corresponding to a current beat time slot in the first shim calendar table according to a sequence of the current beat time slot;

a sending unit, configured to send the data of the second data structure.

In a fourth aspect, an embodiment of the present application provides a data processing apparatus, which is applied to a receiving end, where the apparatus includes:

a receiving unit, configured to receive data of a channel corresponding to a current beat time slot according to a correspondence between time slots and channels recorded in a first shim calendar table, to obtain data of a second data structure, where the second data structure is a data structure obtained by organizing data of the channel corresponding to the current beat time slot according to a sequence of the current beat time slot in the first shim calendar table;

a mapping unit, configured to map data of the second data structure into data of a first data structure according to a first mapping relationship between a first physical calendar table and the first shim calendar table, where the first data structure is a data structure obtained by organizing data of a channel corresponding to a current time slot in the first physical calendar table according to a sequence of the current time slot;

a processing unit for processing the data of the first data structure.

In a fifth aspect, embodiments of the present application provide an electronic device, comprising a processor and a machine-readable storage medium, the machine-readable storage medium storing machine-executable instructions executable by the processor, the processor being caused by the machine-executable instructions to implement any of the data processing method steps provided in the first aspect, or to implement any of the data processing method steps provided in the second aspect.

In a sixth aspect, the present application provides a computer-readable storage medium, in which a computer program is stored, and the computer program, when executed by a processor, implements any of the data processing method steps provided in the first aspect, or implements any of the data processing method steps provided in the second aspect.

Embodiments of the present application further provide a computer program product containing instructions, which when run on a computer, cause the computer to perform any of the data processing methods described above.

The embodiment of the application has the following beneficial effects:

in the technical scheme provided by the embodiment of the application, the physical calendar table and the gasket calendar table are configured, and the physical calendar table and the gasket calendar table can be mapped with each other, such as a first mapping relation. The data read or processed is organized in the data structure required by the physical calendar, and only when the data is transmitted, the data organized in the data structure required by the physical calendar needs to be mapped to the data organized in the data structure required by the pad calendar.

Based on this, the user can configure the gasket calendar table at will, and send or receive data according to the data structure required by the gasket calendar table, so that the requirement of the user for sending or receiving data is met, and the FlexE flexibility is reserved. No matter how the user configures the gasket calendar, the data is converted into the data organized by the data structure required by the physical calendar according to the mapping relation between the physical calendar and the gasket calendar, and the data is read or processed according to the specified expected burst processing capacity. Therefore, in the technical scheme provided by the embodiment of the application, under the condition of keeping FlexE flexibility, the complexity of the function implementation circuit can be effectively reduced, so that the function implementation circuit does not become a bottleneck restricting the overall performance or power consumption.

Of course, not all advantages described above need to be achieved at the same time in the practice of any one product or method of the present application.

Drawings

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and it is also obvious for a person skilled in the art to obtain other embodiments according to the drawings.

Fig. 1 is a schematic diagram illustrating a data transmission process in the related art;

FIG. 2 is a schematic diagram of a calendar table configuration;

FIGS. 3 a-3 c are schematic diagrams of a calendar table configured in different configurations;

fig. 4 is a first flowchart of a data processing method according to an embodiment of the present application;

fig. 5 is a second flowchart of a data processing method according to an embodiment of the present application;

fig. 6 is a schematic flow chart of a data processing method according to an embodiment of the present application;

fig. 7 is a fourth flowchart illustrating a data processing method according to an embodiment of the present application;

fig. 8 is a schematic flowchart of a calendar creation method according to an embodiment of the present application;

fig. 9 is a schematic diagram of a data transmission process provided in an embodiment of the present application;

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

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

fig. 12 is a schematic structural diagram of a first electronic device according to an embodiment of the present application;

fig. 13 is a second structural schematic diagram of an electronic device according to an embodiment of the present application.

Detailed Description

The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments that can be derived by one of ordinary skill in the art from the description herein are intended to be within the scope of the present disclosure.

The FlexE technology supports flexible ethernet connection between a router and an optical transmission device, realizes hard pipeline isolation of interface side services, supports remote adjustment of service bandwidth as required, efficiently utilizes each network layer, and improves end-to-end manageability of the network.

Key characteristics of FlexE technology include binding (binding), Channelization (Channelization), and Sub-Rate (Sub-Rate). Wherein, the binding function is used for binding a plurality of PHY (physical) layers into a Group (Group) to realize higher transmission rate; a channelizing function, configured to implement transmission of a multi-channel low-rate MAC (Media Access Control) layer in a Group in a time division multiplexing manner; and a subrate function for implementing a reduced speed transmission, such as ethernet stream of 75G carried on a 100G port.

The FlexE protocol allows a plurality of 50G or 100G PHYs to be bound to a Group, then the transmission bandwidth of the Group is divided into a plurality of slots (slots) in a time division multiplexing manner, each slot represents a 5G bandwidth, then the slots are divided into different channels (channels) through a calendar (calendar) table, and each channel performs data transmission in the slot to which the channel belongs, so that the parallel operation of a plurality of channels is realized, and hard pipelines between the channels are isolated.

The calendar table records the allocation rule of the slot, and the stored content is the channel identifier (channel _ id), that is, the calendar table records the corresponding relationship between the slot and the channel. For example, when 4 100G PHYs are bound to 1 400G Group, the Group includes 80 slots with 5G bandwidth, each slot is allocated with a channel _ id, that is, it indicates to which channel the slot belongs, and each channel can transmit data in the slot belonging to itself. For example, the calendar table shown in table 1 records 80 slots, and the value in each table is channel _ id, for example, the number 3 indicates that channel _ id is 3, and channel 3 can transmit data on the slot with channel _ id being 3.

TABLE 1

3

x

3

x

3

x

3

x

The Flexe protocol defines two calendar tables, calendar-A and calendar-B, which are dynamically switchable with respect to each other and allow dynamic reconfiguration. When using the calendar-A table, the device can modify the calendar-B table, and after the calendar-B modification is completed, the device uses the calendar-B table for data transmission, and vice versa. Different configurations of the calendar table represent different channel bandwidths, and flexible adjustment of the channel bandwidths can be realized through dynamic reconfiguration and switching of the calendar table.

In addition, the FlexE protocol is a full-duplex protocol, and a transmitting module (TX) and a receiving module (RX) of the device operate simultaneously. As shown in fig. 1, in the data transmission process, in fig. 1, a device a and a device B have a FlexE interface and communicate using a FlexE protocol. To ensure normal transmission of data, TX of device a and RX of device B use the same calendar table configuration, and RX of device a and TX of device B use the same calendar table configuration; however, the configuration of the calendar table used by TX and RX of device a is not necessarily the same, and the configuration of the calendar table used by TX and RX of device B is not necessarily the same, e.g., as shown in fig. 1, the configuration of calendar-a used by TX of device a and RX of device B, and the configuration of calendar-B used by RX and TX of device a.

In the standard implementation defined by the FlexE protocol, the configuration of the calendar table is very flexible, one slot can be configured to any channel, and one channel can contain any number of slots within the configurable range.

Taking a 400G Group as an example, a 400G bandwidth can be divided into 80 slots of 5G bandwidth, that is, 80 slots are taken as a cycle, and if 80 slots are configured with different channel _ ids, at most 80 channels are supported.

The FlexE protocol defines a slot to transmit a 64B/66B block of data. In circuit implementation, data of a plurality of slots can be transmitted in parallel in one clock period to reduce the clock frequency. For example, as shown in the calendar table configuration shown in fig. 2, data of 8 slots is transmitted in parallel in one clock cycle, that is, the data is divided into 8 lanes, one clock cycle is 1 beat, that is, 1 beat transmits data of 8 slots, and data of 80 slots needs 10 beats to complete transmission, that is, cyc0 to cyc9 transmits data of 80 slots. And starting the next cycle after traversing 80 slots.

Currently, the configuration modes of the calendar table are divided into three types: the first configuration mode is that data of one channel is sent in a centralized mode, the second configuration mode is that data of one channel is sent in a scattered mode to different beats, and the third configuration mode is that data of one channel is sent randomly.

The allocation of 50G bandwidth to channel n will be described with reference to the calendar table configuration shown in fig. 2. channel n takes 50/5-10 slots. Configuring the calendar table in a first configuration is shown in FIG. 3 a; configuring the calendar table in a second configuration is shown in FIG. 3 b; configuring the calendar table in the third configuration is shown in fig. 3 c. In fig. 3 a-3 c, the slot defined by the bold rectangular box is configured as channel n.

The first configuration requires the maximum burst processing capability, because in this configuration, one channel is required to process data of 8 slots at maximum in one beat; the second configuration mode requires the lowest burst processing capacity, only one slot data is processed in one beat, and channel bursts are more uniform; the third configuration has a requirement for burst processing capability that is intermediate between the first two configurations.

The greater the required burst processing capacity, the more data that needs to be sent or received per beat, and the greater the required buffer bandwidth. Because the data is stored according to the channels, the channels are independent from each other, if each channel is designed according to the maximum burst processing capacity, the required data bandwidth and the data processing capacity are very large, and the complexity of a function realization circuit is very high.

Because the flexibility of the configuration of the calendar table is too large, the function implementation circuit is too complex, even if a certain channel bandwidth is only 50G, when the first configuration mode is adopted, the function implementation circuit still needs to be designed according to the maximum burst processing capacity, and therefore the following two problems can be brought about:

the problem with the first aspect is that the function implementation circuit can become a bottleneck for the overall implementation.

When the frequency needs to be integrally increased to improve the processing capacity of the chip, the time sequence of the function realization circuit is strained to become the time sequence bottleneck of the function realization circuit; when the overall frequency needs to be reduced to reduce power consumption, the frequency cannot be further reduced to meet the burst processing capability.

The second aspect has a problem that flexibility of FlexE is lost if the user is restricted from configuring the calendar table according to a certain rule by artificially restricting the configuration of the calendar table.

In order to solve the above problem, embodiments of the present application provide a data processing method, which can be applied to an electronic device having a FlexE interface, that is, the electronic device communicates with other devices using a FlexE protocol. The electronic device may be a network device such as a router or a switch having a FlexE interface.

The electronic device is configured with a physical calendar table and a gasket calendar table, and the physical calendar table and the gasket calendar table can be mapped with each other, such as a first mapping relation. The data read or processed is organized in the data structure required by the physical calendar, and only when the data is transmitted, the data organized in the data structure required by the physical calendar needs to be mapped to the data organized in the data structure required by the pad calendar.

The data processing method provided in the embodiments of the present application is described in detail below with specific embodiments.

As shown in fig. 4, fig. 4 is a first flowchart of a data processing method provided in this embodiment, where the data processing method is applied to a sending end, and the sending end stores a first physical calendar table and a first shim calendar table, and a first mapping relationship between the first physical calendar table and the first shim calendar table. The first gasket calendar table is a calendar table defined by a Flexe protocol, and a user can flexibly configure the calendar table according to requirements. The data processing method comprises the following steps:

step S41, according to the correspondence between the time slot and the channel recorded in the first physical calendar, reading the data of the channel corresponding to the time slot of the current beat, to obtain the data of the first data structure, where the first data structure is obtained by organizing the data of the channel corresponding to the time slot of the current beat according to the sequence of the time slots of the current beat in the first physical calendar.

In the embodiment of the present application, a beat time slot refers to a time slot of a current beat. A beat may include a plurality of slots, as shown in fig. 2, and a beat includes 8 slots, one slot corresponding to data of one channel.

In order to reduce the complexity of the function realization circuit, the maximum burst processing capacity required for allocating time slots for the channels according to the first physical calendar table is lower than the maximum burst processing capacity required for allocating time slots for the channels according to the first gasket calendar table.

Optionally, one cycle includes all slots included in one Group. Taking the first channel as an example, in each beat recorded by the first physical calendar table, the number of time slots corresponding to the first channel is less than or equal to a first numerical value; the product of the first value and the number of beats included in one cycle is a second value, and the second value is a multiple of the number of beats included in one cycle and is greater than or equal to the minimum value of the number of time slots corresponding to the first channel.

For example, a cycle includes 80 slots, a cycle includes 10 beats, and the number of slots corresponding to channel a in a cycle is 7. At this time, for the channel a, the minimum value of the multiple of 10 beats and greater than or equal to the time slot number 7 is 10, that is, the second value is 10, and the corresponding first value is 10/10 equal to 1, so that the time slot number corresponding to the channel a is less than or equal to 1 in each beat of the first physical calendar entry.

The first physical calendar table is configured in such a configuration manner, so that the data of one channel is horizontally placed and dispersed to different beats, as shown in fig. 3b, which reduces the requirement on the burst processing function to the maximum extent and reduces the complexity of the function implementation circuit to the maximum extent.

Taking a 400G Group as an example, the 400G Group includes 8 channels with 50G bandwidth, the first pad calendar table is shown in table 2, and in table 2, CHN indicates a channel. The bandwidth of each channel is not large, but in the configuration mode shown in table 2, the data of each channel is sent in two beats in a centralized manner, and each channel needs to be designed according to the maximum burst processing capacity every 10 beats in a cycle.

TABLE 2

1 beat

2 pat

3 clap

4 pat

5 pat

6 pat

7 pat

8 pat

9 pat

10 pat

CHN-1

CHN-2

CHN-3

CHN-4

CHN-5

CHN-6

CHN-7

CHN-8

CHN-1

CHN-2

CHN-3

CHN-4

CHN-5

CHN-6

CHN-7

CHN-8

CHN-1

CHN-2

CHN-3

CHN-4

CHN-5

CHN-6

CHN-7

CHN-8

CHN-1

CHN-2

CHN-3

CHN-4

CHN-5

CHN-6

CHN-7

CHN-8

CHN-1

CHN-2

CHN-3

CHN-4

CHN-5

CHN-6

CHN-7

CHN-8

CHN-1

CHN-2

CHN-3

CHN-4

CHN-5

CHN-6

CHN-7

CHN-8

CHN-1

CHN-2

CHN-3

CHN-4

CHN-5

CHN-6

CHN-7

CHN-8

CHN-1

CHN-2

CHN-3

CHN-4

CHN-5

CHN-6

CHN-7

CHN-8

When using dual calendar tables (including a shim calendar table and a physical calendar table), the shim calendar table is mapped to the physical calendar table, as shown in table 3, where CHN represents a channel in table 3. In the physical calendar table, there are also 8 50G channels, the data of each channel is dispersed into 10 beats for transmission, each beat only needs to process the data of the channel of 1 slot, and when the data structure is organized according to the mapped physical calendar table, the function implementation circuit (i.e. the post-stage circuit) will be simplified.

TABLE 3

In this embodiment of the application, a sending end organizes a data structure according to a form of a first physical calendar table, that is, the sending end reads data of a channel corresponding to a current beat time slot from a buffer according to a corresponding relationship between a time slot and a channel recorded in the first physical calendar table to obtain data of the first data structure, where the first data structure is a data structure obtained by organizing data of a channel corresponding to a current beat time slot according to a sequence of the current beat time slot in the first physical calendar table, and as in table 3, reads data of channels corresponding to 8 time slots of 1 beat, and the obtained data of the first data structure is: the data of CHN-1 to CHN-8 are organized in the order of slot 1 to slot 8.

It will be appreciated that the data structure indicates in which time slot of the current beat the data for each channel is transmitted.

Step S42, according to the first mapping relationship between the first physical calendar table and the first shim calendar table, map the data of the first data structure to the data of the second data structure, where the second data structure is a data structure obtained by organizing the data of the channel corresponding to the current beat time slot according to the sequence of the current beat time slot in the first shim calendar table.

In the embodiment of the application, the sending end stores a first mapping relation between a first physical calendar table and a first gasket calendar table. After obtaining the data of the first data structure, the sending end maps the data of the first data structure into the data of the data structure organized according to the form of the first gasket calendar according to the first mapping relation, and obtains the data of the second data structure.

Step S43, the data of the second data structure is sent.

And after obtaining the data of the second data structure, the sending end sends the data of the second data structure.

In the technical scheme provided by the embodiment of the application, the sending end is configured with the physical calendar table and the gasket calendar table, and the physical calendar table and the gasket calendar table can be mapped with each other, such as a first mapping relation. The read data is organized in the data structure required by the physical calendar table, and only when the data is transmitted, the data organized in the data structure required by the physical calendar table needs to be mapped to the data organized in the data structure required by the pad calendar table.

Based on this, the user can configure the gasket calendar table at will, and send or receive data according to the data structure required by the gasket calendar table, so that the requirement of the user for sending or receiving data is met, and the FlexE flexibility is reserved. No matter how the user configures the gasket calendar table, the data is converted into the data organized by the data structure required by the physical calendar table according to the mapping relation between the physical calendar table and the gasket calendar table, and the data is read according to the specified expected burst processing capacity. Therefore, in the technical scheme provided by the embodiment of the application, under the condition of keeping FlexE flexibility, the complexity of the function implementation circuit can be effectively reduced, so that the function implementation circuit does not become a bottleneck restricting the overall performance or power consumption.

In an embodiment of the present application, the sender may store a plurality of shim calendars and a plurality of physical calendar tables, for example, a second shim calendar table and a second physical calendar table. In this case, an embodiment of the present application further provides a data processing method, as shown in fig. 5, where the method is applied to a sending end, and may include the following steps:

and step S51, receiving a calendar table switching request, wherein the calendar table switching request instructs the sending end to switch the first gasket calendar table to the second gasket calendar table.

In the embodiment of the application, when the sending end or the receiving end needs to modify the first pad calendar, or when the network condition or the user requirement changes, the user can input a calendar switching request to the sending end.

The sender switches from the first shim calendar table to the second shim calendar table based on the calendar table switching request, and executes step S52-step S54, and processes data according to the second physical calendar table and the second shim calendar table corresponding to the second shim calendar table, and the specific processing procedure may refer to the description of step S41-step S43, which is not described herein again.

And step S52, reading the data of the channel corresponding to the time slot of the current beat according to the corresponding relationship between the time slot and the channel recorded in the second physical calendar table corresponding to the second gasket calendar table, and obtaining the data of a third data structure, wherein the third data structure is the data structure obtained by organizing the data of the channel corresponding to the time slot of the current beat according to the sequence of the time slot of the current beat in the second physical calendar table.

And step S53, according to the second mapping relation between the second physical calendar table and the second gasket calendar table, mapping the data of the third data structure into the data of a fourth data structure, wherein the fourth data structure is a data structure obtained by organizing the data of the channel corresponding to the beat time slot according to the order of the beat time slot in the second gasket calendar table.

Step S54, the data of the fourth data structure is sent.

According to the technical scheme, the sending end can dynamically switch the first gasket calendar table and the second gasket calendar table with each other, so that the gasket calendar tables can be dynamically modified, and the flexible adjustment of the channel bandwidth is realized.

Corresponding to the data processing method applied to the transmitting end, an embodiment of the present invention further provides a data processing method, as shown in fig. 6, applied to the receiving end, where the method includes the following steps:

and step S61, receiving the data of the channel corresponding to the current beat time slot according to the corresponding relationship between the time slot and the channel recorded in the first gasket calendar table, and obtaining the data of a second data structure, wherein the second data structure is the data structure obtained by organizing the data of the channel corresponding to the current beat time slot according to the sequence of the current beat time slot in the first gasket calendar table.

In the embodiment of the application, in order to reduce the complexity of the function implementation circuit, the maximum burst processing capacity required for allocating the time slot for the channel according to the first physical calendar table is lower than the maximum burst processing capacity required for allocating the time slot for the channel according to the first gasket calendar table.

Optionally, one cycle includes all slots included in one Group. Taking the first channel as an example, in each beat recorded by the first physical calendar table, the number of time slots corresponding to the first channel is less than or equal to a first numerical value; the product of the first value and the number of beats included in a cycle is a second value which is a multiple of the number of beats included in the cycle and is greater than or equal to the minimum value of the number of slots.

In this embodiment of the application, the receiving end organizes the data structure according to the form of the first pad calendar table, that is, the receiving end receives the data of the channel corresponding to the time slot when the beat time slot according to the correspondence between the time slot and the channel recorded in the first pad calendar table, so as to obtain the data of the first data structure.

And step S62, according to a first mapping relation between the first physical calendar table and the first gasket calendar table, mapping the data of the second data structure into the data of the first data structure, wherein the first data structure is a data structure obtained by organizing the data of the channel corresponding to the time slot of the time beat in the first physical calendar table according to the sequence of the time slot of the time beat.

In the embodiment of the application, the receiving end stores a first mapping relation between the first physical calendar table and the first gasket calendar table. After obtaining the data of the second data structure, the receiving end maps the data of the second data structure into the data of the data structure organized according to the form of the first physical calendar according to the first mapping relation, and obtains the data of the first data structure.

In step S63, the data of the first data structure is processed.

And after the data of the first data structure is obtained, the receiving end processes the data of the first data structure.

In the technical scheme provided by the embodiment of the application, the receiving end is configured with the physical calendar table and the gasket calendar table, and the physical calendar table and the gasket calendar table can be mapped with each other, such as a first mapping relation. The processed data is organized in the data structure required by the physical calendar table, and only when the data is transmitted, the data organized in the data structure required by the physical calendar table needs to be mapped to the data organized in the data structure required by the pad calendar table.

Based on this, the user can configure the gasket calendar table at will, and send or receive data according to the data structure required by the gasket calendar table, so that the requirement of the user for sending or receiving data is met, and the FlexE flexibility is reserved. No matter how the user configures the gasket calendar table, the data is converted into the data organized by the data structure required by the physical calendar table according to the mapping relation between the physical calendar table and the gasket calendar table, and the data is processed according to the specified expected burst processing capacity. Therefore, in the technical scheme provided by the embodiment of the application, under the condition of keeping FlexE flexibility, the complexity of the function implementation circuit can be effectively reduced, so that the function implementation circuit does not become a bottleneck restricting the overall performance or power consumption.

In an embodiment of the present application, the receiving end may store a plurality of shim calendars and a plurality of physical calendar tables, for example, the receiving end further stores a second shim calendar table and a second physical calendar table. In this case, an embodiment of the present application further provides a data processing method, as shown in fig. 7, where the method is applied to a receiving end, and may include the following steps:

step S71, receiving a calendar table switching request, where the calendar table switching request instructs the receiving end to switch the first pad calendar table to the second pad calendar table.

In the embodiment of the application, when the sending end or the receiving end needs to modify the first pad calendar, or when the network condition or the user requirement changes, the user can input a calendar switching request to the receiving end.

The receiving end switches from the first pad calendar table to the second pad calendar table based on the calendar table switching request, and executes step S72-step S74, and processes data according to the second physical calendar table and the second pad calendar table corresponding to the second pad calendar table, and the specific processing procedure may refer to the description of step S61-step S63, which is not described herein again.

And step S72, receiving the data of the channel corresponding to the current beat time slot according to the corresponding relationship between the time slot and the channel recorded in the second gasket calendar table, and obtaining the data of a fourth data structure, wherein the fourth data structure is the data structure obtained by organizing the data of the channel corresponding to the current beat time slot according to the sequence of the current beat time slot in the second gasket calendar table.

And step S73, according to a second mapping relation between the second physical calendar table and the second gasket calendar table, mapping the data of the fourth data structure into the data of a third data structure, wherein the third data structure is a data structure obtained by organizing the data of the channel corresponding to the current time slot according to the sequence of the current time slot in the second physical calendar table.

In step S74, the data of the third data structure is processed.

According to the technical scheme, the receiving end can dynamically switch the first gasket calendar table and the second gasket calendar table with each other, so that the gasket calendar tables can be dynamically modified, and the flexible adjustment of the channel bandwidth is realized.

Based on the data processing method shown in fig. 4 or fig. 6, an embodiment of the present application further provides a flowchart of a calendar creation method, as shown in fig. 8, the method may be applied to a sending end or a receiving end, and for convenience of description, the following description is made by taking a device as an execution subject. The data processing method comprises the following steps:

in step S81, a first pad calendar is obtained.

In one example, upon initiating a calendar stored in the device, the user may create a first shim calendar on the device.

In another example, the device may obtain the first shim calendar after receiving a calendar switch request to switch from the first shim calendar to the second shim calendar.

The embodiment of the present application does not specifically limit the timing and manner of obtaining the first gasket calendar table.

Step S82, converting the first pad calendar into a first physical calendar according to the first mapping relationship.

In the embodiment of the application, a first mapping relation between a first physical calendar table and a first gasket calendar table is stored in the device. The device maps the first pad calendar table according to the first mapping relationship, converts the first pad calendar table into a first physical calendar table,

in the technical scheme provided by the embodiment of the application, a user can configure the first gasket calendar table according to requirements, and then the first gasket calendar table is converted into the first physical calendar table according to the first mapping relation, that is, the first gasket calendar table is converted into the physical calendar table with lower requirement on the burst processing function, so that the complexity of the function realization circuit is reduced.

Similarly, for the process of converting the second gasket calendar table into the second physical calendar table, refer to fig. 8, which is not described herein again.

The following describes a data processing method provided in the embodiment of the present application with reference to a data transmission process shown in fig. 9. For convenience of description, the Shim calendar defined by the FlexE protocol is referred to as Shimcalendar, the added physical calendar is referred to as MAC calendar, the names are only for description, and the modules for realizing the Shimcalendar and the MAC calendar are not limited in the embodiment of the application. The mapping relationship between Shim calendar and MAC calendar is called Map.

In fig. 9, a device a and a device B have a FlexE interface and communicate using the FlexE protocol.

Wherein, the device A is provided with two Shim calibers which are respectively Shim-CLDR-A and Shim-CLDR-B, and the device A is provided with two MAC calibers which are respectively MAC-CLDR-A and MAC-CLDR-B. The mapping relationship between Shim-CLDR-A and MAC-CLDR-A is represented by Map-A, and the mapping relationship between Shim-CLDR-B and MAC-CLDR-B is represented by Map-B.

Device B has two Shim capsendar, Shim-CLDR-A and Shim-CLDR-B, respectively, and device B has two MAC capsendar, MAC-CLDR-A 'and MAC-CLDR-B', respectively. Two Shim calendar calendars and two MAC calendars are respectively arranged in the equipment A and the equipment B so as to realize the calendar dynamic switching function. The mapping relationship between Shim-CLDR-A and MAC-CLDR-A 'is represented by Map-A', and the mapping relationship between Shim-CLDR-B and MAC-CLDR-B 'is represented by Map-B'.

In the embodiment of the application, Map-A and Map-A' can be the same or different. If Map-A and Map-A 'are the same, then MAC-CLDR-A and MAC-CLDR-A' are the same; if Map-B and Map-B 'are identical, then MAC-CLDR-B and MAC-CLDR-B' are identical.

Taking the example that the TX of the device a transmits data to the RX of the device B, the specific implementation manner can be seen in steps one to four.

Step one, a user configures TX of the equipment A and Shim calendar in RX of the equipment B according to requirements.

As shown in fig. 9, the user creates Shim-CLDR- A and Shim-CLDR-B in TX of device A and RX of device B, respectively. The manner in which TX synchronizes with Shim calendar in RX in device a and the manner in which TX synchronizes with Shim calendar in RX in device B are not particularly limited.

And step two, creating a mapping relation, and establishing one-to-one mapping between the Shim calendar and the MAC calendar.

As shown in FIG. 9, the TX of device A creates Map-A and Map-B, maps Shim-CLDR-A and MAC-CLDR-A one by one, and maps Shim-CLDR-B and MAC-CLDR-B one by one; RX creation of device B and Map-A 'and Map-B', mapping Shim-CLDR-A to MAC-CLDR-A 'one to one, mapping Shim-CLDR-B to MAC-CLDR-B'.

In the embodiment of the application, the principle of making Map base is a form of simplifying MAC calendar so as to ensure that the function can be simplified to realize the circuit.

In addition, in the embodiment of the application, maps of the TX side and the RX side in the same device are allowed to be inconsistent, one-to-one mapping is satisfied, and the circuit design can be simplified. For example, Map may be configured such that data of the same channel is transmitted/received in multiple beats as dispersed as possible, thereby reducing the amount of data transmitted or received in the same beat. In the embodiment of the present application, the configuration rule of the MAC calendar is: the data of one channel is horizontally placed and distributed to different beats so as to reduce the requirement of a burst processing function.

And step three, when the TX side sends data, firstly organizing a data structure according to the form of MAC calendar, then mapping the data into the data structure organized according to the form of Shim calendar according to Map, and then sending the data through Flexe.

When transmitting datA, the TX of device A first maps the datA into A datA structure organized in the form of Shim-CLDR- A according to Map- A, and then transmits the datA of the datA structure organized in the form of Shim-CLDR- A to device B through FlexE.

And step four, when receiving data, the RX side receives the data according to the data structure organized in the form of Shim calendar, recovers the data structure organized in the form of MAC calendar according to Map, and then carries out the subsequent processing.

When receiving datA, the RX of device B receives datA in A datA structure organized in the form of Shim-CLDR- A, maps the received datA to A datA structure organized in the form of MAC-CLDR- A ' in accordance with Map- A ', and then sends the datA structure organized in the form of MAC-CLDR- A ' to A subsequent stage.

Because the original data of the TX side and the final data of the RX side are organized in the form of MAC (media access control) bytes, the data structure of the data structure is more beneficial to realizing a function of a circuit, and the aim of simplifying the design can be fulfilled.

In the embodiment of the application, through a mode of mapping twice, not only the flexible use of the calendar by the user is reserved, but also the complexity of the function realization circuit is reduced, so that the part of the function realization circuit cannot become a bottleneck restricting the whole performance or power consumption.

Corresponding to the data processing method applied to the transmitting end, an embodiment of the present application further provides a data processing apparatus, as shown in fig. 10, applied to the transmitting end, where the apparatus includes:

a reading unit 101, configured to read data of a channel corresponding to a current time slot according to a correspondence between time slots and channels recorded in a first physical calendar table, to obtain data of a first data structure, where the first data structure is a data structure obtained by organizing data of channels corresponding to current time slots according to a sequence of the current time slots in the first physical calendar table;

the mapping unit 102 is configured to map data of the first data structure into data of a second data structure according to a first mapping relationship between the first physical calendar table and the first shim calendar table, where the second data structure is a data structure obtained by organizing data of a channel corresponding to a current beat time slot in the first shim calendar table according to a sequence of the current beat time slot;

a sending unit 103, configured to send data of the second data structure.

Optionally, in each beat of the record of the first physical calendar table, the number of time slots corresponding to the first channel is less than or equal to a first numerical value; the product of the first value and the number of beats included in one cycle is a second value, and the second value is a multiple of the number of beats included in the cycle and is greater than or equal to the minimum value of the number of time slots corresponding to the first channel.

Optionally, the data apparatus may further include:

the receiving unit is used for receiving a calendar table switching request, and the calendar table switching request indicates the sending end to switch the first gasket calendar table into the second gasket calendar table;

the reading unit 101 may be further configured to read data of a channel corresponding to the time slot of the current beat according to a correspondence between the time slot and a channel recorded in a second physical calendar table corresponding to the second gasket calendar table, to obtain data of a third data structure, where the third data structure is a data structure obtained by organizing data of the channel corresponding to the time slot of the current beat according to the sequence of the time slots of the current beat in the second physical calendar table;

the mapping unit 102 may be further configured to map, according to a second mapping relationship between the second physical calendar table and the second gasket calendar table, data of the third data structure into data of a fourth data structure, where the fourth data structure is a data structure obtained by organizing, according to the order of the current beat time slots in the second gasket calendar table, data of a channel corresponding to the current beat time slot;

the transmitting unit 103 may be further configured to transmit data of a fourth data structure.

Optionally, the data apparatus may further include:

the acquisition unit is used for acquiring a first gasket calendar table;

and the conversion unit is used for converting the first gasket calendar table into a first physical calendar table according to the first mapping relation.

Corresponding to the data processing method applied to the receiving end, an embodiment of the present application further provides a data processing apparatus, as shown in fig. 11, applied to the receiving end, where the apparatus includes:

a receiving unit 111, configured to receive data of a channel corresponding to a current beat time slot according to a correspondence between the time slot and the channel recorded in the first shim calendar table, to obtain data of a second data structure, where the second data structure is a data structure obtained by organizing data of the channel corresponding to the current beat time slot according to a sequence of the current beat time slot in the first shim calendar table;

a mapping unit 112, configured to map, according to a first mapping relationship between the first physical calendar table and the first gasket calendar table, data of the second data structure into data of a first data structure, where the first data structure is a data structure obtained by organizing, according to an order of the current time slot in the first physical calendar table, data of a channel corresponding to the current time slot;

a processing unit 113 for processing the data of the first data structure.

Optionally, the data processing apparatus may further include:

the receiving unit 111 may further be configured to receive a calendar table switching request, where the calendar table switching request indicates the receiving end to switch the first gasket calendar table to the second gasket calendar table; receiving data of a channel corresponding to the current beat time slot according to the corresponding relation between the time slot and the channel recorded in the second gasket calendar table to obtain data of a fourth data structure, wherein the fourth data structure is a data structure obtained by organizing the data of the channel corresponding to the current beat time slot according to the sequence of the current beat time slot in the second gasket calendar table;

the mapping unit 112 may further be configured to map, according to a second mapping relationship between the second physical calendar table and the second gasket calendar table, data of a fourth data structure into data of a third data structure, where the third data structure is a data structure obtained by organizing, according to the order of the current time slots in the second physical calendar table, data of channels corresponding to the current time slots;

the processing unit 113 may be further configured to process data of the third data structure.

Optionally, the data processing apparatus may further include:

the acquisition unit is used for acquiring a first gasket calendar table;

An electronic device is further provided, where the transmitting end is as shown in fig. 12, and includes a processor 121 and a machine-readable storage medium 122, where the machine-readable storage medium 122 stores machine-executable instructions that can be executed by the processor 121, and the processor 121 is caused by the machine-executable instructions to implement any data processing method applied to the transmitting end.

An electronic device is further provided, where the receiving end is as described above, and as shown in fig. 13, the electronic device includes a processor 131 and a machine-readable storage medium 132, where the machine-readable storage medium 132 stores machine-executable instructions capable of being executed by the processor 132, and the processor 131 is caused by the machine-executable instructions to implement any one of the data processing methods applied to the receiving end.

It should be noted that the sending end and the receiving end may be integrated into one electronic device in practical application, that is, the electronic device integrates functions of the sending end and the receiving end, and then interacts with other electronic devices that integrate functions of the sending end and the receiving end, that is, the data processing method provided in any of the embodiments of the present application is implemented.

The machine-readable storage medium may include Random Access Memory (RAM) and may also include Non-Volatile Memory (NVM), such as at least one disk Memory. Alternatively, the machine-readable storage medium may be at least one memory device located remotely from the processor.

The Processor may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but also Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs) or other Programmable logic devices, discrete Gate or transistor logic devices, discrete hardware components.

In another embodiment provided by the present application, a computer-readable storage medium is further provided, in which a computer program is stored, and the computer program, when executed by a processor, implements any of the data processing methods applied to the transmitting end.

In another embodiment provided by the present application, a computer-readable storage medium is further provided, in which a computer program is stored, and the computer program, when executed by a processor, implements any of the data processing methods applied to the receiving end.

In a further embodiment provided by the present application, there is also provided a computer program product containing instructions which, when run on a computer, cause the computer to perform any of the data processing methods described above as applied to a transmitting end.

In another embodiment provided by the present application, there is also provided a computer program product containing instructions which, when run on a computer, cause the computer to perform any of the data processing methods described above as applied to a receiving end.

In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the application to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.

It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, 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 identical elements in a process, method, article, or apparatus that comprises the element.

All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the apparatus, the electronic device, the computer-readable storage medium, and the computer program product embodiments, since they are substantially similar to the method embodiments, the description is relatively simple, and for the relevant points, reference may be made to the partial description of the method embodiments.

The above description is only for the preferred embodiment of the present application and is not intended to limit the scope of the present application. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application are included in the protection scope of the present application.

Claims

1. A data processing method is applied to a sending end, and the method comprises the following steps:

and sending the data of the second data structure.

2. The method of claim 1, wherein the number of time slots corresponding to the first channel per beat of the first physical calendar entry is less than or equal to a first value; the product of the first value and the number of beats included in a cycle is a second value, and the second value is a multiple of the number of beats included in the cycle and is greater than or equal to the minimum value of the number of time slots.

3. The method according to claim 1 or 2, characterized in that the method further comprises:

receiving a calendar table switching request, wherein the calendar table switching request indicates the sending end to switch the first gasket calendar table into a second gasket calendar table;

reading data of a channel corresponding to a current time slot according to a corresponding relation between the time slot and the channel recorded in a second physical calendar table corresponding to the second gasket calendar table to obtain data of a third data structure, wherein the third data structure is a data structure obtained by organizing the data of the channel corresponding to the current time slot according to the sequence of the current time slot in the second physical calendar table;

mapping the data of the third data structure into data of a fourth data structure according to a second mapping relation between the second physical calendar table and the second gasket calendar table, wherein the fourth data structure is a data structure obtained by organizing the data of the channel corresponding to the beat time slot according to the sequence of the beat time slot in the second gasket calendar table;

and transmitting the data of the fourth data structure.

4. The method according to claim 1 or 2, characterized in that the method further comprises:

acquiring the first gasket calendar table;

and converting the first gasket calendar into the first physical calendar according to the first mapping relation.

5. A data processing method, applied to a receiving end, the method comprising:

processing data of the first data structure.

6. The method of claim 5, wherein the number of time slots corresponding to the first channel per beat of the first physical calendar entry is less than or equal to a first value; the product of the first value and the number of beats included in a cycle is a second value, and the second value is a multiple of the number of beats included in the cycle and is greater than or equal to the minimum value of the number of time slots.

7. The method of claim 5 or 6, further comprising:

receiving a calendar table switching request, wherein the calendar table switching request indicates the receiving end to switch the first gasket calendar table into a second gasket calendar table;

receiving data of a channel corresponding to the time slot of the current beat according to the corresponding relation between the time slot and the channel recorded in the second gasket calendar table to obtain data of a fourth data structure, wherein the fourth data structure is obtained by organizing the data of the channel corresponding to the time slot of the current beat according to the sequence of the time slot of the current beat in the second gasket calendar table;

according to a second mapping relation between a second physical calendar table and the second gasket calendar table, mapping data of the fourth data structure into data of a third data structure, wherein the third data structure is a data structure obtained by organizing data of a channel corresponding to a current time slot according to the sequence of the current time slot in the second physical calendar table;

processing data of the third data structure.

8. The method of claim 5 or 6, further comprising:

acquiring the first gasket calendar table;

9. A data processing apparatus, applied to a transmitting end, the apparatus comprising:

a sending unit, configured to send the data of the second data structure.

10. A data processing apparatus, applied to a receiving end, the apparatus comprising:

a processing unit for processing the data of the first data structure.

11. An electronic device comprising a processor and a machine-readable storage medium storing machine-executable instructions executable by the processor, the processor being caused by the machine-executable instructions to perform the method steps of any of claims 1 to 4 or to perform the method steps of any of claims 5 to 8.

12. A computer-readable storage medium, characterized in that a computer program is stored in the computer-readable storage medium, which computer program, when being executed by a processor, carries out the method steps of any one of claims 1 to 4, or carries out the method steps of any one of claims 5 to 8.