WO2019228201A1 - 一种业务数据的处理方法及装置 - Google Patents

一种业务数据的处理方法及装置 Download PDF

Info

Publication number
WO2019228201A1
WO2019228201A1 PCT/CN2019/087471 CN2019087471W WO2019228201A1 WO 2019228201 A1 WO2019228201 A1 WO 2019228201A1 CN 2019087471 W CN2019087471 W CN 2019087471W WO 2019228201 A1 WO2019228201 A1 WO 2019228201A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
frame
code block
service
data frame
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/CN2019/087471
Other languages
English (en)
French (fr)
Inventor
向俊凌
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to EP19810939.9A priority Critical patent/EP3796577A4/en
Publication of WO2019228201A1 publication Critical patent/WO2019228201A1/zh
Priority to US17/106,486 priority patent/US11234055B2/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • 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/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]
    • H04J3/1658—Optical Transport Network [OTN] carrying packets or ATM cells
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client 
    • H04N21/63—Control signaling related to video distribution between client, server and network components; Network processes for video distribution between server and clients or between remote clients, e.g. transmitting basic layer and enhancement layers over different transmission paths, setting up a peer-to-peer communication via Internet between remote STB's; Communication protocols; Addressing
    • H04N21/647—Control signaling between network components and server or clients; Network processes for video distribution between server and clients, e.g. controlling the quality of the video stream, by dropping packets, protecting content from unauthorised alteration within the network, monitoring of network load, bridging between two different networks, e.g. between IP and wireless
    • H04N21/64784—Data processing by the network
    • H04N21/64792—Controlling the complexity of the content stream, e.g. by dropping packets
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B10/00—Transmission systems employing electromagnetic waves other than radio-waves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
    • H04B10/07—Arrangements for monitoring or testing transmission systems; Arrangements for fault measurement of transmission systems
    • H04B10/075—Arrangements for monitoring or testing transmission systems; Arrangements for fault measurement of transmission systems using an in-service signal
    • H04B10/079—Arrangements for monitoring or testing transmission systems; Arrangements for fault measurement of transmission systems using an in-service signal using measurements of the data signal
    • H04B10/0795—Performance monitoring; Measurement of transmission parameters
    • 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]
    • H04J3/1664—Optical Transport Network [OTN] carrying hybrid payloads, e.g. different types of packets or carrying frames and packets in the paylaod
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client 
    • H04N21/61—Network physical structure; Signal processing
    • H04N21/6106—Network physical structure; Signal processing specially adapted to the downstream path of the transmission network
    • H04N21/6118—Network physical structure; Signal processing specially adapted to the downstream path of the transmission network involving cable transmission, e.g. using a cable modem
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client 
    • H04N21/63—Control signaling related to video distribution between client, server and network components; Network processes for video distribution between server and clients or between remote clients, e.g. transmitting basic layer and enhancement layers over different transmission paths, setting up a peer-to-peer communication via Internet between remote STB's; Communication protocols; Addressing
    • H04N21/647—Control signaling between network components and server or clients; Network processes for video distribution between server and clients, e.g. controlling the quality of the video stream, by dropping packets, protecting content from unauthorised alteration within the network, monitoring of network load, bridging between two different networks, e.g. between IP and wireless
    • H04N21/64723—Monitoring of network processes or resources, e.g. monitoring of network load
    • H04N21/64738—Monitoring network characteristics, e.g. bandwidth, congestion level
    • 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/0057—Operations, administration and maintenance [OAM]
    • H04J2203/0058—Network management, e.g. Intelligent nets
    • 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/0064—Admission Control
    • H04J2203/0067—Resource management and allocation
    • H04J2203/0069—Channel allocation
    • 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
    • H04J2203/0082—Interaction of SDH with non-ATM protocols
    • H04J2203/0085—Support of Ethernet
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J3/00—Time-division multiplex systems
    • H04J3/02—Details
    • H04J3/06—Synchronising arrangements
    • H04J3/0635—Clock or time synchronisation in a network
    • H04J3/0638—Clock or time synchronisation among nodes; Internode synchronisation
    • H04J3/0647—Synchronisation among TDM nodes
    • H04J3/065—Synchronisation among TDM nodes using timestamps
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H04L25/38—Synchronous or start-stop systems, e.g. for Baudot code
    • H04L25/40—Transmitting circuits; Receiving circuits
    • H04L25/49—Transmitting circuits; Receiving circuits using code conversion at the transmitter; using predistortion; using insertion of idle bits for obtaining a desired frequency spectrum; using three or more amplitude levels ; Baseband coding techniques specific to data transmission systems

Definitions

  • the present application relates to the field of optical communication technologies, and in particular, to a method and device for processing service data.
  • OTN optical transport network
  • the minimum supported time slot size is 1.25 gigabits per second (Gbps). For low-rate services that require a transmission rate of less than 1.25 Gbps, if a fixed time slot is used, Mapping this low-rate service will cause a waste of resources.
  • This application provides a method and a device for processing service data to solve the problem of wasting resources in the prior art.
  • an embodiment of the present application provides a method for processing service data, which is applied to a transmitting side and includes: receiving service data, and then mapping the service data to a first number of code blocks of a data frame.
  • the first number of code blocks includes an overhead code block and a data code block; the data code block is used to carry the service data, and the overhead code block includes a data code block used to carry the service data Location information.
  • the overhead code block may further include information about the quantity of data code blocks used to carry the service data.
  • low-rate services can occupy some code blocks according to requirements, and the receiving end can recover service data from the data frames based on the position information in the overhead code blocks. It is possible to avoid wasting resources due to high rates corresponding to time slots and low service rates.
  • the data frame in the embodiment of the present application may be an OTN frame, such as an OPU frame, an ODU frame, an OTU frame, or a FlexO frame.
  • the data frame can also be a FlexE frame.
  • the code block may be a 66B code block.
  • the solution provided in the embodiment of the present application may be applied to a scenario where service data passes through a FlexE network and an OTN network, and may also be applied to a scenario of a FlexE network.
  • a payload code block included in a FlexE frame is configured with a data code block used to carry service data and an overhead code block used to carry location information corresponding to the service data.
  • the data frame When applied to the scenario where service data passes through the FlexE network and the OTN network, in the FlexE network, the data frame is a FlexE frame, and in the OTN network, the data frame can be an ODU frame. Since the FlexE frame uses 66B code blocks, it is no longer It needs to be divided. Only the data code block and the overhead code block for mapping service data in the payload code block need to be determined. In the embodiment of the present application, the OTN frame can be divided into 66B code blocks, so that the transmission equipment corresponding to the two networks The corresponding service data transmitted in each network can be regarded as a 66B code block stream to achieve the purpose that the service data passes through the FlexE network and the OTN network.
  • the data frame includes a second number of code blocks, the data frame is an ODU frame or a Flexible Optical Transport Network FlexO frame, and the second number is greater than or equal to the first number.
  • the data frame can also be a FlexE frame.
  • the data frame is composed of multiple consecutive ODU frames or FlexO frames, and the multiple consecutive ODU frames or the multiple FlexO frames include a third number of code blocks, so The third number is greater than or equal to the first number.
  • another way of dividing data blocks by data frames is provided. An integer number of code blocks are divided by multiple consecutive ODU frames or FlexO frames.
  • the data frame includes a fixed time slot area and an unfixed time slot area
  • the data frame is an ODU frame or a FlexO frame
  • the non-fixed time slot area includes a fourth number of code blocks, The fourth number is greater than or equal to the first number.
  • the first quantity is determined based on a service rate of the service data and a rate of the data frame.
  • the number and location of code blocks used to map service data may be dynamically determined based on a service rate of the service data and a rate of the data frame according to a bandwidth allocation algorithm sent by a receiving controller or a network manager.
  • an embodiment of the present application provides a method for processing service data.
  • the method applying to the transmitting side includes: receiving service data, and then mapping the service data to a first number of code blocks in a data frame;
  • the first number of code blocks is used to map the service data, and
  • an overhead area of the data frame includes at least a first indication field, where the first indication field is used to indicate a position of a code block carrying the service data. .
  • a code block is divided into a payload area of a data frame to carry service data, and an indication field is configured in an overhead area of the data frame to indicate a position of a code block to which the service data is mapped. Therefore, low-rate services can occupy some code blocks according to requirements.
  • the receiving end can recover service data from the data frame based on the content of the indication field in the overhead area. This can avoid the high rate corresponding to the time slot and the low required service rate. Waste of resources.
  • the data frame in the embodiment of the present application may be an OTN frame, such as an OPU frame, an ODU frame, an OTU frame, or a FlexO frame, and the data frame may also be a FlexE frame.
  • the code block is a 66B code block.
  • the solution provided in the embodiment of the present application may be applied to a scenario where service data passes through a FlexE network and an OTN network, and may also be applied to a scenario of a FlexE network.
  • the payload code block included in the FlexE frame is used to carry service data
  • the overhead code block configuration indication field included in the FlexE frame is used to indicate the payload code block of the service data. position.
  • the data frame When applied to the scenario where service data passes through the FlexE network and the OTN network, in the FlexE network, the data frame is a FlexE frame, and in the OTN network, the data frame can be an ODU frame. Since the FlexE frame uses 66B code blocks, it is no longer It needs to be divided, and only the position of the payload code block for mapping service data in the payload code block needs to be determined. In the embodiment of the present application, the OTN frame can be divided into 66B code blocks, so that the transmission equipment corresponding to the two networks The corresponding service data transmitted in the network can be regarded as a 66B code block stream to achieve the purpose that the service data can pass through the FlexE network and the OTN network.
  • the data frame may be composed of multiple consecutive ODU frames, or the data frame may be composed of multiple consecutive FlexO frames.
  • a plurality of consecutive data frames form a multiframe
  • the number of code blocks included in a payload area of each data frame and the overhead area of the multiframe includes the first
  • the number of indication fields including the indication field is the same;
  • the i-th indication field of the multi-frame includes identification information of the service data carried by the i-th code block in the payload area of the data frame, where i is less than or equal to A positive integer equal to n, where n is the number of code blocks included in the payload area of the data frame. That is, the sequence number of the indication field is the same as the sequence number of the code block indicated in the payload area of the data frame.
  • the number of indication fields configured in the overhead area of a data frame does not match the number of code blocks included in the payload area of the data frame. Then, multiple data frames can be used to form a multiframe, thereby configuring the overhead area configuration of the multiframe. The number of indication fields reaches to match the number of code blocks included in the payload area of the data frame.
  • the number and location of the code blocks that carry the service data are determined in the following manner: the code of the data frame that needs to be occupied by the service corresponding to the service data sent by the controller or network manager is received Position information of the block. Specifically, the position information of the code blocks of the data frame that the service needs to occupy may be determined by the controller or the network manager according to the bandwidth of the data frame and the bandwidth required by the service.
  • the method further includes: if it is determined that the bandwidth required for the service changes, sending the changed bandwidth of the service to the controller or the network manager, and receiving the Location information of code blocks of the data frame that the service needs to occupy after a bandwidth change sent by a controller or a network manager; adding handover information to an overhead area of a data frame to which the service data is to be mapped, the handover information It is used to indicate that the position of the service transmitted in each data frame changes from the next multi-frame period; and when the next multi-frame period is reached, based on the service that needs to be occupied after receiving the change in bandwidth, The position information of the code blocks of the data frame maps the service data to the data frame.
  • the controller or network manager is notified, so that the network manager or controller can reconfigure the position of the code block for the service based on the changed bandwidth, and instruct the receiving end from The next multi-frame period begins to send service data through the changed position, so as to avoid that the receiving end does not know when to start updating the position of the code block that parses the service data, resulting in failure of service data recovery.
  • the first number of code blocks used to map the service data may further include an overhead code block and a data code block, where the data code block is used to carry the service data, and the overhead
  • the code block includes clock information and / or time information of the service data mapped to a data frame where the overhead code block is located.
  • An overhead code block is configured in the code block of the payload area to carry the clock information and / Or time information.
  • the first indication field further includes indication information, and the indication information is used to indicate that in a payload area of the data frame, a code block having the same sequence number as the first indication field is arranged Data block or overhead code block.
  • the first number is less than a preset threshold
  • only the first number of code blocks of the first data frame in the multi-frame include the overhead code block.
  • the number of code blocks required by the service data is small, and the service data needs to be configured with clock information and / or time information, only the payload of the first data frame in the multi-frame may be used.
  • the overhead code blocks are configured in the area, and the positions of the overhead code blocks of other data frames are used as data code blocks to carry service data, thereby avoiding waste of resources.
  • an embodiment of the present application provides a method for processing service data.
  • the method is applied to a receiving side and includes: determining a position of a code block that carries service data in a received data frame;
  • the service data is obtained in a code block corresponding to the position included in the payload area.
  • the data frame exists in the form of a code block, and the low-rate service occupies part of the code block, so that the receiving end obtains service data from the code block at a corresponding position in the payload area after determining the location of the service data.
  • the receiving end may be configured in advance with a position of a code block occupied by the service data.
  • determining the position of a code block carrying the service data in the received data frame includes: identifying an overhead code block among multiple code blocks included in the data frame, and the overhead
  • the code block includes position information of a data code block for carrying service data; and acquiring the service data from a code block corresponding to the position included in a payload area of the data frame includes:
  • the service data is obtained from a data code block included in the data frame.
  • the above design provides a feasible way to determine the location of the code block carrying the service data.
  • the code block included in the data frame for mapping the service data is distinguished from the data code block and the overhead code block.
  • the overhead code block carries the service The number information and the position information of the data code block to which the data is mapped.
  • multiple consecutive data frames form a multiframe
  • the number of indication fields included in the overhead area of the multiframe is the same as the number of code blocks included in each data frame.
  • the i-th indication field of the frame includes identification information of the service data carried by the i-th code block in the payload area of the data frame, i is taken as a positive integer less than or equal to n, and n is the net of the data frame
  • the number of code blocks included in the payload area; the determining the location of the code blocks carrying the service data in the received data frame includes: receiving overhead addresses in the overhead area of the multiframe sent by the receiving controller or the network manager;
  • the indication field of the identification information of the service data is determined according to the indication field of the identification information of the service data, and the position of the code block carrying the service data in the data frame is determined.
  • a multiframe is composed of multiple data frames.
  • the overhead area of the multiframe is configured with indicator fields.
  • the number of code blocks included in the payload area is the same.
  • a code block carries the service data, and the indication field corresponding to the code block number in the overhead area carries the identification information of the service data, so that the receiving end can arrange the sequence number of the indication field of the identification information of the carried service data to be able to Determine the location of the code block carrying the service data.
  • the overhead area of the data frame further includes handover information, where the handover information is used to indicate that a position of a service transmitted from the next multi-frame period changes in each data frame;
  • the method further includes: when it is determined that the next multi-frame period is reached, re-determining an indication field carrying identification information of the service data in an overhead area of the next multi-frame according to the switching information; and The indication field of the identification information of the data is obtained from the payload area of the multiframe received from the next multiframe.
  • the location of the bearer service data may be determined in the first multiframe that starts to send service data or the first multiframe that receives each time the handover information is received. Before the next time the handover information is received, Both obtain service data from the data frame based on the position determined in the first multi-frame. In order to shorten the delay time for recovering the service data, the first multiframe can be used only to determine the location of the code block carrying the service data, and the service data in the payload area in the first multiframe is discarded.
  • a code block used to map the service data includes an overhead code block and a data code block, the data code block is used to carry the service data, and the overhead code block includes the service
  • the data is mapped to clock information and / or time information of a data frame in which the overhead code block is located.
  • the indication field further includes indication information, and the indication information is used to indicate a code block in the payload area of the data frame that is the same as the arrangement position of the indication field carrying the indication information Data block or overhead code block.
  • the code block of data includes the overhead code block.
  • the code block is a 66B code block.
  • the data frame is an optical data unit ODU frame, or the data frame is a flexible optical transmission network FlexO frame.
  • the data frame may further include fixed padding.
  • the data frame is composed of multiple consecutive ODU frames, or the data frame is composed of multiple consecutive FlexO frames.
  • the data frame is an ODU frame or a FlexO frame
  • the data frame includes a fixed time slot area and a non-fixed time slot area
  • the code block is located in the non-fixed time slot area.
  • an embodiment of the present application provides a device for processing service data.
  • the device may be applied to a transmitting side and includes a processor and a memory, where the memory is used to store program code; the processor, For reading and executing the program code stored in the memory to implement the method according to the first aspect or any one of the designs of the first aspect, or for implementing the second aspect or any design of the second aspect The method described.
  • an embodiment of the present application provides a device for processing service data.
  • the device may be applied to a receiving side and includes a processor and a memory, where the memory is used to store program code; the processor , For reading and executing the program code stored in the memory to implement the third aspect or any one of the methods of the third aspect design.
  • an embodiment of the present application provides a service data processing system.
  • the system includes the device according to the fourth aspect and the device according to the fifth aspect.
  • a computer storage medium is also provided in the embodiment of the present application.
  • the storage medium stores a software program that can be implemented in the first to third aspects when read and executed by one or more processors. Any method provided by any aspect of the design.
  • an embodiment of the present application provides a computer program product containing instructions, which when executed on a computer, causes the computer to execute the method provided by any one of the first to third aspects.
  • an embodiment of the present application provides a chip that is connected to a memory and is configured to read and execute a software program stored in the memory to implement any one of the first aspect or the third aspect of the design. Provided methods.
  • FIG. 1 is a schematic diagram of an OTN network architecture according to an embodiment of the present application
  • FIG. 2 is a schematic structural diagram of an OTN device according to an embodiment of the present application.
  • 3A is a schematic diagram of an OTN frame provided by an embodiment of the present application.
  • 3B is a schematic diagram of a FlexO frame according to an embodiment of the present application.
  • 4A is a schematic structural diagram of an OTN frame division code block according to an embodiment of the present application.
  • 4B is a schematic structural diagram of another OTN frame division code block according to an embodiment of the present application.
  • FIG. 5 is a schematic structural diagram of multiple OTN frame division code blocks according to an embodiment of the present application.
  • FIG. 6 is a schematic structural diagram of another OTN frame division code block according to an embodiment of the present application.
  • FIG. 7 is a schematic flowchart of a service data processing method according to an embodiment of the present application.
  • FIG. 8 is a schematic structural diagram of an idle code block according to an embodiment of the present application.
  • FIG. 9A is a schematic structural diagram of an overhead code block according to an embodiment of the present application.
  • FIG. 9B is a schematic structural diagram of another overhead code block according to an embodiment of the present application.
  • 9C is a schematic structural diagram of still another overhead code block according to an embodiment of the present application.
  • FIG. 10 is a schematic diagram of the number of code blocks occupied by service data according to an embodiment of the present application.
  • FIG. 11 is a schematic diagram of location information and quantity information added by an overhead code block according to an embodiment of the present application.
  • FIG. 12 is a schematic flowchart of another method for processing service data according to an embodiment of the present application.
  • FIG. 13 is a schematic diagram of a code block map and a code block corresponding structure provided by an embodiment of the present application.
  • FIG. 14 is a schematic diagram of a location of an overhead area that can be occupied by an indication field according to an embodiment of the present application
  • 15 is a schematic structural diagram of a code block formed by an indication field of an overhead area of a multi-frame provided in an embodiment of the present application;
  • FIG. 16 is a schematic diagram of a FlexE frame structure according to an embodiment of the present application.
  • 17 is a schematic diagram of a device for processing service data according to an embodiment of the present application.
  • FIG. 18 is a schematic diagram of another apparatus for processing service data according to an embodiment of the present application.
  • FIG. 19 is a schematic diagram of a device 2200 according to an embodiment of the present application.
  • the multiple involved in the embodiments of the present application refers to two or more.
  • "And / or” describes the association relationship between related objects and indicates that there can be three types of relationships. For example, A and / or B can indicate that there are three cases in which A exists alone, A and B exist, and B exists alone.
  • the embodiments of the present application are applicable to an optical network or a flexible Ethernet (FlexibleEthernet, FlexE) network.
  • FlexibleEthernet FlexE
  • OTN optical networks
  • An OTN is usually formed by connecting multiple devices through optical fibers, and can be composed of different topologies such as line, ring, and mesh according to specific needs.
  • the OTN shown in FIG. 1 is composed of two OTN networks.
  • Each OTN network consists of a certain number of OTN devices (N1 to N7).
  • OTN device may have different functions.
  • OTN equipment is divided into optical layer equipment, electrical layer equipment, and optoelectronic hybrid equipment.
  • Optical layer equipment refers to equipment capable of processing optical layer signals, such as: optical amplifiers (OA), optical add-drop multiplexers (OADM).
  • OA optical amplifiers
  • OADM optical add-drop multiplexers
  • OA can also be called optical line amplifier (OLA), which is mainly used to amplify optical signals to support longer distances under the premise of ensuring the specific performance of optical signals.
  • OVA optical line amplifier
  • OADM is used to spatially transform an optical signal so that it can be output from different output ports (sometimes called directions).
  • OADM can be divided into fixed OADM (fixed OADM, FOADM), configurable OADM (reconfigurable OADM, ROADM), and so on.
  • Electrical layer devices refer to devices capable of processing electrical layer signals, for example, devices capable of processing OTN signals.
  • Optoelectronic hybrid equipment refers to equipment with the ability to process optical layer signals and electrical layer signals.
  • the optical network may further include a controller or a network manager for managing OTN equipment in the optical network.
  • FIG. 2 is a schematic diagram of the hardware structure of a possible OTN device.
  • the OTN device here may refer to any one of N1 to N7 in FIG. 1.
  • an OTN device includes a power supply, a fan, and an auxiliary board, and may further include a tributary board, a circuit board, a crossover board, an optical layer processing board, and a system control and communication board.
  • the types and number of boards included in each device may be different.
  • the network equipment as the core node may not have a tributary board.
  • a network device as an edge node may have multiple tributary boards.
  • the power supply is used to supply power to OTN equipment, which may include main and backup power.
  • the fan is used to cool the device.
  • Auxiliary boards are used to provide auxiliary functions such as external alarms or access to an external clock.
  • Tributary boards, cross boards, and circuit boards are mainly used to process electrical layer signals of OTN.
  • the tributary board is used to implement the reception and transmission of various customer services, such as SDH services, packet services, Ethernet services, and fronthaul services.
  • the tributary board can be divided into a client-side optical module and a signal processor.
  • the customer-side optical module may be an optical transceiver for receiving and / or transmitting service data.
  • the signal processor is used to implement mapping and demapping processing of service data to data frames.
  • the cross-connect board is used to exchange data frames and complete the exchange of one or more types of data frames.
  • the circuit board mainly implements processing of data frames on the line side.
  • the circuit board may be divided into a line-side optical module and a signal processor.
  • the line-side optical module may be a line-side optical transceiver, which is used to receive and / or send data frames.
  • the signal processor is used to implement multiplexing and demultiplexing of data frames on the line side, or mapping and demapping processing.
  • System control and communication boards are used to implement system control and communication. Specifically, information can be collected from different boards through the backplane, or control instructions can be sent to the corresponding boards. It should be noted that, unless specifically stated, specific components may be one or more, and this application does not make any restrictions. It should also be noted that the embodiments of the present application do not place any restrictions on the types of boards included in the device and the specific functional design and number of boards.
  • the data frame used by the OTN device in the embodiment of the present application may be an OTN frame, or the data frame is composed of multiple OTN frames, and is used to map various service data, which can implement management and monitoring of service data.
  • the OTN frame may be an optical data unit (ODU) k, ODUCn, ODUflex, or an optical channel transmission unit (OTU) k, OTUCn, or a flexible OTN (FlexO) frame.
  • the FlexO frame can be a FlexO-short distance interface (SR) frame, or a FlexO-long distance interface (LR) frame.
  • the data frame can also be other frame structures suitable for optical networks.
  • the OTN frame may have a structure of 4 ⁇ 4080 bytes, that is, 4 rows ⁇ 4080 columns.
  • the OTN frame structure includes a frame positioning area, an OTU overhead (OH), an ODUOH, an optical channel payload unit (OPU) OH, an OPU payload area (payload area), and an FEC area.
  • OH OTU overhead
  • ODUOH optical channel payload unit
  • OPU payload area payload area
  • FEC area FEC area
  • the first 16 columns are overhead areas
  • the last 256 columns are FEC check areas
  • the middle 3808 columns are payload areas.
  • the OTN frame may not include the parity region of the trailing 256 columns.
  • the frame alignment overhead may include two parts: a frame alignment signal (FAS), and a multiframe alignment signal (MFAS).
  • FAS frame alignment signal
  • MFAS multiframe alignment signal
  • multiple OTN frames constitute an OTN multiframe, for example, 8 OTN frames constitute an OTN multiframe.
  • OPUk is used to carry service data, including the OPU payload area and OPU OH, where k represents the rate class of the OPU.
  • k 0,1,2,3,4 correspond to 1.25G, 2.5G, 10G, 40G, 100G respectively.
  • k flex, that is, OPUflex, can correspond to any rate level, and is only used to carry single-channel services.
  • k Cn, that is, OPUCn, which corresponds to a speed level of n times 100G.
  • ODUk is an information structure used to support OPUk. It consists of OPUk and ODUk. Similarly, the capacity of ODUk is distinguished by k.
  • ODUflex consists of OPUflex and ODUflex OH.
  • OTUk consists of ODUk, FEC area, and OTUk OH.
  • OTUCn consists of ODUCn, OTUCn, and OH, which does not include the FEC region.
  • the low-rate service involved in the embodiments of the present application refers to a rate that is lower than the rate of ODU0.
  • the rate of ODU0 is 1.25Gbps.
  • the FlexO-SR frame has a structure of 128 ⁇ 5440 bits.
  • the 5440-bit structure of the first line of the frame structure includes an alignment marker (AM) area and an OH area.
  • the next 300 bits of the 5440 bits of each line are the FEC area. Excluding the AM area, overhead area, and FEC area, the remaining bits constitute the payload area.
  • multiple FlexO-SRs may form a FlexO-SR multiframe, for example, eight FlexO-SRs form a multiframe. Therefore, the overhead structure of the FlexO-SR multi-frame can be formed by combining the overheads of the eight FlexO-SRs.
  • each frame in a multi-frame can be indicated by defining MFAS.
  • an embodiment of the present application proposes a structure with a smaller granularity than a data frame, and the structure is carried by the data frame.
  • This structure can be called a code block, that is, a data frame is divided into multiple code blocks.
  • the structure may also be named by other names, which are not specifically limited in the embodiment of the present application.
  • the code block may be a 66-bit (bit, B) code block, or the code block may be a code block occupying other bits, but the rate of the code block is less than 1Gbps, such as 128bit, 256bit, and the like.
  • Low-rate services can be SDH level 1 synchronous transfer module (STM-1) signals, or virtual container (VC) -12, VC-3, or VC that parses STM-1 signals -4 particles can also be Fast Ethernet (FE) services in the Ethernet service.
  • STM-1 signals SDH level 1 synchronous transfer module
  • the OTN frame shown in FIG. 3A is taken as an example for description.
  • the division method of the FlexO frame is similar to the division method of the OTN frame shown in FIG. 3A, and is not described herein again.
  • the remaining bits may be divided The number is inserted into a fixed pad and is not used for transmitting business data.
  • the payload area of an OTN frame occupies 4 ⁇ 3808 ⁇ 8 bits
  • each row 3808 ⁇ 8% 66 38
  • each line of the payload area of an OTN frame is configured with 461 code blocks
  • the last 38 bits of each line of the payload area are fixed padding, as shown in FIG. 4B.
  • Code blocks can be divided for multiple OTN frames as a whole (that is, as a data frame). Taking the OTN frame shown in FIG. 3A as an example, the payload area of an OTN frame occupies 4 ⁇ 3808 ⁇ 8 bits, and the code block is 66B as an example.
  • the payload area of an OTN frame can be divided into a fixed time slot area and a non-fixed time slot area, and code blocks are divided in the non-fixed time slot area.
  • Figure 6 shows an example.
  • the first half is used as a non-fixed time slot area
  • the second half is used as a fixed time slot area. That is, the first 4 ⁇ 1904 ⁇ 8 bits of the payload area are used as the non-fixed time slot area, and the last 4 ⁇ 1904 ⁇ 8 bits are used as the fixed time slot area.
  • the receiving node (as the OTN device at the receiving end) needs to know which service data corresponding to which service is mapped to which code block or codes, Therefore, the receiving node needs to know the position of the service data of the service in the payload area of the data frame.
  • the first method distinguish the data code block and the overhead code block from the code blocks in the payload area of the data frame.
  • the data code block is used to carry service data
  • the overhead code block is used to indicate the location of the code block to which the service data is mapped.
  • an indication field is configured in the overhead area of the data frame, and the indication field is used to indicate the position of the code block carrying the service data.
  • FIG. 7 shows a method for processing service data in the first manner. The method includes the following steps:
  • a sending node (an OTN device on the sending end) receives service data.
  • the sending node maps the service data to a first number of code blocks in a data frame.
  • the first number of code blocks includes an overhead code block and a data code block.
  • the data code block is used to carry the service data
  • the overhead code block includes location information of the data code block used to carry the service data.
  • the overhead code block may further include information about the number of data code blocks carrying the service data, that is, indicating the first number.
  • S703 The sending node sends the data frame to the receiving node.
  • the receiving node After receiving the data frame, the receiving node determines the position of the code block carrying the service data in the data frame, and obtains the service data from the code block corresponding to the position included in the payload area of the data frame. Specifically, in the first mode, the receiving node obtains service data in the following manner:
  • the receiving node receives a data frame.
  • the receiving node identifies an overhead code block among a plurality of code blocks included in the data frame.
  • the overhead code block includes location information of a data code block for carrying service data.
  • the overhead code block may further include information about a quantity of data code blocks carrying service data.
  • the number of data code blocks can be obtained according to the location information. For example, when there are positions of three data code blocks, it can be determined that there are three data code blocks that carry the service data.
  • the overhead code block may further include identification information of service data, so as to determine which kind of service data is carried by the code block indicated by the location information included in the overhead code block according to the identification information of the service data in the overhead code block.
  • the receiving node obtains the service data from the data code block included in the data frame.
  • the sending node when it maps the service data to the first number of code blocks of the data frame, it can use an idle mapping procedure (IMP) method or a generic mapping procedure (Generic mapping procedure) method.
  • IMP can be used to implement mapping.
  • PTT packet
  • IMP can be used to implement mapping.
  • IDLE idle code blocks for rate adaptation of service data and data frames.
  • idle code blocks may be inserted between 66B code blocks after transcoding the service data. .
  • the structure of the idle code block may be shown in FIG. 8.
  • CBR constant bit rate
  • TDM time division multiplexing
  • mapping can be implemented using GMP.
  • the TDM service may be: a synchronous digital hierarchy (SDH), a video-based serial digital interface (SDI), or a transparent Ethernet bit stream.
  • mapping described in the embodiments of the present application may be a direct mapping.
  • business data is mapped into data frames such as ODUflex or OTNCn or FlexO.
  • It can also be multi-layer mapping, such as mapping service data to ODUflex data frames, and then mapping ODUflex to OTUCn, and then sending OTUCn to the receiving node.
  • the data frame can be ODU0, ODUflex, and so on. If it is multi-layer mapping, in step S702, the sending node maps the service data to the first number of code blocks of the data frame, and then maps the data frame to another data frame (for example, ODUCn or FlexO frame). ).
  • the sending node sends the data frame in step S703: sending ODUCn, FlexO frame, etc. to the receiving node.
  • the data frame received by the receiving node is to receive ODUCn, FlexO frames, etc., and demap ODU0, ODUflex from ODUCn, FlexO frames, etc. Then, the overhead code blocks included in the ODU0 and ODUflex frames are identified, and the service data is obtained from the data code blocks included in the data frame according to the quantity information.
  • FIG. 9A shows the structure of an O-code block.
  • SH is the synchronization header
  • the value of the synchronization header is binary 10, which is used to indicate that the code block is a control code block
  • 0 to 7 bits are used to indicate the type of the code block, whose value is 0x4B, and the value is from 32 to 35 bits.
  • It is 0x6, 0-7bit plus 32-35bit is used to indicate that the code block type is a type of O code block, which is a code block type applied to Ethernet
  • 8-31, 36- 63 bits are used to monitor the definition of overhead.
  • the structure of the O code block may be applied as an overhead code block.
  • a code block position field is defined at 8-31, 36-63 bits, and is used to carry a data frame corresponding to the overhead code block in a data frame. Location and quantity information in.
  • the overhead code block may further include at least one of the following fields: a label field, a check (CRC) field, a reserve field, and a time stamp field.
  • the label field is used to carry identification information of the service data.
  • the check field is used to check the correctness of the code block, for example, it is used to check the correctness of one or several fields of the code block.
  • the reserved field is used for further definition of monitoring overhead or establishment of a multi-frame period.
  • the time stamp field is used for clock recovery of a clock and / or time transparent transmission service, and is used to carry time information and / or clock information for service data mapping.
  • the number of bits occupied by each field of the overhead code block involved in any embodiment of the present application can be configured according to requirements, which is not specifically limited in this application.
  • FIG. 9B an example of a 66B overhead code block structure is shown.
  • the label field occupies 16 bits
  • the code block position field is divided into two parts, occupying a total of 16 bits
  • the check field occupies 8 bits
  • the reserved field RES occupies 12 bits.
  • FIG. 9C an example of a 66B overhead code block structure is shown.
  • the label field occupies 16 bits
  • the code block position field is divided into two parts, occupying a total of 16 bits
  • the check field occupies 8 bits.
  • the time stamp field occupies 8 bits
  • the reserved field occupies 4 bits.
  • the two code block position fields can also be combined into one.
  • FIG. 9B and FIG. 9C are only examples of the structure of the overhead code block, and do not specifically limit the structure of the overhead code block.
  • the first number of code blocks occupied by the service data when determining the first number of code blocks occupied by the service data in this embodiment of the present application, it may be determined based on a service demand rate corresponding to the service data and a data frame rate.
  • the payload area of an ODUflex frame is divided into an integer number of 66B code blocks, and each code block rate is expressed as ODUflex.66b.
  • the distribution position of the first number of code blocks in the payload area of the data frame may be statically configured.
  • a controller or a network manager that manages a sending node configures the service for mapping the service.
  • the position of the code block of data is sent to the sending node.
  • the distribution position of the first number of code blocks in the payload area of the data frame may be dynamic.
  • a bandwidth allocation algorithm is configured for each sending node in advance, so that the sending node determines the code blocks that map service data in the data frame according to the bandwidth allocation algorithm. Location.
  • the bandwidth allocation algorithm can satisfy the distribution of the code blocks mapped by the service data of each sending node in the data frame as evenly as possible.
  • the position information of the data code block to which the determined service data is mapped may be added to the overhead code block corresponding to the service.
  • the number of bits occupied by the code block position field defined by the overhead code block is not sufficient to indicate the first number of code block positions, it may be indicated in the form of a multiframe.
  • n is 3, and two data may be used.
  • the frame is used as two overhead code blocks in a multi-frame to indicate the position of the data code block used to map the service data in each data frame, and may also indicate the number of data code blocks.
  • the location information may be a position of a code block carrying the service data relative to a previous code block.
  • the position of the first data code block relative to the overhead code block For example, the position of the first data code block relative to the overhead code block, the position of the second data code block relative to the first data code block, and so on.
  • the position of the first code block in the first OTN frame of the OTN multiframe is The field is used to carry information about the number of data code blocks used to map the service data.
  • the second code block location field is used to carry the relative position information of the first data code block and the overhead code block, that is, the first data code block and the overhead. Number of code block intervals.
  • the first code block position field is used to carry the relative position information of the second data code block and the first data code block
  • the second code block position field is used to carry the third The relative position information of the two data code blocks and the second data code block. Therefore, after receiving the OTN frame, the receiving node determines the overhead code block in the OTN frame, and then locates the code block location carrying the service data according to the location information carried in the location field in the overhead code block, thereby recovering the service data.
  • FIG. 12 provides a method for processing business data in the second manner.
  • an indication field is configured through an overhead area, and the indication field is used to indicate a position of a code block for mapping service data in a data frame.
  • the method provided in FIG. 12 includes the following steps:
  • the sending node receives service data.
  • the sending node maps the service data to a first number of code blocks in a data frame.
  • the first number of code blocks is used to map the service data, and an overhead area of the data frame includes at least one first indication field, where the first indication field is used to indicate a code block that carries the service data. s position.
  • the indication field included in the overhead area of the multiframe the indication field carrying the identification information of the service data is referred to as a first indication field.
  • the first indication field includes identification information of the service data.
  • the i-th indication field of the multi-frame includes identification information of service data carried by the i-th code block in a payload area of the data frame, where i is a positive integer less than or equal to n, where n is the The number of code blocks included in the payload area of the data frame.
  • i is a positive integer less than or equal to n
  • n is the The number of code blocks included in the payload area of the data frame.
  • the multiple indication fields that are sorted in the multi-frame are referred to as a code block map
  • the second indication field is used to indicate which kind of service data is carried by the second code block in the data frame, and so on.
  • the indication field can occupy the tandem connection monitor (TCM) field and the reserved field in the overhead area of ODUflex, as shown in the area surrounded by the thick black frame in FIG. 14.
  • RES indicates a reserved field.
  • Two bytes are used as an indication field to carry identification information of service data of a certain service.
  • An ODUflex can include 12 indication fields. Taking a data frame as an ODUflex as an example, an ODUflex can be divided into 1844 66B code blocks, so the overhead area that requires 154 ODUflex frames can indicate the payload area of an ODUflex frame. Business data carried by a code block.
  • 1844 indication fields in the code block map are required. It can indicate the position of 1844 code blocks, and the remaining 4 indicating fields can be invalid filled.
  • the service data corresponding to service i occupies the first code block, the 463th code block, the 925th code block, and the 1387th code block of the payload area of each ODUflex.
  • the first indication field, the 463th indication field, the 925th indication field, and the 1387th indication field in the code block map composed of the indication field included in the overhead area of the multiframe all include the identification information of the service i, see Figure 15 shows.
  • the receiving node After receiving the data frame, the receiving node determines the position of the code block carrying the service data in the data frame, and obtains the service data from the code block corresponding to the position included in the payload area of the data frame.
  • a plurality of consecutive data frames form a multiframe, and the number of indication fields included in the overhead area of the multiframe is the same as the number of code blocks included in each data frame.
  • the receiving node may determine the position of the code block carrying the service data according to the code block map in the overhead area of the multi-frame. In another possible implementation manner, the receiving node may be pre-configured with the position information of the code block carrying the service data, so as to obtain the position of the code block carrying the service data according to the configured position information.
  • the receiving node performs the following steps:
  • the receiving node receives a data frame.
  • the receiving node determines a location in a overhead area of the multiframe where the first indication field of the identification information of the service data is located.
  • the receiving node obtains the service data from a code block corresponding to the position included in a payload area of the data frame.
  • the receiving node determines that the indication field carrying the identification information of service i is the first indication in the code block map.
  • Field, 463th indication field, 925th indication field, and 1387th indication field so that the code block carrying the service i in each data frame can be determined as the first and 462th in the payload area of the data frame , 925th, and 1387th, further, the receiving node obtains the service from the first code block, the 462th code block, the 925th code block, and the 1387th code block of the payload area of each data frame. i data.
  • the receiving node may obtain, from the multiframe, the position of the first indication field of the identification information carrying the service data, and then according to the first multiframe learned from the first multiframe, The position of the indicator field determines the position of the code block carrying the service data in the data frame.
  • the position of the code block carrying the service data cannot be determined until the first multiframe is received.
  • the position of the code block carrying the service data can only be known after the frame. Therefore, in order to reduce the delay of receiving data, the service data carried in each data frame received in the first multi-frame can be discarded, and the second multi-frame is subsequently received. Initially, the service data is acquired from the data frame according to the position of the code block carrying the service data learned from the first multi-frame.
  • the receiving node may be pre-configured with location information of code blocks that carry service data, so that the receiving node includes a code indicated by the location information included in a payload area of the data frame.
  • the business data is obtained in a block.
  • the distribution positions of the code blocks for mapping each service data in the payload area of the data frame may be statically configured for each sending node.
  • the distribution position of the code blocks used to map each service data in the payload area of the data frame may also be dynamic.
  • the controller or the network manager determines the position of the code blocks used to map each service data according to the bandwidth allocation algorithm, and Notify each receiving node.
  • a controller or a network manager that manages a sending node determines a location of a code block used to map each service data, it can be implemented in the following manner:
  • the controller or the network manager receives the service bandwidth reported by each sending node, so as to be able to determine the bandwidth required for the service to be transmitted by each sending node, and determine each bandwidth based on the bandwidth of the data frame and the bandwidth required by each service.
  • the number and position of code blocks of the data frame occupied by the service After that, the controller or the network manager sends the number and position of the code blocks occupied by each service data frame to the corresponding sending nodes respectively.
  • the changed service bandwidth may be sent to the controller or the network manager, so that the controller or the network manager can determine the sending node If the bandwidth required for the transmitted service changes, the number and position of code blocks in the data frame occupied by each service is re-determined according to the bandwidth of the data frame and the changed bandwidth required by the service, that is, re-determined A code block map of the overhead area of the multi-frame; and send the re-determined code block map to each sending node (including the sending node 1), so that the sending node 1 adds handover information to the overhead area of the data frame to be mapped next, the handover
  • the information is used to indicate that the position of the service transmitted in each data frame changes from the next multi-frame period.
  • the switching information may occupy other reserved fields in the overhead area other than the reserved fields occupied by the indication field.
  • the receiving node 1 corresponding to the sending node 1 determines that the overhead area of the received data frame includes switching information, when the next multi-frame period is reached, the bearer in the overhead area of the next multi-frame is re-determined according to the switching information. Obtaining the location of the indication field of the identification information of the service data; and obtaining the service data from the payload area of the multiframe received from the next multiframe according to the newly determined position.
  • the code frame divided by the data frame used by the method shown in FIG. 12 may further include an overhead code block.
  • the overhead code block is used to carry clock information and / or time information of a data frame where the service data is mapped to the overhead code block.
  • the indication field in the code block map may be extended to indicate different code block types. Specifically, the indication field is divided into two parts, one part is used to carry identification information of service data, and the other part is used to carry code block type indication information, and the indication information is used to indicate in a payload area of the data frame,
  • the code block that is the same as the arrangement position of the indication field carrying the indication information is a data code block or an overhead code block.
  • the first 5 bits distinguish whether it is currently used as a data code block or as an overhead code block, and the last 11 bits carry identification information of service data.
  • the overhead code blocks may be included in the corresponding number of code blocks of only the first data frame of the multi-frame .
  • the controller or the network manager determines the position of the code block, conditions may be added.
  • an overhead code block exists in the first data frame, and the overhead code block is used as a data code block in subsequent data frames.
  • the service that occupies overhead code blocks as data code blocks that is, a fixed gap is formed in the first data frame of each multi-frame period. For example, each data frame is allocated k code block positions, and one multi-frame period includes L frames.
  • the effective rate of this service is: the data rate of the code block * (L * k-1) / L * k. The advantage of this is that it can improve the utilization efficiency of data frames.
  • the solutions provided in the embodiments of the present application can save resources by dividing code blocks with smaller granularity to carry low-rate services.
  • the code block is a 66B code block
  • the solution provided in this embodiment of the present application can be applied to the scenario where the FlexE network and the OTN network are used for service transmission.
  • both the sending node and the receiving node in the embodiment of the present application support the FlexE port.
  • Both the sending node and the receiving node include a MAC layer and a physical layer, and a FlexEshim layer is defined in the physical layer.
  • the FlexE shim layer uses n 100-gigabit Ethernet (GE) rates and uses a time-division multiplexing mechanism to divide the data (service data) of FlexE customers at multiple different transmission rates in the MAC layer according to fixed time slots ( For example, 5G time slots or 25G time slots) are scheduled and distributed as FlexE frames with n transmission rates of 100 Gbit / s.
  • GE 100-gigabit Ethernet
  • the FlexE shim layer divides the time domain resources of the optical module with a transmission rate of 100 Gbit / s into 20 5G time slots, and then schedules and distributes n FlexE frames with a transmission rate of 100 Gbit / s at 25 G time slot granularity.
  • Figure 16 shows a schematic diagram of the FlexE frame structure.
  • the FlexEshim layer continuously transmitted 1023 payload code blocks through each of the 5G time slots in the 20 5G time slots, that is, 20 * 1023 payload code blocks were continuously transmitted through 20 5G time slots.
  • the FlexE Shim layer inserts an overhead code block (overhead, OH) before 20 * 1023 consecutive payload code blocks, so that 1 + 20 * 1023 code blocks (including overhead code blocks and payload code blocks) constitute One FlexE frame.
  • the size of the overhead code block and the payload code block are equal, both equal to 66B.
  • the overhead code block included in the FlexE frame itself is referred to as the first overhead code block, and the payload code block
  • the defined overhead code block is called a second overhead code block.
  • the definition of the first overhead code block of the FlexE frame also needs to be extended, and the Calendar field and the reserved field in multiple first overhead code blocks included in the multiframe are added.
  • the specific implementation of the code block map is similar to that of the OTN frame, and is not repeated here.
  • the sending node When applied to the scenario where service transmission passes through the FlexE network and the OTN network, for example, the sending node supports the FlexE port and transmits service data in the form of a FlexE frame format; the receiving node supports OTN, but the solution provided by the embodiment of this application, the FlexE pipeline
  • the FlexE frames transmitted in the transmission and the OTN frames transmitted in the OTN pipeline both adopt the form of a 66B code block stream. Therefore, the receiving node only needs to configure a FlexE port for receiving FlexE frames, and then extract the code blocks in the FlexE frame for the 66B code blocks Continue subsequent processing.
  • the receiving node after receiving a FlexE frame through a FlexE port, the receiving node obtains a 66B payload code block of the FlexE frame, determines a second overhead code block in the payload code block, and The position information of the data code block to which the service data included in the second overhead code block is extracted, so that the service data is recovered from the data code block of the corresponding position according to the second overhead code block including the quantity information and the position information. If it needs to send to the next node further, the payload code block that can be obtained by the receiving node is further mapped into the ODU frame and sent to the next node.
  • the receiving node after receiving the FlexE frame through the FlexE port, the receiving node obtains the payload block of the FlexE frame, and based on the identifier of the service data carried in the first overhead code block of the FlexE frame The position of the indication field of the information determines the position of the data code block to which the service data is mapped, thereby recovering the service data from the data code block at the corresponding position. If it needs to send to the next node further, it can further add the 66B payload code block ODU frame in the obtained FlexE frame, and add the identification information of the service data in the corresponding indication field of the overhead area of the ODU frame, and Send the ODU frame to the next node.
  • the embodiments of the present application can also be applied to the scenario where the sending node supports OTN and the receiving node supports FlexE.
  • the receiving node only needs to configure a port that supports OTN frames.
  • the specific processing methods are similar in the two scenarios. Cross-reference, not repeated.
  • an embodiment of the present application further provides a device for processing service data.
  • the device is applied to a transmitting node, that is, an OTN device or a FlexE device on the transmitting side.
  • the device may specifically be a processor, a chip, a chip system, or a functional module for sending.
  • the device may be located in the branch board shown in FIG. 2 or may be implemented by the branch board.
  • the device includes a receiving unit 2001, a mapping unit 2002, and a sending unit 2003.
  • the receiving unit 2001 is used to execute S701 or S1201, the mapping unit 2002 is used to execute S702 or S1202, and the sending unit 2003 is used to execute S703 or S1203.
  • the three units may also perform other related optional steps performed by the sending node mentioned in any of the foregoing embodiments, and details are not described herein again.
  • the embodiment of the present application further provides another apparatus for processing service data.
  • the device is applied to a receiving node, that is, an OTN device or a FlexE device on the receiving side.
  • the device may be a processor, a chip, a chip system, or a functional module for receiving.
  • the device may be located in the tributary board shown in FIG. 2, or the device may be the tributary board shown in FIG. 2. .
  • the device may include a receiving unit 2101, an identifying unit 2102, and an acquiring unit 2103.
  • the receiving unit 2101 is configured to perform S704 or S1204, the identifying unit 2102 is configured to perform S705 or S1205, and the acquiring unit 2103 is used to execute S706 or used to execute S1206.
  • the three units may also perform other related optional steps mentioned in any of the foregoing embodiments performed by the receiving node, and details are not described herein again.
  • each functional unit in each embodiment of the present application may be integrated in one processor, or may exist separately physically, or two or more units may be integrated in one unit.
  • the above integrated unit may be implemented in the form of hardware or in the form of software functional unit.
  • the device 2200 includes a communication interface 2210, a processor 2220, and a memory 2230.
  • the device can be used in both sending and receiving nodes.
  • the receiving unit 2001, the mapping unit 2002, and the sending unit 2003 shown in FIG. 17 may be implemented by the processor 2220, such as the tributary board shown in FIG.
  • the processor 2220 receives the service data through the communication interface 2210, and is used to implement the methods performed by the sending nodes in FIG. 7 and FIG. 12.
  • each step of the processing flow may complete the method performed by the sending node described in FIG. 7 or FIG. 12 through an integrated logic circuit of hardware in the processor 1320 or an instruction in the form of software.
  • the receiving unit 2101, the identifying unit 2102, and the obtaining unit 2103 shown in FIG. 18 may be implemented by the processor 2220, such as the tributary board described in FIG.
  • the processor 2220 receives the service data through the communication interface 2210, and is configured to implement the method performed by the receiving node described in FIG. 7 and FIG. 12.
  • each step of the processing flow may complete the method performed by the receiving node described in FIG. 7 or FIG. 12 through instructions in the form of hardware integrated logic circuits or software in the processor 2120.
  • the communication interface 2210 may be a circuit, a bus, a transceiver, or any other device that can be used for information interaction.
  • the other device may be a device connected to the device 2200.
  • the other device may be a receiving node or an intermediate node.
  • the processor 2220 in the embodiment of the present application may be a general-purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, and a discrete hardware component, which may be implemented or executed.
  • a general-purpose processor may be a microprocessor or any conventional processor or the like.
  • the steps of the method disclosed in combination with the embodiments of the present application may be directly implemented by a hardware processor, or may be performed by a combination of hardware and software units in the processor.
  • the program code executed by the processor 2220 to implement the foregoing method may be stored in the memory 2230.
  • the memory 2230 and the processor 2220 are coupled.
  • the coupling in the embodiments of the present application is an indirect coupling or communication connection between devices, units or modules, and may be electrical, mechanical or other forms for information exchange between devices, units or modules.
  • the processor 2220 may operate in cooperation with the memory 2230.
  • the memory 2230 may be a non-volatile memory, such as a hard disk (HDD) or a solid-state drive (SSD), etc., and may also be a volatile memory, such as a random access memory (random -access memory, RAM).
  • the memory 2230 is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.
  • the embodiments of the present application are not limited to the specific connection medium between the communication interface 2210, the processor 2220, and the memory 2230.
  • the memory 2230, the processor 2220, and the communication interface 2210 are connected by a bus in FIG. 19, and the bus is indicated by a thick line in FIG. It is not limited.
  • the bus can be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, only a thick line is used in FIG. 19, but it does not mean that there is only one bus or one type of bus.
  • an embodiment of the present application further provides a computer storage medium.
  • a software program is stored in the storage medium, and when read and executed by one or more processors, the software program can implement any one or more of the foregoing.
  • the computer storage medium may include various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory, and a random access memory.
  • an embodiment of the present application further provides a chip, and the chip includes a processor, configured to implement a function involved in any one or more of the foregoing embodiments, for example, to obtain or process a data frame involved in the foregoing method.
  • the chip further includes a memory, and the memory is configured to execute necessary program instructions and data executed by the processor.
  • the chip may be composed of a chip, and may also include a chip and other discrete devices.
  • this application may be provided as a method, a system, or a computer program product. Therefore, this application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Moreover, this application may take the form of a computer program product implemented on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.
  • computer-usable storage media including, but not limited to, disk storage, CD-ROM, optical storage, etc.
  • These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to work in a specific manner such that the instructions stored in the computer-readable memory produce a manufactured article including an instruction device, the instructions
  • the device implements the functions specified in one or more flowcharts and / or one or more blocks of the block diagram.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device, so that a series of steps can be performed on the computer or other programmable device to produce a computer-implemented process, which can be executed on the computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more flowcharts and / or one or more blocks of the block diagrams.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Computer Security & Cryptography (AREA)
  • Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Time-Division Multiplex Systems (AREA)

Abstract

本申请提供了一种业务数据的处理方法及装置，用于解决现有技术存在的资源浪费的问题。为了适用于低速率业务，本申请对数据帧进行了划分，划分更小粒度的码块，根据业务需求，将接收到的业务数据映射到数据帧的相应数量的码块中。并通过数据帧指示承载该业务数据的码块的位置，一种是数据帧的净荷区域的码块中分为数据码块和开销码块，开销码块用来指示承载业务数据的数据码块的位置，另一种是在数据帧的开销区域配置指示字段，指示字段用于指示数据帧的净荷区域中承载业务数据的码块的位置。

Description

一种业务数据的处理方法及装置
本申请要求在2018年06月01日提交中国专利局、申请号为201810558341.9、发明名称为“一种业务数据的处理方法及装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及光通信技术领域，尤其涉及一种业务数据的处理方法及装置。
背景技术
视频类业务的发展推动了用户到数据中心(data central，DC)的流量的增长。为满足视频类业务的带宽的需求，将光传送网(optical transport network，OTN)部署的位置进一步下沉，即OTN网络部署更加靠近用户，从而满足不同业务，比如固定业务、移动业务、专线业务等的差异化承载需求。
现在OTN网络支持的时隙粒度较大，最小支持的时隙大小为1.25吉比特每秒(gigabit per second,Gbps)，对于要求传输速率小于1.25Gbps的低速率业务来说，如果采用固定时隙映射该低速率业务，会造成资源浪费。
发明内容
本申请提供一种业务数据的处理方法及装置，以解决现有技术有资源浪费的问题。
第一方面，本申请实施例提供了一种业务数据的处理方法，该方法应用于发送侧，包括：接收业务数据，然后将所述业务数据映射到数据帧的第一数量的码块。其中，所述第一数量的码块中包括开销码块和数据码块；所述数据码块用于承载所述业务数据，所述开销码块包括用于承载所述业务数据的数据码块的位置信息。可选地，开销码块中还可以包括用于承载所述业务数据的数据码块的数量信息。
本申请实施例中通过对数据帧划分数据码块以及开销码块的方式，低速率业务可以根据需求占用部分码块，接收端能够基于开销码块中位置信息来从数据帧中恢复业务数据，可以避免由于时隙对应的速率高，而业务速率低导致的资源浪费。
本申请实施例中的数据帧可以是OTN帧，比如OPU帧，ODU帧、OTU帧、或FlexO帧等。数据帧还可以是FlexE帧。
在一种可能的设计中，所述码块可以为66B码块。在这种情况下，本申请实施例提供的方案可以应用于业务数据穿通FlexE网络和OTN网络的场景下，还可以应用于FlexE网络的场景下。
在应用于FlexE网络的场景下，FlexE帧包括的净荷码块中配置用于承载业务数据的数据码块和用于承载该业务数据对应的位置信息的开销码块。
在应用于业务数据穿通FlexE网络和OTN网络的场景时，在FlexE网络中，数据帧为FlexE帧，在OTN网络时，数据帧可以为ODU帧，由于FlexE帧采用的是66B码块，不再需要划分，只需要确定净荷码块中用于映射业务数据的数据码块和开销码块，而本申请实施例中OTN帧可以划分66B码块，从而使得两个网络对应的传输设备在两个网络中对 应传输的业务数据可以看作66B码块流，来达到业务数据穿通FlexE网络和OTN网络的目的。
在一种可能的设计中，所述数据帧包括第二数量的码块，所述数据帧为ODU帧或灵活光传送网FlexO帧，所述第二数量大于或等于所述第一数量。数据帧还可以是FlexE帧。上述设计中提供了一种数据帧划分码块的划分方式。其中，若所述数据帧包括的比特数，不足以划分整数个码块时，数据帧中还可以包括固定填充。
在一种可能的设计中，所述数据帧由多个连续的ODU帧或FlexO帧组成，所述多个连续的ODU帧或所述多个连续的FlexO帧包括第三数量的码块，所述第三数量大于或等于所述第一数量。上述设计中，提供了另一种数据帧划分码块的方式，由多个连续的ODU帧或FlexO帧来划分整数个码块。
在一种可能的设计中，所述数据帧包括固定时隙区域以及非固定时隙区域，所述数据帧为ODU帧或FlexO帧，所述非固定时隙区域包括第四数量的码块，所述第四数量大于或等于所述第一数量。上述设计提供了又一种数据帧划分码块的方式。另外，非固定时隙若无法完全划分整数个码块时，可以添加固定填充。
在一种可能的设计中，所述第一数量是基于所述业务数据的业务速率以及所述数据帧的速率确定的。具体地，可以根据接收控制器或网络管理器发送的带宽分配算法来动态基于所述业务数据的业务速率以及所述数据帧的速率确定用于映射业务数据的码块的数量以及位置。
第二方面，本申请实施例提供了一种业务数据的处理方法，该方法应用发送侧，包括：接收业务数据，然后将所述业务数据映射到数据帧的第一数量的码块；其中，所述第一数量的码块用于映射所述业务数据，所述数据帧的开销区域包括至少一个第一指示字段，所述第一指示字段用于指示承载所述业务数据的码块的位置。
本申请实施例通过对数据帧的净荷区域划分码块用来承载业务数据，而在数据帧的开销区域配置指示字段用来指示业务数据所映射的码块的位置。从而低速率的业务可以根据需求占用部分码块，接收端能够基于开销区域中指示字段的内容从数据帧中恢复业务数据，可以避免由于时隙对应的速率高，而业务要求的速率低导致的资源浪费。
本申请实施例中的数据帧可以是OTN帧，比如OPU帧，ODU帧、OTU帧、或FlexO帧等，数据帧还可以是FlexE帧。
在一种可能的设计中，所述码块为66B码块。在这种情况下，本申请实施例提供的方案可以应用于业务数据穿通FlexE网络和OTN网络的场景下，还可以应用于FlexE网络的场景下。
在应用于FlexE网络的场景下，FlexE帧包括的净荷码块用于承载业务数据，而FlexE帧中包括的开销码块配置指示字段，指示字段用来指示承载业务数据的净荷码块的位置。
在应用于业务数据穿通FlexE网络和OTN网络的场景时，在FlexE网络中，数据帧为FlexE帧，在OTN网络时，数据帧可以为ODU帧，由于FlexE帧采用的是66B码块，不再需要划分，只需要确定净荷码块中用于映射业务数据的净荷码块的位置，而本申请实施例中OTN帧可以划分66B码块，从而使得两个网络对应的传输设备在两个网络中对应传输的业务数据可以看作66B码块流，来达到业务数据能够穿通FlexE网络和OTN网络的目的。
在一种可能的设计中，所述数据帧可以由多个连续的ODU帧组成，或，所述数据帧 由多个连续的FlexO帧组成。
在一种可能的设计中，多个连续的所述数据帧组成一个复帧，每个数据帧的净荷区域包括的码块的数量与所述复帧的开销区域中的包含所述第一指示字段在内的指示字段的数量相同；所述复帧的第i个指示字段包括所述数据帧的净荷区域中的第i个码块承载的业务数据的标识信息，i取遍小于或等于n的正整数，n为所述数据帧的净荷区域包括的码块的数量。也就是说，所述指示字段的排列序号与其指示的码块在所述数据帧的净荷区域中的排列序号相同。
上述设计中，一个数据帧的开销区域配置的指示字段的数量与数据帧的净荷区域包括的码块的数量不匹配，则可以通过多个数据帧构成复帧，从而复帧的开销区域配置的指示字段数量达到与数据帧的净荷区域包括的码块数量匹配。
在一种可能的设计中，承载所述业务数据的码块的数量和位置通过如下方式确定：接收控制器或网络管理器发送的所述业务数据对应的业务需要占用的所述数据帧的码块的位置信息。具体地，所述业务需要占用的所述数据帧的码块的位置信息可以是所述控制器或所述网络管理器根据所述数据帧的带宽以及所述业务所需的带宽确定的。
在一种可能的设计中，所述方法还包括：若确定所述业务所需的带宽发生变化，向所述控制器或所述网络管理器发送变化后的所述业务的带宽，接收所述控制器或网络管理器发送的带宽变化后的所述业务需要占用的所述数据帧的码块的位置信息；在待映射所述业务数据的数据帧的开销区域添加切换信息，所述切换信息用于指示从下一复帧周期开始所传输的业务在每个数据帧中的位置发生变化；并在到达下一个复帧周期时，基于接收到带宽变化后的所述业务需要占用的所述数据帧的码块的位置信息将所述业务数据映射到所述数据帧。
上述设计中，在确定业务带宽发生变化后，通知给控制器或网络管理器，从而网络管理器或控制器基于变化后的带宽能够为该业务重新配置码块的位置，并指示给接收端从下一个复帧周期开始通过变化后的位置来发送业务数据，从而避免接收端不知道到什么时候开始更新解析业务数据的码块的位置，造成的业务数据恢复失败。
在一种可能的设计中，用于映射所述业务数据的第一数量的码块中还可以包括开销码块和数据码块，所述数据码块用于承载所述业务数据，所述开销码块包括所述业务数据映射到所述开销码块所在的数据帧的时钟信息和/或时间信息。
上述设计中，在接收端需要获知业务数据的时钟信息和/或时间信息的情况下，提供了一种可行的方案，在净荷区域的码块中配置开销码块用来承载时钟信息和/或时间信息。
在一种可能的设计中，所述第一指示字段还包括指示信息，所述指示信息用于指示在所述数据帧的净荷区域中，与所述第一指示字段排列序号相同的码块为数据码块或开销码块。上述设计中，提供了一种接收端获知净荷区域中的码块是数据码块还是开销码块的简单可行的方式。
在一种可能的设计中，若所述第一数量小于预设阈值，则所述复帧中仅第一个数据帧的所述第一数量的码块中包括所述开销码块。上述设计中，若该业务数据所需要的码块的数量较少，并且该业务数据需要配置时钟信息和/或时间信息的情况下，可以仅在复帧中的第一个数据帧的净荷区域中配置开销码块，其它数据帧的开销码块的位置作为数据码块来承载业务数据，从而可以避免资源浪费。
第三方面，本申请实施例提供了一种业务数据的处理方法，该方法应用于接收侧，包 括：确定接收到的数据帧中承载业务数据的码块的位置；从所述数据帧的净荷区域包括的所述位置对应的码块中获取所述业务数据。
上述设计中，数据帧以码块的形式存在，低速率业务占用部分码块，从而接收端在确定承载该业务数据的位置后，从净荷区域中的对应位置的码块中获取业务数据。
在一种可能的设计中，可以是接收端预先配置有该业务数据所占用的码块的位置。
在一种可能的设计中，所述确定接收到的数据帧中承载所述业务数据的码块的位置，包括：识别所述数据帧包括的多个码块中的开销码块，所述开销码块包括用于承载业务数据的数据码块的位置信息；从所述数据帧的净荷区域包括的所述位置对应的码块中获取所述业务数据，包括：根据所述位置信息从所述数据帧包括的数据码块中获取所述业务数据。
在上述设计提供了一种确定承载业务数据的码块的位置的可行方式，在数据帧包括的用于映射业务数据的码块中区分数据码块和开销码块，开销码块中承载该业务数据所映射的数据码块的数量信息以及位置信息。
在一种可能的设计中，多个连续的所述数据帧组成一个复帧，所述复帧的开销区域包括的指示字段的数量与每个数据帧包括的码块的数量相同；所述复帧的第i个指示字段包括所述数据帧的净荷区域中的第i个码块承载的业务数据的标识信息，i取遍小于或等于n的正整数，n为所述数据帧的净荷区域包括的码块的数量；所述确定接收到的数据帧中承载所述业务数据的码块的位置，包括：接收控制器或网络管理器发送的所述复帧的开销区域中承载所述业务数据的标识信息的指示字段，根据承载所述业务数据的标识信息的指示字段确定所述数据帧中承载所述业务数据的码块的位置。
在上述设计中提供了另一种确定承载业务数据的码块的位置的可行方式，由多个数据帧组成一个复帧，复帧的开销区域配置指示字段，指示字段的数量与一个数据帧的净荷区域包括的码块的数量相同。某一码块承载该业务数据，则开销区域中与该码块序号对应相同的指示字段承载该业务数据的标识信息，从而接收端根据承载的业务数据的标识信息的指示字段的排列序号，能够确定承载业务数据的码块的位置。
在一种可能的设计中，所述数据帧的开销区域还包括切换信息，所述切换信息用于指示从下一复帧周期开始所传输的业务在每个数据帧中的位置发生变化；所述方法还包括：在确定到达下一复帧周期时，根据所述切换信息重新确定所述下一复帧的开销区域中承载所述业务数据的标识信息的指示字段；并根据承载所述业务数据的标识信息的指示字段，从所述下一复帧开始接收到的复帧的净荷区域中获取所述业务数据。
本申请实施例提供的方案中，可以在开始发送业务数据的第一个复帧或每次接收到切换信息的第一个复帧中，确定承载业务数据的位置，在下一次接收切换信息之前，均基于在第一个复帧中确定的位置来从数据帧中获取业务数据。为了缩短恢复业务数据的延迟时间，第一个复帧可以仅用于确定承载业务数据的码块位置，而第一个复帧中净荷区域的业务数据作丢弃处理。
在一种可能的设计中，用于映射所述业务数据的码块中包括开销码块和数据码块，所述数据码块用于承载所述业务数据，所述开销码块包括所述业务数据映射到所述开销码块所在的数据帧的时钟信息和/或时间信息。
在一种可能的设计中，所述指示字段还包括指示信息，所述指示信息用于指示在所述数据帧的净荷区域中，与承载所述指示信息的指示字段排列位置相同的码块为数据码块或开销码块。
在一种可能的设计中，若所述数据帧中用于映射所述业务数据的码块数量小于预设阈值，则每个复帧的仅第一个数据帧包括的用于承载所述业务数据的码块中包括所述开销码块。
在一种可能的设计中，所述码块为66B码块。
在一种可能的设计中，所述数据帧为光数据单元ODU帧，或，所述数据帧为灵活光传送网FlexO帧。
在一种可能的设计中，所述数据帧还可以包括固定填充。
在一种可能的设计中，所述数据帧由多个连续的ODU帧组成，或，所述数据帧由多个连续的FlexO帧组成。
在一种可能的设计中，所述数据帧为ODU帧或FlexO帧，所述数据帧包括固定时隙区域以及非固定时隙区域，所述码块位于所述非固定时隙区域。
第四方面，本申请实施例提供了一种业务数据的处理装置，该装置可以应用于发送侧，包括处理器以及存储器，其中：所述存储器，用于存储有程序代码；所述处理器，用于读取并执行所述存储器存储的程序代码，以实现第一方面或第一方面的任一种设计所述的方法，或用于实现第二方面或第二方面的任一种设计所述的方法。
第五方面，本申请实施例提供了一种业务数据的处理装置，所述装置可以应用于接收侧，包括处理器以及存储器，其中：所述存储器，用于存储有程序代码；所述处理器，用于读取并执行所述存储器存储的程序代码，以实现第三方面或第三方面的任一种设计所述的方法。
第六方面，本申请实施例提供了一种业务数据的处理系统，所述系统包括第四方面所述的装置以及第五方面所述的装置。
第七方面，本申请实施例中还提供一种计算机存储介质，该存储介质中存储软件程序，该软件程序在被一个或多个处理器读取并执行时可实现第一至第三方面中任一方面的任意一种设计提供的方法。
第八方面，本申请实施例提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行上述第一方面至第三方面中任一种设计提供的方法。
第九方面，本申请实施例提供了一种芯片，所述芯片与存储器相连，用于读取并执行所述存储器中存储的软件程序，以实现第一方面或第三方面的任意一种设计提供的方法。
附图说明
图1为本申请实施例提供的OTN网络架构示意图；
图2为本申请实施例提供的OTN设备结构示意图；
图3A为本申请实施例提供的OTN帧示意图；
图3B为本申请实施例提供的FlexO帧示意图；
图4A为本申请实施例提供的一种OTN帧划分码块的结构示意图；
图4B为本申请实施例提供的另一种OTN帧划分码块的结构示意图；
图5为本申请实施例提供的多个OTN帧划分码块的结构示意图；
图6为本申请实施例提供的又一种OTN帧划分码块的结构示意图；
图7为本申请实施例提供的业务数据的处理方法流程示意图；
图8为本申请实施例提供的空闲码块的结构示意图；
图9A为本申请实施例提供的一种开销码块的结构示意图；
图9B为本申请实施例提供的另一种开销码块的结构示意图；
图9C为本申请实施例提供的又一种开销码块的结构示意图；
图10为本申请实施例提供的业务数据占用的码块数量示意图；
图11为本申请实施例提供的开销码块添加的位置信息和数量信息示意图；
图12为本申请实施例提供的另一种业务数据的处理方法流程示意图；
图13为本申请实施例提供的码块地图与码块对应结构示意图；
图14为本申请实施例提供的指示字段可以占用的开销区位置示意图；
图15为本申请实施例提供的复帧的开销区域的指示字段构成的码块地图结构示意图；
图16为本申请实施例提供的FlexE帧结构示意图；
图17为本申请实施例提供的一种业务数据的处理装置示意图；
图18为本申请实施例提供的另一种业务数据的处理装置示意图；
图19为本申请实施例提供的设备2200示意图。
具体实施方式
本申请实施例涉及到的多个，是指两个或两个以上。“和/或”，描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。
另外，需要理解的是，在本申请的描述中，“第一”、“第二”等词汇，仅用于区分描述的目的，而不能理解为指示或暗示相对重要性，也不能理解为指示或暗示顺序。
本申请实施例中涉及到的数学符号“*或×”均表示乘号，“％”表示求余；
Figure PCTCN2019087471-appb-000001
表示向下取整，例如：A＝3.9，则
Figure PCTCN2019087471-appb-000002
“#1”表示第一个，“#2”表示第二个，以此类推。
本申请实施例适用于光网络或灵活以太(FlexibleEthernet,FlexE)网。
针对光网络来说，比如OTN。一个OTN通常由多个设备通过光纤连接而成，可以根据具体需要组成如线型、环形和网状等不同的拓扑类型。如图1所示的OTN是两个OTN网络组成。每一个OTN网络由一定数量的OTN设备(N1～N7)组成。根据实际的需要，一个OTN设备可能具备不同的功能。一般地来说，OTN设备分为光层设备、电层设备，以及光电混合设备。光层设备指的是能够处理光层信号的设备，例如：光放大器(optical amplifier，OA)、光分插复用器(optical add-drop multiplexer，OADM)。OA也可被称为光线路放大器(optical line amplifier，OLA)，主要用于对光信号进行放大，以支持在保证光信号的特定性能的前提下传输更远的距离。OADM用于对光信号进行空间的变换，从而使其可以从不同的输出端口(有时也称为方向)输出。根据能力不同，OADM可以分为固定的OADM(fixed OADM，FOADM)，可配置的OADM(reconfigurable OADM，ROADM)等。电层设备指的是能够处理电层信号的设备，例如：能够处理OTN信号的设备。光电混合设备指的是具备处理光层信号和电层信号能力的设备。需要说明的是，根据具体的集成需要，一台OTN设备可以集合多种不同的功能。本申请提供的技术方案适用于不同形态和集成度的OTN设备。光网络中还可以包括控制器或网络管理器，用于对光网络中的OTN设备进行管理。
图2为一种可能的OTN设备的硬件结构示意图。这里的OTN设备可以指图1中N1～N7 的任意一个。具体地，一个OTN设备包括电源、风扇、辅助类单板，还可能包括支路板、线路板、交叉板、光层处理单板，以及系统控制和通信类单板。
需要说明的是，根据实际需要，每个设备包含的单板类型和数量可能不同。例如：作为核心节点的网络设备可能没有支路板。作为边缘节点的网络设备可能有多个支路板。其中，电源用于为OTN设备供电，可能包括主用和备用电源。风扇用于为设备散热。辅助类单板用于提供外部告警或接入外部时钟等辅助功能。支路板、交叉板和线路板主要是用于处理OTN的电层信号。其中，支路板用于实现各种客户业务的接收和发送，例如SDH业务、分组业务、以太网业务和前传业务等。更进一步地，支路板可以划分为客户侧光模块和信号处理器。其中，客户侧光模块可以为光收发器，用于接收和/或发送业务数据。信号处理器用于实现对业务数据到数据帧的映射和解映射处理。交叉板用于实现数据帧的交换，完成一种或多种类型的数据帧的交换。线路板主要实现线路侧数据帧的处理。具体地，线路板可以划分为线路侧光模块和信号处理器。其中，线路侧光模块可以为线路侧光收发器，用于接收和/或发送数据帧。信号处理器用于实现对线路侧的数据帧的复用和解复用，或映射和解映射处理。系统控制和通信类单板用于实现系统控制和通信。具体地，可以通过背板从不同单板收集信息，或将控制指令发送到对应的单板上。需要说明的是，除非特殊说明，具体的组件可以是一个或多个，本申请不做任何限制。还需要说明的是，本申请实施例不对设备包含的单板类型，以及单板具体的功能设计和数量做任何限制。
另外，本申请实施例中的OTN设备使用的数据帧可以为一个OTN帧，或所述数据帧由多个OTN帧组成，用于映射各种业务数据，能够实现对业务数据的管理和监控。OTN帧可以是光数据单元(optical data unit，ODU)k、ODUCn、ODUflex，或光通道传输单元(optical transport unit，OTU)k，OTUCn，或灵活OTN(FlexO)帧等。FlexO帧可以是FlexO-短距接口(short reach，SR)帧，也可以是FlexO-长距接口(long reach，LR)帧。数据帧还可以是其它适用于光网络的帧结构。
作为一种示例，如图3A所示，OTN帧可以为4×4080字节的结构，即4行×4080列。OTN帧结构包含帧定位区域，OTU开销(overhead，OH)、ODUOH、光通道净荷单元(optical channel payload unit，OPU)OH、OPU净荷区域(payload area)、FEC区域。其中，前16列为开销区域，最后的256列为FEC校验区域，中间的3808列为净荷区域。需要说明的是，OTN帧中还可以不包括尾部256列的校验区域。
帧定位开销可以包括两部分：帧定位信号(frame alignment signal，FAS)，复帧定位信号(multiframe alignment signal，MFAS)。其中，多个OTN帧构成一个OTN复帧，比如8个OTN帧构成一个OTN复帧。
OPUk用来承载业务数据，包括OPU净荷区域和OPU OH，k代表OPU的速率等级。k＝0，1，2，3，4分别对应1.25G，2.5G，10G，40G，100G。k＝flex，即OPUflex，可以对应任意速率级别，仅用于承载单路业务。k＝Cn，即OPUCn，其对应n倍100G的速率级别。
ODUk是用来支持OPUk的信息结构，由OPUk和ODUk OH组成。类似地，ODUk的容量由k区分。ODUflex由OPUflex和ODUflex OH组成。OTUk由ODUk、FEC区域和OTUk OH组成。OTUCn由ODUCn、OTUCn OH组成，其不包括FEC区域。
另外需要说明的是，本申请实施例中涉及到的低速率的业务是指速率小于ODU0的速率。ODU0的速率为1.25Gbps。
作为另一种示例，如图3B所示，FlexO-SR帧为128×5440比特的结构。该帧结构的第一行5440比特的结构中包含对齐字(alignmentmarker，AM)区域和OH区域。每一行的5440比特中后面的300比特均为FEC区域。除去AM区域、开销区域以及FEC区域，其余的比特构成了净荷区域。需要说明的是，本申请实施例中多个FlexO-SR可以构成一个FlexO-SR复帧，比如8个FlexO-SR构成一个复帧。从而可以通过8个FlexO-SR的开销组合，形成FlexO-SR复帧的开销结构。具体可以通过定义MFAS来指示复帧中每一个帧。
为了适用于低速率业务，本申请实施例提出了一种相对于数据帧来说，更小粒度的结构，该结构由数据帧承载。该结构可以称为码块，即将数据帧划分为多个码块。当然该结构也可以命名为其它的名称，本申请实施例对此不作具体限定。码块可以是66比特(bit，B)码块，或，码块可以为占用其它比特数的码块，但码块的速率小于1Gbps，比如128bit、256bit等。低速率的业务可以是SDH的第1级同步传递模块(synchronous transfer module-1，STM-1)信号，或解析STM-1信号的虚容器(virtual container，VC)-12，VC-3或VC-4颗粒，还可以是以太业务中的快速以太网(fast ethernet，FE)业务等。其中，VC-n表示n阶虚容器，比如，n＝3，表示3阶虚容器。
在针对数据帧划分码块时，以图3A所示的OTN帧为例进行说明，针对FlexO帧的划分方式，与图3A所示的OTN帧的划分方式类似，此处不再赘述。
在第一种可能的划分方式中，在针对数据帧配置码块时，如果一个数据帧的净荷区域占用的比特数不足以被码块占用的比特数整除时，则可以将整除余下的比特数插入固定填充，不用于传输业务数据。针对数据帧为一个OTN帧来说，以图3A所示为例，一个OTN帧的净荷区域占用4×3808×8比特，以码块为66B为例，
Figure PCTCN2019087471-appb-000003
4×3808×8％66＝20，则一个OTN帧中配置1846个码块，剩余20比特为固定填充，参见图4A所示。另一方面，针对数据帧为一个OTN帧来说，还可以配置固定填充列，比如每一行
Figure PCTCN2019087471-appb-000004
3808×8％66＝38，则一个OTN帧的净荷区域的每一行配置461个码块，净荷区域的每一行最后38比特为固定填充，参见图4B所示。
在第二种可能的划分方式中，一个OTN帧占用的比特数不足以被码块占用的比特数整除的情况下，如果几个OTN帧占用的比特数能够被码块占用的比特数整除，则可以针对多个OTN帧作为一个整体(即作为一个数据帧)来划分码块。以图3A所示的OTN帧为例，一个OTN帧的净荷区域占用4×3808×8比特，以码块为66B为例，
Figure PCTCN2019087471-appb-000005
33×4×3808×8％66＝0，则33个OTN帧的净荷区域占用的比特数正好能够被66整除，从而可以将33个OTN帧作为一个整体(一个数据帧)划分出60928个码块，参见图5所示。
在第三种可能的划分方式中，一个OTN帧的净荷区域可以划分为固定时隙区域和非固定时隙区域，在非固定时隙区域划分码块。图6给出了一个示例。一个OTN帧中4×3808×8比特的净荷区域，前一半作为非固定时隙区域，后一半作为固定时隙区域。即，净荷区域的前4×1904×8比特作为非固定时隙区域，后4×1904×8比特作为固定时隙区域。如果非固定时隙区域占用的比特数无法被码块占用比特数整除，可以配置固定填充，比如参见图6所示，4×1904×8％66＝10，因此非固定时隙区域有10比特的固定填充。
在上述三种数据帧配置码块的方式下，在将业务数据映射到数据帧后，接收节点(作为接收端的OTN设备)需要知道哪个业务对应的业务数据映射到哪个或哪几个码块，因 此接收节点需要知道该业务的业务数据在数据帧的净荷区域的位置，基于此，在本申请实施例提供的业务数据的处理方法及装置中，通过两种方式来实现。第一种方式：在数据帧的净荷区域的码块中区分数据码块以及开销码块，数据码块用于承载业务数据，而开销码块用于指示该业务数据所映射的码块位置。第二种方式：在数据帧的开销区域配置指示字段，指示字段用来指示承载业务数据的码块的位置。
基于上面描述的本申请的一些共性方面，下面对本申请实施例进一步详细说明。
图7给出了一种针对第一种方式的业务数据的处理方法。该方法包括如下步骤：
S701，发送节点(发送端的OTN设备)接收业务数据。
S702，发送节点将所述业务数据映射到数据帧的第一数量的码块。
其中，所述第一数量的码块中包括开销码块和数据码块。所述数据码块用于承载所述业务数据，所述开销码块包括用于承载所述业务数据的数据码块的位置信息。开销码块中还可以包括承载所述业务数据的数据码块的数量信息，即指示第一数量。
S703，发送节点向接收节点发送所述数据帧。
接收节点在接收到数据帧后确定数据帧中承载业务数据的码块的位置，从所述数据帧的净荷区域包括的所述位置对应的码块中获取所述业务数据。具体地，在第一种方式下，接收节点通过如下方式实现获取业务数据：
S704，接收节点接收数据帧。
S705，接收节点识别所述数据帧包括的多个码块中的开销码块。所述开销码块包括用于承载业务数据的数据码块的位置信息。所述开销码块还可以包括承载业务数据的数据码块的数量信息。在开销码块中仅包括位置信息时，可以根据位置信息来获得数据码块的数量。例如，当存在3个数据码块的位置时，可以确定承载该业务数据的数据码块为3个。
其中，所述开销码块中还可以包括业务数据的标识信息，从而根据开销码块中业务数据的标识信息确定该开销码块包括的位置信息所指示的码块承载哪种业务数据。
S706，根据开销码块的所述位置信息，接收节点从所述数据帧包括的数据码块中获取所述业务数据。
示例性地，发送节点在将业务数据映射到数据帧的第一数量的码块时，可以通过空闲映射规程(idle mapping procedure，IMP)方式或通过通用映射规程(Generic mapping procedure，GMP)方式来实现映射。比如，针对分组(packet，PKT)业务来说可以采用IMP方式实现映射。其中，采用IMP方式映射时，可能需要通过插入空闲(IDLE)码块进行业务数据和数据帧的速率适配，具体地，可以在将业务数据转码后的66B码块之间插入空闲码块。作为一种示例，空闲码块的结构可以参见图8所示。针对固定比特率(constant bit rate，CBR)业务来说，比如时分复用(time division multiplexing，TDM)业务，可以采用GMP方式实现映射。TDM业务可以是：同步数字体系(synchronous digital hierarchy，SDH)，或视频类的串行数字接口(serial digital interface，SDI)，或透传的以太网比特流等。
应理解，本申请实施例中所述的映射可以是直接映射。比如，将业务数据映射到ODUflex或OTNCn或FlexO等数据帧中。还可以是多层映射，比如将业务数据映射到ODUflex数据帧，然后再将ODUflex映射到OTUCn中，然后再将OTUCn发送给接收节点。针对多层映射来说，数据帧可以为ODU0、ODUflex等。如果是多层映射，那么在步骤S702中，发送节点将所述业务数据映射到数据帧的第一数量的码块中后，再将数据帧映射到另一数据帧(例如，ODUCn或FlexO帧)。对应地，发送节点在步骤S703发送数 据帧为：将ODUCn，FlexO帧等发送给接收节点。对应地，接收节点接收的数据帧为接收ODUCn，FlexO帧等，并从ODUCn，FlexO帧等解映射出ODU0、ODUflex。然后识别ODU0、ODUflex帧中包括的开销码块，进而根据所述数量信息从所述数据帧包括的数据码块中获取所述业务数据。
示例性地，本申请实施例中开销码块的结构可以通过扩展O码块来实现。图9A示出了O码块的结构。其中，SH为同步头，同步头的值为二进制10，用于表示该码块为控制码块；0～7比特位用于表示码块类型，其值为0x4B，第32～35比特其值为0x6，0-7bit加上32-35bit用于表示码块类型为O码块的一种，O码块是应用于以太网的一种码块类型；其中码块的8-31、36-63比特位用于监控开销定义。本申请实施例中可以将O码块的结构应用为开销码块，在8-31、36-63比特位定义码块位置字段，用于承载该开销码块对应的数据码块的在数据帧中的位置信息和数量信息。可选地，开销码块还可以包括如下字段中的至少一项：标签字段、校验(CRC)字段，保留(Reserve)字段、时戳字段。标签字段用于承载业务数据的标识信息。校验字段用于校验码块的正确性，例如用于校验码块的某一个或某几个字段的正确性等。保留字段用于进一步的监控开销的定义或复帧周期的制定等。时戳字段用于要求时钟和/或时间透传业务的时钟恢复，用于承载业务数据映射的时间信息和/或时钟信息。另外，需要说明的是，本申请任一实施例涉及的开销码块的各个字段占用的比特数可以根据需求进行配置，本申请对此不作具体限定。
比如，参见图9B，示例一种66B的开销码块的结构，标签字段(Label)占用16比特，码块位置字段分为两部分，总共占用16比特，校验字段占用8比特，保留字段(RES)占用12比特。再比如，参见图9C所示，示例一种66B的开销码块的结构，标签字段(Label)占用16比特，码块位置字段分为两部分，总共占用16比特，校验字段占用8比特，时戳字段占用8比特，保留字段占用4比特。当然，本申请实施例中，还可以将两部分的码块位置字段合为一部分。另外，上述图9B和图9C仅作为开销码块结构的一种示例，并不对开销码块的结构构成具体限定。
作为一种示例，本申请实施例在确定业务数据占用码块的第一数量时，可以基于业务数据对应的业务需求的速率以及数据帧的速率来确定。例如，将ODUflex帧净荷区划分为整数个66B码块，每个码块速率表示为ODUflex.66b，假定ODUflex速率为m，则每个码块速率ODUflex.66b＝m*66/(3824*4*8)，其中每个码块提供的有效的业务速率为ODUflex.66b*64/66。依据需要承载的低速率业务的速率，可以确定承载该业务数据需要的66B数据码块个数d＝(业务需求的速率/(ODUflex.66b*64/66))，然后再增加一个66B的开销码块，从而确定该业务数据占用的码块的第一数量为d+1。比如，如图10所示，d为3。
在本实施例中，第一数量的码块在数据帧的净荷区域的分布位置可以是静态配置好的，比如由管理发送节点的控制器或网络管理器为该业务配置用于映射该业务的数据的码块的位置，并发送给该发送节点。或，第一数量的码块在数据帧的净荷区域的分布位置可以是动态的，提前为各个发送节点配置带宽分配算法，从而发送节点根据带宽分配算法确定映射业务数据的码块在数据帧中的位置。带宽分配算法可以满足各个发送节点的业务数据映射的码块在数据帧中的分布尽量均匀。
如前描述，确定的业务数据所映射的数据码块的位置信息可以添加在该业务对应的开销码块中。示例性地，如果开销码块定义的码块位置字段占用的比特数不足够指示该第一数量的码块位置，可以通过复帧的形式来指示，比如，n为3，可以通过两个数据帧作为 一个复帧中的两个开销码块来指示每个数据帧中用于映射该业务数据的数据码块的位置，还可以指示数据码块的数量。可选地，为了节省位置信息占用的比特数，位置信息可以是承载该业务数据的码块相对于前一个码块的位置。比如，第一个数据码块相对于开销码块的位置，第二个数据码块相对于第一数据码块的位置，以此类推。比如，参见图11所示，以图9B所示的开销码块的结构为例，以数据帧为一个OTN帧为例，则OTN复帧的第一个OTN帧中，第一个码块位置字段用于承载用于映射该业务数据的数据码块的数量信息，第二码块位置字段用于承载第一个数据码块与开销码块的相对位置信息，即第一数据码块与开销码块的间隔的码块数量。OTN复帧的第二个OTN帧，第一个码块位置字段用于承载第二个数据码块与第一个数据码块的相对位置信息，第二个码块位置字段用于承载第三个数据码块与第二个数据码块的相对位置信息。从而接收节点在接收OTN帧后，确定OTN帧中的开销码块，从而根据开销码块中的位置字段中承载的位置信息来定位承载业务数据的码块位置，从而恢复出业务数据。
图12提供了针对第二种方式的业务数据处理的方法。在第二种方式中，通过开销区域配置指示字段，指示字段用来指示用于映射业务数据的码块在数据帧中的位置。具体地，图12提供的方法包括如下步骤：
S1201，发送节点接收业务数据；
S1202，发送节点将所述业务数据映射到数据帧的第一数量的码块。
其中，所述第一数量的码块用于映射所述业务数据，所述数据帧的开销区域包括至少一个第一指示字段，所述第一指示字段用于指示承载所述业务数据的码块的位置。
可选地，在一个数据帧包括的指示字段的数量小于数据帧包括的码块的数量时，可以将多个连续的所述数据帧组成一个复帧，从而每个数据帧的净荷区域包括的码块的数量与所述复帧的开销区域包括的指示字段的数量相同。在本实施例中，为了描述方便，将复帧的开销区域包括的指示字段中，承载所述业务数据的标识信息的指示字段称为第一指示字段。所述第一指示字段包括所述业务数据的标识信息。所述复帧的第i个指示字段包括所述数据帧的净荷区域中的第i个码块所承载的业务数据的标识信息，i取遍小于或等于n的正整数，n为所述数据帧的净荷区域包括的码块的数量。以承载该业务数据的第一指示字段为例，将复帧中的所有的指示字段排序后，包含该业务数据的标识信息的第一数量的第一指示字段在复帧中的排列序号，与承载该业务数据的码块在数据帧的净荷区域的排列序号一一对应相同。参见图13所示，将复帧中包括的指示字段排序后，为了描述方便将复帧中排序后多个指示字段称为码块地图，则码块地图中第一个指示字段(指示字段#1)用于指示数据帧中第一个码块承载哪种业务数据，第二个指示字段用于指示数据帧中第二个码块承载哪种业务数据，以此类推。
示例性地，如图14所示，指示字段可以占用ODUflex的开销区域中的串联连接监视(tandem connection monitor，TCM)字段以及保留字段，如图14中粗黑色框圈起来的区域，共24字节。图14中RES表示保留字段。两个字节作为一个指示字段用来承载某个业务的业务数据的标识信息。则一个ODUflex能够包括12个指示字段，以一个数据帧为一个ODUflex为例，一个ODUflex能够划分为1844个66B码块，因此需要154个ODUflex帧的开销区域能够指示完一个ODUflex帧的净荷区域的码块承载的业务数据。
以业务i为例，参见图11所示，154个ODUflex构成的复帧包括的12*154＝1848个指示字段构成码块地图，本实施例中仅需要码块地图中的1844个指示字段即能够指示1844 个码块的位置，而余下的4个指示字段可以为无效填充。业务i对应的业务数据占用每个ODUflex的净荷区域的第1个码块，第463个码块，第925个码块以及第1387个码块。从而复帧的开销区域包括的指示字段构成的码块地图中第1个指示字段、第463个指示字段，第925个指示字段以及第1387个指示字段中均包括该业务i的标识信息，参见图15所示。S1203，发送节点向接收节点发送所述数据帧。
接收到数据帧后，接收节点确定数据帧中承载业务数据的码块的位置，从所述数据帧的净荷区域包括的所述位置对应的码块中获取所述业务数据。多个连续的所述数据帧组成一个复帧，所述复帧的开销区域包括的指示字段的数量与每个数据帧包括的码块数量相同。
在一种可能的实现方式中，接收节点可以根据复帧的开销区域中的码块地图确定承载业务数据的码块的位置。在另一种可能的实现方式中，接收节点中可以预先配置有承载业务数据的码块的位置信息，从而根据配置的位置信息获知承载业务数据的码块的位置。
在所述一种可能的实现方式中，具体地接收节点执行如下步骤：
S1204，接收节点接收数据帧。
S1205，接收节点确定所述复帧的开销区域中承载所述业务数据的标识信息的第一指示字段所在的位置。
S1206，接收节点从所述数据帧的净荷区域包括的所述位置对应的码块中获取所述业务数据。
示例性地，以图11所示的码块地图为例，针对业务i来说，接收节点接收到复帧后，确定承载业务i的标识信息的指示字段为码块地图中的第1个指示字段、第463个指示字段，第925个指示字段以及第1387个指示字段，从而能够确定每个数据帧中承载该业务i的码块为数据帧的净荷区域的第1个、第462个、第925个以及第1387个，进一步地，接收节点从每个数据帧的净荷区域的第1个码块、第462个码块、第925个码块以及第1387个码块来获取业务i的数据。
可选地，接收节点可以接收到第一个复帧后，从复帧中获取到承载业务数据的标识信息的第一指示字段所在的位置后，根据从第一个复帧获知到的第一指示字段的位置确定承载业务数据的码块在数据帧中的位置，由于接收第一个复帧中每个数据帧时，无法确定承载业务数据的码块的位置，直到接收完第一个复帧后才能获知到承载业务数据的码块的位置，因此为了降低接收数据的延迟，可以丢弃第一个复帧中接收到的每个数据帧中承载的业务数据，后续从第二个复帧开始，根据从第一个复帧获知的承载业务数据的码块的位置，来从数据帧中获取业务数据。
在所述另一种可能的实现方式中，接收节点中可以预先配置有承载业务数据的码块的位置信息，从而接收节点从所述数据帧的净荷区域包括的所述位置信息指示的码块中获取所述业务数据。
在本实施例中，用于映射各个业务数据的码块在数据帧的净荷区域的分布位置可以是静态配置给各个发送节点的。用于映射各个业务数据的码块在数据帧的净荷区域的分布位置也可以是动态的，由控制器或网络管理器根据带宽分配算法确定用于映射各个业务数据的码块的位置，并通知给各个接收节点。
示例性地，在由管理发送节点的控制器或网络管理器确定用于映射各个业务数据的码块的位置时，可以通过如下方式实现：
控制器或网络管理器接收各个发送节点上报发送的业务带宽，从而能够确定各个发送 节点的待传输的业务所需的带宽，根据所述数据帧的带宽以及每个业务所需的带宽确定每个业务占用数据帧的码块的数量和位置。之后，控制器或网络管理器将每个业务占用数据帧的码块的数量和位置分别发送给对应的发送节点。
可选地，若一个发送节点(例如，发送节点1)确定业务带宽发生变化，则可以将变化后的业务带宽发送给控制器或网络管理器，从而控制器或网络管理器能够确定该发送节点1传输的业务所需的带宽发生变化，则根据所述数据帧的带宽以及变化后的所述业务所需的带宽重新确定各个业务占用所述数据帧中码块的数量和位置，即重新确定复帧开销区域的码块地图；并将重新确定的码块地图发送给各个发送节点(包括发送节点1)，从而发送节点1在接下来映射的数据帧的开销区域添加切换信息，所述切换信息用于指示从下一复帧周期开始所传输的业务在每个数据帧中的位置发生变化。示例性地，切换信息可以占用开销区域中除指示字段占用的保留字段以外的其它的保留字段。
发送节点1对应的接收节点1若确定接收到的数据帧的开销区域包括切换信息，则在到达下一复帧周期时，根据所述切换信息重新确定所述下一复帧的开销区域中承载所述业务数据的标识信息的指示字段所在的位置；并根据重新确定的位置，从所述下一复帧开始接收到的复帧的净荷区域中获取业务数据。
可选地，图12所示的方法使用的数据帧划分的码块还可以包括开销码块。所述开销码块用于承载所述业务数据映射到所述开销码块所在的数据帧的时钟信息和/或时间信息。对应地，可以扩展码块地图中的指示字段来指示不同的码块类型。具体地，将指示字段中分为两部分，一部分用于承载业务数据的标识信息，另一部分用于承载码块类型指示信息，该指示信息用于指示在所述数据帧的净荷区域中，与承载该指示信息的指示字段排列位置相同的码块为数据码块或开销码块。作为一种示例，在一个长度为16比特的指示字段中，前5个bit区分当前作为数据码块使用，还是作为开销码块，后11个bit承载业务数据的标识信息。
可选地，若某个业务对应的承载该业务数据的码块的数量小于预设阈值，可以在所述复帧的仅第一个数据帧的对应数量的码块中包括所述开销码块。当控制器或网络管理器确定码块位置时，可以增加条件，每一个复帧周期第一数据帧存在开销码块，以后的数据帧中开销码块作为数据码块使用。占用了开销码块作为数据码块的业务，即在每个复帧周期的第一数据帧形成一个固定缺口，比如每个数据帧分配k个码块位置，一个复帧周期包括L帧，则该业务有效速率为：码块的数据速率*(L*k-1)/L*k。这么做的好处是，可以提升数据帧的利用效率。
本申请实施例提供的方案，通过划分更小粒度的码块来承载低速率的业务，可以节省资源。另外，若码块采用66B码块，本申请实施例提供的方案可以应用于FlexE网络，以及业务传输穿通FlexE网络与OTN网络的场景中。
在应用到FlexE网络时，本申请实施例中发送节点以及接收节点均支持FlexE端口。发送节点或接收节点均包括MAC层以及物理层，并在物理层内定义有FlexE shim层。其中，FlexE shim层采用n路100千兆以太网(gigabit ethernet，GE)速率，利用时分复用机制，将MAC层的多个不同传输速率的FlexE客户的数据(业务数据)按照固定时隙(比如5G时隙或25G时隙)粒度调度并分发为n路传输速率为100Gbit/s的FlexE帧。目前，FlexE shim层将传输速率为100Gbit/s的光模块的时域资源划分为20个5G时隙，再以25G时隙粒度调度并分发为n路以传输速率为100Gbit/s的FlexE帧。
图16给出了FlexE帧结构的示意图。如图16所示，FlexE shim层通过20个5G时隙中每个5G时隙连续传输了1023个净荷码块，即通过20个5G时隙连续传输了20*1023个净荷码块。然后，FlexE shim层在20*1023个连续的净荷码块之前插入一个开销码块(overhead，OH)，从而1+20*1023个码块(包括开销码块和净荷码块)构成了一个FlexE帧。其中，开销码块和20*1023个连续的净荷码块之间没有其他净荷码块或开销码块。开销码块和净荷码块的大小相等，均等于66B。为了区分Flex帧自身包括的开销码块和后续在净荷码块定义的开销码块，本申请实施例中将FlexE帧自身包括的开销码块称为第一开销码块，净荷码块中定义的开销码块称为第二开销码块。
在应用于FlexE的网络时，具体可以通过图7或图12所述的业务数据的处理方法实现。即，图7中或图12所述的数据帧可以替换为应用于FlexE网络的FlexE帧，详细之处可以参见图7或图12所述的业务数据的处理方法。
示例性地，针对图12采用的第二种方式来说，同样需要扩展FlexE帧第一开销码块的定义，利用复帧中包括的多个第一开销码块中的Calendar字段和保留字段添加码块地图，具体实现与OTN帧的类似，此处不再赘述。
在应用于业务传输穿通FlexE网络与OTN网络的场景中时，比如发送节点支持FlexE端口，以FlexE帧格式的形式传输业务数据；接收节点支持OTN，但采用本申请实施例提供的方案，FlexE管道中传输的FlexE帧和OTN管道中传输OTN帧均采用66B码块流的形式，因此接收节点仅需配置FlexE端口，用来接收FlexE帧，然后将FlexE帧中码块提取后，针对66B码块继续后续的处理。
以第一种方式为例，针对接收节点来说，接收节点在通过FlexE端口接收FlexE帧后，获取FlexE帧的66B的净荷码块，确定净荷码块中的第二开销码块，以及提取第二开销码块中包括的业务数据所映射的数据码块的位置信息，从而根据第二开销码块包括数量信息以及位置信息从对应位置的数据码块中恢复业务数据。若需要进一步向下一个节点发送的话，接收节点可以获取到的净荷码块进一步映射到ODU帧中，并发送给下一个节点。
以第二种方式为例，针对接收节点来说，接收节点在通过FlexE端口接收FlexE帧后，获取FlexE帧的净荷码块，并基于FlexE帧的第一开销码块中承载业务数据的标识信息的指示字段的位置，确定业务数据所映射的数据码块的位置，从而从对应位置的数据码块中恢复业务数据。若需要进一步向下一个节点发送的话，可以进一步将获取的FlexE帧中的66B的净荷码块ODU帧中，并将在ODU帧的开销区域的对应指示字段中添加业务数据的标识信息，并将ODU帧发送给下一个节点。
另外，本申请实施例中也可以应用于发送节点支持OTN，而接收节点支持FlexE的场景下，在这种场景下接收节点仅需配置支持OTN帧的端口，具体处理方法两种场景类似，可以相互参考，不再重复赘述。
基于与上述实施例同样的发明构思，本申请实施例还提供了一种业务数据的处理装置。该装置应用于发送节点，即发送侧的OTN设备或FlexE设备。该装置具体可以是处理器、芯片、芯片系统，或是用于发送的功能模块等。该装置可以位于图2所示的支路板中，或者可以由支路板实现。如图17所示，所述装置包括接收单元2001、映射单元2002和发送单元2003；其中，接收单元2001用于执行S701或S1201，映射单元2002用于执行S702或S1202，发送单元2003用于执行S703或S1203。可选地，所述三个单元还可以执行前述任一实施例提及的发送节点执行的其他相关可选步骤，此处不再赘述。
本申请实施例还提供了另一种业务数据的处理装置。该装置应用于接收节点，即接收侧的OTN设备或FlexE设备。该装置具体可以是处理器、芯片、芯片系统，或是用于接收的一个功能模块等，该装置可以位于图2所示的支路板中，或该装置为图2所示的支路板。如图18所示，所述装置可以包括接收单元2101、识别单元2102和获取单元2103；其中，接收单元2101用于执行S704或S1204，识别单元2102用于执行S705或用于执行S1205，获取单元2103用于执行S706或用于执行S1206。可选地，所述三个单元还可以执行前述任一实施例中提及接收节点执行的其他相关可选步骤，此处不再赘述。
本申请实施例中对单元的划分是示意性的，仅为一种逻辑功能划分，实际实现时可以有另外的划分方式。另外，在本申请各个实施例中的各功能单元可以集成在一个处理器中，也可以是单独物理存在，也可以两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用软件功能单元的形式实现。
本申请实施例还提供另外一种业务数据的处理设备结构，如图19所示，设备2200包括通信接口2210、处理器2220以及存储器2230。该设备既可以应用于发送节点，也应用于接收节点。
在应用于发送节点时，上述图17中所示的接收单元2001、映射单元2002和发送单元2003均可以由处理器2220实现，比如图2所示的支路板。处理器2220通过通信接口2210接收业务数据，并用于实现图7和图12中的发送节点所执行的方法。在实现过程中，处理流程的各步骤可以通过处理器1320中的硬件的集成逻辑电路或软件形式的指令完成图7或图12中所述发送节点所执行的方法。
在应用于接收节点时，上述图18中所示的接收单元2101、识别单元2102和获取单元2103可以由处理器2220实现，比如图2中所述的支路板。处理器2220通过通信接口2210接收业务数据，并用于实现图7和图12中所述的接收节点所执行的方法。在实现过程中，处理流程的各步骤可以通过处理器2120中的硬件的集成逻辑电路或软件形式的指令完成图7或图12中所述的接收节点所执行的方法。
本申请实施例中通信接口2210可以是电路、总线、收发器或其它任意可以用于进行信息交互的装置。其中，示例性地，该其它装置可以是与该设备2200相连的设备，比如设备2200应用于发送节点时，该其它装置可以是接收节点或中间节点。
本申请实施例中处理器2220可以是通用处理器、数字信号处理器、专用集成电路、现场可编程门阵列或其他可编程逻辑器件、分立门或晶体管逻辑器件、分立硬件组件，可以实现或执行本申请实施例中的公开的各方法、步骤及逻辑框图。通用处理器可以是微处理器或任何常规的处理器等。结合本申请实施例所公开的方法的步骤可以直接体现为硬件处理器执行完成，或用处理器中的硬件及软件单元组合执行完成。处理器2220用于实现上述方法所执行的程序代码可以存储在存储器2230中。存储器2230和处理器2220耦合。本申请实施例中的耦合是装置、单元或模块之间的间接耦合或通信连接，可以是电性，机械或其它的形式，用于装置、单元或模块之间的信息交互。处理器2220可能和存储器2230协同操作。存储器2230可以是非易失性存储器，比如硬盘(hard disk drive，HDD)或固态硬盘(solid-state drive，SSD)等，还可以是易失性存储器(volatile memory)，例如随机存取存储器(random-access memory，RAM)。存储器2230是能够用于携带或存储具有指令或数据结构形式的期望的程序代码并能够由计算机存取的任何其他介质，但不限于此。
本申请实施例中不限定上述通信接口2210、处理器2220以及存储器2230之间的具体 连接介质。本申请实施例在图19中以存储器2230、处理器2220以及通信接口2210之间通过总线连接，总线在图19中以粗线表示，其它部件之间的连接方式，仅是进行示意性说明，并不引以为限。所述总线可以分为地址总线、数据总线、控制总线等。为便于表示，图19中仅用一条粗线表示，但并不表示仅有一根总线或一种类型的总线。
基于以上实施例，本申请实施例还提供了一种计算机存储介质，该存储介质中存储软件程序，该软件程序在被一个或多个处理器读取并执行时可实现上述任意一个或多个实施例提供的方法。所述计算机存储介质可以包括：U盘、移动硬盘、只读存储器、随机存取存储器等各种可以存储程序代码的介质。
基于以上实施例，本申请实施例还提供了一种芯片，该芯片包括处理器，用于实现上述任意一个或多个实施例所涉及的功能，例如获取或处理上述方法中所涉及的数据帧。可选地，所述芯片还包括存储器，所述存储器，用于处理器所执行必要的程序指令和数据。该芯片，可以由芯片构成，也可以包含芯片和其他分立器件。
本领域内的技术人员应明白，本申请的实施例可提供为方法、系统、或计算机程序产品。因此，本申请可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本申请可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本申请是参照根据本申请实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
显然，本领域的技术人员可以对本申请进行各种改动和变型而不脱离本申请范围。这样，倘若本申请的这些修改和变型属于本申请权利要求及其等同技术的范围之内，则本申请也意图包含这些改动和变型在内。

Claims (30)

  1. 一种业务数据的处理方法，其特征在于，包括：
    接收业务数据；
    将所述业务数据映射到数据帧的第一数量的码块；其中，所述第一数量的码块中包括开销码块和数据码块；所述数据码块用于承载所述业务数据，所述开销码块包括用于承载所述业务数据的数据码块的位置信息。
  2. 如权利要求1所述的方法，其特征在于，所述码块为66B码块。
  3. 如权利要求1或2所述的方法，其特征在于，所述数据帧包括第二数量的码块，所述数据帧为光数据单元ODU帧或灵活光传送网FlexO帧，所述第二数量大于或等于所述第一数量。
  4. 如权利要求1-3任一项所述的方法，其特征在于，所述数据帧还包括固定填充。
  5. 如权利要求1或2所述的方法，其特征在于，所述数据帧由多个连续的ODU帧或FlexO帧组成，所述多个连续的ODU帧或所述多个连续的FlexO帧包括第三数量的码块，所述第三数量大于所述第一数量。
  6. 如权利要求1或2所述的方法，其特征在于，所述数据帧包括固定时隙区域以及非固定时隙区域，所述数据帧为ODU帧或FlexO帧，所述非固定时隙区域包括第四数量的码块，所述第四数量大于或等于所述第一数量。
  7. 如权利要求1-6任一项所述的方法，其特征在于，所述第一数量是基于所述业务数据的业务速率以及所述数据帧的速率确定的。
  8. 一种业务数据的处理方法，其特征在于，包括：
    接收业务数据；
    将所述业务数据映射到数据帧的第一数量的码块；其中，所述第一数量的码块用于映射所述业务数据，所述数据帧的开销区域包括至少一个第一指示字段，所述第一指示字段用于指示承载所述业务数据的码块的位置。
  9. 如权利要求8所述的方法，其特征在于，所述码块为66B码块。
  10. 如权利要求8或9所述的方法，其特征在于，所述数据帧为光数据单元ODU帧或灵活光传送网FlexO帧。
  11. 如权利要求8或9所述的方法，其特征在于，所述数据帧由多个连续的ODU帧组成；或，所述数据帧由多个连续的FlexO帧组成。
  12. 如权利要求8-11任一项所述的方法，其特征在于，多个连续的所述数据帧组成一个复帧，每个数据帧的净荷区域包括的码块的数量与所述复帧的开销区域中的包含所述第一指示字段在内的指示字段的数量相同；所述复帧的第i个指示字段包括所述数据帧的净荷区域中的第i个码块承载的业务数据的标识信息，i取遍小于或等于n的正整数，n为所述数据帧的净荷区域包括的码块的数量。
  13. 如权利要求12所述的方法，其特征在于，承载所述业务数据的码块的位置通过如下方式确定：接收控制器或网络管理器发送的所述业务数据对应的业务需要占用的所述数据帧的码块的位置信息。
  14. 如权利要求13所述的方法，其特征在于，所述方法还包括：
    若确定所述业务所需的带宽发生变化，向所述控制器或所述网络管理器发送变化后的 所述业务的带宽，接收所述控制器或网络管理器发送的带宽变化后的所述业务需要占用的所述数据帧的码块的位置信息；
    在待映射所述业务数据的数据帧的开销区域添加切换信息，所述切换信息用于指示从下一复帧周期开始所传输的业务在每个数据帧中的位置发生变化；
    并在到达下一个复帧周期时，基于接收到带宽变化后的所述业务需要占用的所述数据帧的码块的位置信息将所述业务数据映射到所述数据帧。
  15. 如权利要求12-14任一项所述的方法，其特征在于，用于映射所述业务数据的第一数量的码块中包括开销码块和数据码块，所述数据码块用于承载所述业务数据，所述开销码块包括所述业务数据映射到所述开销码块所在的数据帧的时钟信息和/或时间信息。
  16. 如权利要求15所述的方法，其特征在于，所述第一指示字段还包括指示信息，所述指示信息用于指示在所述数据帧的净荷区域中，与所述第一指示字段排列序号相同的码块为数据码块或开销码块。
  17. 如权利要求15或16所述的方法，其特征在于，若所述第一数量小于预设阈值，则所述复帧中仅第一个数据帧的所述第一数量的码块中包括所述开销码块。
  18. 一种业务数据的处理方法，其特征在于，包括：
    确定接收到的数据帧中承载业务数据的码块的位置；
    从所述数据帧的净荷区域包括的所述位置对应的码块中获取所述业务数据。
  19. 如权利要求18所述的方法，其特征在于，所述确定接收到的数据帧中承载所述业务数据的码块的位置，包括：
    识别所述数据帧包括的多个码块中的开销码块，所述开销码块包括用于承载业务数据的数据码块的位置信息；
    从所述数据帧的净荷区域包括的所述位置对应的码块中获取所述业务数据，包括：
    根据所述位置信息，从所述数据帧包括的数据码块中获取所述业务数据。
  20. 如权利要求18所述的方法，其特征在于，多个连续的所述数据帧组成一个复帧，所述复帧的开销区域包括的指示字段的数量与每个数据帧包括的码块的数量相同；所述复帧的第i个指示字段包括所述数据帧的净荷区域中的第i个码块承载的业务数据的标识信息，i取遍小于或等于n的正整数，n为所述数据帧的净荷区域包括的码块的数量；
    所述确定接收到的数据帧中承载所述业务数据的码块的位置，包括：
    从所述复帧的开销区域确定承载所述业务数据的标识信息的指示字段，根据承载所述业务数据的标识信息的指示字段确定所述数据帧中承载所述业务数据的码块的位置。
  21. 如权利要求20所述的方法，其特征在于，所述数据帧的开销区域还包括切换信息，所述切换信息用于指示从下一复帧周期开始所传输的业务在每个数据帧中的位置发生变化；
    所述方法还包括：
    在确定到达下一复帧周期时，根据所述切换信息重新确定所述下一复帧的开销区域中承载所述业务数据的标识信息的指示字段；并根据承载所述业务数据的标识信息的指示字段，从所述下一复帧开始接收到的复帧的净荷区域中获取所述业务数据。
  22. 如权利要求20或21所述的方法，其特征在于，用于映射所述业务数据的码块中包括开销码块和数据码块，所述数据码块用于承载所述业务数据，所述开销码块包括所述业务数据映射到所述开销码块所在的数据帧的时钟信息和/或时间信息。
  23. 如权利要求22所述的方法，其特征在于，所述指示字段还包括指示信息，所述指示信息用于指示在所述数据帧的净荷区域中，与承载所述指示信息的指示字段排列位置相同的码块为数据码块或开销码块。
  24. 如权利要求22或23所述的方法，其特征在于，若所述数据帧中用于映射所述业务数据的码块数量小于预设阈值，则每个复帧的仅第一个数据帧包括的用于承载所述业务数据的码块中包括所述开销码块。
  25. 如权利要求18-24任一项所述的方法，其特征在于，所述码块为66B码块。
  26. 如权利要求18-25任一项所述的方法，其特征在于，所述数据帧为光数据单元ODU帧，或，所述数据帧为灵活光传送网FlexO帧。
  27. 如权利要求18-26任一所述的方法，其特征在于，所述数据帧还包括固定填充。
  28. 如权利要求18-24任一项所述的方法，其特征在于，所述数据帧由多个连续的ODU帧组成，或，所述数据帧由多个连续的FlexO帧组成。
  29. 如权利要求18-24任一项所述的方法，其特征在于，所述数据帧为ODU帧或FlexO帧，所述数据帧包括固定时隙区域以及非固定时隙区域，所述码块位于所述非固定时隙区域。
  30. 一种业务数据的处理装置，其特征在于，包括处理器以及存储器，其中：
    所述存储器，存储有程序代码；
    所述处理器，用于读取并执行所述存储器存储的程序代码，以实现如权利要求1～29任一项所述的方法。
PCT/CN2019/087471 2018-06-01 2019-05-17 一种业务数据的处理方法及装置 Ceased WO2019228201A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP19810939.9A EP3796577A4 (en) 2018-06-01 2019-05-17 METHOD AND DEVICE FOR SERVICE DATA PROCESSING
US17/106,486 US11234055B2 (en) 2018-06-01 2020-11-30 Service data processing method and apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810558341.9 2018-06-01
CN201810558341.9A CN110557217B (zh) 2018-06-01 2018-06-01 一种业务数据的处理方法及装置

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US17/106,486 Continuation US11234055B2 (en) 2018-06-01 2020-11-30 Service data processing method and apparatus

Publications (1)

Publication Number Publication Date
WO2019228201A1 true WO2019228201A1 (zh) 2019-12-05

Family

ID=68697369

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/087471 Ceased WO2019228201A1 (zh) 2018-06-01 2019-05-17 一种业务数据的处理方法及装置

Country Status (4)

Country Link
US (1) US11234055B2 (zh)
EP (1) EP3796577A4 (zh)
CN (1) CN110557217B (zh)
WO (1) WO2019228201A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021139607A1 (zh) * 2020-01-08 2021-07-15 华为技术有限公司 一种带宽调整方法及装置
EP4135338A4 (en) * 2020-04-27 2023-10-11 Huawei Technologies Co., Ltd. SERVICE PROCESSING METHOD, APPARATUS AND APPARATUS
RU2827136C1 (ru) * 2021-04-14 2024-09-23 Хуавэй Текнолоджиз Ко., Лтд. Способ обработки услуги, аппарат и устройство

Families Citing this family (33)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3737110A4 (en) * 2018-02-09 2021-01-13 Huawei Technologies Co., Ltd. PROCESS AND DEVICE FOR PROCESSING SERVICE DATA IN AN OPTICAL TRANSPORT NETWORK
CN110649986B (zh) * 2018-06-26 2022-07-19 中兴通讯股份有限公司 使用灵活光网络的业务传输方法、装置、设备及存储介质
CN110830143B (zh) * 2018-08-13 2022-03-25 中兴通讯股份有限公司 一种业务传输方法及装置、光传送网设备、存储介质
WO2021163954A1 (zh) * 2020-02-20 2021-08-26 深圳市汇顶科技股份有限公司 数据传输方法、装置、设备、系统及介质
CN112511917A (zh) * 2020-02-28 2021-03-16 中兴通讯股份有限公司 光传送网中业务处理方法、处理装置和电子设备
CN112511915A (zh) * 2020-02-28 2021-03-16 中兴通讯股份有限公司 光传送网中业务处理方法、处理装置和电子设备
CN112511916A (zh) * 2020-02-28 2021-03-16 中兴通讯股份有限公司 光传送网中业务处理方法、处理装置和电子设备
CN113411689B (zh) * 2020-03-17 2023-04-11 华为技术有限公司 一种数据帧的传送方法以及相关设备
CN112511921B (zh) * 2020-03-27 2025-11-28 中兴通讯股份有限公司 光传送网中业务处理方法、处理装置和电子设备
CN112511920B (zh) * 2020-03-27 2026-03-27 中兴通讯股份有限公司 光传送网中业务处理方法、处理装置和电子设备
CN113542934A (zh) * 2020-04-21 2021-10-22 中兴通讯股份有限公司 业务处理方法、装置、网络设备和存储介质
CN113784437B (zh) * 2020-06-10 2023-09-26 烽火通信科技股份有限公司 一种FlexE承载小颗粒业务的实现方法和装置
CN113972997B (zh) 2020-07-25 2025-09-12 华为技术有限公司 一种传输数据的方法和设备
CN114499788B (zh) * 2020-10-26 2024-09-24 南京中兴软件有限责任公司 Cbr信号传输方法、系统及设备
CN114554320B (zh) * 2020-11-26 2024-11-08 中国移动通信有限公司研究院 一种光网络业务发送、接收方法、设备及存储介质
CN115580370A (zh) 2021-06-21 2023-01-06 中兴通讯股份有限公司 业务处理方法及业务处理设备
US12127183B2 (en) * 2021-08-12 2024-10-22 Qualcomm Incorporated Dynamic and adaptive code block mapping selection
CN116582219B (zh) * 2022-01-30 2026-01-06 华为技术有限公司 一种光传送网中的数据帧的处理方法、装置和系统
CN114584258B (zh) * 2022-02-15 2023-05-26 烽火通信科技股份有限公司 业务时延降低方法、装置、设备及可读存储介质
CN114430305B (zh) * 2022-03-02 2023-06-09 烽火通信科技股份有限公司 一种细粒度帧的定帧方法和系统
CN114615136B (zh) * 2022-03-04 2023-10-27 浙江国盾量子电力科技有限公司 一种5G智能电网切片的FlexE接口管理方法
CN117376431A (zh) * 2022-07-01 2024-01-09 华为技术有限公司 用于灵活以太网的方法、网络设备及存储介质
CN117692114A (zh) * 2022-09-02 2024-03-12 华为技术有限公司 一种传输数据的方法和装置
CN117792564A (zh) * 2022-09-20 2024-03-29 深圳市中兴微电子技术有限公司 一种数据处理方法、装置电子设备及可读存储介质
CN115459883B (zh) * 2022-09-30 2025-08-19 紫金山实验室 数据发送方法、装置及非易失性存储介质
CN118074856A (zh) * 2022-11-22 2024-05-24 华为技术有限公司 数据映射方法、数据解映射方法及相关设备
CN120896665A (zh) * 2022-11-22 2025-11-04 华为技术有限公司 数据传输的方法和装置
CN118264939A (zh) * 2022-12-26 2024-06-28 华为技术有限公司 一种传输帧的映射和解映射方法以及相关设备
CN118631380A (zh) * 2023-03-10 2024-09-10 华为技术有限公司 数据传输的方法和装置
CN119012357A (zh) * 2023-05-18 2024-11-22 中兴通讯股份有限公司 一种承载方法、通信节点及存储介质
CN118827381B (zh) * 2023-07-07 2025-12-30 中国移动通信有限公司研究院 数据发送方法、接收方法、设备及存储介质
CN119603361B (zh) * 2024-11-07 2025-10-28 杭州康吉森自动化科技有限公司 工业以太网数据的传输方法和系统
CN119561656B (zh) * 2025-02-06 2025-07-22 芯潮流(珠海)科技有限公司 面向高速互联的多业务混合承载方法、承载设备和混合业务发送设备

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1770673A (zh) * 2004-11-02 2006-05-10 华为技术有限公司 一种otn网络中业务复用的开销处理方法
CN101442692A (zh) * 2006-09-01 2009-05-27 华为技术有限公司 一种数据传输方法、系统和装置
US20120134674A1 (en) * 2010-11-30 2012-05-31 Electronics And Telecommunications Research Institute Apparatus and method for mapping a client signal
US20170005949A1 (en) * 2015-06-30 2017-01-05 Ciena Corporation Flexible ethernet client multi-service and timing transparency systems and methods
CN106712893A (zh) * 2015-07-23 2017-05-24 华为技术有限公司 用于数据传输的方法和设备
CN106788855A (zh) * 2015-11-23 2017-05-31 华为技术有限公司 一种灵活以太网业务的光传送网承载方法及装置

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3398593B2 (ja) 1998-03-18 2003-04-21 富士通株式会社 ペイロード相対位置変更要求装置及びそれを含む伝送装置
KR20060096450A (ko) * 2003-10-24 2006-09-11 콸콤 인코포레이티드 다수의 데이터 스트림들의 수신을 위한 오버헤드 정보의전송
CN100349390C (zh) * 2004-08-11 2007-11-14 华为技术有限公司 光传送网中传输低速率业务信号的方法及其装置
CN105451102B (zh) * 2014-08-22 2019-05-28 华为技术有限公司 一种处理信号的方法、装置及系统
CN108011702B (zh) 2016-10-28 2021-04-09 华为技术有限公司 一种数据的传输、接收方法及系统
CN109150361B (zh) * 2017-06-16 2021-01-15 中国移动通信有限公司研究院 一种传输网络系统、数据交换和传输方法、装置及设备

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1770673A (zh) * 2004-11-02 2006-05-10 华为技术有限公司 一种otn网络中业务复用的开销处理方法
CN101442692A (zh) * 2006-09-01 2009-05-27 华为技术有限公司 一种数据传输方法、系统和装置
US20120134674A1 (en) * 2010-11-30 2012-05-31 Electronics And Telecommunications Research Institute Apparatus and method for mapping a client signal
US20170005949A1 (en) * 2015-06-30 2017-01-05 Ciena Corporation Flexible ethernet client multi-service and timing transparency systems and methods
CN106712893A (zh) * 2015-07-23 2017-05-24 华为技术有限公司 用于数据传输的方法和设备
CN106788855A (zh) * 2015-11-23 2017-05-31 华为技术有限公司 一种灵活以太网业务的光传送网承载方法及装置

Non-Patent Citations (1)

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

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021139607A1 (zh) * 2020-01-08 2021-07-15 华为技术有限公司 一种带宽调整方法及装置
EP4135338A4 (en) * 2020-04-27 2023-10-11 Huawei Technologies Co., Ltd. SERVICE PROCESSING METHOD, APPARATUS AND APPARATUS
US12580671B2 (en) 2020-04-27 2026-03-17 Huawei Technologies Co., Ltd. Service processing method and apparatus and device
RU2827136C1 (ru) * 2021-04-14 2024-09-23 Хуавэй Текнолоджиз Ко., Лтд. Способ обработки услуги, аппарат и устройство

Also Published As

Publication number Publication date
US11234055B2 (en) 2022-01-25
EP3796577A4 (en) 2021-06-30
US20210084383A1 (en) 2021-03-18
CN110557217B (zh) 2021-08-03
EP3796577A1 (en) 2021-03-24
CN110557217A (zh) 2019-12-10

Similar Documents

Publication Publication Date Title
WO2019228201A1 (zh) 一种业务数据的处理方法及装置
US11700083B2 (en) Method and apparatus for processing service data in optical transport network
US11233571B2 (en) Method for processing low-rate service data in optical transport network, apparatus, and system
US11405703B2 (en) Method and apparatus for transmission using interface, and device
CN109478941B (zh) 一种多路业务传送、接收方法及装置
EP4099712A1 (en) Service bearing method, apparatus and system
CN115515033A (zh) 一种光传送网中的业务处理的方法、装置和系统
US11750314B2 (en) Service data processing method and apparatus
WO2008122218A1 (en) A method for multiplexing and de-multiplexing the low bit rate service
WO2022199600A1 (zh) 业务数据处理方法、装置、相关设备及存储介质
CN111740782B (zh) 一种业务数据的处理方法及装置
WO2023143577A1 (zh) 一种光传送网中的数据帧的处理方法、装置和系统
WO2023134508A1 (zh) 一种光传送网中的业务处理的方法、装置和系统
WO2024051586A1 (zh) 一种光传送网中的数据帧的处理方法、装置和系统
WO2023134512A1 (zh) 一种传输数据的方法
US20240322934A1 (en) Service data processing method and apparatus
CN120167112B (zh) 一种带宽调整方法及装置
WO2020051851A1 (zh) 光传送网中的数据传输方法及装置
CN116633482A (zh) 数据帧的处理方法和装置
US20250088301A1 (en) Service data processing method and apparatus
CN120475285A (zh) 一种数据处理方法及装置
CN119995771A (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: 19810939

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2019810939

Country of ref document: EP

Effective date: 20201214