Method and apparatus for processing data frames

Abstract

The application provides a data frame processing method applied to the field of optical transport networks. The data frame processing method comprises the following steps: obtaining a plurality of service data. The plurality of service data are respectively mapped into a plurality of service frames. The plurality of service frames are mapped into M groups of PBs in the payload area of N data frames. M and N are integers greater than 0. Each group of PBs comprises RxC PBs. R and C are integers greater than 1. The size of each PB is S1 bytes. The size of each payload area in the N data frames occupied by the PBs is S2 bytes. MxRxCS1=NxS2. Each group of PBs comprises C1 groups of shared PBs. Each group of shared PBs comprises R1 shared PBs carrying service data. Each shared PB in the R1 shared PBs comprises a plurality of data of a plurality of services. In the application, a plurality of services share one PB, thereby reducing processing delay or improving transmission efficiency.

Description

[0001] This application claims priority to the Chinese patent application filed with the State Intellectual Property Office of China on February 11, 2022, with application number 202210130541.0 and application name “Method and Device for Processing Data Frames”, the entire contents of which are incorporated by reference into this application. Technical Field

[0002] The present application relates to the field of optical transmission networks, and in particular to a method and device for processing data frames. Background Art

[0003] The Optical Transport Network (OTN), a core technology for backbone transport networks, includes optical bearer containers with various rates. For example, the Optical Data Unit 0 (ODU0) frame is the lowest-rate bearer container in current OTN technology, operating at approximately 1.25 gigabits per second (Gbps) and carrying 1Gbps Ethernet service data. To improve transport efficiency, current OTN optical bearer containers utilize time-division multiplexing (TDM). Specifically, a high-rate bearer container is divided into multiple fixed-size payload blocks (PBs) to carry multiple services.

[0004] For low-rate service data, when using PB transmission, it is necessary to wait for a transmission cycle or fill it before sending, which increases transmission delay or reduces transmission efficiency. Summary of the Invention

[0005] The present application provides a method and device for processing data frames, which can reduce processing delay or improve transmission efficiency by allowing multiple services to share one PB.

[0006] In a first aspect, the present application provides a method for processing data frames. The method can be applied to a data frame processing device. The data frame processing device can be an OTN device or a metropolitan transport network (MTN) device. The following description will use the OTN device as an example. The method includes the following steps: The OTN device obtains multiple service data. The OTN device maps the multiple service data into multiple service frames. The service frames can be OSU frames or other data frames with OSU-like frame structures. The OTN device maps the multiple service frames into M groups of payload blocks (PBs) in the payload area of ​​N data frames. Each group of PBs can also be referred to as a P frame. The data frame can be an OTN frame, a flexible Ethernet (FlexE) frame, or an MTN frame. M and N are integers greater than 0. Each group of PBs includes R×C PBs. R and C are integers greater than 1. The size of each PB is S1 bytes. The size of each payload area occupied by the PB in the N data frames is S2 bytes. M×R×C×S1=N×S2. Each group of PBs includes C1 shared PBs. C1 is a positive integer less than or equal to C. Each group of shared PBs includes R1 shared PBs. R1 is a positive integer less than or equal to R. Each of the R1 shared PBs is used to carry data for multiple services. The number of the multiple services is greater than 1. The number of the multiple services is less than or equal to R. The N data frames are transmitted.

[0007] In this application, by allowing multiple services to share a single PB, a PB can be accumulated in advance, thereby reducing processing latency or improving transmission efficiency. Furthermore, the size of M P frames is the same as the size of N S2 frames. Therefore, when an OTN device performs periodic data processing with N data frames as the target period, the PB division in the first data frame and the N+1th data frame can be the same. The PBs at the same position in the first data frame and the N+1th data frame carry data for the same group of services. Based on this feature, the OTN device can verify the accuracy of the data frames. Therefore, this application can improve the reliability of data frame processing.

[0008] In an optional embodiment of the first aspect, each group of PBs also includes a C2 group-exclusive PB. The sum of C1 and C2 equals C. Each group of exclusive PBs includes R exclusive PBs. The R exclusive PBs contain data for the same service. By dividing a P frame into the C2 group-exclusive PB and the C1 group-shared PB, service transmission flexibility can be improved.

[0009] In an optional embodiment of the first aspect, the M groups of PBs include a P1 group of PBs and a P2 group of PBs. P1 and P2 are integers greater than 0. The sum of P1 and P2 equals M. Each group of PBs in the P1 group of PBs includes a C3 group of overhead PBs, a C4 group of exclusive PBs, and a C1 group of shared PBs. Each group of exclusive PBs in the C4 group of exclusive PBs includes R exclusive PBs. Each group of exclusive PBs is used to carry data belonging to the same service. Each group of overhead PBs in the C3 group of overhead PBs includes R overhead PBs. The R overhead PBs are used to carry relevant information of multiple service data. C3 and C4 are integers greater than 0. The sum of C3, C4, and C1 equals C. Each group of PBs in the P2 group of PBs also includes a C2 group of exclusive PBs. The sum of C1 and C2 equals C. Each group of exclusive PBs includes R exclusive PBs. By adding the C1 group of overhead PBs to the P1 group of PBs, relevant information of multiple service data can be efficiently and quickly transmitted to intermediate switching nodes and / or destination nodes along with P frames. Therefore, embodiments of the present application can improve the reliability of service transmission.

[0010] In an optional manner of the first aspect, T = (P1×C3) ÷ ​​(M×C). The value of T ranges from 0.001 to 0.1. T can be equal to 0.001 or 0.1. By controlling the number of overhead PB columns, it is helpful to reduce the number of overhead PBs while transmitting relevant information of multiple service data, thereby improving transmission efficiency.

[0011] In an optional manner of the first aspect, a transmission rate of each of the plurality of data is less than 11 million bits per second (Mbps), and / or a transmission rate of each of the R exclusive PBs is greater than 100 Mbps.

[0012] In an optional embodiment of the first aspect, K = M × R × C × S1, and K1 = R × C × S1. K is the least common multiple of K1 and S2. When K is the least common multiple of K1 and S2, the values ​​of N and M are minimized. In this case, the target period is minimized. The smaller the target period, the shorter the time it takes for the OTN equipment to adjust, add, or delete transmitted services. Therefore, this application can improve the dynamic adjustment capability of processing data frames.

[0013] In an optional mode of the first aspect, the N data frames comprise a shared identifier. The shared identifier is used to mark the C1 group shared PBs. The receiver can receive the N data frames. The receiver can process the exclusive PBs and the shared PBs in different ways according to the shared identifier. For example, for the exclusive PBs, the receiver can directly map one exclusive PB to one optical service unit (OSU) frame. For the shared PBs, the receiver processes the remaining R1-1 shared PBs. The receiver combines data in the R1 shared PBs. The receiver maps the combined data to multiple OSU frames of multiple services. Therefore, by adding the shared identifier, the reliability of transmitting the data frames can be improved.

[0014] In an optional mode of the first aspect, the N data frames are OTN frames. S2 is 4×3808, and R1 is equal to R. R is 12. C is 10.

[0015] In an optional mode of the first aspect, the size S1 of each PB is 192. M is 119. N is 180.

[0016] In an optional mode of the first aspect, R is an integer multiple of 17. C is 7.

[0017] In an optional mode of the first aspect, R is 17. The size S1 of each PB is 192. M is 2. N is 3.

[0018] In an optional mode of the first aspect, R is 34. The size S1 of each PB is 192. M is 1. N is 3.

[0019] In an optional mode of the first aspect, R is 68. The size S1 of each PB is 192. M is 1. N is 6.

[0020] In an optional mode of the first aspect, the N data frames are OTN frames. The size of each payload area is 4×3808. S2 is 15168 bytes. Each payload area further comprises a 64-byte overhead field. By using the shared PBs, the difficulty of managing the PBs is increased. Therefore, by adding the overhead field, the reliability of processing the data frames can be improved.

[0021] In an optional mode of the first aspect, R1 is equal to the R. R is 12. C is 10.

[0022] In an optional mode of the first aspect, the size S1 of each PB is 192. M is 79. N is 120.

[0023] In an optional mode of the first aspect, the overhead field comprises identifications of the plurality of services. The plurality of data of the plurality of services are carried in the shared PB. Thus, the OTN device can associate the plurality of data by the identifications of the plurality of services, thereby improving the reliability of processing the data frame.

[0024] In an optional mode of the first aspect, S=S1 ÷ R. S equals 8. When S equals 8, the size of one sub-PB is 64 bits. At this time, the size of one sub-PB equals the size of a data block in 64b / 66b coding in Ethernet service transmission. Thus, the P-frame provided in the present application is adapted to Ethernet service transmission, thereby reducing service latency and processing complexity.

[0025] In an optional mode of the first aspect, S2 is 4×3808. S1 equals 192. R1 equals R. R is 24. C is 12.

[0026] In an optional mode of the first aspect, S2 is 4×3808. S1 equals 192. R1 equals R. R is 24. C is 10.

[0027] In an optional mode of the first aspect, S2 is 4×3808. S1 equals 240. R1 equals R. R is 30. C is 12.

[0028] In an optional mode of the first aspect, the difference between R1 and R is X. Each group of shared PBs further comprises X overhead PBs. X is an integer greater than 0. Wherein, by letting the plurality of services share one PB, the difficulty of managing the PBs is increased. Thus, by letting part of the PBs be overhead PBs, the reliability of processing the data frame is improved.

[0029] In an optional mode of the first aspect, each shared PB of the R1 shared PBs further comprises a management field. The management field is used for operation, administration and maintenance OAM. Wherein, by letting the plurality of services share one shared PB, the difficulty of managing the shared PBs is increased. Thus, by adding the management field in the shared PBs, the reliability of processing the data frame is improved.

[0030] In an optional mode of the first aspect, in each shared PB, the size of the management field is the same as the size of each data of the plurality of service data. Wherein, by limiting the size of the management field to be the same as the size of each data, the OTN device can manage the shared PBs conveniently.

[0031] The second aspect of the present application provides a data frame processing apparatus. The data frame processing apparatus comprises a processor and a transceiver. The processor is configured to execute the method of the first aspect or any one of the implementation modes of the first aspect, to obtain N data frames. The transceiver is configured to transmit the N data frames.

[0032] A third aspect of the present application provides a data frame processing method. The data frame processing method can be applied to a data frame processing device. The data frame processing device can be an OTN device or other device. The following description will use an OTN device as an example. The data frame processing method includes the following steps: The OTN device obtains N data frames. The payload areas of the N data frames include M groups of PBs. M and N are integers greater than 0. Each group of PBs includes R×C PBs. R and C are integers greater than 1. The size of each PB is S1 bytes. The size occupied by each PB in the payload area of ​​the N OPU frames is S2 bytes. M×R×C×S1=N×S2. Each group of PBs includes C1 shared PBs. C1 is a positive integer less than or equal to C. Each group of shared PBs includes R1 shared PBs. R1 is a positive integer less than or equal to R. Each of the R1 shared PBs is used to carry data for multiple services. The number of the multiple services is greater than 1 and less than or equal to R. The OTN device maps the M groups of PBs in the N data frames into multiple service frames.

[0033] A fourth aspect of the present application provides a data frame processing device. The data frame processing device includes a processor and a transceiver. The transceiver is configured to receive N data frames. The processor is configured to execute the method described in the third aspect to obtain multiple service frames.

[0034] The fifth aspect of the present application provides a computer storage medium, characterized in that instructions are stored in the computer storage medium, and when the instructions are executed on a computer, the computer executes the method as described in the first aspect or any one of the embodiments of the first aspect; or the computer executes the method as described in the third aspect.

[0035] In a sixth aspect, the present application provides a computer program product, characterized in that when the computer program product is executed on a computer, it enables the computer to execute the method described in the first aspect or any one of the embodiments of the first aspect; or enables the computer to execute the method described in the third aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] Figure 1 The schematic diagram of the OTN structure provided for this application;

[0037] Figure 2 A schematic diagram of the structure of the OTN equipment provided for this application;

[0038] Figure 3 Schematic diagram of mapping OSU frames to OTN frames provided in this application;

[0039] Figure 4 A first flow chart of a method for processing a data frame provided in an embodiment of the present application;

[0040] Figure 5 A first structural diagram of a P frame provided in an embodiment of the present application;

[0041] Figure 6 This is a first structural diagram of the exclusive PB and shared PB provided in an embodiment of the present application;

[0042] Figure 7 A first structural diagram of mapping an OSU frame to a sub-PB provided in an embodiment of the present application;

[0043] Figure 8 A second structural diagram of a P frame provided in an embodiment of the present application;

[0044] Figure 9 A second structural diagram of the exclusive PB and shared PB provided in an embodiment of the present application;

[0045] Figure 10 A second structural diagram of an OSU frame mapped into a sub-PB provided in an embodiment of the present application;

[0046] Figure 11 A third structural diagram of a P frame provided in an embodiment of the present application;

[0047] Figure 12 A schematic diagram of the structure of the payload area provided in an embodiment of the present application;

[0048] Figure 13 This is a fourth structural diagram of a P frame provided in an embodiment of the present application;

[0049] Figure 14 A schematic diagram of the structure of a P frame including an overhead PB column provided in an embodiment of the present application;

[0050] Figure 15 A schematic diagram of the structure of a shared PB provided in an embodiment of the present application;

[0051] Figure 16 A second flow chart of the method for processing a data frame provided in an embodiment of the present application;

[0052] Figure 17 A structural diagram of a data frame processing device is provided for an embodiment of the present application. DETAILED DESCRIPTION

[0053] First, some terms in this application are explained to facilitate understanding by those skilled in the art.

[0054] 1) multiple refers to two or more. And / or describes the association between the associated objects, and there can be three relationships. For example, A and / or B can represent three cases: A exists alone, A and B exist together, and B exists alone. In addition, in the description of the present application, the terms "first", "second", "exclusive", "shared" and the like are only used for the purpose of distinguishing the description, and cannot be understood as indicating or implying relative importance. Also, the distinguishing terms such as "exclusive" and "shared" can be replaced by first or second.

[0055] 2) A mentioned in the present application is mapped into B, which means that A is encapsulated into B. For example, mapping an optical service unit (OSU) frame into an OTN frame means encapsulating an OSU frame or an OSU signal into an OTN frame.

[0056] 3) Unless otherwise specified, the specific description of some technical features in one embodiment can also be applied to explain the corresponding technical features mentioned in other embodiments. For example, the overhead and meaning contained in the payload block in one embodiment can also be applied to the payload block mentioned in other embodiments. For example, the specific examples and descriptions of the optical transport network frame can be applied to the optical transport network frame mentioned in different specific embodiments or used to replace the specific examples of the optical transport network frame. In addition, in order to more clearly reflect the relationship between the components in different embodiments, the same or similar reference numbers are used to represent the components or method steps with the same or similar functions in different embodiments.

[0057] The embodiments of the present application are applicable to optical networks such as optical transport networks or metropolitan area transport networks. The optical transport network includes OTN or flexible Ethernet (FlexE). In the subsequent description of the present application, OTN will be described as an example. An OTN is usually composed of multiple OTN devices connected by optical fibers, and can be composed of different topologies such as linear, ring and mesh according to specific needs. Figure 1 The structure of the OTN provided in the present application is shown in the figure. As shown in Figure 1 The OTN 100 is composed of 8 OTN devices 101, i.e. OTN devices A-H. Among them, 102 indicates an optical fiber, which is used to connect two devices. 103 indicates a customer service interface, which is used to receive or send customer service data. As shown in Figure 1 The OTN 100 is used to transmit service data for customer devices 1-3. The customer devices are connected to the devices of the OTN through the customer service interface. For example, Figure 1 In the figure, customer devices 1-3 are connected to OTN devices A, H and F respectively.

[0058] According to actual needs, an OTN device can have different functions. Generally, OTN devices are divided into optical layer devices, electrical layer devices, and optical-electrical hybrid devices. Optical layer devices refer to devices capable of processing optical layer signals, such as optical amplifiers (OAs) and optical add-drop multiplexers (OADMs). An OA can also be referred to as an optical line amplifier (OLA), which is mainly used to amplify optical signals to support transmission over a longer distance while ensuring the specific performance of the optical signals. An OADM is used to spatially transform optical signals so that they can be output from different output ports (sometimes also referred to as directions). Electrical layer devices refer to devices capable of processing electrical layer signals, such as devices capable of processing OTN signals. Optical-electrical hybrid devices refer to devices capable of processing both optical layer signals and electrical layer signals. It should be noted that, according to specific integration needs, an OTN device can integrate multiple different functions. The technical solutions provided in this application are suitable for OTN devices containing electrical layer functions in different forms and integration levels.

[0059] It should be noted that the data frame structure used by the optical transmission device in the embodiments of this application can be an OTN frame. The OTN frame is used to carry various service data and provides rich management and monitoring functions. The OTN frame can be an optical data unit frame (ODUk), an ODUCn, an ODUflex, or an optical transport unit frame (OTUk), an OTUCn, or a flexible OTN (FlexO) frame, etc. Among them, the ODU frame and the OTU frame differ in that the OTU frame includes an ODU frame and OTU overhead. K represents different rate levels. For example, k = 1 represents 2.5 Gbps, and k = 4 represents 100 Gbps. Cn represents a variable rate, specifically a rate that is a positive integer multiple of 100 Gbps. Unless otherwise specified, ODU frame refers to any one of ODUk, ODUCn, or ODUflex, and OTU frame refers to any one of OTUk, OTUCn, or FlexO. It should also be noted that, with the development of optical transport network technology, new types of OTN frames can be defined, which are also applicable to this application. In addition, the methods disclosed in this application can also be applicable to other optical transport network frames such as FlexE frames.

[0060] Figure 2 A structure diagram of the OTN device provided in this application is shown. The OTN device 200 can be any one of the OTN devices A-H in Figure 1 . As shown in Figure 2As shown, the OTN device 200 includes a tributary board 201, a cross board 202, a line board 203, optical layer processing single boards (not shown in the figure), and a system control and communication type single board 204.

[0061] The tributary board 201, the cross board 202, and the line board 203 are used to process electrical layer signals. Among them, the tributary board 201 is used to implement the reception and transmission of various customer services, such as SDH services, packet services, Ethernet services, and / or front-haul services, etc. Further, the tributary board 201 can be divided into a customer side optical transceiver module and a signal processor. Among them, the customer side optical transceiver module can also be referred to as an optical transceiver, which is used to receive and / or transmit service data. The signal processor is used to implement the mapping and demapping processing of the service data to data frames. The cross board 202 is used to implement the switching of data frames, and complete the switching of one or more types of data frames. The line board 203 mainly implements the processing of line side data frames. Specifically, the line board 203 can be divided into a line side optical module and a signal processor. Among them, the line side optical module can be referred to as an optical transceiver, which is used to receive and / or transmit data frames. The signal processor is used to implement the multiplexing and demultiplexing, or mapping and demapping processing of the line side data frames. The system control and communication type single board 204 is used to implement system control. Specifically, information can be collected from different single boards, or control instructions can be sent to the corresponding single boards. It should be noted that, unless otherwise specified, a specific component (such as a signal processor) can be one or more, and the present application does not make any limitation. It should also be noted that the type of single board included in the device, and the functional design and number of single boards, are not limited by the present application. It should be noted that in a specific implementation, the above two single boards can also be designed as one single board. In addition, the network device can also include a backup power supply, a fan for heat dissipation, etc.

[0062] It should be understood that, Figure 2 The OTN device provided by the present application is just an example. According to specific needs, the type and number of single boards included in the OTN device can be different. For example, the OTN device as a core node does not have a tributary board 201. For another example, the OTN device as an edge node has multiple tributary boards 201, or does not have an optical cross board 202. For another example, the OTN device supporting only electrical layer functions can not have optical layer processing single boards.

[0063] According to the foregoing description, the method provided by the present application is described by taking the OTN as an example. At this time, the service frame can be an OSU frame. The data frame can be an OTN frame or an OPU frame. The process of mapping the OSU frame to the OTN frame by the OTN device will be described exemplarily below.

[0064] Figure 3 The schematic diagram of mapping the OSU frame to the OTN frame provided by the present application is shown in FIG. 1. As shown in FIG. 1, the OTN device 200 includes a tributary board 201, a cross board 202, a line board 203, optical layer processing single boards (not shown in the figure), and a system control and communication type single board 204. Figure 3As shown, OTN frame 302 is a schematic diagram of an optical transport network frame. OTN frame 302 has a structure of four rows and multiple columns. OTN frame 302 includes an overhead area, a payload area, and a forward error correction (FEC) area. The payload area is divided into multiple payload blocks (PBs). Each PB occupies a fixed length (also called size) in the payload area, for example, 192 or 128 bytes. It should be understood that OTN frame 302 is merely an example. Other variations of OTN frames are also applicable to this application. For example, an OTN frame that does not include an FEC area. Another example is a frame structure with a different number of rows and columns than OTN frame 302. It should be understood that PBs can also be referred to as time slots, time slot blocks, or time slices. This application does not restrict these names. It should be understood that in actual applications, the payload area of ​​an OTN frame may not be divided into an integer number of PBs. In this case, part of some PBs may be in the payload area of ​​one OTN frame, while another part of the PB may be in the payload area of ​​another OTN frame.

[0065] OSU frame 301, such as Figure 3 As shown, it includes an overhead area and a payload area. The overhead area of ​​the OSU frame 301 is used to carry overhead information. The overhead information may include a service identifier (SID), a trail trace identifier (TTI) or a bit-interleaved parity (BIP), etc. The payload area of ​​the OSU frame 301 is used to carry service data. The rate of an OSU frame is defined as an integer multiple of the reference rate. The reference rate can be 2.6Mbps, 5.2Mbps or 10.4Mbps or multiples of these values. It should be understood that Figure 3 The OSU frame structure shown is only an example. In other specific implementations, the OSU frame may also be a data structure including an overhead subframe and a payload subframe. This application does not limit this.

[0066] like Figure 3 As shown, the OSU frame is mapped to the payload area of ​​the OTN frame. Specifically, the OSU frame is mapped to the PB of the OTN frame. In one possible implementation, one OSU frame is mapped to one PB. In another possible implementation, one OSU frame is mapped to multiple PBs. This application does not limit this. For simplicity, the subsequent embodiments use one OSU frame mapped to one PB as an example. It should be understood that the subsequent embodiments are also applicable to the case where one OSU frame is mapped to multiple PBs. Variations of the technical solution for the latter case also fall within the scope of protection of this application.

[0067] To simplify and efficiently carry OSU frames, multiple consecutive PBs in an OTN frame are defined as a transmission cycle. PB blocks are allocated to OSU frames based on the transmission cycle. For example, assuming OSU frames and PBs have the same size and rate, 10 OSU frames carrying service data for the same service can occupy PBs numbered 0-9 within a transmission cycle consisting of 20 PBs. To simplify the description, OSU frames carrying the same service data are referred to as OSU signals. An OSU signal is a bit stream carrying service data, and the frame format of this bit stream is the same as that of an OSU frame. An OSU signal can include one or more OSU frames.

[0068] When using PBs to transmit low-rate data, data must wait for a transmission cycle or require padding before it can be sent, increasing transmission latency and reducing transmission efficiency. Furthermore, the location of PBs changes dynamically across different OTN frames. Consequently, OTN frame management and maintenance are highly complex, resulting in low reliability in OTN frame processing.

[0069] To this end, the present application provides a method for processing a data frame. The method for processing a data frame can be applied to Figure 1 The OTN equipment shown in . Figure 4 This is a first flow chart of the method for processing data frames provided in the embodiment of the present application. Figure 4 As shown, the data frame processing method includes the following steps.

[0070] In step 401, the OTN device obtains multiple service data. Service data refers to services that can be carried by the optical transport network. For example, it can be Ethernet services, packet services, wireless backhaul services, etc.

[0071] In step 402, the OTN device maps multiple service data to multiple service frames. The service frames can be OSU frames or other data frames with a frame structure similar to the OSU frames. In the embodiment of the present application, the service frames are described as OSU frames.

[0072] In step 403, the OTN device maps multiple service frames to M groups of payload blocks PB in the payload area of ​​N data frames. The data frame can be an OTN frame, a FlexE frame, or an MTN frame. In the embodiment of the present application, the data frame is an OTN frame as an example for description. The OTN device maps multiple OSU frames to the payload area of ​​N OTN frames. Each OTN frame includes a payload area. N OTN frames include N payload areas. For the description of OTN frames and payload areas, please refer to the aforementioned Figure 3 Related description in .

[0073] It should be understood that after the data frames carry the services, the OTN equipment will send out the data frames to complete the transmission of the service data.

[0074] N payload areas include M groups of PBs. M and N are integers greater than 0. Each group of PBs includes R×C PBs. R×C can mean R rows and C columns. Each group of PBs can serve as a transmission cycle for the OTN device. In this case, each group of PBs can also be referred to as a P frame. R and C are integers greater than 1. R and C can be combined in various ways. For example, Table 1 provides several examples of combinations of R and C in the embodiments of this application. It should be understood that in actual applications, those skilled in the art can combine R and C as needed.

[0075] R 17 34 68 12 8 24 24 30 C 7 7 7 10 12 10 12 12

[0076] Table 1

[0077] In each group of PBs, the size of each PB is S1 bytes. S1 can be 128, 192, or 240, etc. The size of each payload area occupied by PB in N OTN frames is S2 bytes. For example, in Figure 3 In [1], S2 is 4×3808. Each group of PBs includes C1 shared PBs. C1 is a positive integer less than or equal to C. Each group of shared PBs includes R1 shared PBs. R1 is a positive integer less than or equal to R. Each of the R1 shared PBs includes multiple data items for multiple services. The number of multiple data items is greater than 1. The number of multiple data items is less than or equal to R.

[0078] In the embodiments of the present application, by allowing multiple services to share a single private block (PB), processing latency can be reduced or transmission efficiency can be improved. Furthermore, M × R × C × S1 = N × S2, meaning the size of M P frames is the same as the size of N S2 frames. Therefore, when an OTN device processes data frames periodically with N OTN frames as the target period, the PB divisions in the first and N+1 data frames can be identical. PBs at the same position in the first and N+1 data frames carry data for the same service. Based on this characteristic, the OTN device can verify the accuracy of data frames. Therefore, the present application can improve the reliability of data frame processing.

[0079] As can be seen from the above description, R, C, S2 and S1 can have different value combinations. Several value combinations provided in the embodiments of the present application are described below.

[0080] In the first example, R is 12, C is 10, S1 is 192, and S2 is 4×3808. Figure 5 This is the first structural diagram of the P frame provided in the embodiment of the present application. Figure 5As shown, the P frame 501 includes 12x10 PBs. The size of each PB is 192 bytes. At this time, K1=RxCxS1=12x10x192=120x192. S2=4x3808=128x119. K=Mx120x192=Nx128x119. At this time, M can be an integer multiple of 119. N can be an integer multiple of 180. For example, when M is equal to 119, N is equal to 180. When M is equal to 238, N is equal to 360.

[0081] In Figure 5 , the transmission period is 12x10 PBs. The target period is the product of the transmission period and M. The smaller M or N is, the smaller the target period is. The smaller the target period is, the shorter time the OTN device can take to adjust and add / drop the transmitted service. Therefore, the scheme disclosed in the embodiments of the present application can improve the dynamic adjustment capability of processing data frames. The smaller the target period is, the shorter time the OTN device can take to find the abnormality of the OTN frame. The abnormality of the OTN frame includes that the PB division in the 1st OTN frame and the N+1th OTN frame is different. And / or, the PB at the same position in the 1st OTN frame and the N+1th OTN frame carries different service data. Therefore, in order to improve the dynamic adjustment capability and reliability of processing data frames, K can be the least common multiple of K1 and S2. At this time, M is equal to 119, and N is equal to 180.

[0082] It should be understood that the target period and the transmission period are only for differentiation in description. In actual application, the target period can also be referred to as a first period or a large transmission period, etc. The unit of the target period can be P frame, PB, byte, or OTN frame number, etc. For example, the target period can be M groups of PBs. Each group of PBs can also be referred to as a P frame. Therefore, the target period can be M P frames. For another example, each group of PBs includes RxC PBs. Therefore, the target period can be MxRxC PBs. For another example, each PB can include 192 bytes. Therefore, the target period can be MxRxCx192 bytes. For another example, the target period can be N OTN frames.

[0083] In Figure 5 , the P frame includes C1 groups of shared PBs. C1 is equal to 4. Each group of shared PBs can correspond to Figure 5 a column of shared PBs in Figure 5 . Each group of shared PBs includes R1 shared PBs. R1 is equal to 12. The P frame also includes C2 groups of exclusive PBs. The value of C2 is 6. Each group of exclusive PBs can correspond to Figure 5A column of exclusive PBs in a column of exclusive PBs. Multiple independent PBs within a column of exclusive PBs transmit data for the same service. Each exclusive PB transmits data for only one service. Shared PBs transmit multiple data for multiple services. It should be understood that the terms exclusive PB and shared PB are used for descriptive purposes only. In practical applications, an exclusive PB may also be referred to as a second PB, an independent PB, etc. A shared PB may also be referred to as a first PB, a collective PB, etc.

[0084] Figure 6 This is the first structural diagram of the exclusive PB and shared PB provided in the embodiment of this application. Figure 6 As shown, the exclusive PB 601 can be mapped from the OSU frame of a service. The size of the exclusive PB and the OSU frame is the same. When S1 is equal to 192, the size of the exclusive PB and the OSU frame is 192 bytes. The shared PB includes multiple data of multiple services. Therefore, the shared PB is divided into multiple sub-PBs. For example, in Figure 6 In the example, the shared PB 602 is divided into 12 sub-PBs. The serial numbers of the 12 sub-PBs are as follows: Figure 6 As shown, the 12 sub-PBs include sub-PBs 1 to 12. The size of the shared PB 602 is 192 bytes. The size of each sub-PB is 16 bytes.

[0085] An OTN device can allocate 12 sub-PBs to 12 different services. There is a one-to-one correspondence between the 12 sub-PBs and the 12 services. An OTN device can also allocate 12 sub-PBs to fewer than 12 services. For example, an OTN device allocates 12 sub-PBs to 10 services. One of the 10 services is allocated three sub-PBs. The other nine services are each allocated one sub-PB. The following description uses the example of an OTN device allocating 12 sub-PBs to 12 different services. It should be understood that in actual applications, some sub-PBs may remain unallocated. For example, an OTN device allocates 12 sub-PBs to 11 services. Each service is allocated a sub-PB, leaving one sub-PB unallocated.

[0086] In a shared PB, one service is only allocated to one sub-PB. The size of one sub-PB is 16 bytes. In the embodiment of the present application, it is assumed that the size of an OSU frame is 192 bytes. Therefore, the OTN device needs a group of shared PBs to transmit an OSU frame. A group of shared PBs includes R1 shared PBs. Figure 5 In the example, R1 is equal to 12. The OTN device splits an OSU frame into 12 data. The 12 data correspond to R1 sub-PBs in the R1 shared PB. Each sub-PB transmits 16 bytes of data. For example, Figure 7 The first structural diagram of the OSU frame mapped to the sub-PB provided in the embodiment of the present application. Figure 7As shown, an OSU frame is 192 bytes in size. The OTN device splits the OSU frame into 12 data elements. These 12 data elements correspond one-to-one with the 12 sub-PBs 1 in R1's shared PBs. Each of these R1 shared PBs includes a sub-PB 1. Similarly, the OTN device can split the OSU frame of another service into 12 data elements. These 12 data elements correspond one-to-one with the 12 sub-PBs 2 in R1's shared PBs.

[0087] When the OPUk type of the OTN frame is OPU0, Figure 5 In this example, the transmission rate of each dedicated PB is G1 = G ÷ C. G is approximately 1.23895431 Gbps. C is 10. In this case, G1 is approximately 123.895 Mbps. The latency of a dedicated PB is T1 = S1 ÷ G1. T1 is approximately 12.4 microseconds. The transmission rate of each data point in each shared PB is G2 = G ÷ (C × R). R is 12. In this case, G2 is approximately 10.3246 Mbps. The latency of each shared PB is also T1. The latency of each service in each shared PB is T2 = T1 × 12. T2 is approximately 149 microseconds. G1 is related to C. G2 is related to C and R. To accommodate services with significantly different transmission rates, G1 can be greater than 100 Mbps. G2 can be less than 11 Mbps. G2 is also called the transmission rate of each sub-PB.

[0088] The transmission rate of OPU1 is approximately twice that of OPU0. Therefore, when the OPUk type of an OTN frame is OPU1, the OTN device needs to transmit approximately 2 × N OTN frames within a target period. These 2 × N OTN frames include 2 × M sets of PBs. In this case, the OTN device can maintain two mapping relationships. One mapping relationship includes the mapping relationship between N OTN frames and M sets of PBs. Another mapping relationship includes the mapping relationship between another N OTN frames and another M sets of PBs. Similarly, when the OPUk type of an OTN frame is OPU2, OPU3, OPU4, or OPUflex, the OTN device can maintain more mapping relationships using similar methods. Table 2 shows examples of G1 and G2 for different OPUk types.

[0089]

[0090]

[0091] Table 2

[0092] exist Figure 5 In the example, C2 is equal to 6. Therefore, the OTN device can transmit 6 services running on G1 in one mapping relationship. C1 is equal to 4. Figure 6In the embodiment, each group of shared PBs can transmit 12 services running on G2. Therefore, in one mapping relationship, the OTN device can transmit 54 services. For OPU4, the OTN can maintain 84 mapping relationships. Therefore, the OTN device can transmit 54x84 services.

[0093] In the embodiment, the OTN device can map the PBs to the payload area of the OTN frame in the order from left to right and from top to bottom. For example, the OTN device first maps the PB in the first row and the first column to the start position of the payload area. Then, the OTN device maps the PB in the first row and the second column to the position after the start position. After mapping the PBs in the first row, the OTN device starts to map the PBs in the second row. Figure 5 Figure 5 In the embodiment, the first column of the P frame is the shared PB column. The first PB of the shared PB column can be used as the overhead PB. The overhead PB can carry some overhead contents. Therefore, in actual application, the first column of the P frame can always be used as the shared PB column.

[0094] In the embodiment, the first column of the P frame is the shared PB column. The first PB of the shared PB column can be used as the overhead PB. The overhead PB can carry some overhead contents. Therefore, in actual application, the first column of the P frame can always be used as the shared PB column. Figure 5 It should be understood that,

[0095] The above examples are only provided in the embodiments of the present application. In actual application, those skilled in the art can make adaptive modifications to the above examples according to requirements. For example, in the embodiment, the value of C1 can be 10. At this time, the P frame does not include the exclusive PB. For another example, in the embodiment, the OTN device divides one shared PB into 11 sub-PBs. The size of each sub-PB is 16 bytes. The remaining 16 bytes are used as the management field. For another example, in the embodiment, the OTN device splits one OSU frame into 24 data. 12 of the data correspond to 12 sub-PBs 1 of one group of shared PBs one by one. The remaining 12 data correspond to 12 sub-PBs 1 of another group of shared PBs one by one. Figure 5 to Figure 7 Figure 5 Figure 6 Figure 7

[0096] In the second example, R is 17. C is 7. S1 is 192. S2 is 4x3808. Figure 8 The second structural diagram of the P frame provided in the embodiments of the present application is shown in FIG. 8B. As shown in FIG. 8B, the P frame 801 includes 17x7 PBs. The 17x7 PBs are the transmission period of the OTN device. The size of each PB is 192 bytes. At this time, K1=RxCxS1=17x7x192=119x192. S2=4x3808=128x119. K=Mx119x192=Nx128x119. At this time, M can be an integer multiple of 2. N can be an integer multiple of 3. For example, when M is equal to 2, N is equal to 3. When M is equal to 4, N is equal to 6. Figure 8 ​​​​​​

[0097] exist Figure 8 In the P frame, there are C1 groups of shared PBs. C1 is equal to 3. Each group of shared PBs can correspond to Figure 8 A column of shared PBs in a P frame includes 17 PBs, that is, R is equal to 17. A column of PBs includes a group of shared PBs and X overhead PBs. X is an integer greater than 0. For example, in Figure 8 In , X is equal to 1. A set of shared PBs includes 16 shared PBs, that is, R1 is equal to 16. Figure 8 In the P frame, there are 3 overhead PBs. The 3 overhead PBs correspond to 3 groups of shared PBs. The overhead PB can be used to record the identifier of the service in a group of shared PBs corresponding to the overhead PB. The identifier of the service can be a multiplex structure identifier (MSI). The P frame also includes a C2 group exclusive PB. The value of C2 is 4. Each group exclusive PB can correspond to Figure 8 A column of exclusive PBs in a network consists of 17 exclusive PBs. Each exclusive PB transmits data for only one service. Each shared PB transmits multiple data for multiple services. Figure 9 This is a second structural diagram of the exclusive PB and shared PB provided in the embodiment of this application. Figure 9 As shown, the exclusive PB 901 can be mapped from the OSU frame of a service. The size of the exclusive PB and the OSU frame is the same. When S1 is equal to 192, the size of the exclusive PB and the OSU frame is 192 bytes. The shared PB includes multiple data of multiple services. Therefore, the shared PB is divided into multiple sub-PBs. For example, in Figure 9 In the example, the shared PB 902 is divided into 16 sub-PBs. The sequence numbers of the 16 sub-PBs are as follows: Figure 9 As shown, the 16 sub-PBs include sub-PBs 1 to 16. The size of the shared PB 902 is 192 bytes. The size of each sub-PB is 12 bytes.

[0098] OTN equipment can allocate 16 sub-PBs to 16 different services. 16 sub-PBs correspond to 16 services one by one. In this case, one service is only allocated to one sub-PB. The size of one sub-PB is 12 bytes. In the embodiment of the present application, it is assumed that the size of an OSU frame is 192 bytes. Therefore, the OTN equipment needs a group of shared PBs to transmit one OSU frame. A group of shared PBs includes R1 shared PBs. Figure 8 In the example, R1 is equal to 16. The OTN device splits an OSU frame into 16 data. The 16 data correspond to R1 shared PBs one by one. Each shared PB contains 12 bytes of data. For example, Figure 10 The second structural diagram of the OUS frame mapped to the sub-PB provided in the embodiment of the present application. Figure 10As shown, the size of one OSU frame is 192 bytes. The OTN device splits one OUS frame into 16 data. The 16 data and 16 sub-PB 1 in R1 shared PBs are one-to-one corresponding. Each shared PB in the R1 shared PBs includes one sub-PB 1. Similarly, the OTN device can also split the OSU frame of another service into 16 data. The 16 data and 16 sub-PB 2 in R1 shared PBs are one-to-one corresponding.

[0099] In actual application, the OTN device can take one sub-PB in the 16 sub-PBs as a management field. For example, Figure 11 A third structure diagram of the P frame is provided for the embodiments of the present application. As shown in Figure 11 Based on Figure 8 , the OTN device takes the first sub-PB of each shared PB as a management field. The first column of PBs in the P frame 801 is taken as an example for description. The first column of PBs includes 1 overhead PB and 16 shared PBs. The first PB in the first column of PBs is the overhead PB. The OTN device divides each PB in the 16 shared PBs into 16 sub-PBs. As shown in Figure 11 , the 16 sub-PBs of the first shared PB are 1-1, 1-2, 1-3, …, 1-16 respectively. The 16 sub-PBs of the second shared PB are 2-1, 2-2, 2-3, …, 2-16 respectively. By analogy, the 16 sub-PBs of the 16th shared PB are 16-1, 16-2, 16-3, …, 16-16 respectively. The size of each sub-PB is 12 bytes.

[0100] The OTN device takes the first sub-PB in each shared PB as a management field. The management field includes 1-1, 2-1, 3-1, …, 16-1. The OTN device can allocate the remaining 15 sub-PBs in each shared PB to different 15 services. Each service corresponds to one sub-PB. The size of each sub-PB is 12 bytes. Each service corresponds to one OSU frame. Among them, the 15 services correspond to 15 OSU frames. The 15 OSU frames are OSU frame 1, OSU frame 2, …, OSU frame 15 respectively. When the size of the OSU frame is 192 bytes, the OTN device needs 16 shared PBs to transmit one OSU frame. The data of the OSU frame 1 is transmitted through 16 sub-PBs. The 16 sub-PBs are 1-2, 2-2, 3-2, …, 16-2 respectively. The data of the OSU frame 2 is transmitted through 16 sub-PBs. The 16 sub-PBs are 1-3, 2-3, 3-3, …, 16-3 respectively. By analogy, the data of the OSU frame 15 is transmitted through 16 sub-PBs. The 16 sub-PBs are 1-16, 2-16, 3-16, …, 16-16 respectively.

[0101] In practical application, each OSU frame can carry open OSU overhead. For example, in Figure 10 , 1-2 can carry 7 bytes of open OSU overhead of OSU frame 1. 1-3 can carry 7 bytes of open OSU overhead of OSU frame 2. In the same way, 1-16 can carry 7 bytes of open OSU overhead of OSU frame 15.

[0102] When the OPUk type of the OTN frame is OPU0, in Figure 8 , the transmission rate of each dedicated PB is G1=G÷C. Wherein, G is approximately equal to 1.23895431 Gbps. C is equal to 7. At this time, G1 is approximately equal to 176.993 Mbps. The waiting delay of the dedicated PB is T1=S1÷G1. T1 is approximately equal to 8.7 microseconds. The transmission rate of each data in each shared PB is G2=G÷(C×R). R is equal to 17. At this time, G2 is approximately equal to 10.4114 Mbps. The delay of the service in each shared PB is T2=T1×17. T2 is approximately equal to 148 microseconds. The waiting delay of each shared PB is also T1.

[0103] In Figure 8 , C2 is equal to 4. Therefore, the OTN device can transmit 4 services running at G1 in one mapping relationship. C1 is equal to 3. In Figure 9 , each group of shared PBs can transmit 16 services running at G2. Therefore, the OTN device can transmit 52 services in one mapping relationship. When the OPUk type of the OTN frame is OPU1, OPU2, OPU3 or OPU4, the OTN device can improve the number of transmitted services through multiple mapping relationships. For example, for OPU4, the OTN device can maintain 84 mapping relationships. Therefore, the OTN device can transmit 52×84 services. Table three is an example of G1 and G2 when the OPUk type is different.

[0104]

[0105] Table three

[0106] In the above two examples, S2 is 4×3808. In Figure 3 , the size of the payload area of the OTN frame is 4×3808. In practical application, the OTN device can divide a part of the field in the payload area as an overhead field. For example, Figure 12 is a structure diagram of the payload area provided by the embodiment of the present application. As Figure 12 shown, the payload area includes an overhead field 1201 and a sub-payload area 1202. In one division mode, the size of the sub-payload area 1202 is S2=4×3808-64=15168. The overhead field includes 64 bytes.

[0107] In the third example, R is 12, C is 10, S1 is 192, S2 = 4 × 3808 - 64 = 15168 = 192 × 79. Figure 5 Similar. Figure 5 As shown, a P frame consists of 12×10 PBs. Each PB is 192 bytes. Here, K1 = R×C×S1 = 12×10×192 = 120×192. S2 = 192×79. K = M×120×192 = N×192×79. Here, M can be an integer multiple of 79. N can be an integer multiple of 120. For example, when M is 79, N is 129. When M is 158, N is 258.

[0108] For a description of exclusive PB and shared PB, please refer to Figure 6 and Figure 7 For details, see the relevant description in [1]. When the OPUk type of the OTN frame is OPU0, the transmission rate of each dedicated PB, G1, equals G ÷ C. After deducting the 64-byte overhead field, G is approximately 1.23374861962 Gbps. C is 10. At this point, G1 is approximately 123.375 Mbps. The latency of a dedicated PB, T1, equals S1 ÷ G1. T1 is approximately 12.4 microseconds. The transmission rate of each data point in each shared PB, G2, equals G ÷ (C × R). R is 12. At this point, G2 is approximately 10.2812 Mbps. The latency of each shared PB is also T1. The latency of services in each shared PB, T2, equals T1 × 12. T2 is approximately 149 microseconds.

[0109] In the fourth example, R is 8. C is 12. S1 is 192. S2 = 4 × 3808 - 64 = 15168 = 192 × 79. In this case, the P frame includes 8 × 12 PBs. Each PB is 192 bytes. K1 = R × C × S1 = 8 × 12 × 192 = 96 × 192. S2 = 192 × 79. K = M × 96 × 192 = N × 192 × 79. M can be an integer multiple of 79. N can be an integer multiple of 96. For example, when M is 79, N is 96. When M is 158, N is 192. The P frame can include C1 group shared PBs. C1 is an integer less than or equal to 12. Each group of shared PBs can include 8 shared PBs, meaning R1 is 8. The OTN device can divide the shared PB 6 into 8 sub-PBs. The size of a shared PB is 192 bytes. The size of each sub-PB is 24 bytes.

[0110] When the OPUk type of the OTN frame is OPU0, the transmission rate of each dedicated PB, G1, equals G ÷ C. After deducting the 64-byte overhead field, G is approximately 1.23374861962 Gbps. C is 12. In this case, G1 is approximately 102.812 Mbps. The latency of a dedicated PB, T1, equals S1 ÷ G1. T1 is approximately 14.9 microseconds. The transmission rate of each data point in each shared PB, G2, equals G ÷ (C × R). R is 8. In this case, G2 is approximately 12.8515 Mbps. The latency of each shared PB is also T1. The latency of services in each shared PB, T2, equals T1 × 8. T2 is approximately 120 microseconds.

[0111] In the fifth example, R is 8. C is 12. S1 is 192. S2 = 4 × 3808 = 128 × 119. In this case, the P frame includes 8 × 12 PBs. Each PB is 192 bytes. K1 = R × C × S1 = 8 × 12 × 192 = 96 × 192. S2 = 128 × 119. K = M × 96 × 192 = N × 128 × 119. M can be an integer multiple of 119. N can be an integer multiple of 144. The P frame can include C1 groups of shared PBs. C1 is an integer less than or equal to 12. Each group of shared PBs can include 8 shared PBs, meaning R1 is 8. The OTN device can divide the shared PBs into 8 sub-PBs. The size of a shared PB is 192 bytes. The size of each sub-PB is 24 bytes.

[0112] When the OPUk type of the OTN frame is OPU0, the transmission rate of each dedicated PB, G1, equals G ÷ C. G is approximately 1.23895431 Gbps. C is 12. In this case, G1 is approximately 103.246 Mbps. The latency of a dedicated PB, T1, equals S1 ÷ G1. T1 is approximately 14.9 microseconds. The transmission rate of each data point in each shared PB, G2, equals G ÷ (C × R). R is 8. In this case, G2 is approximately 12.9508 Mbps. The latency of each shared PB is also T1. The latency of services in each shared PB, T2, equals T1 × 8. T2 is approximately 119 microseconds.

[0113] In the previous example, S1 is equal to 192. In actual applications, S1 can also be other values. The following examples illustrate this.

[0114] In the sixth example, R is 10. C is 12. S1 is 240. S2 = 4 × 3808 = 128 × 119. In this case, the P frame includes 10 × 12 PBs. Each PB is 240 bytes. K1 = R × C × S1 = 10 × 12 × 240 = 120 × 240. S2 = 128 × 119. K = M × 120 × 240 = N × 128 × 119. M can be an integer multiple of 119. N can be an integer multiple of 225. The P frame can include C1 groups of shared PBs. C1 is an integer less than or equal to 12. Each group of shared PBs can include 10 shared PBs, meaning R1 is 10. The OTN device can divide the shared PBs into 10 sub-PBs. The size of a shared PB is 240 bytes. The size of each sub-PB is 24 bytes.

[0115] When the OPUk type of the OTN frame is OPU0, the transmission rate of each dedicated PB, G1, equals G ÷ C. G is approximately 1.23895431 Gbps. C is 12. In this case, G1 is approximately 103.246 Mbps. The latency of a dedicated PB, T1, equals S1 ÷ G1. T1 is approximately 18.6 microseconds. The transmission rate of each data point in each shared PB, G2, equals G ÷ (C × R). R is 10. In this case, G2 is approximately 12.3246 Mbps. The latency of each shared PB is also T1. The latency of services in each shared PB, T2, equals T1 × 10. T2 is approximately 186 microseconds.

[0116] In the seventh example, R is 8. C is 12. S1 is 128. S2 = 4 × 3808 = 128 × 119. In this case, the P frame includes 8 × 12 PBs. The size of each PB, S1, is 128 bytes. K1 = R × C × S1 = 8 × 12 × 128 = 96 × 128. S2 = 128 × 119. K = M × 96 × 128 = N × 128 × 119. M can be an integer multiple of 119. N can be an integer multiple of 96. The P frame can include C1 groups of shared PBs. C1 is an integer less than or equal to 12. Each group of shared PBs can include 8 shared PBs, meaning R1 is 8. The OTN device can divide the shared PBs into 8 sub-PBs. The size of a shared PB is 128 bytes. The size of each sub-PB is 16 bytes.

[0117] When the OPUk type of the OTN frame is OPU0, the transmission rate of each dedicated PB, G1, equals G ÷ C. G is approximately 1.23895431 Gbps. C is 12. In this case, G1 is approximately 103.246 Mbps. The latency of a dedicated PB, T1, equals S1 ÷ G1. T1 is approximately 9.9 microseconds. The transmission rate of each data point in each shared PB, G2, equals G ÷ (C × R). R is 8. In this case, G2 is approximately 12.9058 Mbps. The latency of each shared PB is also T1. The latency of services in each shared PB, T2, equals T1 × 8. T2 is approximately 79 microseconds.

[0118] In the eighth example, R is 10. C is 12. S1 is 240. S2 = 4 × 3808 - 64 = 15168 = 192 × 79. In this case, the P frame includes 10 × 12 PBs. Each PB is 240 bytes. K1 = R × C × S1 = 10 × 12 × 240 = 120 × 240. S2 = 192 × 79. K = M × 120 × 240 = N × 192 × 79. M can be an integer multiple of 79. N can be an integer multiple of 150. The P frame can include C1 group shared PBs. C1 is an integer less than or equal to 12. Each group of shared PBs can include 10 shared PBs, meaning R1 is 10. The OTN device can divide the shared PB into 10 sub-PBs. The size of a shared PB is 240 bytes. The size of each sub-PB is 24 bytes.

[0119] When the OPUk type of the OTN frame is OPU0, the transmission rate of each dedicated PB, G1, equals G ÷ C. After deducting the 64-byte overhead field, G is approximately 1.23374861962 Gbps. C is 12. In this case, G1 is approximately 102.812 Mbps. The latency of a dedicated PB, T1, equals S1 ÷ G1. T1 is approximately 18.7 microseconds. The transmission rate of each data point in each shared PB, G2, equals G ÷ (C × R). R is 10. In this case, G2 is approximately 10.2812 Mbps. The latency of each shared PB is also T1. The latency of services in each shared PB, T2, equals T1 × 10. T2 is approximately 187 microseconds.

[0120] In the ninth example, R is 8. C is 12. S1 is 128. S2 = 4 × 3808 - 64 = 15168 = 192 × 79. In this case, the P frame includes 8 × 12 PBs. Each PB is 128 bytes. K1 = R × C × S1 = 8 × 12 × 128 = 96 × 128. S2 = 192 × 79. K = M × 96 × 128 = N × 192 × 79. M can be an integer multiple of 79. N can be an integer multiple of 64. The P frame can include C1 group shared PBs. C1 is an integer less than or equal to 12. Each group of shared PBs can include 8 shared PBs, meaning R1 is 8. The OTN device can divide the shared PB into 8 sub-PBs. The size of a shared PB is 128 bytes. The size of each sub-PB is 16 bytes.

[0121] When the OPUk type of the OTN frame is OPU0, the transmission rate of each dedicated PB, G1, equals G ÷ C. After deducting the 64-byte overhead field, G is approximately 1.23374861962 Gbps. C is 12. At this point, G1 is approximately 102.812 Mbps. The latency of a dedicated PB, T1, equals SI ÷ G1. T1 is approximately 10 microseconds. The transmission rate of each data point in each shared PB, G2, equals G ÷ (C × R). R is 8. At this point, G2 is approximately 12.8515 Mbps. The latency of each shared PB is also T1. The latency of services in each shared PB, T2, equals T1 × 8. T2 is approximately 80 microseconds.

[0122] In one of the previous examples, R is equal to 17 and C is equal to 7. In practical applications, when C remains unchanged, R can be an integer multiple of 17. For example, R can be 34, or 68, etc. These are described below.

[0123] In the tenth example, R is 34, C is 7, and S1 is 192. S2 = 4 × 3808 = 128 × 119. In this case, the P frame includes 34 × 7 PBs. Each PB is 192 bytes in size. K1 = R × C × S1 = 34 × 7 × 192 = 238 × 192. S2 = 128 × 119. K = M × 238 × 192 = N × 128 × 119. M can be an integer multiple of 1. N can be an integer multiple of 3. The P frame can include C1 groups of shared PBs. C1 is an integer less than or equal to 7. Each group of shared PBs can include 32 shared PBs, meaning R1 is 32. The OTN device can divide the shared PBs into 32 sub-PBs. The size of a shared PB is 192 bytes. Each sub-PB is 6 bytes in size. Each column of PBs in the P frame includes 34 PBs. A column of shared PBs includes 32 PBs. A column of PBs consists of 32 PBs and two overhead PBs. The P frame also includes C2 group exclusive PBs. Each group of exclusive PBs may include 34 exclusive PBs.

[0124] When the OPUk type of the OTN frame is OPU0, the transmission rate of each dedicated PB is G1 = G ÷ C. G is approximately equal to 1.23895431 Gbps. C is equal to 7. At this time, G1 is approximately equal to 176.993 Mbps. The waiting delay of the dedicated PB is T1 = S1 ÷ G1. T1 is approximately equal to 8.7 microseconds. The transmission rate of each data in each shared PB is G2 = G ÷ (C x R). R is equal to 34. At this time, G2 is approximately equal to 5.2 Mbps. The waiting delay of each shared PB is also T1. The delay of the service in each shared PB is T2 = T1 x 34. T2 is approximately equal to 295 microseconds.

[0125] In an eleventh example, R is 68. C is 7. S1 is 192. S2 = 4 x 3808 = 128 x 119. At this time, the P frame includes 68 x 7 PBs. The size of each PB is 192 bytes. K1 = R x C x S1 = 68 x 7 x 192 = 476 x 192. S2 = 128 x 119. K = M x 476 x 192 = N x 128 x 119. M can be an integer multiple of 1. N can be an integer multiple of 6. The P frame can include C1 groups of shared PBs. C1 is an integer less than or equal to 7. Each group of shared PBs can include 64 shared PBs, i.e., R1 is equal to 64. The OTN device can divide the shared PBs into 64 sub-PBs. The size of the shared PB is 192 bytes. The size of each sub-PB is 3 bytes. Each column of PBs of the P frame includes 68 PBs. One column of shared PBs includes 64 PBs. The 64 PBs and 4 overhead PBs make up one column of PBs. The P frame also includes C2 groups of dedicated PBs. Each group of dedicated PBs can include 68 dedicated PBs.

[0126] When the OPUk type of the OTN frame is OPU0, the transmission rate of each dedicated PB is G1 = G ÷ C. G is approximately equal to 1.23895431 Gbps. C is equal to 7. At this time, G1 is approximately equal to 176.993 Mbps. The waiting delay of the dedicated PB is T1 = S1 ÷ G1. T1 is approximately equal to 8.7 microseconds. The transmission rate of each data in each shared PB is G2 = G ÷ (C x R). R is equal to 68. At this time, G2 is approximately equal to 2.6 Mbps. The waiting delay of each shared PB is also T1. The delay of the service in each shared PB is T2 = T1 x 68. T2 is approximately equal to 590 microseconds.

[0127] In the foregoing examples, the size of each sub-PB in the shared PB is S = S1 ÷ R. S can be 3, 6, 12, 16, or 24 (bytes). In actual applications, the value of S can be equal to 8 (bytes). Several examples provided below are described.

[0128] In the twelfth example, R is 24. C is 10. S1 is 192. S2 = 4 × 3808 = 128 × 119. In this case, the P frame includes 24 × 10 PBs. Each PB is 192 bytes in size. K1 = R × C × S1 = 24 × 10 × 192 = 240 × 192. S2 = 128 × 119. K = M × 240 × 192 = N × 128 × 119. M can be an integer multiple of 119. N can be an integer multiple of 360. The P frame can include C1 groups of shared PBs. C1 is an integer less than or equal to 10. Each group of shared PBs can include 24 shared PBs, meaning R1 is 24. The OTN device can divide the shared PBs into 24 sub-PBs. The size of a shared PB is 192 bytes. The size of each sub-PB is 8 bytes.

[0129] When the OPUk type of the OTN frame is OPU0, the transmission rate of each dedicated PB, G1, equals G ÷ C. G is approximately 1.23895431 Gbps. C is 10. In this case, G1 is approximately 123.895431 Mbps. The latency of a dedicated PB, T1, equals S1 ÷ G1 (the unit of S1 needs to be converted to bits). T1 is approximately 12.4 microseconds. The transmission rate of each data point in each shared PB, G2, equals G ÷ (C × R). R is 24. In this case, G2 is approximately 5.1623 Mbps. The latency of each shared PB is also T1. The latency of services in each shared PB, T2, equals T1 × 24. T2 is approximately 297.6 microseconds.

[0130] In the thirteenth example, R is 24. C is 12. S1 is 192. S2 = 4 × 3808 = 128 × 119. In this case, the P frame includes 24 × 12 PBs. Each PB is 192 bytes in size. K1 = R × C × S1 = 24 × 10 × 192 = 288 × 192. S2 = 128 × 119. K = M × 288 × 192 = N × 128 × 119. M can be an integer multiple of 119. N can be an integer multiple of 432. The P frame can include C1 groups of shared PBs. C1 is an integer less than or equal to 12. Each group of shared PBs can include 24 shared PBs, meaning R1 is 24. The OTN device can divide the shared PBs into 24 sub-PBs. The size of a shared PB is 192 bytes. The size of each sub-PB is 8 bytes.

[0131] When the OPUk type of the OTN frame is OPUO, the transmission rate G1 of each dedicated PB is G ÷ C. Wherein, G is approximately equal to 1.23895431 Gbps. C is equal to 12. At this time, G1 is approximately equal to 103.246 Mbps. The waiting delay T1 of the dedicated PB is S1 ÷ G1. T1 is approximately equal to 14.88 microseconds. The transmission rate G2 of each data in each shared PB is G ÷ (C × R). R is equal to 24. At this time, G2 is approximately equal to 4.3 Mbps. The waiting delay of each shared PB is also T1. The transmission rate of OPU1 is approximately equal to 2 times of that of OPUO. Therefore, when the OPUk type of the OTN frame is OPU1, the OTN device needs to transmit approximately 2 × N OTN frames in one target period. The 2 × N OTN frames include 2 × M groups of PBs. At this time, the OTN device can maintain 2 mapping relationships. One mapping relationship includes the mapping relationship between N OTN frames and M groups of PBs. The other mapping relationship includes the mapping relationship between the other N OTN frames and the other M groups of PBs. Similarly, when the OPUk type of the OTN frame is OPU2, OPU3, OPU4, the OTN device can maintain more mapping relationships according to similar methods. Table four is an example of G1 and G2 when different OPUk types. Wherein, for the same OPUk type, the OTN device can maintain different numbers of mapping relationships, thereby controlling the transmission rate of each mapping relationship. For example, in table four, when the OPUk type of the OTN frame is OPU4, the OTN device can maintain 80, 83 or 84 mapping relationships.

[0132]

[0133] Table four

[0134] In the fourteenth example, R is 30. C is 12. S1 is 240. S2 = 4 × 3808 = 128 × 119. At this time, the P frame includes 30 × 12 PBs. The size of each PB is 240 bytes. K1 = R × C × S1 = 30 × 12 × 240 = 360 × 240. S2 = 128 × 119. K = M × 360 × 240 = N × 128 × 119. M can be an integer multiple of 119. N can be an integer multiple of 675. The P frame can include C1 groups of shared PBs. C1 is an integer less than or equal to 12. Each group of shared PBs can include 30 shared PBs, that is, R1 is equal to 30. The OTN device can divide the shared PBs into 30 sub-PBs. The size of the shared PB is 240 bytes. The size of each sub-PB is 8 bytes.

[0135] When the OPUk type of the OTN frame is OPU0, the transmission rate of each dedicated PB is G1=G÷C. Wherein, G is approximately equal to 1.23895431Gbps. C is equal to 12. At this time, G1is approximately equal to 103.246Mbps. The waiting delay of the dedicated PB is T1=S1÷G1. T1is approximately equal to 18.6 microseconds. The transmission rate of each data in each shared PB is G2=G÷(C×R). R is equal to 30. At this time, G2is approximately equal to 3.44Mbps. The waiting delay of each shared PB is also T1.

[0136] According to the foregoing example, each group of PBs can include dedicated PBs and shared PBs. Therefore, the OTN device can also add a shared identifier in the N OTN frames. The shared identifier is used to mark C1 groups of shared PBs in each group of PBs. Similarly, the OTN device can also add a dedicated identifier in the N OTN frames. The dedicated identifier is used to mark C2 groups of dedicated PBs in each group of PBs. The shared identifier and / or the dedicated identifier can be located in the overhead field or the overhead PB in the foregoing.

[0137] According to the foregoing example, in the P frame, a group of shared PBs can form a column of PBs with X overhead PBs. For example, in the thirteenth example in the foregoing, a group of shared PBs (16 shared PBs) and 1 overhead PB form a column of PBs. Figure 8 In actual applications, the column where the independent PBs are located can also have an overhead PB. In one of the ways, the total number of overhead PBs in the P frame is equal to X×C. For example, in the fourteenth example in the foregoing, the P frame includes 4 groups of independent PBs. Each group of independent PBs corresponds to a column of PBs. A column of PBs includes 17 PBs. The 17 PBs include 16 independent PBs and 1 overhead PB. At this time, the P frame includes 7 overhead PBs. Figure 8 In actual applications, the M groups of PBs can include P1 groups of PBs and P2 groups of PBs. P1 and P2 are integers greater than 0. The sum of P1 and P2 is equal to M. Each group of PBs in the P2 groups of PBs includes C2 groups of dedicated PBs and C1 shared PBs. Each group of PBs in the P1 groups of PBs includes C3 groups of overhead PBs, C4 groups of dedicated PBs, and C1 groups of shared PBs. This is described separately as follows.

[0138] Each group of PBs in the P2 groups of PBs includes C2 groups of dedicated PBs and C1 groups of shared PBs. The sum of C1 and C2 is equal to C. Each group of dedicated PBs includes R dedicated PBs. This is described by taking the example in the thirteenth example in the foregoing as an example. Figure 13 The fourth structural diagram of the P frame provided by the embodiment of the application is shown in FIG. 14. As shown in FIG. 14, the P frame includes M groups of PBs. Each group of PBs includes C groups of PBs. Each group of PBs includes C1 groups of shared PBs and C2 groups of dedicated PBs. The sum of C1 and C2 is equal to C. Each group of dedicated PBs includes R dedicated PBs. Figure 13As shown, the P frame 1301 includes 24 rows x 12 columns of PBs (in the figure, not all PBs are shown), and includes 24 x 12 PBs in total. The 24 x 12 PBs are a transmission period of the OTN device. The size of each PB is 192 bytes. At this time, K1 = R x C x S1 = 24 x 12 x 192 = 288 x 192. S2 = 4 x 3808 = 128 x 119. K = M x 288 x 192 = N x 128 x 119. At this time, M can be an integer multiple of 119. N can be an integer multiple of 432.

[0139] The P frame includes C1 groups of shared PBs. In Figure 13 , C1 is equal to 6. Each group of shared PBs can correspond to Figure 13 one column of shared PBs. One column of PBs of the P frame includes 24 PBs, i.e., R is equal to 24. The P frame also includes C2 groups of exclusive PBs. In Figure 13 , C2 is equal to 6. Each group of exclusive PBs can correspond to Figure 13 one column of exclusive PBs. One column of exclusive PBs includes 24 exclusive PBs. Each exclusive PB transmits data of only one service. Each group of exclusive PBs is used to carry data belonging to the same service. Each shared PB transmits data of multiple services. Each shared PB has a size of 192 bytes. Each shared PB includes 24 sub-PBs. Each sub-PB has a size of 8 bytes. In actual applications, the OTN device can take one or more of the 24 sub-PBs as a management field. For example, in Figure 13 , the OTN device takes the first sub-PB of each shared PB as a management field. The following describes an example of the seventh column of PBs in the P frame 1301. The seventh column of PBs includes 24 shared PBs. The OTN device divides each of the 24 shared PBs into 24 sub-PBs. As shown in Figure 13 , the 24 sub-PBs of the first shared PB are 1-1, 1-2, 1-3, …, 1-24 respectively. The 24 sub-PBs of the second shared PB are 2-1, 2-2, 2-3, …, 2-24 respectively. By analogy, the 24 sub-PBs of the 24th shared PB are 24-1, 24-2, 24-3, …, 24-24 respectively.

[0140] The OTN device takes the first sub-PB in each shared PB as a management field. For example, as shown in Figure 13As shown, 1-1, 2-1, 3-1, …, 24-1 are management fields. The OTN device can allocate the remaining 23 sub-PBs in each shared PB to 23 different services. Each service corresponds to a sub-PB. The size of each sub-PB is 8 bytes. Each service corresponds to an OSU frame. Of these, 23 services correspond to 23 OSU frames. The 23 OSU frames are OSU frame 1, OSU frame 2, …, OSU frame 23, respectively. When the size of an OSU frame is 192 bytes, the OTN device needs 24 shared PBs to transmit an OSU frame. OSU frame 1 is transmitted through 24 sub-PBs. The 24 sub-PBs are 1-2, 2-2, 3-2, …, 24-2, respectively. OSU frame 2 is transmitted through 24 sub-PBs. The 24 sub-PBs are 1-3, 2-3, 3-3, …, 24-3, respectively. By analogy, OSU frame 23 is transmitted through 24 sub-PBs. The 24 sub-PBs are 1-24, 2-24, 3-24, …, 24-24, respectively.

[0141] In actual applications, each OSU frame can carry the overhead of the OSU frame. For example, in Figure 14 , 7 bytes of overhead of OSU frame 1 can be carried in sub-PB 1-2. 7 bytes of overhead of OSU frame 2 can be carried in sub-PB 1-3. By analogy, 7 bytes of overhead of OSU frame 23 can be carried in sub-PB 1-24.

[0142] Each group of PBs in the P1 group of PBs includes a C3 group of overhead PBs, a C4 group of exclusive PBs, and a C1 group of shared PBs. C3 and C4 are integers greater than 0. The sum of C3, C4, and C1 is equal to C. Figure 14 A structure diagram of a P frame provided by an embodiment of the present application is shown. As shown in Figure 13 , the P frame 1401 includes 1 group of overhead PBs, 6 groups of exclusive PBs, and 5 groups of shared PBs. At this time, C3 is equal to 1, C4 is equal to 6, and C1 is equal to 5. For descriptions of the exclusive PBs and the shared PBs, reference can be made to the related descriptions in Figure 14 . The 1 group of overhead PBs includes 24 overhead PBs, one or more of which can be used to transmit related information of a plurality of service data. Specifically, the related information can be MSI and / or other overhead of the plurality of service data. The other overhead can be management information, control information, or position information of the next overhead PB column, etc. of the service stream. The shared PBs and the exclusive PBs of the M group of PBs are used to transmit the plurality of service data.

[0143] It should be understood that Figure 6This is just one example of the C3 group overhead PB provided in this application. In practical applications, other P frames provided in embodiments of this application may also include the C3 group overhead PB. For example, when R is 12, C is 10, and C1 is 6, C3 can be equal to 1 and C4 can be equal to 5.

[0144] In practical applications, within M groups of PBs, the number of overhead PB columns can be between 0.1% and 10% of the total number of PB columns. The number of overhead PB columns, T, is equal to the product of P1 and C3. The total number of PB columns is equal to the product of M and C. In practical applications, each overhead PB column can be set at a fixed position in the P frame structure and / or be specially identified.

[0145] In the example of the P frame provided in this application, the P frame includes a PB of R rows and C columns. It should be understood that in actual applications, the P frame has other forms of expression. For example, the P frame includes a PB of R columns and C rows. At this time, the OTN device can map the PB in the P frame to the payload area of ​​the OTN frame in a top-to-bottom and left-to-right order. For another example, the P frame includes a PB of 1 row and R×C columns. The OTN device can map the PB in the P frame to the payload area of ​​the OTN frame in a left-to-right order. In the aforementioned Figure 15 In the example, the OTN device divides the entire shared PB into 12 sub-PBs. The 12 sub-PBs are used to transmit service data. In actual applications, the OTN device can divide the shared PB into a management field and multiple sub-PBs. For example, Figure 15 This is a schematic diagram of the structure of the shared PB provided in the embodiment of this application. Figure 6 As shown, the OTN device divides the shared PB1501 into 1 management field and 11 sub-PBs. 1 management field is used to indicate OH. The size of the management field can be the same as the size of 1 sub-PB. For example, when the size of the shared PB is 192 bytes, the size of 1 sub-PB is 16 bytes. The size of the management field is 16 bytes. Figure 13 In , a shared PB can transmit data of up to 12 services, and a group of shared PBs can transmit up to 12 OSU frames. Figure 16 In the IEEE 802.11 specification, a shared PB can transmit data for up to 11 services, and a group of shared PBs can transmit up to 11 OSU frames. The management field can be used for operations, administration, and maintenance (OAM). OAM can include tandem connection monitoring (TCM).

[0146] According to the foregoing description, the OTN device can perform periodic data frame processing with N OTN frames as a target period. Therefore, for each target period, the OTN device can sort N OTN frames. Each of the N OTN frames can carry a sequence identifier. The sequence identifier is used to identify the sorting of each OTN frame in the target period. The sequence identifier can be located in the aforementioned overhead field or overhead PB.

[0147] In order to save transmission resources, the sequence identifier can be an OPU multi-frame indicator (OMFI). For example, the transmission rate of OPU4 is approximately equal to 84 OPU0. Therefore, in the OTN frame of OPU4, the OMFI can gradually change from 1, 2, 3, …, 84. It is assumed that N in the embodiments of the present application is equal to 3. The OTN device changes the value of the OMFI to gradually change from 1 to 252. The remainder obtained by dividing the value of the OMFI by 3 is used as the sequence identifier. For example, when the OMFI is equal to 4, it indicates that the current OTN frame is the first OTN frame in the target period. For another example, when the OMFI is equal to 9, it indicates that the current OTN frame is the third OTN frame in the target period. The integer obtained by dividing the value of the OMFI by 3 plus 1 is used as the original OMFI. For example, when the OMFI is equal to 4, the integer obtained by dividing the value of the OMFI by 3 is 1. For another example, when the OMFI is equal to 9, the integer obtained by dividing the value of the OMFI by 3 is 3.

[0148] The OTN device can process data according to the foregoing data frame processing method to obtain N data frames. The OTN device can send the N data frames to a receiving device. The receiving device can be another OTN device or a client. The receiving device can map the N data frames to a plurality of service frames by using the data frame processing method. Figure 16 A second flowchart of the data frame processing method provided by the embodiments of the present application is shown in FIG. 16. As shown in FIG. 16, the data frame processing method includes the following steps. Figure 3 to Figure 14

[0149] In step 1601, the receiving device obtains N data frames. The payload area of the N data frames includes M groups of PBs. M and N are integers greater than 0. Each group of PBs includes R×C PBs. R and C are integers greater than 1. The size of each PB is S1 bytes. The size of each payload area in the N OPU frames occupied by the PBs is S2 bytes. M×R×C×S1=N×S2. Each group of PBs includes C1 groups of shared PBs. C1 is a positive integer less than or equal to C. Each group of shared PBs includes R1 shared PBs. R1 is a positive integer less than or equal to R. Each of the R1 shared PBs includes a plurality of data of a plurality of services. The number of the plurality of data is greater than 1. The number of the plurality of data is less than or equal to R. For the description of the N data frames and the M groups of PBs, reference can be made to the foregoing description.​Figure 5 to Figure 7 For the convenience of description, the following will be Figure 6 Taking the P frame as an example, the processing method of the data frame is described.

[0150] In step 1602, the receiving device maps M groups of PBs in the payload area of ​​N data frames into multiple service frames;

[0151] Multiple service frames can be multiple OSU frames. Figure 6 In , the size of PB and OSU frames is 192 bytes. Figure 17 In a P frame, each independent PB carries data for the same service. Each independent PB in each PB corresponds to an OSU frame. Therefore, when the OTN equipment allocates six independent PBs to six independent services, the receiving device can obtain six OSU frames for the six services through the independent PBs in a P frame. There is a one-to-one correspondence between the six services and the six OSU frames. Each service corresponds to 12 OSU frames. A P frame includes four shared PBs. Each shared PB carries 12 OSU frames for 12 services. There is a one-to-one correspondence between the 12 services and the 12 OSU frames. The data of each OSU frame is evenly distributed among the 12 shared PBs. A shared PB consists of 12 sub-PBs. Each sub-PB carries a data item. The size of a data item is 16 bytes. Therefore, through a set of shared PBs, the receiving device can obtain 12 x 12 data items. The receiving device combines the 12 x 12 data items to obtain 12 OSU frames for the 12 services. Through four groups of shared PBs, the receiving device can obtain 48 OSU frames for 48 services.

[0152] Therefore, through one P frame, the receiving device can obtain 72 OSU frames for six independent services. The receiving device can also obtain 48 OSU frames for 48 shared services. A target period includes M P frames. Therefore, through M P frames, the receiving device can obtain 72 × M OSU frames for six independent services. Each independent service consists of 12 × M OSU frames. The receiving device can also obtain 48 × M OSU frames for 48 shared services. Each shared service consists of M OSU frames.

[0153] The foregoing describes a method for processing data frames provided in an embodiment of the present application. The following describes a device for processing data frames provided in an embodiment of the present application.

[0154] Figure 17 The present invention provides a schematic diagram of a data frame processing device. Figure 4As shown, the data frame processing device 1700 includes a processor 1701 and a transceiver 1702. The data frame processing device 1700 can be the aforementioned OTN device and receiving device. When the data frame processing device 1700 is an OTN device, the processor 1701 is used to execute Figure 4 Specifically, the processing device 1700 can complete the above-mentioned steps by means of hardware integrated logic circuits or software instructions in the processor 1701. Figure 16 The method steps in the embodiment of the present invention are as follows. The processor 1701 is configured to send N data frames to the transceiver 1702. The transceiver 1702 is configured to send N data frames to the receiving device. When the data frame processing device 1700 receives the device, the transceiver 1702 is configured to receive N data frames from the OTN device. The processor 1701 is configured to execute Figure 16 Specifically, the processing device 1700 can complete the above-mentioned steps by means of hardware integrated logic circuits or software instructions in the processor 1701. Figure 4 The method steps in .

[0155] In other embodiments, the processing device 1700 may further include a memory 1703. The memory 1703 may be a non-volatile memory, such as a hard disk drive (HDD), or a volatile memory, such as a random-access memory (RAM). The memory 1703 is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.

[0156] The memory 1703 can be used to store N data frames or multiple service frames. The memory 1703 can also be used to store instructions so that the processing 1701 can be used to perform the above Figure 15 or Figure 2 Alternatively, the storage 1703 may also be used to store other instructions to configure the parameters of the processor 1701 to implement corresponding functions.

[0157] It should be understood that the processor 1701 and the memory 1703 are Figure 17 In the network device hardware structure diagram, the processors may be located on a branch board or on a single board that combines branches and circuits. Alternatively, the network device includes multiple processors 1701 and multiple memories 1703. The multiple processors 1701 are located on the branch board. The multiple memories 1703 are located on the circuit board. The branch board and circuit board work together to complete the aforementioned method steps.

[0158] It should be understood that Figure 1The apparatus described can also be used to perform the method steps mentioned in the above-mentioned embodiments or alternatives shown in the figures, which will not be described again here.

[0159] The processor 1701 in the embodiments of the present application can be a general 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, a discrete hardware component, and can implement or execute the disclosed methods, steps and logic block diagrams in the embodiments of the present application. The general processor can be a microprocessor or any conventional processor. The steps of the method disclosed in combination with the embodiments of the present application can be directly embodied as hardware processor execution or executed by a combination of hardware and software units in the processor.

[0160] The program code for implementing the above-mentioned method executed by the processor 1701 can be stored in the memory 1703. The memory 1703 and the processor 1701 are coupled. The coupling in the embodiments of the present application is an indirect coupling or communication connection between the devices, units or modules, which can be electrical, mechanical or other forms, for information interaction between the devices, units or modules. The processor 1701 can operate in cooperation with the memory 1703.

[0161] Based on the above embodiments, the embodiments of the present application also provide a computer readable storage medium. The storage medium stores a software program, which when read and executed by one or more processors can implement the method provided by any one or more of the above embodiments. The computer readable storage medium can include a U disk, a mobile hard disk, a read-only memory, a random access memory, a magnetic disk or an optical disk, and various media that can store program codes.

[0162] Based on the above embodiments, the embodiments of the present application also provide a chip. The chip includes a processor for implementing the functions involved in any one or more of the above embodiments, such as acquiring or processing the service frames or data frames involved in the above methods. Alternatively, the chip also includes a memory for executing necessary program instructions and data for the processor. The chip can be composed of a chip, or can include a chip and other discrete devices.

[0163] The present application is described with reference to the flowcharts and / or block diagrams according to the methods, devices (systems) and computer program products of the embodiments of the present application. It should be understood that each flow and / or block in the flowcharts and / or block diagrams, and the combination of the flows and / or blocks in the flowcharts and / or block diagrams can be implemented by computer program instructions. These computer program instructions can be provided to the processor of a general purpose computer, a special purpose computer, an embedded processor or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device produce a device for implementing the functions described in the flowcharts and / or block diagrams. The computer program instructions can also be stored in a computer readable storage medium that can guide the computer or other programmable data processing device to work.Figure 1 apparatuses that implement the functions specified in the flowchart Figure 1 block or blocks.

[0164] These computer program instructions can 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 instructions which implement the Figure 1 apparatuses that implement the functions specified in the flowchart Figure 1 block or blocks.

[0165] These computer program instructions can 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 that execute on the computer or other programmable apparatus provide steps for implementing the Figure 1 apparatuses that implement the functions specified in the flowchart ​ block or blocks.

[0166] Obviously, persons having ordinary skill in the art can be able to make various modifications and variations to the embodiments of the present application without departing from the scope of the present application. Thus, it is intended that the present application cover the modifications and variations of this application provided they come within the scope of the appended claims and their equivalents.

Claims

1. A method for processing a data frame, characterized in that: include: Get multiple business data; Mapping the plurality of service data into a plurality of service frames respectively; The multiple service frames are mapped to M groups of payload blocks PB in the payload area of ​​N data frames, wherein M and N are integers greater than 0, each group of PBs includes R×C PBs, R×C represents the number of rows×the number of columns, R and C are integers greater than 1, wherein the size of each PB is S1 bytes, the size of each payload area in the N data frames occupied by PB is S2 bytes, M×R×C×S1=N×S2; each group of PBs includes C1 groups of shared PBs, C1 is a positive integer less than or equal to C, each group of shared PBs includes R1 shared PBs, R1 is a positive integer less than or equal to R, each shared PB in the R1 shared PBs is used to carry data of multiple services, and the number of the multiple services is less than or equal to R.

2. The method according to claim 1, characterized in that Each group of PBs also includes a C2 group of exclusive PBs, the sum of C1 and C2 is equal to C, and each group of exclusive PBs includes R exclusive PBs, and the R exclusive PBs belong to data of the same service.

3. The method according to claim 1, characterized in that The M groups of PBs include a P1 group of PBs and a P2 group of PBs, P1 and P2 are integers greater than 0, and the sum of P1 and P2 is equal to M; Each group of PBs in the P1 group of PBs includes a C3 group overhead PB, a C4 group exclusive PB, and the C1 group shared PB. Each group of exclusive PBs in the C4 group of exclusive PBs includes R exclusive PBs, and each group of exclusive PBs is used to carry data belonging to the same service. Each group of overhead PBs in the C3 group of overhead PBs includes R overhead PBs, and the R overhead PBs are used to carry relevant information of the multiple service data. C3 and C4 are integers greater than 0, and the sum of C3, C4, and C1 is equal to C. Each group of PBs in the P2 group of PBs also includes a C2 group of exclusive PBs, the sum of the C1 and the C2 is equal to the C, and each group of exclusive PBs includes R exclusive PBs.

4. The method according to claim 3, characterized in that T=(P1×C3)÷(M×C), where the value range of T is between 0.001 and 0.

1.

5. The method according to any one of claims 2 to 4, characterized in that The transmission rate of each of the plurality of business data is less than 11 megabits per second Mbps; and / or, The transmission rate of each of the R exclusive PBs is greater than 100 Mbps.

6. The method according to any one of claims 1 to 4, characterized in that K=M×R×C×S1, K1=R×C×S1, where K is the least common multiple of K1 and S2.

7. The method according to any one of claims 1 to 4, characterized in that The N data frames include a sharing identifier, and the sharing identifier is used to mark the C1 group shared PB.

8. The method according to any one of claims 1 to 4, characterized in that The N data frames are optical transport network (OTN) frames, S2 is 4×3808, R1 is equal to R, R is 12, and C is 10.

9. The method according to claim 8, characterized in that The size S1 of each PB is 192, M is 119, and N is 180.

10. The method according to any one of claims 1 to 4, characterized in that The R is an integer multiple of 17, and the C is 7.

11. The method according to claim 10, characterized in that The R is 17, the size S1 of each PB is 192, the M is 2, and the N is 3.

12. The method according to claim 10, characterized in that The R is 34, the size S1 of each PB is 192, the M is 1, and the N is 3.

13. The method according to claim 10, characterized in that The R is 68, the size S1 of each PB is 192, the M is 1, and the N is 6.

14. The method according to any one of claims 1 to 4, characterized in that The N data frames are OTN frames, the size of each payload area is 4×3808 bytes, S2 is 15168, and each payload area also includes a 64-byte overhead field.

15. The method according to claim 14, characterized in that The R1 is equal to the R, the R is 12, and the C is 10.

16. The method according to claim 15, characterized in that The size S1 of each PB is 192, M is 79, and N is 120.

17. The method according to claim 14, characterized in that The overhead field includes identifiers of the multiple services.

18. The method according to any one of claims 1 to 4, characterized in that S=S1÷R, where S is equal to 8.

19. The method according to claim 18, characterized in that The S2 is 4×3808, the S1 is equal to 192, the R1 is equal to R, the R is 24, and the C is 12.

20. The method according to claim 18, wherein The S2 is 4×3808, the S1 is equal to 192, the R1 is equal to R, the R is 24, and the C is 10.

21. The method according to claim 18, wherein The S2 is 4×3808, the S1 is equal to 240, the R1 is equal to the R, the R is 30, and the C is 12.

22. The method according to any one of claims 1 to 4, characterized in that The difference between R1 and R is X, and each group of shared PBs also includes X overhead PBs, where X is an integer greater than 0.

23. The method according to any one of claims 1 to 4, characterized in that Each of the R1 shared PBs further includes a management field, which is used for operation, management and maintenance (OAM).

24. The method according to claim 23, wherein In each shared PB, the size of the management field is the same as the size of each data of the plurality of services.

25. A data frame processing device, characterized in that: Includes a processor and a transceiver, including: The processor is configured to execute the method according to any one of claims 1 to 24 to obtain N data frames; The transceiver is used to send the N data frames.

Images