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

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

Info

Publication number
WO2021190030A1
WO2021190030A1 PCT/CN2020/140282 CN2020140282W WO2021190030A1 WO 2021190030 A1 WO2021190030 A1 WO 2021190030A1 CN 2020140282 W CN2020140282 W CN 2020140282W WO 2021190030 A1 WO2021190030 A1 WO 2021190030A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
payload
service
service container
container
Prior art date
Application number
PCT/CN2020/140282
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 US17/914,790 priority Critical patent/US20230135776A1/en
Priority to KR1020227030303A priority patent/KR20220137695A/ko
Publication of WO2021190030A1 publication Critical patent/WO2021190030A1/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
    • H04Q11/0067—Provisions for optical access or distribution networks, e.g. Gigabit Ethernet Passive Optical Network (GE-PON), ATM-based Passive Optical Network (A-PON), PON-Ring
    • 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
    • H04J—MULTIPLEX COMMUNICATION
    • H04J3/00—Time-division multiplex systems
    • H04J3/02—Details
    • H04J3/06—Synchronising arrangements
    • H04J3/07—Synchronising arrangements using pulse stuffing for systems with different or fluctuating information rates or bit rates
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/90—Buffering arrangements
    • H04L49/9084—Reactions to storage capacity overflow
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J2203/00—Aspects of optical multiplex systems other than those covered by H04J14/05 and H04J14/07
    • H04J2203/0001—Provisions for broadband connections in integrated services digital network using frames of the Optical Transport Network [OTN] or using synchronous transfer mode [STM], e.g. SONET, SDH
    • H04J2203/0073—Services, e.g. multimedia, GOS, QOS
    • 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.
  • mapping methods from service containers to OTN payloads are defined, including: Bit-synchronous Mapping Procedure (BMP), asynchronous mapping Asynchronous Mapping Procedure (AMP), Generic Mapping Procedure (GMP), etc., among which GMP has no mandatory requirements for service container rate and service layer frame rate, and is the most widely used mapping solution.
  • BMP Bit-synchronous Mapping Procedure
  • AMP asynchronous mapping Asynchronous Mapping Procedure
  • GMP Generic Mapping Procedure
  • the service layer frame is composed of several fixed-length Payload Blocks (PB).
  • PB Payload Blocks
  • the service layer frame that carries the business container is determined according to the service container rate
  • the number of PBs included N and the number of PBs C occupied by the service container are then calculated according to the sigma-delta algorithm to calculate the distribution positions of the C PBs occupied by the service container in the N fixed-length blocks of the service layer frame.
  • the location for storing business container data in the service layer frame is a fixed location calculated according to the sigma-delta algorithm.
  • the location for storing business container data calculated in the service layer frame can normally fill the business container For data, it is necessary to allocate a larger buffer for each client's business, and a larger buffer means a larger delay.
  • the embodiments of the present disclosure provide a service processing method, processing device and electronic equipment in an optical transport network.
  • the embodiments of the present disclosure provide a service processing method in an optical transport network, which includes
  • the service container is mapped into an optical transport network frame, and the payload area of the optical transport network frame is composed of a payload block, the payload block includes an overhead part, and the overhead part includes an indication identifier, the indication identifier It is used to indicate that the data carried by the payload block is service container data or filling data.
  • multiple consecutive payload blocks serve as one transmission period
  • the step of mapping the service container to the optical transport network frame includes:
  • the service container is carried into the payload block at the determined distribution position.
  • the bandwidth of the payload block allocated to the service container is greater than the bandwidth of the service container.
  • the padding data rate adaptation is inserted, and the indicator is used to characterize the payload of the payload block.
  • the service container in one transmission cycle, for the payload block used to carry the service container, if the data volume of the service container data cached in the service container buffer area exceeds the size of one payload block, the service container The data is carried in the payload block; otherwise, the padding data is carried in the payload block.
  • N1*M payload blocks used to carry the service container constitute a service layer frame, and the payload block used to carry service container data in the service layer frame
  • the quantity is C;
  • M is a preset integer
  • floor() is a round-down function
  • v represents the service container rate
  • t represents the time corresponding to sending data of 1 transmission cycle
  • L represents the length of 1 payload block.
  • the step of carrying the service container to the payload block at the determined distribution position includes:
  • the data type actually carried by the N payload blocks of the service layer frame is determined.
  • the preset allocation algorithm includes: a sigma-delta algorithm.
  • the data actually carried by the N payload blocks of the service layer frame is determined according to the amount of data buffered by the service container and the data type expected to be carried by each of the N payload blocks of the service layer frame
  • the types of steps include:
  • the expected bearer of the payload block is service container data, it is determined whether the data volume of the service container data buffered in the service container cache exceeds The size of a payload block;
  • the data actually carried by the N payload blocks of the service layer frame is determined according to the amount of data buffered by the service container and the data type expected to be carried by each of the N payload blocks of the service layer frame Types of steps also include:
  • the actual load of the payload block is the service container data; otherwise, the actual load data of the payload block is determined To fill in data;
  • the preset threshold is greater than or equal to the size of one payload block.
  • the indication identifier occupies 1 bit
  • the indication identifier of the payload block that carries service container data is 1, and the indication identifier of the payload block that carries padding data is 0.
  • the method further includes:
  • the embodiments of the present disclosure also provide a service processing device in an optical transport network, which includes:
  • the first mapping module is set to map the customer business to the business container
  • the second mapping module is configured to map the service container to an optical transport network frame, the payload area of the optical transport network frame includes a plurality of payload blocks, the payload block includes an overhead part, and the overhead part It includes an indication identifier, which is used to indicate that the data carried by the payload block is service container data or padding data.
  • the device further includes
  • the first obtaining module is configured to obtain optical transport network frames and obtain data streams from the payload area of the optical transport network frames;
  • An extraction module configured to determine the payload block carrying service container data according to the indication identifier in each payload block in the data stream, and extract the service container data;
  • the second obtaining module is set to obtain customer services from the service container.
  • embodiments of the present disclosure also provide an electronic device, which includes:
  • One or more processors are One or more processors;
  • a memory having one or more programs stored thereon, and when the one or more programs are executed by the one or more processors, the one or more processors implement the method as provided in the first aspect .
  • 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 method provided in the first aspect is implemented.
  • Rate adaptation can be performed by inserting padding data.
  • the position of the payload block used to carry service container data in the payload area can be dynamically changed according to the service container rate. At this time, the size of the service container buffer area that needs to be set can be changed. Corresponding reduction is conducive to reducing the delay of the service mapping process.
  • FIG. 1 is a schematic diagram of an optical path frame structure involved in an embodiment of the disclosure
  • FIG. 2 is a flowchart of a service processing method in an optical transport network provided by an embodiment of the disclosure
  • FIG. 3 is a flow chart of a specific implementation of step S2 in an embodiment of the disclosure.
  • FIG. 4 is a flowchart of a specific implementation of step S203 in an embodiment of the disclosure.
  • FIG. 5 is a specific implementation flowchart of step S2032 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 transmission scenario corresponding to an example of the disclosure.
  • FIG. 8 is a schematic diagram of a service layer frame including 10 payload blocks in an embodiment of the disclosure.
  • FIG. 9 is a schematic diagram of the data type expected to be carried by each payload block in the service layer frame shown in FIG. 8;
  • FIG. 10 is a schematic diagram of the data types actually carried by each payload block in the service layer frame shown in FIG. 9;
  • FIG. 11 is a schematic structural diagram of a service processing device in an optical transport network provided by an embodiment of the disclosure.
  • FIG. 12 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) ) (Denoted as "OPUk overhead", k can take values 0, 1, 2, 2e, 3, 4).
  • OTUk overhead optical path transmission unit overhead
  • ODU optical channel digital unit
  • OPU optical channel payload unit
  • OPU optical channel Payload Unit
  • 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).
  • the payload area of the structure), the payload area can be used to carry service signals.
  • FIG. 2 is a flowchart of a service processing method in an optical transport network provided by an embodiment of the disclosure. As shown in FIG. 2, the service processing method in an optical transport network includes:
  • Step S 1 Map the customer service to the service container.
  • the customer service specifically refers to the service that belongs to the small-particle service for the optical transport network frame (generally also referred to as the Sub1G service).
  • 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 S2 The service container is mapped to the optical transport network frame.
  • the payload area of the optical transport network frame is composed of payload blocks.
  • the payload block includes an overhead part.
  • the overhead part includes an indicator.
  • the indicator is used to indicate the location of the payload block.
  • the bearer data is business container data or filling data.
  • PB refers to a certain number (greater than 1) of consecutive bits occupied in the payload area, and the payload block is used to carry customer services.
  • the overhead part has an indication identifier, by which the data carried by the payload block can be characterized as service container data or padding data. Due to the existence of the indicator, in the process of mapping the service container into the optical transport network frame, the rate adaptation can be performed by inserting padding data.
  • the payload block in the payload area is used to carry the data of the service container.
  • the location can be dynamically changed according to the service container rate. At this time, the size of the service container buffer area that needs to be set can be reduced accordingly, which is beneficial to reduce the delay of the service mapping process.
  • the indication identifier occupies 1 bit; the indication identifier of the payload block carrying service container data is 1, and the indication identifier of the payload block carrying padding data is 0.
  • the indication identifier occupies multiple bits (for example, 1 byte), the indication identifier in the data block carrying service container data is the tributary port number TPN of the customer service; the data block carrying padding data
  • the internal indicator is all 0s or all 1s.
  • the technical solution of the present disclosure does not limit the specific expression mode used to characterize the service container data and the filling data by using the indicator.
  • FIG 3 is a specific implementation flow chart of step S2 in the embodiments of the disclosure. As shown in Figure 3, in some embodiments, in the payload area of the optical transport network frame, multiple consecutive payload blocks are used as one Transmission cycle, at this time step S2 includes:
  • Step S201 According to the bandwidth of the service container and the bandwidth of the payload block, the number of payload blocks N1 that the service container needs to occupy in a transmission period is calculated.
  • Step S202 According to the number N1 of payload blocks that the service container needs to occupy in a transmission cycle, determine the distribution position of the payload blocks that the service container needs to occupy in the transmission cycle based on a preset allocation algorithm.
  • the preset allocation algorithm includes: a sigma-delta algorithm.
  • Step S203 Carry the service container into the payload block at the determined distribution position.
  • the bandwidth of the payload block allocated to the service container is greater than the bandwidth of the service container.
  • the padding data rate adaptation is inserted, and the indication identifier is used to indicate that the payload block bears the service container data or padding data.
  • the service container in one transmission cycle, for the payload block used to carry the service container, if the data volume of the service container data cached in the service container buffer area exceeds the size of one payload block, the service container The data is carried in the payload block; otherwise, the padding data is carried in the payload block.
  • N1*M payload blocks used to carry service containers constitute a service layer frame, and the number of payload blocks used to carry service container data in the service layer frame is C ;
  • M is a preset integer
  • floor() is a round-down function
  • v represents the service container rate
  • t represents the time corresponding to sending data of 1 transmission cycle
  • L represents the length of 1 payload block.
  • FIG. 4 is a specific implementation flow chart of step S203 in an embodiment of the disclosure. As shown in FIG. 4, in some embodiments, step S203 includes:
  • Step S2031 according to the actual number C of payload blocks occupied by the service container data in M transmission periods, determine the data type expected to be carried by each of the N payload blocks in the service layer frame based on a preset allocation algorithm.
  • the data type includes business container data or filling data.
  • the business container data refers to data related to the customer's business
  • the filling data is data preset for data filling (generally set to all 0s).
  • the preset allocation algorithm in step S2031 can be used to determine the distribution positions of C payload blocks used to carry service container data in the service layer frame, and the determined payload blocks at these positions are expected to carry data types as For service container data, the type of data expected to be carried by payload blocks in other locations is padding data.
  • the preset allocation algorithms used in step S202 and step S2031 are both the sigma-delta algorithm, and the specific operation process of the sigma-delta algorithm is a conventional technology in the field, and will not be repeated here.
  • Step S2032 according to the amount of data buffered by the service container and the data type expected to be carried by each of the N payload blocks of the service layer frame, determine the data type actually carried by the N payload blocks of the service layer frame.
  • the N payload blocks in the service layer frame may be determined based on the number of payload blocks C required by the service container data and the number of payload blocks contained in the service layer frame of the service container.
  • the type of data each expected to carry that is, it is preliminarily determined which data blocks (the number is C) of the N payload blocks are used to carry service container data, and which data blocks (the number is NC) are used to carry padding data. Then, according to the data type expected to be carried by each of the N payload blocks and the data volume of the service container data buffered in the service container cache, the final data type carried by each of the N payload blocks is determined.
  • FIG. 5 is a specific implementation flow chart of step S2032 in an embodiment of the present disclosure. As shown in Figure 5, the payload block is constantly arriving, when any one of the N payload blocks of the service layer frame arrives , Perform the following steps:
  • Step S20321 Identify whether the expected bearer of the payload block is service container data or filling data.
  • step S20322 is performed; if it is recognized that the expected bearer of the payload block is padding data, step S20323 is performed;
  • Step S20322 Determine whether the data volume of the service container data cached in the service container cache exceeds the size of one payload block.
  • step S20322 if it is determined whether the data volume of the service container data buffered in the service container cache exceeds the size of one payload block, step S20324 is executed; otherwise, step S20325 is executed.
  • Step S20323 Determine whether the data volume of the service container data cached in the service container cache exceeds a preset threshold.
  • the preset threshold is greater than or equal to the size of one payload block.
  • step S20323 if it is determined that the data volume of the service container data cached in the service container cache exceeds the preset threshold, step S20324 is executed; otherwise, step S20325 is executed.
  • Step S20324 Determine that the actual bearer of the payload block is service container data, and bear the service container data in the buffer to the payload block.
  • Step S20325 It is determined that the actual load of the payload block is padding data, and the padding data is carried to the payload block.
  • the service container can be mapped
  • the rate adaptation is performed by inserting padding data.
  • the position of the payload block used to carry the service container data in the payload area can be dynamically changed according to the service container rate.
  • the size of the set service container buffer area can be reduced correspondingly, which is beneficial to reduce the delay of the service mapping process.
  • 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 the optical transport network not only includes the above steps S1 and S2, but also includes step S3. ⁇ Step S5, only step S3 and step S5 will be described in detail below.
  • Step S3 Obtain the optical transport network frame, and obtain the data stream from the payload area of the optical transport network frame.
  • Step S4 Determine the payload block carrying the service container data according to the indicator in each payload block in the data stream, and extract the service container data.
  • Step S5 Obtain the customer service from the service container.
  • the data carried by the payload block is service container data or padding data; then, the corresponding data is extracted from the payload block carrying service container data.
  • the business container data can get the business container; finally, the customer business can be obtained from the obtained business container.
  • steps S1 and S2 are applied to the data sending side
  • steps S3 to S5 are applied to the data receiving side.
  • an optical transport network device can be used as the data sending side and the data receiving side.
  • FIG. 7 is a schematic diagram of the transmission scenario corresponding to the example of the disclosure
  • FIG. 8 is a schematic diagram of a service layer frame containing 10 payload blocks in an embodiment of the disclosure
  • FIG. 9 is the expectation of each payload block in the service layer frame shown in FIG. 8
  • Figure 10 is a schematic diagram of the data types actually carried by each payload block in the service layer frame shown in Figure 9.
  • two OTN devices communicate through the OTN interface.
  • the OTN frame is divided according to the payload block.
  • the service layer frame of the service container carrying the customer service is a part of the payload area of the OTN frame. It is assumed that the service layer frame carrying the OSU service container contains 10 data blocks, and it is calculated according to the service container rate that the OSU service container needs to occupy 8 payload blocks in the service layer frame to carry the service container data.
  • the specific process is as follows:
  • the service layer frame contains 10 payload blocks, each of which has a length of 256 bytes, the first byte of which is used as TPN, as shown in Figure 8.
  • TPN When TPN is all 0, it means that the payload block bears Filling data.
  • TPN When TPN is non-zero, it means that the payload block carries service container data (the figure shows an example when the TPN is 1 means that the payload block carries service container data).
  • the business container data needs to occupy 8 payload blocks.
  • the preliminary position of the 8 payload blocks occupied by the business container data in the service layer frame is calculated. That is, the solution satisfies the inequality: (j*8)mod 10 ⁇ 8 takes the value of j, and j is an integer between 1 and 10 (including 1 and 10); where (j*8)mod 10 means j and 8 Divide the product of by 10 to find the remainder.
  • the data type expected to be carried by the payload block at positions 2, 3, 4, 5, 7, 8, 9, and 10 is service container data, and the payload at positions 1, 6
  • the type of data that the block expects to carry is padding data.
  • Allocate a buffer area for the business container is 600 bytes, and the configured preset threshold is 512 bytes.
  • the data type carried by the expected value here is padding data; assuming that the business container data in the buffer does not exceed the preset threshold, it is determined
  • the actual data type carried by the payload block is padding data.
  • the padding data is carried in the 255 bytes of the first payload block in the service layer frame, and the TPN number is set to 0.
  • the data type carried by the expected value here is business container data; assuming that the business container data in the buffer exceeds the size of one payload block, it is determined
  • the actual data type carried by the payload block is service container data, and the service container data in the buffer area is carried in the 255 bytes of the second payload block in the service layer frame, and the TPN number is set to 1.
  • the data type carried by the expected value here is business container data; assuming that the business container data in the buffer area exceeds the size of one payload block, it is determined
  • the actual data type carried by the payload block is service container data, and the service container data in the buffer area is carried in the 255 bytes of the third payload block in the service layer frame, and the TPN number is set to 1.
  • the data type carried by the expected value here is business container data; assuming that the business container data in the buffer exceeds the size of 1 payload block, it is determined
  • the actual data type carried by the payload block is service container data, and the service container data in the buffer area is carried in the 255 bytes of the fourth payload block in the service layer frame, and the TPN number is set to 1. .
  • the data type carried by the expected value here is business container data; assuming that the business container data in the buffer area exceeds the size of 1 payload block, it is determined
  • the actual data type carried by the payload block is service container data, and the service container data in the buffer area is carried in the 255 bytes of the fifth payload block in the service layer frame, and the TPN number is set to 1.
  • the data type carried by the expected value here is padding data; assuming that the business container data in the buffer exceeds the preset threshold, the payload block is determined
  • the actual data type carried by is the service container data, and the service container data in the buffer area is carried in the 255 bytes in the 6th payload block in the service layer frame, and the TPN number is set to 1.
  • the data type carried by the expected value here is business container data; assuming that the business container data in the buffer area exceeds the size of 1 payload block, it is determined
  • the actual data type carried by the payload block is business container data.
  • the business container data in the buffer area is carried in the 255 bytes of the seventh payload block in the service layer frame, and the TPN number is set to 1.
  • the data type carried by the expected value here is business container data; assuming that the business container data in the buffer does not exceed the size of one payload block, it is determined
  • the actual data type carried by the payload block is padding data, and the padding data is carried in the 255 bytes in the 8th payload block in the service layer frame, and the TPN number is set to 0.
  • the data type carried by the expected value here is business container data; assuming that the business container data in the buffer area exceeds the size of 1 payload block, it is determined
  • the actual data type carried by the payload block is service container data.
  • the service container data in the buffer area is carried in the 255 bytes of the 9th payload block in the service layer frame, and the TPN number is set to 1.
  • the data type carried by the expected value here is business container data; assuming that the business container data in the buffer exceeds the size of 1 payload block, it is determined
  • the actual data type carried by the payload block is service container data.
  • the service container data in the buffer area is carried in the 255 bytes of the 10th payload block in the service layer frame, and the TPN number is set to 1.
  • the first and sixth payload blocks in the original service layer frame carry the filling data.
  • the first and eighth payload blocks carry Fill data
  • the sixth payload block carries service container data.
  • the corresponding service layer frame is obtained from the OTN frame, the service container data and padding data are identified according to the TPN number of the payload block in the service layer frame, and the service container data is extracted from the corresponding payload block.
  • the business container and demap the business container to obtain the customer service.
  • FIG. 11 is a schematic structural diagram of a service processing device in an optical transport network provided by an embodiment of the disclosure. As shown in FIG. 11, the service processing device can be used to implement the service processing method provided in the previous embodiment, and the service processing device includes: The first mapping module and the second mapping module.
  • 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 optical transport network frame.
  • the payload area of the optical transport network frame includes multiple payload blocks.
  • the load block includes an overhead part, and the overhead part includes an indication identifier.
  • the indication identifier is used to indicate that the data carried by the payload block is service container data or padding data.
  • the service processing apparatus further includes: a first acquisition module, an extraction module, and a second acquisition module.
  • the first obtaining module is configured to obtain the optical transport network frame, and obtain the data stream from the payload area of the optical transport network frame.
  • the extraction module is configured to determine the payload block that carries the service container data according to the indicator in each payload block in the data stream, and extract the service container data.
  • the second obtaining module is configured to obtain customer services from the service container.
  • FIG. 12 is a structural block diagram of an electronic device provided by an embodiment of the present 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, and the processor 102 may include, but is not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA) and a memory 104; wherein One or more programs are stored in the memory 104.
  • the one or more processors implement the steps in the processing methods provided in the previous embodiments.
  • the above-mentioned mobile terminal may further include a transmission device 106 and an input/output device 108 for communication functions.
  • a transmission device 106 may further include a transmission device 106 and an input/output device 108 for communication functions.
  • the structure shown in FIG. 12 is only for illustration, and it 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. 12, or have a different configuration from that shown in FIG.
  • the memory 104 may be used 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 programs stored in the memory 104 , So as to perform various functional applications and data processing, that is, to achieve the above 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 used to receive or send 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 used 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 non-volatile memory implemented in any method or technology for storing 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 RAM, ROM, EEPROM, flash memory or other memory technologies, CD-ROM, digital versatile disk (DVD) or other optical disk storage, magnetic cassettes, tapes, magnetic disk storage or other magnetic storage devices, or Any other medium used 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. .
  • Rate adaptation can be performed by inserting padding data.
  • the position of the payload block used to carry service container data in the payload area can be dynamically changed according to the service container rate. At this time, the size of the service container buffer area that needs to be set can be changed. Corresponding reduction is conducive to reducing the delay of the service mapping process.

Landscapes

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

Abstract

本公开实施例提供了一种光传送网中业务处理方法，其中，包括：将客户业务映射到业务容器中；将所述业务容器映射到光传送网帧中，所述光传送网帧的净荷区域由净荷块组成，所述净荷块包括开销部分，所述开销部分包括指示标识，所述指示标识用于表示所述净荷块所承载数据为业务容器数据或填充数据。本公开实施例还提供了一种光传送网中业务处理装置、电子设备和计算机可读介质。

Description

光传送网中业务处理方法、处理装置和电子设备 技术领域
本公开实施例涉及光通信技术领域，特别涉及一种光传送网中业务处理方法、处理装置、电子设备和计算机可读介质。
背景技术
在相关光传送网(Optical Transport Network，简称OTN)的中，定义了许多种业务容器到OTN净荷中的映射方法，包括：比特同步映射规程(Bit-synchronous Mapping Procedure，简称BMP)、异步映射规程(Asynchronous Mapping Procedure，简称AMP)、通用映射规程(Generic Mapping Procedure，简称GMP)等，其中GMP对于业务容器速率和服务层帧速率没有强制要求，是一种使用最广泛的映射方案。
在GMP映射过程中，服务层帧由若干个固定长度的净荷块(Payload Block，简称PB)组成，业务容器到服务层帧映射时，会根据业务容器速率确定承载该业务容器的服务层帧包含的PB数量N，以及该业务容器所占用的PB数量C，然后根据sigma-delta算法计算出业务容器占用的C个PB在服务层帧N个固定长度块的分布位置。
在进行GMP映射时，服务层帧中存放业务容器数据的位置是按照sigma-delta算法计算出来的固定位置，为了保证在服务层帧中计算出用于存放业务容器数据的位置能够正常填充业务容器数据，需要为每个客户业务分配一个较大的缓存，大缓存意味着较大的时延。
发明内容
本公开实施例提供了一种光传送网中业务处理方法、处理装置和电子设备。
第一方面，本公开实施例提供了一种光传送网中业务处理方法， 其中，包括
将客户业务映射到业务容器中；
将所述业务容器映射到光传送网帧中，所述光传送网帧的净荷区域由净荷块组成，所述净荷块包括开销部分，所述开销部分包括指示标识，所述指示标识用于表示所述净荷块所承载数据为业务容器数据或填充数据。
在一些实施例中，在所述光传送网帧的净荷区域中，多个连续的净荷块作为一个传送周期；
将所述业务容器映射到光传送网帧中的步骤包括：
根据所述业务容器的带宽以及净荷块的带宽计算出所述业务容器在一个传送周期所需占用的净荷块数量N1；
根据所述业务容器在一个传送周期所需占用的净荷块数量N1，基于预设分配算法确定所述业务容器所需占用的净荷块在所述传送周期中的分布位置；
将所述业务容器承载至所确定分布位置处的净荷块中。
在一些实施例中，为业务容器分配的净荷块带宽大于业务容器带宽，在将所述业务容器映射到净荷块时，插入填充数据速率适配，采用指示标识表征净荷块承载的为业务容器数据或填充数据。
在一些实施例中，在1个传送周期，对于用于承载该业务容器的净荷块，若业务容器缓存区所缓存的业务容器数据的数据量超过一个净荷块的大小，则将业务容器数据承载在该净荷块中；反之，则将填充数据承载在该净荷块中。
在一些实施例中，在M个传送周期，用于承载所述业务容器的N1*M个净荷块构成一个服务层帧，在所述服务层帧中用于承载业务容器数据的净荷块的数量为C；
Figure PCTCN2020140282-appb-000001
其中，M为预设的整数，floor()为向下取整函数，v表示业务容器速率，t表示发送1个传送周期的数据所对应的时长，L表示1个净荷块的长度。
在一些实施例中，将所述业务容器承载至所确定分布位置处的净荷块中步骤包括：
根据业务容器数据在M个传送周期所需占用的净荷块数量C，基于预设分配算法确定所述服务层帧N个净荷块各自期望承载的数据类型，N＝N1*M，所述数据类型包括业务容器数据或填充数据；
根据业务容器缓存的数据量以及所述服务层帧的N个净荷块各自期望承载的数据类型，确定所述服务层帧的N个净荷块实际承载的数据类型。
在一些实施例中，所述预设分配算法包括：sigma-delta算法。
在一些实施例中，所述根据业务容器缓存的数据量以及所述服务层帧的N个净荷块各自期望承载的数据类型，确定所述服务层帧的N个净荷块实际承载的数据类型的步骤包括：
针对所述服务层帧的N个净荷块中的任意一个净荷块，若该净荷块的期望承载为业务容器数据，判断所述业务容器缓存中所缓存业务容器数据的数据量是否超过1个净荷块的大小；
若判断出所述业务容器缓存中所缓存业务容器数据的数据量大于1个净荷块的大小，确定出该净荷块的实际承载为业务容器数据；反之，确定出该净荷块的实际承载为填充数据；
在一些实施例中，所述根据业务容器缓存的数据量以及所述服务层帧的N个净荷块各自期望承载的数据类型，确定所述服务层帧的N个净荷块实际承载的数据类型的步骤，还包括：
针对所述服务层帧的N个净荷块中的任意一个净荷块，若该净荷块的期望承载为填充数据，判断所述业务容器缓存中所缓存业务容器数据的数据量是否超过预设阈值；
若判断出所述业务容器缓存中所缓存业务容器数据的数据量超过所述预设阈值，确定出该净荷块的实际承载为业务容器数据；反之，确定出该净荷块的实际承载数据为填充数据；
其中，所述预设阈值大于或等于1个净荷块的大小。
在一些实施例中，所述指示标识占用1比特；
承载有业务容器数据的净荷块的指示标识为1，承载有填充数据 的净荷块的指示标识为0。
在一些实施例中，所述方法还包括：
获取光传送网帧，并从所述光传送网帧的净荷区域获取数据流；
根据所述数据流中各净荷块内的所述指示标识确定承载有业务容器数据的净荷块，并提取出业务容器数据；
从业务容器中获取客户业务。
第二方面，本公开实施例还提供了一种光传送网中业务处理装置，其中，包括：
第一映射模块，设置为将客户业务映射到业务容器中；
第二映射模块，设置为将所述业务容器映射到光传送网帧中，所述光传送网帧的净荷区域包括多个净荷块，所述净荷块包括开销部分，所述开销部分包括指示标识，所述指示标识用于表示所述净荷块所承载数据为业务容器数据或填充数据。
在一些实施例中，所述装置还包括
第一获取模块，设置为获取光传送网帧，并从所述光传送网帧的净荷区域获取数据流；
提取模块，设置为根据所述数据流中各净荷块内的所述指示标识确定承载有业务容器数据的净荷块，并提取出业务容器数据；
第二获取模块，设置为从业务容器中获取客户业务。
第三方面，本公开实施例还提供了一种电子设备，其中，包括：
一个或多个处理器；
存储器，其上存储有一个或多个程序，当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现如第一方面提供的所述方法。
第四方面，本公开实施例还提供了一种计算机可读介质，其上存储有计算机程序，所述程序被处理器执行时实现如第一方面提供的所述方法。
本公开实施例的技术方案，通过在净荷块中设置指示标识，以表示净荷块所承载数据为业务容器数据或填充数据，使得在将业务容器映射至光传送网帧内的过程中，可通过插入填充数据的方式进行速 率适配，净荷区域内用于承载业务容器数据的净荷块的位置可根据业务容器速率进行动态变化，此时所需要设置的业务容器缓存区的大小可相应减小，有利于降低业务映射过程的时延。
附图说明
图1为本公开实施例中涉及到的光通路帧结构的示意图；
图2为本公开实施例提供的一种光传送网中业务处理方法的流程图；
图3为本公开实施例中步骤S2的一种具体实现流程图；
图4为本公开实施例中步骤S203的一种具体实现流程图；
图5为本公开实施例中步骤S2032的一种具体实现流程图；
图6为本公开实施例提供的另一种光传送网中业务处理方法的流程图；
图7为本公开示例所对应的传输场景示意图；
图8为本公开实施例中一个服务层帧包含10个净荷块的示意图；
图9为图8所示服务层帧中各净荷块期望承载的数据类型的示意图；
图10为图9所示服务层帧中各净荷块实际承载的数据类型的示意图；
图11为本公开实施例提供的一种光传送网中业务处理装置的结构示意图；
图12为本公开实施例提供的一种电子设备的结构框图。
具体实施方式
为使本领域的技术人员更好地理解本发明的技术方案，下面结合附图对本发明实施例提供的一种光传送网中业务处理方法、处理装置、电子设备和计算机可读介质进行详细描述。
在下文中将参考附图更充分地描述示例实施例，但是所述示例实施例可以以不同形式来体现且不应当被解释为限于本文阐述的实施例。反之，提供这些实施例的目的在于使本公开透彻和完整，并将 使本领域技术人员充分理解本公开的范围。
在不冲突的情况下，本公开各实施例及实施例中的各特征可相互组合。
如本文所使用的，术语“和/或”包括一个或多个相关列举条目的任何和所有组合。
本文所使用的术语仅用于描述特定实施例，且不意欲限制本公开。如本文所使用的，单数形式“一个”和“该”也意欲包括复数形式，除非上下文另外清楚指出。还将理解的是，当本说明书中使用术语“包括”和/或“由……制成”时，指定存在所述特征、整体、步骤、操作、元件和/或组件，但不排除存在或添加一个或多个其它特征、整体、步骤、操作、元件、组件和/或其群组。
除非另外限定，否则本文所用的所有术语(包括技术和科学术语)的含义与本领域普通技术人员通常理解的含义相同。还将理解，诸如那些在常用字典中限定的那些术语应当被解释为具有与其在相关技术以及本公开的背景下的含义一致的含义，且将不解释为具有理想化或过度形式上的含义，除非本文明确如此限定。
图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)和光通道净荷单元(Opt ical channel Payload Unit，简称OPU)的开销(记为“OPUk开销”，k可取值0，1，2，2e，3，4)。OTUk帧中去掉OTUk开销后剩下的部分叫做ODUk帧，ODUk帧中去掉ODUk开销后剩下的部分叫OPUk帧，OPUk帧去掉OPUk开销后剩下的部分叫OPUk净荷(即，光通路帧结构的净荷区域)，净荷区域可用来承载业务信号。
图2为本公开实施例提供的一种光传送网中业务处理方法的流程图，如图2所示，该光传送网中业务处理方法包括：
步骤S 1、将客户业务映射到业务容器中。
在本公开实施例中，客户业务具体是指对于光传送网帧而言属于小颗粒业务的业务(一般也称为Sub1G业务)。具体地，客户业务的带宽与光传送网帧的净荷区域的带宽之比小于预设占比，该预设占比具体取值是由行业专业人员来设定。一般而言，该预设占比的取值小于或等于10％。在本公开实施例中，仅需保证客户业务的带宽小于光传送网帧的净荷区域的带宽即可。
在本公开实施例中，业务容器包括：ODU帧或光服务层单元(Optical Service Unit，简称OSU)帧。将客户业务映射到业务容器的过程属于本领域的常规技术，此处不再赘述。
步骤S2、将业务容器映射到光传送网帧中，光传送网帧的净荷区域由净荷块组成，净荷块包括开销部分，开销部分包括指示标识，指示标识用于表示净荷块所承载数据为业务容器数据或填充数据。
其中，PB是指净荷区域内占用一定数量(大于1)的连续比特，净荷块用于承载客户业务。
在本公开实施例中，通过在净荷块内设置开销部分，开销部分具有指示标识，通过该指示标识可表征净荷块所承载数据为业务容器数据或填充数据。由于该指示标识的存在，使得在将业务容器映射至光传送网帧内的过程中，可通过插入填充数据的方式进行速率适配，净荷区域内用于承载业务容器数据的净荷块的位置可根据业务容器速率进行动态变化，此时所需要设置的业务容器缓存区的大小可相应减小，有利于降低业务映射过程的时延。
在一些实施例中，指示标识占用1比特；承载有业务容器数据的净荷块的指示标识为1，承载有填充数据的净荷块的指示标识为0。
在一些实施例中，指示标识占用多个比特(例如1字节)，承载有业务容器数据的数据块内的指示标识为所述客户业务的支路端口号TPN；承载有填充数据的数据块内指示标识为全0或全1。
本公开的技术方案对利用指示标识来表征业务容器数据和填充数据，所采用的具体表示方式不作限定。
图3为本公开实施例中步骤S2的一种具体实现流程图，如图3 所示，在一些实施例中，在光传送网帧的净荷区域中，多个连续的净荷块作为一个传送周期，此时步骤S2包括：
步骤S201、根据业务容器的带宽以及净荷块的带宽计算出业务容器在一个传送周期所需占用的净荷块数量N1。
步骤S202、根据业务容器在一个传送周期所需占用的净荷块数量N1，基于预设分配算法确定业务容器所需占用的净荷块在传送周期中的分布位置。
在一些实施例中，预设分配算法包括：sigma-delta算法。
步骤S203、将业务容器承载至所确定分布位置处的净荷块中。
其中，为业务容器分配净荷块带宽大于业务容器带宽，在将业务容器映射到净荷块时，插入填充数据速率适配，采用指示标识表征净荷块承载的为业务容器数据或填充数据。
在一些实施例中，在1个传送周期，对于用于承载该业务容器的净荷块，若业务容器缓存区所缓存的业务容器数据的数据量超过一个净荷块的大小，则将业务容器数据承载在该净荷块中；反之，则将填充数据承载在该净荷块中。
在一些实施例中，在M个传送周期，用于承载业务容器的N1*M个净荷块构成一个服务层帧，在服务层帧中用于承载业务容器数据的净荷块的数量为C；
Figure PCTCN2020140282-appb-000002
其中，M为预设的整数，floor()为向下取整函数，v表示业务容器速率，t表示发送1个传送周期的数据所对应的时长，L表示1个净荷块的长度。
图4为本公开实施例中步骤S203的一种具体实现流程图，如图4所示，在一些实施例中，步骤S203包括：
步骤S2031、根据业务容器数据在M个传送周期实际所需占用的净荷块数量C，基于预设分配算法确定服务层帧中N个净荷块各自期望承载的数据类型。
在本公开实施例中，数据类型包括业务容器数据或填充数据。 其中，业务容器数据是指与客户业务相关的数据，填充数据是预先设置用于进行数据填充的数据(一般设置为全0)。
其中，在M个传送周期内，业务容器所需占用的净荷块数量为N1*M，即该业务容器所对应的服务层帧所包含的净荷块数量N＝N1*M。
在步骤S2031中的预设分配算法可用于确定用于承载业务容器数据的C个净荷块在服务层帧中的分布位置，所确定出的这些位置处的净荷块期望承载的数据类型为业务容器数据，其他位置处的净荷块期望承载的数据类型为填充数据。
在一些实施例中，步骤S202和步骤S2031所使用的预设分配算法均为sigma-delta算法，sigma-delta算法的具体运算过程为本领域的常规技术，此处不再赘述。
步骤S2032、根据业务容器缓存的数据量以及服务层帧的N个净荷块各自期望承载的数据类型，确定服务层帧的N个净荷块实际承载的数据类型。
在本公开实施例中，可先基于业务容器数据所需占用的净荷块数量C和该业务容器的服务层帧所包含的净荷块数量N，来确定服务层帧中N个净荷块各自所期望承载的数据类型，即初步确定N个净荷块中哪些数据块(数量为C个)用于承载业务容器数据，哪些数据块(数量为N-C个)用于承载填充数据。然后，根据N个净荷块各自期望承载的数据类型以及业务容器缓存中所缓存的业务容器数据的数据量，来确定N个净荷块各自最终承载的数据类型。
图5为本公开实施例中步骤S2032的一种具体实现流程图，如图5所示，净荷块是不断到达的，当服务层帧的N个净荷块中任意一个净荷块到来时，均执行下述步骤：
步骤S20321、识别该净荷块的期望承载为业务容器数据还是填充数据。
其中，若识别出该净荷块的期望承载为业务容器数据，则执行步骤S20322；若识别出该净荷块的期望承载为填充数据，则执行步骤S20323；
步骤S20322、判断业务容器缓存中所缓存业务容器数据的数据 量是否超过1个净荷块的大小。
在步骤S20322中，若判断出业务容器缓存中所缓存业务容器数据的数据量是否超过1个净荷块的大小，则执行步骤S20324；否则，执行步骤S20325。
步骤S20323、判断业务容器缓存中所缓存业务容器数据的数据量是否超过预设阈值。
其中，预设阈值大于或等于1个净荷块的大小。
在步骤S20323中，若判断出业务容器缓存中所缓存业务容器数据的数据量超过预设阈值，则执行步骤S20324；否则，执行步骤S20325。
步骤S20324、确定该净荷块的实际承载为业务容器数据，并将缓存中的业务容器数据承载至该净荷块。
步骤S20325、确定该净荷块的实际承载为填充数据，并将填充数据承载至该净荷块。
在本公开实施例提供的光传送网中业务处理方法，通过在净荷块内设置指示标识，以指示净荷块所承载的数据类型为业务容器数据或填充数据，可使得在将业务容器映射至光传送网帧内的过程中，通过插入填充数据的方式进行速率适配，净荷区域内用于承载业务容器数据的净荷块的位置可根据业务容器速率进行动态变化，此时所需要设置的业务容器缓存区的大小可相应减小，有利于降低业务映射过程的时延。
图6为本公开实施例提供的另一种光传送网中业务处理方法的流程图，如图6所示，该光传送网中业务处理方法不但包括上述步骤S1和步骤S2，还包括步骤S3～步骤S5，下面仅对步骤S3和步骤S5进行详细描述。
步骤S3、获取光传送网帧，并从光传送网帧的净荷区域获取数据流。
步骤S4、根据数据流中各净荷块内指示标识确定承载有业务容器数据的净荷块，并提取出业务容器数据。
步骤S5、从业务容器中获取客户业务。
首先，通过对各净荷块内指示标识的识别，即可确定出该净荷块所承载数据为业务容器数据或填充数据；然后，从承载有业务容器数据的净荷块中提取出相应的业务容器数据，可得到业务容器；最后，所得到的业务容器中获取客户业务。
需要说明的是，步骤S1和步骤S2应用于数据发送侧，步骤S3～步骤S5应用于数据接收侧。在实际应用中，一个光传送网设备，其既可以作为数据发送侧，也可以作为数据接收侧。
下面将结合具体示例进行详细描述。
图7为本公开示例所对应的传输场景示意图，图8为本公开实施例中一个服务层帧包含10个净荷块的示意图，图9为图8所示服务层帧中各净荷块期望承载的数据类型的示意图，图10为图9所示服务层帧中各净荷块实际承载的数据类型的示意图，如图7至图10所示，两个OTN设备通之间通过OTN接口传送1个客户业务，OTN帧按照净荷块块进行划分，该承载有该客户业务的业务容器的服务层帧为OTN帧的净荷区域的一部分。其中，假定承载该OSU业务容器的服务层帧包含10个数据块，且根据业务容器速率计算出该OSU业务容器在服务层帧中需占用8个净荷块来承载业务容器数据。具体过程如下：
1)服务层帧中包含10个净荷块，每个净荷块长度为256字节，其中第一个字节用作TPN，参见图8所示，TPN为全0时表示净荷块承载填充数据，TPN为非0时表示净荷块承载业务容器数据(图中示例性给出了TPN为1时表示净荷块承载业务容器数据)。
2)业务容器数据需要占用8个净荷块，根据sigma-delta算法计算业务容器数据占用的8个净荷块在服务层帧中的初步位置。即，求解满足式不等式：(j*8)mod 10<8的j取值，j为1～10之间的整数(包括1和10)；其中，(j*8)mod 10表示j与8的乘积除以10的结果求余数。
通过计算可得知当j＝2,3,4,5,7,8,9,10时满足条件，即业务容器数据在服务层帧的期望位置为2,3,4,5,7,8,9,10。参见图9所示，位于第2、3、4、5、7、8、9、10个位置处净荷块期望承载的数据类型为业务容器数据，位于第1、6个位置处的净荷块期望承载的数据 类型为填充数据。
3)为业务容器分配一个缓存区，缓存区大小为600字节，配置预设阈值为512个字节。
4)在服务层帧中第1个净荷块，根据sigma-delta算法，此处期望值承载的数据类型为填充数据；假定，缓存区里的业务容器数据未超过预设阈值，则确定出该净荷块的实际承载的数据类型为填充数据，将填充数据承载在服务层帧中第1个净荷块中的255字节中，同时TPN编号设为0。
在服务层帧中第2个净荷块，根据sigma-delta算法，此处期望值承载的数据类型为业务容器数据；假定，缓存区里的业务容器数据超过1个净荷块的大小，则确定出该净荷块的实际承载的数据类型为业务容器数据，将缓存区内的业务容器数据承载在服务层帧中第2个净荷块中的255字节中，同时TPN编号设为1。
在服务层帧中第3个净荷块，根据sigma-delta算法，此处期望值承载的数据类型为业务容器数据；假定，缓存区里的业务容器数据超过1个净荷块的大小，则确定出该净荷块的实际承载的数据类型为业务容器数据，将缓存区内的业务容器数据承载在服务层帧中第3个净荷块中的255字节中，同时TPN编号设为1。
在服务层帧中第4个净荷块，根据sigma-delta算法，此处期望值承载的数据类型为业务容器数据；假定，缓存区里的业务容器数据超过1个净荷块的大小，则确定出该净荷块的实际承载的数据类型为业务容器数据，将缓存区内的业务容器数据承载在服务层帧中第4个净荷块中的255字节中，同时TPN编号设为1。。
在服务层帧中第5个净荷块，根据sigma-delta算法，此处期望值承载的数据类型为业务容器数据；假定，缓存区里的业务容器数据超过1个净荷块的大小，则确定出该净荷块的实际承载的数据类型为业务容器数据，将缓存区内的业务容器数据承载在服务层帧中第5个净荷块中的255字节中，同时TPN编号设为1。
在服务层帧中第6个净荷块，根据sigma-delta算法，此处期望值承载的数据类型为填充数据；假定，缓存区里的业务容器数据超 过预设阈值，则确定出该净荷块的实际承载的数据类型为业务容器数据，将缓存区内的业务容器数据承载在服务层帧中第6个净荷块中的255字节中，同时TPN编号设为1。
在服务层帧第7个净荷块，根据sigma-delta算法，此处期望值承载的数据类型为业务容器数据；假定，缓存区里的业务容器数据超过1个净荷块的大小，则确定出该净荷块的实际承载的数据类型为业务容器数据，将缓存区内的业务容器数据承载在服务层帧中第7个净荷块中的255字节中，同时TPN编号设为1。
在服务层帧中第8个净荷块，根据sigma-delta算法，此处期望值承载的数据类型为业务容器数据；假定缓存区里的业务容器数据未超过1个净荷块的大小，则确定出该净荷块的实际承载的数据类型为填充数据，将填充数据承载在服务层帧中第8个净荷块中的255字节中，同时TPN编号设为0。
在服务层帧第9个净荷块，根据sigma-delta算法，此处期望值承载的数据类型为业务容器数据；假定，缓存区里的业务容器数据超过1个净荷块的大小，则确定出该净荷块的实际承载的数据类型为业务容器数据，将缓存区内的业务容器数据承载在服务层帧中第9个净荷块中的255字节中，同时TPN编号设为1。
在服务层帧第10个净荷块，根据sigma-delta算法，此处期望值承载的数据类型为业务容器数据；假定，缓存区里的业务容器数据超过1个净荷块的大小，则确定出该净荷块的实际承载的数据类型为业务容器数据，将缓存区内的业务容器数据承载在服务层帧中第10个净荷块中的255字节中，同时TPN编号设为1。
通过上述内容可见，原本服务层帧中第1个和第6个净荷块承载填充数据，根据缓存区内业务容器数据的数据流进行灵活调整后，第1个和第8个净荷块承载填充数据，而第6个净荷块承载业务容器数据，具体可参见图10中所示。
5)将服务层帧承载到OTN帧结构中，并发送OTN帧。
6)在接收侧，从OTN帧获取到相应的服务层帧，根据服务层帧中净荷块的TPN号进行业务容器数据与填充数据的识别，从相应净荷 块中提取出业务容器数据，得到业务容器，并对业务容器进行解映射，得到客户业务。
图11为本公开实施例提供的一种光传送网中业务处理装置的结构示意图，如图11所示，该业务处理装置可用于实现前面实施例提供的业务处理方法，该业务处理装置包括：第一映射模块和第二映射模块。
其中，第一映射模块设置为将客户业务映射到业务容器中；第二映射模块设置为将业务容器映射到光传送网帧中，光传送网帧的净荷区域包括多个净荷块，净荷块包括开销部分，开销部分包括指示标识，指示标识用于表示净荷块所承载数据为业务容器数据或填充数据。
在一些实施例中，该业务处理装置还包括：第一获取模块、提取模块和第二获取模块。
其中，第一获取模块设置为获取光传送网帧，并从光传送网帧的净荷区域获取数据流。
提取模块设置为根据数据流中各净荷块内的指示标识确定承载有业务容器数据的净荷块，并提取出业务容器数据。
第二获取模块设置为从业务容器中获取客户业务。
对于上述各模块的具体描述，可参见前面实施例中的相应内容，此处不再赘述。
图12为本公开实施例提供的一种电子设备的结构框图，如图12所示，该电子设备10可以为移动终端、计算机终端或者类似的运算装置。该电子设备10包括一个或多个处理器102(附图中仅示例出了一个，处理器102可以包括但不限于微处理器MCU或可编程逻辑器件FPGA等的处理装置)和存储器104；其中，存储器104上存储有一个或多个程序，当一个或多个程序被一个或多个处理器102执行，使得一个或多个处理器实现前面实施例提供的处理方法中的步骤。
在一些实施例中，上述移动终端还可以包括用于通信功能的传输设备106以及输入输出设备108。本领域普通技术人员可以理解，图12所示的结构仅为示意，其并不对上述移动终端的结构造成限定。例如，移动终 端10还可包括比图12中所示更多或者更少的组件，或者具有与图12所示不同的配置。
存储器104可用于存储计算机程序，例如，应用软件的软件程序以及模块，如本公开实施例中的光传送网中业务处理方法对应的计算机程序，处理器102通过运行存储在存储器104内的计算机程序，从而执行各种功能应用以及数据处理，即实现上述的方法。存储器104可包括高速随机存储器，还可包括非易失性存储器，如一个或者多个磁性存储装置、闪存、或者其他非易失性固态存储器。在一些实例中，存储器104可进一步包括相对于处理器102远程设置的存储器，这些远程存储器可以通过网络连接至移动终端10。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
传输装置106用于经由一个网络接收或者发送数据。上述的网络具体实例可包括移动终端10的通信供应商提供的无线网络。在一个实例中，传输装置106包括一个网络适配器(Network Interface Controller，简称为NIC)，其可通过基站与其他网络设备相连从而可与互联网进行通讯。在一个实例中，传输装置106可以为射频(Radio Frequency，简称为RF)模块，其用于通过无线方式与互联网进行通讯。
本公开实施例还提供了一种计算机可读介质，其上存储有计算机程序，程序被处理器执行时实现前面实施例提供的处理方法中的步骤。
本领域普通技术人员可以理解，上文中所公开方法中的全部或某些步骤、系统、装置中的功能模块/单元可以被实施为软件、固件、硬件及其适当的组合。在硬件实施方式中，在以上描述中提及的功能模块/单元之间的划分不一定对应于物理组件的划分；例如，一个物理组件可以具有多个功能，或者一个功能或步骤可以由若干物理组件合作执行。某些物理组件或所有物理组件可以被实施为由处理器，如中央处理器、数字信号处理器或微处理器执行的软件，或者被实施为硬件，或者被实施为集成电路，如专用集成电路。这样的软件可以分布在计算机可读介质上，计算机可读介质可以包括计算机存储介质(或非暂时性介质)和通信介质(或暂时性介质)。如本领域普通技术人员公知的，术语计算机存储介质包括在用于存储信息(诸如计算机可读指令、数据结构、程序模块或其它数据)的任 何方法或技术中实施的易失性和非易失性、可移除和不可移除介质。计算机存储介质包括但不限于RAM、ROM、EEPROM、闪存或其它存储器技术、CD-ROM、数字多功能盘(DVD)或其它光盘存储、磁盒、磁带、磁盘存储或其它磁存储装置、或者可以用于存储期望的信息并且可以被计算机访问的任何其它的介质。此外，本领域普通技术人员公知的是，通信介质通常包含计算机可读指令、数据结构、程序模块或者诸如载波或其它传输机制之类的调制数据信号中的其它数据，并且可包括任何信息递送介质。
本文已经公开了示例实施例，并且虽然采用了具体术语，但它们仅用于并仅应当被解释为一般说明性含义，并且不用于限制的目的。在一些实例中，对本领域技术人员显而易见的是，除非另外明确指出，否则可单独使用与特定实施例相结合描述的特征、特性和/或元素，或可与其它实施例相结合描述的特征、特性和/或元件组合使用。因此，本领域技术人员将理解，在不脱离由所附的权利要求阐明的本公开的范围的情况下，可进行各种形式和细节上的改变。
工业实用性
本公开实施例的技术方案，通过在净荷块中设置指示标识，以表示净荷块所承载数据为业务容器数据或填充数据，使得在将业务容器映射至光传送网帧内的过程中，可通过插入填充数据的方式进行速率适配，净荷区域内用于承载业务容器数据的净荷块的位置可根据业务容器速率进行动态变化，此时所需要设置的业务容器缓存区的大小可相应减小，有利于降低业务映射过程的时延。

Claims (15)

  1. 一种光传送网中业务处理方法，其中，包括：
    将客户业务映射到业务容器中；
    将所述业务容器映射到光传送网帧中，所述光传送网帧的净荷区域由净荷块组成，所述净荷块包括开销部分，所述开销部分包括指示标识，所述指示标识用于表示所述净荷块所承载数据为业务容器数据或填充数据。
  2. 根据权利要求1所述的方法，其中，在所述光传送网帧的净荷区域中，多个连续的净荷块作为一个传送周期；
    将所述业务容器映射到光传送网帧中的步骤包括：
    根据所述业务容器的带宽以及净荷块的带宽计算出所述业务容器在一个传送周期所需占用的净荷块数量N1；
    根据所述业务容器在一个传送周期所需占用的净荷块数量N1，基于预设分配算法确定所述业务容器所需占用的净荷块在所述传送周期中的分布位置；
    将所述业务容器承载至所确定分布位置处的净荷块中。
  3. 根据权利要求2所述的方法，其中，为业务容器分配的净荷块带宽大于业务容器带宽，在将所述业务容器映射到净荷块时，插入填充数据速率适配，采用指示标识表征净荷块承载的为业务容器数据或填充数据。
  4. 根据权利要求2所述的方法，其中，在1个传送周期，对于用于承载该业务容器的净荷块，若业务容器缓存区所缓存的业务容器数据的数据量超过一个净荷块的大小，则将业务容器数据承载在该净荷块中；反之，则将填充数据承载在该净荷块中。
  5. 根据权利要求2所述的方法，其中，在M个传送周期，用于 承载所述业务容器的N1*M个净荷块构成一个服务层帧，在所述服务层帧中用于承载业务容器数据的净荷块的数量为C；
    Figure PCTCN2020140282-appb-100001
    其中，M为预设的整数，floor()为向下取整函数，v表示业务容器速率，t表示发送1个传送周期的数据所对应的时长，L表示1个净荷块的长度。
  6. 根据权利要求5所述的方法，其中，将所述业务容器承载至所确定分布位置处的净荷块中步骤包括：
    根据业务容器数据在M个传送周期所需占用的净荷块数量C，基于预设分配算法确定所述服务层帧N个净荷块各自期望承载的数据类型，N＝N1*M，所述数据类型包括业务容器数据或填充数据；
    根据业务容器缓存的数据量以及所述服务层帧的N个净荷块各自期望承载的数据类型，确定所述服务层帧的N个净荷块实际承载的数据类型。
  7. 根据权利要求6所述的方法，其中，所述预设分配算法包括：sigma-delta算法。
  8. 根据权利要求6所述的方法，其中，所述根据业务容器缓存的数据量以及所述服务层帧的N个净荷块各自期望承载的数据类型，确定所述服务层帧的N个净荷块实际承载的数据类型的步骤包括：
    针对所述服务层帧的N个净荷块中的任意一个净荷块，若该净荷块的期望承载为业务容器数据，判断所述业务容器缓存中所缓存业务容器数据的数据量是否超过1个净荷块的大小；
    若判断出所述业务容器缓存中所缓存业务容器数据的数据量大于1个净荷块的大小，确定出该净荷块的实际承载为业务容器数据；反之，确定出该净荷块的实际承载为填充数据。
  9. 根据权利要求6所述的方法，其中，所述根据业务容器缓存的数据量以及所述服务层帧的N个净荷块各自期望承载的数据类型，确定所述服务层帧的N个净荷块实际承载的数据类型的步骤，还包括：
    针对所述服务层帧的N个净荷块中的任意一个净荷块，若该净荷块的期望承载为填充数据，判断所述业务容器缓存中所缓存业务容器数据的数据量是否超过预设阈值；
    若判断出所述业务容器缓存中所缓存业务容器数据的数据量超过所述预设阈值，确定出该净荷块的实际承载为业务容器数据；反之，确定出该净荷块的实际承载数据为填充数据；
    其中，所述预设阈值大于或等于1个净荷块的大小。
  10. 根据权利要求1所述的方法，其中，所述指示标识占用1比特；
    承载有业务容器数据的净荷块的指示标识为1，承载有填充数据的净荷块的指示标识为0。
  11. 根据权利要求1-10中任一所述的方法，还包括：
    获取光传送网帧，并从所述光传送网帧的净荷区域获取数据流；
    根据所述数据流中各净荷块内的所述指示标识确定承载有业务容器数据的净荷块，并提取出业务容器数据；
    从业务容器中获取客户业务。
  12. 一种光传送网中业务处理装置，其中，包括：
    第一映射模块，设置为将客户业务映射到业务容器中；
    第二映射模块，设置为将所述业务容器映射到光传送网帧中，所述光传送网帧的净荷区域包括多个净荷块，所述净荷块包括开销部分，所述开销部分包括指示标识，所述指示标识用于表示所述净荷块所承载数据为业务容器数据或填充数据。
  13. 根据权利要求12所述的装置，其中，还包括
    第一获取模块，设置为获取光传送网帧，并从所述光传送网帧的净荷区域获取数据流；
    提取模块，设置为根据所述数据流中各净荷块内的所述指示标识确定承载有业务容器数据的净荷块，并提取出业务容器数据；
    第二获取模块，设置为从业务容器中获取客户业务。
  14. 一种电子设备，其中，包括：
    一个或多个处理器；
    存储器，其上存储有一个或多个程序，当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现权利要求1-11中任一所述的方法。
  15. 一种计算机可读介质，其上存储有计算机程序，所述程序被处理器执行时实现权利要求1-11中任一所述的方法。
PCT/CN2020/140282 2020-03-27 2020-12-28 光传送网中业务处理方法、处理装置和电子设备 WO2021190030A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US17/914,790 US20230135776A1 (en) 2020-03-27 2020-12-28 Method and apparatus for service processing in optical transport network, and electronic device
KR1020227030303A KR20220137695A (ko) 2020-03-27 2020-12-28 광전송망에서의 서비스 처리 방법, 처리 장치 및 전자 장치

Applications Claiming Priority (2)

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

Publications (1)

Publication Number Publication Date
WO2021190030A1 true WO2021190030A1 (zh) 2021-09-30

Family

ID=74953377

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/140282 WO2021190030A1 (zh) 2020-03-27 2020-12-28 光传送网中业务处理方法、处理装置和电子设备

Country Status (4)

Country Link
US (1) US20230135776A1 (zh)
KR (1) KR20220137695A (zh)
CN (1) CN112511921A (zh)
WO (1) WO2021190030A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023124341A1 (zh) * 2021-12-31 2023-07-06 中兴通讯股份有限公司 信号速率处理方法、装置及存储介质

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117479057B (zh) * 2021-11-12 2024-08-27 华为技术有限公司 一种光信号传送方法及装置
CN116132854A (zh) * 2021-11-15 2023-05-16 深圳市中兴微电子技术有限公司 光传送网的流量处理方法、装置、电子设备及存储介质
CN116489704A (zh) * 2022-01-14 2023-07-25 华为技术有限公司 一种传输数据的方法
WO2023221966A1 (zh) * 2022-05-20 2023-11-23 华为技术有限公司 一种传输数据的方法和装置
CN117692821A (zh) * 2022-09-02 2024-03-12 华为技术有限公司 一种数据传输方法和数据传输装置
CN118074854A (zh) * 2022-11-22 2024-05-24 华为技术有限公司 一种传输数据的方法和装置

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1773898A (zh) * 2004-11-12 2006-05-17 阿尔卡特公司 在光传输网络上传输客户层信号的方法及设备
CN101651512A (zh) * 2009-09-24 2010-02-17 中兴通讯股份有限公司 一种实现数据业务透明传送的方法、系统及装置
CN105429726A (zh) * 2014-09-22 2016-03-23 华为技术有限公司 光传输网的业务映射处理方法、装置及系统
CN106301678A (zh) * 2015-06-08 2017-01-04 华为技术有限公司 一种数据处理的方法、通信设备及通信系统
CN110557217A (zh) * 2018-06-01 2019-12-10 华为技术有限公司 一种业务数据的处理方法及装置
US20200092029A1 (en) * 2009-03-09 2020-03-19 Huawei Technologies Co., Ltd. Method and apparatus for mapping and de-mapping in an optical transport network

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1773898A (zh) * 2004-11-12 2006-05-17 阿尔卡特公司 在光传输网络上传输客户层信号的方法及设备
US20200092029A1 (en) * 2009-03-09 2020-03-19 Huawei Technologies Co., Ltd. Method and apparatus for mapping and de-mapping in an optical transport network
CN101651512A (zh) * 2009-09-24 2010-02-17 中兴通讯股份有限公司 一种实现数据业务透明传送的方法、系统及装置
CN105429726A (zh) * 2014-09-22 2016-03-23 华为技术有限公司 光传输网的业务映射处理方法、装置及系统
CN106301678A (zh) * 2015-06-08 2017-01-04 华为技术有限公司 一种数据处理的方法、通信设备及通信系统
CN110557217A (zh) * 2018-06-01 2019-12-10 华为技术有限公司 一种业务数据的处理方法及装置

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023124341A1 (zh) * 2021-12-31 2023-07-06 中兴通讯股份有限公司 信号速率处理方法、装置及存储介质

Also Published As

Publication number Publication date
KR20220137695A (ko) 2022-10-12
CN112511921A (zh) 2021-03-16
US20230135776A1 (en) 2023-05-04

Similar Documents

Publication Publication Date Title
WO2021190030A1 (zh) 光传送网中业务处理方法、处理装置和电子设备
WO2019128934A1 (zh) 光传送网中业务发送、接收方法及装置
WO2020156287A1 (zh) 传递客户业务的方法、装置和系统以及计算机可读存储介质
JP6539755B2 (ja) データ処理方法、通信デバイス、及び通信システム
CN101291179B (zh) 一种光传送网中客户信号传送方法及相关设备
EP2209227A1 (en) A method for realizing time slot partition and spending process of an optical payload unit in an optical transmission network
WO2021190000A1 (zh) 光传送网中业务处理方法、处理装置和电子设备
WO2021169323A1 (zh) 光传送网中业务处理方法、处理装置和电子设备
WO2021169341A1 (zh) 光传送网中业务处理方法、处理装置和电子设备
US11082367B2 (en) FlexE frame format using 256b/257b block encoding
CN108092739B (zh) 业务的传输方法和装置
US8644333B2 (en) Method and apparatus for realizing cross-connect of optical channel data unit-K
WO2017063457A1 (zh) 一种速率适配方法和装置、计算机存储介质
CN113726679B (zh) 可动态配置的数据传输方法、装置、设备和存储介质
US8982910B1 (en) Fixed generic mapping of client data to optical transport frame
WO2021170002A1 (zh) 光传送网中业务处理方法、处理装置和电子设备
WO2018068497A1 (zh) 光通道数据单元帧的映射方法和装置、计算机存储介质
CN112511917A (zh) 光传送网中业务处理方法、处理装置和电子设备
CN109640198B (zh) 一种提高otn带宽利用率的方法和装置
CN102098595B (zh) 一种光传送网中客户信号传送方法及相关设备
WO2023134512A1 (zh) 一种传输数据的方法
WO2024007804A1 (zh) 固定速率信号的速率恢复方法及装置
CN112788442B (zh) 一种低速业务在otn网络中的承载方法及系统
CN112350957A (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: 20927302

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 20227030303

Country of ref document: KR

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 16/02/2023)

122 Ep: pct application non-entry in european phase

Ref document number: 20927302

Country of ref document: EP

Kind code of ref document: A1