CN116489537A

CN116489537A - Method, device and system for processing service in optical transport network

Info

Publication number: CN116489537A
Application number: CN202210041213.3A
Authority: CN
Inventors: 马腾·维塞斯; 苏伟; 刘翔
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2022-01-14
Filing date: 2022-01-14
Publication date: 2023-07-25
Also published as: WO2023134508A1

Abstract

The application discloses a method, a device and a system for processing business in an Optical Transport Network (OTN). A business processing method disclosed by the application comprises a plurality of steps. First, the OTN device acquires service data. The OTN device then maps the traffic data into Optical Service Unit (OSU) frames. Wherein the OSU frame comprises an overhead portion for carrying overhead information and a payload portion for carrying the traffic data. The OTN device then maps the OSU frame into a plurality of payload blocks of the OTN frame, the spacing between two adjacent payload blocks of the plurality of payload blocks satisfying a preset spacing constraint. Finally, the OTN device sends the OTN frame to the destination OTN device. By defining the locations where OSU frames map to payload blocks, the traffic handling scheme disclosed herein reduces the risk of traffic loss. In addition, the method also simplifies the processing and management of the frame mapping and reduces the complexity of the equipment.

Description

Method, device and system for processing service in optical transport network

Technical Field

The present application relates to the field of optical communications technologies, and in particular, to a service processing technology in an optical transport network.

Background

An optical transport network (optical transport network, OTN) serves as a core technology for a backbone bearer network, comprising a plurality of rates of optical bearer containers. For example, an optical data unit 0 (optical data unit, odu 0) frame is the least rate bearer container of current OTN technology, and its rate is about 1.25 gigabits per second (Gigabit per second, gbps) for carrying ethernet traffic data at 1 Gbps.

In order to improve the bearing efficiency, the current optical bearing container of the OTN adopts a time division multiplexing technology. In particular, by dividing a high rate bearer container into a plurality of fixed time slots, multi-service bearers are implemented. Currently, OTN supports two granularity levels, 1.25G slots and 5G slots. For traffic below 1Gbps, the slot granularity of current OTN bearer containers does not provide an efficient bearer scheme.

To this end, it is current practice to divide the payload area of the OTN bearer container into a plurality of payload blocks and define a new low rate frame. By the method of mapping the low rate frames to the payload blocks, it is achieved that traffic data at a low rate is carried. The current mainstream method for mapping low-rate frames to payload blocks is that when the OTN device receives service data, a required payload block is allocated to the service data, and the service data is transmitted through the OTN frame. In addition, in order to distinguish different service data, each payload block carries indication information capable of uniquely identifying the service data. However, when the indication information generates an error code, the device receiving the OTN frame cannot determine the service data carried by the OSU frame, so that a portion of the corresponding service data is lost, which reduces the reliability of the OTN network.

Disclosure of Invention

The scheme provided by the prior art has the problem of partial loss of service data. To this end, the embodiment of the application provides a method, a device and a system for processing service data in an optical transport network.

In a first aspect, an embodiment of the present application provides a method for service processing in an Optical Transport Network (OTN). The method comprises a plurality of steps. First, a first OTN device acquires service data. The first OTN device then maps the traffic data into an optical traffic unit (OSU) frame, the OSU frame comprising an overhead portion for carrying overhead information and a payload portion for carrying the traffic data. Next, the first OTN device maps the OSU frame into a plurality of payload blocks of the OTN frame, and a gap between two adjacent payload blocks of the plurality of payload blocks satisfies a preset gap constraint; finally, the first OTN device sends the OTN frame to the second OTN device.

By defining the locations where OSU frames map to payload blocks, the traffic handling scheme disclosed herein reduces the risk of traffic loss. In addition, the method also simplifies the processing and management of the frame mapping and reduces the complexity of the equipment.

In a specific implementation, mapping the OSU frame into a plurality of payload blocks of the OTN frame, where a spacing between two adjacent payload blocks of the plurality of payload blocks satisfies a preset spacing constraint, includes two steps. Firstly, determining position information of a plurality of payload blocks bearing the OSU frame according to the preset interval constraint; second, mapping the OSU frame into the plurality of payload blocks of the OTN frame corresponding to the location information.

In a specific implementation manner, the method further includes the first OTN device sending the location information to the second OTN device. Specifically, the location information may be transmitted by any one of the following means: placing the position information in a payload block of the OTN frame to be transmitted to the OTN device; placing the location information in an overhead area of the OTN frame for transmission to the OTN device; or sending the location information to a network management system, so that the network management system transmits the location information to the OTN device.

In particular, the interval constraint may have a variety of implementations. In one particular implementation, the interval constraint is a fixed number of payload blocks. For example, the fixed number is a rounded value of P/C, where P is the number of payload blocks contained in one multiplexing period of the OTN frame, and C is the number of payload blocks occupied by the OSU frame. In another specific implementation, the interval constraint is a payload block containing a range of values. For example, the numerical range is ((P/C) ×1-50%), a (P/C) ×1+50%) and a (P/C) ×1-520%), or a (P/C) ×1+20%). Wherein P is the number of payload blocks contained in one multiplexing cycle of the OTN frame, and C is the number of payload blocks occupied by the OSU frame. In yet another specific implementation, the interval constraint includes an average data block interval value a and a maximum data block interval offset value T, wherein an interval of two adjacent payload blocks of the plurality of payload blocks falls within (a-T, a+t).

In a specific implementation, the method further comprises: the first device determines that the payload block corresponding to the service data is changed from the plurality of payload blocks to a plurality of other payload blocks; the first device then maps a plurality of further OSU frames to which the traffic data is mapped into the plurality of further payload blocks, a change in a position of each of the plurality of further payload blocks relative to a position of a corresponding payload block of the plurality of payload blocks satisfying a predetermined constraint. By constraining the range of the payload block mapped to by the OSU frame, the design can be simplified and the complexity of frame management reduced.

Specifically, the predetermined constraint is the number of payload blocks of maximum deviation of the position change.

In a specific implementation, the method further comprises: and placing service identifiers of the OSU frames into the payload blocks, wherein the service identifiers are used for service verification. By carrying the service identifier to verify the payload block position information mapped by the OSU frame, the reliability of service transmission can be further improved.

In a second aspect, embodiments of the present application provide an Optical Transport Network (OTN) device. The apparatus includes a processor and an optical transceiver. Wherein the processor is configured to perform the method of the first aspect or any implementation of the first aspect. The sending the OTN frame to an OTN device includes: the processor sending the OTN frame to the optical transceiver; the optical transceiver transmits the OTN frame to the OTN device.

In a third aspect, embodiments of the present application provide a chip. The chip includes a processor and a communication interface. The process is for performing the method of the first aspect or any implementation of the first aspect. The communication interface is used for interacting with the processor to complete the sending or receiving of the frame.

In a fourth aspect, embodiments of the present application provide an optical communication system. The optical communication system includes a client device and the OTN device of the second aspect. And the client equipment sends the service data to the OTN device.

Optionally, the optical communication system further comprises another OTN device and another client device. The client device sends service data to the other client device through the OTN device and the other OTN device.

Drawings

Embodiments of the present application will be described in more detail below with reference to the attached drawing figures:

fig. 1 is a schematic diagram of a possible application scenario in an embodiment of the present application;

FIG. 2 is a schematic diagram of one possible hardware architecture of a network device;

FIG. 3 is a schematic diagram of one possible Optical Service Unit (OSU) frame mapping to an OTN frame;

fig. 4 is a flow chart of a first service processing method provided in an embodiment of the present application;

Fig. 5 is a flow chart of a second service processing method according to an embodiment of the present application;

FIG. 6 is a schematic diagram of a payload block allocation method of the embodiment shown in FIG. 5;

fig. 7 is a flow chart of a third service processing method according to an embodiment of the present application;

fig. 8 is a flow chart of a fourth service processing method provided in the embodiment of the present application;

fig. 9 is a flow chart of a fifth service processing method according to an embodiment of the present application;

fig. 10 is a schematic diagram of one possible network device.

Detailed Description

First, some terms in this application are explained for easy understanding by those skilled in the art.

1) Two or more fingers. And/or describes the association relationship of the association object, three relationships may exist. For example, a and/or B may represent: a exists alone, A and B exist together, and B exists alone. In addition, in the description of the present application, the words "first," "second," and the like are used merely for distinguishing between the descriptions and not be construed as indicating or implying a relative importance or order.

2) Mathematical symbols "×" denote the multiplication numbers.

3) Upstream or downstream. Transmitting data from a source device A to a destination device B and passing through a device M; in the data transmission direction, the device M point is located between the device a and the device B point, and then the device a is in the upstream direction of the device M, and the device B is in the downstream direction of the device M.

4) Service data refers to services that an optical transport network can carry. For example, it may be an ethernet service, a packet service, a wireless backhaul service, etc.

5) The rounding value of one operation formula may specifically be an upward rounding or a downward rounding.

6) Mapping a to B referred to herein refers to encapsulating a into B. For example, mapping an OSU frame to an OTN frame refers to encapsulating the OSU frame or OSU signal into the OTN frame.

7) Unless specifically stated otherwise, a specific description of some features in one embodiment may also be applied to explain other embodiments to mention corresponding features. For example, descriptions of specific implementations or alternative names for interval constraints in one embodiment may also be applied to illustrate interval constraints mentioned in other embodiments. As another example, specific examples and illustrations for OTN frames, and the like. Furthermore, to more clearly show the relationship of components in different embodiments, the present application uses the same or similar reference numbers to identify functionally the same or similar components in different embodiments.

The embodiment of the application is applicable to optical networks, such as: OTN. An OTN is typically formed by connecting a plurality of devices through optical fibers, and may be configured to have different topology types such as linear, ring, mesh, etc., according to specific needs. The OTN 100 shown in fig. 1 is composed of 8 OTN devices 101, i.e., devices a-H. Wherein 102 indicates an optical fiber for connecting two devices; 103 indicates a customer service interface for receiving or transmitting customer service data. As shown in fig. 1, the OTN 100 is used to transmit traffic data for the client devices 1-3. The client device is connected with the OTN device through the client service interface. For example, in FIG. 1, client devices 1-3 are connected to OTN devices A, H and F, respectively.

Depending on the actual needs, one OTN device may have different functions. Generally, OTN devices are classified into optical layer devices, electrical layer devices, and opto-electronic hybrid devices. An optical layer device refers to a device capable of processing an optical layer signal, such as: an optical amplifier (optical amplifier, OA), an optical add-drop multiplexer (OADM). OA may also be referred to as optical line amplifiers (optical line amplifier, OLA), and is primarily used to amplify optical signals to support transmission over greater distances while ensuring specific performance of the optical signals. OADM is used to spatially transform an optical signal so that it may be output from different output ports (sometimes also referred to as directions). An electrical layer device refers to a device capable of processing an electrical layer signal, such as: a device capable of processing OTN signals. An opto-electronic hybrid device refers to a device that has the capability to process both optical layer signals and electrical layer signals. It should be noted that, depending on the specific integration requirement, one OTN device may integrate a plurality of different functions. The technical scheme provided by the application is suitable for OTN equipment with different forms and integration levels and containing an electric layer function.

It should be noted that, the data frame structure used by the OTN device in the embodiment of the present application is an OTN frame, which is used for carrying various service data and providing rich management and monitoring functions. The OTN frame may be an optical data unit frame (Optical Data Unit k, ODUk), ODUCn, ODUflex, or an optical channel transmission unit k (optical transport unit k, OTUk), OTUCn, or flexible OTN (FlexO) frame, or the like. The ODU frame is different from the OTU frame in that the OTU frame includes an ODU frame and an OTU overhead. k represents different rate levels, e.g., k=1 represents 2.5Gbps and k=4 represents 100Gbps; cn represents a variable rate, in particular a rate that is a positive integer multiple of 100 Gbps. Unless specifically stated, an ODU frame refers to any one of ODUk, ODUCn, or ODUflex, and an OTU frame refers to any one of OTUk, OTUCn, or FlexO. It should also be noted that as OTN technology evolves, new types of OTN frames may be defined, as well as being suitable for use in the present application. Furthermore, the methods disclosed herein may also be applicable to flexible ethernet (Flexible Ethernet, flexE) frames.

Fig. 2 is a schematic diagram of a possible hardware architecture of a network device. For example, device a in fig. 1. Specifically, the OTN device 200 includes a tributary board 201, a cross board 202, a circuit board 203, an optical layer processing board (not shown in the figure), and a system control and communication-like board 204. The types and numbers of boards included in the network device may be different depending on the particular needs. For example, the network device as a core node does not have a tributary board 201. As another example, a network device that is an edge node has multiple tributary boards 201, or no optical cross boards 202. For another example, a network device that supports only electrical layer functions may not have an optical layer processing board.

The tributary board 201, the cross board 202 and the wiring board 203 are used to process the electrical layer signals of the OTN. The tributary board 201 is used to implement receiving and transmitting of various customer services, such as SDH services, packet services, ethernet services, and/or forwarding services, etc. Still further, the tributary board 201 may be divided into a client side transceiver module and a signal processor. The client-side transceiver module may also be referred to as an optical transceiver, for receiving and/or transmitting traffic data. The signal processor is used for realizing the mapping and demapping processing of the business data to the data frame. The cross board 202 is used to implement exchange of data frames, and exchange of one or more types of data frames is completed. The line board 203 mainly realizes processing of line-side data frames. Specifically, the wiring board 203 may be divided into a line-side optical module and a signal processor. The line-side optical module may be referred to as an optical transceiver, for receiving and/or transmitting data frames. The signal processor is used for multiplexing and demultiplexing data frames at the line side or mapping and demapping processing. The system control and communication class board 204 is used to implement system control. Specifically, information may be collected from different boards, or control instructions may be sent to corresponding boards. It should be noted that, unless specifically stated otherwise, a specific component (e.g., a signal processor) may be one or more, and the present application is not limited. It should also be noted that the present application does not limit the type of boards included in the device and the functional design and number of boards. It should be noted that, in a specific implementation, the two boards may also be designed as one board. In addition, the network device may also include a backup power source, a fan for dissipating heat, and the like.

Fig. 3 is a schematic diagram of one possible Optical Service Unit (OSU) frame mapping to OTN frames. As shown in fig. 3, the OTN frame 302 is an illustration of an OTN frame, which is a 4-row, multi-column structure including an overhead area, a payload area, and a forward error correction (Forward Error Correction, FEC) area. Wherein the Payload area is divided into a plurality of Payload Blocks (PB). Each PB occupies a fixed length (also referred to as size) of a location in the payload area, e.g., 128 bytes. It should be understood that OTN frame 302 is only one example. Other variations of OTN frames are also suitable for use in the present application. For example, OTN frames that do not contain FEC areas. As another example, the number of rows and columns is different from the frame structure of the OTN frame 302. It should be appreciated that a PB may also be referred to as a slot, a block of slots, a time slice, or the like. The present application does not restrict its name.

The optical service unit (Optical Service Unit) frame 301, as shown in fig. 3, includes an overhead region and a payload region. Wherein the overhead area of OSU frame 301 is used to carry overhead information. For example, the overhead information may include one or more of the information shown in table 1. The payload area of OSU frame 301 is used to carry traffic data. The rate of one OSU frame is defined as an integer multiple of the reference rate. The reference rate may be 2.6Mbps, 5.2Mbps, or 10.4Mbps, or multiples of the foregoing values, or the like.

Table 1 overhead examples that may be carried by overhead frames

As shown in fig. 3, OSU frames map to the payload area of OTN frames. Specifically, OSU frames map into the PB of OTN frames. In one possible implementation, one OSU frame is mapped into one PB. In another possible implementation, one OSU frame is mapped into multiple PB's. The present application is not limited in this regard.

For simplicity and efficient carrying of OSU frames, a number of PB's in succession in an OTN frame are defined as one transmission period. The PB blocks are allocated for OSU frames in a basic unit of a transmission period. For example, assuming that the size and rate of OSU frames and PB are the same, 10 OSU frames carrying traffic data of the same traffic may occupy PB numbered 0-9 in a transmission cycle including 20 PB. For simplicity of description, OSU frames carrying the same traffic data are referred to as OSU signals. An OSU signal is a bit stream carrying a service data, the frame format of which is the frame format of OSU frames. An OSU signal may include one or more OSU frames.

The transmission period is determined by the rate of the payload area of the OTN frame and the reference rate of the OSU frame. For example, the number of PB (P) included in the transfer period may be defined as:

wherein, the liquid crystal display device comprises a liquid crystal display device,representing a downward rounding; r is R _{opu_pld} Representing the rate of the payload area of the OPU frame; t (T) _opu Indicating the frequency offset of the OPU (e.g., may be 20 ppm); r is R _ref Representing the reference rate of OSU frames. 1000ppm is the frequency offset of the baseline rate, and this value may be replaced with 100ppm or other values. It should be appreciated that the above definition is only an example, and that equation (1-2) may also be employed to calculate the P value, for example.

The transmission period may be referred to as a P frame, a time slot multiplexing group, a multiplexing frame, a multiplexing period, or a transmission frame. The present application is not limited in this regard. Table 2 gives some examples of P for some OTN frames. Table 2 is an example of calculating the corresponding P value, taking the OSU frame reference rate of 2.6Mbit/s as an example.

Table 2P-value examples for some OTN frames

One possible way to map OSU frames into PB blocks is to dynamically allocate PB positions of the current transmission period for OSU frames that carry certain traffic data when they are acquired by the OTN device (i.e. a certain OSU signal). In addition, in order to distinguish different service data, after mapping the OSU signal to the PB, an identifier capable of uniquely identifying the service data is further added to the corresponding PB. If the identifier generates error codes in transmission, the receiving device cannot judge the service data carried by the OSU frame, so that the service data cannot be recovered. In addition, the PB position occupied by the OSU frame dynamically changes, and great complexity is brought to management and maintenance of the data frame.

Another possible way to map OSU frames into PB blocks is to allocate PB in order of the rate of OSU frames from large to small, and likewise carry a service data identifier to uniquely identify the service data carried in the OSU frames. This approach also suffers from the problem of the former mapping approach (i.e. traffic loss after identifying the bit errors). In addition, the PB allocated by the OSU frame with low speed obtains the opportunity of allocating PB relatively late, PB distribution uniformity is poorer and worse, larger buffer is required to be introduced, and complexity of equipment is increased.

To this end, the present application provides a new method of business processing. By restricting the interval between the PB occupied by the OSU frame, the method simplifies the mapping from the OSU frame to the PB, and can reduce the probability of service loss caused by service identification error code. In addition, the method introduces the interval constraint, so that the distributed PB is uniformly distributed, the size of the cache is reduced, and the complexity of the equipment is reduced.

Fig. 4 is a flow chart of a first service processing method provided in an embodiment of the present application. As shown in fig. 4, the method includes the following steps. These steps will be described by taking the apparatus H shown in fig. 1 as an example of the main body of execution of the method. It should be understood that this embodiment may also be applied to other OTN devices in fig. 1 to which a client device is connected.

S401, acquiring service data;

specifically, the device H receives service data transmitted from the client device through the client service interface from the client device 2. The traffic data of the client device 2 needs to be transmitted to the client device 3.

S402: mapping the service data into an Optical Service Unit (OSU) frame, the OSU frame comprising an overhead portion for carrying overhead information and a payload portion for carrying the service data;

specifically, the device H loads the acquired service data into an OSU frame. Typically, traffic data is generated continuously over a period of time. Thus, mapping data traffic into OSU frames in this step refers to mapping acquired traffic data into one or more OSU frames in any unit time (e.g., in one transmission cycle). Then, in the next unit time, traffic data is loaded into the next OSU frame or frames. The PB payload blocks occupied by OSU frames may or may not be located at the same time in the two aforementioned unit times. This application is not limited thereto.

It should be noted that, the manner in which the service data is mapped to the OSU frame may be synchronous mapping (e.g., bit synchronous mapping (Bit Synchronous Mappping)) or asynchronous mapping (e.g., generic mapping procedure (Generic Mapping Procedure, GMP)), or idle mapping (IDLE Mapping Procedure, IMP), which is not limited in this application.

In one possible implementation, the OSU frame is the frame structure shown in fig. 3. The overhead portion is then the overhead region and the payload portion is the payload region. For example, the OSU frame is 192 bytes, wherein the overhead area is 7 bytes and the payload area is 185 bytes. In another possible implementation, one OSU frame includes a overhead subframe and a payload subframe; each subframe has a certain frame structure (e.g., 190 bytes per subframe). The two subframes are used for carrying overhead and carrying service data respectively. That is, the overhead portion is an overhead subframe and the payload portion is a data subframe. For example, one OSU frame contains 80 subframes, 4 open subframes, 76 data subframes, each subframe being 192 bytes.

S403: mapping the OSU frame into a plurality of payload blocks of an OTN frame, wherein the interval between two adjacent payload blocks of the plurality of payload blocks meets a preset interval constraint;

specifically, the device H maps OSU frames (i.e., OSU signals) carrying traffic data into a plurality of PB's of OTN frames. It should be appreciated that the mapping step described above may be direct mapping of OSU frames to OTN frames or may be mapping into OTN frames via other intermediate frames. For example, the intermediate frame is an optical service tributary unit (Optical Service Tributary Unit, OSTU) consisting of a corresponding plurality of PB. Specifically, the OSU signal is mapped into the OSTU first, and then the OSTU is remapped into the OTN frame.

It should be understood that the OSU frame is mapped into a plurality of payload blocks of the OTN frame, and may be that the OSU frame is mapped into the payload blocks of the OPU frame or the ODU frame first, and then mapped into the OTU frame after time slot multiplexing. Alternatively, the mapping process may be that the OSU frame is remapped into the OTN frame through one or more intermediate frames. Alternatively still, the OSU signal is mapped directly into the OTU frame. The present application does not limit the hierarchy of mapping in OSU frames.

In one possible implementation, the interval constraint is a fixed number of PB. In a typical design, this fixed number is the rounded value of P/C. Wherein P is the number of payload blocks contained in the OTN frame, and C is the number of payload blocks occupied by the OSU frame. It will be appreciated that if, for example, p=30, c=3, then the preset interval constraint is 10. Then the OSU signal may be assigned PB numbered 1,11 and 21 in one transmission cycle.

In another possible implementation, the interval constraint is PB, which takes a range of values. In a typical design, the value range is ((P/C) ×1-R, and (P/C) ×1+r), where P is the number of payload blocks contained in an OTN frame and C is the number of payload blocks occupied by the OSU frame. R is a number in the range of (0, 1) for example, R may be equal to 1, or equal to 0.2, or equal to 0.5 in a typical design, R is in the range of (0, 0.5) for example, if p=30, c=3, r=0.2, then the interval constraint is in the range of (8, 12).

In yet another possible implementation, the interval constraint includes a base interval value a and a maximum interval offset value T, wherein an interval of two adjacent payload blocks of the plurality of payload blocks falls within (a-T, a+t). For example, a=7, t=3. Then, the interval between two adjacent OSU frames takes a value in the range of (4, 10). The base interval may also be referred to as an average data block interval, and may be a rounded value of (P/C). The maximum interval offset value may also be referred to as the maximum data block interval offset, and may be a rounded value of (P/C) R. The meaning of P, C and R is referred to in the former implementation and will not be described here again.

The interval constraint may be referred to as interval rule, interval distance, distance constraint, distance rule, or the like. The present application is not limited in this regard. Further, the interval is an interval that can be calculated starting from a data block of the start position or starting from data that does not include the start position. The present application is not limited in this regard.

It should be appreciated that the OTN frame mentioned in the above various possible implementations may be one OTN frame as shown in fig. 3; or may be replaced with a single transfer cycle. To simplify the description, the OTN frame also includes a transmission period unless specifically described later.

S404: and sending the OTN frame to OTN equipment.

Specifically, device H sends OTN frames carrying OSU frames to device F. It should be understood that the device F is an OTN device connected to the destination client device 3. The aforementioned transmission may be a direct transmission to device F, i.e. there is a direct physical connection between device H and device F. Alternatively, the foregoing transmission may be that the device H transmits to a downstream intermediate device (for example, the device G in fig. 1), and the intermediate device transmits to the device F.

By restricting the PB position interval mapped by the OSU frame, the method disclosed by the embodiment of the application solves the potential error code risk caused by dynamic allocation, and the sending device and the receiving device can utilize the position interval to analyze the PB position corresponding to the OSU frame, so that the service data is correctly restored.

The technical solution of the present application will be further described based on some common aspects of the present application described above.

An embodiment of the application provides a method, a device and a system for business processing. In this embodiment, taking the network scenario of fig. 1 as an example, assume that the transmitting end device of this embodiment is F and the receiving end device is a. The paths used by the device F and the device a for transmitting traffic may be exemplified by a device F-a device G-a device H-a device a, wherein the device F is a source device, the device a is a destination device, and the devices G and H are intermediate devices.

Fig. 5 is a flow chart of a second service processing method according to an embodiment of the present application. Each step is described in detail below. In the following steps, steps S401, S502 to S504 are performed by the transmitting-end device F, and steps S601 to S602 are performed by the receiving-end device a. Note that, in order to avoid redundancy, the OTN frame transmitted by the receiving device a and the device F is not repeated in fig. 5.

S401, acquiring service data;

this step is similar to step S401 in fig. 4, and the description of step S401 is also applicable to this step, and will not be repeated here. For example, device F receives service data via a customer service interface.

S502: mapping the service data into an Optical Service Unit (OSU) frame, the OSU frame comprising an overhead region for carrying overhead information and a payload region for carrying the service data;

specifically, this embodiment takes an OSU frame as shown in fig. 3 as an example, that is, includes an overhead area and a payload area. Wherein the reference rate of OSU frames is 10.4Mbps. It should be noted that rate and bandwidth are interchangeable concepts in this application. The present step is similar to step S402 of fig. 4, and other descriptions regarding step S402 are also applicable to the present step, and are not repeated here. For example, the number of OSU frames required for the length of OSU frames, etc.

S503: mapping the OSU frame into a plurality of payload blocks of an OTN multiplexing frame, wherein the interval between two adjacent payload blocks of the plurality of payload blocks meets a preset interval value;

specifically, the present embodiment takes an OTN frame as an example of ODU0 to construct an OTN multiplexed frame (or simply multiplexed frame).

The number of payload blocks contained in the multiplexed frame is calculated according to the following formula:

where 10.4M is the base rate of OSU frames. X ppm is the frequency offset and may be 0,20 or 100 ppm is parts per million. R is R _{odu_PLD} For the rate of the payload area of the OTN frame, the rate of the ODU0 frame is: 1238.954310000Mbps. Taking the frequency offset of 20ppm and the PB of 192 bytes as an example, p=119. Typically, the size of PB is an integer multiple of a single byte, e.g., 16 bytes, 32 bytes, 64 bytes, 128 bytes, 192 bytes, 256 bytes, or the like. In a typical design, PB is assumed to be 192 bytes in size; then, the number of ODU0 frames occupied by one multiplexed frame is 119×192/(4×3808) =1.5. That is, one multiplexed frame includes the payload area of 1.5 ODU frames. The boundaries of the multiplexing frame and the ODU frame constructed in this way are kept aligned, simplifying design implementation, and facilitating management of data frames.

There are various implementations of computing PB that satisfies the interval constraint in step S504. For example, PB may be sequentially allocated to OSU frames to which PB needs to be allocated, from small to large in number and according to a value of interval constraint. As another example, PB allocation may be performed in accordance with the method steps shown in fig. 6.

Fig. 6 is a schematic diagram of a payload block allocation method of the embodiment shown in fig. 5. Specifically, as an example shown in fig. 6, taking an example that n OSU signals exist simultaneously in a certain period of time, each OSU signal includes one or more OSU frames, and the n OSU signals need PB allocation. As shown in fig. 6, the PB allocation procedure for each OSU signal performs method 700. It should be noted that the method 700 is given by the process that the OSU signal obtains a PB allocation. By OSU _i For example, a signal is first assigned an initial value Δi (i.e., step Sum _i ＝Δ _i ) The values may be randomly assigned or preset. Then, accumulate C each time _i (C _i For the number of PB blocks that need to be occupied in the OSUi frame stream) (i.e. Sum _i ＝Sum _i +Δ _i ) An accumulated value is obtained. When the accumulated value is equal to or greater than P (i.e. Sum _i >=p), a PB position indication (i.e. the opportunity to obtain one allocation PB) is generated. It should be understood that the number of the devices,for OSU _i Signal, sum shown in FIG. 6 _i The steps of value accumulation, judgment and acquisition of PB position indication (referred to as PB allocation opportunity acquisition cycle for short) need to execute C _i Secondary to obtain C _i The PB position information carries all OSU frames contained in the OSU signal. It should be noted that, after each centralized allocation described below is completed, the Sum currently running will _i Performing operations of subtracting P (i.e. executing Sum _i ＝Sum _i -P)) and the aforementioned acquisition PB allocation opportunity cycle is resumed.

It should be understood that the PB position information described above specifically refers to the number of the PB in one OTN multiplexed frame or OTN frame, or position identification information (e.g., row and column information of the PB in the OTN, etc.).

It should be noted that, according to the method 700 described above, PB allocation opportunities may be obtained for different OSU signals, and in order to avoid PB allocation conflicts between different OSU signals, as shown in fig. 6, after PB position indication is obtained, PB allocation may be performed for n OSU signals according to a predetermined interval constraint. That is, the PB allocation is performed intensively for n OSU signals, which can prevent the PB position allocation conflict problem existing in independently allocating PB for each OSU signal. Furthermore, if multiple OSU signals need to be PB allocated at the same time, the multiple OSU signals may be ordered according to a pre-agreed allocation rule. For example, sum corresponding to OSU signal _i The PB allocation is prioritized with the highest value, if Sum _i The values are the same, then ordered by OSU frame number (e.g., higher priority); alternatively, C may be in accordance with OSU signal _i Value ordering, C _i A high value of priority. Through the allocation rule, PB intervals allocated to each OSU frame flow are ensured to be in a constraint range.

Through PB position indication and centralized allocation, the related information of P PB and n OSU signals can be finally obtained, namely the OSU frames carried by P PB respectively and correspondingly are obtained. An example of PB allocation is given in Table 2. Wherein only the allocation situation that the service identification information is 20 is completely given; let the interval value be 10 and the c value be 7. It should be understood that the service identification information may also be referred to as a service identification number, service indication information, service occupancy indication information, or service occupancy PB indication information, etc.

TABLE 2

PB numbering	Service identification information
		1	3
2	7
		3	20
…	…
		13	20
…	…
		23	20
…	…
		33	20
…	…
		43	20
…	…
		53	20
…	…
		63	20
…	…
		119	19

In mapping OSU frames to PB blocks, since the OSU rate is lower than the total rate of the allocated C PB's, rate adaptation, i.e. inserting padding blocks (also called padding frames) is needed to achieve rate matching.

It will be appreciated that these rule information may be configured on the device in advance because of the fixed interval values and the determined PB allocation conflict resolution method. Thus, there is no need to interact this information between the devices. After receiving the OTN frame, the receiving end can calculate an OSU frame for carrying the same service data in the PB of the OTN frame according to the rule information configured, so that after receiving the OTN frame, the receiving end parses the corresponding OSU frame, and finally obtains the service data.

It will be appreciated that in a specific implementation, the present step is in addition to the various sub-steps described above, namely: determining location information of the plurality of payload blocks carrying the OSU frame according to the predetermined interval constraint; then, mapping the OSU frame to the plurality of payload blocks corresponding to the location information may be implemented in other manners. For example, determining the OSU frame and mapping the OSU frame onto the PB block may be alternated until completion of the OSU frame flow to PB block mapping location. In contrast, the present application is not limited.

S504: transmitting the OTN multiplexing frame to the equipment A

Specifically, device F sends device a an OTN multiplexed frame carrying OSU frames. It should be understood that S504 may also be described as device F sending OTN frames to device a because the frame structure of the multiplexed frames is based on the OTN frame structure. For example, if the payload area of an OTN frame is a frame structure of 4 rows 3808 columns of bytes. Then, in the present embodiment, the OTN multiplexing frame is 1.5 times the OTN frame, i.e., a frame structure of 6 rows 3808 columns bytes.

It should be appreciated that OTN multiplexed frames may also be constructed based on other types of OTN frames. For example ODU1, etc. To simplify the construction of the multiplexed frame, the P value may be calculated as follows.

It should be appreciated that the above formula is for an OSU rate of 10.4M and 119 is for an ODU0 containing P values. The meaning of each field may be referred to in the description of the other formulas, and will not be repeated here. If other OTN frames are referenced, then the value needs to be replaced correspondingly.

Table 3 gives examples of other P values calculated by the above formula. For example, if an OTN multiplexed frame mapped by an OSU frame is OPU2 (or ODU 2) -based, the OTN multiplexed frame includes 12 OPU2 frames (or ODU 2). To identify an OPU2 frame (or ODU 2) contained in one OTN multiplexed frame from a set of consecutive OPU2 frames (or ODU 2), a multi-frame overhead indication of the OTN frame may be employed. For example, by performing 0-11 cycles on the value of the multi-frame overhead indication, the number of the starting OTN frames and the number of the contained OTN frames corresponding to the OTN multiplexing frames can be determined by acquiring the value of the multi-frame overhead indication.

Table 3 information such as P value of other OTN frame calculated based on ODU0 frame

S601: according to the preset interval value, the OSU frame is demapped from the OTN multiplexing frame;

s602: and acquiring the service data from the OSU frame.

The above two steps are actions performed by the receiving device, device a. Specifically, after receiving the OTN multiplexed frame (or OTN frame) sent by the device F, the device a parses or demaps the OSU frame. It is understood that the received OTN multiplexed frames may also include OSU frames carrying other traffic data. Therefore, the device a needs to obtain PB position information corresponding to the service data according to a preset interval value. Then, based on the PB position information, OSU frames taken out from the corresponding PB positions are processed as a whole to obtain corresponding service data.

By limiting the interval value of PB, the method of the embodiment of the application can solve the possible error code risk in the prior art, and the PB position is determined by the interval value so as to restore service data, thereby improving the reliability of the network. In addition, the PB position occupied by the OSU frame has relative certainty, so that the management of the frame is relatively simple, the certainty is realized, and the transmission performance of the equipment is guaranteed.

An embodiment of the application provides a method, a device and a system for business processing. In this embodiment, taking the network scenario of fig. 1 as an example, assume that the transmitting end device of this embodiment is a and the receiving end device is H. It should be understood that the present embodiment may be replaced by other devices and service transmission paths.

Fig. 7 is a flow chart of a third service processing method according to an embodiment of the present application. Note that, in order to avoid redundancy, the OTN frame sent by the receiving end device a to the device H is not repeated in fig. 7. It should be noted that steps S401, S403 and S404 are the same as those shown in fig. 4, and will not be described again here. Steps S802 to S803, and steps S901 to 902 will be mainly described below.

S401, acquiring service data;

S802: mapping the service data into an Optical Service Unit (OSU) frame, wherein the OSU frame comprises an overhead subframe and a payload subframe, the overhead subframe is used for bearing overhead information, and the payload subframe is used for bearing the service data;

s803: placing the position information of the plurality of payload blocks into the OTN frame;

s404: sending the OTN multiplexing frame to a device H;

the steps above are actions performed by the transmitting device a. In which S802 shows a frame structure different from that of the OSU frame in the embodiment shown in fig. 5, that is, one OSU frame is composed of a plurality of subframes, and the functions of the subframes of different types are different. It should be understood that this embodiment may also be replaced with the frame structure of OSU frames as shown in fig. 5.

In addition, the device a transmits, to the device H, the OSU frames carrying the service data through the OTN frame, and also transmits, to the device H, the location information of the PB in which these OSU frames are specifically loaded through the OTN frame (i.e., step S803). Table 3 gives an example in which one device a records a plurality of PB position information corresponding to OSU frames. Where P represents the number of PB's contained in an OTN frame (or multiplexed frame as shown in fig. 5), and n identifies the total number of traffic carried by the OTN frame (or multiplexed frame).

Table 3 example of PB position information for OSU frame

PB numbering	Service identification information
		1	5
2	21
		3	20
…	…
		P	n

By sending the relationship information of the PB and the service (i.e., OSU frame) shown in table 3 to the sink device, the sink device can correctly fetch the service data. It should be understood that PB position information may be directly transferred by grouping PB numbers belonging to the same service identifier and transmitting n PB number groups. This application is not limited thereto.

As shown in fig. 4, the interval constraint may be implemented in a variety of ways. If the interval constraint is a fixed number of PB, then no location information may be sent as in the embodiment shown in FIG. 5. Alternatively, device a may also send location information for verification. If the interval constraint is a range of intervals or other similar form of PB, device a may send location information so that device H may correctly parse out OSU frames carrying the same traffic data. In particular, in one possible implementation, device a may communicate this information with one or more PB's of an OTN frame or a portion of one or more PB's. In another possible implementation, device a may utilize the overhead of OTN frames, for example: OPU frame overhead or ODU frame overhead to convey this information. Further, alternatively, to enhance the reliability of the information transfer, device a may encode or transfer multiple copies of the same location information. Alternatively, the transmission reliability may be improved by the embodiment shown in fig. 8.

It should be noted that, the above manner of transmitting PB position information by using OTN frames can be understood as a path-following manner, that is, the service data and the corresponding management information are transmitted through the same path. Alternatively, device a may send PB location information to a network management system or network controller, which then communicates to device H. The present application is not limited in this regard.

S901: according to the position information of the payload block, the OSU frame is demapped from the OTN frame;

s602: and acquiring the service data from the OSU frame.

The above two steps are steps performed by the reception apparatus H. Specifically, the device H analyzes PB position information from the received OTN frame, and then analyzes an OSU frame included in the OTN frame according to the position information, that is, performs demapping together on OSU frames carrying the same service data, so as to finally obtain the service data, and sends the service data to the connected client device, thereby completing end-to-end service transmission.

By limiting PB interval constraint and transmitting PB position information occupied by an OSU frame instead of using a method (with higher error code risk) that each PB carries a service identifier, the method of the embodiment of the application can solve the possible error code risk in the prior art, and the PB position is determined by interval constraint so as to restore service data, thereby improving the reliability of the network.

Fig. 8 is a flow chart of a fourth service processing method according to an embodiment of the present application. Note that, in order to avoid redundancy, the OTN frame sent by the receiving end device a to the device H is not repeated in fig. 8. It should be further noted that, the steps with the same numbers as those in fig. 7 can be referred to in the related description of fig. 7, and will not be repeated here. Steps S1003, S1101, and S1102 are mainly described below.

S401, acquiring service data;

s1003: placing service identifiers of the OSU frames into the plurality of payload blocks;

s404: and sending the OTN multiplexing frame to the equipment H.

s1101: checking whether the acquired OSU frame is matched with the position information according to service identification information carried by the payload blocks;

S1102: and after the matching is determined, acquiring the service data from the OSU frame.

As in the above steps S401, S802, S403, S1003, S803, and S404 are performed by the transmitting-end device a. In S1003, the device a carries, in addition to the OSU frame, a service identifier in the PB. In particular, a service data can be uniquely identified by carrying a tributary port (Tributary Port Number, TPN) or other identification. This service identity is used for service verification. Specifically, the service identifier may be used for the receiving device H to cross-check the received PB and OSU frame association information (i.e. which service is carried by the current PB and may also be referred to as PB location information corresponding to the OSU frame), so as to further improve the reliability of service transmission of the device.

When the OSU frame is mapped to the PB, a filler (which does not include traffic data, typically, a predetermined value) may be inserted for rate matching. The same filler block identifier can be filled for such filler blocks. Alternatively, for filler blocks belonging to different OSU frames, the TPN number of the OSU frame may be filled in, so as to better implement service isolation (i.e. the PB position of a signal belonging to a certain OSU can be clearly identified). In the latter case, to identify OSU frames and filler blocks, one bit may be added to distinguish them. Correspondingly, S901, S1101, and S1102 are performed by the receiving apparatus H. In S1101, the device H checks whether the OSU frame determined by the service identification information and the acquired location information match. If it is determined that there is agreement (i.e., a match), the device H proceeds to S1102, i.e., acquires service data. If there is a mismatch, for example, device H is required to verify if it is a PB location information delivery error to ensure the correctness of the service data resolution transmission.

It should be appreciated that in this embodiment, S803 is an optional step. That is, the device a and the device H do not interact with the location information, and acquire the location information through the configuration information, respectively. Through step S1003, the device H can verify whether the location information acquired by the configuration parameters is correct, thereby improving the reliability of data transmission.

The beneficial effects of this embodiment are similar to those of fig. 7, and will not be described again here. In addition, by further transmitting the service identification information, the method disclosed by the embodiment improves the reliability of transmitting the position information.

Fig. 9 is a flowchart of a fifth service processing method according to an embodiment of the present application. The embodiment mainly aims at the change of the number of the OSU frames caused by the increase of the service number, so that the corresponding relation between the OSU frames and PB is changed; or the number of the corresponding OSU frames is changed due to the change of the rate of the service data, so that the corresponding relation between the OSU frames and the PB is in a scene. Specifically, the method comprises the following steps.

S1201: service mapping method 400

Specifically, referring to the description shown in fig. 4, a detailed description is omitted herein. This step maps traffic data into OSU frames and passes it to the peer device through a set of PB positions.

S1202: mapping the traffic data into another optical traffic unit (OSU) frame;

specifically, the traffic data maps the traffic data of a certain period into another OSU frame in a next certain period. It should be appreciated that another OSU frame may be one or more. The present embodiment is not limited in this regard.

It should be noted that if the rate of the service data changes, the number of current OSU frames (i.e., another OSU frame) is different from the number of OSU frames used in the previous period. Alternatively, if other new traffic needs to be mapped into OSU frames, then the number of OSU frames currently is the same as the number of OSU frames used in the previous period.

S1203: mapping the further OSU frame into a plurality of further payload blocks of a further OTN frame, a change in a position of each of the plurality of further payload blocks relative to a position of a corresponding payload block of the plurality of payload blocks meeting a predetermined constraint;

in order to reduce the impact of the above mentioned varying scenarios on traffic allocation, certain constraints need to be met when assigning PB positions for OSU frames in the current period. Specifically, the relative change in the PB position allocated in the current period and the position allocated in the previous period is required to be relatively small. For example, if 3 PB blocks are previously allocated at positions 1,11 and 21. If an adjustment to this position is required, then the range over which each position can be adjusted can be set to a maximum PB bias value. For example, a rounded value of 0.5 x (P/C) may be used. (if the maximum deviation value is 2, it means that the deviation between the position of the current period PB and the corresponding PB position of the previous period PB is within (-2, +2). Taking the maximum PB deviation value as 2 as an example, the position allocated to the current period may be 2,12 and 20. It should be understood that in this embodiment, the PB position allocated to the current period needs to satisfy two constraints, one is an interval constraint, and the other is a constraint that constrains the range of variation of different periods.

S1204: transmitting the other OTN frame to the OTN equipment

Specifically, another OTN frame carrying the other OSU frame is sent to the downstream OTN device.

It should be noted that, for the specific implementation manner of the constraint of the convention, and the related operation of the sink device, and some optional implementation steps, reference may be made to the foregoing description of the interval constraint, which is not repeated herein.

The effect of this embodiment is similar to that shown in fig. 4. In addition, by reassigning the range of PB position which can be changed when the constraint changes, the embodiment of the application avoids the larger change of the OSU frame mapping position, and reduces the management complexity of the frame.

Fig. 10 is a schematic diagram of one possible network device. As shown in fig. 10, the network device 1300 includes a processor 1301, an optical transceiver 1302, and a memory 1303. Wherein the memory 1303 is optional. The network device 1300 can be applied to both a transmitting-side device and a receiving-side device.

When applied to a transmitting side device, processor 1301 is configured to implement the methods performed by the transmitting device shown in fig. 4 or 9 or shown in fig. 5, 7-8. In implementation, each step of the process flow may implement the method performed by the transmitting device of the above-described figure through an integrated logic circuit of hardware in the processor 1301 or an instruction in software. The optical transceiver 1302 is configured to receive and process the transmitted OTN frame, and transmit the OTN frame to a peer device (also referred to as a receiving device).

When applied to a receiving side device, processor 1301 is configured to implement the method performed by the receiving device illustrated in any of fig. 5 or 7-8. In implementation, each step of the processing flow may implement the method performed by the receiving-side apparatus described in the foregoing figures through an integrated logic circuit of hardware or an instruction in software form in the processor 1201. The optical transceiver 1302 is configured to receive OTN frames sent by a peer device (also referred to as a transmitting device), and send the OTN frames to the processor 1301 for subsequent processing.

Memory 1303 may be used to store instructions so that process 1301 may be used to perform steps as mentioned in the figures above. Alternatively, the memory 1303 may be used to store other instructions to configure parameters of the processor 1301 to implement corresponding functions.

It should be noted that, in the hardware configuration diagram of the network device illustrated in fig. 2, the processor 1301 and the memory 1303 may be located in a tributary board; it may also be located in a board where the branches and lines are integrated. Alternatively, the processor 1301 and the memory 1303 each include a plurality of boards, respectively located on the tributary board and the circuit board, and the two boards cooperate to perform the foregoing method steps.

It should be noted that the apparatus shown in fig. 10 may also be used to perform the method steps related to the embodiment modification shown in the aforementioned drawings, which are not described herein.

The processor 1301 in the embodiments 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, or a discrete hardware component, and may implement or execute the methods, steps, and logic blocks disclosed in the embodiments of the present application. The general purpose processor may be a microprocessor or any conventional processor or the like. The steps of a method disclosed in connection with the embodiments of the present application may be embodied directly in a hardware processor for execution, or in a combination of hardware and software elements in the processor for execution. Program code executed by the processor 1301 for implementing the above method may be stored in the memory 1303. Memory 1303 is coupled to processor 1301. The coupling in the embodiments of the present application is an indirect coupling or communication connection between devices, units, or modules, which may be in electrical, mechanical, or other forms for information interaction between the devices, units, or modules. Processor 1301 may operate in conjunction with memory 1303. The memory 1303 may be a nonvolatile memory such as a Hard Disk Drive (HDD) or the like, or may be a volatile memory (RAM) such as a random-access memory (RAM). Memory 1303 is any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited thereto.

Based on the above embodiments, the present application further provides a computer-readable storage medium. The storage medium has stored therein a software program which, when read and executed by one or more processors, performs the methods provided by any one or more of the embodiments described above. The computer readable storage medium may include: various media capable of storing program codes, such as a U disk, a mobile hard disk, a read-only memory, a random access memory, a magnetic disk or an optical disk.

Based on the above embodiments, the present application further provides a chip. The chip comprises a processor for implementing the functions involved in any one or more of the embodiments described above, such as obtaining or processing data frames involved in the methods described above. Optionally, the chip further comprises a memory for the necessary program instructions and data to be executed by the processor. The chip may be formed by a chip, or may include a chip and other discrete devices.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

It will be apparent to those skilled in the art that various modifications and variations can be made to the embodiments of the present application without departing from the scope of the embodiments of the present application. Thus, if such modifications and variations of the embodiments of the present application fall within the scope of the claims and the equivalents thereof, the present application is intended to encompass such modifications and variations.

Claims

1. A method of traffic handling in an Optical Transport Network (OTN), the method comprising:

acquiring service data;

mapping the service data into an Optical Service Unit (OSU) frame, the OSU frame comprising an overhead portion for carrying overhead information and a payload portion for carrying the service data;

mapping the OSU frame into a plurality of payload blocks of an OTN frame, wherein the interval between two adjacent payload blocks of the plurality of payload blocks meets a preset interval constraint;

and sending the OTN frame to OTN equipment.

2. The method of claim 1, wherein mapping the OSU frame into a plurality of payload blocks of the OTN frame, the spacing between two adjacent payload blocks of the plurality of payload blocks meeting a preset spacing constraint, comprises:

determining location information of the plurality of payload blocks carrying the OSU frame according to the predetermined interval constraint;

mapping the OSU frame to the plurality of payload blocks of the OTN frame corresponding to the location information.

3. The method of claim 2, wherein the method further comprises:

and sending the position information to the OTN equipment.

4. The method of claim 3, wherein said sending said location information to said OTN device comprises any one of:

placing the position information in a payload block of the OTN frame to be transmitted to the OTN device;

placing the location information in an overhead area of the OTN frame for transmission to the OTN device;

or sending the location information to a network management system, so that the network management system transmits the location information to the OTN device.

5. The method of any of claims 1-4, wherein the interval constraint is a fixed number of payload blocks.

6. The method of claim 5 wherein the fixed number is a rounded value of P/C, where P is the number of payload blocks contained in one multiplexing cycle of the OTN frame and C is the number of payload blocks occupied by the OSU frame.

7. The method of any of claims 1-4, wherein the interval constraint is a payload block comprising a range of values.

8. The method of claim 7 wherein the range of values is a (P/C) integer (1-50%), and a (P/C) integer (1 + 50%), wherein P is the number of payload blocks that are included in one multiplexing cycle of the OTN frame and C is the number of payload blocks that are occupied by the OSU frame.

9. The method of any of claims 1-4, wherein the interval constraint comprises an average data block interval value a and a maximum data block interval offset value T, wherein an interval of two adjacent payload blocks of the plurality of payload blocks falls within (a-T, a+t).

10. The method of any one of claims 1-9, wherein the method further comprises:

determining that a payload block corresponding to the service data is changed from the plurality of payload blocks to a plurality of other payload blocks;

and mapping a plurality of other OSU frames to which the service data is mapped into the plurality of other payload blocks, wherein a change in a position of each payload block of the plurality of other payload blocks relative to a position of a corresponding payload block of the plurality of payload blocks satisfies a predetermined constraint.

11. The method of claim 10, wherein the predetermined constraint is a number of payload blocks of maximum deviation of a change in position.

12. The method of claims 1-11, wherein the method further comprises:

and placing service identifiers of the OSU frames into the payload blocks, wherein the service identifiers are used for service verification.

13. An Optical Transport Network (OTN) device, the device comprising a processor and an optical transceiver, wherein:

The processor being configured to perform the method of any one of claims 1-12;

the sending the OTN frame to an OTN device specifically includes:

the processor sending the OTN frame to the optical transceiver;

the optical transceiver transmits the OTN frame to the OTN device.

14. An optical communication system comprising a client device and the OTN device of claim 13, wherein:

and the client equipment sends the service data to the OTN device.