CN113645524A

CN113645524A - Method, device and equipment for processing service

Info

Publication number: CN113645524A
Application number: CN202010544327.0A
Authority: CN
Inventors: 苏伟; 吴秋游; 陈玉杰
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2020-04-27
Filing date: 2020-06-15
Publication date: 2021-11-12

Abstract

The application discloses a method, a device and equipment for service processing, which are used for solving the problem of bandwidth waste. The synchronization heads of 4 66b code blocks are removed, 1-bit code block type indication is added to serve as control information of service data, the control information is coded into 257b code blocks, bandwidth waste caused by the synchronization heads is avoided, and bandwidth utilization rate is improved. When mapping 257b code block stream to OSUflex frame, mapping the code block type indication to OSUflex frame overhead region, mapping 4 66b code blocks without sync header to OSUflex frame payload region, and mapping the check information obtained by checking control information to OSUflex frame overhead region, thereby realizing error protection of control information. When the error code occurs, the receiving end can find the error in time, the receiving end cannot process the error data packet as a correct data packet, and the transmission reliability is improved.

Description

Method, device and equipment for processing service

The present application claims priority from the chinese patent application entitled "a method and apparatus for mapping services" filed by the intellectual property office of the people's republic of china, application number 202010344926.8, on 27/4/2020 and incorporated herein by reference in its entirety.

Technical Field

The embodiment of the application relates to the technical field of communication, in particular to a method, a device and equipment for service processing.

Background

Optical Transport Network (OTN) has become a mainstream technology used in transport networks due to its characteristics of high bandwidth, large capacity, high reliability, low latency, etc. The OTN can be applied to backbone, metropolitan area core, convergence and other networks, and further expands to an access network. In addition to providing large bandwidth transmission capabilities such as n × 1.25Gbps, n × 5Gbps, OTNs will need to have transmission capabilities as low as several megabits per second in the future.

Packet service is the most important service type carried by the OTN, and currently, a framing generic mapping procedure (GFP-F) and an Idle Mapping Procedure (IMP) are usually adopted to map the packet service to the OTN transmission frame. But the adopted GFP-F and IMP mapping mode has the problem of bandwidth waste.

Disclosure of Invention

The embodiment of the application provides a method, a device and equipment for service processing, which are used for solving the problem of bandwidth waste.

In a first aspect, an embodiment of the present application provides a method for service processing. The method comprises the following steps: acquiring service data; coding the service data to obtain coded service data, wherein the coded service data comprises control information and service data information; mapping the control information to an overhead area of an OTN transmission frame of an optical transport network, verifying the control information to obtain verification information, and mapping the verification information to the overhead area of the OTN transmission frame; mapping the service data information to a payload area of the OTN transmission frame; and sending an OTN transmission frame carrying the encoded service data.

According to the scheme provided by the embodiment of the application, the service data information is mapped to the overhead area of the OTN transmission area, and the control information is mapped to the overhead area, so that the bit rate of the OTN payload area is matched with the transmission rate of the service data, and the bandwidth utilization rate is further improved. In addition, the error code protection is carried out on the control information by mapping the verified information to the overhead area. Therefore, when error codes occur, the receiving end can find errors in time, the receiving end cannot process the error data packets as correct data packets, and the transmission reliability is improved.

In one possible design, the service data may be packet data, and the packet data is Media Access Control (MAC) frame data, a network protocol IP packet, a multi-protocol label switching (MPLS) packet, a flexible Ethernet (FlexE) service code block stream, or a 66b code block stream.

In one possible design, the encoding of the traffic data includes: the service data is 64b/66b encoded to obtain encoded service data. When the service data is 66b code block stream, 64b/66b coding for the service data is not needed.

In one possible design, the encoding of the traffic data includes: performing 64b/66b coding on the service data to obtain a 66b code block stream; and carrying out 256b/257b coding processing on the 66b code block stream to obtain 257b code block stream, wherein the 257b code block stream is coded service data. When the service data is 66b code block stream, 64b/66b coding for the service data is not needed.

In one possible design, the service data is a 66b code block stream, and the service data is encoded by the method, including: and carrying out 256b/257b coding processing on the service data to obtain coded service data.

Illustratively, when 256b/257b coding is performed on the 66b code block stream, the synchronization header of the 66b code block is removed, and 1-bit control information is added, so that bandwidth waste caused by the synchronization header is reduced, and bandwidth utilization is improved.

In one possible design, the control information includes a code block type indication. Wherein the code block type indication indicates a code block type of the 257b code block.

In one possible design, when the code block type indication 257b code block is a control code block, the encoded traffic data further includes a first code block pattern indication; the first code block pattern indication indicates a pattern of 66b code blocks included in the code block in which the first code block type indication is located. Note that the first code block pattern indication is mapped to the payload region of the OTN transport frame.

In one possible design, a first code block pattern indication included in the encoded traffic data is encoded as a second code block pattern indication; the second code block pattern indicates a minimum hamming distance of 2 for different values. For example, a first code block pattern indication included in the encoded traffic data is replaced with a second code block pattern indication. The second code block pattern indication here indirectly indicates the pattern of the 66b code block which the 257b code block where the second code block pattern indication is located contains. For example, the second code block pattern indicates the same number of bits as the first code block pattern, which are 4 bits each.

In the above design, the second code block pattern indication is encoded by adopting a mode that the minimum hamming distance is 2, so that the 4 bits can be ensured to have stronger fault-tolerant capability, and as long as any 1 bit of the 4 bits generates error codes, a receiving end can find the error codes in time, so that the receiving end cannot process the error data packet as a correct data packet, and the transmission reliability is improved.

In one possible design, when the code block type indication indicator 257b code block is a 257b control code block, the method further includes: and adding a third code block pattern indication in the coded service data, wherein the third code block pattern indication is used for indicating a pattern of a 66b code block contained in the code block in which the third code block pattern indication is positioned, and the minimum Hamming distance of different values indicated by the third code block pattern is 2. In the above design, the second code block pattern indication is encoded by adopting a mode that the minimum hamming distance is 2, so that the 4 bits can be ensured to have stronger fault-tolerant capability, and as long as any 1 bit of the 4 bits generates error codes, a receiving end can find the error codes in time, so that the receiving end cannot process the error data packet as a correct data packet, and the transmission reliability is improved.

In one possible design, the OTN transport frame is an OSUflex frame.

In one possible design, the OSUflex frame is 192 bytes, 240 bytes, 128 bytes, or 64 bytes in length. The transcoding scheme provided by the embodiment of the application is suitable for OSUflex frames with various lengths, and the compatibility is improved.

In one possible design, the check information is Cyclic Redundancy Check (CRC) information.

In one possible design, the check information is one or more copies of the control information.

In one possible design, the bit rate of the service data information is equal to the rate corresponding to the payload region of the OTN transmission frame.

In a possible design, the bit rate of the service data information is a rate after rate adaptation is performed on the added/deleted idle code blocks, and the bit rate of the service data information subjected to rate adaptation is equal to a rate corresponding to a payload area of the OTN transmission frame. In the design, the bit rate of the service data information is adapted to the rate of the payload area of the OTN transmission frame through the idle code block, so that the bandwidth utilization rate is improved to the maximum extent.

In a second aspect, an embodiment of the present application provides a method for processing service data, where the method includes: receiving an OTN transmission frame of a light transmission network, wherein the OTN transmission frame is used for bearing encoded service data, and the encoded service data comprises control information and service data information; acquiring control information and check information aiming at the control information from an overhead area of an OTN transmission frame, and checking the control information according to the check information; if the check result is correct, acquiring service data information from a payload area of the OTN transmission frame, and recombining the control information and the service data information to obtain encoded service data; and decoding the coded service data to obtain the service data.

The beneficial effects of the second aspect can be seen from the description of the first aspect, and are not described herein again.

In one possible design, the service data is packet data, and the packet data is MAC frame data, a network protocol IP packet, a multi-protocol label switching MPLS packet, a flexible ethernet FlexE service code block stream, or a 66b code block stream.

In one possible design, decoding the encoded traffic data includes: the encoded traffic data is 64b/66b decoded to obtain traffic data.

In one possible design, decoding the encoded traffic data includes: 256b/257b decoding is carried out on the coded service data to obtain a 66b code block stream; the 66b code block stream is 64b/66b decoded to obtain traffic data.

In one possible design, the service data is a 66b code block stream, and decoding the encoded service data specifically includes: and 256b/257b decoding is carried out on the coded service data to obtain the service data.

In one possible design, the control information includes a code block type indication.

In one possible design, when the code block type indicator indicates that the 257b code block in which the code block type indicator is located is a control code block, before 256b/257b decoding is performed on the encoded traffic data, the method further includes:

decoding a second code block pattern indication included in the encoded traffic data into a first code block pattern indication indicating a pattern of a 66b code block included in a code block in which the first code block type indication is located; the second code block pattern indicates a minimum hamming distance of 2 for different values.

In one possible design, 256b/257b decoding of the encoded traffic data may include: decoding the coded service data to obtain a third code block pattern indication, wherein the third code block pattern indication is used for indicating a pattern of a 66b code block contained in a 257b code block in which the third code block pattern indication is positioned; the third code block pattern indicates a minimum hamming distance of 2 for different values.

In one possible design, the OTN transport frame is an OSUflex frame.

In one possible design, the OSUflex frame is 192 bytes, 240 bytes, 128 bytes, or 64 bytes in length.

In one possible design, the check information is CRC check information.

In a third aspect, an embodiment of the present application provides a device for service processing. The device is applied to OTN equipment. The apparatus includes a processor and a memory. The memory is used for storing program codes; the processor is configured to read and execute the program code stored in the memory to implement the method according to the first aspect or any design of the first aspect, or to implement the method according to the second aspect or any design of the second aspect.

In a fourth aspect, an embodiment of the present application provides an OTN device, where the OTN device includes the apparatus and an optical transceiver described in the third aspect, and the optical transceiver is configured to receive an OTN transmission frame sent by the apparatus and send the OTN transmission frame out, or is configured to receive the OTN transmission frame and send the OTN transmission frame to the apparatus.

In a fifth aspect, the present application provides a computer-readable storage medium, in which a software program is stored, and the software program can implement the method provided by any one of the designs of the first or second aspects when being read and executed by one or more processors.

In a sixth aspect, embodiments of the present application provide a computer program product comprising instructions. When run on a computer, cause the computer to perform the method provided by any of the designs of the first or second aspects described above.

In a seventh aspect, an embodiment of the present application provides a chip. The chip is connected with the memory and used for reading and executing the software program stored in the memory so as to realize the method provided by any one of the designs of the first aspect or the second aspect.

Drawings

Fig. 1 is a schematic diagram of a possible OTN network architecture in an embodiment of the present application;

fig. 2 is a schematic structural diagram of a possible OTN device in an embodiment of the present application;

fig. 3 is a schematic flowchart of a possible service processing method provided in an embodiment of the present application;

fig. 4 is a schematic structural diagram of an OSUflex frame provided in the embodiment of the present application;

fig. 5 is a schematic diagram of a possible 257b data code block according to an embodiment of the present application;

fig. 6 is a schematic diagram of another possible 257b control code block provided in an embodiment of the present application;

fig. 7 is a schematic diagram of another possible 257b control code block provided in an embodiment of the present application;

fig. 8 is a schematic diagram of another possible 257b control code block provided in an embodiment of the present application;

fig. 9 is an exemplary diagram of mapping 257 code block streams to OSUflex frames according to an embodiment of the present application;

fig. 10A is a schematic structural diagram of a possible OSUflex frame provided in the embodiment of the present application;

fig. 10B is a schematic structural diagram of a possible OSUflex frame provided in the embodiment of the present application;

fig. 10C is a schematic structural diagram of a possible OSUflex frame provided in the embodiment of the present application;

fig. 11 is a schematic flowchart of a possible service processing method provided in an embodiment of the present application;

fig. 12 is a schematic structural diagram of a possible service processing apparatus according to an embodiment of the present application;

fig. 13 is a schematic structural diagram of another possible service processing apparatus provided in an embodiment of the present application;

fig. 14 is a schematic structural diagram of a possible service processing apparatus according to an embodiment of the present application.

Detailed Description

The embodiment of the application is suitable for an optical network, for example: and (3) OTN. An OTN is generally formed by connecting a plurality of devices through optical fibers, and can be formed into different topological types such as a linear type, a ring type, a mesh type and the like according to specific needs. Fig. 1 is a schematic diagram of a possible OTN network architecture in an embodiment of the present application. Referring to FIG. 1, an OTN 100 is comprised of 8 OTN devices 101, devices A-H. Wherein 102 denotes an optical fiber for connecting two devices; 103 indicate a client service interface for receiving or transmitting client service data. According to actual needs, one OTN device may have different functions. Generally, OTN devices are classified into optical layer devices, electrical layer devices, and opto-electric hybrid devices. Optical layer device refers to a device capable of processing optical layer signals, such as: optical Amplifiers (OA), and optical add-drop multiplexers (OADM). OA, also known as Optical Line Amplifier (OLA), is mainly used to amplify optical signals to support transmission over longer distances while ensuring specific performance of the optical signals. OADMs are used to spatially transform optical signals so that they can be output from different output ports (sometimes also referred to as directions). An electrical layer device refers to a device capable of processing electrical layer signals, such as: a device capable of processing OTN signals. An opto-electric hybrid device refers to a device that has the capability to process both optical layer signals and electrical layer signals. It should be noted that, according to specific integration needs, one OTN device may integrate a plurality of different functions. The technical scheme provided by the application is suitable for OTN equipment containing electric layer functions with different forms and integration levels.

Fig. 2 is a schematic structural diagram of a possible OTN device in an embodiment of the present application. Such as device a in fig. 1. Specifically, the OTN device 200 includes a tributary board 201, a cross board 202, a line board 203, an optical layer processing board (not shown in the figure), and a system control and communication board 204. A network device may contain different types and numbers of boards depending on the particular needs. For example, the network device as a core node does not have the tributary board 201. As another example, the network device as an edge node has a plurality of tributary boards 201, or no optical cross board 202. As another example, a network device that supports only electrical layer functionality may not have an optical layer processing board.

The tributary board 201, cross board 202 and line board 203 are used to process the electrical layer signals of the OTN. The tributary board 201 is used to implement receiving and sending of various client services, such as SDH service, packet service, ethernet service, and fronthaul service. Further, the branch board 201 may be divided into a client-side light module and a signal processor. The client side optical module may be an optical transceiver for receiving and/or transmitting traffic data. The signal processor is used for realizing the mapping and de-mapping processing of the service data to the data frame. The cross board 202 is used for implementing the exchange of data frames, and completing the exchange of one or more types of data frames. The line board 203 mainly implements processing of line-side data frames. Specifically, the wiring board 203 may be divided into a line side optical module and a signal processor. The line side optical module may be a line side optical transceiver for receiving and/or transmitting data frames. The signal processor is used for realizing multiplexing and de-multiplexing or mapping and de-mapping processing of data frames on the line side. The system control and communication board 204 is used to implement system control. Specifically, information may be collected from different boards through a backplane, or a control instruction may be sent to a corresponding board. It should be noted that, unless otherwise specified, a specific component (e.g., a signal processor) may be one or more, and the present application is not limited thereto. It should be noted that, the present application is not limited to the type of the single board included in the device and the functional design and number of the single board. It should be noted that, in a specific implementation, the two boards may also be designed as a single board. In addition, the network device may also include a power supply for backup, a fan for heat dissipation, and the like.

The technical concept involved in the embodiments of the present application will be explained below.

1) The 64B/66B coding encodes 64-bit (bit) service data or 64-bit control information corresponding to the service data into a 66-bit code block for transmission. The 66bit code block is simply referred to as a 66b code block. In the present embodiment, reference numerals 66B, 64B/66B, and the like may be denoted as 66B, 64B/66B, and the names are not particularly limited in the present application. The first two bits of the 66b code block represent a synchronization header, which is mainly used for data alignment at the receiving end and synchronization of the received data bit stream. The synchronization head has two types of '01' and '10', wherein '01' indicates that the 66b code block is a 66b data code block, and 64 bits behind the synchronization head carry service data. "10" indicates that the 66b code block is a 66b control code block, and 64 bits after the synchronization header include mixed data of data and control information, wherein 8 bits next to the synchronization header in the 66b control code block are type fields, and the following 56 bits include 64-bit control information corresponding to service data or mixed data of control information and data. The 66b control code block may be a start code block, an end code block, or an IDLE (IDLE) code block, etc.

2) The data frame structure used by the OTN device is an OTN frame. The OTN frame may also be referred to as an OTN transport frame. The OTN frame is used to carry various service data and provide rich management and monitoring functions. The OTN frame may be an flexible optical service unit (OSUflex) frame, and the OSUflex frame may also be referred to as an OSU frame for short. Alternatively, the OTN frame may also be an optical data unit k (optical data unit k, ODUk), ODUCn, ODUflex, or an optical channel transport unit k (OTUk), OTUCn, or flexible OTN (flexible OTN, FlexO) frame. The ODU frame is different from the OTU frame in that the OTU frame includes an ODU frame and OTU overhead; k represents different rate classes, e.g., k-1 for 2.5Gbps, k-4 for 100 Gbps; cn denotes the variable rate, specifically a rate of a positive integer multiple of 100 Gbps. Unless otherwise specified, the ODU frame refers to any one of ODUk, ODUCn, and ODUflex, and the OTU frame refers to any one of OTUk, OTUCn, or FlexO. It should also be noted that with the development of OTN technology, it is possible to define new types of OTN frames, which are also applicable to the present application.

3) Ceiling (x) denotes an ceiling function for returning a minimum integer value greater than or equal to x.

4) Hamming distance is used in data transmission error control coding. The hamming distance represents the number of corresponding bits of two (same length) words different, and d (x, y) represents the hamming distance between two words x, y. For example, two strings are subjected to exclusive or operation, and the number of 1 is counted, so that the number is the hamming distance. A minimum hamming distance of 2 means that the minimum value of the hamming distance of two words of the same length is 2, i.e. the hamming distance of two words of the same length is greater than or equal to 2.

5) Plural means two or more. "and/or" describe the association relationship of the associated objects, and there may be three relationships. For example, a and/or B may represent: a exists alone, A and B exist simultaneously, and B exists alone.

6) The terminology used in the embodiments of the invention is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the examples of the present invention and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.

7) Although the terms first, second, third, etc. may be used to describe various messages, requests, and network devices in embodiments of the present invention, these messages, requests, and network devices should not be limited to these terms. These terms are only used to distinguish messages, requests, and network devices from one another. For example, a first network device may also be referred to as a second network device, and similarly, a second network device may also be referred to as a first network device, without departing from the scope of embodiments of the present invention.

Due to bandwidth waste in the mapping mode of GFP-F and IMP, and the need for fine-grained operation of bandwidth in the future with the increasing traffic, especially when packet services are used as the main stream bearer service of OTN, the present application provides a service processing method and apparatus for improving the bandwidth utilization.

The following describes in detail a scheme provided by an embodiment of the present application from the perspective of a transmitting end and a receiving end, respectively, with reference to the accompanying drawings.

Fig. 3 is a schematic flowchart of a possible service processing method according to an embodiment of the present application. The method for service processing may be applied to a transmitting end, as shown in fig. 3, and includes S301-S305. For example, the method flow of service processing may be executed by the OTN device at the sending end. Specifically, S301 to S304 may be executed by a processor, a chip system, or a module with a service processing function in the OTN device at the sending end.

The OTN device may perform S305 directly through an optical transceiver (sometimes also an optical transceiver module), i.e., send the OTN transport frame.

S301, acquiring service data.

Illustratively, the service to which the service data belongs may be a packet service or a fixed bit rate service. Packet services are also called Packet services, i.e. Packet services, and are usually denoted by PKT. As an example, the packet service may be a Media Access Control (MAC) frame data stream, and may also be an IP packet data stream (also referred to as an IP packet). The packet service may also be a multi-protocol label switching (MPLS) packet data stream, a flexible Ethernet (FlexE) service code block. Or the packet data may be a 66b code block stream encoded with 64b/66b (where b represents bits). The fixed bit rate service is a 66b code block stream formed after 64b/66b coding.

S302, the service data is coded to obtain coded service data, and the coded service data comprises control information and service data information.

When the service data is encoded to obtain encoded service data, any one of the following examples 1 to 3 may be employed. It should be understood that this application describes the following ways by way of example only and is not intended to be exhaustive.

In the method 1, if the service data is a 66b code block stream, when the service data is encoded to obtain encoded service data, the 66b code block stream may be subjected to transcoding to obtain Q b code block stream. Q256K +1 or Q256K + 1K, K being a positive integer. For example, K is 1 and Q is 257. I.e. the 66b code block stream is transcoded to obtain 257b code block stream. For another example, K is 2 and Q is 513/514. I.e. the 66b code block stream is transcoded to obtain 513b or 514b code block stream. For the following description, 256b/257b encoding is performed on the 66b code block stream to obtain 257b code block stream. 257b code block stream is coded traffic data.

In mode 2, if the service data is a non-66 b code block stream, when the service data is encoded to obtain encoded service data, the service data may be first subjected to 64b/66b encoding processing to obtain a 66b code block stream. The 66b code block stream is then 256b/257b encoded to obtain a 257b code block stream.

The non-66 b code block stream may be a MAC frame data stream, an IP packet data stream, an MPLS packet data stream, or a FlexE service code block stream.

In mode 3, if the service data is a non-66 b code block stream, when the service data is encoded to obtain encoded service data, the service data may be first subjected to 64b/66b encoding processing to obtain a 66b code block stream. The 66b code block stream is encoded traffic data.

The manner in which the 66b code block stream is encoded into the 257b code block stream will be described in detail later, and will not be described again with reference to fig. 6 and the related description.

And S303, mapping the control information to an overhead area of the OTN transmission frame, verifying the control information to obtain verification information, and mapping the verification information to the overhead area of the OTN transmission frame.

The check information may include CRC information. Or the verification information may be one or more copies of the control information.

As an example, the control information may include a code block type indicator, for example, taking the encoded traffic data as a 257b code block stream, where the code block type indicator is used to indicate a code block type of a 257b code block carrying the code block type indicator, such as to indicate that the 257 code block is a control code block or a data code block. I.e., the code block type indication is mapped to the overhead area of the OTN transport frame.

S304, mapping the service data information to the payload area of the OTN transmission frame.

S305, sending an OTN transmission frame carrying the encoded service data.

For example, the OTN transport frame is an OSUflex frame, and the OSUflex frame may be directly transmitted by an optical transceiver (sometimes also referred to as an optical transceiver module). Or, the OSUflex frame may be mapped to another OTN frame (for example, an ODU frame or a FlexO frame) and then sent out through the optical transceiver module. In this regard, the present embodiment is not particularly limited.

In the embodiment of the present application, the bit rate of the service data information is equal to the rate of the payload area of the OTN transmission frame, that is, the transmission rate of the encoded service data is adapted to the rate of the payload area of the OTN transmission frame. Illustratively, rate adaptation may be achieved by IDLE code blocks (66b IDLE) such that the transmission rate of the final encoded traffic data matches the rate of the payload region of the OTN transmission frame.

Take OTN transmission frame as OSUflex as an example. Fig. 4 is a schematic structural diagram of an OSUflex frame provided in the embodiment of the present application. As shown in FIG. 4, the structure of the OSUflex frame contains overhead areas (occupied W)_OHBit) and payload region (occupying W)_PLDBits). The overhead area includes, but is not limited to, version identification, service identification, mapping information, cyclic redundancy check (CRC-X) of X bits, and other overhead information. The payload area is used for bearing service data information. The OSUflex frame length is of a fixed size, for example, the OSUflex frame length is denoted by W, i.e., W ═ W_OH+W_PLDFor example, the length of the OSUflex frame is 192 bytes, 240 bytes, 128 bytes, or 64 bytes, etc.

Assuming that the bit rate of the OSUflex frame is R, the packet service needs to be adapted to have a rate of R × W_PLDW, i.e. the rate of the payload region of the OSUflex frame. Where the bit rate R of the OSUflex frame is C times the reference bit rate. The reference bit rate is a predetermined value, and the value C is Ceiling [ (bit rate of packet service W/W)_PLD) Reference bit rate]. For example, the reference bit rate may be about 2Mbps or 10Mbps, etc., to adapt to various low-rate services that the OTN transmission frame needs to carry. The bit rate of the packet service in the calculation is the bit rate of the valid data, that is, the bit rate corresponding to the 64b data in each 66b code block (the 64-bit data in the 66b code block excluding the 2-bit synchronization header). After the rate adaptation, the bit rate of the service data information mapped to the OSUflex frame after coding adapts the packet service, so that the bandwidth utilization efficiency is improved in a maximized manner.

As an example, if the bit rate of the packet service is less than the rate of the payload region of the OSUflex frame, a 66b IDLE code block may be inserted into the 66b code block stream of the packet service. For example, the IDLE code block may be inserted after the T code block and before the S code block. Alternatively, a special code block may be customized as a filler code block, and the position where the filler code block is inserted is not limited. The T code block represents a starting code block of the 66b code block stream and the S code block represents an ending code block of the 66b code block stream. Taking the MAC frame data stream as an example, after a MAC frame is encoded into a 66b code block stream, a frame header of the MAC frame is encoded into a start code block, and a frame tail of the MAC frame is encoded into an end code block.

The manner in which the 66b code block stream is transcoded into a 257b code block stream is described in detail below.

In the embodiment of the present application, each 4 66b code blocks are coded and converted into 1 257b code blocks. The transcoding may follow the method defined by IEEE802.3 or other customized transcoding methods.

In one possible embodiment, the transcoding operation comprises: the 2-bit sync header of consecutive 4b code blocks is deleted, 256b is formed, and 1-bit 256b code block type indicator is added to constitute 257b code blocks. When the code block type indicates a first value, the 257 code blocks are data code blocks, and when the code block type indicates a second value, the 257b code blocks are control code blocks. For example, the first value is 1, and the second value is 0; or the first value is 0 and the second value is 1. All of the 4 66b code blocks in the 257b data code block are data code blocks, and at least one 66b control code block is included in the 4 66b code blocks in the 257b control code block. The code block type indication may also be control information of a 257b code block.

As an example, if all the 4 66b code blocks are data code blocks, the 2-bit sync header of the 4 66b code blocks is directly deleted, and a 1-bit code block type indicator is added, where the value of the code block type indicator is the first value, to form 257b data code blocks. For example, fig. 5 is a schematic diagram of a 257b data code block provided in an embodiment of the present application. In fig. 5, taking the first value as 1 as an example, the number in parentheses in fig. 5 represents the number of bits, 01 is a 2-bit sync header of a 66b data code block, and db (data block) represents the valid data of the 66b data code block.

As another example, if at least one 66b control code block is included in the 4 66b code blocks, the 2-bit synchronization header of the 4 66b code blocks is deleted, and a 1-bit code block type indicator is added, where the value of the code block type indicator is a second value.

In order for the receiving end to know that the 4 66b code blocks are control code blocks or data code blocks, indication information for indicating a 66b code block pattern needs to be added to compose 257b control code blocks.

Example 1, the indication information for indicating the 66b code block pattern is referred to as a first code block pattern indication as an example. The first code block pattern indicates that 4 bits are occupied, the first code block pattern indicates a pattern for indicating 257b control code blocks included in the 4 66b code blocks, i.e., a code block type (including 66b control code blocks or 66b data code blocks) and a code block position of the 4 66b code blocks. In the first code block pattern indication, the i-th bit indication 257b controls the i-th 66b code block of the code blocks to be either a data code block or a control code block.

Fig. 6 is a schematic diagram of another possible 257b control code blocks provided in this embodiment, referring to fig. 6, the 2-bit sync header of the 4 66b code blocks is deleted, a 1-bit code block type indicator is added, the last 4 bits of the 8-bit type field of the first 66b control code block are deleted, and the type fields of the remaining 66b control code blocks are not deleted and modified for full transparent transmission. A first code block pattern indication of 4 bits is further added, finally forming a 257b control code block shown in fig. 6. The numbers in parentheses in fig. 6 represent the number of bits, and 10 and 01 are 2-bit sync headers of 66b, where 01 denotes a 66b data code block, 10 denotes a 66b control code block, and F and S denote type information of the type field of the 66b control code block. In fig. 6, the 4 66b code blocks include 3 66b control code blocks and 1 data code block, the first to third 66 code blocks are 66b control code blocks, and the fourth 66b code block is a 66b data code block. Taking 1 for the 66b data code block and 0 for the 66b control code block as an example, the value of the first code block pattern is 0001, as shown in fig. 6.

Example 2, in order to further improve reliability based on example 1, 257b codeblocks obtained by transcoding 4 66b codeblocks may be further error-tolerant protected. Specifically, after transcoding the obtained 257b code blocks from the 4 66b code blocks in the manner of example 1, the first code block pattern indication in the 257b control code blocks may be further encoded as the second code block pattern indication. The second code block pattern indicates a minimum hamming distance of 2 between the different values. It is to be understood that the encoding may also be understood as being replaced by, or obtained by, a certain algorithm according to a predetermined rule.

For example, see table 1 for a mapping between different values indicated by the first code block pattern and different values indicated by the second code block pattern. In the third column in table 1, when the value of the ith bit is 1, the 66b code block is a 66b data code block, and when the value of the ith bit is 0, the 66b code block is a 66b control code block. It should be understood that table 1 is only an example of a mapping relationship between different values indicated by the first code block pattern and different values indicated by the second code block pattern, and does not constitute a specific limitation.

Column 1 in table 1 shows the combination pattern of the original 66b code blocks before the 4 66b code blocks form 257b code blocks, where S denotes the starting code block, T denotes the ending code block, I denotes the idle code block, and D denotes the data code block.

Fig. 7 is a schematic diagram of another possible 257b control code block provided in an embodiment of the present application. Next to the example of fig. 6, taking table 1 as an example, the 257b control code block in fig. 7 is obtained by further encoding 0100 with 0001 values indicated by the first code block pattern of the 2 nd bit to the 5 th bit of the 257b control code block, based on the 257b control code block shown in fig. 6.

In the above embodiment, the first code block pattern indicator for indicating 257b the pattern of 66b code blocks in the control code block is further encoded into the second code block pattern indicator with the minimum hamming distance of 2, which ensures that the information of the 4-bit indicator 257b the pattern of 66b code blocks in the control code block has stronger fault-tolerant capability, and can be found in time as long as any 1 bit error occurs in the 4 bits.

TABLE 1

Example 3, the indication information for indicating the 66b code block pattern is referred to as a third code block type indication as an example. The third code block pattern indicates that 4 bits are occupied, and the first code block pattern indicates a pattern for indicating 4 66b code blocks, i.e., a code block type (including 66b control code blocks or 66b data code blocks) and a code block position of the 4 66b code blocks. The 66b code block combinations of different code block types correspond to different values indicated by the third code block pattern. The minimum hamming distance between different values in the third code block pattern indication is 2, for example, see table 2.

TABLE 2

Fig. 8 is a schematic diagram of another possible 257b control code blocks provided in this embodiment of the present application, and referring to fig. 8, a 2-bit sync header of the 4 66b code blocks is deleted, a 1-bit code block type indicator is added, the last 4 bits of an 8-bit type field of the first 66b control code block are deleted, and the type fields of the remaining 66b control code blocks are not deleted and modified, so that a completely transparent transmission is performed. A third block pattern indication of 4 bits is further added to finally form the 257b control code block shown in fig. 8. The numbers in parentheses in fig. 8 represent the number of bits, and 10 and 01 are 2-bit sync headers of 66b, where 01 denotes a 66b data code block, 10 denotes a 66b control code block, and F and S denote type information of the type field of the 66b control code block. In fig. 8, the 4 66b code blocks include 3 66b control code blocks and 1 data code block, the first to third 66 code blocks are 66b control code blocks, and the fourth 66b code block is a 66b data code block. Taking the mapping relationship between the 66b code block combination and the value of the third code block pattern shown in table 1 as an example, the value indicated by the third code block pattern is 0100, as shown in fig. 8.

In the embodiment of the present application, when the 66b code block stream is encoded, the 66b code block stream may also be encoded and converted into a code block stream of another format, such as 513b code block stream or 514b code block stream.

For example, a 66b code block stream is encoded into a 513b code block stream, and may be encoded into 1 513b code block every 8 66b code blocks. The 2-bit sync header of consecutive 8-bit 66b code blocks is deleted, 512b is formed, and a 1-bit 512b code block type indication is added to constitute 513b code blocks. When the code block type indicates a first value, the 513b code block is a 513b data code block, and when the code block type indicates a second value, the 513b code block is a 513b control code block. All 8 of the 513b data code blocks are data code blocks, and at least one 66b control code block is included in the 8 513b control code blocks.

For the 513b control code block, in order for the receiving end to know that the 8 66b code blocks are control code blocks or data code blocks, indication information for indicating a 66b code block pattern needs to be added to compose the 513b control code block. For example, 4 or 8 bits may be occupied. For example, when there is only one control code block, the last 4 bits of the 8-bit type field of the first 66b control code block may be deleted, when there are two or more control code blocks, the last 4 bits of the 8-bit type field of the first and second 66b control code blocks may be deleted, and the type fields of the remaining 66b control code blocks are not deleted and changed, and the all-transparent transmission is performed. Further adding 4 bits or 8 bits of indication information for indicating a 66b code block pattern, finally forming 513b control code block. The 4-bit or 8-bit indication information for indicating the 66b code block pattern is configured in a similar manner as the 257b control code block 4-bit indication information for indicating the 66b code block pattern, such as in a manner indicated by the first code block pattern, or in a manner indicated by the third code block pattern, or in a manner indicated by the second code block pattern after being further encoded based on the indication by the first code block pattern.

For example, a 66b code block stream is encoded into a 514b code block stream, which may be coded into 1 514b code block every 8 66b code blocks. The 2-bit sync header of consecutive 8-bit 66b code blocks is deleted, 512b is formed, and 2-bit 512b code block type indication is added to constitute 514b code blocks. As an example, the 1 st bit indicates a code block type of a first combination (256 bits) of 1 st to 4 th 66b code blocks, and the 2 nd bit indicates a code block type of a second combination (256 bits) of 5 th to 8 th 66b code blocks. For example, if the 1 st bit is indicated as 1, the first combination includes 4 66b data code blocks, and if the 1 st bit is indicated as 0, at least one code block of the 4 66b code blocks included in the first combination is a 66b control code block. The first combination and the second combination comprising 4 66b control code blocks may add a code block pattern indication (such as a first code block pattern indication, a second code block pattern indication, or a third code block pattern indication) in the same manner as in the 257b control code block, which is not described in detail herein.

As follows, taking 257b code block streams as coded service data as an example, mapping the control information of the coded service data and the check information of the control information to the overhead area of the OTN transmission frame, and mapping the service data information to the payload area of the OTN transmission frame is described.

The code block type indicator in the 257b code block is mapped to the overhead region of the OSUflex frame and CRC check is performed, and other information except the code block type indicator is mapped to the OSUflex payload region. For convenience of description, the code block type indication is referred to as a first part of the 257 code blocks, and information of the 257 code blocks other than the code block type indication is referred to as a second part. Such as 257b data code blocks, the code block type indication is the first part, and the rest of the traffic data information is the second part. For another example, 257b controls code blocks, the code block type indication is the first part, and the remaining traffic data information and code block pattern indication (first code block pattern indication, second code block pattern indication, or third code block pattern indication) is the second part. See, for example, fig. 9. Fig. 9 is a diagram illustrating an example of mapping 257 code block streams to OSUflex frames according to an embodiment of the present application.

Taking the example that the code block type indicator occupies 1 bit, specifically, the sending end maps the consecutive 257b code block streams to the OSUflex frame, where the 1-bit code block type indicator of each 257b code block is separated from the remaining second part of 256 bits. The first part of 1 bit (code block type indication) of the 257b code block is mapped to the overhead region of the OSUflex frame. The second part of the remaining 256 bits of the 257b code block is mapped to the payload region of the OSUflex frame.

As mentioned before, the 66b code block stream has been rate adapted, so the bit rate corresponding to the second part of the 257b code block is exactly equal to the bit rate of the payload region of the OSUflex frame. And mapping the payload area of the OSUflex frame by adopting a bit synchronization mapping mode, wherein the second part of 256 bits of each 257b is 32 bytes, and the second part is byte-aligned with the payload boundary of the OSUflex frame.

In a possible implementation manner, before the step S305 of sending the OTN transport frame carrying the encoded service data is performed, the start position information corresponding to the first complete 257b code block mapped to the payload area of the OSUflex frame is placed in the overhead area of the OSUflex frame. The starting location information may also be referred to as pointer overhead. The receiving end can find the starting position of the first complete 257b code blocks carried by the payload area of the OSUflex frame according to the pointer overhead, thereby recovering 256 bits of each 257b code block carried by the payload area of the OSUflex frame. The receiving end can also know how many start bytes of 257b code blocks are contained in the payload area of the current OSUflex frame according to the pointer overhead, that is, know how many code block type indications of 257b code blocks are contained in the overhead area of the OSUflex frame.

In a possible implementation, the sending end may further perform cyclic redundancy check (CRC-X) on the code block type indication of the 257b code blocks included in the overhead region of the OSUflex frame and the pointer overhead, generate X-bit cyclic redundancy check information, and add the X-bit cyclic redundancy check information to the overhead region of the OSUflex frame. It should be noted that the sending end may perform CRC-X on the code block type indication of the 257b code block and perform CRC-X on the pointer overhead, respectively, or may perform CRC-X on the code block type indication of the 257b code block and the pointer overhead together. The CRC-X over the code block type indication and pointer overhead may be independent of the CRC-X over other overhead for the OSUflex frame. The sending end can also execute CRC-X operation on the code block type indication, pointer overhead and other overhead needing CRC-X, so that overhead information in an OSUflex frame shares the same CRC-X check, the bandwidth can be further saved, and the processing complexity can be further reduced.

In the process of line transmission, a line error condition is sent, if a complete 257b code block is entirely mapped to a payload region, if the type information of a 1-bit code block of a certain 257b code block is just subjected to error, for example, changes from 0 to 1, a receiving end may be caused to mistake the 257b control code block as a 257b data code block, and directly decode and convert the 257b control code block into 4 66b data code blocks, which correspondingly causes a situation that packet service processes a received error packet as a correct packet, that is, introduces a reliability problem. The method maps a first part (code block type indication) and a second part (the rest 256 bits) of a 257b code block separately, and the code block type indication is placed in an overhead area of an OSUflex frame and subjected to CRC-X, namely, the code block type indication is subjected to error code protection. When an error occurs in the line transmission process, for example, the code block type indication of the 257b code block has an error, the error can be timely found through the CRC-X check information, so that the 257b code block corresponding to the error is discarded, the situation that the packet service processes the received error packet as a correct packet is not caused, and the transmission reliability is improved.

Optionally, if the rate-adapted 66b code block stream is encoded and converted into another format code block stream, for example, 513b code block or 514b code block, the control information and the traffic data information of the 513b code block stream or 514b code block stream are mapped correspondingly. For example, for a 513b code block stream, 1-bit code block type indication of each 513b code block may be mapped to an overhead region of an OSUflex frame, and the remaining 512 bits may be mapped to a payload region of the OSUflex frame. For the 514b code block stream, the overhead region of the OSUflex frame may be mapped with a code block type indication of 2 bits per 514b code block, and the remaining 512 bits are mapped to the payload region of the OSUflex frame. In addition, pointer overhead needs to be added in an overhead area of the OSUflex frame to indicate the starting position of the first complete code block carried in the payload area of the current OSUflex frame. The code block type indication and pointer overhead of these 513b code blocks mapped to the OSUflex frame are then CRC checked and added to the overhead region of the OSUflex frame.

It should be further noted that the method of providing reliability by CRC is only an example. It is also possible to improve reliability by providing a backup of multiple overhead information mapped to the overhead area of the OSUflex frame and by majority decision.

As an example, the mapping process of 257b code block data stream to OSUflex frame is described as follows, taking the OSUflex frame size as 192 bytes. Fig. 10A, fig. 10B, and fig. 10C are schematic structural diagrams of a possible OSUflex frame according to an embodiment of the present application.

Referring to fig. 10A, 10B and 10C, the OSUflex frame size is 192 bytes, wherein the overhead area contains 7 bytes and the payload area is 185 bytes. The payload area of each OSUflex frame may map the second part of 5 complete 257b code blocks and 20 bytes included in the second part of 1 257 code blocks, i.e., the payload area of each OSUflex frame may map 20 bytes of 256-bit information corresponding to 5 complete 257b code blocks and 256-bit information corresponding to 1 257 code blocks. As can be seen from the above, in the process of mapping 257b code block data streams to OSUflex frames, there is a case where 1 257b code blocks are simultaneously placed to two consecutive OSUflex frames, which may be referred to as cross-frame mapping.

5 bits of POINTER [4:0] are reserved in the overhead region of the OSUflex frame, where POINTER represents POINTER overhead and is used to indicate the start position corresponding to the first complete 257b code blocks in the payload region of the OSUflex frame. Where POINTER [4:0] indicates 5 bits in the POINTER overhead. Illustratively, the pointer overhead ranges from 0 to 31. Where "0" represents that the start position of the first complete 257b code block carried by the payload region of the current OSUflex frame is at byte 1 of the payload region of the OSUflex frame. For the "1 to 31" representing the starting position of the first complete 257b code block carried by the payload area of the current OSUflex frame from the 2 nd byte to the 32 nd byte of the payload area of the OSUflex frame, this is the case of cross-frame mapping, i.e. the incomplete 257b code block data of 1 to 31 bytes is first mapped at the beginning part of the payload area of the current frame, and then the mapping of the first complete 257b code block is started.

Accordingly, code block type information corresponding to the 257b code block mapped to the OSUflex payload region is mapped to the overhead region of the OSUflex frame. In the overhead area of the OSUflex frame, 6 bits of 257b _ IND [5:0] are reserved, which is dedicated to carry the code block type indication of 257b code blocks. 257b _ IND [5:0] may also be referred to as indicating overhead and by other names, which the present application does not limit. If the 6 257b code blocks carried by the current OSUflex frame contain 6 257b code block start bytes, such as fig. 10A and 10C, the code block type indication of the corresponding 6 257b code blocks is directly placed into 257b _ IND [5:0 ]. If the 6 257B code blocks carried by the current OSUflex frame contain 5 257B code block start bytes, such as shown in fig. 10B, only the type indication of the 257B code blocks containing the 5 257B code block start bytes is placed into the 257B _ IND [4:0] of 5 bits in the 257B _ IND overhead.

CRC8 cyclic redundancy check calculation is performed on overhead information such as control information (257b _ IND) and POINTER Overhead (POINTER), CRC8 information is generated and placed at the CRC8 overhead position. The check polynomial used for CRC8 calculation includes, but is not limited to, X8+ X2+ X +1, and the initial value is all 1. Extended, CRC8 may also utilize its 1-bit error correction function in addition to error detection.

The specific naming mode and the specific overhead position in the overhead area of the OSUflex frame are not limited, such as the overhead of the control information (257b _ IND), the overhead indication (POINTER), the check information (CRC8), and the like mentioned in the embodiments of the present application.

The following describes a scheme provided for the embodiments of the present application from the perspective of a receiving end.

Fig. 11 is a schematic flowchart of a possible service processing method according to an embodiment of the present application. The method for processing the service can be applied to a receiving end. It should be understood that the actions performed by the receiving end are a reverse process of the actions performed by the transmitting end, unless otherwise specified. As shown in fig. 11, the method of service processing includes S1101-S1105. For example, the OTN device at the receiving end may execute the method flow of the service processing. Specifically, S1102-S1105 may be executed by a processor, a chip system, or a module with a service processing function in the OTN device at the receiving end. Specifically, the OTN device may directly perform S1101 by an optical transceiver (sometimes also an optical transceiver module), that is, receive the OTN transmission frame.

S1101, receiving an OTN transmission frame, where the OTN transmission frame is used to carry encoded service data, and the encoded service data includes control information and service data information.

And further, extracting overhead information and check information of an overhead area of the OTN transmission frame. The overhead information includes control information (including a code block type indication) and may also include an overhead indication. And verifying the overhead information according to the verification information.

In one mode, if the check information is CRC information, CRC check processing may be performed on the overhead information according to the check information, and if the recalculated CRC-X value is the same as the CRC-X value extracted from the overhead area of the OSUflex frame, it is determined that no error has occurred in the check information in the overhead area. If the CRC-X value obtained by recalculation is different from the CRC-X value extracted from the overhead area of the OSUflex frame, the overhead area is considered to have bit errors, and the data carried by the payload area of the OSUflex frame can be directly discarded.

In another mode, if the sending end sends one or more same overhead messages as the check messages, it is able to determine whether the overhead is correct by determining whether the values of the multiple overhead messages are the same. In particular, a majority decision, or a plurality of consensus decisions, may be employed. For example, if there are three identical overheads, the exact transmission may be considered correct if they are identical, or the correct value may be the same number of overhead values. The present application is not limited.

Fig. 11 illustrates an example of extracting control information and check information of the control information from an overhead area of an OTN transport frame.

And S1102, acquiring the control information and the check information aiming at the control information from the overhead area of the OTN transmission frame, and checking the control information according to the check information.

For example, if the check information is CRC information, the receiving end performs CRC check processing on the control information according to the CRC information. For another example, the check information is one or more backups of the control information, and whether values are the same or not is determined according to comparison between one or more pieces of control information in the check information and the control information extracted from the overhead area, so as to check the control information extracted from the overhead area.

And S1103, if the verification result is correct, acquiring service data information from a payload area of the OTN transmission frame, and recombining the control information and the service data information to obtain the encoded service data.

Still, the OTN transmission frame is taken as an OSUflex frame, and the coded service data is taken as 257b code block stream as an example. The receiving end may obtain a starting position corresponding to a first complete 257b code block carried in the current OSUflex frame according to the pointer overhead, and analyze 256-bit data corresponding to each 257b code block from the starting position. For an OSUflex frame of size 192 bytes, the start of the first complete 257b code block is located in bytes 1 to 32 of the payload area of the OSUflex frame. Further, the receiving end obtains the code block type indication of how many 257b code blocks the overhead area of the current OSUflex frame contains according to the pointer overhead in the overhead area of the OSUflex frame. That is, after obtaining the pointer overhead, the receiving end can determine how many initial bytes of 257b code blocks are contained in the payload region of the current OSUflex frame, that is, know how many code block type indications of 257b code blocks are contained in the overhead region of the OSUflex frame. For an OSUflex frame with a size of 192 bytes, the payload area is 185 bytes, and if the pointer overhead value is one of 0 to 24, it indicates that the payload area of the OSUflex frame contains the starting bytes of 6 257b code blocks, i.e. the overhead area of the OSUflex frame contains code block type indicators of 6 257b code blocks, and extracts a 6-bit code block type indicator from 257b _ IND [5:0 ]. If the pointer overhead value is one of 25 to 31, it indicates that the payload area of the OSUflex frame contains the start byte of 5 257b code blocks, i.e. the OSUflex frame overhead area contains the type indication information of 5 257b code blocks, and 5-bit code block type indication is extracted from 257b _ IND [4:0 ].

Further, the obtained code block type indication and 256-bit data corresponding to the payload region are recombined into a 257b code block stream.

Since the acquired code block type indicator of 1 bit in each 257b code block is obtained after the CRC check, it is guaranteed that the obtained code block type indicator of 1 bit in each 257b code block is definitely error-free. Therefore, the situation that the receiving end mistakenly considers the 257b control code block as the 257b data code block due to the type indication error of the 1-bit code block and the mistaken decoding is converted into 4 66b data code blocks is ensured from the source, and accordingly the packet service treats the received mistaken packet as a correct packet, and the transmission reliability is improved.

S1104, decoding the encoded service data to obtain service data.

The decoding process described in S1104 is the reverse process of S302 described in the corresponding embodiment of fig. 3.

For the 3 encoding manners described in the embodiment corresponding to fig. 3, this embodiment exemplarily provides three decoding manners.

Mode 1: and carrying out 64b/66b decoding on the service data to obtain the service data.

Mode 2: 256b/257b decoding the service data to obtain a 66b code block stream; 64b/66b decoding the 66b code block stream to obtain the traffic data.

Mode 3: and 256b/257b decoding is carried out on the service data to obtain the service data.

Based on the same inventive concept as the above embodiments, the embodiments of the present application further provide a device for service processing. The method, the device and the system are based on the same inventive concept, and because the principles of solving the problems of the method, the device and the system are similar, the implementation of the device and the method can be mutually referred, and repeated parts are not repeated.

Fig. 12 and fig. 13 are schematic structural diagrams of two possible service processing apparatuses according to an embodiment of the present application. The apparatus 1200 for service processing shown in fig. 12 includes a service data obtaining unit 1201, a mapping unit 1202, and a sending unit 1203, and performs the service obtaining, service processing, and sending actions of the method of the OTN device at the sending end respectively. For example, the service data acquiring unit 1201 is configured to execute S301. The mapping unit 1202 is configured to perform S302-S304, and the sending unit 1203 is configured to perform S305. The apparatus 1300 for service processing shown in fig. 13 includes a receiving unit 1301 and a demapping unit 1302, which respectively perform service receiving and demapping operations of the method of the OTN device on the receiving end. For example, the receiving unit 1301 is configured to perform S1101, and the demapping unit 1302 is configured to perform S1102-S1104.

Those skilled in the art will appreciate that the apparatus 1200 and the units comprised by the apparatus 1200 may be implemented by one or more processors.

The division of the unit in the embodiment of the present application is schematic, and is only a logic function division, and there may be another division manner in actual implementation. In addition, functional units in the embodiments of the present application may be integrated into one processor, may exist alone physically, or may be integrated into one unit from two or more units. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.

Fig. 14 is a schematic structural diagram of a possible service processing apparatus according to an embodiment of the present application. As shown in fig. 14, a service processing device 1400 may include a processor 1401 and a memory 1402. The service processing apparatus may be applied to both an OTN device at a transmitting end (embodiment corresponding to fig. 3) and an OTN device at a receiving end (embodiment corresponding to fig. 11). Program code executed by processor 1401 to implement the above-described methods may be stored in memory 1402. A memory 1402 is coupled to the processor 1401. The processor 1401 may cooperate with the memory 1402.

In one example, the service data acquiring unit 1201, the mapping unit 1202, and the sending unit 1203 shown in fig. 12 may be implemented by the processor 1401. Processor 1401 may illustratively be a signal processor in a circuit board or a circuit board as shown in fig. 2. The processor 1401 is configured to implement the method performed by the OTN device at the transmitting end in fig. 3. In implementation, the steps of the processing flow may complete the method executed by the OTN device at the transmitting end in fig. 3 through instructions in the form of hardware integrated logic circuits or software in the processor 1401.

In another example, the receiving unit 1301 and the demapping unit 1302 shown in fig. 13 may be implemented by the processor 1401. Processor 1401 may illustratively be a signal processor in a circuit board or a circuit board as shown in fig. 2. The processor 1401 is used to implement the method performed by the OTN device at the receiving end of fig. 11. In implementation, the steps of the processing flow may complete the method executed by the OTN device on the receiving end in fig. 11 through instructions in the form of hardware integrated logic circuits or software in the processor 1401.

It should be noted that, when the processor 1401 executes the sending step, it may send the sending step to the optical transceiver, so that the optical transceiver sends the sending step to the opposite device. The processor 1401, when performing the receiving step, may receive the OTN data from the optical transceiver to perform other subsequent processing steps.

The processor 1401 in the embodiments of the present application may be a general-purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, or a discrete hardware component, and may implement or execute the methods, steps, and logic blocks disclosed in the embodiments of the present application. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware processor, or may be implemented by a combination of hardware and software elements in a processor. The coupling in the embodiments of the present application is an indirect coupling or a communication connection between devices, units or modules, and may be an electrical, mechanical or other form for information interaction between the devices, units or modules. The memory 1402 may be a nonvolatile memory such as a Hard Disk Drive (HDD) or the like, and may also be a volatile memory (RAM) such as a random-access memory (RAM). Memory 1402 is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to such.

Based on the above embodiments, the present application also provides a computer-readable storage medium, in which a software program is stored, and the software program can implement the method provided by any one or more of the above embodiments when being read and executed by one or more processors. The computer-readable storage medium may include: u disk, removable hard disk, read only memory, random access memory, magnetic or optical disk, etc. for storing program codes.

Based on the above embodiments, the present application further provides a chip, where the chip includes a processor, and is configured to implement the functions related to any one or more of the above embodiments, such as acquiring or processing the data frame related to the above method. Optionally, the chip further comprises a memory for the processor to execute the necessary program instructions and data. The chip may be constituted by a chip, or may include a chip and other discrete devices.

As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

It will be apparent to those skilled in the art that various changes and modifications may be made in the embodiments of the present application without departing from the scope of the embodiments of the present application. Thus, if such modifications and variations of the embodiments of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to encompass such modifications and variations.

Claims

1. A method for service processing, the method comprising:

acquiring service data;

coding the service data to obtain coded service data, wherein the coded service data comprises control information and service data information;

mapping the control information to an overhead area of an OTN transmission frame of an optical transport network, verifying the control information to obtain verification information, and mapping the verification information to the overhead area of the OTN transmission frame;

mapping the service data information to a payload area of the OTN transmission frame;

and sending the OTN transmission frame carrying the coded service data.

2. The method of claim 1, wherein the traffic data is Media Access Control (MAC) frame data, a network protocol (IP) packet, a multi-protocol label switching (MPLS) packet, a flexible Ethernet (Flexe) traffic code block stream, or a 66b code block stream.

3. The method of claim 1 or 2, wherein said encoding said traffic data comprises:

and carrying out 64b/66b coding on the service data to obtain the coded service data.

4. The method of claim 1 or 2, wherein said encoding said traffic data comprises:

performing 64b/66b coding on the service data to obtain a 66b code block stream;

and performing 256b/257b coding processing on the 66b code block stream to obtain 257b code block stream, wherein the 257b code block stream is the coded service data.

5. The method of claim 1 or 2, wherein the traffic data is a 66b code block stream, and wherein the encoding the traffic data comprises:

and carrying out 256b/257b coding processing on the service data to obtain the coded service data.

6. The method of claim 4 or 5, wherein the control information comprises a code block type indication.

7. The method of claim 6, wherein when the code block type indicator 257b code block is a control code block, the encoded traffic data further comprises a first code block pattern indicator indicating a pattern of 66b code blocks contained in a code block in which the first code block type indicator is located.

8. The method of claim 7, wherein the method further comprises:

encoding a first code block pattern indication included in the encoded traffic data into a second code block pattern indication; the minimum hamming distance of the different values indicated by the second code block pattern is 2.

9. The method of claim 7, wherein when the code block type indication 257b code block is a 257b control code block, further comprising:

adding a third code block pattern indication in the coded service data, wherein the third code block pattern indication is used for indicating a pattern of a 66b code block contained in the code block in which the third code block pattern indication is located, and the minimum hamming distance of different values indicated by the third code block pattern is 2.

10. The method according to any of claims 1-8, wherein the OTN transport frames are flexible optical service unit OSUflex frames.

11. The method of claim 10, wherein the OSUflex frame has a length of 192 bytes, 240 bytes, 128 bytes, or 64 bytes.

12. The method of any of claims 1-11, wherein the check information is cyclic redundancy check, CRC, information.

13. A method according to any of claims 1-11, wherein said check information is one or more copies of said control information.

14. The method of claims 1-13, wherein the bit rate of the traffic data information is equal to the rate corresponding to the payload region of the OTN transport frame.

15. The method of claim 14, wherein the bit rate of the traffic data information is a rate adapted by performing rate adaptation on the punctured idle code blocks, and the bit rate of the rate adapted traffic data information is equal to a rate corresponding to a payload area of the OTN transmission frame.

16. A method for service processing, the method comprising:

receiving an OTN transmission frame of a light transport network, wherein the OTN transmission frame is used for bearing encoded service data, and the encoded service data comprises control information and service data information;

acquiring the control information and check information aiming at the control information from an overhead area of the OTN transmission frame, and checking the control information according to the check information;

if the checking result is correct, acquiring the service data information from a payload area of the OTN transmission frame, and recombining the control information and the service data information to obtain the encoded service data;

and decoding the coded service data to acquire the service data.

17. The method of claim 16, wherein the traffic data is Media Access Control (MAC) frame data, a network protocol (IP) packet, a multi-protocol label switching (MPLS) packet, a flexible Ethernet (Flexe) traffic code block stream, or a 66b code block stream.

18. The method of claim 16 or 17, wherein decoding the encoded traffic data comprises:

and carrying out 64b/66b decoding on the coded service data to obtain the service data.

19. The method of claim 16 or 17, wherein said decoding said encoded traffic data comprises:

256b/257b decoding is carried out on the coded service data to obtain a 66b code block stream;

64b/66b decoding the 66b code block stream to obtain the traffic data.

20. The method according to claim 16 or 17, wherein the service data is a 66b code block stream, and the decoding the encoded service data specifically includes:

and 256b/257b decoding is carried out on the coded service data to obtain the service data.

21. The method of claim 19 or 20, wherein the control information comprises a code block type indication.

22. The method of claim 21, wherein when the code block type indicator 257b code block is a control code block, prior to the 256b/257b decoding of the encoded traffic data, the method further comprises:

decoding a second code block pattern indication included in the coded traffic data into a first code block pattern indication, wherein the first code block pattern indication is used for indicating a pattern of 66b code blocks contained in a code block in which the first code block type indication is located; the minimum hamming distance of the different values indicated by the second code block pattern is 2.

23. The method of claim 22, wherein the 256b/257b decoding of the encoded traffic data comprises:

decoding the coded service data to obtain a third code block pattern indication, wherein the third code block pattern indication is used for indicating a pattern of 66b code blocks contained in 257b code blocks where the third code block pattern indication is located; the minimum hamming distance of the different values indicated by the third code block pattern is 2.

24. The method according to any of claims 16-23, wherein the OTN transport frame is a flexible optical service unit, OSUflex, frame.

25. A method according to any of claims 16-24, wherein the OSUflex frame is 192 bytes, 240 bytes, 128 bytes or 64 bytes in length.

26. The method of any of claims 16-25, wherein the check information is CRC check information.

27. A method according to any of claims 16-26, wherein said check information is one or more copies of said control information.

28. The method of claims 16-27, wherein the bit rate of the traffic data information is equal to the rate corresponding to the payload region of the OTN transport frame.

29. An apparatus for traffic processing, the apparatus comprising a processor and a memory, wherein:

the memory is used for storing program codes;

the processor is used for reading and executing the program codes stored in the memory so as to realize the method of any one of claims 1 to 28.

30. An OTN device, comprising the apparatus of claim 29 and an optical transceiver, wherein the optical transceiver is configured to receive and transmit an OTN transmission frame sent by the apparatus, or is configured to receive and transmit an OTN transmission frame to the apparatus.