WO2023232097A1 - Procédé et appareil de traitement de données de service - Google Patents

Procédé et appareil de traitement de données de service Download PDF

Info

Publication number
WO2023232097A1
WO2023232097A1 PCT/CN2023/097660 CN2023097660W WO2023232097A1 WO 2023232097 A1 WO2023232097 A1 WO 2023232097A1 CN 2023097660 W CN2023097660 W CN 2023097660W WO 2023232097 A1 WO2023232097 A1 WO 2023232097A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
time slot
block
code block
code
Prior art date
Application number
PCT/CN2023/097660
Other languages
English (en)
Chinese (zh)
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 华为技术有限公司
Publication of WO2023232097A1 publication Critical patent/WO2023232097A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems

Definitions

  • the present application relates to the field of optical communications, and more specifically, to a service data processing method and device.
  • Optical transport network is widely deployed in trunk lines, metro cores, and metro edges. It has the natural advantages of high quality, large capacity, and wide coverage, and can realize flexible scheduling and management of large-capacity customer services.
  • the optical data unit 0 (ODU0) frame is the smallest carrying container with the current OTN technology. Its speed is about 1.25 gigabit per second (Gbps) and is used to carry 1Gbps Ethernet. business data.
  • Gbps gigabit per second
  • business data As OTN technology faces more and more low-rate service carrying requirements, usually when using this ultra-high-rate transmission frame to transmit relatively low-rate services, it is necessary to map and multiplex the existing low-rate service data into a higher-rate service. High-speed signals are carried through the existing optical bearer containers of OTN, such as ODU0.
  • the processing complexity of time slot multiplexing in this implementation is high, and it also brings problems such as large delay and low bandwidth utilization.
  • Embodiments of the present application provide a service data processing method and device, which define a frame structure and a time slot multiplexing structure based on unified code blocks, support multiple service data with different bandwidths for time slot multiplexing processing, and simplify the complexity of business data processing. degree while reducing latency.
  • the first aspect provides a business data processing method.
  • the method may be executed by the sending device or by a component of the sending device (such as a chip or a chip system, etc.), which is not limited in this application.
  • the method includes: receiving first service data and second service data, performing time slot multiplexing on the first service data and second service data based on a time slot multiplexing structure to obtain a first data stream, and mapping the first data stream to the first data stream. in one data frame and send the first data frame.
  • the bandwidth of the first service data is less than or equal to 200 megabits per second (Mbps)
  • the time slot multiplexing structure includes m column code blocks, and the i-th column code block in the m column code blocks is the first Time slot block, the jth column code block in the m column code block includes k second time slot blocks, the first data frame includes N column code blocks, the first column of the first data frame is the first overhead code block, use For managing data code blocks other than the first column, the first overhead code block includes first indication information and second indication information, and the first indication information is used to indicate the start of the first data stream in the first data frame.
  • the starting position, the second indication information is used to indicate the mapping relationship between the first time slot block, the second time slot block and the first data stream, k, m and N are integers greater than 1, i and j are both greater than or equal to 1 And an integer N less than or equal to m is an integer greater than 1.
  • the time slot multiplexing structure and the frame structure for time slot multiplexing are defined based on the unified code block, which supports at least two service data for time slot multiplexing and simplifies time slot multiplexing processing. process, especially for small children Wide business data processing, ensuring bandwidth utilization and reducing transmission delay.
  • the code block includes first information, and the first information is used to indicate a code block type of the code block.
  • the code block type of the code block is a data code block or a non-data code block.
  • the code block further includes The second information is used to indicate that the code block type of the non-data code block is an overhead code block or a rate adaptation code block. Based on the above solution, by introducing the first information and the second information into the code block, the type of the code block can be flexibly indicated.
  • the method before performing time slot multiplexing on the first service data and the second service data based on the time slot multiplexing structure to obtain the first data stream, the method further includes: The first service data is encapsulated and rate matched to obtain a first sub-data stream, and the second service data is encapsulated and rate matched to obtain a second sub-data stream, where the first sub-data stream and the second sub-data stream are used to perform Time slot multiplexing.
  • the sub-data streams obtained by encapsulating and rate-matching different service data can be mapped into the time slot multiplexing structure in the size of large time slot blocks or small time slot blocks to ensure that different business data are multiplexed in time slots.
  • the code block is used as the processing granularity, which is helpful to simplify the complexity of subsequent time slot multiplexing.
  • encapsulating and rate matching the first service data to obtain the first sub-data stream includes: mapping the first service data according to the size of the first time slot block into the second data frame, and perform rate matching on the second data frame according to the size of the second time slot block to obtain the first sub-data stream, where the second data frame includes N column code blocks, and the second data frame The first column of is the second overhead code block, used to manage data code blocks other than the first column, and N is an integer greater than 1.
  • the second data frame defined by the code block is used to complete the encapsulation of the small-bandwidth service, and data interception and rate matching are performed according to the size of the second time slot block, and mapping to the position of the small slot specified in the time slot multiplexing structure, ensuring that the first service data is processed with code blocks as the granularity when time slot multiplexing, simplifying the processing process, and supporting time slot multiplexing of small bandwidth services, which is conducive to Reduce transmission delay and improve bandwidth utilization.
  • encapsulating and rate matching the second service data to obtain the second sub-data stream includes: mapping the second service data according to the size of the first time slot block In the second data frame, when the bandwidth of the second service data is greater than 200Mbps, rate matching is performed on the second data frame according to the size of the first time slot block to obtain the second sub-data stream, where the second data frame includes N Column code block, the first column of the second data frame is a second overhead code block, the second overhead code block is used to manage data code blocks except the first column, N is an integer greater than 1 .
  • the second data frame defined by the code block is used to complete the encapsulation of the large-bandwidth service, and data interception and rate matching are performed according to the size of the first time slot block, and mapping to the position of the large time slot specified in the time slot multiplexing structure to ensure that the second service data is processed with code blocks as the granularity when time slot multiplexing, simplifying the processing process.
  • the technical solution of this application is based on time slot multiplexing of service data of different bandwidths to achieve more flexible service data bearing.
  • code blocks as the processing granularity and using large time slot blocks and small slot blocks for mixed time slot multiplexing
  • business data of different rates can be processed in a targeted and flexible manner and the business processing process can be simplified.
  • the size of the first time slot block is greater than or equal to 64 bytes
  • the size of the second time slot block is greater than or equal to 8 bytes, and less than or equal to 64 bytes.
  • the size of the second slot block is 8, 16, 24, 32, or 64 bytes
  • the size of the first slot block is 64, 128, 192, 256, 65, 129, 193, or 257 bytes.
  • the first time slot block and the second time slot block can be code blocks of different byte sizes, which is beneficial to realizing different Service data at the same rate are multiplexed and carried in time slots, with high flexibility.
  • X is the size of the first time slot block
  • p is the size of the second time slot block
  • k is the number of the second time slot block
  • c is the bits occupied by the first information.
  • the size of the first time slot block in this application is an integer multiple of the second time slot code block. That is to say, for a time slot multiplexing structure, it can support m*k second time slot blocks (small slots) and m first time slot blocks (large time slots) mixed in a certain proportion for time slot multiplexing. More flexibility and adaptability.
  • the second aspect provides a business data processing method.
  • the method can be executed by the receiving end device or by a component of the receiving end device (such as a chip or a chip system, etc.), which is not limited in this application.
  • the method includes: receiving a first data frame, demapping a first data stream from the first data frame, and demultiplexing the first data stream to obtain first service data and second service data.
  • the first data frame is used to carry the first data stream, and the first data stream is obtained by time-slot multiplexing the first service data and the second service data based on the time-slot multiplexing structure, wherein the first service data
  • the bandwidth is less than or equal to 200Mbps.
  • the time slot multiplexing structure includes m column code blocks.
  • the i-th column code block is the first time slot block.
  • the j-th column code block includes k second time slot blocks.
  • the first data frame includes N columns.
  • the first column is a first overhead code block, used to manage data code blocks except the first column
  • the first overhead code block includes first indication information and second indication information
  • the first indication information is used to indicate The starting position of the first data stream in the first data frame
  • the second indication information is used to indicate the mapping relationship between the first time slot block, the second time slot block and the first data stream
  • k, m and N are greater than 1 is an integer
  • i and j are both integers greater than or equal to 1 and less than or equal to m.
  • the time slot multiplexing structure and the frame structure for time slot multiplexing are defined based on the unified code block, which supports at least two service data for time slot multiplexing and simplifies time slot multiplexing processing.
  • the process especially for small-bandwidth business data processing, ensures bandwidth utilization and reduces transmission delays.
  • the code block includes first information, and the first information is used to indicate the code block type of the code block.
  • the code block type of the code block is a data code block or a non-data code block.
  • the code block further includes The second information is used to indicate that the code block type of the non-data code block is an overhead code block or a rate adaptation code block. Based on the above solution, by introducing the first information and the second information into the code block, the type of the code block can be flexibly indicated.
  • the first data stream is de-mapped from the first data frame, and the first data stream is de-slot-multiplexed to obtain the first service data and the first data stream.
  • the second service data it also includes: deleting the rate matching code block and decapsulating the first sub-data stream to obtain the first service data, and deleting the rate matching code block and decapsulating the second sub-data stream to obtain the second service.
  • Data, wherein the first sub-data stream and the second sub-data stream are obtained by performing time slot demultiplexing.
  • different service data obtained by deleting rate matching code blocks and decapsulating different sub-data streams are related to the positions of the large slot blocks or small slot blocks specified in the slot multiplexing structure.
  • the correlation relationship can be further determined based on the existing time slot configuration table to ensure that different service data are processed at the code block granularity when time slot multiplexing, which is beneficial to simplifying the complexity of subsequent time slot multiplexing.
  • deleting the rate matching code block and decapsulating the first sub-data stream to obtain the first service data includes: deleting the first sub-data stream according to the size of the second time slot block.
  • One sub-stream for deletion rate matching Match the code block to obtain the second data frame, and demap the first service data from the second data frame according to the size of the first time slot block, where the second data frame includes N column code blocks, and the second data frame
  • the first column is a second overhead code block, used to manage data code blocks other than the first column, and N is an integer greater than 1.
  • rate matching code blocks are deleted according to the size of the second time slot block, and according to the size of the first time slot block, the second data defined in code blocks is deleted.
  • the frame demaps the first service data. Map small-bandwidth services to the designated small-slot positions in the time-slot multiplexing structure to ensure that the first service data is processed with code blocks as the granularity when time-slot multiplexing, simplifying the processing process and supporting time slots for small-bandwidth services Multiplexing is conducive to reducing transmission delay and improving bandwidth utilization.
  • deleting the rate matching code block and decapsulating the second sub-data stream to obtain the second service data includes: when the bandwidth of the second service data is greater than 200Mbps , delete the rate matching code block on the second sub-data stream according to the size of the first time slot block to obtain the second data frame, and demap the second service data from the second data frame according to the size of the first time slot block.
  • the second data frame includes N column code blocks
  • the first column of the second data frame is a second overhead code block, used to manage data code blocks other than the first column
  • N is an integer greater than 1 .
  • rate matching code blocks are deleted according to the size of the first time slot block, and according to the size of the first time slot block, the second data defined in code blocks is deleted.
  • the frame demaps the second service data. Map the large-bandwidth service to the specified large time slot position in the time slot multiplexing structure to ensure that the second service data is processed with code blocks as the granularity when time slot multiplexing, simplifying the processing process.
  • the technical solution of this application is to multiplex time slots based on service data of different bandwidths to achieve more flexible service data bearing.
  • code blocks as the processing granularity and using large time slot blocks and small slot blocks for mixed time slot multiplexing, business data of different rates can be processed in a targeted and flexible manner and the business processing process can be simplified.
  • the size of the first time slot block is greater than or equal to 64 bytes
  • the size of the second time slot block is greater than or equal to 8 bytes, and less than or equal to 64 bytes.
  • the size of the second slot block is 8, 16, 24, 32 or 64 bytes
  • the size of the first slot block is 64, 128, 192, 256, 65, 129, 193 or 257 bytes.
  • the first time slot block and the second time slot block can be code blocks of different byte sizes, which is conducive to time slot multiplexing and carrying of service data at different rates, and has high flexibility.
  • X is the size of the first time slot block
  • p is the size of the second time slot block
  • k is the number of the second time slot block
  • c is the bits occupied by the first information.
  • the size of the first time slot block in this application is an integer multiple of the second time slot code block. That is to say, for a time slot multiplexing structure, m*k second time slot blocks (hours) can be supported. slots) and m first time slot blocks (large time slots) are mixed according to a certain proportion for time slot multiplexing, which has higher flexibility and stronger adaptability.
  • a business data processing device is provided.
  • the device is used to perform the method provided in the first aspect.
  • the business data processing device may include units and/or modules for executing the method provided by the first aspect or any one of the above implementations of the first aspect.
  • the device for transmitting data is a sending device.
  • the transceiver can be a transceiver, or an input/output interface.
  • the processing module may be at least one processor.
  • the transceiver may be a transceiver circuit.
  • the input/output interface may be an input/output circuit.
  • the service data processing device is a chip, chip system or circuit in the sending end device.
  • the transceiver module may be an input/output interface, interface circuit, output circuit, input circuit, pin or related circuit on the chip, chip system or circuit.
  • the processing module may be at least one processor, processing circuit or logic circuit, etc.
  • beneficial effects of the method shown in the above third aspect and its possible designs may be referred to the beneficial effects of the first aspect and its possible designs.
  • a fourth aspect provides a business data processing device.
  • the device is used to perform the method provided in the second aspect above.
  • the business data processing device may include units and/or modules for executing the method provided by the second aspect or any one of the above implementations of the second aspect.
  • the service data processing device is a receiving end device.
  • the transceiver can be a transceiver, or an input/output interface.
  • the processing module may be at least one processor.
  • the transceiver may be a transceiver circuit.
  • the input/output interface may be an input/output circuit.
  • the service data processing device is a chip, chip system or circuit in the receiving end device.
  • the transceiver module may be an input/output interface, interface circuit, output circuit, input circuit, pin or related circuit on the chip, chip system or circuit.
  • the processing module may be at least one processor, processing circuit or logic circuit, etc.
  • a fifth aspect provides a processor for executing the methods provided in the above aspects.
  • operations such as sending and getting/receiving involved in the processor, if there is no special explanation, or if it does not conflict with its actual role or internal logic in the relevant description, it can be understood as processor output, reception, input and other operations. , can also be understood as the transmitting and receiving operations performed by the radio frequency circuit and the antenna, which is not limited in this application.
  • a computer-readable storage medium stores program code for device execution, and the program code includes the method provided by any one of the implementations of the first aspect or the second aspect.
  • a computer program product containing instructions is provided.
  • the computer program product is run on the computer, the computer is caused to execute the method provided by any implementation of the first aspect or the second aspect.
  • An eighth aspect provides a chip, which includes a processor and a communication interface.
  • the processor reads the instructions stored in the memory through the communication interface and executes the method provided by any implementation of the first aspect or the second aspect.
  • the chip also includes a memory, in which computer programs or instructions are stored.
  • the processor is used to execute the computer programs or instructions stored in the memory.
  • the processor is used to execute The method provided by the above second aspect or any implementation of the second aspect.
  • a ninth aspect provides a communication system, including: the service data processing device described in the third aspect and the service data processing device described in the fourth aspect.
  • Figure 1 is a schematic diagram of an application scenario applicable to this application.
  • Figure 2 is a schematic diagram of the hardware structure of a network device.
  • Figure 3 is a schematic diagram of the frame structure of an OTN frame.
  • Figure 4 is a schematic structural diagram of different types of code blocks provided by an embodiment of the present application.
  • FIG. 5 is a schematic diagram of the frame structure of a data frame provided by an embodiment of the present application.
  • Figure 6 is a schematic diagram of a frame structure for time slot multiplexing provided by an embodiment of the present application.
  • Figure 7 is a schematic diagram of a time slot multiplexing structure provided by an embodiment of the present application.
  • Figure 8 is a schematic structural diagram of a combination of large and small code blocks provided by an embodiment of the present application.
  • Figure 9 is a schematic flow chart of a business data processing method provided by an embodiment of the present application.
  • Figure 10 is a schematic flow chart of mapping a data stream to a data frame provided by an embodiment of the present application.
  • Figure 11 is a schematic flow chart of another business data processing method provided by an embodiment of the present application.
  • Figure 12 is a schematic flow chart of multi-channel service data processing provided by an embodiment of the present application.
  • Figure 13 is a schematic structural diagram of a communication device provided by an embodiment of the present application.
  • optical networks such as optical transport networks OTN.
  • An OTN is usually composed of multiple devices connected through optical fibers, and can be formed into different topology types such as linear, ring, and mesh according to specific needs.
  • FIG 1 is a schematic diagram of an application scenario applicable to this application.
  • OTN 100 includes 8 interconnected OTN devices 101, namely devices A-H.
  • 102 indicates the optical fiber, used to connect two devices;
  • 103 indicates the customer service interface, used to receive or send customer service data.
  • OTN 100 is used to transmit business data for customer devices 1-3.
  • the customer equipment is connected to the OTN equipment through the customer service interface.
  • client devices 1-3 are connected to OTN devices A, H, and F respectively.
  • OTN equipment is divided into optical layer equipment, electrical layer equipment and optical and electrical hybrid equipment.
  • Optical layer equipment refers to equipment that can process optical layer signals, such as: optical amplifier (optical amplifier, OA), optical add-drop multiplexer (optical add-drop multiplexer, OADM).
  • OA also known as optical line amplifier (OLA)
  • OLA optical line amplifier
  • Electrical layer equipment refers to equipment that can process electrical layer signals, such as equipment that can process OTN signals.
  • Optoelectronic hybrid equipment refers to equipment that has the ability to process optical layer signals and electrical layer signals. It should be noted that, depending on specific integration needs, an OTN device can integrate a variety of different functions. The technical solution provided in this application is suitable for OTN equipment containing electrical layer functions of different forms and integration levels.
  • FIG. 2 is a schematic diagram of a network device hardware structure 200.
  • the OTN device 200 includes a tributary board 201, a cross-connect board 202, a line board 203, an optical layer processing board (not shown in the figure), and a system control and communication board 204.
  • network equipment may contain different types and numbers of boards.
  • a network device serving as a core node does not have a tributary board 201 .
  • a network device serving as an edge node has multiple tributary boards 201 or no optical cross-connect board 202 .
  • network equipment that only supports electrical layer functions may not have optical layer processing boards.
  • the tributary board 201, the cross-connect board 202 and the line board 203 are used to process the electrical layer signals of the OTN (such as ODU frames in the OTN).
  • the tributary board 201 is used to realize the reception and transmission of various customer services, such as synchronous digital hierarchy (SDH) services, packet services, Ethernet services, and fronthaul services.
  • the tributary board 201 can be divided into a client-side optical transceiver module and a signal processor.
  • the client-side optical transceiver module can also be called an optical transceiver and is used to receive and/or send service data.
  • the signal processor is used to implement mapping and demapping of business data to data frames.
  • the cross-connect board 202 is used to realize the exchange of data frames and complete the exchange of one or more types of data frames.
  • the circuit board 203 mainly implements the processing of line-side data frames. Specifically, the circuit board 203 can be divided into a line-side optical module and a signal processor. That , the line-side optical module can be called an optical transceiver and is used to receive and/or send data frames.
  • the signal processor is used to implement multiplexing and demultiplexing, or mapping and demapping processing of data frames on the line side.
  • the system control and communication single board 204 is used to implement system control. Specifically, information can be collected from different boards, or control instructions can be sent to the corresponding boards.
  • OTN frame The data frame structure used by OTN equipment is OTN frame, which is used to carry various business data and provide rich management and monitoring functions.
  • OTN frames can also be called OTN transmission frames.
  • the OTN frame can be an optical data unit frame (optical data unit k, ODUk), ODUCn, ODUflex, or an optical transmission unit k (optical transport unit k, OTUk), OTUCn, or a flexible OTN (flexible OTN, FlexO) frames, or flexible optical service unit (OSUflex) frames, etc.
  • OSUflex can also be called OSU frame.
  • an OTU frame includes an ODU frame and an OTU overhead.
  • Cn represents a variable rate, specifically a rate that is a positive integer multiple of 100Gbps.
  • ODU frame refers to any one of ODUk, ODUCn or ODUflex, and OTU frame refers to any one of OTUk, OTUCn or FlexO.
  • FIG 3 is a schematic diagram of the frame structure of an OTN frame.
  • the OTN frame is a frame structure with four rows and multiple columns, including an overhead area, a payload area, and a forward error correction (FEC) area.
  • FEC forward error correction
  • the specific description of the OTN frame structure can refer to the relevant description in the current protocol, which will not be described in detail in this application.
  • FE When Fast Ethernet (FE) needs to use OTN transmission, FE is first mapped to the ODU0 frame with a rate of about 1.25Gbps, and then transmitted in OTN through OTU1.
  • the transmission efficiency of this method is low, and the bandwidth of ODU0 is less than 10%.
  • multiple E1 signals are first mapped to synchronous transport module-l (synchronous transport module-l, STM-l) interface signals.
  • STM-1 is a type of SDH signal.
  • the STM-1 interface signal is then mapped to ODU0, and then transmitted through OTU1 in OTN.
  • low-rate services can be multiplexed into high-rate signals, which can also be called signal “multiplexing”, which is understood to mean multiplexing multiple signals into OTN signals according to corresponding time slot arrangements.
  • a current OTN low-rate service bearing method includes: OTN first maps and multiplexes low-rate service data into higher-rate signals, and then carries the signals through existing high-rate optical bearer containers (such as ODU0 frames). This implementation method is highly complex and may lead to problems such as poor timeliness and low bandwidth utilization.
  • this application proposes a service data processing method and device, which uniformly defines the frame structure and time slot multiplexing structure based on code blocks, supports multiple service data with different bandwidths for time slot multiplexing processing, and simplifies the processing complexity. , while reducing latency and improving bandwidth utilization.
  • service data refers to services carried by an optical transmission network or a metropolitan area transmission network.
  • it includes but is not limited to Ethernet services, packet services, wireless backhaul services, etc.
  • Business data can also be called business signals, customer data or customer business data. It should be understood that the type of service data is not limited in the embodiment of this application.
  • “at least one” refers to one or more, and “multiple” refers to two or more.
  • “And/or” describes the relationship between related objects, indicating that three relationships can exist.
  • a and/or B can mean: A alone exists, A and B exist simultaneously, and B alone exists. Among them, A and B can be singular or plural.
  • the character "/" generally indicates that the related objects are in an "or” relationship.
  • protocol may refer to a standard protocol in the OTN field, such as the G.709 standard protocol of ITU-T and related protocols applied in future OTN systems. This application does not Make limitations.
  • for instruction includes direct instruction and indirect instruction.
  • information when describing certain information to indicate A, it may include that the information directly indicates A or indirectly indicates A, but it does not mean that the information must contain A.
  • the character "*" is an operation symbol, indicating product.
  • FIG. 4 is a schematic structural diagram of different types of code blocks provided by an embodiment of the present application. As shown in (a), (b) and (c) of Figure 4, they are the data (data) code block (referred to as D code), the overhead (OH) code block (referred to as O code) and the rate adaptation code. Blocks (idle code blocks, referred to as I codes) are all in code blocks. Among them, D code is used to carry customer service data, and O code and I code can be collectively referred to as control code blocks (referred to as C codes, that is, non-data code blocks).
  • the O code includes RES, multiplexing layer indication (MLI), overhead type O_TYPE and OH Information field, I code includes RES, MLI, O_TYPE and AL (h55) information fields.
  • BLK_T supports 1-bit error correction capability. For example, "010, 100, 001" represents D code after error correction, and "110, 101, 011" represents O code or I code after error correction.
  • the size of the above-mentioned D code, O code and I code may be X bytes, and X is an integer greater than or equal to 64.
  • X can be 64, 128, 192, 256, etc.
  • X can also be 65, 129, 193 or 257, etc., which is not specifically limited in this application.
  • the size of the unified code block defined in this application can have a variety of possible values, in order to support service data transmission at different rates.
  • the size of the code block involved in the embodiment of the present application can be understood as the bit width of the code block, and the bit width can be understood as the number of bits of the code block. That is to say, the bit width of the code block can be understood as the number of bits of the code block. Number of bits occupied (may be non-integer bytes). It should be understood that the size of the code block may be integer bytes or non-integer bytes. For convenience of description, the following exemplifies the code block size as integer bytes. In the embodiment of the present application, the size of the code block and the bit width represent the same meaning, and the descriptions can be replaced and will not be described again.
  • FIG. 5 is a schematic diagram of the frame structure of a data frame (which may be referred to as OSU-n, that is, the second data frame) provided by an embodiment of the present application.
  • OSU-n is an N-column data structure built based on X byte code blocks. Each column can be understood as an X byte code block. Among them, the first column is the overhead code block, and the other columns are data code blocks. The data code block is used to carry customer service data, and the overhead code block is used to manage data code block #1 except the first column.
  • Y is less than X
  • N is an integer greater than 1.
  • the first column header can define a Y byte OH, and the remaining bytes in the first column except the Y byte occupied by OH (for example, X-Y-c, c is the bit occupied by BLK_T) can also be used to carry customer services data.
  • FIG. 6 is a schematic diagram of a frame structure for time slot multiplexing (which may be referred to as OSU-m, namely the first data frame) provided by an embodiment of the present application.
  • OSU-m time slot multiplexing
  • an N-column data structure is constructed based on X byte code blocks. Each column can be understood as an X byte code block.
  • the difference from the frame structure OSU-n shown in Figure 5 is that the first column of OSU-m also includes the time slot indication TS_PTR (i.e.
  • TS-PTR is used to indicate the starting position of OSU-m in the timeslot multiplexing structure carrying the first data stream shown in FIG. 7 .
  • MSI is the time slot multiplexing overhead and multiframe transmission, which is used to indicate the first time slot block, the second time slot block and the first data stream shown in Figure 7 (that is, the data obtained by encapsulation, rate matching, etc. of service data) flow) mapping relationship, such as which time slots are occupied by which services.
  • FIG. 7 is a schematic diagram of a timeslot multiplexing structure (which may be referred to as OSTUG-m for short) provided by an embodiment of the present application. As shown in Figure 7, an m-column data structure is constructed based on X byte code blocks. Each column can be understood as an X byte code block.
  • the i-th column of OSTUG-m can be the first time slot block (such as time slot #1, which can be called a large time slot), the bit width is X byte, and the time slot bandwidth is defined as Rh, then the m column can be m time slots #1, and the corresponding time slot numbers are TSH1 ⁇ TSHm.
  • X 64 bype
  • data code block #1 corresponding to time slot #1 can occupy 63 bytes
  • BLK_T can occupy 1 bype.
  • the jth column of OSTUG-m can be divided into k second time slot blocks (such as time slot #2, which can be called small slots) based on p byte, with a bit width of p byte , the time slot bandwidth is defined as Rl, then each column can include k time slots #2, and the corresponding time slot numbers are TSL1 to TSLk.
  • p can be 8, 16, 24, 32, 64, etc.
  • BLK_T can occupy 1 byte.
  • k and m are both integers greater than 1
  • i and j are both integers greater than or equal to 1 and less than or equal to m.
  • X is an integer multiple of p
  • Rh is an integer multiple of R1.
  • a certain column of data code blocks of OSTUG-m is divided into k second time slot blocks (time slot #2) based on p byte.
  • TSL1 to TSLk correspond to k small code blocks in sequence.
  • the type of each small code block can be indicated by 1bit TSr_BLK_T (r is greater than or equal to 1 and less than or equal to k).
  • the type indication information TSr_BLK_T and error correction code (ECC) of k small code blocks can be unified as BLK_T and placed at the head of the data code block in the column.
  • X can be 65, 129, 193, 257, etc.
  • X can be 65, 129, 193, 257, etc.
  • a certain column of data code blocks in OSTUG-m is a first time slot block (time slot #1), that is, a large code block.
  • X can be 65, 129, 193, 257, etc.
  • X 65byte
  • the data code block size is 64byte
  • BLK_T occupies 1 byte.
  • X, p and k are only examples and should not constitute any limitation on the technical solution of the present application. In this implementation, X may not be an integer multiple of p.
  • width that is, the size of the second slot block
  • k is the number of small code blocks (that is, the number of the second slot block)
  • c is the bits occupied by BLK_T.
  • Figure 9 shows a schematic flowchart of a business data processing method 900 provided by an embodiment of the present application.
  • the sending device may be an OTN device, or may be executed by a component of the OTN device (such as a chip or chip system, etc.).
  • the receiving end device may be an OTN device, or may be executed by a component of the OTN device (such as a chip or chip system, etc.).
  • the method 900 includes the following steps.
  • S910 The sending end device receives the first service data and the second service data.
  • the bandwidth of the first service data is less than or equal to 200Mbps, for example, the bandwidth of the first service data is 100Mbps.
  • the bandwidth of the second service data may be less than or equal to 200Mbps, or may be greater than 200Mbps, and there may be one or more second service data, which is not specifically limited in this application. It should be understood that 200Mbps may be a pre-specified threshold here. It should also be understood that the bandwidth value range of the first service data is only an exemplary description, and this application does not specifically limit it. For example, the bandwidth of the first service data may be less than or equal to 100 Mbps.
  • services with service data less than or equal to 200 Mbps are called small-bandwidth services (for example, first service data), and services with service data greater than 200 Mbps are called large-bandwidth services.
  • the second service data may be the service data of a small bandwidth service or the service data of a large bandwidth service.
  • the sending end device is the above-mentioned OTN device (OTN device A as shown in Figure 1), and receives service data (for example, first service data and second business data).
  • the sending device is other device capable of implementing OTN devices.
  • S920 The sending device performs time slot multiplexing on the first service data and the second service data based on the time slot multiplexing structure to obtain the first data stream.
  • time slot multiplexing structure The definition of the time slot multiplexing structure can be seen in Figure 7 and will not be described in detail here. It should be pointed out that performing time slot multiplexing on the first service data and the second service data based on the time slot multiplexing structure to obtain the first data stream can be understood as: placing the first service data in the sequence according to the time slot configuration table.
  • the second time slot block specified in the time slot multiplexing structure (such as time slot #2, a small block of a certain column in the m column code block), and the second service data is placed in the time slot complex according to the order of the time slot configuration table.
  • Use the first time slot block specified in the structure (such as time slot #1, a certain column in the m column code block).
  • the time slot configuration table is stipulated by the existing protocol and will not be described in detail here. That is to say, after the first service data and the second service data are time slot multiplexed, the obtained first data stream may include one or more time slot multiplexing structures.
  • the sending end device may also perform time slot multiplexing on the first service data. Encapsulation and rate matching are performed to obtain the first sub-data stream, and the second service data is encapsulated and rate-matched to obtain the second sub-data stream, where the first sub-data stream and the second sub-data stream are used for time slot multiplexing.
  • encapsulating and rate matching the first service data to obtain the first sub-data stream includes: mapping the first service data into the second data frame according to the size of the first time slot block, and mapping the first service data into the second data frame according to the second time slot block size.
  • the size of the slot block is rate matched to the second data frame to obtain the first sub-data stream.
  • encapsulating and rate matching the second service data to obtain the second sub-data stream includes: according to the first The size of the time slot block maps the second service data into the second data frame. When the bandwidth of the second service data is greater than 200Mbps, rate matching is performed on the second data frame according to the size of the first time slot block to obtain the second sub-frame. data flow.
  • encapsulating business data can be understood as: taking code blocks as units, the code block size is X bytes, dividing the business data into one or more data code blocks, and encapsulating the one or more data code blocks.
  • the second data frame (such as OSU-n). That is, the size of the data code block is equal to the size of the code block in the second data frame, both being X bytes.
  • rate matching of service data can be understood as: according to the different size bandwidth of the service data, according to the time slot blocks of different sizes (for example, the small bandwidth service corresponds to the second time slot block, the large bandwidth service corresponds to the first time slot block corresponding to the size of X bytes), intercept the second data frame, and insert a rate adaptation code block into the data code block for rate matching.
  • data code block #1 is sequentially intercepted according to the size of the second time slot block, and rate adaptation code block #1 is inserted into multiple data code blocks #1 for rate matching, and finally the sub-code block #1 is obtained.
  • Data flow #1 for small-bandwidth services, data code block #1 is sequentially intercepted according to the size of the second time slot block, and rate adaptation code block #1 is inserted into multiple data code blocks #1 for rate matching, and finally the sub-code block #1 is obtained.
  • the size of data code block #1 and rate adaptation code block #1 in sub-data stream #1 is the same as the size of the second time slot block, for example, p bytes.
  • the data code block #2 is intercepted according to the size of the first time slot block, and the rate adaptation code block #2 is inserted into multiple data code blocks #2 for rate matching, and finally the result is Substream #2.
  • the size of data code block #2 and rate adaptation code block #2 in sub-data stream #2 is the same as the size of the first time slot block, for example, X bytes.
  • the multiple sub-data streams obtained after encapsulation and rate matching are sequentially migrated to the specified large time slot or small slot position in the time slot multiplexing structure according to the time slot configuration table, and the sub-data streams that complete the multi-channel service are Relocation of slot multiplexing structures for slot multiplexing.
  • the above process of processing the received service data by the sending end device is performed at the granularity of code blocks to reduce the complexity of service data processing.
  • “taking code blocks as the granularity” can be understood as “taking code blocks as the processing granularity”, or it can also be understood as “taking code blocks as the processing size”, etc., indicating that the business data processing process is based on the code blocks.
  • S930 The sending device maps the time slot multiplexing structure of the first data stream into the first data frame.
  • the frame structure definition of the first data frame can be seen in Figure 6 and will not be described in detail here.
  • FIG. 10 shows the 8-column time slot multiplexing structure OSTUG-8, including 8 time slots TS#1 to TS#8.
  • (b) of Figure 10 is a 10-column frame structure OSU-8 for time slot multiplexing, which is used to carry 8 time slots TS#1 to TS#8 in the time slot multiplexing structure OSTUG-8.
  • the first column of OSU-8 is an overhead code block, including second indication information TUG-PTR, used to indicate that OSTUG-8 is mapped to the starting position in OSU-8.
  • TUG-PTR second indication information
  • the starting position of OSTUG-8 in the first data stream is indicated by TUG-PTR (such as TS#1)
  • TUG-PTR such as TS#1
  • the starting position of OSTUG-8 in the first data stream is indicated by TUG-PTR in OSU-8 the seventh column.
  • the TUG-PTR is used to indicate that the starting position of OSTUG-8 in the first data stream (such as TS#1) is in the eighth column of OSU-8.
  • the OTN frame (ie, the first data frame) is used as an example for explanation, which should not constitute any limitation on the technical solution of the present application. It should be understood that in future technology development, this application may also apply to other bearer data frames.
  • S940 The sending device sends the first data frame to the receiving device.
  • the receiving end device receives the first data frame from the sending end device.
  • the sending device can directly send the first data frame (such as OSU-m) to the receiving device, or it can also encapsulate the first data frame into a bearer container ODU frame, and then send the ODU frame to the receiving device.
  • the first data frame such as OSU-m
  • the receiving device can also encapsulate the first data frame into a bearer container ODU frame, and then send the ODU frame to the receiving device.
  • this application does not specifically limit this.
  • the receiving end device demaps the first data stream from the first data frame, and demultiplexes the time slots of the first data stream to obtain the first service data and the second service data.
  • the method further includes: The first sub-data stream is deleted from the rate matching code block and decapsulated to obtain the first service data, and the second sub-data stream is deleted from the rate matching code block and decapsulated to obtain the second service data, wherein the first sub-data The stream and the second sub-data stream are obtained by performing the de-slot multiplexing.
  • deleting the rate matching code block and decapsulating the first sub-data stream to obtain the first service data specifically includes: deleting the rate matching code block on the first sub-data stream according to the size of the second time slot block to obtain the first service data.
  • a second data frame is obtained, and the first service data is de-mapped from the second data frame according to the size of the first time slot block.
  • deleting the rate matching code block and decapsulating the second sub-data stream to obtain the second service data specifically includes: according to the first The size of the time slot block is used to delete the rate matching code block of the second sub-data stream to obtain the second data frame, and the second service data is de-mapped from the second data frame according to the size of the first time slot block.
  • Figure 11 shows a schematic flowchart of another business data processing method 1100 provided by an embodiment of the present application.
  • the sending device may be an OTN device, or may be executed by a component of the OTN device (such as a chip or chip system, etc.).
  • the receiving end device may be an OTN device, or may be executed by a component of the OTN device (such as a chip or chip system, etc.).
  • the method 1100 includes the following steps.
  • the sending device receives the first service data and the second service data.
  • S1120 The sending end device encapsulates and rate matches the first service data to obtain the first sub-data stream.
  • the sending end device encapsulates and rate matches the second service data to obtain the second sub-data stream.
  • the first sub-data stream and the second sub-data stream are used for time slot multiplexing.
  • encapsulating and rate matching the first service data to obtain the first sub-data stream includes: dividing the first service data into one or more data code blocks according to the size of the first time slot block, and dividing the first service data into one or more data code blocks.
  • One or more data code blocks are encapsulated in the second data frame.
  • the size of the multiple data code blocks is the same as the size of the code block in the second data frame, for example, X bytes.
  • rate matching code blocks are inserted into the plurality of data code blocks in the second data frame according to the size of the second time slot block to perform rate matching to obtain the first sub-data stream.
  • the size of the data code block and the rate adaptation code block in the first sub-data stream is the same as the size of the second time slot block, for example, p bytes. That is, for small-bandwidth services, encapsulation is performed with the size of a code block of
  • encapsulating and rate matching the second service data to obtain the second sub-data stream includes: dividing the second service data into one or more data code blocks according to the size of the first time slot block, and dividing the second service data into one or more data code blocks.
  • One or more data code blocks are encapsulated into the second data frame, and the size of the multiple data code blocks is equal to the size of the code block in the second data frame, for example, X bytes.
  • the rate matching code blocks are inserted into the plurality of data code blocks in the second data frame according to the size of the first time slot block to perform rate matching to obtain the second sub-data stream.
  • the size of the data code block and the rate adaptation code block in the second sub-data stream is the same as the size of the second time slot block, for example, p bytes. That is, for large-bandwidth services, encapsulation and rate adaptation are carried out with the size of X-byte code block (i.e., the first slot block) as the granularity.
  • the frame structure definition of the first data frame can be seen in Figure 6 and will not be described in detail here.
  • the multiple sub-data streams obtained after encapsulation and rate matching can be sequentially migrated to the specified large time slot or small slot position in the time slot multiplexing structure according to the time slot configuration table to complete the sub-data flow of the multi-channel service. Move to slot multiplexing structure for slot multiplexing.
  • S1130 The sending device performs time slot multiplexing on the first sub-data stream and the second sub-data stream based on the time slot multiplexing structure to obtain the first data stream.
  • time slot multiplexing structure The definition of the time slot multiplexing structure can be seen in Figure 7 and will not be described in detail here.
  • the code blocks of the first sub-data stream corresponding to the small bandwidth service are placed in the designated small slot position (i.e., the second time slot block) in the time slot multiplexing structure, for example, as shown in Figure 7 Time slot #2 in a certain column of code blocks in the m-column code blocks of the time slot multiplexing structure shown.
  • the code blocks of the second sub-data stream corresponding to the large-bandwidth service are placed in the designated large time slot position (i.e., the first time slot block) in the time slot multiplexing structure, for example, as shown in Figure 7 A certain entire column of code blocks in the m-column code blocks of the time slot multiplexing structure shown, such as time slot #1.
  • multi-channel large and small bandwidth services are moved to the time slot multiplexing structure according to the time slot configuration table, especially the first data stream obtained after time slot multiplexing for small bandwidth services can be carried through the OTN frame.
  • S1140 The sending device maps the first data stream into the first data frame.
  • the sending device sends the first data frame to the receiving device.
  • the receiving end device receives the first data frame from the sending end device.
  • the receiving end device demaps the first data stream from the first data frame, and demultiplexes the first data stream to obtain the first service data and the second service data.
  • steps S1110, S1140, S1150 and S1160 For the specific implementation of steps S1110, S1140, S1150 and S1160, reference can be made to steps S910, S930, S940 and S950 in the above-mentioned method 900. This is a simple example and will not be described again here.
  • FIG 12 is a schematic flowchart of multi-channel service data processing provided by an embodiment of the present application.
  • the sending device receives small bandwidth service #1, small bandwidth service #2, and large bandwidth service #1 from the client device in sequence.
  • the specific service data processing process is as follows.
  • the service data of the small bandwidth service #1 is sliced into one or more data code blocks #1.
  • the small bandwidth service #2 is divided into one or more data code blocks #2
  • the large bandwidth service #1 is divided into one or more data code blocks #3.
  • OSU-n frames such as OSU-n#1, OSU-n#2 and OSU-n# 3
  • data code block #1, data code block #2 and data code block #3 is the same as the size of the code blocks in the OSU-n frame structure.
  • specific implementation method of encapsulating data code blocks can refer to the current encapsulation process of business data in the OTN network, which will not be described again here.
  • the data code block #1 of OSU#1 and the data code block #2 of OSU#2 are intercepted sequentially, and each of them is intercepted in multiple data code blocks #. 1. Insert the rate adaptation code block into data code block #2 for speed Rate matching results in OSTU sub-data stream #1 and OSTU sub-data stream #2.
  • data code block #3 of OSU #3 is intercepted according to the size of the second time slot block (such as p bytes), and rate adaptation code blocks are inserted into multiple data code blocks #3 for rate matching, Get OSTU substream #3.
  • the specific implementation method of intercepting and rate matching processing of data code blocks can refer to the interception and rate matching processing of business data in the current OTN network, which will not be described again here.
  • the OSTU sub-data streams are sequentially placed in the first time slot block or the second time slot block specified in OSTUG-m according to the time slot configuration table.
  • the OSTU sub-data stream #1 corresponding to the small bandwidth service #1 is placed at the TSL1 position in the first and second columns of OSTUG-m.
  • the OSTU sub-data stream #2 corresponding to the small bandwidth service #2 is placed at the TSL2 position in the first and second columns of OSTUG-m.
  • the OSTU sub-data stream #3 corresponding to the large-bandwidth service #1 is placed in the 4th and m-2 columns of OSTUG-m, occupying the size of the entire column of code blocks. Therefore, the service data of different bandwidths are segmented, encapsulated, intercepted, rate matched and time slot multiplexed in sequence to complete the mapping of multi-channel services into the m-column time slot multiplexing structure OSTUG-m.
  • time slot configuration table may be specified by the protocol or pre-configured. It should also be understood that a bandwidth service can occupy one or more first time slot blocks and second time slot blocks. That is, based on the technical solution of the present application, multi-channel service data to be transmitted can pass through one or more first time slots. Blocks and second time slot blocks are used for mixed time slot multiplexing, which provides greater flexibility.
  • the TS-PTR of the first column in the OSU-m frame indicates that the starting position of the first OSTUG-m in the data stream is column 4 in the first OSU-m frame.
  • Figures 9, 11 and 12 take the mixed processing of large-bandwidth services and small-bandwidth services (for example, encapsulation, rate matching and time slot multiplexing) as an example to illustrate, and support large and small bandwidth services for time slot processing. Reuse and high flexibility.
  • the technical solution of this application can also be applied to multiple small-bandwidth services for encapsulation, rate matching, time slot multiplexing, etc., or it can also be applied to multiple large-bandwidth services for encapsulation, rate matching, time slot multiplexing, etc. , this application does not specifically limit this.
  • equipment in the existing network architecture is mainly used as an example for illustrative explanation (such as OTN equipment), and the embodiments of this application do not limit the specific form of the equipment.
  • devices that can achieve the same function in the future are suitable for this application.
  • the service data processing method provided by the embodiment of the present application is described in detail with reference to FIGS. 4 to 12 .
  • the above business data processing methods are mainly introduced from the perspective of interaction between the receiving end device and the sending end device. It can be understood that, in order to implement the above functions, the receiving end device and the transmitting end device include corresponding hardware structures and/or software modules for performing each function.
  • the communication device provided by the embodiment of the present application will be described in detail below with reference to FIG. 13 . It should be understood that the description of the device embodiments corresponds to the description of the method embodiments. Therefore, for content that is not described in detail, please refer to the above method embodiments. For the sake of brevity, some content will not be described again.
  • Embodiments of the present application can divide the sending end device or the receiving end device into functional modules according to the above method examples.
  • each functional module can be divided corresponding to each function, or two or more functions can be integrated into one place. in the management module.
  • the above integrated modules can be implemented in the form of hardware or software function modules. It should be noted that the division of modules in the embodiment of the present application is schematic and is only a logical function division. In actual implementation, there may be other division methods. The following is an example of dividing each functional module according to each function.
  • Figure 13 is a schematic structural diagram of a service data processing device provided by an embodiment of the present application.
  • device 1300 includes a processor 1301, an optical transceiver 1302 and a memory 1303. Among them, memory 1303 is optional.
  • the device 1300 can be applied to both the sending-side device (eg, the above-mentioned sending-end device) and the receiving-side device (eg, the above-mentioned receiving-end device).
  • the processor 1301 and the optical transceiver 1302 are used to implement the method performed by the sending-side device shown in FIG. 9 or FIG. 11 .
  • each step of the processing flow may be implemented by instructions in the form of hardware integrated logic circuits or software in the processor 1301 to complete the method executed by the sending end device described in the above figures.
  • the optical transceiver 1302 is used to receive the first data frame and send it to the peer device (also called the receiving device).
  • the processor 1301 and the optical transceiver 1302 are used to implement the method performed by the receiving-side device shown in Figure 9 or Figure 11.
  • each step of the processing flow can be implemented by instructions in the form of hardware integrated logic circuits or software in the processor 1301 to complete the method executed by the receiving end device described in the preceding figures.
  • the optical transceiver 1302 is used to receive the first data frame sent by the peer device (also referred to as the sending device) and send it to the processor 1301 for subsequent processing.
  • Memory 1303 is used to store instructions so that process 1301 can be used to perform the steps as mentioned in the above figures. Alternatively, the storage 1303 is also used to store other instructions to configure parameters of the processor 1301 to implement corresponding functions.
  • the processor 1301 and the memory 1303 may be located in a branch board, or may be located in a single board that combines a branch and a line.
  • both the processor 1301 and the memory 1303 include multiple processors, which are respectively located on the branch circuit board and the circuit board, and the two boards cooperate to complete the foregoing method steps.
  • embodiments of the present application also provide a computer-readable storage medium.
  • the storage medium stores a software program.
  • the software program can implement the method provided by any one or more of the above embodiments.
  • the computer-readable storage medium may include: U disk, mobile hard disk, read-only memory, random access memory, magnetic disk or optical disk and other various media that can store program codes.
  • embodiments of the present application also provide a chip.
  • the chip includes a processor for implementing the functions involved in any one or more of the above embodiments, such as obtaining or processing the OTN data frames involved in the above method.
  • the chip further includes a memory, and the memory is used for necessary program instructions and data executed by the processor.
  • the chip may be composed of chips or may include chips and other discrete devices.
  • processors mentioned in the embodiments of this application may be a central processing unit (CPU), or other general-purpose processor, digital signal processor (DSP), or application specific integrated circuit (Application Specification). Specific integrated circuit (ASIC), off-the-shelf programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc.
  • CPU central processing unit
  • DSP digital signal processor
  • Application Specification application specific integrated circuit
  • ASIC application specific integrated circuit
  • FPGA off-the-shelf programmable gate array
  • the processor may be a microprocessor or the processor may be any conventional processor, etc.
  • non-volatile memory can be read-only memory (ROM), programmable ROM (PROM), erasable programmable read-only memory (erasable PROM, EPROM), electrically removable memory. Erase electrically programmable read-only memory (EPROM, EEPROM) or flash memory. Volatile memory can be random access memory (RAM). For example, RAM can be used as an external cache.
  • RAM may include the following forms: static random access memory (static RAM, SRAM), dynamic random access memory (dynamic RAM, DRAM), synchronous dynamic random access memory (synchronous DRAM, SDRAM) , double data rate synchronous dynamic random access memory (double data rate SDRAM, DDR SDRAM), enhanced synchronous dynamic random access memory (enhanced SDRAM, ESDRAM), synchronous link dynamic random access memory (synchlink DRAM, SLDRAM) and Direct memory bus random access memory (direct rambus RAM, DR RAM).
  • static random access memory static random access memory
  • dynamic RAM dynamic random access memory
  • DRAM synchronous dynamic random access memory
  • SDRAM synchronous DRAM
  • double data rate SDRAM double data rate SDRAM
  • DDR SDRAM double data rate SDRAM
  • ESDRAM enhanced synchronous dynamic random access memory
  • SLDRAM synchronous link dynamic random access memory
  • Direct memory bus random access memory direct rambus RAM, DR RAM
  • the processor is a general-purpose processor, DSP, ASIC, FPGA or other programmable logic device, discrete gate or transistor logic device, or discrete hardware component
  • the memory storage module
  • the disclosed devices and methods can be implemented in other ways.
  • the device embodiments described above are only illustrative.
  • the division of the units is only a logical function division. In actual implementation, there may be other division methods.
  • multiple units or components may be combined or can be integrated into another system, or some features can be ignored, or not implemented.
  • the coupling or direct coupling or communication connection between each other shown or discussed may be through some interfaces, and the indirect coupling or communication connection of the devices or units may be in electrical, mechanical or other forms.
  • each functional unit in each embodiment of the present application can be integrated into one unit, or each unit can exist physically alone, or two or more units can be integrated into one unit.
  • the computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device.
  • the computer may be a personal computer, a server, or a network device.
  • the computer instructions may be stored in or transmitted from one computer-readable storage medium to another, e.g., the computer instructions may be transferred from a website, computer, server, or data center Transmission to another website, computer, server or data center by wired (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.) means.
  • the computer-readable storage medium can be any available media that can be accessed by the computer or include one or more sets of available media. Complete servers, data centers and other data storage equipment.
  • the available media may be magnetic media (such as floppy disks, hard disks, magnetic tapes), optical media (such as DVDs), or semiconductor media (such as solid state disks (SSD)).
  • the aforementioned available media may include But it is not limited to: U disk, mobile hard disk, read-only memory, random access memory, magnetic disk or optical disk and other media that can store program code.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Time-Division Multiplex Systems (AREA)

Abstract

Les modes de réalisation de la présente demande concernent un procédé et un appareil de traitement de données de service. Le procédé consiste à : recevoir une pluralité d'éléments de données de service ; sur la base d'une structure de multiplexage d'intervalle de temps, effectuer un multiplexage d'intervalle de temps sur la pluralité d'éléments de données de service, de façon à obtenir un premier flux de données ; mapper celui-ci dans une première trame de données ; et transmettre la première trame de données. La structure de multiplexage d'intervalle de temps comprend m colonnes de blocs de code, l'i-ème colonne de blocs de code étant des premiers blocs d'intervalle de temps, et la j-ième colonne de blocs de code comprenant k seconds blocs d'intervalle de temps ; la première trame de données comprend N colonnes de blocs de code, la première colonne étant des premiers blocs de code de surdébit qui comprennent des premières informations d'indication et des secondes informations d'indication, les premières informations d'indication étant utilisées pour indiquer la position de départ de la structure de multiplexage d'intervalle de temps dans le premier flux de données dans la première trame de données, et les secondes informations d'indication étant utilisées pour indiquer la relation de mappage entre les premiers blocs d'intervalle de temps, les seconds blocs d'intervalle de temps et le premier flux de données. Dans le procédé, sur la base des blocs de code, une structure de trame et la structure de multiplexage d'intervalle de temps sont définies ; en outre, le procédé prend en charge une pluralité de services ayant différentes largeurs de bande dans le multiplexage d'intervalle de temps, simplifie la complexité de traitement et réduit un retard.
PCT/CN2023/097660 2022-06-02 2023-05-31 Procédé et appareil de traitement de données de service WO2023232097A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210621039.X 2022-06-02
CN202210621039.XA CN117221768A (zh) 2022-06-02 2022-06-02 业务数据处理方法和装置

Publications (1)

Publication Number Publication Date
WO2023232097A1 true WO2023232097A1 (fr) 2023-12-07

Family

ID=89026963

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/097660 WO2023232097A1 (fr) 2022-06-02 2023-05-31 Procédé et appareil de traitement de données de service

Country Status (2)

Country Link
CN (1) CN117221768A (fr)
WO (1) WO2023232097A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160119076A1 (en) * 2014-10-24 2016-04-28 Ciena Corporation Channelized oduflex systems and methods
CN113645524A (zh) * 2020-04-27 2021-11-12 华为技术有限公司 一种业务处理的方法、装置及设备
CN114513710A (zh) * 2018-05-10 2022-05-17 华为技术有限公司 光传送网中低速业务数据的处理方法、装置和系统

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160119076A1 (en) * 2014-10-24 2016-04-28 Ciena Corporation Channelized oduflex systems and methods
CN114513710A (zh) * 2018-05-10 2022-05-17 华为技术有限公司 光传送网中低速业务数据的处理方法、装置和系统
CN113645524A (zh) * 2020-04-27 2021-11-12 华为技术有限公司 一种业务处理的方法、装置及设备

Also Published As

Publication number Publication date
CN117221768A (zh) 2023-12-12

Similar Documents

Publication Publication Date Title
US11082199B2 (en) Data transmission method in optical network and optical network device
US11234055B2 (en) Service data processing method and apparatus
WO2020221141A1 (fr) Procédé et dispositif permettant de transmettre des données dans un réseau de transport optique
EP3322111B1 (fr) Redimensionnement sans à-coup dynamique dans des réseaux de transport optique
WO2019128934A1 (fr) Procédé et dispositif d'émission et de réception de services dans un réseau de transport optique
WO2019062227A1 (fr) Procédé de transmission de données, dispositif de transmission, et système de transmission
WO2008122218A1 (fr) Procédé de multiplexage et de démultiplexage de service de faible débit binaire
EP4099712A1 (fr) Procédé, appareil et système de support de service
EP2999170B1 (fr) Procédé d'augmentation et procédé de diminution pour une bande passante de canal optique variable et dispositif
WO2012155710A1 (fr) Procédé et dispositif de mise en œuvre de mappage et de démappage de service otn
WO2022143046A1 (fr) Procédé et système de transmission multiservice, et support de stockage et dispositif électronique
WO2023134508A1 (fr) Procédé, appareil et système de traitement de service dans un réseau de transport optique
WO2020051851A1 (fr) Procédé et appareil de transmission de données dans un réseau de transport optique
WO2023232097A1 (fr) Procédé et appareil de traitement de données de service
WO2021218721A1 (fr) Procédé et appareil de traitement de service
WO2019052539A1 (fr) Dispositif et procédé de traitement de signal
CN116264587A (zh) 一种数据传输的方法以及相关装置
WO2014026576A1 (fr) Procédé et dispositif pour la mise en correspondance de données dans un réseau de transport optique
WO2023231764A1 (fr) Procédé et dispositif de traitement de données de service
CN101350691B (zh) 一种业务汇聚和adm分插复用方法及设备
WO2024051586A1 (fr) Procédé de traitement de trame de données dans un réseau de transport optique, appareil et système
WO2024109349A1 (fr) Procédé et appareil de transmission de données
WO2023134511A1 (fr) Procédé et appareil de traitement de données de service
WO2024109580A1 (fr) Procédé et appareil de transmission de données
WO2023151483A1 (fr) Procédé et dispositif de traitement de trame de données

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: 23815274

Country of ref document: EP

Kind code of ref document: A1