Method, device and electronic equipment for processing services in an optical transport network

Abstract

The embodiment of the present disclosure provides a service processing method in an optical transport network, comprising: mapping a customer service into a service container; and mapping the service container into a data frame, wherein the data frame comprises payload units, each of the payload units is composed of a unit block with a fixed length, and the unit block is used for carrying the service container. The embodiment of the present disclosure also provides a service processing device in an optical transport network, an electronic device and a computer readable medium.

Description

Technical Field

[0001] This disclosure relates to the field of optical communication technology, and in particular to a service processing method, processing apparatus, electronic device, and computer-readable medium in an optical transport network. Background Technology

[0002] In the existing definition of Optical Transport Network (OTN), the method for loading multiple service signals into the payload of the optical transport network signal is as follows: First, the region of the optical transport network signal is divided into n time slots, and the time slots are implemented by byte interleaving; then, the service signals are loaded into one or more time slots in the payload of the optical transport network signal.

[0003] According to the existing optical transport network standard G.709, the smallest time slot granularity of the existing OTN technology is 1.25Gbps. When carrying services with bandwidths lower than 1.25Gbps, such as Ethernet (Fast Ethernet, FE) services, Synchronous Transfer Module-1 (STM-1) services, and E1 services, the bandwidth waste of the optical transport network is very serious. For example, the bandwidth of an E1 signal is 2.048Mbps, but when it is loaded into a time slot with a bandwidth of 1.25Gbps, the bandwidth waste is as high as 99% or more. Therefore, a transmission technology is needed to achieve a method for efficiently carrying small-granularity services in OTN. Summary of the Invention

[0004] This disclosure provides a service processing method, processing apparatus, electronic device, and computer-readable medium in an optical transport network.

[0005] In a first aspect, embodiments of this disclosure provide a service processing method in an optical transport network, comprising:

[0006] Map customer business logic to a business container;

[0007] The service container is mapped to a data frame, the data frame including a payload unit, each payload unit consisting of a unit block of fixed length, the unit block being used to carry the service container.

[0008] In some embodiments, the unit block is divided into a first type of unit block and a second type of unit block. The first type of unit block includes a payload portion, and the second type of unit block includes a payload portion and an overhead portion. The payload portion is used to carry service data, and the overhead portion includes the identification information of the service container.

[0009] For any one of the said payload units, the payload unit is composed of unit blocks of the same type.

[0010] In some embodiments, it also includes:

[0011] Configuration information is constructed for each payload unit, including: the type of unit block occupied by the payload unit, the number of the payload unit, and the number of unit blocks occupied by the payload unit;

[0012] The configuration information is carried in the unit block of the data frame.

[0013] In some embodiments, the service container is divided into a first type of service container, a second type of service container, and a third type of service container;

[0014] The first type of service container is a service container that carries fixed bit rate services that require clock pass-through.

[0015] The second type of service container is a service container for fixed bit rate services that do not require clock pass-through;

[0016] The third type of service container is a service container that carries variable bit rate services;

[0017] The first type of service container is carried in the first type of unit block, and the second type of service container and the second type of service container are carried in the second type of unit block.

[0018] In some embodiments, all first type service containers are divided into at least one first type service container group, all second type service containers are divided into at least one second type service container group, and all third type service containers are divided into at least one third type service container group. Each first type service container group includes at least one first type service container, each second type service container group includes at least one second type service container, and each third type service container group includes at least one third type service container.

[0019] Each of the first type of service container group, the second type of service container group, and the third type of service container group corresponds to a different payload unit.

[0020] In some embodiments, the step of mapping the service container to a data frame includes:

[0021] Sort all the first type of service container groups, the second type of service container groups, and the third type of service container groups to obtain a processing sequence;

[0022] According to the order in the processing sequence, each of the first type of service container group, the second type of service container group, and the third type of service container group is mapped to the unit block of the data frame in sequence.

[0023] In some embodiments, the step of sorting all the first type of service container groups, the second type of service container groups, and the third type of service container groups to obtain a processing sequence includes:

[0024] Based on the total bandwidth of the services carried by each of the first type of service container groups, all the first type of service container groups are sorted in descending order of total bandwidth to obtain a first sequence;

[0025] Based on the total bandwidth of the services carried by each of the second type of service container groups, all the second type of service container groups are sorted in descending order of total bandwidth to obtain the second sequence;

[0026] Based on the maximum allocated bandwidth of each of the third type of service container groups, all the third type of service container groups are sorted in descending order of maximum allocated bandwidth to obtain the third sequence;

[0027] The second sequence is appended to the end of the first sequence, and the third sequence is appended to the end of the second sequence to obtain the processed sequence;

[0028] Alternatively, based on the total bandwidth of the services carried by each of the first type of service container groups, the total bandwidth of the services carried by each of the second type of service container groups, and the maximum allocated bandwidth of each of the third type of service container groups, all the first type of service container groups, the second type of service container groups, and the third type of service container groups are sorted in descending order of bandwidth.

[0029] In some embodiments, the step of sorting all the first type of service container groups, the second type of service container groups, and the third type of service container groups to obtain a processing sequence includes:

[0030] Determine the latency priority of each of the first type of service container group, the second type of service container group, and the third type of service container group;

[0031] The first type of service container group, the second type of service container group, and the third type of service container group are sorted in descending order of latency priority to obtain the processing sequence.

[0032] In some embodiments, the configuration information is configured with verification information, which is used to verify each piece of configuration information individually or to verify all configuration information as a whole.

[0033] In some embodiments, the service container includes an ODU frame or an OSU frame.

[0034] Secondly, embodiments of this disclosure also provide a service processing method in an optical transport network, comprising:

[0035] Acquire a data frame, the data frame including a payload unit, each payload unit being composed of a unit block of fixed length, the unit block being used to carry the service container, the service container carrying customer services;

[0036] The service container is demapped from the unit block of the data frame;

[0037] The customer service is obtained from the service container.

[0038] In some embodiments, the step of demapping the service container from the cell block of the data frame includes:

[0039] Obtain configuration information from the payload area. The configuration information includes: the cell block type of the cell block occupied by the payload unit, the number of the payload unit, and the number of cell blocks occupied by the payload unit.

[0040] The location of the payload unit carrying the service container is determined based on the configuration information;

[0041] The service container is demapped from the cell blocks within the defined payload unit.

[0042] In some embodiments, the configuration information includes verification information;

[0043] Before the step of determining the location of the payload unit carrying customer services based on the configuration information, the method further includes:

[0044] Each configuration information is individually verified based on the verification information, or all configuration information is verified as a whole.

[0045] Once the verification passes, the step of determining the location of the payload unit carrying the service container based on the configuration information continues.

[0046] In some embodiments, when the verification fails, the configuration information of the previous successful verification is obtained, and the location of the payload unit carrying the service container is determined based on the configuration information of the previous successful verification.

[0047] Thirdly, embodiments of this disclosure also provide a service processing apparatus in an optical transport network, comprising:

[0048] The first mapping module is used to map customer business to the business container;

[0049] The second mapping module is used to map the service container to a data frame. The data frame includes a payload unit, and each payload unit is composed of a unit block with a fixed length. The unit block is used to carry the service container.

[0050] Fourthly, embodiments of this disclosure also provide a service processing apparatus in an optical transport network, comprising:

[0051] The first acquisition module is used to acquire data frames, the data frames including payload units, each payload unit being composed of a unit block with a fixed length, the unit block being used to carry the service container, the service container carrying customer services;

[0052] A demapping module is used to demap the service container from the unit block of the data frame;

[0053] The second acquisition module is used to acquire the customer service from the service container.

[0054] Fifthly, embodiments of this disclosure also provide an electronic device, including:

[0055] One or more processors;

[0056] A memory having stored one or more programs that, when executed by one or more processors, cause the one or more processors to implement the business processing methods provided in the first and second aspects.

[0057] In a sixth aspect, embodiments of this disclosure also provide a computer-readable medium having a computer program stored thereon, which, when executed by a processor, implements the business processing methods provided in the first and second aspects.

[0058] The technical solution provided in this disclosure can solve the problem of serious bandwidth waste caused by transmitting optical transmission services by dividing the payload area into time slots in the prior art, thereby improving the bandwidth utilization of the optical transmission network. Attached Figure Description

[0059] Figure 1 This is a schematic diagram of the optical path frame structure involved in the embodiments of this disclosure;

[0060] Figure 2 A schematic diagram showing that the payload area of ​​the optical path frame structure in the optical transmission standard of related technologies is divided into 4 time slots;

[0061] Figure 3 A flowchart of a service processing method in an optical transport network provided in this disclosure embodiment;

[0062] Figure 4This is a schematic diagram illustrating the division of OTUk frames into unit blocks in an embodiment of this disclosure;

[0063] Figure 5 This is a schematic diagram of a first type of unit block and a second type of unit block in an embodiment of this disclosure;

[0064] Figure 6 A flowchart of another service processing method in an optical transport network provided as an embodiment of this disclosure;

[0065] Figure 7 This is a schematic diagram of the configuration information in one embodiment of the present disclosure;

[0066] Figure 8 This is a flowchart illustrating a specific implementation of step S102 in this embodiment of the present disclosure;

[0067] Figure 9 This is a flowchart illustrating a specific implementation of step S1022 in this embodiment of the present disclosure;

[0068] Figure 10 A flowchart of yet another service processing method in an optical transport network provided in this disclosure embodiment;

[0069] Figure 11 This is a flowchart illustrating a specific implementation of step S202 in this embodiment of the present disclosure;

[0070] Figure 12 This is a flowchart illustrating another specific implementation of step S202 in this embodiment of the present disclosure;

[0071] Figure 13 This is a schematic diagram of dividing the payload area of ​​the ODU0 frame into 16-byte unit blocks in an embodiment of this disclosure;

[0072] Figure 14 This is a schematic diagram of another structure of the first type of unit block and the second type of unit block in the embodiments of this disclosure;

[0073] Figure 15 This is another schematic diagram of the configuration information structure in an embodiment of this disclosure;

[0074] Figure 16 A structural block diagram of a service processing device in an optical transport network provided in this disclosure embodiment;

[0075] Figure 17 A structural block diagram of another service processing device in an optical transport network provided in this disclosure embodiment;

[0076] Figure 18 This is a structural block diagram of an electronic device provided in an embodiment of the present disclosure. Detailed Implementation

[0077] To enable those skilled in the art to better understand the technical solution of the present invention, the following detailed description is provided in conjunction with the accompanying drawings of a service processing method, processing device, electronic device, and computer-readable medium in an optical transport network provided by the present invention.

[0078] Exemplary embodiments will be described more fully below with reference to the accompanying drawings; however, these exemplary embodiments may be embodied in different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will enable those skilled in the art to fully understand the scope of this disclosure.

[0079] Where there is no conflict, the various embodiments of this disclosure and the features thereof in the embodiments may be combined with each other.

[0080] As used herein, the term “and / or” includes any and all combinations of one or more related enumerated entries.

[0081] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit this disclosure. As used herein, the singular forms “a” and “the” are also intended to include the plural forms unless the context clearly indicates otherwise. It will also be understood that when the terms “comprising” and / or “made of” are used in this specification, the presence of the stated feature, integral, step, operation, element, and / or component is specified, but the presence or addition of one or more other features, integrals, steps, operations, elements, components, and / or groups thereof is not excluded.

[0082] Unless otherwise specified, all terms used herein (including technical and scientific terms) have the same meaning as commonly understood by one of ordinary skill in the art. It will also be understood that terms such as those defined in commonly used dictionaries should be interpreted as having a meaning consistent with their meaning in the context of the relevant art and this disclosure, and will not be interpreted as having an idealized or overly formal meaning, unless expressly so defined herein.

[0083] Figure 1 This is a schematic diagram of the optical path frame structure involved in the embodiments of this disclosure, such as... Figure 1As shown in the embodiments of this disclosure, the optical transport network signal is described using the Optical Channel Transport Unit (OTU) signal as an example. The OTU signal is composed of OTUk frames, including an overhead region and a payload region. The overhead region includes: the overhead of the optical channel transport unit (denoted as "OTUk overhead", k can take values ​​of 1, 2, 3, 4), the overhead of the optical channel data unit (ODU) (denoted as "ODUk overhead", k can take values ​​of 0, 1, 2, 2e, 3, 4), and the overhead of the optical channel payload unit (OPU) (denoted as "OPUk overhead", k can take values ​​of 0, 1, 2, 2e, 3, 4). The part remaining after removing the OTUk overhead from the OTUk frame is called the ODUk frame, the part remaining after removing the ODUk overhead from the ODUk frame is called the OPUk frame, and the part remaining after removing the OPUk overhead from the OPUk frame is called the OPUk payload (i.e., the payload region of the optical channel frame structure). The payload area can be used to carry service signals.

[0084] Figure 2 A schematic diagram illustrating the division of the payload region of the optical path frame structure into four time slots in related technologies' optical transmission standards, as shown below. Figure 2 As shown, in the existing definition of optical transport networks, the method for loading multiple service signals into the optical transport network signal payload is to divide the optical transport network signal payload into n time slots, and then load the service signals into one or more time slots in the optical transport network signal payload. The time slots are implemented by byte interleaving. Taking the division of the OTUk payload area into 4 time slots as an example, the following description is provided. An OTUk frame consists of a 4-row, 3824-column byte block. The area corresponding to column numbers from 1 to 16 is the overhead area (not shown), and the area corresponding to column numbers from 17 to 3824 is the payload area. Figure 2 A small square in the image represents one byte. The OPUk payload area of ​​an OPUk frame consists of 4 * 3808 bytes, arranged as shown in the image. Figure 2 The diagram shows 4 rows and 3808 columns. Figure 2 This indicates that the OPUk payload is divided into 4 time slots using byte interleaving. Specifically, in a total of 3808 columns, starting from column 17, adjacent four bytes are grouped together, and each group of four bytes is assigned to four different time slots: TS1, TS2, TS3, and TS4. In other words, the four consecutive bytes starting from column 17 represent four time slots. Thus, all 4*3808 bytes in the OPUk payload are divided into four time slots, named TS1, TS2, TS3, and TS4. One ODU service can be carried in m time slots (m is less than the maximum number of time slots n in the OPUk payload). Figure 2 (n=4).

[0085] According to the existing optical transport network standard G.709, the smallest ODUk in an optical transport network is ODU0, with a rate of 1.25G. Theoretically, the OPUk payload in all OTUk frames should be divided into time slots with a granularity of 1.25G to efficiently accommodate ODU0. However, for some low-bandwidth services, such as FE, STM-1, and E1 services, directly carrying them using time slots would result in significant bandwidth waste.

[0086] To address the aforementioned technical problems, this disclosure proposes corresponding solutions, which will be described exemplarily below with reference to the accompanying drawings.

[0087] Figure 3 A flowchart of a service processing method in an optical transport network provided in this disclosure embodiment is shown below. Figure 3 As shown, the service processing method in this optical transport network is applied to the transmitting side and includes:

[0088] Step S101: Map the customer business to the business container.

[0089] In this embodiment, customer service specifically refers to services that are small-granularity services relative to optical transport frames. Specifically, the ratio of the bandwidth of the customer service to the bandwidth of the payload area of ​​the optical transport frame is less than a preset percentage, the specific value of which is set by industry professionals. Generally, this preset percentage is less than or equal to 10%. In this embodiment, it is only necessary to ensure that the bandwidth of the customer service is less than the bandwidth of the payload area of ​​the optical transport frame.

[0090] In this embodiment, the service container includes an ODU frame or an Optical Service Unit (OSU) frame. The process of mapping customer services to the service container is conventional technology in the art and will not be described in detail here.

[0091] Step S102: Map the service container to the data frame. The data frame includes payload units, each of which consists of a unit block with a fixed length. The unit block is used to carry the service container.

[0092] Each unit block can carry data from at most one business container.

[0093] In this embodiment of the disclosure, the OTN frame may be an ODU frame or a FlexO frame; the data frame consists of the payload area of ​​the ODU frame or the payload area of ​​the FlexO frame.

[0094] Figure 4 This is a schematic diagram illustrating the division of OTUk frames into unit blocks in an embodiment of this disclosure, as shown below. Figure 4As shown, taking the division of the payload area of ​​one OTUk frame into unit blocks as an example, the payload area of ​​the OTUk frame can be divided into multiple unit blocks with fixed lengths; where a unit block refers to a continuous block that occupies a fixed number (greater than 1) of bits, and the unit block is used to carry the service container (which can also be regarded as carrying customer services).

[0095] Figure 5 This is a schematic diagram of a first type of unit block and a second type of unit block in an embodiment of this disclosure, as shown below. Figure 5 As shown, unit blocks can be divided into two types: Type 1 unit blocks and Type 2 unit blocks, both of which have the same length. Type 1 unit blocks include a payload portion, while Type 2 unit blocks include a payload portion and an overhead portion. The lengths of the payload portion and the overhead portion can be set according to actual needs. The payload portion is used to carry business data, and the overhead portion includes the identification information of the business container. For any given payload unit, that payload unit consists of unit blocks of the same type.

[0096] The identification information of the service container is used to identify the service container carried by the unit block.

[0097] In practical applications, each customer service is assigned a corresponding Tributary Port Number (TPN), and the corresponding customer service can be identified based on the TPN. Based on the above, in some embodiments, the TPN of the customer service carried by the service container can be used as the identification information of that service container.

[0098] Of course, the identification information of the business container in this disclosure can also take the form of a different form, as long as the identification information can be used to distinguish different business containers.

[0099] In some embodiments, the overhead portion may further include verification information for verifying the identification information, so as to ensure the reliability of the identification information in the overhead portion.

[0100] It should be noted that, in the embodiments disclosed herein, the number of the first type of unit block and the second type of unit block in each frame can be flexibly adjusted according to the type of customer service and bandwidth carried, and is not a fixed value.

[0101] For ease of description, it is assumed that division is performed using unit blocks with a fixed length of K; if the payload area can be exactly divided into an integer number of unit blocks, the number of divided unit blocks is N, and at this time, the bandwidth corresponding to each unit block is Q / N, where Q is the bandwidth of the entire payload area; if the payload area cannot be exactly divided into an integer number of unit blocks, division is performed according to the maximum divisible number of unit blocks (assuming the number of divided unit blocks is N), the remaining data in the payload area is padded, and the padding may be located at the end of the frame or distributed in the middle of the frame. At this time, the bandwidth of each unit block is K*Q / (N*K+F), where F is the number of padding bits in the payload area, F<K, and N*K+F is the total number of bits in the payload area.

[0102] In the embodiments of the present disclosure, if a data frame is divided into N unit blocks, the maximum number of payload units divided in the data frame is N, and the maximum number of services that can be transmitted by the data frame is N (in this case, each payload unit includes only 1 unit block). The bandwidth of each unit block can also be very small, which can improve bandwidth utilization. For the value of the unit block size K, it should not be too large. An excessively large value means that a large number of service bits need to be buffered, resulting in increased delay; nor should it be too small. Since the second type of unit block includes an overhead part, the overhead part occupies some bits. If the value of K is too small, it means that the overhead part accounts for an excessively large proportion in the unit block, the payload part for transmitting customer service data accounts for a relatively small proportion, and the data transmission efficiency is low. In practical applications, the K value can be set and adjusted according to actual needs.

[0103] The technical solutions of the present disclosure can solve the problem of serious bandwidth waste caused by transmitting optical transmission services by dividing the payload area into time slots in the prior art, and achieve the effect of improving the bandwidth utilization of the optical transport network.

[0104] Figure 6 is a flowchart of another service processing method in an optical transport network provided by an embodiment of the present disclosure, as Figure 6 shown, the service processing method in the optical transport network is applied to the sending side, and includes:

[0105] Step S101: Mapping a customer service into a service container.

[0106] Step S102: Mapping the service container into a data frame, where the data frame includes payload units, each payload unit is composed of unit blocks with a fixed length, and the unit blocks are used to carry the service container.

[0107] Step S102a: Constructing configuration information for each payload unit.

[0108] Figure 7 is a schematic structural diagram of the configuration information in an embodiment of the present disclosure, as Figure 7As shown, the configuration information includes: the cell block type occupied by the payload unit, the number of the payload unit, and the number of cell blocks occupied by the payload unit.

[0109] In some embodiments, the block type of the first type of block is represented by "1", and the block type of the second type of block is represented by "0"; that is, the information representing the block type in each configuration message occupies only 1 bit.

[0110] The payload unit number is used in conjunction with the unit block type. The combination of "payload unit number" and "unit block type" distinguishes different payload units. Furthermore, the combination of "payload unit number" and "unit block type" indicates the position of the corresponding payload unit in the subsequent "processing sequence." Details will be described later.

[0111] In some embodiments, the configuration information includes verification information, which is used to verify each configuration information individually or to perform an overall verification of all configuration information. As an optional implementation, the configuration information is subjected to Cyclic Redundancy Check (CRC) or Forward Error Correction (FEC) verification based on the verification information to ensure the reliability of the configuration information.

[0112] Step S102b: Carry the configuration information in the unit block of the data frame.

[0113] Within a data frame, a fixed number of unit blocks can be pre-defined to carry "configuration information". For example, five unit blocks can be set to carry configuration information.

[0114] In step S102b, the distribution of the unit blocks used to carry configuration information is determined based on the sigma-delta algorithm according to the preset number (e.g., 5) of unit blocks used to carry configuration information; then, all configuration information is carried into the determined unit blocks. It should be noted that when the number of payload units is small, the amount of configuration information will also be small, and the actual number of unit blocks carrying this configuration information may be less than the preset number.

[0115] Of course, in the disclosed embodiments, the location of the cell block carrying the attribute configuration information can also be determined based on other methods; for example, the sender and receiver may agree in advance to use one or more fixed cell blocks in the payload area as the carrying configuration information.

[0116] In this embodiment of the disclosure, it is only necessary to ensure that steps S102a and S102b are executed after step S101. For example, steps S102a and S102b are executed interleaved with step S102, or steps S102a and S102b are executed after step S102.

[0117] In some embodiments, the service container is divided into a first type of service container, a second type of service container, and a third type of service container; the first type of service container is a service container that carries fixed bit rate services that require clock pass-through; the second type of service container is a service container that carries fixed bit rate services that do not require clock pass-through; the third type of service container is a service container that carries variable bit rate services; the first type of service container is carried in a first type of unit block, and the second type of service container and the second type of service container are carried in a second type of unit block.

[0118] In some embodiments, all first-type service containers are divided into at least one first-type service container group, all second-type service containers are divided into at least one second-type service container group, and all third-type service containers are divided into at least one third-type service container group. Each first-type service container group includes at least one first-type service container, each second-type service container group includes at least one second-type service container, and each third-type service container group includes at least one third-type service container.

[0119] Each of the first type of service container group, the second type of service container group, and the third type of service container group corresponds to a different payload unit.

[0120] When dividing multiple first / second / third type business containers into at least one first / second / third type business container group, the specific division rules are not limited; for example, all first / second / third type business containers are divided into 1 first / second / third type business container group; or, for a certain type of business container, all business containers of that type are divided equally into multiple business container groups; or, for a certain type of business container, all business containers of that type are divided into multiple business container groups containing a different number of business containers.

[0121] In this embodiment of the disclosure, the number of second / third type service containers included in each second / third type service container group does not exceed a preset maximum number of services that can be accommodated. The maximum number of services that can be accommodated can be set by configuring the size of the bits used to represent identification information within the overhead portion of the second type unit block; for example, if the size of the bits used to represent identification information within the overhead portion occupies 'a' bits, then the identification information can have a maximum of 2... a The maximum number of second / third type service containers that a second / third type service container group can accommodate is 2.a For example, if 'a' is 4, then the maximum number of second / third type service containers that the second / third type service container group can accommodate is 2. 4 =16.

[0122] Figure 8 This is a flowchart illustrating a specific implementation of step S102 in this embodiment of the present disclosure, as follows: Figure 8 As shown, in some embodiments, step S102 includes:

[0123] Step S1021: Sort all first-type service container groups, second-type service container groups and third-type service container groups to obtain the processing sequence.

[0124] The technical solution disclosed herein does not limit the rules used for sorting; that is, random sorting or non-random sorting can be used.

[0125] In some embodiments, sorting can be based on "bandwidth" size.

[0126] As an optional implementation scheme, firstly, based on the total bandwidth of the services carried by each type of service container group, all type-1 service container groups are sorted in descending order of total bandwidth to obtain a first sequence; then, based on the total bandwidth of the services carried by each type of service container group, all type-2 service container groups are sorted in descending order of total bandwidth to obtain a second sequence; next, based on the maximum allocated bandwidth of each type-3 service container group, all type-3 service container groups are sorted in descending order of maximum allocated bandwidth to obtain a third sequence; finally, the second sequence is connected to the end of the first sequence, and the third sequence is connected to the end of the second sequence to obtain a processing sequence (referred to as "sorting method 1").

[0127] As another optional implementation, based on the total bandwidth of the services carried by each first type of service container group, the total bandwidth of the services carried by each second type of service container group, and the maximum allocated bandwidth of each third type of service container group, all first type of service container groups, second type of service container groups, and third type of service container groups are sorted in descending order of bandwidth to obtain a processing sequence.

[0128] In some embodiments, the ordering can be based on "latency priority". Specifically, a latency priority can be assigned to a service container group based on the latency requirements of each customer service carried within it. For example, if the customer services carried in a service container group have high latency requirements (i.e., require very low latency during transmission), then a higher latency priority can be assigned to that service container group; conversely, if the customer services carried in a service container group have low latency requirements (i.e., allow for high latency during transmission), then a lower latency priority can be assigned to that service container group. The allocation of service container groups can be done manually or automatically by the OTN device based on certain rules (a pre-set allocation algorithm). This disclosure does not limit the specific algorithm used to allocate latency priorities to service container groups.

[0129] When sorting, firstly, the latency priority of each type 1 service container group, type 2 service container group, and type 3 service container group is determined; then, all type 1 service container groups, type 2 service container groups, and type 3 service container groups are sorted in descending order of latency priority to obtain the processing sequence.

[0130] After obtaining the processing sequence, the number of each payload unit is assigned according to the result of the processing sequence and the unit block type occupied by the payload unit corresponding to each service container group. The specific assignment rules are not limited here (they can be negotiated in advance by the sender and the receiver). It is only necessary to ensure that the receiver can restore the processing sequence based on the combination of "payload unit number" and "unit block type" recorded in all configuration information during subsequent demapping.

[0131] Step S1022: According to the order in the processing sequence, map each of the first type of service container group, the second type of service container group, and the third type of service container group to the unit block of the data frame in sequence.

[0132] Figure 9 This is a flowchart illustrating a specific implementation of step S1022 in this embodiment of the present disclosure, as follows: Figure 9 As shown, in some embodiments, step S1022 includes:

[0133] Step S10221: For each type of service container group, calculate the number of unit blocks required by each type of service container in the first type of service container group based on the bandwidth of the service carried by each type of service container in the first type of service container group and the bandwidth of the unit block. Then, sum the number of unit blocks required by all type of service containers in the first type of service container group to obtain the number of unit blocks required by the first type of service container group.

[0134] Based on the preceding information, given a fixed number of unit blocks N, a unit block size K, a payload area size, and a payload area bandwidth Q, the bandwidth of each unit block can be determined. For the first type of service container, the bandwidth of the first type of service container is divided by the bandwidth of the unit block. If the result is an integer, it represents the number of unit blocks required by the first type of service container. If the result is not an integer, it is rounded up to obtain the total number of unit blocks required by the first type of service container.

[0135] Step S10222: For each second type of service container group, calculate the number of unit blocks required by each second type of service container in the second type of service container group based on the bandwidth of the service carried by each second type of service container in the second type of service container group and the bandwidth of the unit block. Then, sum up the number of unit blocks required by all second type of service containers in the second type of service container group to obtain the number of unit blocks required by the second type of service container group.

[0136] The method for calculating the number of unit blocks required by the second type of business container is the same as the method for calculating the number of unit blocks required by the first type of business container, and will not be repeated here.

[0137] Step S10223: For each third type of service container group, determine the maximum allocated bandwidth to the third type of service container group based on the bandwidth of the services carried by each third type of service container in the third type of service container group, and calculate the number of unit blocks required by the third type of service container group based on the maximum allocated bandwidth and the bandwidth of the unit block.

[0138] Within a third-type service container group, the customer services carried are variable-rate services, thus these customer services can share bandwidth. For a given third-type service container group, based on the maximum bandwidth (also known as peak bandwidth) of each variable bit-rate service carried within that third-type service container group, a maximum allocated bandwidth can be allocated to that third-type service container group using a preset algorithm. It should be noted that the technical solution disclosed herein does not limit the specific algorithm for determining the "maximum allocated bandwidth," only requiring that the maximum allocated bandwidth allocated to the third-type service container group is greater than or equal to the peak bandwidth of the variable bit-rate service with the largest peak bandwidth within the third-type service container group, and less than or equal to the sum of the peak bandwidths of all variable bit-rate services within the third-type service container group.

[0139] For the third type of service container group, divide the maximum allocated bandwidth of the third type of service container group by the bandwidth of the unit block; if the calculation result is an integer, the calculation result is the number of unit blocks required by the third type of service container group; if the calculation result is not an integer, the calculation result is rounded up to obtain the number of unit blocks required by the third type of service container group.

[0140] It should be noted that when there is no fixed bit rate service that requires clock pass-through in the customer service, there is no first type of service container group, and step S10221 can be omitted; when there is no fixed bit rate service that does not require clock pass-through in the customer service, there is no second type of service container group, and step S10222 can be omitted; when there is no variable bit rate service in the customer service, there is no third type of service container group, and step S10223 can be omitted.

[0141] Step S10224: Based on the number of unit blocks required by each first type of service container group, second type of service container group and third type of service container, map each first type of service container group, second type of service container group and third type of service container group to the unit blocks of the data frame in sequence according to the order in the processing sequence.

[0142] When mapping according to the processing sequence, only one type of service container group, one type of service container group, and one type of service container group are processed at a time. The step of mapping a service container group to a unit block of an optical transport frame includes: first, determining the location distribution of the unit blocks occupied by the type of service container group, based on the number of unit blocks required by the type of service container group, using the sigma-delta algorithm; then, carrying the type of service container group, based on the type of service container group, into the determined unit blocks.

[0143] In this embodiment, the sigma-delta algorithm can evenly distribute the required number of unit blocks (obtained through steps S10221-S10223) of a certain service container group into the free unit blocks (unallocated unit blocks) within the data frame. Therefore, given a fixed number of unit blocks occupied by a certain service container group, if the position of the service container group in the processing sequence changes between two frames, the position of the unit blocks occupied by the service container group in those two frames will also change. The specific calculation process of the sigma-delta algorithm is conventional technology in this field and will not be described in detail here.

[0144] It should be noted that when the location of the unit block occupied by the configuration information and the number of unit blocks required by each service container group are both calculated using the sigma-delta algorithm, to ensure that the receiving side can obtain all the configuration information first, the location of the unit block occupied by the configuration information should first be calculated using the sigma-delta algorithm. Then, based on the processing sequence, the number of unit blocks required by each service container group should be calculated using the sigma-delta algorithm. This allows the receiving side to accurately determine the unit blocks used to carry the configuration information from the data frame based on the "preset number" used to carry the configuration information and the sigma-delta algorithm. When the unit block occupied by the configuration information is one or more fixed-position unit blocks pre-negotiated by the sender and receiver, the order of the mapping steps for the configuration information and the mapping steps for the service container groups is not limited.

[0145] The above steps S101, S102a, S102b and S102 are all executed by the transmitting node (an OTN device). After completing the processing of the above steps S101 and S102, the transmitting node will send an optical transport network frame containing an ODU frame or a FlexO frame to the receiving node (that is, realize the transmission of data frames) to realize the transmission of customer services.

[0146] The receiving node receives optical transport frames containing ODU frames or FlexO frames (i.e., it receives data frames), demaps the service container from the unit blocks divided by the data frame, and obtains the corresponding customer service data from the service container.

[0147] Figure 10 A flowchart of another service processing method in an optical transport network provided in this disclosure embodiment is shown below. Figure 10 As shown, the service processing method in this optical transport network is applied to the receiving side and includes:

[0148] Step S201: Obtain a data frame. The data frame includes a payload unit. Each payload unit consists of a unit block with a fixed length. The unit block is used to carry a business container, which carries customer business.

[0149] Step S202: Demap the service container from the cell block of the data frame.

[0150] Figure 11 This is a flowchart illustrating a specific implementation of step S202 in this embodiment of the present disclosure, as follows: Figure 11 As shown, step S202 includes:

[0151] Step S2021a: Obtain configuration information from the payload area. The configuration information includes: the type of the unit block occupied by the payload unit, the number of the payload unit, and the number of unit blocks occupied by the payload unit.

[0152] Step S2022a: Determine the location of the payload unit that carries the service container based on the configuration information.

[0153] Step S2023a: Demap the service container from the cell block within the determined payload cell.

[0154] Figure 12 This is another specific implementation flowchart of step S202 in the embodiments of this disclosure, as follows: Figure 12 As shown, step S202 includes:

[0155] Step S2021b: Obtain configuration information from the payload area. The configuration information includes: the cell block type of the cell block occupied by the payload unit, the number of the payload unit, the number of cell blocks occupied by the payload unit, and verification information.

[0156] Step S2022b: Perform individual verification on each configuration information or perform overall verification on all configuration information based on the verification information.

[0157] If the verification passes, step S2023b is executed; if the verification fails, step S2024b is executed.

[0158] Step S2023b: Determine the location of the payload unit that carries the service container based on the current configuration information.

[0159] After step S2023b is completed, step S2025b is executed.

[0160] Step S2024b: Obtain the configuration information that passed the previous verification, and determine the location of the payload unit carrying the service container based on the configuration information that passed the previous verification.

[0161] After step S2024b is completed, step S2025b is executed.

[0162] Step S2025b: Demap the service container from the cell block within the determined payload cell.

[0163] Step S203: Obtain customer business from the business container.

[0164] The technical solution disclosed herein will be described in detail below with specific examples.

[0165] Example 1:

[0166] Two OTN devices communicate with each other via OTU2 frames to transmit 5 fixed bit rate services requiring clock pass-through, 3 fixed bit rate services without clock pass-through, and 10 variable bit rate services. The bandwidths of the 5 fixed bit rate services requiring clock pass-through are 10Mbps, 20Mbps, 30Mbps, 40Mbps, and 50Mbps, respectively. The committed bandwidths of the 3 fixed bit rate services without clock pass-through are 5Mbps, 8Mbps, and 10Mbps, respectively. The maximum allocated bandwidth for the 10 variable bit rate services is 50Mbps.

[0167] Figure 13 This is a schematic diagram illustrating the division of the payload area of ​​the ODU0 frame into 16-byte unit blocks in an embodiment of this disclosure. Figure 14 This is a schematic diagram of another structure of the first type of unit block and the second type of unit block in the embodiments of this disclosure, as shown below. Figure 13 and 14 As shown, assuming a data frame consists of an ODU frame, and the payload area of ​​the ODU frame is divided into 16-byte blocks, the payload area is divided into 952 fixed-length 16-byte blocks. In the second type of block, 1 byte is used as the overhead portion, and the remaining 15 bytes are used as the payload portion. Four bits in the overhead portion are used to represent the identification information of the service container (taking the TPN of the customer service carried by the service container as an example), and the remaining 4 bits are used to represent CRC-4 checksum information.

[0168] Calculations show that the bandwidth corresponding to each unit block is approximately 1.3 Mbps. Specifically, for the first type of unit block, the bandwidth corresponding to its payload is approximately 1.3 Mbps; for the second type of unit block, the bandwidth corresponding to its payload is approximately 1.3 Mbps * 15 / 16 ≈ 1.22 Mbps.

[0169] Step 1: On the transmitting side, five fixed bit rate services requiring clock pass-through with bandwidths of 10Mbps, 20Mbps, 30Mbps, 40Mbps, and 50Mbps are mapped to five Type 1 service containers, represented by OSU#1 to OSU#5 respectively; three fixed bit rate services without clock pass-through with committed bandwidths of 5Mbps, 8Mbps, and 10Mbps are mapped to three Type 2 service containers, represented by OSU#6 to OSU#8 respectively; and ten variable bit rate services are mapped to ten Type 3 service containers, represented by OSU#11 to OSU#20.

[0170] Step 2: On the sending side, the first type service containers OSU#1 to OSU#5 are divided into 5 first type service container groups, which are represented as OSUG#1 to OSUG#5 respectively. The first type service container group OSUG#i contains the first type service container OSU#i, i∈[1,5] and is an integer. The 3 second type service containers OSU#6 to OSU#8 are divided into 1 second type service container group, which is represented as OSUG#6. The 10 third type service containers OSU#11 to OSU#20 are divided into 1 third type service container group, which is represented as OSUG#7.

[0171] Step 3: On the sending side, calculate the number of cell blocks occupied by the first type of service container group OSUG#1 to OSUG#5, the second type of service container group OSUG#6, and the second type of service container group OSUG#7, respectively.

[0172] The first type of business container corresponds to the first type of unit block, and the second type of business container corresponds to the second type of unit block.

[0173] Specifically, for the first type of service container groups OSUG#1 to OSUG#5, taking OSUG#1 as an example, the number of first-type unit blocks required by OSUG#1 is 10Mbps / 1.3Mbps, rounded up to 8. Similarly, the number of first-type unit blocks required by the second type of service container groups OSUG#2 to OSUG#5 can be calculated as 16, 24, 31, and 39 respectively.

[0174] For the second type of service container group OSUG#6, which includes second type of service containers OSU#6 to OSU#8; the number of second type unit blocks required by the second type of service container OSU#6 is 5Mbps / 1.22Mbps, rounded up to 5; the number of second type unit blocks required by the second type of service container OSU#7 is 8Mbps / 1.22Mbps, rounded up to 7; the number of second type unit blocks required by the second type of service container OSU#8 is 10Mbps / 1.22Mbps, rounded up to 9; 5+7+9=21, that is, the number of second type unit blocks required by the second type of service container group OSUG#101 is 21.

[0175] For the third type of service container group OSUG#7, the number of second type unit blocks it occupies is 50Mbps / 1.22Mbps, which is rounded up to 41. That is, the third type of service container group OSUG#7 needs to occupy 41 second type unit blocks.

[0176] Step 4: On the sending side, sort the first type of service container group OSUG#1 to OSUG#5, the second type of service container group OSUG#6, and the third type of service container group OSUG#7 to obtain the processing sequence.

[0177] Assuming the sorting is performed according to the aforementioned "sorting method 1", the processing sequence C can be obtained:

[0178] C={OSUG#5, OSUG#4, OSUG#3, OSUG#2, OSUG#1, OSUG#6, OSUG#7}

[0179] In this example, the execution order of steps 1 through 4 is not limited. For example, the sorting can be performed first, and then the number of unit blocks occupied by the corresponding payload unit of each service container group can be calculated.

[0180] Step 5: On the sending side, construct configuration information for the payload units corresponding to OSUG#1 to OSUG#7 of each service container group.

[0181] For any given service container group, all the unit blocks occupied by the service container group constitute the payload unit corresponding to the service group, and corresponding configuration information can be built for the payload unit corresponding to the service container group.

[0182] Figure 15 This is another structural diagram of the configuration information in an embodiment of this disclosure, such as... Figure 15 As shown, each attribute configuration information includes: the cell block type of the cell block occupied by the payload cell, the number of the payload cell, and the number of cell blocks required; where the cell block type occupies 1 bit, the number occupies 10 bits, and the number of cell blocks occupies 10 bits.

[0183] Assuming that the payload unit numbers allocated to service container groups OSUG#5, OSUG#4, OSUG#3, OSUG#2, OSUG#1, OSUG#6, and OSUG#7 are 5, 4, 3, 2, 1, 1, and 2 respectively, the configuration information for service container groups OSUG#5, OSUG#4, OSUG#3, OSUG#2, OSUG#1, OSUG#6, and OSUG#7 is as follows:

[0184] OSU#5: 1 (cell block type), 5 (process number), 39 (number of cells occupied);

[0185] OSU#4: 1, 4, 31;

[0186] OSU#3: 1, 3, 24;

[0187] OSU#2: 1, 2, 16;

[0188] OSU#1: 1, 1, 8;

[0189] OSUG#6: 0, 1, 21;

[0190] OSUG#7: ​​0, 2, 41.

[0191] In this context, a cell block type of "1" indicates that the cell block is a first-type cell block (containing only the payload portion), and a cell block type of "0" indicates that the cell block is a second-type cell block (including both the overhead portion and the payload portion).

[0192] For payload units occupying different types of cell blocks, their payload unit numbers can be the same, because the combination of "cell block type" and "payload unit number" can distinguish the two payload units. Furthermore, the combination of "cell block type" and "payload unit number" can also determine the position of these payload units in the processing sequence.

[0193] For example, in the above example, the combination of block type "1" and payload unit number "5" determines that the service group container corresponding to that payload unit is in position 1 in the processing sequence; the combination of block type "1" and payload unit number "4" determines that the service group container corresponding to that payload unit is in position 2 in the processing sequence... the combination of block type "0" and payload unit number "7" determines that the service group container corresponding to that payload unit is in position 7 in the processing sequence. The correspondence between the combination of "block type" and "payload unit number" and the "position" in the processing sequence is agreed upon in advance by the sender and receiver, and this disclosure does not limit such correspondence.

[0194] Step 6: On the sending side, assuming that the number of pre-configured unit blocks for carrying configuration information is 5, the position of these 5 unit blocks in the 952 free unit blocks can be determined according to the sigma-delta algorithm, and then all configuration information is carried into the determined 5 unit blocks.

[0195] Step 7: On the sending side, based on the processing sequence, the first type of service container group OSUG#5 to OSUG#1, the second type of service container group OSUG#6, and the third type of service container group OSUG#7 are mapped to the corresponding cell blocks in sequence.

[0196] First, the first type of service container group OSUG#5 is mapped. Specifically, the distribution of the 31 unit blocks required by the first type of service container group OSUG#5 within the 952-5=947 free unit blocks is calculated according to the sigma-delta algorithm, and the first type of service container OSU#5 is carried into the determined 31 first type unit blocks.

[0197] Then, the first type of service container group OSUG#4 is mapped. At this time, the number of free unit blocks is 947-31=916. The specific distribution of the 24 unit blocks required by the first type of service container group OSUG#5 in the 916 free unit blocks is calculated according to the sigma-delta algorithm, and the first type of service container OSU#4 is carried into the determined 31 first type unit blocks.

[0198] Based on the same processing method, the remaining three first-type service container groups OSUG#3 to OSUG#1, one second-type service container group OSUG#6, and one third-type service container group OSUG#7 are mapped to each idle unit block respectively.

[0199] The positions of the first type of service containers OSU#5 to OSU#1 in each first type of service container group OSUG#5 to OSUG#1 remain fixed in different frames. Although the positions of the second type of service containers OSUG#6 and OSUG#7 remain fixed in different frames, the positions of the second type of service containers OSU#6 to OSU#8 in the second type of service container group OSUG#6 can change in different frames because the second type of service container includes the identification information of the service container. Similarly, the positions of the second type of service containers OSU#11 to OSU#20 in the third type of service container group OSUG#7 can change in different frames.

[0200] Step 8: On the sending side, the ODU0 frame is mapped to the ODU2 frame, encapsulated into an OTU2 frame, and then the OTU2 frame is sent.

[0201] Step 9: On the receiving side, receive the OTU2 frame and demap it to the ODU0 frame.

[0202] Step 10: On the receiving side, the distribution locations of the five unit blocks used to carry the configuration information of the payload unit are determined based on the sigma-delta algorithm, and then all configuration information is obtained from them.

[0203] When the configuration information contains verification information, the configuration information can be verified based on the verification information. For details, please refer to the previous content, which will not be repeated here.

[0204] Step 11: Based on all configuration information, reconstruct the processing sequence according to the combination of "unit block type" and "load unit number" in the configuration information.

[0205] Step 12: Based on the restored processing sequence, the distribution of the unit blocks contained in the corresponding payload units of each of the first type of service container groups OSUG#5 to OSUG#1, the second type of service container group OSUG#6, and the third type of service container group OSUG#7 is determined sequentially using the sigma-delta algorithm.

[0206] Step 13: Demap the corresponding service containers OSUG#1~OSUG#8 and OSUG#11~OSUG#20 from the unit blocks contained in each payload unit, and obtain the corresponding customer services from the service containers.

[0207] Figure 16 A structural block diagram of a service processing device in an optical transport network provided in this disclosure embodiment is shown below. Figure 16 As shown, the processing device can be used to implement the service method in the optical transport network provided in the foregoing embodiments. The processing device includes: a first mapping module 1 and a second mapping module 2.

[0208] The first mapping module is used to map customer services to service containers; the second mapping module is used to map service containers to data frames. The data frame includes payload units, each payload unit is composed of a unit block with a fixed length, and the unit block is used to carry the service container.

[0209] For a detailed description of each module in this embodiment, please refer to the corresponding content in the previous embodiments, which will not be repeated here.

[0210] Figure 17 A structural block diagram of another service processing apparatus in an optical transport network provided in this disclosure embodiment, such as... Figure 17 As shown, the processing device can be used to implement the service method in the optical transport network provided in the foregoing embodiments. The processing device includes: a first acquisition module 3, a demapping module 4, and a second acquisition module 5.

[0211] The first acquisition module 3 is used to acquire data frames, which include payload units. Each payload unit is composed of a unit block with a fixed length. The unit block is used to carry a business container, which carries customer business. The demapping module 4 is used to demapping the business container from the unit block of the data frame. The second acquisition module 5 is used to acquire customer business from the business container.

[0212] For a detailed description of each module in this embodiment, please refer to the corresponding content in the previous embodiments, which will not be repeated here.

[0213] It should be noted that, in the embodiments of this disclosure, the OTN device may simultaneously include Figure 16 The modules in the processing device shown and Figure 17 The modules in the processing device shown. That is, the OTN device can act as both a service sender and a service receiver.

[0214] Figure 18 A structural block diagram of an electronic device provided in this disclosure embodiment, such as... Figure 18 As shown, the electronic device 10 can be a mobile terminal, a computer terminal, or a similar computing device. The electronic device 10 includes one or more processors 102 (only one is shown in the figure, and the processor 102 can be, but is not limited to, a microprocessor MCU or a programmable logic device FPGA) and a memory 104; wherein, the memory 104 stores one or more programs, and when the one or more programs are executed by one or more processors 102, the one or more processors implement the steps in the processing method provided in the previous embodiments.

[0215] In some embodiments, the mobile terminal may further include a transmission device 106 for communication functions and an input / output device 108. Those skilled in the art will understand that... Figure 18 The structure shown is for illustrative purposes only and does not limit the structure of the mobile terminal described above. For example, the mobile terminal 10 may also include components that are more... Figure 18 The more or fewer components shown, or having the same Figure 18 The different configurations shown.

[0216] The memory 104 can be used to store computer programs, such as application software programs and modules, like the computer program corresponding to the service processing method in the optical transport network in this embodiment of the present disclosure. The processor 102 executes various functional applications and data processing by running the computer program stored in the memory 104, thereby implementing the above-described method. The memory 104 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory 104 may further include memory remotely located relative to the processor 102, and these remote memories can be connected to the mobile terminal 10 via a network. Examples of the above-described networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0217] The transmission device 106 is used to receive or send data via a network. Specific examples of the network described above may include a wireless network provided by the communication provider of the mobile terminal 10. In one example, the transmission device 106 includes a Network Interface Controller (NIC), which can connect to other network devices via a base station to communicate with the Internet. In another example, the transmission device 106 may be a Radio Frequency (RF) module, used for wireless communication with the Internet.

[0218] This disclosure also provides a computer-readable medium having a computer program stored thereon, which, when executed by a processor, implements the steps in the processing method provided in the preceding embodiments.

[0219] It will be understood by those skilled in the art that all or some of the steps, systems, or apparatuses disclosed above, and their functional modules / units, can be implemented as software, firmware, hardware, or suitable combinations thereof. In hardware implementations, the division between functional modules / units mentioned above does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed collaboratively by several physical components. Some or all physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit (ASIC). Such software may be distributed on a computer-readable medium, which may include computer storage media (or non-transitory media) and communication media (or transient media). As is known to those skilled in the art, the term computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technologies, CD-ROM, digital versatile disc (DVD) or other optical disc storage, magnetic cartridges, magnetic tape, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and can be accessed by a computer. Furthermore, it is well known to those skilled in the art that communication media typically contain computer-readable instructions, data structures, program modules, or other data in modulated data signals such as carrier waves or other transmission mechanisms, and may include any information delivery medium.

[0220] Example embodiments have been disclosed herein, and while specific terminology has been used, it is for illustrative purposes only and should be construed as such, and is not intended to be limiting. In some instances, it will be apparent to those skilled in the art that features, characteristics, and / or elements described in connection with particular embodiments may be used alone, or in combination with features, characteristics, and / or elements described in connection with other embodiments, unless otherwise expressly indicated. Therefore, those skilled in the art will understand that various changes in form and detail may be made without departing from the scope of this disclosure as set forth by the appended claims.

Claims

1. A service processing method in an optical transport network, wherein, include: Map customer business logic to a business container; The service container is mapped to a data frame, the data frame including a payload unit, each payload unit consisting of a unit block of fixed length, the unit block being used to carry the service container; The unit block is divided into a first type of unit block and a second type of unit block. The first type of unit block includes a payload portion, and the second type of unit block includes a payload portion and an overhead portion. The payload portion is used to carry business data, and the overhead portion includes the identification information of the business container. For any one of the said payload units, the payload unit is composed of unit blocks of the same type; The business containers are divided into three types: a first type of business container, a second type of business container, and a third type of business container. The first type of service container is a service container that carries fixed bit rate services that require clock pass-through. The second type of service container is a service container for fixed bit rate services that do not require clock pass-through; The third type of service container is a service container that carries variable bit rate services; The first type of service container is carried in the first type of unit block, and the second type of service container and the third type of service container are carried in the second type of unit block.

2. The method according to claim 1, wherein, Also includes: Configuration information is constructed for each payload unit, including: the type of unit block occupied by the payload unit, the number of the payload unit, and the number of unit blocks occupied by the payload unit; The configuration information is carried in the unit block of the data frame.

3. The method according to claim 1, wherein, All first-type service containers are divided into at least one first-type service container group, all second-type service containers are divided into at least one second-type service container group, and all third-type service containers are divided into at least one third-type service container group. Each first-type service container group includes at least one first-type service container, each second-type service container group includes at least one second-type service container, and each third-type service container group includes at least one third-type service container. Each of the first type of service container group, the second type of service container group, and the third type of service container group corresponds to a different payload unit.

4. The method according to claim 3, wherein, The steps of mapping the service container to a data frame include: Sort all the first type of service container groups, the second type of service container groups, and the third type of service container groups to obtain a processing sequence; According to the order in the processing sequence, each of the first type of service container group, the second type of service container group, and the third type of service container group is mapped to the unit block of the data frame in sequence.

5. The method according to claim 4, wherein, The step of sorting all the first type of service container groups, the second type of service container groups, and the third type of service container groups to obtain a processing sequence includes: Based on the total bandwidth of the services carried by each of the first type of service container groups, all the first type of service container groups are sorted in descending order of total bandwidth to obtain a first sequence; Based on the total bandwidth of the services carried by each of the second type of service container groups, all the second type of service container groups are sorted in descending order of total bandwidth to obtain the second sequence; Based on the maximum allocated bandwidth of each of the third type of service container groups, all the third type of service container groups are sorted in descending order of maximum allocated bandwidth to obtain the third sequence; The second sequence is appended to the end of the first sequence, and the third sequence is appended to the end of the second sequence to obtain the processed sequence; Alternatively, based on the total bandwidth of the services carried by each of the first type of service container groups, the total bandwidth of the services carried by each of the second type of service container groups, and the maximum allocated bandwidth of each of the third type of service container groups, all the first type of service container groups, the second type of service container groups, and the third type of service container groups are sorted in descending order of bandwidth.

6. The method according to claim 4, wherein, The step of sorting all the first type of service container groups, the second type of service container groups, and the third type of service container groups to obtain a processing sequence includes: Determine the latency priority of each of the first type of service container group, the second type of service container group, and the third type of service container group; The first type of service container group, the second type of service container group, and the third type of service container group are sorted in descending order of latency priority to obtain the processing sequence.

7. The method according to claim 2, wherein, The configuration information includes verification information, which is used to verify each piece of configuration information individually or to verify all configuration information as a whole.

8. The method according to any one of claims 1-7, wherein, The service container includes: ODU frame or OSU frame.

9. A service processing method in an optical transport network, wherein, include: Acquire a data frame, the data frame including a payload unit, each payload unit being composed of a unit block of fixed length, the unit block being used to carry a service container, the service container carrying customer services; The service container is demapped from the unit block of the data frame; Obtain the customer service from the service container; The unit block is divided into a first type of unit block and a second type of unit block. The first type of unit block includes a payload portion, and the second type of unit block includes a payload portion and an overhead portion. The payload portion is used to carry business data, and the overhead portion includes the identification information of the business container. For any one of the said payload units, the payload unit is composed of unit blocks of the same type; The business containers are divided into three types: a first type of business container, a second type of business container, and a third type of business container. The first type of service container is a service container that carries fixed bit rate services that require clock pass-through. The second type of service container is a service container for fixed bit rate services that do not require clock pass-through; The third type of service container is a service container that carries variable bit rate services; The first type of service container is carried in the first type of unit block, and the second type of service container and the third type of service container are carried in the second type of unit block.

10. The method according to claim 9, wherein, The step of demapping the service container from the unit block of the data frame includes: Obtain configuration information from the payload area. The configuration information includes: the cell block type of the cell block occupied by the payload unit, the number of the payload unit, and the number of cell blocks occupied by the payload unit. The location of the payload unit carrying the service container is determined based on the configuration information; The service container is demapped from the cell blocks within the defined payload unit.

11. The method according to claim 10, wherein, The configuration information includes verification information; Before the step of determining the location of the payload unit carrying customer services based on the configuration information, the method further includes: Each configuration information is individually verified based on the verification information, or all configuration information is verified as a whole. Once the verification passes, the step of determining the location of the payload unit carrying the service container based on the configuration information continues.

12. The method according to claim 11, wherein, If the verification fails, the configuration information from the previous successful verification is retrieved, and the location of the payload unit carrying the service container is determined based on the configuration information from the previous successful verification.

13. A service processing apparatus in an optical transport network, wherein, include: The first mapping module is used to map customer business to the business container; The second mapping module is used to map the service container to a data frame. The data frame includes a payload unit, and each payload unit is composed of a unit block with a fixed length. The unit block is used to carry the service container. The unit block is divided into a first type of unit block and a second type of unit block. The first type of unit block includes a payload portion, and the second type of unit block includes a payload portion and an overhead portion. The payload portion is used to carry business data, and the overhead portion includes the identification information of the business container. For any one of the said payload units, the payload unit is composed of unit blocks of the same type; The business containers are divided into three types: a first type of business container, a second type of business container, and a third type of business container. The first type of service container is a service container that carries fixed bit rate services that require clock pass-through. The second type of service container is a service container for fixed bit rate services that do not require clock pass-through; The third type of service container is a service container that carries variable bit rate services; The first type of service container is carried in the first type of unit block, and the second type of service container and the third type of service container are carried in the second type of unit block.

14. A service processing apparatus in an optical transport network, wherein, include: The first acquisition module is used to acquire data frames, the data frames including payload units, each payload unit being composed of a unit block with a fixed length, the unit block being used to carry a business container, the business container carrying customer business; A demapping module is used to demap the service container from the unit block of the data frame; The second acquisition module is used to acquire the customer service from the service container; The unit block is divided into a first type of unit block and a second type of unit block. The first type of unit block includes a payload portion, and the second type of unit block includes a payload portion and an overhead portion. The payload portion is used to carry business data, and the overhead portion includes the identification information of the business container. For any one of the said payload units, the payload unit is composed of unit blocks of the same type; The business containers are divided into three types: a first type of business container, a second type of business container, and a third type of business container. The first type of service container is a service container that carries fixed bit rate services that require clock pass-through. The second type of service container is a service container for fixed bit rate services that do not require clock pass-through; The third type of service container is a service container that carries variable bit rate services; The first type of service container is carried in the first type of unit block, and the second type of service container and the third type of service container are carried in the second type of unit block.

15. An electronic device comprising: One or more processors; A memory having stored one or more programs that, when executed by one or more processors, cause the one or more processors to implement the method of any one of claims 1-12.

16. A computer-readable medium having a computer program stored thereon, which, when executed by a processor, implements the method of any one of claims 1-12.

Images