WO2021170002A1 - 光传送网中业务处理方法、处理装置和电子设备 - Google Patents

光传送网中业务处理方法、处理装置和电子设备 Download PDF

Info

Publication number
WO2021170002A1
WO2021170002A1 PCT/CN2021/077708 CN2021077708W WO2021170002A1 WO 2021170002 A1 WO2021170002 A1 WO 2021170002A1 CN 2021077708 W CN2021077708 W CN 2021077708W WO 2021170002 A1 WO2021170002 A1 WO 2021170002A1
Authority
WO
WIPO (PCT)
Prior art keywords
service container
type
service
unit
payload
Prior art date
Application number
PCT/CN2021/077708
Other languages
English (en)
French (fr)
Inventor
张源斌
苑岩
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Priority to EP21760280.4A priority Critical patent/EP4106233A4/en
Priority to US17/907,838 priority patent/US20230125984A1/en
Publication of WO2021170002A1 publication Critical patent/WO2021170002A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0062—Network aspects
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J3/00—Time-division multiplex systems
    • H04J3/16—Time-division multiplex systems in which the time allocation to individual channels within a transmission cycle is variable, e.g. to accommodate varying complexity of signals, to vary number of channels transmitted
    • H04J3/1605—Fixed allocated frame structures
    • H04J3/1652—Optical Transport Network [OTN]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0062—Network aspects
    • H04Q2011/0064—Arbitration, scheduling or medium access control aspects
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0062—Network aspects
    • H04Q2011/0086—Network resource allocation, dimensioning or optimisation

Definitions

  • the embodiments of the present disclosure relate to the field of optical communication technology, and in particular to a service processing method, processing device, electronic device, and computer-readable medium in an optical transport network.
  • the method of loading multiple service signals into the payload of the optical transport network signal is as follows: First, the area of the optical transport network signal is divided into n Time slot, the time slot is realized by byte interleaving; then, the service signal is loaded into one or more time slots in the signal payload of the optical transport network.
  • the minimum time slot granularity of the existing OTN technology is 1.25Gbps; when carrying services with a bandwidth lower than 1.25Gbps, such as Fast Ethernet (FE) services, synchronization Transmission module-1 (Synchronous Transfer Module-1, referred to as STM-1) business, E1 business and other small bandwidth services, the bandwidth waste of the optical transport network is very serious, for example, the E1 signal bandwidth is 2.048Mbps, when the bandwidth is installed to 1.25Gbps In the gap, the bandwidth waste is as high as 99% or more. Therefore, a transmission technology is needed to implement a method for carrying small-particle services efficiently in OTN.
  • FE Fast Ethernet
  • STM-1 Synchronous Transfer Module-1
  • the embodiments of the present disclosure provide a service processing method, processing device, electronic device, and computer-readable medium in an optical transport network.
  • an embodiment of the present disclosure provides a service processing method in an optical transport network, which includes: mapping a customer service to a service container; and mapping the service container to a data frame, and the data frame includes a net
  • Each of the payload units is composed of a unit block with a fixed length, and the service container is carried in the unit block.
  • the embodiments of the present disclosure also provide a service processing method in an optical transport network, which includes: acquiring a data frame, the data frame includes a payload unit, and each payload unit has a fixed length
  • the service container is carried in the unit block, and the service container carries customer services; the service container is demapped from the unit block of the data frame; and the service container is obtained from the service container The customer service.
  • the step of demapping the service container from the unit block of the data frame includes: obtaining configuration information from a payload area, and the configuration information includes: the unit of the unit block occupied by the payload unit The block type, the number of the payload unit, and the number of unit blocks of the unit block occupied by the payload unit; determine the position of the payload unit carrying the service container according to the configuration information; solve from the unit block in the determined payload unit Map out the business container.
  • the embodiments of the present disclosure also provide a service processing device in an optical transport network, which includes: a first mapping module configured to map customer services to a service container; and a second mapping module configured to map all services
  • the service container is mapped into a data frame, the data frame includes a payload unit, each of the payload units is composed of a unit block with a fixed length, and the service container is carried in the unit block.
  • an embodiment of the present disclosure also provides a service processing device in an optical transport network, which includes: a first acquisition module configured to acquire a data frame, the data frame includes a payload unit, and each of the net The load unit is composed of a unit block with a fixed length, the service container is carried in the unit block, and the service container carries customer services; the demapping module is configured to demap from the unit block of the data frame Out of the business container; a second acquisition module configured to acquire the customer service from the business container.
  • embodiments of the present disclosure also provide an electronic device, including: one or more processors; a memory, on which one or more programs are stored, when the one or more programs are A plurality of processors execute, so that the one or more processors implement the service processing methods provided in the first aspect and the second aspect.
  • the embodiments of the present disclosure also provide a computer-readable medium on which a computer program is stored, and the program is executed by a processor to implement the service processing methods provided in the first aspect and the second aspect.
  • the technical solution provided by the embodiments 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 rate of the optical transmission network.
  • FIG. 1 is a schematic diagram of an optical path frame structure involved in an embodiment of the disclosure
  • Fig. 2 is a schematic diagram showing that the payload area of the optical path frame structure in the optical transmission standard in the related art is divided into 4 time slots;
  • FIG. 3 is a flowchart of a service processing method in an optical transport network according to an embodiment of the disclosure
  • FIG. 4 is a schematic diagram of the OTUk frame divided into unit blocks in an embodiment of the disclosure.
  • FIG. 5 is a schematic diagram of a structure of a first type unit block and a second type unit block in an embodiment of the disclosure
  • FIG. 6 is a flowchart of another service processing method in an optical transport network provided by an embodiment of the disclosure.
  • FIG. 7 is a schematic diagram of a structure of configuration information in an embodiment of the disclosure.
  • FIG. 8 is a flow chart of a specific implementation of step S102 in an embodiment of the disclosure.
  • FIG. 9 is a flowchart of a specific implementation of step S1022 in an embodiment of the disclosure.
  • FIG. 10 is a flowchart of yet another service processing method in an optical transport network provided by an embodiment of the disclosure.
  • FIG. 11 is a flowchart of a specific implementation of step S202 in an embodiment of the disclosure.
  • FIG. 12 is another specific implementation flowchart of step S202 in an embodiment of the disclosure.
  • FIG. 13 is a schematic diagram when the payload area of the ODU0 frame is divided into unit blocks of 16 bytes in an embodiment of the disclosure
  • FIG. 14 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 the present disclosure.
  • 15 is a schematic diagram of another structure of configuration information in an embodiment of the disclosure.
  • 16 is a structural block diagram of a service processing device in an optical transport network provided by an embodiment of the disclosure.
  • FIG. 17 is a structural block diagram of another service processing device in an optical transport network provided by an embodiment of the disclosure.
  • FIG. 18 is a structural block diagram of an electronic device provided by an embodiment of the disclosure.
  • FIG. 1 is a schematic diagram of the optical channel frame structure involved in the embodiments of the disclosure.
  • the optical transport network signal is used as the optical channel transport unit (OTU) signal in the embodiment of the disclosure.
  • OTU signal is composed of OTUk frame, including overhead area and payload area.
  • the overhead area includes: optical path transmission unit overhead (denoted as "OTUk overhead”, k can take values 1, 2, 3, 4), optical channel digital unit (Optical channel Data Unit, referred to as ODU) overhead (denoted as "ODUk overhead", k can take values 0, 1, 2, 2e, 3, 4) and optical channel payload unit (Optical channel Payload Unit, referred to as OPU)
  • OTUk overhead optical path transmission unit overhead
  • ODUk overhead optical channel digital unit
  • ODUk overhead denotes 0, 1, 2, 2e, 3, 4
  • OPU optical channel payload unit
  • the overhead denoted as "OPUk overhead”
  • k can take values 0, 1, 2, 2e, 3, 4).
  • the remaining part of the OTUk frame after removing the OTUk overhead is called the ODUk frame
  • the remaining part of the ODUk frame after removing the ODUk overhead is called the OPUk frame
  • the remaining part of the OPUk frame after removing the OPUk overhead is called the OPUk payload (that is, the optical path frame).
  • Fig. 2 is a schematic diagram showing that the payload area of the optical path frame structure in the optical transmission standard in the related art is divided into 4 time slots.
  • the method in the network signal payload is to divide the optical transport network signal payload into n time slots, and then load the service signal into one or more time slots in the optical transport network signal payload. It is implemented in a plug-in manner, and an example is described by dividing the payload area of the OTUk into 4 time sequences as an example.
  • the OTUk frame is composed of byte blocks with 4 rows and 3824 columns. The area corresponding to the column number from 1 to 16 is the overhead area (not shown), and the area corresponding to the column number from 17 to 3824 is the payload area.
  • a small box in Figure 2 represents one byte.
  • the OPUk payload area of an OPUk frame consists of 4*3808 bytes, arranged in 4 rows and 3808 columns as shown in Figure 2.
  • Figure 2 shows the case when the OPUk payload is divided into 4 time slots by byte interleaving, that is, in a total of 3808 columns, starting from column 17, the adjacent 4 bytes are a group, and the The 4 bytes are divided into 4 different time slots TS1, TS2, TS3, TS4, that is, the consecutive 4 bytes starting from column 17 represent 4 time slots, so that all 4*3808 words in the OPUk payload
  • the smallest ODUk in the optical transport network is ODU0 and the rate is 1.25G, so theoretically, the OPUk payload in OTUk frames of all rates should be divided into 1.25G granularity.
  • the ODU0 can be installed in the most efficient way.
  • some services with small bandwidth such as FE services, STM-1 services, E1 services, etc., using time slots to directly carry them will result in serious bandwidth waste.
  • FIG. 3 is a flowchart of a service processing method in an optical transport network provided by an embodiment of the disclosure. As shown in FIG. 3, the service processing method in an optical transport network is applied to the sending side and includes:
  • Step S101 Map the customer service to the service container.
  • client services specifically refer to services that belong to small-particle services for optical transport network frames.
  • the ratio of the bandwidth of the customer service to the bandwidth of the payload area of the optical transport network frame is less than the preset ratio, and the specific value of the preset ratio is set by industry professionals. Generally speaking, the value of the preset proportion is less than or equal to 10%. In the embodiment of the present disclosure, it is only necessary to ensure that the bandwidth of the customer service is smaller than the bandwidth of the payload area of the optical transport network frame.
  • the service container includes: ODU frame or Optical Service Unit (Optical Service Unit, OSU for short) frame.
  • ODU frame Optical Service Unit
  • OSU Optical Service Unit
  • Step S102 Map the service container to a data frame, the data frame includes a payload unit, each payload unit is composed of a unit block with a fixed length, and the service container is carried in the unit block.
  • each unit block carries data of at most one service container.
  • the OTN frame may be an ODU frame or a FlexO frame; the data frame is composed of the payload area of the ODU frame or the payload area of the FlexO frame.
  • Fig. 4 is a schematic diagram of dividing an OTUk frame into unit blocks in an embodiment of the disclosure.
  • the payload area of the OTUk frame can be divided into multiple Fixed-length unit block; among them, the unit block refers to a continuous bit that occupies a fixed number (greater than 1), and the service container is carried in the unit block (it can also be regarded as carrying customer services).
  • FIG. 5 is a schematic structural diagram of the first type unit block and the second type unit block in the embodiments of the disclosure.
  • the unit blocks can be divided into two types: the first type unit block and the second type unit block ,
  • the length of the first type unit block and the second type unit block are the same;
  • the first type unit block includes the payload part,
  • the second type unit block includes: the payload part and the overhead part.
  • the length of the payload part and the overhead part can be determined according to It actually needs to be set.
  • the payload part is used to carry service data, and the overhead part includes the identification information of the service container.
  • the payload unit is composed of unit blocks of the same type.
  • the identification information of the service container is used to identify the service container carried by the unit block.
  • each customer service is assigned a corresponding branch port number (TPN), and the corresponding customer service can be identified based on the TPN.
  • TPN branch port number
  • the TPN of the customer service carried by the service container may be used as the identification information of the service container.
  • identification information of the service container in the present disclosure may also take forms, and it is only necessary to ensure that the identification information can be used to distinguish different service containers.
  • the overhead part may further include verification information used to verify the identification information, so as to ensure the reliability of the identification information in the overhead part.
  • the number of the first type unit block and the second type unit block in each frame can be flexibly adjusted according to the type and bandwidth of the client service carried, and is not a fixed value.
  • the unit blocks with a fixed length of K are used for division; if the payload area can be divided into an integer number of unit blocks, the number of divided unit blocks is N, and then each unit block corresponds to The bandwidth is Q/N, and Q is the bandwidth of the entire payload area; if the payload area cannot be divided into an integer number of unit blocks, it is divided according to the maximum number of unit blocks that can be divided (assuming the number of divided unit blocks is N), the remaining data in the payload area is filled. The filling can 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 stuffing bits in the payload area, F ⁇ K, N*K+F is the total number of bits in the payload area.
  • the bandwidth of each unit block can also be small, which can improve bandwidth utilization.
  • the value of the size K of the unit block should not be too large. A too large value means that the number of service bits that need to be buffered is large and the delay becomes large; it should not be too small, because the second type of unit block contains an overhead part. The overhead part occupies some bits.
  • the K value is too small, it means that the overhead part in the unit block accounts for too much, and the payload part used to transmit customer service data occupies a relatively small portion, and the data transmission efficiency is low. In practical applications, the K value can be set and adjusted according to actual needs.
  • the technical solution of the present disclosure can solve the problem of serious waste of bandwidth 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 rate of the optical transmission network.
  • FIG. 6 is a flowchart of another service processing method in an optical transport network provided by an embodiment of the disclosure. As shown in FIG. 6, the service processing method in an optical transport network is applied to the sending side and includes:
  • Step S101 Map the customer service to the service container.
  • Step S102 Map the service container to a data frame, the data frame includes a payload unit, each payload unit is composed of a unit block with a fixed length, and the service container is carried in the unit block.
  • Step S102a construct configuration information for each payload unit.
  • FIG. 7 is a schematic diagram of a structure of configuration information in an embodiment of the disclosure.
  • the configuration information includes: the unit block type of the unit block occupied by the payload unit, the number of the payload unit, and the unit occupied by the payload unit The number of unit blocks of the block.
  • the unit block type of the unit block of the first type is represented by "1”
  • the unit block type of the unit block of the second type is represented by "0"; that is, for each piece of configuration information, the information indicating the type of the unit block Only 1 bit is occupied.
  • the number of the payload unit is used in conjunction with the unit block type, and the combination of the "payload unit number” and the “unit block type” can be used to distinguish different payload units. Further, the combination of the “number of the payload unit” and the “unit block type” can characterize the order of the corresponding payload unit in the subsequent “processing sequence”. The specific content will be described later.
  • the configuration information is configured with verification information, and the verification information is used to verify each configuration information individually or to verify all the configuration information as a whole.
  • cyclic redundancy check Cyclic Redundancy Check, CRC
  • FEC Forward Error Correction
  • Step S102b The configuration information is carried in the unit block of the data frame.
  • a fixed number of unit blocks can be preset in the data frame to carry "configuration information". For example, 5 unit blocks are set to carry configuration information.
  • step S102b according to the preset number (for example, 5) of the unit blocks configured to carry the configuration information, the distribution of the unit blocks used to carry the configuration information is determined based on the sigma-delta algorithm; The configuration information is carried in the determined unit block. It should be noted that when the number of payload units is small, the number of configuration information will also be less. At this time, the number of unit blocks that actually carry the configuration information may be less than the preset number.
  • the preset number for example, 5
  • the location of the unit block that carries the attribute configuration information can also be determined based on other methods; for example, the sender and the receiver negotiate in advance to set one or several fixed locations in the payload area. Used to carry configuration information.
  • step S102a and step S102b are executed after step S101.
  • step S102a and step S102b are executed alternately with step S102, or step S102a and step S102b are executed after step S102.
  • service containers are 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 a fixed bit rate service that requires clock transparent transmission; and the second type of service container
  • the type of service container is a service container of a fixed bit rate service that does not require clock transparent transmission;
  • 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 is The service container and the second type of service container are carried in the second type of unit block.
  • 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
  • all third-type service containers are divided into at least one The third type of service container group
  • each first type of service container group includes at least one first type of service container
  • each second type of service container group includes at least one second type of service container
  • each third type of service container group includes At least one third type business container.
  • Each of the first type service container group, the second type service container group, and the third type service container group corresponds to a different payload unit.
  • the specific division rules are not limited; for example, all first/second type business containers are divided /The third type of business container is divided into 1 first/second/third type business container groups; or, for a certain type of business container, all business containers of this type are equally divided into multiple business container groups; or, For a certain type of business container, all business containers of this type are divided into multiple business container groups with different numbers of business containers.
  • the maximum number of services that can be accommodated can be set by configuring the bit size used to represent the identification information in the overhead part of the second type unit block; for example, the bit size used to represent the identification information in the overhead part occupies a bit, then the identification There are at most 2a types of information, and a second/third type business container group can accommodate the maximum number of second/third type business containers at 2a.
  • FIG. 8 is a flow chart of a specific implementation of step S102 in an embodiment of the disclosure. As shown in FIG. 8, in some embodiments, step S102 includes:
  • Step S1021 Sort all the first-type service container groups, the second-type service container groups, and the third-type service container groups to obtain a processing sequence.
  • the technical solution of the present disclosure does not limit the rules used in the sorting, that is, random sorting can be used, or non-random sorting can be used.
  • the sorting can be based on the size of the "bandwidth".
  • 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 allocation of each third type of service container group Bandwidth
  • sorting can be performed according to the "delay priority" level.
  • a delay priority can be assigned to the business container group according to the delay requirements of the customer services carried in the business container group; for example, if the customer services carried in the business container group have a higher delay requirement ( That is, if the delay is required to be small in the transmission process), a higher delay priority can be assigned to the service container group; if the customer service carried in the service container group has a lower delay requirement (that is, during the transmission process) Allow a large delay), then a lower delay priority can be assigned to the service container group.
  • the operation of allocating the business container group to the business container group can be implemented manually, or the OTN device automatically allocates the business container group based on certain rules (the allocation algorithm is manually preset).
  • the allocation algorithm is manually preset.
  • the technical solution of the present disclosure does not limit the specific algorithm used to allocate the delay priority to the service container group.
  • the first-type business container group, the second-type business container group, and the third-type business container group are sorted to obtain a processing sequence.
  • the number of each payload unit is assigned according to the result of the processing sequence and the type of unit block occupied by the corresponding payload unit of each service container group.
  • the specific assignment rules are not limited here (it can be sent The party negotiates with the receiver in advance), and only needs to ensure that during the subsequent demapping, the receiver can restore the processing sequence based on the combination of the "payload unit number" and the "unit block type" recorded in all configuration information. Can.
  • Step S1022 according to the sequence in the processing sequence, sequentially map the first type service container group, the second type service container group, and the third type service container group to the unit blocks of the data frame.
  • FIG. 9 is a flow chart of a specific implementation of step S1022 in an embodiment of the disclosure. As shown in FIG. 9, in some embodiments, step S1022 includes:
  • Step S10221 For each first-type service container group, calculate the first-type service container group according to the bandwidth of each first-type service container and the bandwidth of the unit block in the first-type service container group. The number of unit blocks required for each first type business container in the first type business container, and the number of unit blocks required for all first type business containers in the first type business container group is summed to obtain the first type The number of unit blocks that the business container group needs to occupy.
  • the bandwidth of each unit block can be obtained when the number of unit blocks N, the size of the unit block is K, the size of the payload area, and the bandwidth Q of the payload area are determined.
  • For the first type of service container divide the bandwidth of the first type of service container by the bandwidth of the unit block; if the calculation result is an integer, the calculation result is the number of unit blocks that the first type of service container needs to occupy; If the result is not an integer, the calculation result is rounded up to obtain the number of unit blocks that the first type of service container needs to occupy.
  • Step S10222 For each second type service container group, calculate the second type service container group according to the bandwidth of each second type service container and the bandwidth of the unit block in the second type service container group. The number of unit blocks required to be occupied by each second type business container in the second type business container group, and the number of unit blocks required to be occupied by all the second type business containers in the second type business container group is summed to obtain the second type The number of unit blocks that the business container group needs to occupy.
  • the method of calculating the number of unit blocks required by the second type of service container is the same as the previous method of calculating the number of unit blocks required by the first type of service container, and will not be repeated here.
  • Step S10223 For each third type service container group, determine the maximum allocated bandwidth allocated to the third type service container group according to the bandwidth of the service carried by each third type service container in the third type service container group, and According to the maximum allocated bandwidth and the bandwidth of the unit block, the number of unit blocks needed to be occupied by the third-type service container group is calculated.
  • the third type of service container group its carrying client services are rate-variable services, so these client services can share bandwidth.
  • the third type can be set to the third type through a preset algorithm
  • the service group is allocated a maximum allocated bandwidth, that is, as the maximum allocated bandwidth allocated to the third-type service container group. It should be noted that the technical solution of the present disclosure does not limit the specific algorithm for determining the "maximum allocated bandwidth". It only needs to ensure that the maximum allocated bandwidth allocated by the third-type service container group is greater than or equal to that in the third-type service container group.
  • the peak bandwidth of a variable bit rate service with the largest peak bandwidth is less than or equal to the sum of the peak bandwidths of all variable bit rate services in the third-type service container group.
  • 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 unit block that the third type of service container group needs to occupy If the calculation result is not an integer, the calculation result is rounded up to obtain the number of unit blocks that the third type of service container group needs to occupy.
  • step S10221 when there is no fixed bit rate service that requires clock transparent transmission in the customer service, there is no service container group of the first type, and step S10221 may not be executed at this time; when there is no customer service that does not require clock transparent transmission For fixed bit rate services, the second type of service container group does not exist, and step S10222 may not be executed at this time; 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 not be implemented.
  • Step S10224 Based on the number of unit blocks required for each first type service container group, second type service container group, and third type service container, according to the order in the processing sequence, sequentially combine each first type service container group, The second type of service container group and the third type of service container group are mapped to the unit block of the data frame.
  • the step of mapping a service container group to a unit block of an optical transport network frame includes: first, according to the first type service container group, the second type service container group or the third type service container group that needs to be occupied The number of unit blocks is determined based on the sigma-delta algorithm to determine the location distribution of the unit blocks occupied by the first type of service container group, the second type of service container group, or the third type of service container group; then, the first type of service The container group, the second-type service container group, or the third-type service container group is carried in the determined unit block.
  • a certain number of unit blocks (obtained through steps S10221 to S10223) required to be occupied by a certain service container group can be evenly distributed to the free unit blocks (unallocated) in the data frame. ⁇ unit block). Therefore, when the number of unit blocks occupied by a certain service container group is certain, if the rank of the service container group in the processing sequence changes in two frames, the service container group is in the two frames. The position of the occupied unit block will also change.
  • the specific operation process of the sigma-delta algorithm belongs to the conventional technology in this field, and will not be repeated here.
  • the sigma-delta algorithm should be used to calculate the location of the unit block occupied by the configuration information, and then the unit block occupied by each service container group should be calculated according to the processing sequence and the sigma-delta algorithm, so that the receiver can be based on Used to carry the "preset number" of configuration information, and accurately determine the unit block used to carry the configuration information from the data frame based on the sigma-delta algorithm.
  • the unit block occupied by the configuration information is one or several fixed-position unit blocks negotiated in advance by the sender and the receiver, the sequence between the mapping steps of the configuration information and the mapping steps of the service container group is not changed. limited.
  • step S101, step S102a, step S102b, and step S102 are all performed by the sending node (an OTN device).
  • the sending node After completing the processing of the above steps S101 and S102, the sending node will send the frame containing the ODU to the receiving node Or the optical transport network frame of the FlexO frame (that is, the realization of the transmission of the data frame) to realize the transmission of the customer service.
  • the node on the receiving side will receive the optical transport network frame containing the ODU frame or FlexO frame (that is, the data frame is received), and demap the service container from the unit blocks divided by the data frame, and obtain the corresponding service container from the service container. Customer business data.
  • FIG. 10 is a flowchart of yet another service processing method in an optical transport network provided by an embodiment of the present disclosure. As shown in FIG. 10, the service processing method in an optical transport network is applied to the receiving side and includes:
  • Step S201 Obtain a data frame.
  • the data frame includes payload units.
  • Each payload unit is composed of a unit block with a fixed length.
  • the service container is carried in the unit block, and the service container carries customer services.
  • Step S202 Demap the service container from the unit block of the data frame.
  • FIG. 11 is a flow chart of a specific implementation of step S202 in an embodiment of the disclosure. As shown in FIG. 11, step S202 includes:
  • Step S2021a Obtain configuration information from the payload area.
  • the configuration information includes: the unit block 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.
  • Step S2022a Determine the position of the payload unit carrying the service container according to the configuration information.
  • Step S2023a Demap the service container from the unit block in the determined payload unit.
  • FIG. 12 is another specific implementation flowchart of step S202 in the embodiment of the disclosure. As shown in FIG. 12, this step S202 includes:
  • Step S2021b Obtain configuration information from the payload area.
  • the configuration information includes: the unit block type of the unit block occupied by the payload unit, the number of the payload unit, the unit block number of the unit block occupied by the payload unit, and check information.
  • Step S2022b Perform individual verification on each configuration information or perform overall verification on all configuration information according to the verification information.
  • step S2023b is executed; when the verification fails, step S2024b is executed.
  • Step S2023b Determine the position of the payload unit carrying the service container according to the current configuration information.
  • step S2025b is executed.
  • Step S2024b Obtain the configuration information that passed the previous verification, and determine the position of the payload unit carrying the service container according to the configuration information that passed the previous verification.
  • step S2025b is executed.
  • Step S2025b Demap the service container from the unit block in the determined payload unit.
  • Step S203 Obtain the customer service from the service container.
  • Two OTN devices communicate through OTU2 frames to transmit 5 fixed bit rate services that require clock transparent transmission, 3 fixed bit rate services that do not require clock transparent transmission, and 10 variable bit rate services; among them, the 5 require clocks
  • the bandwidths of the transparently transmitted fixed bit rate services are 10 Mbps, 20 Mbps, 30 Mbps, 40 Mbps, and 50 Mbps.
  • the committed bandwidths of the three fixed bit rate services without clock transparent transmission are 5 Mbps, 8 Mbps, and 10 Mbps.
  • the 10 variable bits The maximum allocated bandwidth allocated by the rate business is 50Mbps.
  • FIG. 13 is a schematic diagram when the payload area of the ODU0 frame is divided into unit blocks according to 16 bytes in an embodiment of the disclosure
  • FIG. 14 is another structure of the first type unit block and the second type unit block in the embodiment of the disclosure
  • the schematic diagram assumes that the data frame consists of an ODU frame, and the payload area of the ODU frame is divided into unit blocks with a length of 16 bytes.
  • the payload area is divided into 952 fixed A unit block with a length of 16 bytes; among them, in the second type of unit, 1 byte is configured as an overhead part, and the remaining 15 bytes are used as a payload part.
  • the 4 bits in the overhead part are used to represent the identification information of the service container (taking the identification information as the TPN of the client service carried by the service container as an example), and the remaining 4 bits are used to represent the CRC-4 check information.
  • the bandwidth corresponding to each unit block is about 1.3 Mbps.
  • the bandwidth corresponding to the payload part is about 1.3Mbps; for the second type unit block, the bandwidth corresponding to the payload part is 1.3Mbps*15/16 ⁇ 1.22Mbps .
  • Step 1 On the sending side, map 5 fixed bit rate services with bandwidths of 10 Mbps, 20 Mbps, 30 Mbps, 40 Mbps, and 50 Mbps that require clock transparent transmission to 5 first type service containers.
  • the 5 first types Service containers are represented by OSU#1 ⁇ OSU#5; 3 fixed bit rate services with committed bandwidths of 5 Mbps, 8 Mbps and 10 Mbps without clock transparent transmission are respectively mapped to 3 second type service containers.
  • the two types of service containers are respectively represented by OSU#6 ⁇ OSU#8; 10 variable bit rate services are respectively mapped to 10 third type service containers, and the 10 first type service containers are represented by OSU#11 ⁇ OSU# 20 means.
  • Step 2 On the sending side, divide the first type service container OSU#1 ⁇ OSU#5 into five first type service container groups, and the five first type service container groups are respectively represented as OSUG#1 ⁇ OSUG#5 , Where the first type of service container group OSUG#i contains the first type of service container OSU#i, i ⁇ [1,5] and is an integer; the three second type service containers OSU#6 ⁇ OSU#8 are divided into 1 A second-type business container group, the one second-type business container group is represented as OSUG#6; 10 third-type business containers OSU#11 ⁇ OSU#20 are divided into one third-type business container group, the One third type business container group is represented as OSUG#7.
  • Step 3 On the sending side, respectively calculate the number of unit blocks occupied by the first type service container group OSUG#1 to OSUG#5, the second type service container group OSUG#6, and the second type service container group OSUG#7.
  • the first type of service container corresponds to the first type of unit block
  • the second type of service container corresponds to the second type of unit block
  • the first type of unit block occupied by the first type of service container group OSUG#1 The number is 10Mbps/1.3Mbps, rounded up to 8.
  • the number of unit blocks of the first type that each of the second type service container groups OSUG#2 to OSUG#5 needs to occupy is 16, 24, 31, and 39.
  • the number of second type unit blocks occupied is 50Mbps/1.22Mbps, rounded up to 41, that is, the third type service container group OSUG#7 needs to occupy the second type
  • the number of unit blocks is 41.
  • Step 4 On the sending side, sort the first type service container group OSUG#1 to OSUG#5, the second type service container group OSUG#6, and the third type service container group OSUG#7 to obtain the processing sequence.
  • processing sequence C can be obtained:
  • step 1 to step 4 is not limited. For example, it is also possible to sort first, and then calculate the number of unit blocks occupied by the payload unit corresponding to each service container group.
  • Step 5 On the sending side, construct configuration information for the payload units corresponding to each service container group OSUG#1 to OSUG#7.
  • all unit blocks occupied by the service container group constitute the payload unit corresponding to the service group, and corresponding configuration information can be constructed for the payload unit corresponding to the service container group.
  • FIG 15 is a schematic diagram of another structure of configuration information in an embodiment of the disclosure.
  • each piece of attribute configuration information includes: the unit block type of the unit block occupied by the payload unit, the number of the payload unit, and the number of the payload unit.
  • the business container group OSUG#5, OSUG#4, OSUG#3, OSUG#2, OSUG#1, OSUG#6, OSUG#7 are assigned payload unit numbers 5, 4, 3, 2 respectively , 1, 1, and 2, at this time, the configuration information of the service container group OSUG#5, OSUG#4, OSUG#3, OSUG#2, OSUG#1, OSUG#6, OSUG#7 is as follows:
  • OSU#5 1 (unit block type), 5 (processing number), 39 (occupied unit block number);
  • OSU#4 1, 4, 31;
  • OSU#3 1, 3, 24;
  • OSU#2 1, 2, 16;
  • OSU#1 1, 1, 8;
  • the unit block type "1" means that the unit block is the first type unit block (including only the payload part), and the unit block type "0" means that the unit block is the second type unit block (including the overhead part and the net). Dutch part).
  • the numbers of the payload units can be the same, because the two payload units can be distinguished based on the combination of "unit block type” and "payload unit number". In addition, based on the combination of "unit block type” and "payload unit number", the order of these payload units in the processing sequence can also be determined.
  • the combination of the unit block type "1" and the payload unit number "5" can determine that the service group container corresponding to the payload unit has the first position in the processing sequence.
  • the unit block type is a combination of "1" and the number of the payload unit is "4", it can be determined that the service group container corresponding to the payload unit has the second position in the processing sequence...
  • the combination of the unit block type "0" and the payload unit number "7” can determine that the service group container corresponding to the payload unit has the 7th position in the processing sequence.
  • the combination of the "unit block type” and the "payload unit number” and the corresponding rule of the "rank” in the processing sequence are negotiated in advance by the sender and the receiver, and the present disclosure does not limit the corresponding rule.
  • Step 6 On the sending side, assuming that the number of pre-configured unit blocks used to carry configuration information is 5, the position of the 5 unit blocks among the 952 free unit blocks can be determined according to the sigma-delta algorithm, and then All configuration information is carried in the determined 5 unit blocks.
  • Step 7 On the sending side, based on the processing sequence, sequentially map the first type service container group OSUG#5 ⁇ OSUG#1, the second type service container group OSUG#6, and the third type service container group OSUG#7 to the corresponding ⁇ unit block.
  • the first type of service container group OSUG#4 is mapped.
  • the positions of the first type unit blocks occupied by the first type service containers OSU#5 to OSU#1 in each first type service container group OSUG#5 to OSUG#1 are fixed in different frames.
  • the positions of the second type unit blocks occupied by the second type service container group OSUG#6 and the second type service container group OSUG#7 in different frames are fixed, the position of the second type unit block includes the identifier of the service container.
  • the positions of the second-type unit blocks occupied by each second-type service container OSU#6 ⁇ OSU#8 in the second-type service container group OSUG#6 in different frames may change, and the third-type service container
  • the positions of the second-type unit blocks occupied by the third-type service containers OSU#11-OSU#20 in the group OSUG#7 may change in different frames.
  • Step 8 On the sending side, map the ODU0 frame to the ODU2 frame, and after encapsulating it into an OTU2 frame, send the OTU2 frame.
  • Step 9 On the receiving side, the OTU2 frame is received and demapped to the ODU0 frame.
  • Step 10 On the receiving side, based on the sigma-delta algorithm, determine the distribution positions of the five unit blocks used to carry the configuration information of the payload unit, and then obtain all the configuration information from them.
  • the configuration information can be verified based on the verification information.
  • the configuration information can be verified based on the verification information.
  • Step 11 Based on all the configuration information, restore the processing sequence according to the combination of "unit block type” and "payload unit number” in the configuration information.
  • Step 12 Based on the restored processing sequence, determine each first-type service container group OSUG#5 ⁇ OSUG#1, second-type service container group OSUG#6, and third-type service container group OSUG# in sequence based on the sigma-delta algorithm. 7 The distribution of the unit blocks contained in the respective payload units.
  • Step 13 demap corresponding service containers OSUG#1 ⁇ OSUG#8, OSUG#11 ⁇ OSUG#20 from the unit blocks included in each payload unit, and obtain corresponding customer services from the service container.
  • FIG. 16 is a structural block diagram of a service processing device in an optical transport network provided by an embodiment of the disclosure. As shown in FIG. 16, the processing device can implement the service method in the optical transport network provided by the foregoing embodiment, and the processing device includes: The first mapping module 1 and the second mapping module 2.
  • the first mapping module is set to map the customer service to the service container;
  • the second mapping module is set to map the service container to the data frame, the data frame includes a payload unit, and each payload unit is composed of a fixed length It is composed of unit blocks, and the service container is carried in the unit blocks.
  • FIG. 17 is a structural block diagram of another service processing device in an optical transport network provided by an embodiment of the disclosure.
  • the processing device can implement the service method in the optical transport network provided by the foregoing embodiment, and the processing device includes :The first acquisition module 3, the demapping module 4, and the second acquisition module 5.
  • the first obtaining module 3 is configured to obtain a data frame, the data frame includes a payload unit, each payload unit is composed of a unit block with a fixed length, the service container is carried in the unit block, and the service container carries customer services;
  • the demapping module 4 is configured to demap the service container from the unit blocks of the data frame;
  • the second obtaining module 5 is configured to obtain customer services from the service container.
  • the OTN device may include the modules in the processing device shown in FIG. 16 and the modules in the processing device shown in FIG. 17 at the same time. That is, the OTN device can serve as a service sender or a service receiver.
  • FIG. 18 is a structural block diagram of an electronic device provided by an embodiment of the disclosure.
  • the electronic device 10 may 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 illustrated in the drawings.
  • the processor 102 may include, but is not limited to, a microprocessor (Microprocessor Unit, MPU for short) or a programmable logic device (Programmable logic device). , Abbreviated as PLD) and other processing devices) and memory 104; wherein, one or more programs are stored in the memory 104, and when one or more programs are executed by one or more processors 102, one or more processors Implement the steps in the processing method provided in the previous embodiment.
  • MPU Microprocessor Unit
  • PLD programmable logic device
  • the above-mentioned mobile terminal may further include a transmission device 106 and an input/output device 108 configured as a communication function.
  • a transmission device 106 and an input/output device 108 configured as a communication function.
  • the structure shown in FIG. 18 is only for illustration, and does not limit the structure of the above-mentioned mobile terminal.
  • the mobile terminal 10 may also include more or fewer components than those shown in FIG. 18, or have a different configuration from that shown in FIG. 18.
  • the memory 104 may be configured to store computer programs, for example, software programs and modules of application software, such as the computer programs corresponding to the service processing method in the optical transport network in the embodiment of the present disclosure.
  • the processor 102 runs the computer stored in the memory 104 Programs to perform various functional applications and data processing, that is, to achieve the above-mentioned methods.
  • the memory 104 may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory.
  • the memory 104 may further include a memory remotely provided with respect to the processor 102, and these remote memories may be connected to the mobile terminal 10 through a network. Examples of the aforementioned networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.
  • the transmission device 106 is configured to receive or transmit data via a network.
  • the above-mentioned specific example of the network may include a wireless network provided by the communication provider of the mobile terminal 10.
  • the transmission device 106 includes a network adapter (Network Interface Controller, NIC for short), which can be connected to other network devices through a base station to communicate with the Internet.
  • the transmission device 106 may be a radio frequency (Radio Frequency, referred to as RF) module, which is configured to communicate with the Internet in a wireless manner.
  • RF Radio Frequency
  • the embodiments of the present disclosure also provide a computer-readable medium on which a computer program is stored, and when the program is executed by a processor, the steps in the processing method provided in the previous embodiments are implemented.
  • Such software may be distributed on a computer-readable medium, and the computer-readable medium may include a computer storage medium (or a non-transitory medium) and a communication medium (or a transitory medium).
  • the term computer storage medium includes volatile and nonvolatile implementations in any method or technology configured to store information (such as computer-readable instructions, data structures, program modules, or other data). Sexual, removable and non-removable media.
  • Computer storage media include, but are not limited to, Read-Only Memory (ROM), Random Access Memory (RAM), Electrically Erasable Programmable Read-Only Memory, EEPROM for short), flash memory or other memory technologies, Compact Disc Read-Only Memory (CD-ROM for short), Digital Video Disc (DVD for short) or other optical disk storage, magnetic boxes, Tape, disk storage or other magnetic storage devices, or any other medium that can be configured to store desired information and that can be accessed by a computer.
  • a communication medium usually contains computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transmission mechanism, and may include any information delivery medium. .

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Time-Division Multiplex Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本公开实施例提供了一种光传送网中业务处理方法，其中，包括：将客户业务映射到业务容器中；将所述业务容器映射到数据帧中，所述数据帧包括净荷单元，每个所述净荷单元均由具有固定长度的单元块组成，所述业务容器承载在所述单元块中。本公开实施例还提供了一种光传送网中业务处理装置、电子设备和计算机可读介质。

Description

光传送网中业务处理方法、处理装置和电子设备 技术领域
本公开实施例涉及光通信技术领域，特别涉及一种光传送网中业务处理方法、处理装置、电子设备和计算机可读介质。
背景技术
在现有光传送网(Optical Transport Network，简称为OTN)的定义中，多个业务信号装到光传送网信号的净荷中的方法如下：首先，将光传送网信号的区域划分为n个时隙，时隙以字节间插的方式实现；然后，将业务信号装入光传送网信号净荷中的一个或多个时隙中。
按照现有的光传送网标准G.709，现有的OTN技术时隙颗粒度最小为1.25Gbps；在承载带宽低于1.25Gbps的业务时，例如以太网(Fast Ethernet，简称FE)业务、同步传输模块-1(Synchronous Transfer Module-1，简称STM-1)业务、E1业务等小带宽业务，光传送网的带宽浪费非常严重，例如E1信号带宽为2.048Mbps，装到带宽为1.25Gbps的时隙中，带宽浪费高达99％以上，因此需要一种传输技术来实现在OTN中高效率承载小颗粒业务的方法。
发明内容
本公开实施例提供一种光传送网中业务处理方法、处理装置、电子设备和计算机可读介质。
第一方面，本公开实施例提供了一种光传送网中业务处理方法，其中，包括：将客户业务映射到业务容器中；将所述业务容器映射到数据帧中，所述数据帧包括净荷单元，每个所述净荷单元均由具有固定长度的单元块组成，所述业务容器承载在所述单元块中。
第二方面，本公开实施例还提供了一种光传送网中业务处理方法，其 中，包括：获取数据帧，所述数据帧包括净荷单元，每个所述净荷单元均由具有固定长度的单元块组成，所述业务容器承载在所述单元块中，所述业务容器承载有客户业务；从所述数据帧的单元块中解映射出所述业务容器；从所述业务容器中获取所述客户业务。在一些实施例中，所述从所述数据帧的单元块中解映射出所述业务容器的步骤包括：从净荷区域中获取配置信息，配置信息包括：净荷单元所占用单元块的单元块类型、净荷单元的编号和净荷单元所占用单元块的单元块数量；根据所述配置信息确定承载有业务容器的净荷单元的位置；从所确定净荷单元内的单元块中解映射出业务容器。
第三方面，本公开实施例还提供了一种光传送网中业务处理装置，其中，包括：第一映射模块，设置为将客户业务映射到业务容器中；第二映射模块，设置为将所述业务容器映射到数据帧中，所述数据帧包括净荷单元，每个所述净荷单元均由具有固定长度的单元块组成，所述业务容器承载在所述单元块中。
第四方面，本公开实施例还提供了一种光传送网中业务处理装置，其中，包括：第一获取模块，设置为获取数据帧，所述数据帧包括净荷单元，每个所述净荷单元均由具有固定长度的单元块组成，所述业务容器承载在所述单元块中，所述业务容器承载有客户业务；解映射模块，设置为从所述数据帧的单元块中解映射出所述业务容器；第二获取模块，设置为从所述业务容器中获取所述客户业务。
第五方面，本公开实施例还提供了一种电子设备，包括：一个或多个处理器；存储器，其上存储有一个或多个程序，当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现第一方面和第二方面中提供的业务处理方法。
第六方面，本公开实施例还提供了一种计算机可读介质，其上存储有计算机程序，所述程序被处理器执行时实现第一方面和第二方面中提供的业务处理方法。
本公开实施例提供的技术方案，可解决现有技术中通过将净荷区域划分为时隙的方式传送光传送业务导致带宽浪费严重的问题，达到提高光传 送网带宽利用率的效果。
附图说明
图1为本公开实施例中涉及到的光通路帧结构的示意图；
图2相关技术中光传送标准中光通路帧结构的净荷区域划分为4个时隙的示意图；
图3为本公开实施例提供的一种光传送网中业务处理方法的流程图；
图4为本公开实施例中OTUk帧划分为单元块示意图；
图5为本公开实施例中第一类型单元块和第二类型单元块的一种结构示意图；
图6为本公开实施例提供的另一种光传送网中业务处理方法的流程图；
图7为本公开实施例中配置信息的一种结构示意图；
图8为本公开实施例中步骤S102的一种具体实施流程图；
图9为本公开实施例中步骤S1022的一种具体实施流程图；
图10为本公开实施例提供的又一种光传送网中业务处理方法的流程图；
图11为本公开实施例中步骤S202的一种具体实施流程图；
图12为本公开实施例中步骤S202的另一种具体实施流程图；
图13为本公开实施例中将ODU0帧的净荷区域按16字节划分单元块时的示意图；
图14为本公开实施例中第一类型单元块和第二类型单元块的另一种结构示意图；
图15为本公开实施例中配置信息的另一种结构示意图；
图16为本公开实施例提供的一种光传送网中业务处理装置的结构框图；
图17为本公开实施例提供的另一种光传送网中业务处理装置的结构框图；
图18为本公开实施例提供的一种电子设备的结构框图。
具体实施方式
为使本领域的技术人员更好地理解本公开的技术方案，下面结合附图对本公开提供的一种光传送网中业务处理方法、处理装置、电子设备和计算机可读介质进行详细描述。
在下文中将参考附图更充分地描述示例实施例，但是所述示例实施例可以以不同形式来体现且不应当被解释为限于本文阐述的实施例。反之，提供这些实施例的目的在于使本公开透彻和完整，并将使本领域技术人员充分理解本公开的范围。
在不冲突的情况下，本公开各实施例及实施例中的各特征可相互组合。
如本文所使用的，术语“和/或”包括一个或多个相关列举条目的任何和所有组合。
本文所使用的术语仅用于描述特定实施例，且不意欲限制本公开。如本文所使用的，单数形式“一个”和“该”也意欲包括复数形式，除非上下文另外清楚指出。还将理解的是，当本说明书中使用术语“包括”和/或“由……制成”时，指定存在所述特征、整体、步骤、操作、元件和/或组件，但不排除存在或添加一个或多个其它特征、整体、步骤、操作、元件、组件和/或其群组。
除非另外限定，否则本文所用的所有术语(包括技术和科学术语)的含义与本领域普通技术人员通常理解的含义相同。还将理解，诸如那些在常用字典中限定的那些术语应当被解释为具有与其在相关技术以及本公开的背景下的含义一致的含义，且将不解释为具有理想化或过度形式上的含义，除非本文明确如此限定。
图1为本公开实施例中涉及到的光通路帧结构的示意图，如图1所示，本公开实施例中以光传送网信号为光通路传送单元(Optical channel Transport Unit，简称为OTU)信号为例进行描述。OTU信号由OTUk帧构成，包括开销区域和净荷区域，开销区域包括：光通路传送单元的开销(记为“OTUk开销”，k可取值1，2，3，4)、光通道数字单元(Optical channel  Data Unit，简称为ODU)的开销(记为“ODUk开销”，k可取值0，1，2，2e，3，4)和光通道净荷单元(Optical channel Payload Unit，简称OPU)的开销(记为“OPUk开销”，k可取值0，1，2，2e，3，4)。OTUk帧中去掉OTUk开销后剩下的部分叫做ODUk帧，ODUk帧中去掉ODUk开销后剩下的部分叫OPUk帧，OPUk帧去掉OPUk开销后剩下的部分叫OPUk净荷(即，光通路帧结构的净荷区域)。净荷区域可用来承载业务信号。
图2相关技术中光传送标准中光通路帧结构的净荷区域划分为4个时隙的示意图，如图2所示，在现有光传送网的定义中，多个业务信号装到光传送网信号净荷中的方法是将光传送网信号净荷划分为n个时隙，然后将业务信号装入光传送网信号净荷中的一个或多个时隙中，时隙以字节间插的方式实现，以将OTUk的净荷区域划分为4个时序为例进行示例性描述。OTUk帧由4行、3824列的字节块所组成，列号从1到16对应的区域为开销区域(未示出)，列号从17到3824对应区域为净荷区域。图2中一个小方框代表一个字节，一个OPUk帧的OPUk净荷区由4*3808个字节组成，排成如图2所示的4行3808列。图2表示OPUk净荷被以字节间插的方式划分为4个时隙时的情况，即在共计3808列中，从列17开始，相邻的4个字节一组，每组中的4个字节分别划分到4个不同的时隙TS1，TS2，TS3，TS4，即从列17开始连续的4个字节分别表示4个时隙，这样OPUk净荷中的所有4*3808字节被划分为4个时隙，分别命名为TS1、TS2、TS3、TS4，m个时隙可以装一个ODU业务(m小于OPUk净荷中的最大时隙数n，图2中n＝4)。
按照现有的光传送网标准G.709，光传送网中最小的ODUk为ODU0，速率为1.25G，这样理论上说所有速率的OTUk帧中的OPUk净荷都应该划分为1.25G粒度的时隙，这样能够最高效的装下ODU0。此时，对于一些带宽小的业务，例如FE业务、STM-1业务、E1业务等，利用时隙直接承载，会导致带宽浪费严重。
为解决上述技术问题，本公开提出了相应的解决方案，下面将结合附图来进行示例性描述。
图3为本公开实施例提供的一种光传送网中业务处理方法的流程图， 如图3所示，该光传送网中业务处理方法应用于发送侧，包括：
步骤S101、将客户业务映射到业务容器中。
在本公开实施例中，客户业务具体是指对于光传送网帧而言属于小颗粒业务的业务。具体地，客户业务的带宽与光传送网帧的净荷区域的带宽之比小于预设占比，该预设占比具体取值是由行业专业人员来设定。一般而言，该预设占比的取值小于或等于10％。在本公开实施例中，仅需保证客户业务的带宽小于光传送网帧的净荷区域的带宽即可。
在本公开实施例中，业务容器包括：ODU帧或光服务层单元(Optical Service Unit，简称OSU)帧。将客户业务映射到业务容器的过程属于本领域的常规技术，此处不再赘述。
步骤S102、将业务容器映射到数据帧中，数据帧包括净荷单元，每个净荷单元均由具有固定长度的单元块组成，业务容器承载在单元块中。
其中，每个单元块至多承载一个业务容器的数据。
在本公开实施例中，OTN帧可为ODU帧或FlexO帧；数据帧由ODU帧的净荷区域组成，或由FlexO帧的净荷区域组成。
图4为本公开实施例中OTUk帧划分为单元块示意图，如图4所示，以对1个OTUk帧的净荷区域划分单元块为例，OTUk帧的净荷区域可以划分为多个具有固定长度单元块；其中，单元块是指占用固定数量(大于1)的连续比特，业务容器承载在单元块中(也可看作是承载客户业务)。
图5为本公开实施例中第一类型单元块和第二类型单元块的一种结构示意图，如图5所示，单元块可分为两类：第一类型单元块和第二类型单元块，第一类型单元块和第二类型单元块的长度相同；第一类型单元块包括净荷部分，第二类型单元块包括：净荷部分和开销部分，净荷部分和开销部分的长度可根据实际需要进行设置，净荷部分用于承载业务数据，开销部分包括业务容器的标识信息。对于针对任意一个净荷单元，该净荷单元由同一类型的单元块组成。
其中，业务容器的标识信息用来标识该单元块所承载的业务容器。
在实际应用中，每一个客户业务均分配有对应的支路端口号(TPN)， 基于TPN可识别出所对应的客户业务。基于上述情况，在一些实施例中，可利用业务容器所承载的客户业务的TPN作为该业务容器的标识信息。
当然，本公开中的业务容器的标识信息还可以采用形式，仅需保证标识信息能够用于区别不同的业务容器即可。
在一些实施例中，开销部分还可包括用于对标识信息进行校验的校验信息，以保障开销部分中标识信息的可靠性。
需要说明的是，在本公开实施例中，每帧中的第一类型单元块和第二类型单元块的数量可根据承载的客户业务类型及带宽进行灵活调整，并非固定的值。
为方便描述，假定以固定长度为K的单元块来进行划分；若净荷区域能够整分为整数个的单元块，划分出的单元块的数量为N，此时每个单元块所对应的带宽为Q/N，Q为整个净荷区域的带宽；若净荷区域无法整分为整数个的单元块，则按照最大可分的单元块数目进行划分(假定划分出的单元块的数量为N)，净荷区域余下的数据做填充，填充可位于帧的末尾，也可分布于帧中间，此时每个单元块带宽大小为K*Q/(N*K+F)，其中F为净荷区域中的填充比特数目，F<K，N*K+F为净荷区域的总比特数。
在本公开实施例中，若数据帧划分为N个单元块，则数据帧中划分出的净荷单元数量最多为N，数据帧可传递的业务数最多为N(此时每个个净荷单元仅包括1个单元块)，每个单元块的带宽也可以很小，可提高带宽利用率。对于单元块的大小K的取值，不宜过大，过大的取值意味着需要缓存的业务比特数多，时延变大；也不宜过小，由于第二类型单元块中包含开销部分，开销部分要占用一些比特，若K值过小，则意味着单元块中开销部分所占比重过大，用于传递客户业务数据的净荷部分占比较小，数据传递效率较低。在实际应用中，可根据实际需要来对K值进行设定和调整。
本公开的技术方案，可解决现有技术中通过将净荷区域划分为时隙的方式传送光传送业务导致带宽浪费严重的问题，达到提高光传送网带宽利用率的效果。
图6为本公开实施例提供的另一种光传送网中业务处理方法的流程图，如图6所示，该光传送网中业务处理方法应用于发送侧，包括：
步骤S101、将客户业务映射到业务容器中。
步骤S102、将业务容器映射到数据帧中，数据帧包括净荷单元，每个净荷单元均由具有固定长度的单元块组成，业务容器承载在单元块中。
步骤S102a、为每个净荷单元构建配置信息。
图7为本公开实施例中配置信息的一种结构示意图，如图7所示，配置信息包括：净荷单元所占用单元块的单元块类型、净荷单元的编号和净荷单元所占用单元块的单元块数量。
在一些实施例中，第一类型单元块的单元块类型用“1”表示，第二类型单元块的单元块类型用“0”表示；即针对每一条配置信息中的表示单元块类型的信息仅占用1比特。
其中，净荷单元的编号用于与单元块类型进行配合使用，通过“净荷单元的编号”与“单元块类型”的组合可以用于区分不同的净荷单元。进一步地，通过“净荷单元的编号”与“单元块类型”的组合可以表征出所对应的净荷单元后续“处理序列”中的位次。具体内容将在后续描述。
在一些实施例中，配置信息配置有校验信息，验信息用于对每个配置信息进行单独校验或者对所有配置信息进行整体校验。作为一种可选实施方式，基于校验信息对配置信息进行循环冗余校验(Cyclic Redundancy Check，简称CRC)或前向纠错(Forward Error Correction，简称FEC)校验，以保障配置信息的可靠性。
步骤S102b、将配置信息承载在数据帧的单元块中。
其中，在数据帧内可预先设置固定数量个单元块用来承载“配置信息”。例如，设置5个单元块用来承载配置信息。
在步骤S102b中，根据预先配置的用于承载配置信息的单元块的预设数量(例如，5个)，基于sigma-delta算法确定出用于承载配置信息的单元块的分布；然后，将全部配置信息承载至所确定的单元块中。需要说明的是，当净荷单元的数量较少时，则配置信息的数量也会较少，此时实际承 载有这些配置信息的单元块数量可能会少于预设数量。
当然，在公开实施例中也可以是基于其他方式来确定承载属性配置信息的单元块的位置；例如，发送方和接收方预先协商好将净荷区域中某一个或几个固定位置的单元块用作承载配置信息。
在本公开实施例中，仅需保证步骤S102a和步骤S102b位于步骤S101之后执行即可。例如，步骤S102a和步骤S102b与步骤S102交叉执行，或者步骤S102a和步骤S102b位于步骤S102之后执行。
在一些实施例中，业务容器分为第一类型业务容器、第二类型业务容器和第三类型业务容器；第一类型业务容器为承载需要时钟透传的固定比特率业务的业务容器；第二类型业务容器为无需时钟透传的固定比特率业务的业务容器；第三类型业务容器为承载可变比特率业务的业务容器；第一类型业务容器承载于第一类型单元块中，第二类型业务容器和第二类型业务容器承载于第二类型单元块中。
在一些实施例中，全部第一类型业务容器划分为至少一个第一类型业务容器组，全部第二类型业务容器划分为至少一个第二类型业务容器组，全部第三类型业务容器划分为至少一个第三类型业务容器组，每个第一类型业务容器组包括至少一个第一类型业务容器，每个第二类型业务容器组包括至少一个第二类型业务容器，每个第三类型业务容器组包括至少一个第三类型业务容器。
每个第一类型业务容器组、第二类型业务容器组、第三类型业务容器组分别对应不同的一个净荷单元。
在将多个第一/第二/第三类型业务容器划分为至少一个第一/第二/第三类型业务容器组时，具体的划分规则不作限定；例如，将全部的第一/第二/第三类型业务容器划分为1第一/第二/第三类型业务容器组；或者，针对某一类的业务容器，将该类的全部业务容器平均划分为多个业务容器组；或者，针对某一类的业务容器，将该类的全部业务容器划分为包含业务容器数量不等的多个业务容器组。
在本公开实施例中，只要每个第二/第三类型业务容器组所包含的第二/ 第三类型业务容器的数量不超过预先设定的可容纳最大业务数即可。其中，可容纳最大业务数可通过配置第二类型单元块中开销部分内用于表示标识信息的比特大小来设定；例如，开销部分内用于表示标识信息的比特大小占a比特，则标识信息最多有2a种，一个第二/第三类型业务容器组的可容纳第二/第三类型业务容器的最大数量最为2a。示例性地，a取值为4，则第二/第三类型业务容器组的可容纳第二/第三类型业务容器的最大数量最为24＝16。
图8为本公开实施例中步骤S102的一种具体实施流程图，如图8所示，在一些实施例中，步骤S102包括：
步骤S1021、对全部第一类型业务容器组、第二类型业务容器组和第三类型业务容器组进行排序，得到处理序列。
本公开的技术方案对排序时所采用的规则不作限定，即可以采用随机排序，也可以采用非随机排序。
在一些实施例中，可根据“带宽”大小来进行排序。
作为一种可选实施方案，首先，根据各第一类型业务容器组所承载业务的总带宽，按照总带宽由大至小的顺序对全部第一类型业务容器组进行排序，得到第一序列；然后，根据各第二类型业务容器组所承载业务的总带宽，按照总带宽由大至小的顺序对全部第二类型业务容器组进行排序，得到第二序列；接着，根据各第三类型业务容器组的最大分配带宽，按照最大分配带宽由大至小的顺序对全部第三类型业务容器组进行排序，得到第三序列；最后，将第二序列连接于第一序列尾部，且将第三序列连接于第二序列的尾部，以得到处理序列(简称为“排序方式1”)。
作为另一种可选实施方案，根据各第一类型业务容器组的所承载业务的总带宽、各第二类型业务容器组的所承载业务的总带宽和各第三类型业务容器组的最大分配带宽，按照带宽由大至小的顺序对全部第一类型业务容器组、第二类型业务容器组和第三类型业务容器组进行排序，以得到处理序列。
在一些实施例中，可根据“时延优先级”高低来进行排序。其中，可 根据业务容器组中所承载的各客户业务的时延需求，来为业务容器组来分配一个时延优先级；例如，若业务容器组中所承载客户业务对时延需求较高(即，传输过程中要求时延很小)，则可为该业务容器组分配一个较高的时延优先级；若业务容器组中所承载客户业务对时延需求较低(即，传输过程中允许时延很大)，则可为该业务容器组分配一个较低的时延优先级。其中，为业务容器组分配业务容器组的操作可以是人工来实现，或者是OTN设备基于一定的规则(由人工预先设定分配算法)来为业务容器组进行自动分配。本公开的技术方案对为业务容器组来分配时延优先级所采用的具体算法不作限定。
在进行排序时，首先，确定各第一类型业务容器组、第二类型业务容器组和第三类型业务容器组的时延优先级；然后，按照时延优先级由高至低的顺序对全部第一类型业务容器组、第二类型业务容器组和第三类型业务容器组进行排序，以得到处理序列。
在得到处理序列后，跟根据处理序列的结果以及各业务容器组所对应净荷单元所占用的单元块类型，来为各净荷单元的编号进行赋值，具体赋值规则此处不作限定(可由发送方与接收方进行事先协商)，仅需保证后续解映射时，接收方能够基于全部配置信息中所记载的“净荷单元的编号”与“单元块类型”的组合，能够还原出处理序列即可。
步骤S1022、根据处理序列中的先后顺序，依次将各第一类型业务容器组、第二类型业务容器组以及第三类型业务容器组映射到数据帧的单元块中。
图9为本公开实施例中步骤S1022的一种具体实施流程图，如图9所示，在一些实施例中，步骤S1022包括：
步骤S10221、针对每个第一类型业务容器组，根据该第一类型业务容器组中每个第一类型业务容器所承载业务的带宽和单元块的带宽，分别计算出该第一类型业务容器组中每个第一类型业务容器所需占用的单元块的数量，并将该第一类型业务容器组中全部第一类型业务容器所需占用的单元块的数量进行求和，得到该第一类型业务容器组所需占用的单元块的数量。
基于前面内容可知，在单元块的数量N、单元块的大小为K、净荷区域的大小、净荷区域的带宽Q确定的情况下，可以得到每个单元块的带宽。针对第一类型业务容器，将第一类型业务容器的带宽除以单元块的带宽；若计算结果为整数，则该计算结果为该第一类型业务容器所需占用的单元块的数量；若计算结果不为整数，则将计算结果向上取整，得到该第一类型业务容器所需占用的单元块的数量。
步骤S10222、针对每个第二类型业务容器组，根据该第二类型业务容器组中每个第二类型业务容器所承载业务的带宽和单元块的带宽，分别计算出该第二类型业务容器组中每个第二类型业务容器所需占用的单元块的数量，并将该第二类型业务容器组中全部第二类型业务容器所需占用的单元块的数量进行求和，得到该第二类型业务容器组所需占用的单元块的数量。
其中，计算第二类型业务容器所需占用的单元块的数量的方法与前面计算第一类型业务容器所需占用的单元块的数量的方法相同，此处不再赘述。
步骤S10223、针对每个第三类型业务容器组，根据该第三类型业务容器组中各第三类型业务容器所承载业务的带宽，确定分配给该第三类型业务容器组的最大分配带宽，并根据该最大分配带宽和单元块的带宽计算出该第三类型业务容器组所需占用的单元块的数量。
在第三类型业务容器组内，其承载客户业务为速率可变业务，因此这些客户业务之间可以共享带宽。针对某一个第三类型业务容器组，根据该第三类型业务容器组中所承载的各可变比特率业务的最大带宽(也可称为峰值带宽)，可通过预设算法为该第三类型业务组分配一个最大分配带宽，即作为分配给该第三类型业务容器组的最大分配带宽。需要说明的是，本公开的技术方案对确定“最大分配带宽”的具体算法不做限定，仅需保证第三类型业务容器组所分配的最大分配带宽满足大于等于该第三类型业务容器组中峰值带宽最大的一个可变比特率业务的峰值带宽，且小于等于该第三类型业务容器组中全部可变比特率业务的峰值带宽之和。
针对第三类型业务容器组，将第三类型业务容器组的最大分配带宽除 以单元块的带宽；若计算结果为整数，则该计算结果为该第三类型业务容器组所需占用的单元块的数量；若计算结果不为整数，则将计算结果向上取整，得到该第三类型业务容器组所需占用的单元块的数量。
需要说明的是，当客户业务中不存在需要时钟透传的固定比特率业务时，则不存在第一类型业务容器组，此时步骤S10221可不执行；当客户业务中不存在无需时钟透传的固定比特率业务时，则不存在第二类型业务容器组，此时步骤S10222可不执行；当客户业务中不存在可变比特率业务时，则不存在第三类型业务容器组，此时步骤S10223可不执行。
步骤S10224、基于各第一类型业务容器组、第二类型业务容器组和第三类型业务容器所需占用的单元块数量，根据处理序列中的先后顺序，依次将各第一类型业务容器组、第二类型业务容器组和第三类型业务容器组映射到数据帧的单元块中。
在按照处理序列进行映射时，每次仅处理一个第一类型业务容器组、第二类型业务容器组和第三类型业务容器。其中，将一个业务容器组映射到光传送网帧的单元块中的步骤包括：首先，根据该该第一类型业务容器组、第二类型业务容器组或第三类型业务容器组所需占用的单元块的数量，基于sigma-delta算法确定该该第一类型业务容器组、第二类型业务容器组或第三类型业务容器组所占用的单元块的位置分布；然后，将该第一类型业务容器组、第二类型业务容器组或第三类型业务容器组承载至所确定出的单元块中。
在本公开实施例中，基于sigma-delta算法可将某一个业务容器组所需占用的一定数量(通过步骤S10221～步骤S10223得到)单元块均匀分布到数据帧内的空闲单元块(未被分配的单元块)中。因此，在某个业务容器组所占用的单元块数量一定的情况下，若在两帧中，该业务容器组在处理序列中的位次发生了变化，则该业务容器组在该两帧中所占用的单元块的位置也会发生变化。sigma-delta算法的具体运算过程属于本领域的常规技术，此处不进行赘述。
需要说明的是，当配置信息所占用的单元块位置以及各业务容器组所需所占用的单元块均是由sigma-delta算法所计算出时，为保证接收侧能够 先获取到全部配置信息，则应该先通过sigma-delta算法计算出配置信息所占用的单元块位置，然后再根据处理序列并通过sigma-delta算法计算出各业务容器组所需所占用的单元块，以便于接收方能够根据用于承载配置信息的“预设数量”，并基于sigma-delta算法从数据帧中准确的确定出用于承载配置信息的单元块。当配置信息所占用的单元块为发送方和接收方预先协商好的某一个或几个固定位置的单元块时，则对配置信息的映射步骤与业务容器组的映射步骤之间的先后顺序不作限定。
上述步骤S101、步骤S102a、步骤S102b和步骤S102均由发送侧节点(一种OTN设备)执行，在完成上述步骤S101和步骤S102的处理后，发送侧节点会向接收侧节点发送包含有ODU帧或FlexO帧的光传送网帧(即实现对数据帧的发送)，以实现对客户业务的发送。
接收侧节点会接收包含有ODU帧或FlexO帧的光传送网帧(即接收到了数据帧)，并从数据帧所划分的单元块中解映射出业务容器，且从业务容器中获取到相应的客户业务的数据。
图10为本公开实施例提供的又一种光传送网中业务处理方法的流程图，如图10所示，该光传送网中业务处理方法应用于接收侧，包括：
步骤S201、获取数据帧，数据帧包括净荷单元，每个净荷单元均由具有固定长度的单元块组成，业务容器承载在单元块中，业务容器承载有客户业务。
步骤S202、从数据帧的单元块中解映射出业务容器。
图11为本公开实施例中步骤S202的一种具体实施流程图，如图11所示，该步骤S202包括：
步骤S2021a、从净荷区域中获取配置信息，配置信息包括：净荷单元所占用单元块的单元块类型、净荷单元的编号和净荷单元所占用单元块的单元块数量。
步骤S2022a、根据配置信息确定承载有业务容器的净荷单元的位置。
步骤S2023a、从所确定净荷单元内的单元块中解映射出业务容器。
图12为本公开实施例中步骤S202的另一种具体实施流程图，如图12 所示，该步骤S202包括：
步骤S2021b、从净荷区域中获取配置信息，配置信息包括：净荷单元所占用单元块的单元块类型、净荷单元的编号、净荷单元所占用单元块的单元块数量和校验信息。
步骤S2022b、根据校验信息对每个配置信息进行单独校验或者对所有配置信息进行整体校验。
其中，当校验通过时，则执行步骤S2023b；当校验不通过时，则执行步骤S2024b。
步骤S2023b、根据当前的配置信息确定承载有业务容器的净荷单元的位置。
在步骤S2023b结束后，执行步骤S2025b。
步骤S2024b、获取前一次通过校验的配置信息，并根据前一次通过校验的配置信息确定承载有业务容器的净荷单元的位置。
在步骤S2024b结束后，执行步骤S2025b。
步骤S2025b、从所确定净荷单元内的单元块中解映射出业务容器。
步骤S203、从业务容器中获取客户业务。
下面将结合具体示例来对本公开的技术方案进行详细描述。
示例1：
两个OTN设备通之间通过OTU2帧传送5个需要时钟透传的固定比特率业务、3个无需时钟透传的固定比特率业务和10个可变比特率业务；其中，该5个需要时钟透传的固定比特率业务的带宽分别为10Mbps、20Mbps、30Mbps、40Mbps、50Mbps，该3个无需时钟透传的固定比特率业务的承诺带宽分别为5Mbps、8Mbps、10Mbps，该10个可变比特率业务所分配的最大分配带宽为50Mbps。
图13为本公开实施例中将ODU0帧的净荷区域按16字节划分单元块时的示意图，图14为本公开实施例中第一类型单元块和第二类型单元块的另一种结构示意图，如图13和14所示，假定数据帧由一个ODU帧组成， 且ODU帧的净荷区域以长度为16字节的单元块来进行划分，此时将净荷区域划分为952个固定长度为16字节的单元块；其中，在第二类型单元中，配置1个字节用作开销部分，剩下的15字节用作净荷部分。开销部分中的4比特用于表示业务容器的标识信息(以标识信息为业务容器所承载客户业务的TPN为例)，剩下的4比特用作表示CRC-4校验信息。
通过计算可得出每个单元块所对应的带宽约为1.3Mbps。其中，对于第一类型单元块而言，其净荷部分所对应的带宽约为1.3Mbps；对于第二类型单元块而言，其净荷部分对应的带宽为1.3Mbps*15/16≈1.22Mbps。
步骤1，在发送侧，将带宽为10Mbps、20Mbps、30Mbps、40Mbps、50Mbps的5个需要时钟透传的固定比特率业务，分别映射到5个第一类型业务容器中，该5个第一类型业务容器由OSU#1～OSU#5表示；将承诺带宽分别为5Mbps、8Mbps和10Mbps的3个无需时钟透传的固定比特率业务分别映射到3个第二类型业务容器中，该3个第二类型业务容器分别由OSU#6～OSU#8表示；将10个可变比特率业务分别映射到10个第三类型业务容器中，该10个第一类型业务容器由OSU#11～OSU#20表示。
步骤2，在发送侧，将第一类型业务容器OSU#1～OSU#5划分为5个第一类型业务容器组，该5个第一类型业务容器组分别表示为OSUG#1～OSUG#5，其中第一类型业务容器组OSUG#i包含第一类型业务容器OSU#i，i∈[1,5]且为整数；将3个第二类型业务容器OSU#6～OSU#8划分为1个第二类型业务容器组，该1个第二类型业务容器组表示为OSUG#6；将10个第三类型业务容器OSU#11～OSU#20划分为1个第三类型业务容器组，该1个第三类型业务容器组表示为OSUG#7。
步骤3，在发送侧，分别计算第一类型业务容器组OSUG#1～OSUG#5、第二类型业务容器组OSUG#6和第二类型业务容器组OSUG#7所占用的单元块的数量。
第一类型业务容器对应第一类型单元块，第二类型业务容器对应第二类型单元块。
其中，对于第一类型业务容器组OSUG#1～OSUG#5，以计算第一类型业务容器组OSUG#1为例，第一类型业务容器组OSUG#1所需占用的第一 类型单元块的数量为10Mbps/1.3Mbps，向上取整为8。同理，可计算出第二类型业务容器组OSUG#2～OSUG#5各自所需占用的第一类型单元块的数量为16、24、31、39。
对于第二类型业务容器组OSUG#6，其包含第二类型业务容器OSU#6～OSU#8；第二类型业务容器OSU#6所需占用的第二类型单元块的数量为5Mbps/1.22Mbps，向上取整为5，第二类型业务容器OSU#7所需占用的第二类型单元块的数量为8Mbps/1.22Mbps，向上取整为7，第二类型业务容器OSU#8所需占用的第二类型单元块的数量为10Mbps/1.22Mbps，向上取整为9，5+7+9＝21，即第二类型业务容器组OSUG#101所需占用第二类型单元块的数量为21。
对于第三类型业务容器组OSUG#7，其所占用的第二类型单元块的数量为50Mbps/1.22Mbps，向上取整为41，即第三类型业务容器组OSUG#7所需占用第二类型单元块的数量为41。
步骤4，在发送侧，对第一类型业务容器组OSUG#1～OSUG#5、第二类型业务容器组OSUG#6和第三类型业务容器组OSUG#7进行排序，得到处理序列。
假定按照前述的“排序方式1”进行排序，可得到处理序列C：
C＝{OSUG#5，OSUG#4，OSUG#3，OSUG#2，OSUG#1，OSUG#6，OSUG#7}
在该示例中，步骤1～步骤4的执行顺序不作限定。例如，也可以先进行排序，然后再计算各业务容器组所对应净荷单元占用的单元块数量。
步骤5，在发送侧，为各业务容器组OSUG#1～OSUG#7所对应的净荷单元构建配置信息。
对于任意一个业务容器组，该业务容器组所占用的全部单元块构成该业务组所对应的净荷单元，可为业务容器组所对应的净荷单元构建对应的配置信息。
图15为本公开实施例中配置信息的另一种结构示意图，如图15所示，每条属性配置信息均包括：净荷单元所占用单元块的单元块类型、净荷单 元的编号和所需占用的单元块数量；其中，单元块类型占用1比特，编号占用10比特，单元块数量占用10比特。
其中，假定为业务容器组OSUG#5，OSUG#4，OSUG#3，OSUG#2，OSUG#1，OSUG#6，OSUG#7所分配的净荷单元编号分别为5、4、3、2、1、1和2，此时业务容器组OSUG#5，OSUG#4，OSUG#3，OSUG#2，OSUG#1，OSUG#6，OSUG#7的配置信息如下：
OSU#5：1(单元块类型)，5(处理编号)，39(占用单元块数量)；
OSU#4：1，4，31；
OSU#3：1，3，24；
OSU#2：1，2，16；
OSU#1：1，1，8；
OSUG#6：0，1，21；
OSUG#7：0，2，41。
其中，单元块类型为“1”表示该单元块为第一类型单元块(仅包括净荷部分)，单元块类型为“0”表示该单元块为第二类型单元块(包括开销部分和净荷部分)。
对于占用不同类型单元块的净荷单元，其净荷单元的编号可以相同，因为基于“单元块类型”与“净荷单元的编号”的组合是可以区分该两个净荷单元。另外，基于“单元块类型”与“净荷单元的编号”的组合也是可以确定出这些净荷单元在处理序列中的位次。
例如，在上述示例中，单元块类型为“1”与净荷单元的编号为“5”的组合，可以确定出该净荷单元所对应业务组容器在处理序列中的位次为第1位；上述示例中单元块类型为“1”与净荷单元的编号为“4”的组合，可以确定出该净荷单元所对应业务组容器在处理序列中的位次为第2位...单元块类型为“0”与净荷单元的编号为“7”的组合，可以确定出该净荷单元所对应业务组容器在处理序列中的位次为第7位。“单元块类型”与“净荷单元的编号”的组合，与处理序列中“位次”的对应规则由发送方和接收方预先商定，本公开对该对应规则不作限定。
步骤6，在发送侧，假定预先配置的用于承载配置信息的单元块数量为5个，则可按照sigma-delta算法确定该5个单元块在952个空闲单元块中的位置，然后再将全部配置信息承载至确定的5个单元块内。
步骤7，在发送侧，基于处理序列，依次将第一类型业务容器组OSUG#5～OSUG#1、第二类型业务容器组OSUG#6和第三类型业务容器组OSUG#7分别映射到对应的单元块。
首先，对第一类型业务容器组OSUG#5进行映射。具体地，根据sigma-delta算法计算出第一类型业务容器组OSUG#5所需占用的31个单元块在952-5＝947个空闲单元块中的具体分布位置，并将第一类型业务容器OSU#5承载至所确定的31个第一类型单元块中。
然后，对第一类型业务容器组OSUG#4进行映射。此时，空闲单元块的数量为947-31＝916个。根据sigma-delta算法计算出第一类型业务容器组OSUG#5所需占用的24个单元块在916个空闲单元块中的具体分布位置，并将第一类型业务容器OSU#4承载至所确定的31个第一类型单元块中。
基于相同的处理方式，将剩余的3个第一类型业务容器组OSUG#3～OSUG#1、1个第二类型业务容器组OSUG#6和1个第三类型业务容器组OSUG#7分别映射到各空闲单元块中。
各第一类型业务容器组OSUG#5～OSUG#1中的第一类型业务容器OSU#5～OSU#1在不同帧中所占用的第一类型单元块位置固定不变。虽然，第二类型业务容器组OSUG#6和第二类型业务容器组OSUG#7在不同帧中所占用的第二类型单元块位置固定不变，但是由于第二类型单元块包括业务容器的标识信息，因此第二类型业务容器组OSUG#6中各第二类型业务容器OSU#6～OSU#8在不同帧中各自所占用的第二类型单元块的位置可发生变化，第三类型业务容器组OSUG#7中各第三类型业务容器OSU#11～OSU#20在不同帧中各自所占用的第二类型单元块的位置可发生变化。
步骤8，在发送侧，将ODU0帧映射到ODU2帧，封装成OTU2帧之后，发送该OTU2帧。
步骤9，在接收侧，接收该OTU2帧，并解映射到ODU0帧。
步骤10，在接收侧，基于sigma-delta算法确定5个用于承载净荷单元的配置信息的单元块的分布位置，然后从中获取全部配置信息。
其中，当配置信息存在校验信息时，则可以基于校验信息对配置信息进行校验，具体描述可参见前面内容，此处不再赘述。
步骤11，基于全部配置信息，根据配置信息中“单元块类型”和“净荷单元的编号”的组合，还原出处理序列。
步骤12，基于还原出的处理序列，基于sigma-delta算法依次确定各第一类型业务容器组OSUG#5～OSUG#1、第二类型业务容器组OSUG#6和第三类型业务容器组OSUG#7各自对应的净荷单元所包含的单元块的分布。
步骤13，从各净荷单元所包含的单元块中解映射出相应的业务容器OSUG#1～OSUG#8、OSUG#11～OSUG#20，并从业务容器中获取相应的客户业务。
图16为本公开实施例提供的一种光传送网中业务处理装置的结构框图，如图16所示，该处理装置可用实现前述实施例提供的光传送网中业务方法，该处理装置包括：第一映射模块1和第二映射模块2。
其中，第一映射模块设置为将客户业务映射到业务容器中；第二映射模块设置为将业务容器映射到数据帧中，数据帧包括净荷单元，每个净荷单元均由具有固定长度的单元块组成，业务容器承载在单元块中。
对于本实施例中各模块的具体描述，可参见前面实施例中相应内容，此处不再赘述。
图17为本公开实施例提供的另一种光传送网中业务处理装置的结构框图，如图17所示，该处理装置可用实现前述实施例提供的光传送网中业务方法，该处理装置包括：第一获取模块3、解映射模块4和第二获取模块5。
其中，第一获取模块3设置为获取数据帧，数据帧包括净荷单元，每个净荷单元均由具有固定长度的单元块组成，业务容器承载在单元块中，业务容器承载有客户业务；解映射模块4设置为从数据帧的单元块中解映射出业务容器；第二获取模块5设置为从业务容器中获取客户业务。
对于本实施例中各模块的具体描述，可参见前面实施例中相应内容， 此处不再赘述。
需要说明的是，在本公开实施例中OTN设备可以同时包括图16所示处理装置中的模块以及图17所示处理装置中的模块。即，OTN设备既可以作为业务发送方，也可以作为业务接收方。
图18为本公开实施例提供的一种电子设备的结构框图，如图18所示，该电子设备10可以为移动终端、计算机终端或者类似的运算装置。该电子设备10包括一个或多个处理器102(附图中仅示例出了一个，处理器102可以包括但不限于微处理器(Microprocessor Unit,简称是MPU)或可编程逻辑器件(Programmable logic device,简称是PLD)等的处理装置)和存储器104；其中，存储器104上存储有一个或多个程序，当一个或多个程序被一个或多个处理器102执行，使得一个或多个处理器实现前面实施例提供的处理方法中的步骤。
在一些实施例中，上述移动终端还可以包括设置为通信功能的传输设备106以及输入输出设备108。本领域普通技术人员可以理解，图18所示的结构仅为示意，其并不对上述移动终端的结构造成限定。例如，移动终端10还可包括比图18中所示更多或者更少的组件，或者具有与图18所示不同的配置。
存储器104可设置为存储计算机程序，例如，应用软件的软件程序以及模块，如本公开实施例中的光传送网中业务处理方法对应的计算机程序，处理器102通过运行存储在存储器104内的计算机程序，从而执行各种功能应用以及数据处理，即实现上述的方法。存储器104可包括高速随机存储器，还可包括非易失性存储器，如一个或者多个磁性存储装置、闪存、或者其他非易失性固态存储器。在一些实例中，存储器104可进一步包括相对于处理器102远程设置的存储器，这些远程存储器可以通过网络连接至移动终端10。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
传输装置106设置为经由一个网络接收或者发送数据。上述的网络具体实例可包括移动终端10的通信供应商提供的无线网络。在一个实例中，传输装置106包括一个网络适配器(Network Interface Controller，简称为 NIC)，其可通过基站与其他网络设备相连从而可与互联网进行通讯。在一个实例中，传输装置106可以为射频(Radio Frequency，简称为RF)模块，其设置为通过无线方式与互联网进行通讯。
本公开实施例还提供了一种计算机可读介质，其上存储有计算机程序，程序被处理器执行时实现前面实施例提供的处理方法中的步骤。
本领域普通技术人员可以理解，上文中所公开方法中的全部或某些步骤、系统、装置中的功能模块/单元可以被实施为软件、固件、硬件及其适当的组合。在硬件实施方式中，在以上描述中提及的功能模块/单元之间的划分不一定对应于物理组件的划分；例如，一个物理组件可以具有多个功能，或者一个功能或步骤可以由若干物理组件合作执行。某些物理组件或所有物理组件可以被实施为由处理器，如中央处理器、数字信号处理器或微处理器执行的软件，或者被实施为硬件，或者被实施为集成电路，如专用集成电路。这样的软件可以分布在计算机可读介质上，计算机可读介质可以包括计算机存储介质(或非暂时性介质)和通信介质(或暂时性介质)。如本领域普通技术人员公知的，术语计算机存储介质包括在设置为存储信息(诸如计算机可读指令、数据结构、程序模块或其它数据)的任何方法或技术中实施的易失性和非易失性、可移除和不可移除介质。计算机存储介质包括但不限于只读存储器(Read-Only Memory，简称为ROM)、随机存取存储器(Random Access Memory，简称为RAM)、带电可擦可编程只读存储器(Electrically Erasable Programmable Read-Only Memory,简称EEPROM)、闪存或其它存储器技术、光盘只读存储器(Compact Disc Read-Only Memory,简称CD-ROM)、数字多功能盘(Digital Video Disc,简称DVD)或其它光盘存储、磁盒、磁带、磁盘存储或其它磁存储装置、或者可以设置为存储期望的信息并且可以被计算机访问的任何其它的介质。此外，本领域普通技术人员公知的是，通信介质通常包含计算机可读指令、数据结构、程序模块或者诸如载波或其它传输机制之类的调制数据信号中的其它数据，并且可包括任何信息递送介质。
本文已经公开了示例实施例，并且虽然采用了具体术语，但它们仅用于并仅应当被解释为一般说明性含义，并且不用于限制的目的。在一些实 例中，对本领域技术人员显而易见的是，除非另外明确指出，否则可单独使用与特定实施例相结合描述的特征、特性和/或元素，或可与其它实施例相结合描述的特征、特性和/或元件组合使用。因此，本领域技术人员将理解，在不脱离由所附的权利要求阐明的本公开的范围的情况下，可进行各种形式和细节上的改变。

Claims (18)

  1. 一种光传送网中业务处理方法，包括：
    将客户业务映射到业务容器中；
    将所述业务容器映射到数据帧中，所述数据帧包括净荷单元，每个所述净荷单元均由具有固定长度的单元块组成，所述业务容器承载在所述单元块中。
  2. 根据权利要求1所述的方法，其中，所述单元块分为第一类型单元块和第二类型单元块，所述第一类型单元块包括净荷部分，所述第二类型单元块包括净荷部分和开销部分，所述净荷部分用于承载业务数据，所述开销部分包括业务容器的标识信息；
    针对任意一个所述净荷单元，该净荷单元由同一类型的单元块组成。
  3. 根据权利要求2所述的方法，其中，还包括：
    为每个所述净荷单元构建配置信息，所述配置信息包括：净荷单元所占用单元块的单元块类型、净荷单元的编号和净荷单元所占用单元块的单元块数量；
    将所述配置信息承载在所述数据帧的单元块中。
  4. 根据权利要求3所述的方法，其中，所述业务容器分为第一类型业务容器、第二类型业务容器和第三类型业务容器；
    所述第一类型业务容器为承载需要时钟透传的固定比特率业务的业务容器；
    所述第二类型业务容器为无需时钟透传的固定比特率业务的业务容器；
    所述第三类型业务容器为承载可变比特率业务的业务容器；
    所述第一类型业务容器承载于所述第一类型单元块中，所述第二类型业务容器和所述第二类型业务容器承载于所述第二类型单元块中。
  5. 根据权利要求4所述的方法，其中，全部所述第一类型业务容器划分为至少一个第一类型业务容器组，全部所述第二类型业务容器划分为至 少一个第二类型业务容器组，全部所述第三类型业务容器划分为至少一个第三类型业务容器组，每个所述第一类型业务容器组包括至少一个第一类型业务容器，每个所述第二类型业务容器组包括至少一个第二类型业务容器，每个所述第三类型业务容器组包括至少一个第三类型业务容器；
    每个所述第一类型业务容器组、所述第二类型业务容器组、所述第三类型业务容器组分别对应不同的一个净荷单元。
  6. 根据权利要求5所述的方法，其中，将所述业务容器映射到数据帧中的步骤包括：
    对全部所述第一类型业务容器组、所述第二类型业务容器组和所述第三类型业务容器组进行排序，得到处理序列；
    根据所述处理序列中的先后顺序，依次将各所述第一类型业务容器组、所述第二类型业务容器组以及所述第三类型业务容器组映射到所述数据帧的单元块中。
  7. 根据权利要求6所述的方法，其中，所述对全部所述第一类型业务容器组、所述第二类型业务容器组和所述第三类型业务容器组进行排序，得到处理序列的步骤包括：
    根据各所述第一类型业务容器组所承载业务的总带宽，按照总带宽由大至小的顺序对全部所述第一类型业务容器组进行排序，得到第一序列；
    根据各所述第二类型业务容器组所承载业务的总带宽，按照总带宽由大至小的顺序对全部所述第二类型业务容器组进行排序，得到第二序列；
    根据各所述第三类型业务容器组的最大分配带宽，按照最大分配带宽由大至小的顺序对全部所述第三类型业务容器组进行排序，得到第三序列；
    将所述第二序列连接于第一序列尾部，且将所述第三序列连接于第二序列的尾部，以得到所述处理序列；
    或者，根据各所述第一类型业务容器组的所承载业务的总带宽、各所述第二类型业务容器组的所承载业务的总带宽和各所述第三类型业务容 器组的最大分配带宽，按照带宽由大至小的顺序对全部所述第一类型业务容器组、所述第二类型业务容器组和所述第三类型业务容器组进行排序。
  8. 根据权利要求6所述的方法，其中，所述对全部所述第一类型业务容器组、所述第二类型业务容器组和所述第三类型业务容器组进行排序，得到处理序列的步骤包括：
    确定各所述第一类型业务容器组、所述第二类型业务容器组和所述第三类型业务容器组的时延优先级；
    按照时延优先级由高至低的顺序对全部所述第一类型业务容器组、所述第二类型业务容器组和所述第三类型业务容器组进行排序，以得到所述处理序列。
  9. 根据权利要求3所述的方法，其中，所述配置信息配置有校验信息，所述验信息用于对每个所述配置信息进行单独校验或者对所有配置信息进行整体校验。
  10. 根据权利要求1至7中任一所述的方法，其中，所述业务容器包括：ODU帧或OSU帧。
  11. 一种光传送网中业务处理方法，包括：
    获取数据帧，所述数据帧包括净荷单元，每个所述净荷单元均由具有固定长度的单元块组成，所述业务容器承载在所述单元块中，所述业务容器承载有客户业务；
    从所述数据帧的单元块中解映射出所述业务容器；
    从所述业务容器中获取所述客户业务。
  12. 根据权利要求11所述的方法，其中，所述从所述数据帧的单元块中解映射出所述业务容器的步骤包括：
    从净荷区域中获取配置信息，配置信息包括：净荷单元所占用单元块的单元块类型、净荷单元的编号和净荷单元所占用单元块的单元块数量；
    根据所述配置信息确定承载有业务容器的净荷单元的位置；
    从所确定净荷单元内的单元块中解映射出业务容器。
  13. 根据权利要求12所述的方法，其中，所述配置信息配置有校验信息；
    在所述根据所述配置信息确定承载有客户业务的净荷单元的位置的步骤之前，还包括：
    根据所述校验信息对每个所述配置信息进行单独校验或者对所有配置信息进行整体校验；
    当校验通过后，则继续执行所述根据所述配置信息确定承载有业务容器的净荷单元的位置的步骤。
  14. 根据权利要求13所述的方法，其中，当校验失败后，则获取前一次通过校验的配置信息，并根据前一次通过校验的配置信息确定承载有业务容器的净荷单元的位置。
  15. 一种光传送网中业务处理装置，包括：
    第一映射模块，设置为将客户业务映射到业务容器中；
    第二映射模块，设置为将所述业务容器映射到数据帧中，所述数据帧包括净荷单元，每个所述净荷单元均由具有固定长度的单元块组成，所述业务容器承载在所述单元块中。
  16. 一种光传送网中业务处理装置，包括：
    第一获取模块，设置为获取数据帧，所述数据帧包括净荷单元，每个所述净荷单元均由具有固定长度的单元块组成，所述业务容器承载在所述单元块中，所述业务容器承载有客户业务；
    解映射模块，设置为从所述数据帧的单元块中解映射出所述业务容器；
    第二获取模块，设置为从所述业务容器中获取所述客户业务。
  17. 一种电子设备，包括：
    一个或多个处理器；
    存储器，其上存储有一个或多个程序，当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现权利要求1至14中任一所述的方法。
  18. 一种计算机可读介质，其上存储有计算机程序，所述程序被处理器执行时实现权利要求1至14中任一所述的方法。
PCT/CN2021/077708 2020-02-28 2021-02-24 光传送网中业务处理方法、处理装置和电子设备 WO2021170002A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP21760280.4A EP4106233A4 (en) 2020-02-28 2021-02-24 SERVICE PROCESSING METHOD AND APPARATUS IN AN OPTICAL TRANSPORT NETWORK AND ELECTRONIC DEVICE
US17/907,838 US20230125984A1 (en) 2020-02-28 2021-02-24 Method and apparatus for service processing in optical transport network, and electronic device

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010126760.2 2020-02-28
CN202010126760.2A CN112511916A (zh) 2020-02-28 2020-02-28 光传送网中业务处理方法、处理装置和电子设备

Publications (1)

Publication Number Publication Date
WO2021170002A1 true WO2021170002A1 (zh) 2021-09-02

Family

ID=74953300

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/077708 WO2021170002A1 (zh) 2020-02-28 2021-02-24 光传送网中业务处理方法、处理装置和电子设备

Country Status (4)

Country Link
US (1) US20230125984A1 (zh)
EP (1) EP4106233A4 (zh)
CN (1) CN112511916A (zh)
WO (1) WO2021170002A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115242816B (zh) * 2022-07-20 2023-05-16 成都精灵云科技有限公司 基于fc设备的数据分发方法、装置、设备及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100158518A1 (en) * 2008-12-19 2010-06-24 Jong-Yoon Shin Multi-lane signal transmitting and receiving apparatuses
CN101771489A (zh) * 2009-01-06 2010-07-07 华为技术有限公司 不同类型业务统一传输的方法和系统、通信节点和服务器
CN101841749A (zh) * 2009-03-18 2010-09-22 华为技术有限公司 数据传输方法、通信装置及通信系统
CN109981209A (zh) * 2017-12-28 2019-07-05 中兴通讯股份有限公司 光传送网中业务发送、接收方法及装置

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100590997C (zh) * 2004-11-02 2010-02-17 华为技术有限公司 一种otn网络中业务复用的开销处理方法
CN101800912B (zh) * 2009-02-10 2016-08-10 华为技术有限公司 客户信号映射和解映射的实现方法及装置
WO2011075901A1 (zh) * 2009-12-24 2011-06-30 华为技术有限公司 通用映射规程gmp映射方法、解映射方法及装置
CN107566074B (zh) * 2016-06-30 2019-06-11 华为技术有限公司 光传送网中传送客户信号的方法及传送设备
ES2963355T3 (es) * 2018-05-10 2024-03-26 Huawei Tech Co Ltd Método para procesar datos de servicio de baja velocidad en red óptica de transporte, dispositivo y sistema

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100158518A1 (en) * 2008-12-19 2010-06-24 Jong-Yoon Shin Multi-lane signal transmitting and receiving apparatuses
CN101771489A (zh) * 2009-01-06 2010-07-07 华为技术有限公司 不同类型业务统一传输的方法和系统、通信节点和服务器
CN101841749A (zh) * 2009-03-18 2010-09-22 华为技术有限公司 数据传输方法、通信装置及通信系统
CN109981209A (zh) * 2017-12-28 2019-07-05 中兴通讯股份有限公司 光传送网中业务发送、接收方法及装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP4106233A4 *

Also Published As

Publication number Publication date
EP4106233A4 (en) 2024-03-27
EP4106233A1 (en) 2022-12-21
US20230125984A1 (en) 2023-04-27
CN112511916A (zh) 2021-03-16

Similar Documents

Publication Publication Date Title
WO2019128934A1 (zh) 光传送网中业务发送、接收方法及装置
WO2021169341A1 (zh) 光传送网中业务处理方法、处理装置和电子设备
WO2016197894A1 (zh) 一种数据处理的方法、通信设备及通信系统
US10440454B2 (en) Signal processing method, apparatus, and system
US10608766B2 (en) Multi-service transport and receiving method and apparatus
WO2021169323A1 (zh) 光传送网中业务处理方法、处理装置和电子设备
US20230135776A1 (en) Method and apparatus for service processing in optical transport network, and electronic device
WO2021190000A1 (zh) 光传送网中业务处理方法、处理装置和电子设备
WO2020034964A1 (zh) 客户业务数据传送方法、装置、光传送网设备及存储介质
WO2019223000A1 (zh) 传输数据的方法和装置
CN112865911A (zh) 客户业务承载方法及装置
WO2021170002A1 (zh) 光传送网中业务处理方法、处理装置和电子设备
CN112511917A (zh) 光传送网中业务处理方法、处理装置和电子设备
WO2023134508A1 (zh) 一种光传送网中的业务处理的方法、装置和系统
CN102098595B (zh) 一种光传送网中客户信号传送方法及相关设备
WO2023231764A1 (zh) 业务数据处理的方法和装置
WO2024045869A1 (zh) 一种数据传输方法和数据传输装置
CN117135498A (zh) 一种传输数据的方法和装置
CN117354159A (zh) 切片方法、业务处理方法、通信节点及存储介质
CN116418455A (zh) 分组信号的发送方法、装置、存储介质以及电子装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21760280

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2021760280

Country of ref document: EP

Effective date: 20220916

NENP Non-entry into the national phase

Ref country code: DE