CN109996129B

CN109996129B - Service data processing method and device

Info

Publication number: CN109996129B
Application number: CN201711469927.XA
Authority: CN
Inventors: 向俊凌; 操时宜
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2017-12-29
Filing date: 2017-12-29
Publication date: 2021-02-23
Anticipated expiration: 2037-12-29
Also published as: CN109996129A

Abstract

The embodiment of the invention discloses a method and a device for processing service data, wherein the method for processing the service data comprises the following steps: acquiring a target cell corresponding to service data to be transmitted by a network node; if the bandwidth of the first ODUk pipeline occupied by the target cell exceeds the target bandwidth, scheduling part of cells in the target cell to a second ODUk pipeline for transmission according to a scheduling rule of the second ODUk pipeline; the second ODUk pipeline is an ODUk pipeline based on cell encapsulation, or the second ODUk pipeline is an ODUk pipeline based on conventional ODUk structure encapsulation. By adopting the embodiment of the invention, the bandwidth utilization rate can be improved.

Description

Service data processing method and device

Technical Field

The embodiment of the invention relates to the field of data processing, in particular to a method and a device for processing service data.

Background

An Optical Transport Network (OTN) is a mainstream technology of a backbone transport network, and is increasingly faced with new requirements and challenges. The Mobile network 5G technology is gradually mature, the Mobile network is migrated from 4G/4.5G to 5G, and future 5G network segments support different service types, such as enhanced Mobile bandwidth (eMBB), Low-Latency and high-reliability connectivity (urlclc), large-scale internet of things (mtc) and private line, which need to ensure the service quality of different services end to end. Strict isolation of different services is realized in the same comprehensive bearing network, and different time delay, bandwidth and reliability are supported; meanwhile, more small-particle services and flexible bandwidth exist in group client private lines, family broadband videos, live broadcast on demand and the like. Generally, the OTN needs to support new characteristics of flexible time slot division, small-granularity pipelines, controllable delay determination, pipeline multicast, and the like. At present, the technical problems are difficult to solve by the characteristics of OTN division of fixed time slots, rigid pipelines, minimum time slot 1.25G and the like, so that a cell-based add-drop multiplexing scheme is proposed, the fixed time slots are not divided any more, and the above requirements are supported based on the cell-based add-drop multiplexing mode.

However, the biggest problem of the cell scheme is how to combine with the existing OTN system, and the compromise scheme is to adapt a cell to an ODUk pipeline, that is, the ODUk pipeline is an ODUk pipeline based on cell encapsulation. At this time, the Cell-adapted ODUk pipe can support the above requirements. However, bandwidth between the Cell-adapted ODUk pipeline and other ODUk pipelines cannot be shared.

Disclosure of Invention

The embodiment of the invention provides a service data processing method and device, which can improve the utilization rate of bandwidth resources.

In a first aspect, an embodiment of the present invention provides a method for processing service data, where the method includes obtaining a target cell corresponding to service data to be transmitted by a network node; alternatively, the service data to be transmitted may be converted into a plurality of cells, that is, the target cell includes a plurality of cells.

If the bandwidth of the first ODUk pipeline occupied by the target cell meets a target condition, scheduling part of cells in the target cell to a second ODUk pipeline for transmission according to a scheduling rule of the second ODUk pipeline;

the second ODUk pipeline is an ODUk pipeline based on cell encapsulation, or the second ODUk pipeline is an ODUk pipeline based on conventional ODUk structure encapsulation.

Optionally, a plurality of cells in the converted target cell are grouped into at least one cell queue for scheduling, and a part of the cells in the target cell may be cells in a part of the cell queue in the at least one cell queue.

By the scheduling mode, part of cells in the target cell can be scheduled to an ODUk pipeline based on cell encapsulation for transmission, or part of cells in the target cell can be scheduled to an ODUk pipeline based on traditional ODUk structure encapsulation for transmission, so that bandwidth sharing among the ODUk pipelines is realized, and the bandwidth utilization rate is improved.

In a possible design, the scheduling, according to a scheduling rule of a second ODUk pipeline, a part of cells in the target cell to the second ODUk pipeline for transmission includes:

if the second ODUk pipeline is an ODUk pipeline based on cell encapsulation, determining whether the second ODUk pipeline has residual bandwidth;

and if the second ODUk pipeline has the residual bandwidth, encapsulating part of the target cells into the second ODUk pipeline for transmission.

if the second ODUk pipeline is an ODUk pipeline based on cell encapsulation, determining whether the second ODUk pipeline has an idle target bandwidth, where the target bandwidth is a preset cell for carrying service data of other ODUk pipelines except the second ODUk pipeline;

if the second ODUk pipeline has an idle target bandwidth, encapsulating part of the cells in the target cell into the idle target bandwidth of the second ODUk pipeline for transmission.

if the second ODUk pipeline is an ODUk pipeline encapsulated based on a conventional ODUk structure, determining whether an idle target timeslot exists in the second ODUk pipeline, where the target timeslot is a preset cell for carrying service data of other ODUk pipelines except the second ODUk pipeline;

and if an idle target time slot exists in the second ODUk pipeline, packaging part of cells in the target cells into the target time slot for transmission.

if the second ODUk pipeline is an ODUk pipeline packaged based on a traditional ODUk structure, determining whether an idle code block exists in the second ODUk pipeline;

if the idle code block exists in the second ODUk pipeline, converting a part of cells in the target cell into a target code block, and replacing the idle code block in the second ODUk pipeline with the target code block for transmission.

In one possible design, the converting a portion of the target cells into target code blocks includes:

dividing part of the target cells into at least one slice according to the byte length of the idle code block;

for each of the slices, encapsulating the slice into a target code block including sequence numbers of the slice.

In one possible design, a portion of the cells in the target cell may include cells in a low priority cell queue of at least one cell queue to which the target cell corresponds.

In a second aspect, an embodiment of the present invention provides a service data processing apparatus, where the service data processing apparatus is configured to implement the method and the functions performed in the first aspect, and is implemented by hardware/software, where the hardware/software includes modules corresponding to the functions.

In a third aspect, an embodiment of the present invention provides a service data processing apparatus, including: the system comprises a processor, a memory and a communication bus, wherein the communication bus is used for realizing connection communication between the processor and the memory, and the processor executes a program stored in the memory for realizing the steps in the service data processing method provided by the first aspect.

In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, in which instructions are stored, and when the instructions are executed on a computer, the computer is caused to execute the method of the first aspect.

In a fifth aspect, the present application provides a computer program product comprising instructions which, when run on a computer, cause the computer to perform the method of the first aspect described above.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required to be used in the embodiments of the present invention will be described below.

Fig. 1 is an application scenario diagram provided in an embodiment of the present invention;

fig. 2 is a schematic flowchart of a service data processing method according to an embodiment of the present invention;

3a-3b are schematic diagrams of scheduling policies provided by embodiments of the present invention;

FIGS. 4a-4b are schematic diagrams of circuit configurations provided by embodiments of the present invention;

fig. 5 is a schematic structural diagram of a target code block according to an embodiment of the present invention;

FIG. 6 is a diagram illustrating a cell encapsulation according to an embodiment of the present invention;

fig. 7 is a schematic structural diagram of a service data processing apparatus according to an embodiment of the present invention;

fig. 8 is a schematic structural diagram of another service data processing apparatus according to an embodiment of the present invention.

Detailed Description

The embodiments of the present invention will be described below with reference to the drawings.

Referring to fig. 1, a scenario diagram provided in the embodiment of the present invention is shown, where a network Node may be any one of ODU Switch points (ODU switching points) in fig. 1, and a Node 2(Node-2) is taken as an example in fig. 1 for explanation. The service Data to be transmitted by each network node may be transmitted through an Optical Channel Data Unit k (ODUk) pipeline encapsulated based on a cell, or may be transmitted through an ODUk pipeline encapsulated based on a conventional ODUk structure. As shown in fig. 1, the ODUk2 pipe runs from network node X to convergence a, and the ODUk1 pipe runs from node 2 to convergence a. Service data to be transmitted on node 2 is encapsulated into a target cell, which may include at least one cell, and the at least one cell constitutes at least one cell queue, and the at least one cell queue is scheduled to an ODUk pipeline for transmission. As shown in fig. 1, part of the cells of node 2 are scheduled to ODUk1 pipeline transmission, and part of the cells of node 2 are scheduled to ODUk2 pipeline transmission. The ODUk1 pipeline is an ODUk pipeline based on cell encapsulation, and the ODUk2 pipeline may be an ODUk pipeline based on cell encapsulation or an ODUk pipeline based on conventional ODUk structure encapsulation. Wherein, ODUk1 pipeline and ODUk2 pipeline are packaged in a big ODUk pipeline.

Referring to fig. 2 in conjunction with the application scenario shown in fig. 1, an embodiment of the present invention provides a flow chart of a service data processing method, where the method includes:

s10, obtaining a target cell corresponding to the service data to be transmitted by the network node;

in the embodiment of the present invention, service encapsulation adaptation is performed on service data to be transmitted, which is accessed by a network node, to convert the service data into cell cells. The service data to be transmitted may include service data corresponding to at least one service. After all the service data to be transmitted are packaged, adapted and converted into target cells, each cell enters different buffer queues to be queued according to the priority of different services; and the scheduling module generates a cell scheduling enabling signal according to the configured information such as the bandwidth information, the service priority, the length of the buffer queue and the like, and schedules the cells of each buffer queue to the ODUk pipeline of the corresponding line output end for transmission.

Optionally, as shown in fig. 6, a schematic diagram of cell adaptation encapsulation provided for the embodiment of the present invention is shown, where each cell includes a header overhead and a payload, where the header overhead is used to indicate to which sub-pipe the cell belongs. The specific header overhead is shown in fig. 6, where FAS is used to determine a cell header, CnD is used to carry clock information of the sub-pipe to which the cell belongs, Qos field is used to indicate service commitment information such as priority of the cell, Label is used to Label switch and identify the pipe, CRC check protects the overhead header, and a reserved field is required to be reserved for function extension. For example, consider increasing the cell numbering overhead for cell order confirmation and rearrangement. The header overhead of the cell may not be limited to the structure shown in fig. 6, and fig. 6 is only an example and does not limit the embodiment of the present invention.

It should be noted that the length of the cell may be an appropriate load length according to the bandwidth utilization rate and the implementation cost. As shown in fig. 6, a plurality of cells are encapsulated into a first ODUk pipeline, which is an ODUk pipeline based on cell encapsulation.

S11, if the bandwidth of the first ODUk pipeline occupied by the target cell meets a target condition, scheduling a part of cells in the target cell to a second ODUk pipeline according to a scheduling rule of the second ODUk pipeline for transmission;

In the embodiment of the present invention, when a target cell occupies a bandwidth of a first ODUk pipeline and meets a target condition, part of cells in the target cell need to be subjected to ODUk pipeline cross-scheduling. Alternatively, the target conditions may be: after the target cell is encapsulated into the first ODUk pipeline, the bandwidth of the first ODUk pipeline exceeds the preset bandwidth.

And scheduling part of the cells in the target cell to a second ODUk pipeline for transmission, wherein the method adopted when determining the part of the cells in the target cell can be that a low-priority buffer queue is determined from at least one buffer queue formed by the target cell, and a certain number of cells are selected from the low-priority buffer queue as part of the cells in the target cell for cross-pipeline scheduling. The certain number may be determined according to a degree that the bandwidth of the first ODUk pipeline exceeds a preset bandwidth, for example, the larger the degree that the bandwidth of the first ODUk pipeline exceeds the preset bandwidth, the larger the number of cells that need to be scheduled across the pipeline. It should be noted that the second ODUk pipeline and the first ODUk pipeline may be in the same direction, and the first ODUk pipeline is an ODUk pipeline based on cell encapsulation.

Optionally, the scheduling module generates an inter-pipeline scheduling enable signal, analyzes a data stream of the second ODUk pipeline, and resolves a signal carried by the second ODUk pipeline to determine whether the second ODUk pipeline is an ODUk pipeline based on cell encapsulation or an ODUk pipeline based on encapsulation of a conventional ODUk structure. And scheduling part of the target cells to a second ODUk pipeline for transmission according to a scheduling rule of the second ODUk pipeline, wherein the scheduling rule of the second ODUk pipeline is determined by a packaging structure of the second ODUk pipeline.

As an optional implementation, if the second ODUk pipeline is an ODUk pipeline based on cell encapsulation, further detecting whether the second ODUk pipeline sets a guaranteed shared bandwidth, that is, whether the second ODUk pipeline sets a target bandwidth for carrying the shared bandwidth, and if the target bandwidth is set and is idle, outputting a cell to be scheduled of a corresponding buffer queue to the second ODUk pipeline.

Optionally, if the guaranteed shared bandwidth is not set in the second ODUk pipeline, detecting whether the second ODUk pipeline has a remaining bandwidth, and if the second ODUk pipeline has a remaining bandwidth, outputting the cell to be scheduled in the corresponding buffer queue to the second ODUk pipeline.

As shown in fig. 3a, the two ODUk pipelines are both ODUk pipelines based on cell encapsulation, and a cell corresponding to service data of service c is a target cell corresponding to service data to be transmitted by a network node. Optionally, block adaptation is performed on service data of the service c to form a service queue c corresponding to the target cell, and the scheduling module schedules the service queue c to the two ODUk pipelines by using a certain scheduling policy.

Referring to fig. 4a, a schematic diagram of a circuit structure provided in the embodiment of the present invention is shown, where the structure is divided into a line intersection and a branch intersection, and when a network node needs to analyze data from a line, the data is processed through line deframing, slice parsing, switching module, cache management, slice de-adaptation, and PKT processing in fig. 4 a. When the network node needs to send the service data to be transmitted of the branch to the line, the service data is processed by PKT, slice adaptation, slice parsing, slice scheduling, and line framing as shown in fig. 4 a. And the slice scheduling module schedules the service queue c to the corresponding ODUk pipeline through bandwidth statistics and a scheduling strategy. Because the dispatching is to the ODUk pipeline based on the cell encapsulation, the dispatching can be directly carried out without carrying out the processing such as code block conversion and the like.

As another optional implementation, if the second ODUk pipeline is an ODUk pipeline encapsulated based on a conventional ODUk structure, further detecting whether the second ODUk pipeline has a guaranteed shared timeslot, that is, whether the second ODUk pipeline has a target timeslot for carrying a shared bandwidth, and if the second ODUk pipeline has the target timeslot for carrying the shared bandwidth, encapsulating the corresponding buffer queue to the target timeslot of the second ODUk pipeline, and if the target timeslot is idle.

Optionally, if the guaranteed shared timeslot is not set in the second ODUk pipeline, whether an idle code block exists in the second ODUk pipeline is detected. For example, for a code block of a 64B/66B coding format, the block type is 0x1E, and then 7 bytes are free for information replacement, and the code block may be considered as an idle code block. For code blocks of the 512B/513B coding format, the idle code block also has 7 bytes free for information replacement, only the block type changes.

If an idle code block exists in the second ODUk pipeline, the conversion processing from the cell to the target code block needs to be performed, and after the processing is completed, the target code block is replaced on the position of the original idle code block for the transmission on the line again, so that the original service quality carried in the second ODUk pipeline shared by the cross-pipeline is not affected.

Optionally, the adaptive conversion of the cell to the target code block is completed by the IDLE replacement module. The length of the cell is usually much larger than 7 bytes, so the IDLE replacement module needs to slice the scheduled cell further first to form multiple slices, and needs to reuse one byte for slice overhead. At this time, the format of the target code block may be as shown in fig. 5, where 3 bits in the one-byte slice overhead are used to indicate the effective data length in the target code block, and the payload region is 6 bytes long in terms of bytes; a 5bit in one byte of the slice overhead is used to indicate the sequence number of the slice. When the target code block corresponding to the slice before the last slice of a cell is transmitted, the Len field is set to 111, which indicates that the next target code block is the last slice of the current cell. If the last slice cannot fully occupy the payload area, the remaining part is filled with all 0 s.

When the replacement of one cell is completed, if no new cell is replaced, both Len and the sequence number are set to 0, and when the replacement of a new cell is started, the sequence number starts from 1, and Len is set to a correct value.

As shown in fig. 3b, one of the two ODUk pipelines is an ODUk pipeline based on cell encapsulation, and the other ODUk pipeline is an ODUk pipeline based on conventional ODUk structure encapsulation. The method comprises the steps of performing block adaptation on service data of a branch service to form a service queue corresponding to a target cell, and directly scheduling the service queue to an ODUk pipeline based on cell encapsulation by a scheduling module. The IDLE code block in the ODUk pipeline packaged based on the conventional ODUk structure can be obtained by IDLE detection.

Referring to fig. 4b, a schematic diagram of a circuit structure provided in an embodiment of the present invention is shown, where the structure is divided into a line intersection and a branch intersection, and when a network node needs to parse data from a line, the data is processed through line deframing, demapping, slice parsing, switching module, cache management, slice de-adaptation, and PKT processing shown in fig. 4 a. When the network node needs to send the service data to be transmitted of the branch to the line, the data is processed by PKT, slice adaptation, demapping IDLE detection, slice parsing, slice scheduling, IDLE replacement, and line framing of fig. 4 a. As shown in the figure, since the cells of the tributary service are scheduled to the ODUk pipeline encapsulated based on the conventional ODUk structure, it is necessary to perform IDLE code block detection by the demapping IDLE detection module and perform code block replacement by the IDLE replacement module. The slice scheduling module still schedules the cells to the corresponding ODUk pipelines through bandwidth statistics and scheduling strategies.

Referring to fig. 7, which is a schematic structural diagram of a service data processing apparatus according to an embodiment of the present invention, as shown in the figure, the service data processing apparatus includes an obtaining module 701 and a scheduling module 702; wherein, the detailed description of each module is as follows:

an obtaining module 701, configured to obtain a target cell corresponding to service data to be transmitted by a network node;

a scheduling module 702, configured to schedule, if the target cell occupies the bandwidth of the first ODUk pipeline and meets a target condition, a part of cells in the target cell to a second ODUk pipeline according to a scheduling rule of the second ODUk pipeline for transmission;

Optionally, the scheduling module 702 is specifically configured to:

Optionally, the scheduling module 702 converts part of the target information elements into target code blocks, and specifically includes:

Optionally, a part of the cells in the target cell includes cells in a low priority cell queue of at least one cell queue corresponding to the target cell.

It should be noted that the implementation of each module may also correspond to the corresponding description of the method embodiment shown in fig. 2, and perform the method and functions performed in the foregoing embodiments.

Please refer to fig. 8, fig. 8 is a schematic structural diagram of a service data processing apparatus according to an embodiment of the present application. As shown in the figure, the service data processing apparatus may include: at least one processor 801, at least one communication interface 802, at least one memory 803, and at least one communication bus 804.

The processor 801 may be, among other things, a central processing unit, a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, transistor logic, a hardware component, or any combination thereof. Which may implement or perform the various illustrative logical blocks, modules, and circuits described in connection with the disclosure. The processor may also be a combination of computing functions, e.g., comprising one or more microprocessors, a digital signal processor and a microprocessor, or the like. The communication bus 804 may be a peripheral component interconnect standard PCI bus or an extended industry standard architecture EISA bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 8, but this is not intended to represent only one bus or type of bus. A communication bus 804 is used to enable communications among the components. In this embodiment, the communication interface 802 of the device in this application is used for performing signaling or data communication with other node devices. The Memory 803 may include a volatile Memory, such as a Nonvolatile dynamic Random Access Memory (NVRAM), a Phase Change Random Access Memory (PRAM), a Magnetoresistive Random Access Memory (MRAM), and the like, and may further include a Nonvolatile Memory, such as at least one magnetic Disk Memory device, an Electrically Erasable Programmable Read-Only Memory (EEPROM), a flash Memory device, such as a NOR flash Memory (NOR flash Memory) or a NAND flash Memory (EEPROM), a semiconductor device, such as a Solid State Disk (SSD), and the like. The memory 803 may optionally be at least one memory device located remotely from the processor 801 as previously described. A set of program codes is stored in the memory 803 and executed by the processor 801 in the memory 803 for implementing the following operations:

acquiring a target cell corresponding to service data to be transmitted by a network node;

Optionally, the scheduling, according to a scheduling rule of a second ODUk pipeline, a part of the cells in the target cell to the second ODUk pipeline for transmission includes:

Optionally, the converting a part of the target cells into target code blocks includes:

Those skilled in the art will recognize that, in one or more of the examples described above, the functions described in this invention may be implemented in hardware, software, firmware, or any combination thereof. When implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a general purpose or special purpose computer.

The above-mentioned embodiments, objects, technical solutions and advantages of the present invention are further described in detail, it should be understood that the above-mentioned embodiments are only exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made on the basis of the technical solutions of the present invention should be included in the scope of the present invention.

Claims

1. A method for processing service data is characterized by comprising the following steps:

acquiring a target cell corresponding to service data to be transmitted by a network node, wherein a plurality of cells in the target cell form at least one cell queue for scheduling;

if the bandwidth of a first ODUk pipeline occupied by the target cell exceeds a preset bandwidth, scheduling a part of cells in the target cell to a second ODUk pipeline for transmission according to a scheduling rule of the second ODUk pipeline, wherein the scheduling rule of the second ODUk pipeline is determined by the packaging type of the second ODUk pipeline;

2. The method of claim 1, wherein the scheduling, according to a scheduling rule of a second ODUk pipeline, a part of the target cell to the second ODUk pipeline for transmission, includes:

3. The method of claim 1, wherein the scheduling, according to a scheduling rule of a second ODUk pipeline, a part of the target cell to the second ODUk pipeline for transmission, includes:

4. The method of any one of claims 1 to 3, wherein the scheduling, according to a scheduling rule of a second ODUk pipeline, a part of the target cell to the second ODUk pipeline for transmission includes:

5. The method of any one of claims 1 to 3, wherein the scheduling, according to a scheduling rule of a second ODUk pipeline, a part of the target cell to the second ODUk pipeline for transmission includes:

if the idle code block exists in the second ODUk pipeline, converting part of the cells in the target cell into a target code block, and replacing the idle code block in the second ODUk pipeline with the target code block for transmission.

6. The method of claim 5, wherein the converting a portion of the target cells into target code blocks comprises:

7. The method of claim 1, wherein the portion of the target cells comprises cells in a low priority cell queue of the at least one cell queue to which the target cells correspond.

8. A service data processing apparatus, comprising:

the system comprises an acquisition module, a scheduling module and a transmission module, wherein the acquisition module is used for acquiring a target cell corresponding to service data to be transmitted of a network node, and a plurality of cells in the target cell form at least one cell queue for scheduling;

a scheduling module, configured to schedule, if the bandwidth of the first ODUk pipeline occupied by the target cell exceeds a preset bandwidth, a part of cells in the target cell to a second ODUk pipeline according to a scheduling rule of the second ODUk pipeline for transmission, where the scheduling rule of the second ODUk pipeline is determined by a package type of the second ODUk pipeline;

9. The apparatus of claim 8, wherein the scheduling module is specifically configured to:

10. The apparatus of claim 8, wherein the scheduling module is specifically configured to:

11. The apparatus of any one of claims 8-10, wherein the scheduling module is specifically configured to:

12. The apparatus of any one of claims 8-10, wherein the scheduling module is specifically configured to:

13. The apparatus of claim 12, wherein the scheduling module to convert a portion of the target cells into target code blocks comprises:

14. The apparatus of claim 8, wherein the portion of the target cells comprises cells in a low priority cell queue of the at least one cell queue to which the target cells correspond.

15. A service data processing apparatus, comprising: a memory for storing program code, a communication bus, and a processor for invoking the program code to perform the method of any one of claims 1-7.

16. A computer-readable storage medium having stored therein instructions which, when executed on a computer, cause the computer to perform the method of any one of claims 1-7.