CN117135498A

CN117135498A - Method and device for transmitting data

Info

Publication number: CN117135498A
Application number: CN202210957858.1A
Authority: CN
Inventors: 孙亮; 苏伟; 马腾·佩特鲁斯·约瑟夫·维瑟斯
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2022-05-20
Filing date: 2022-08-10
Publication date: 2023-11-28

Abstract

The application provides a method and a device for transmitting data. The method comprises the following steps: mapping the service data into a data frame and transmitting the data frame. Wherein the data frame comprises K slot blocks, each slot block of the K slot blocks comprising M bits and N X bytes. Part or all of the M bits are used to carry N pieces of first indication information, where each piece of first indication information in the N pieces of first indication information is used to indicate that an object carried by each X bytes of the N X bytes includes at least one of service data or padding. K. N and M are integers greater than or equal to 1, and X is an integer greater than 1. The frame structure provided by the application can provide low-delay data transmission for small-bandwidth service.

Description

Method and device for transmitting data

The present application claims priority from the chinese patent application filed 5-20-2022, filed 5-20, to the chinese national intellectual property agency, application number 202210552313.2, application name "a method and apparatus for transmitting data", the entire contents of which are incorporated herein by reference.

Technical Field

The present application relates to the field of optical communications, and more particularly, to a method and apparatus for transmitting data.

Background

With the development of informatization and clouding, special lines and video service bearing demands are more and more vigorous. The customer service features small bandwidth and large quantity, and requires simple and quick bandwidth flexible adjustment. Optical transport networks (optical transport network, OTN) are widely deployed on trunks, metropolitan cores and metropolitan edges, with the natural advantages of high quality, large capacity, and wide coverage. Therefore, adding small particle pipelines in OTN networks provides finer granularity of time slots and a more compact bandwidth lossless adjustment mechanism to carry high quality connections has become the current hotspot direction.

Disclosure of Invention

The application provides a method and a device for transmitting data, which can realize a small-bandwidth business data channel and flexibly define the bandwidth according to different scene requirements. In addition, the time delay of some overheads is reduced by redesigning the data frames, and the statistical accuracy of the overheads is improved.

In a first aspect, an embodiment of the present application provides a method for transmitting data. The method may be performed by the transmitting device or by a component of the transmitting device (e.g., a chip or a system-on-chip, etc.), as the application is not limited in this regard. The method comprises the following steps: mapping the service data into a data frame and transmitting the data frame. The data frame comprises K time slot blocks, each time slot block of the K time slot blocks comprises M bits and N X bytes, M1 bits of the M bits are used for bearing N pieces of first indication information, and each piece of first indication information in the N pieces of first indication information is used for respectively indicating that an object borne by each X bytes of the N X bytes comprises at least one of service data or padding. K is an integer greater than or equal to 1, N is an integer greater than or equal to 1, X is an integer greater than 1, M is an integer greater than or equal to N, and M1 is less than M.

It should be noted that, in the embodiment of the present application, the slot block may also be referred to as a resource unit or a resource block, or other names may exist with the development of technology, and the present application is also applicable to the present application.

Furthermore, in embodiments of the present application, the data frame may be an OTN frame or a metropolitan area transport network (metro transport network, MTN) frame. Or with the development of OTN technology and MTN technology, new types of OTN frames and MTN frames may be defined, which are also applicable to the present application.

It should be understood that the object for X bytes of the indication information to carry includes at least one of traffic data or padding can be classified into the following cases. The first information is used for indicating that the corresponding object carried by the X bytes is all data. Or the first information is used to indicate that the corresponding X-byte carried object is all padding. The first information is used to indicate that the corresponding X byte-carried objects are data only and padding. Or the first information is used to indicate that the corresponding X-byte carried object is data, padding, and other non-mentioned information.

In one implementation, when the first information is used to indicate that the corresponding X-byte carried object is only data and padding, the second information may be used to indicate the number of traffic data in the X-byte carried object or the second information may be used to indicate the number of padding in the X-byte carried object. Of course, for some special cases, for example, when the number of service data and padding is the same, preset information may also be used to indicate that the number of service data and padding carried by the X bytes is equal. At this point, it should be understood that the "preset" may include a predefined, e.g., protocol definition. The "pre-defining" may be implemented by pre-storing corresponding codes, tables or other manners of indicating relevant information in the device, and the present application is not limited to the specific implementation manner.

Based on the above scheme, the method for transmitting data provided by the embodiment of the application is based on the M bits+n×x byte time slots, so that the data frame supports the time slots of X byte small particles, and supports low delay and low jitter of the small particle service, thereby providing a better pipeline for the customer service. Meanwhile, the first indication information of N continuous X bytes is placed in a concentrated mode, the value of N can be flexibly selected according to the requirement of a system, and storage time delay brought by the N X bytes and the cost for indicating the N X bytes are balanced.

With reference to the first aspect, in certain implementation manners of the first aspect, the first indication information indicates that the object carried by the X bytes further includes second indication information, where the second indication information is located in a specific byte of the X bytes, and the second indication information is used to indicate a number of bytes used to carry the service data in (X-1) bytes other than the specific byte.

It should be noted that, in the embodiment of the present application, the specific byte refers to a specific position in the X bytes of the second indication information, for example, the first byte of the X bytes or the last byte of the X bytes or other positions, which is not limited by the present application, but it should be understood that, for N X bytes, the position of the second indication information is the same, that is, the position of the byte occupied by the second indication information in the X bytes is fixed.

Based on the scheme, the second indication information is used for indicating the quantity of the service data in the service pipeline, so that the clock recovery of the service with the demand for clock recovery is facilitated according to the number of the data bytes in the unit time period. Meanwhile, the purpose of simplifying the chip is achieved through a code table of the second indication information.

With reference to the first aspect, in certain implementation manners of the first aspect, bits in the specific byte other than bits occupied by the second instruction information are used to correct transmission errors of the second instruction information. By centrally placing the second indication information and performing correction protection, waste of overhead can be avoided.

With reference to the first aspect, in certain implementations of the first aspect, each X bytes of the n×x bytes is a time slot of the data frame.

It should be appreciated that for N X bytes, the N X bytes comprise N slots.

With reference to the first aspect, in certain implementation manners of the first aspect, y×n×x bytes in Y adjacent slot blocks are one slot of the data frame, and Y is an integer greater than or equal to 1. Based on the scheme, according to different values of Y, the time slot particles with large bit width of Y, N and X can be realized, and the bandwidth capacity is improved.

With reference to the first aspect, in certain implementation manners of the first aspect, z×n×x bytes in the Z equally spaced slot blocks are one slot of the data frame, and Z is an integer greater than or equal to 1. Based on this scheme, a hybrid time slot exists in the data frame, and the instant message includes z×n×x bytes or the time slot is X bytes, that is, the bandwidth can be flexibly defined according to different scene requirements.

With reference to the first aspect, in certain implementations of the first aspect, M2 bits of the M bits are used to detect errors or correct transmission errors of the N bits, where M2 is less than M.

Illustratively, the error detection information may be a cyclic redundancy check code (cyclic redundancy check, CRC) and the correction information may be an instruction error correction technique (error checking and correcting).

It should be understood that, for every X bytes, a first indication message needs to be added to indicate an object carried by the X bytes, and separately detecting or correcting the first indication message of every X bytes will cause excessive overhead and waste transmission bandwidth, so that N consecutive first indication messages of the X bytes are centrally placed and protected, which can avoid the waste of overhead, thereby improving efficiency and reliability of data transmission.

With reference to the first aspect, in certain implementations of the first aspect, the data frame further includes location indication information, where the location indication information is used to indicate a starting location of a slot cycle.

The slot period may be, for example, an optical channel traffic data tributary unit group (optical channel service data tributary unit group, ostu) or an optical channel data tributary unit group (optical channel data tributary unit group, ODTUG).

With reference to the first aspect, in certain implementations of the first aspect, the number of bytes of the location indication information is 1 or 2.

With reference to the first aspect, in certain implementations of the first aspect, the value of X is one of 8, 16, 24, and 32. It should be appreciated that for small granularity bandwidth (e.g., 10M) of X-byte located traffic transmission, it is necessary to ensure that the traffic cannot have excessive jitter on the transmission path, so in order to ensure that the quality traffic has delay jitter in the end-to-end transmission process, the value of X may be 8, 16, 24, 32 in combination with the implementation cost of the chip.

With reference to the first aspect, in certain implementations of the first aspect, the value of M is a multiple of 8. Based on the value of M, the M bits after the control code of X bytes is concentrated and the verification error correction information is added are multiples of 8 bits, so that the chip can perform time delay processing conveniently.

Illustratively, the set of M, N and X values includes { m=8, n=4, x=16 }, { m=8, n=4, x=32 }, { m=16, n=10, x=8 }, { m=16, n=10, x=16 }.

It should be noted that, in designing the X bytes, the present application can take a value based on the maximum allowable jitter of the service transmission. For OSU localized 10M granularity traffic transmission, it is typically ensured that there is not excessive jitter on the transmission path and that high quality traffic requires that the end-to-end (for example 20 stations) transmission delay jitter should not be greater than 500us. The value of X will determine the transmission jitter and transmission delay of the 10M granularity service, and in combination with the realization cost of the chip, the value of X can be 8, 16, 24, and 32.

In addition, the application requires balancing the overhead and the time delay when designing the values of M and N. For example, if 1 bit of the first indication information is added to each X bytes to indicate at least one of data or padding, separately performing ECC protection on the 1 bit of the first indication information of each X bytes results in excessive overhead wasting transmission bandwidth, and thus, N consecutive 1 bit control codes of X bytes are placed in a concentrated manner to perform ECC protection to reduce overhead waste. Since the control code of N X bytes is centrally protected, meaning that N X bytes of storage delay will be introduced during data processing, the value of N needs to be balanced between overhead saving and delay increasing. In addition, the M bits after the N X-byte control code set protection and the added check error correction information should be multiple of 8 bits to facilitate the delay processing of the chip.

In a second aspect, the method may be performed by a transmitting device or by a component of a transmitting device (e.g., a chip or a system-on-chip, etc.), as the application is not limited in this respect. The method comprises the following steps: mapping traffic data into a first data frame, mapping the first data frame into one or more slots of a second data frame, and transmitting the second data frame. The payload area of the first data frame is used for bearing the service data, the payload area of the first data frame comprises at least one bearing unit, each bearing unit in the at least one bearing unit corresponds to at least one check overhead, each check overhead in the at least one check overhead is used for carrying out bit interleaving parity check on the corresponding bearing unit, and the bit rate of the first data frame is smaller than 1.25Gbit/s.

In the embodiment of the present application, the bearer unit is represented as at least one area divided for the first data frame, which may also be referred to as an area (area), a section, a block, a short frame, or the like, which is not limited by the present application.

Based on the scheme, for the data frame with the bit rate smaller than 1.25Gbit/s, the payload area of the data frame is divided into shorter intervals, so that the transmission delay of the check overhead corresponding to the intervals is reduced, and the purpose of improving the statistical accuracy of the check overhead is achieved at one time.

With reference to the second aspect, in some implementations of the second aspect, the at least one check overhead is located in an overhead area of the first data frame, and the at least one bearer unit is configured to carry the service data. It will be appreciated that under this scheme the bearer unit is only used to carry traffic data, i.e. only comprises payload areas.

With reference to the second aspect, in some implementations of the second aspect, the bearer unit includes an overhead area and a payload area, and the at least one check overhead is located in the overhead area of the bearer unit. It should be appreciated that under this scheme the bearer unit is used not only to carry traffic data but also to carry a check overhead, i.e. the bearer unit comprises a payload area and an overhead area.

With reference to the second aspect, in certain implementations of the second aspect, the overhead area of the bearer unit further includes at least one of protection switching overhead or mapping overhead.

With reference to the second aspect, in some implementations of the second aspect, the check overhead is an X-bit interleaved parity check BIP-8.

With reference to the second aspect, in certain implementations of the second aspect, the overhead area of the first data frame includes a Path Monitoring (PM) overhead, a tandem connection monitoring 1 (TCM 1) overhead, a tandem connection monitoring 2 (TCM 2) overhead, and a latency measurement overhead. Based on the scheme, the time delay calculation between the sending end and the receiving end can be more accurately completed through time delay measurement overhead of nanosecond level for the first data frame.

With reference to the second aspect, in some implementations of the second aspect, the frame structure of the first data frame is 4 rows by 3824 columns of bytes or 2 rows by 3824 columns of bytes. Based on the scheme, the first data frame provided by the embodiment of the application can be a structure of multiplexing the ODU data frame, and the modification is performed on the ODU data frame.

In a third aspect, an embodiment of the present application provides a method for transmitting data. The method may be performed by the receiving device or by a component of the receiving device (e.g., a chip or a system-on-chip, etc.), as the application is not limited in this respect. The method comprises the following steps: and receiving a data frame, and according to the N pieces of first indication information, demapping the service data from the data frame. The data frame comprises K time slot blocks, each time slot block of the K time slot blocks comprises M bits and N X bytes, M1 bits of the M bits are used for bearing N pieces of first indication information, and each piece of first indication information in the N pieces of first indication information is used for respectively indicating that an object borne by each X bytes of the N X bytes comprises at least one of service data or padding. Wherein K is an integer greater than or equal to 1, N is an integer greater than or equal to 1, X is an integer greater than 1, M is an integer greater than or equal to N, and M1 is less than M.

With reference to the third aspect, in some implementations of the third aspect, the first indication information indicates that the object carried by the X bytes further includes second indication information, where the second indication information is located in a specific byte of the X bytes, and the second indication information is used to indicate a number of bytes used to carry the service data in (X-1) bytes other than the specific byte.

With reference to the third aspect, in some implementations of the third aspect, bits in the specific byte other than the bits occupied by the second indication information are used to correct transmission errors of the second indication information.

With reference to the third aspect, in certain implementations of the third aspect, each X bytes of the n×x bytes is a slot of the data frame.

With reference to the third aspect, in certain implementations of the third aspect, y×n×x bytes in Y adjacent slot blocks are one slot of the data frame, and Y is an integer greater than or equal to 1.

With reference to the third aspect, in certain implementations of the third aspect, z×x bytes in the Z equally spaced slot blocks are one slot of the data frame, and Z is an integer greater than or equal to 1.

With reference to the third aspect, in some implementations of the third aspect, M2 bits of the M bits are used to detect errors or correct transmission errors of the N bits, where M2 is less than M.

With reference to the third aspect, in certain implementations of the third aspect, the data frame further includes location indication information, where the location indication information is used to indicate a starting location of a slot cycle.

With reference to the third aspect, in some implementations of the third aspect, the number of bytes of the location indication information is 1 or 2.

With reference to the third aspect, in some implementations of the third aspect, the value of X is one of 8, 16, 24, and 32.

With reference to the third aspect, in some implementations of the third aspect, the value of M is a multiple of 8.

The foregoing third aspect may specifically refer to the description of the beneficial effects in the first aspect, which is not repeated herein.

In a fourth aspect, an embodiment of the present application provides a method for transmitting data. The method may be performed by the receiving device or by a component of the receiving device (e.g., a chip or a system-on-chip, etc.), as the application is not limited in this respect. The method comprises the following steps: a first data frame is received, the first data frame comprising one or more time slots. And demapping a second data frame from the first data frame and demapping the service data from the second data frame. The payload area of the second data frame is used for carrying service data, the payload area of the second data frame comprises at least one carrying unit, each carrying unit in the at least one carrying unit corresponds to at least one check overhead, each check overhead in the at least one check overhead is used for carrying out bit interleaving parity check on the corresponding carrying unit, and the bit rate of the first data frame is smaller than 1.25Gbit/s.

With reference to the fourth aspect, in some implementations of the fourth aspect, the at least one check overhead is located in an overhead area of the first data frame, and the at least one bearer unit is configured to carry the service data.

With reference to the fourth aspect, in some implementations of the fourth aspect, the bearer unit includes an overhead area and a payload area, and the at least one check overhead is located in the overhead area of the bearer unit.

With reference to the fourth aspect, in some implementations of the fourth aspect, the overhead area of the bearer unit further includes at least one of protection switching overhead or mapping overhead.

With reference to the fourth aspect, in some implementations of the fourth aspect, the check overhead is an X-bit interleaved parity check BIP-8.

With reference to the fourth aspect, in certain implementations of the fourth aspect, the overhead area of the first data frame includes a Path Monitoring (PM) overhead, a tandem connection monitoring 1 (TCM 1) overhead, a tandem connection monitoring 2 (TCM 2) overhead, and a latency measurement overhead.

With reference to the fourth aspect, in some implementations of the fourth aspect, the frame structure of the first data frame is 4 rows by 3824 columns of bytes or 2 rows by 3824 columns of bytes.

The above-mentioned fourth aspect may refer to the description of the advantageous effects of the second aspect, and will not be repeated here.

In a fifth aspect, an embodiment of the present application provides an apparatus for transmitting data. The apparatus is for performing the method provided in the first aspect described above or for performing the method provided in the second aspect described above. In particular, the means for transmitting data may comprise means and/or modules for performing the method provided by the first aspect or any of the above-mentioned implementations of the first aspect, or the means for transmitting data may comprise means and/or modules, such as a processing module and a transceiver module, for performing the method provided by the second aspect or any of the above-mentioned implementations of the second aspect.

In an implementation manner, the apparatus for transmitting data may include a unit and/or a module for performing the method provided in the first aspect or any one of the implementation manners of the first aspect, or include a unit and/or a module for performing the method provided in the second aspect or any one of the implementation manners of the second aspect, and be a transmitting end device. The transceiver module may be a transceiver, or an input/output interface. The processing module may be at least one processor. Alternatively, the transceiver may be a transceiver circuit. Alternatively, the input/output interface may be an input/output circuit.

In another implementation, the means for transmitting data is a chip, a system-on-chip, or a circuit in the sender device. The transceiver module may be an input/output interface, interface circuit, output circuit, input circuit, pin or related circuit on the chip, system on a chip or circuit, etc. The processing module may be at least one processor, processing circuit or logic circuit, etc.

The advantages of the method according to the above fifth aspect and possible designs thereof may be referred to the advantages of the first aspect and possible designs thereof or the advantages of the second aspect and possible designs thereof.

In a sixth aspect, an embodiment of the present application provides an apparatus for transmitting data. The apparatus is for performing the method provided in the third aspect described above or for performing the method provided in the fourth aspect described above. In particular, the means for transmitting data may comprise means and/or modules for performing the method provided in the third aspect, or the means for transmitting data may comprise means and/or modules, such as a processing module and a transceiver module, for performing the method provided in the fourth aspect.

In one implementation, the means for transmitting data is a receiving end device. The transceiver may be a transceiver, or an input/output interface. The processing module may be at least one processor. Alternatively, the transceiver may be a transceiver circuit. Alternatively, the input/output interface may be an input/output circuit.

In another implementation, the means for transmitting data is a chip, a system-on-chip, or a circuit in the receiving end device. The transceiver module may be an input/output interface, interface circuit, output circuit, input circuit, pin or related circuit on the chip, system on a chip or circuit, etc. The processing module may be at least one processor, processing circuit or logic circuit, etc.

In a seventh aspect, embodiments of the present application provide a processor configured to perform the method provided in the above aspects.

The operations such as transmitting and acquiring/receiving, etc. related to the processor may be understood as operations such as outputting and receiving, inputting, etc. by the processor, or may be understood as operations such as transmitting and receiving by the radio frequency circuit and the antenna, if not specifically stated, or if not contradicted by actual function or inherent logic in the related description, which is not limited by the present application.

In an eighth aspect, embodiments of the present application provide a computer-readable storage medium. The computer readable storage medium stores program code for execution by a device, the program code comprising instructions for performing the method provided by any implementation of the first or second or third or fourth aspects described above.

In a ninth aspect, embodiments of the present application provide a computer program product comprising instructions. The computer program product, when run on a computer, causes the computer to perform the method provided by any implementation of the first or second or third or fourth aspect described above.

In a tenth aspect, an embodiment of the present application provides a chip, where the chip includes a processor and a communication interface, where the processor reads instructions stored on a memory through the communication interface, and performs a method provided by any implementation manner of the first aspect or the second aspect or the third aspect or the fourth aspect.

Optionally, as an implementation manner, the chip further includes a memory, where a computer program or an instruction is stored in the memory, and the processor is configured to execute the computer program or the instruction stored on the memory, where the processor is configured to execute the method provided by any implementation manner of the second aspect or the third aspect or the fourth aspect.

In an eleventh aspect, an embodiment of the present application provides a communication system, including at least two apparatuses for transmitting data according to the fifth aspect.

The advantages of the sixth to eleventh aspects may be specifically referred to the description of the advantages of the first aspect or the description of the advantages of the second aspect, and are not repeated here.

In a twelfth aspect, an embodiment of the present application provides a method for transmitting data. The method may be performed by the transmitting device or by a component of the transmitting device (e.g., a chip or a system-on-chip, etc.), as the application is not limited in this regard. The method comprises the following steps: mapping the service data into a data frame and transmitting the data frame. The data frame comprises K time slot blocks, each time slot block of the K time slot blocks comprises M bits and N X bytes, the M bits are used for bearing N pieces of first indication information, and each piece of first indication information in the N pieces of first indication information is used for respectively indicating that an object borne by each X bytes of the N X bytes comprises at least one of service data or padding. Wherein K is an integer greater than or equal to 1, N is an integer greater than or equal to 1, X is an integer greater than 1, and M is an integer greater than or equal to N.

With reference to the twelfth aspect, in certain implementations of the twelfth aspect, the N is equal to 1.

With reference to the twelfth aspect, in some implementations of the twelfth aspect, the first indication information indicates that the object carried by the X bytes further includes second indication information. The second indication information is located at a specific byte among the X bytes, and the second indication information is used to indicate the number of bytes for carrying the service data among (X-1) bytes other than the specific byte.

With reference to the twelfth aspect, in some implementations of the twelfth aspect, bits in the specific byte other than bits occupied by the second indication information are used to correct transmission errors of the second indication information.

With reference to the twelfth aspect, in some implementations of the twelfth aspect, the value of M is a multiple of 2.

With reference to the twelfth aspect, in some implementations of the twelfth aspect, the M bits are divided into N groups, and each of the N groups includes a bit for carrying one of the N first indication information.

With reference to the twelfth aspect, in some implementations of the twelfth aspect, M has a value of 2, x has a value of 16, and n has a value of 1.

With reference to the twelfth aspect, in certain implementations of the twelfth aspect, each X bytes of the N X bytes is a time slot of the data frame.

With reference to the twelfth aspect, in certain implementations of the twelfth aspect, y×n×x bytes in Y adjacent slot blocks are one slot of the data frame, and Y is an integer greater than or equal to 1.

With reference to the twelfth aspect, in certain implementations of the twelfth aspect, z×n×x bytes in the Z equally spaced slot blocks are one slot of the data frame, and Z is an integer greater than or equal to 1.

With reference to the twelfth aspect, in some implementations of the twelfth aspect, the data frame further includes location indication information, where the location indication information is used to indicate a starting location of a slot cycle.

With reference to the twelfth aspect, in some implementations of the twelfth aspect, the number of bytes of the location indication information is 1 or 2.

With reference to the twelfth aspect, in some implementations of the twelfth aspect, the value of X is one of 8, 16, 24, and 32.

In a thirteenth aspect, an embodiment of the present application provides a method for transmitting data. The method may be performed by the receiving device or by a component of the receiving device (e.g., a chip or a system-on-chip, etc.), as the application is not limited in this respect. The method comprises the following steps: and receiving a data frame, and according to the N pieces of first indication information, demapping the service data from the data frame. The data frame comprises K time slot blocks, each time slot block of the K time slot blocks comprises M bits and N X bytes, the M bits are used for bearing N first indication information, each first indication information in the N first indication information is used for respectively indicating that an object borne by each X byte of the N X bytes comprises at least one of service data or padding, wherein K is an integer greater than or equal to 1, N is an integer greater than or equal to 1, X is an integer greater than 1, and M is an integer greater than or equal to N.

With reference to the thirteenth aspect, in certain implementations of the thirteenth aspect, the N is equal to 1.

With reference to the thirteenth aspect, in certain implementation manners of the thirteenth aspect, the first indication information indicates that the object carried by X bytes further includes second indication information, where the second indication information is located in a specific byte of the X bytes, and the second indication information is used to indicate a number of bytes used to carry the service data in (X-1) bytes other than the specific byte.

With reference to the thirteenth aspect, in some implementations of the thirteenth aspect, bits in the specific byte other than bits occupied by the second indication information are used to correct transmission errors of the second indication information.

With reference to the thirteenth aspect, in certain implementations of the thirteenth aspect, the value of M is a multiple of 2.

With reference to the thirteenth aspect, in some implementations of the thirteenth aspect, the M bits are divided into N groups, and each of the N groups includes a bit for carrying one of the N first indication information.

With reference to the thirteenth aspect, in certain implementations of the thirteenth aspect, M has a value of 2, x has a value of 16, and n has a value of 1.

With reference to the thirteenth aspect, in certain implementations of the thirteenth aspect, each X bytes of the N X bytes is a time slot of the data frame.

With reference to the thirteenth aspect, in certain implementations of the thirteenth aspect, y×n×x bytes in Y adjacent slot blocks are one slot of the data frame, and Y is an integer greater than or equal to 1.

With reference to the thirteenth aspect, in certain implementations of the thirteenth aspect, z×n×x bytes in the Z equally spaced slot blocks are one slot of the data frame, and Z is an integer greater than or equal to 1.

With reference to the thirteenth aspect, in certain implementations of the thirteenth aspect, the data frame further includes location indication information, where the location indication information is used to indicate a starting location of a slot cycle.

With reference to the thirteenth aspect, in certain implementations of the thirteenth aspect, the number of bytes of the location indication information is 1 or 2.

With reference to the thirteenth aspect, in certain implementations of the thirteenth aspect, the value of X is one of 8, 16, 24, and 32.

In a fourteenth aspect, an embodiment of the present application provides an apparatus for transmitting data. The apparatus is for performing the method provided in the twelfth aspect above. In particular, the means for transmitting data may comprise means and/or modules for performing the method provided by the twelfth aspect or any of the implementations described above.

In an implementation manner, the apparatus for transmitting data may include a unit and/or a module configured to perform a method provided in the twelfth aspect or any one of the foregoing implementation manners of the twelfth aspect, which is a transmitting end device. The transceiver module may be a transceiver, or an input/output interface. The processing module may be at least one processor. Alternatively, the transceiver may be a transceiver circuit. Alternatively, the input/output interface may be an input/output circuit.

In a fifteenth aspect, an embodiment of the present application provides an apparatus for transmitting data. The apparatus is for performing the method provided in the thirteenth aspect above. In particular, the means for transmitting data may comprise means and/or modules for performing the method provided in the thirteenth aspect.

In a sixteenth aspect, an embodiment of the present application provides a processor configured to perform the method provided in the twelfth aspect or the method provided in the thirteenth aspect.

In a seventeenth aspect, embodiments of the present application provide a computer-readable storage medium. The computer readable storage medium stores program code for execution by a device, the program code comprising instructions for performing the method provided by any one of the implementations of the twelfth or thirteenth aspect described above.

In an eighteenth aspect, embodiments of the present application provide a computer program product comprising instructions. The computer program product, when run on a computer, causes the computer to perform the method provided by any one of the implementations of the twelfth or thirteenth aspect described above.

In a nineteenth aspect, an embodiment of the present application provides a chip, where the chip includes a processor and a communication interface, where the processor reads instructions stored on a memory through the communication interface, and performs a method provided by any implementation manner of the twelfth aspect or the thirteenth aspect.

Optionally, as an implementation manner, the chip further includes a memory, where a computer program or an instruction is stored in the memory, and the processor is configured to execute the computer program or the instruction stored on the memory, and when the computer program or the instruction is executed, the processor is configured to perform a method provided by any implementation manner of the twelfth aspect or the thirteenth aspect.

Drawings

Fig. 1 is a schematic diagram of a possible application scenario according to an embodiment of the present application.

Fig. 2 is a schematic diagram of a possible hardware architecture of a network device.

Fig. 3 is a schematic diagram of a frame structure of an OTN frame.

Fig. 4 is a schematic diagram of a 65 byte slot block according to an embodiment of the present application.

FIG. 5 is a schematic diagram of a first 16-byte bit width code table according to an embodiment of the present application.

Fig. 6 is a schematic diagram of an OTN frame structure corresponding to the optical transport network data of fig. 4 according to an embodiment of the present application.

Fig. 7 is a schematic diagram of a structure of a 129 byte slot block according to an embodiment of the present application.

FIG. 8 is a schematic diagram of a 32-byte bit width code table according to an embodiment of the present application.

Fig. 9 is a schematic diagram of a 82 byte slot block according to an embodiment of the present application.

Fig. 10 is a schematic diagram of a 162 byte slot block according to an embodiment of the present application.

Fig. 11 is a schematic diagram of a 97 byte slot block according to an embodiment of the present application.

Fig. 12 is a schematic diagram of an OTN data frame structure of adjacent 3×65 byte slot blocks according to an embodiment of the present application.

Fig. 13 is a schematic diagram of a 192 byte slot block according to an embodiment of the present application.

Fig. 14 is a schematic diagram of an OTN data frame structure of a fixed-interval 3×65 byte slot block according to an embodiment of the present application.

Fig. 15 is a schematic diagram of mapping hierarchy of an ODUnew frame provided in an embodiment of the present application.

Fig. 16 is a schematic diagram of a first ODUnew frame structure according to an embodiment of the present application.

Fig. 17 is a schematic structural diagram of a carrying unit according to an embodiment of the present application.

Fig. 18 is an overhead schematic diagram of a bearer unit overhead area provided in an embodiment of the present application.

Fig. 19 is a schematic diagram of an overhead area of a first ODUnew frame structure according to an embodiment of the present application.

Fig. 20 is a schematic diagram of an overhead area of a second ODUnew frame structure according to an embodiment of the present application.

Fig. 21 is a schematic diagram of a second ODUnew frame structure according to an embodiment of the present application.

Fig. 22 is a schematic flow chart diagram of a method 2200 for transmitting data according to an embodiment of the present application.

Fig. 23 is a schematic flow chart diagram of another method 2300 of transmitting data provided by an embodiment of the application.

Fig. 24 is a schematic structural diagram of a communication device according to an embodiment of the present application.

FIG. 25 is a diagram of a second 16-byte bit-width code table according to an embodiment of the present application.

Fig. 26 is a schematic diagram of a 130-bit slot block according to an embodiment of the present application.

Fig. 27 is a schematic diagram of a slot arrangement according to an embodiment of the present application.

Detailed Description

The technical scheme of the application will be described below with reference to the accompanying drawings.

The following description is made in order to facilitate understanding of embodiments of the present application.

The words "first", "second", etc. and various numerical numbers in the first, the text description of the embodiments of the application shown below or in the drawings are merely for descriptive convenience and are not necessarily for describing particular sequences or successes and are not intended to limit the scope of the embodiments of the application. For example, distinguishing between different data frames, etc.

The terms "comprises," "comprising," and "having," in the context of the second, following illustrated embodiment of the present application, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements that are expressly listed or inherent to such process, method, article, or apparatus.

Third, in embodiments of the application, the words "exemplary" or "such as" are used to mean examples, illustrations, or descriptions, and embodiments or designs described as "exemplary" or "such as" should not be construed as being preferred or advantageous over other embodiments or designs. The use of the word "exemplary" or "such as" is intended to present the relevant concepts in a concrete fashion to facilitate understanding.

Fourth, in the embodiment of the present application, the service data refers to a service carried by an optical transport network or a metropolitan transport network. For example, it may be an ethernet service, a packet service, a wireless backhaul service, etc. The traffic data may also be referred to as traffic signals, customer data or customer traffic data. It should be understood that the type of service data is not limited in the embodiment of the present application.

Fifth, in the present application, "for indication" may include direct indication and indirect indication. When describing a certain information for indicating a, it may be included that the information indicates a directly or indirectly, and does not necessarily represent that a is carried in the information.

Sixth, in the embodiments of the present application, the description of the embodiments is given by taking OTN frames as examples, and it should be understood that in future technical development, the present application is also applicable to other OTN-bearing frames and MTN frames.

Seventh, in the embodiment of the present application, the character "×" is an operation symbol, which represents a product.

The embodiment of the application is applicable to optical networks, such as: optical transport networks (optical transport network, 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 OTN100 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 OTN100 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 and are also suitable for use in the present application.

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 reception and transmission of various customer services, such as SDH service, packet service, ethernet service, and forwarding service, among others. 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 the specific components (e.g., signal processor) may be one or more, and the application is not limited unless specifically stated. It should also be noted that the present application is not limited in any way by 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 power supply for backup, a fan for heat dissipation, and the like.

With the advent of the 5 th generation fixed network (Fifth Generation Fixed Network, F5G) age, the demand for dedicated line services in different scenarios has been gradually refined, for example, industry production networks, high quality user terminals, etc., which are increasingly in demand for high quality connections. These dedicated services are characterized by small bandwidth and large number, requiring flexible adjustment of bandwidth. Currently, small particle traffic is carried in OTNs using optical service unit (optical service unit, OSU) frames. Besides providing fine bandwidth granularity, the OSU can not depend on the traditional OTN time slot structure any more, can effectively enhance service bearing flexibility and match the service grouping evolution trend. The process is based on a mapping mode of a flexible tributary unit (flexible tributary unit, TUflex), namely, by mapping and encapsulating multi-path services into multi-path OSUs respectively, different OSUs correspond to different TUflex, and then multiplexing the multi-path TUflex into an optical payload unit (optical payload unit, OPU) frame.

In a time division multiplexing (time division multiplexing, TDM) scheme, each traffic path performs periodic data transmission according to a high-order defined slot bit width. Wherein the OSU slot bit width may be 192 bytes with a data transmission period of 148us for a 10.4Mbit/s pipe.

Although the high-efficiency bearing of the services with different granularity of 2M to 100Gbps can be realized by introducing an OSU technology. But for some smaller bandwidth traffic signals, for example for a 10M traffic signal, when the 10M traffic signal is mapped to an OSU pipe of 10.4Mbit/s, it is necessary to buffer about 185 bytes of traffic signal data before transmission, which process takes about 148us, resulting in a significant increase in the time for traffic signal transmission. Furthermore, for a 10.4Mbit/s slot bandwidth of the OSU, there may even be a delay of 148us for one transmission cycle in the process of forwarding the received input slot data to the designated transmission egress slot when the intermediate node performs TDM switching.

Therefore, the current TDM scheduling scheme based on the 192 byte slot bit width of OSU has the problem of large transmission delay of the small bandwidth client signal. In order to solve the above-mentioned problems, the embodiment of the present application redefines a data frame dividing method based on the current OTN frame structure and OSU frame structure, so as to reduce the time delay of the OTN device for transmitting the small bandwidth service in the TDM manner.

Fig. 3 is a schematic diagram of a frame structure of an OTN frame. As shown in fig. 3, the OTN frame is a 4-row multi-column frame structure including an overhead area, a payload area, and a forward error correction (Forward Error Correction, FEC) area. Specifically, the OTN frame structure may refer to related descriptions in the current protocol, and will not be described herein. The Payload area of an OTN frame is divided into a plurality of Payload Blocks (PB). Each PB occupies a fixed length (also referred to as size) position in the payload area, e.g., 128 bytes. Illustratively, the overhead that an OTN frame may include is shown in table 1 below.

Table 1 example of overhead that OTN frames may carry

It should be appreciated that the above description of the OTN frame structure is only one example. Other variations of OTN frames are also suitable for use with 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 application is not limited in its name.

Based on the OTN frame shown in fig. 3, fig. 4 is a schematic structural diagram of a 65 byte slot block according to an embodiment of the present application. The corresponding OTN data frame structure is a data frame structure of 65 byte slot blocks (which may also be referred to as resource blocks or resource units), with a slot bit width of 16 bytes. As shown in fig. 4, the structure of the 65-byte slot block is defined to be composed of 1 byte and 4 16 bytes separately.

It should be noted that, in the time slot block division of the OTN frame as shown in fig. 4, 4 bits contained in independent 1 byte are used to independently indicate that the object carried in each 16 bytes includes at least one of data or padding. I.e. every 16 bytes of the object carried is indicated with a separate bit, which may be referred to as control code.

It should be understood that 4 bits are used to independently indicate that the object carried in each 16 bytes includes at least one of data or padding, and can be divided into the following cases.

1. The 1 bit is used to indicate that the corresponding 16-byte carried object is all data.

2. The 1 bit is used to indicate that the corresponding 16 byte-carried object is all filled.

3. The 1 bit is used to indicate that the corresponding 16 byte carried object is data and padding.

4. The 1 bit is used to indicate that the corresponding 16 byte carried object is data, padding, and other information.

In the above-described scenario 3 and scenario 4, the second information may be used to indicate the size (e.g., number of bytes) of the traffic data in the object carried in 16 bytes or the second information may be used to indicate the size (e.g., number of bytes, or number of two bytes, or number of bits, etc.) of the padding in the object carried in 16 bytes.

It should be appreciated that in the time slot block division of an OTN frame as shown in fig. 4, 8 bits contained in separate 1 byte may be employed for separately indicating that the object carried in each 16 bytes includes at least one of data or padding. I.e. every 16 bytes carrying an object is indicated with two bits, i.e. every 16 bytes the corresponding control code is two bits. At this time, the 2 bits are used to independently indicate that the object carried in the corresponding 16 bytes includes at least one of data or padding, and may be also divided into the above 4 cases, which are not described herein again.

In addition, the OTN frame may be divided by an independent slot block interleaving method, for example, a 130-bit slot block interleaving method. At this time, the slot block division of the OTN frame may be as shown in fig. 26, and in this scenario, each 130-bit slot block contains a 2-bit control indication and a 128-bit (16-byte) payload. Fig. 27 is a schematic diagram of its slot arrangement, where an OPU frame is divided into P slots, each slot block being 130 bits.

In one implementation, when 16 bytes are indicated with a 1 bit control code, the indication may be established as shown in the table of fig. 5. Specifically, when the 1-bit control code is 0, it means that 16 bytes are all data. When the 1-bit control code is 1, a first byte of 16 bytes is defined as second indication information (e.g., the spreading control code in fig. 5) containing 4 bits of effective data amount indication and 4 bits of check information, the 4 bits of effective data amount indicating the number of bytes carrying service data of the remaining 15 bytes. It should be appreciated that a 4-bit pad number may also be used to indicate the number of bytes carrying pads in the remaining 15 bytes, as the application is not limited.

It should be understood that the number of bits in the second indication information indicating padding or data is merely exemplary and not limiting, i.e. other numbers of bits may be used for indication, and the application is not limited.

In another implementation, when 16 bytes are indicated with a 2-bit control code, the indication may be established as shown in the table of fig. 25. Specifically, when the value of the control code of 2 bits is 01, it means that 16 bytes are all data. When the value of the 2-bit control code is 10, which indicates that 16 bytes are full or partially filled, when the portion identifying 16 bytes is filled, a first byte of the 16 bytes may be further defined as second indication information (e.g., the extended control code C1 in fig. 25) including 4-bit valid data amount indication and 4-bit check information, the 4-bit valid data amount indicating the number of bytes carrying service data among the remaining 15 bytes. It should be appreciated that a 4-bit pad number may also be used to indicate the number of bytes carrying pads in the remaining 15 bytes, as the application is not limited.

In addition, when the effective data amount indicated by the second indication information is 0, the byte used for carrying padding may be defined as other indication information or control information, that is, the other indication information or control information is transferred by using the byte used for padding, for example, the second byte in the 2-16 bytes may be defined to indicate the type of the time slot where the 16 bytes are located, for example, the time slot is an added time slot or a deleted time slot. Or an indication field for indicating whether the slot in which the 16 bytes are located is a transmission slot or a reception slot may also be defined. Or an indication field defining an identification for indicating a data frame corresponding to the slot in which the 16 bytes are located. Alternatively, a field for indicating the identity of the slot in which the 16 bytes are located may also be defined. In addition, an indication field corresponding to the transmission error of the indication field can be added on the basis of the defined indication field to carry error correction indication information for correcting the transmission error of the defined indication field.

It should be noted that fig. 25 is only an example, and the present application is not limited to the positions of the bytes occupied by the respective indication fields, for example, more bits are used to indicate the objects carried by 16 bytes. When the indicated bit number is greater than 2 bits, error correction protection can be performed on the indication information of 2 bits.

Further, specific values of 2 bits may be 01 and 10, or 00 and 11, to maintain a hamming distance between the two values of 2. The adoption of single bit indication can save the cost, thereby improving the efficiency of data transmission.

In another implementation, for example, when the number of service data and padding is the same, when the number of the corresponding 15-byte objects is only data and padding, the value of the spreading control code in the code table shown in fig. 5 is the same when the independent 1-byte is used to indicate that the corresponding 15-byte objects are only data and padding. Of course, in this special case, preset information may also be used to indicate that the number of padding and service data carried by the X bytes is equal, so as to simplify the code table.

It should be noted that, the independent 1 byte may also use HAMMING Code (HAMMING Code) HAMMING (8, 4) Code to perform error correction protection on the 4 independently indicated bits, or may use CRC Code to perform error detection.

Further, as shown in fig. 6, when the OPU payload area is time-slotted according to the 65-byte time-slot block shown in fig. 4 described above, column 15 and column 16 overheads (two bytes) of the first row in the OTN frame structure may be employed to indicate the start position of the time-slot block period.

In one implementation, the division of the slot blocks may be performed in a row, and then may be divided into 58 slot blocks, and for less than 65 bytes remaining in a frame, the remaining bytes may be used for bearer padding. At this time, one OTN frame can be divided into 232 slot blocks as shown in fig. 4, and 8 bits in 15 columns and 16 columns in a row can be used to indicate the start position of each slot block period.

Fig. 7 is a schematic diagram of a structure of a 129 byte slot block according to an embodiment of the present application. The corresponding OTN data frame structure is a data frame structure of a 129 byte slot block. As shown in fig. 7, the structure of the 129-byte slot block is defined as being composed of 1 byte and 4 32 bytes separately. Wherein 4 bits contained in the separate 1 byte are used to independently indicate that the object carried in each 32 bytes includes at least one of data or padding.

In one implementation, the separate 1 byte may still be error correction protected with a HAMMING (8, 4) code for 4 separately indicated bits, or may be error detected with a CRC code, as described with reference to fig. 4.

Of course, when the timeslots of the OTN frame are divided according to 129 bytes shown in fig. 7, the starting position of each timeslot may still adopt the method shown in fig. 6, which is not described herein again.

When the slot block division manner as shown in fig. 7 is adopted, a codebook composed of a 1-bit control code and a 4-bit spread control code for indicating that an object carried in each 32 bytes includes at least one of data or padding may be as shown in fig. 8. At this time, since all data byte combinations cannot be directly indicated using one byte spreading code, the number of bytes carrying service data is indirectly indicated using a 1-bit spreading code. That is, by defining the minimum value of the effective data in the 32-byte slot, the use of a 1-bit spreading code indicates only the increased amount of the minimum value of the relative effective data.

Fig. 9 and fig. 10 are schematic diagrams of structures of 82 byte slot blocks and 162 byte slot blocks, respectively, according to embodiments of the present application. Wherein fig. 9 adopts an 8-byte interleaved mode, and fig. 10 adopts a 16-byte interleaved mode. Specifically, for the slot block composed of 82 bytes as shown in fig. 9 and the slot block composed of 162 bytes as shown in fig. 10, 10 bits are used to indicate the object carried every 8 bytes or the object carried every 16 bytes, respectively, and 2 bits may be used to detect errors or correct transmission errors of 10 bits for indication.

Fig. 11 is a schematic diagram of a 97 byte slot block according to an embodiment of the present application. When the OTN frame is divided using the slot blocks as shown in fig. 11, the slot of the corresponding OTN data frame is 24 bytes. The frame structure of an OTN frame may be divided into a plurality of slot blocks as shown in fig. 11. Wherein 4 bits contained in 1 byte are adopted in the time slot block to independently indicate that the object carried in each 24 bytes is data or padding.

Likewise, hamming (8, 4) may be employed to error correction protect the 4 independently indicated bits.

When the timeslots of the OTN frame are divided by 97 bytes as shown in fig. 11, the starting position of each timeslot can still take the method shown in fig. 6, and will not be described again here.

It should be appreciated that for the blocks of slots shown in fig. 9-11 described above, there is still a code table similar to that shown in fig. 5 or 11.

In order to meet the requirements of some high-capacity scenarios, for example, 100M slot granularity and T-level capacity, the embodiment of the present application further provides an OTN data frame structure schematic of a 3 x 65 byte slot block as shown in fig. 12. In fig. 12, three adjacent 65 bytes constitute a new slot block structure. The time slot of the OTN frame is 3×4×16, and the structure is shown in fig. 13. In fig. 13, 192 bytes are used to carry data or padding, 12 bits out of 3 are used to indicate the objects carried every 16 bytes.

In a possible implementation manner, the 12-bit indication method is the same as the 65-byte slot block indication method shown in fig. 4, that is, each bit is used to individually indicate an object carried by 16 bytes, and the process of the indication may refer to the related description in fig. 5, which is not repeated herein.

In another implementation, the 12-bit values remain the same, indicating that 192 bytes carry the same object.

In fig. 12, adjacent first time slot blocks are defined as larger bit width time slots, and in another implementation, the combination of fixed interval first time slot blocks into one larger bit width time slot may also be used, as shown in fig. 14. In fig. 14, 120 16 bytes may be divided in the OPU0 area of ODU0, and assuming that the bandwidth corresponding to each 16-byte slot is 10M, the first slot block of 65 bytes will constitute a bandwidth slot of 40M, at which time 3 65 bytes separated by 40 may be logically defined as one 120M bandwidth slot.

Note that, in fig. 12 and 14, only three 65-byte slot blocks are selected to define a large-bit wide slot, and for the division of 129-byte slot blocks shown in fig. 7, 82-byte slot blocks shown in fig. 9, 162-byte slot blocks shown in fig. 10, 97-byte slot blocks shown in fig. 11, and other slot blocks listed in the bits of the present application, all of the large-bit wide slots defined by adjacent Y first slot block bundles as shown in fig. 12 may be used, or the large-bit wide slots defined by Z slot block bundles at fixed intervals as shown in fig. 14 may be used.

It should be understood that when the large-bit wide-slot granularity is obtained by using the adjacent Y first slot block bundling definitions as shown in fig. 12, only one slot exists in the corresponding OTN frame, and the number of bytes of the slot is y×n×x bytes. When the large-bit wide-slot granularity is obtained by adopting the binding definition of the adjacent Y first time slot blocks in the mode shown in fig. 14, multiple time slots, such as time slots with the byte number of Z X bytes or time slots with the byte number of X X bytes, can exist in the corresponding OTN frame, so that the corresponding OTN frame can support not only the large-bit wide time slot and the large-capacity bandwidth, but also the small-bit wide and fine-granularity bandwidth, thereby meeting different application scenes.

In order to improve the verification capability of the OTN frame and meet the requirements of certain overhead on transmission time and statistical accuracy, the embodiment of the application also provides an OTN frame structure. For simplicity of explanation, the present application will be described with ODUnew as the OTN frame. It should be noted that this name is only an example, and does not limit the frame structure defined by the present application. The ODUnew may be a structure of 2 rows by 3824 columns of bytes or a structure of 4 rows by 3824 columns of bytes, for example. In the embodiment of the present application, an ODUnew frame with a byte structure of 4 rows by 3824 columns is taken as an example for illustration.

Fig. 15 is a schematic diagram with an added mapping hierarchy of ODUnew frames. Specifically, as shown in fig. 15, the service data is mapped to ODUnew and then mapped to ODUflex by ODUnew, where ODUflex may be the OTN frame divided according to any one of the time slot blocks in fig. 4, fig. 6, fig. 7, fig. 9 to fig. 11, fig. 12, or fig. 13, and other OTN frames that meet the requirement of time slot block division and are not described in detail in the embodiment of the present application.

Fig. 16 is a schematic frame structure of a first ODUnew according to an embodiment of the present application. As shown, the ODUnew frame is a 4-row 3824-column byte structure, including an overhead area (the first 16 columns of 4 rows) and a payload area (the 17 th to 3824 th columns of 4 rows), each row of the payload area including two bearer units. Specifically, each bearer unit may correspond to at least one parity overhead, and the parity overhead area is used to perform bit interleaved parity check on the corresponding bearer unit.

In the embodiment of the present application, the bearer unit is represented as at least one area divided for the first data frame, which may also be referred to as an area (area), a section, a block, a short frame, or the like, which is not limited by the present application. Wherein the check overhead may be BIP-X, such as BIP-8. The application is not limited.

In one implementation, as shown in fig. 17, a bearer unit may be divided into an overhead area and a payload area, and the overhead area of the bearer unit includes at least one check overhead. Specifically, the overhead area of the bearer unit includes 8 bytes (17 to 24 columns), and the payload area is 25 to 1920 columns. Wherein 8 bytes of the overhead area of the bearer unit may be defined as shown in fig. 18. Specifically, it includes 8-bit TCM2 BIP8 overhead, 4-bit TCM2 BEI overhead, 8-bit TCM1BIP8 overhead, 4-bit TCM1 BEI overhead, 8-bit PM BIP8 overhead, 4-bit PM BEI overhead, 8-bit APS overhead, and 20-bit mapping overhead.

In general, there is no correspondence between the overhead area and the payload area of a certain bearer unit, and the overhead area of a certain bearer unit is used to verify the object carried by the payload area in the bearer unit transmitted before the overhead area.

It should be appreciated that, compared to the conventional OTN frame structure, the overhead area of the low speed pipe, i.e., the overhead area of the bearer unit, is defined in the payload area of the OTN frame with the overall OTN frame structure unchanged, and the requirements of transmission time and statistical accuracy, such as APS, BIP8 and mapping overhead, are raised by the overhead area of the bearer unit.

Under the design of the bearer unit as shown in fig. 17, the overhead area of the ODUnew frame shown in fig. 16 may multiplex part of the overhead of ODUflex in the current relevant standard, such as the overhead definitions of FAS/MFAS, PM, TCM1, TCM2, PM & TCM, GCC1, GCC2, etc., while increasing the nanosecond delay measurement (delay measurement, DM) overhead, as shown in fig. 19.

It should be noted that, in the embodiment of the present application, the DM overhead is a delay measurement overhead with higher accuracy, and the DM overhead may include a correction amount, where the correction amount is used to indicate a time for the receiving end to receive a data frame sent by the sending end and process the data frame. In other words, the correction amount is a period of time after the receiving end receives the data frame transmitted from the transmitting end and before the sending end transmits the replied data frame. Based on the DM overhead, the time delay measurement of the data frame can reach nanosecond measurement, the result is more accurate, and the error of the time delay measurement is corrected.

In another implementation, when the overhead area of the bearer unit includes only mapping overhead or the payload area of the bearer unit is only an ODUnew frame and is only used to carry service data, the overhead area of the ODUnew frame shown in fig. 16 may multiplex part of overhead of ODUflex in the current relevant standard, such as overhead definitions of FAS/MFAS, PM, PM & TCM, GCC1, GCC2, and the like, while increasing nanosecond DM overhead, and increasing TCM2 TTI, TCM1 TTI, and PM TTI overhead in the last row, and remaining overhead remains, as shown in fig. 20. Specifically, TCM1 of 2 bytes, TCM2 of 2 bytes, and PM overhead of 2 bytes are set in each row, and correspond to the current row. Wherein the 2-byte PM overhead includes 8-bit BIP8 (for checking the object carried in the 15-column-to-3824 interval of the last row), 4-bit BEI/BIAE, 1-bit BDI, and 3-bit STAT information.

Fig. 21 is a schematic frame structure of a second ODUnew according to an embodiment of the present application. As shown, the ODUnew frame is a 4 row 3824 column byte structure, including an overhead area (the first 4 rows and 16 columns) and a payload area (the 4 rows and 3824 columns), each row of which includes one bearer element. Specifically, the carrying unit of the second ODUnew frame may be defined as a structure as shown in fig. 17, and incorporate the overhead area of the ODUnew frame shown in fig. 19. Or the carrying unit of the second ODUnew frame may be defined as that the overhead area only includes mapping overhead or that the carrying unit is only the payload area of the ODUnew frame, and in combination with the overhead area of the ODUnew frame shown in fig. 20, details are not repeated here.

Note that, for the 2-row×3824-column byte structure ODUnew frame, reference may be made to the above-mentioned method for dividing the bearer unit in fig. 17 or fig. 19, and an example of overhead of the bearer unit. The overhead included in the overhead area of the 2-row-3824-column byte structure ODUnew frame may be the same as the overhead included in the overhead area of the 4-row-3824-column byte structure ODUnew frame, or less than the overhead included in the overhead area of the 4-row-3824-column byte structure ODUnew frame. Fig. 22 is a flow chart of a method for transmitting data according to the present application. As shown in fig. 22, where the transmitting-end device may be an OTN device or may be performed by a component (e.g., a chip or a chip system, etc.) of the OTN device. The receiving end device may be an OTN device or may be implemented by a component of the OTN device (e.g., a chip or a system-on-chip, etc.). Specifically, the method includes the following steps.

S2201, the transmitting device maps the service data to a data frame, where the data frame includes K slot blocks, where each slot block of the K slot blocks includes M bits and n×x bytes, M1 bits of the M bits are used to carry N first indication information, and each first indication information of the N first indication information is used to indicate that an object carried by each X byte of the n×x bytes includes at least one of service data or padding. K is an integer greater than or equal to 1, N is an integer greater than or equal to 1, X is an integer greater than 1, M is an integer greater than or equal to N, and M1 is less than M.

Specifically, the transmitting-end device maps the service data to OTN frames divided according to any one of the slot blocks of fig. 4, 6, 7, 9 to 11, 12, or 13 as described above.

S2202, the transmitting end device transmits the data frame to the receiving end device.

S2203, the receiving terminal equipment receives the data frame and demaps the service data from the data frame according to the N pieces of first indication information.

Fig. 23 is a flow chart of a method for transmitting data according to the present application. As shown in fig. 23, where the transmitting-end device may be an OTN device or may be performed by a component (e.g., a chip or a chip system, etc.) of the OTN device. The receiving end device may be an OTN device or may be implemented by a component of the OTN device (e.g., a chip or a system-on-chip, etc.). Specifically, the method includes the following steps.

The method comprises the steps that S2301, a sending end device maps service data to a first data frame, a payload area of the first data frame is used for bearing the service data, the payload area of the first data frame comprises at least one bearing unit, each bearing unit in the at least one bearing unit corresponds to at least one check overhead, each check overhead in the at least one check overhead is used for carrying out bit interleaving parity check on the corresponding bearing unit, and the bit rate of the first data frame is smaller than 1.25Gbit/S.

Specifically, the transmitting device maps the service data into any OTN frame as in fig. 16 or fig. 21.

S2302, the transmitting device maps the first data frame into the second data frame.

Specifically, the transmitting device maps the first data frame to the OTN frame divided according to any one of the time slot blocks in fig. 4, 6, 7, 9 to 11, 12, or 13.

S2303, the transmitting device transmits the second data frame to the receiving device.

The receiving end device receives the second data frame and demaps the first data frame from the second data frame S2304.

S2305, the receiving device demaps the service data from the first data frame.

It should be understood that the specific examples illustrated in fig. 4-21 in the embodiments of the present application are only for the purpose of helping those skilled in the art to better understand the embodiments of the present application, and are not intended to limit the scope of the embodiments of the present application. It should be further understood that the sequence numbers of the above processes do not mean the order of execution, and the order of execution of the processes should be determined by the functions and internal logic of the processes, and should not be construed as limiting the implementation process of the embodiments of the present application.

It is also to be understood that in the various embodiments of the application, where no special description or logic conflict exists, the terms and/or descriptions between the various embodiments are consistent and may reference each other, and features of the various embodiments may be combined to form new embodiments in accordance with their inherent logic relationships.

It should also be understood that in some of the above embodiments, the devices in the existing network architecture are mainly used as examples for the explanation (such as OTN devices), and it should be understood that the embodiments of the present application are not limited to the specific form of the devices. For example, devices that can achieve the same functions in the future are applicable to the embodiments of the present application.

The structures of the two data frames provided by the embodiments of the present application are described in detail above with reference to fig. 4 to 21 and fig. 25 to 27, and the method for transmitting service data provided by the embodiments of the present application is described with reference to fig. 22 and 23.

The following describes in detail the communication device provided in the embodiment of the present application with reference to fig. 24. It should be understood that the descriptions of the apparatus embodiments and the descriptions of the method embodiments correspond to each other, and thus, descriptions of details not shown may be referred to the above method embodiments, and for the sake of brevity, some parts of the descriptions are omitted.

The embodiment of the application can divide the function modules of the sending end device or the receiving end device according to the method example, for example, each function module can be divided corresponding to each function, and two or more functions can be integrated in one processing module. The integrated modules may be implemented in hardware or in software functional modules. It should be noted that, in the embodiment of the present application, the division of the modules is schematic, which is merely a logic function division, and other division manners may be implemented in actual implementation. The following description will take an example of dividing each functional module into corresponding functions.

Fig. 24 is a schematic diagram of one possible network device configuration. As shown in fig. 24, network device 2400 includes a processor 2401, an optical transceiver 2402, and a memory 2403. Wherein memory 1603 is optional. The network device 2400 may be applied to both a transmitting side device (e.g., the network device 2400 may be the transmitting side device described above) and a receiving side device (e.g., the network device 2400 may be the receiving side device described above).

When applied to a transmitting-side device, the processor 2401 and the optical transceiver 2402 are used to implement a method performed by the transmitting-side device shown in fig. 22 or fig. 23. In implementation, each step of the process flow may implement the method performed by the transmitting device of the above figures through instructions in the form of integrated logic circuits of hardware or software in the processor 2401. The optical transceiver 2402 is configured to receive and process the transmitted OTN frame for transmission to a peer device (also referred to as a receiving-end device).

When applied to a receiving-side device, the processor 2401 and the optical transceiver 2402 are used to implement the method performed by the receiving-side device shown in fig. 22 or 23. In implementation, each step of the processing flow may complete the method performed by the receiving-side apparatus described in the foregoing figures through an integrated logic circuit of hardware in the processor 2401 or an instruction in a software form. The optical transceiver 2402 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 2401 for further processing.

Memory 2403 may be used to store instructions such that process 2401 may be used to perform steps as mentioned in the above figures. Alternatively, the storage 2403 may be used to store other instructions to configure parameters of the processor 2401 to implement corresponding functions.

It should be noted that, in the hardware configuration diagram of the network device shown in fig. 2, the processor 2401 and the memory 2403 may be located in a tributary board, or may be located in a board where the tributaries and the lines are combined. Alternatively, processor 2401 and memory 2403 each include a plurality of boards located on the bypass board and the circuit board, respectively, which cooperate to perform the method steps described above.

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

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 includes a processor for implementing the functions involved in any one or more of the embodiments described above, such as acquiring or processing OTN 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.

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 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 also intended to include such modifications and variations.

It should be appreciated that the processors referred to in embodiments of the present application may be central processing units (central processing unit, CPU), but may also be other general purpose processors, digital signal processors (digital signal processor, DSP), application specific integrated circuits (application specific integrated circuit, ASIC), off-the-shelf programmable gate arrays (field programmable gate array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.

It should also be understood that the memory referred to in embodiments of the present application may be volatile memory and/or nonvolatile memory. The nonvolatile memory may be a read-only memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an electrically Erasable EPROM (EEPROM), or a flash memory. The volatile memory may be random access memory (random access memory, RAM). For example, RAM may be used as an external cache. By way of example, and not limitation, RAM may include the following forms: static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (ESDRAM), synchronous DRAM (SLDRAM), and direct memory bus RAM (DR RAM).

It should be noted that when the processor is a general purpose processor, DSP, ASIC, FPGA or other programmable logic device, discrete gate or transistor logic device, discrete hardware components, the memory (storage module) may be integrated into the processor.

Those of ordinary skill in the art will appreciate that the elements and steps of the examples described in connection with the embodiments disclosed herein can be implemented as electronic hardware, or as a combination of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

In the several embodiments provided by the present application, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Furthermore, the coupling or direct coupling or communication connection shown or discussed with each other may be through some interface, device or unit indirect coupling or communication connection, which may be in electrical, mechanical or other form.

The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to realize the scheme provided by the application.

In addition, each functional unit in each embodiment of the present application may be integrated in one unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.

In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, produces a flow or function in accordance with embodiments of the present application, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus. For example, the computer may be a personal computer, a server, or a network device, etc. The computer instructions may be stored in or transmitted from one computer-readable storage medium to another, for example, by wired (e.g., coaxial cable, optical fiber, digital Subscriber Line (DSL)), or wireless (e.g., infrared, wireless, microwave, etc.). The computer readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that contains an integration of one or more available media. For example, the aforementioned usable medium may include, but is not limited to, a U disk, a removable hard disk, a read-only memory (ROM), a random access memory (random access memory, RAM), a magnetic disk or an optical disk, etc. various media that can store program codes.

The foregoing is merely illustrative of the present application, and the present application is not limited thereto, and any person skilled in the art will readily recognize that variations or substitutions are within the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

1. A method of transmitting data, comprising:

mapping service data into a data frame, wherein the data frame comprises K time slot blocks, each time slot block of the K time slot blocks comprises M bits and N X bytes, M1 bits in the M bits are used for bearing N pieces of first indication information, each piece of first indication information in the N pieces of first indication information is used for respectively indicating that each object borne by X bytes of N X bytes comprises at least one of service data or padding, K is an integer greater than or equal to 1, N is an integer greater than or equal to 1, X is an integer greater than or equal to 1, M is an integer greater than or equal to N, and M1 is less than M;

and transmitting the data frame.

2. The method of claim 1, wherein the first indication information indicates that the X-byte carried object further includes second indication information, the second indication information being located in a specific byte among the X bytes, the second indication information being used to indicate the number of bytes used to carry the service data among (X-1) bytes other than the specific byte.

3. The method of claim 2, wherein bits of the specific byte other than the bits occupied by the second indication information are used to correct transmission errors of the second indication information.

4. A method according to any one of claims 1 to 3, wherein each X bytes of said N X bytes is a time slot of said data frame.

5. A method according to any one of claims 1 to 3, wherein Y X bytes in Y adjacent blocks of said slots are one slot of said data frame, said Y being an integer greater than or equal to 1.

6. A method according to any one of claims 1 to 3, wherein Z X bytes in the block of time slots of Z equal intervals are one time slot of the data frame, and Z is an integer greater than or equal to 1.

7. The method according to any one of claims 1 to 6, wherein M2 of the M bits are used for detecting errors or correcting transmission errors of the N first indication information, wherein M2 is smaller than M.

8. The method according to any one of claims 1 to 7, wherein the data frame further comprises position indication information for indicating a start position of a slot cycle.

9. The method of claim 8, wherein the number of bytes of the location indication information is 1 or 2.

10. The method according to any one of claims 1 to 9, wherein X has a value of one of 8, 16, 24 and 32.

11. The method according to any one of claims 1 to 10, wherein M has a value of a multiple of 8.

12. A method of transmitting data, comprising:

mapping service data into a first data frame, wherein a payload area of the first data frame is used for bearing the service data, the payload area of the first data frame comprises at least one bearing unit, each bearing unit in the at least one bearing unit corresponds to at least one check overhead, each check overhead in the at least one check overhead is used for carrying out bit interleaving parity check on the corresponding bearing unit, and the bit rate of the first data frame is less than 1.25Gbit/s;

mapping the first data frame into one or more slots of a second data frame;

and sending the second data frame.

13. The method of claim 12, wherein the step of determining the position of the probe is performed,

the at least one check overhead is located in an overhead area of the first data frame, and the at least one bearing unit is used for bearing the service data.

14. The method of claim 12, wherein the bearer unit comprises an overhead region and a payload region, and wherein the at least one check overhead is located in the overhead region of the bearer unit.

15. The method of claim 14, wherein the overhead area of the bearer unit further comprises at least one of protection switching overhead or mapping overhead.

16. The method according to any of claims 12 to 15, wherein the check overhead is 8-bit interleaved parity BIP-8.

17. The method of any of claims 12 to 16, wherein the overhead area of the first data frame comprises a Path Monitoring (PM) overhead, a tandem connection monitoring 1 (TCM 1) overhead, a tandem connection monitoring 2 (TCM 2) overhead, and a latency measurement overhead.

18. The method according to any of claims 12 to 17, wherein the frame structure of the first data frame is 4 rows by 3824 columns of bytes or 2 rows by 3824 columns of bytes.

19. A method of transmitting data, comprising:

receiving a data frame, wherein the data frame comprises K time slot blocks, each time slot block of the K time slot blocks comprises M bits and N X bytes, M1 bits of the M bits are used for bearing N pieces of first indication information, each piece of first indication information in the N pieces of first indication information is used for respectively indicating that an object borne by each X byte of the N X bytes comprises at least one of service data or padding, K is an integer greater than or equal to 1, N is an integer greater than or equal to 1, X is an integer greater than 1, M is an integer greater than or equal to N, and M1 is less than M;

And according to the N pieces of first indication information, the service data are demapped from the data frame.

20. The method of claim 19, wherein the first indication information indicates that the X-byte carried object further includes second indication information, the second indication information being located in a specific byte of the X-bytes, the second indication information being used to indicate the number of bytes used to carry the service data in (X-1) bytes other than the specific byte.

21. The method of claim 20, wherein bits of the specific byte other than the bits occupied by the second indication information are used to correct transmission errors of the second indication information.

22. The method according to any of claims 19 to 21, wherein each X bytes of said N X bytes is a time slot of said data frame.

23. The method according to any of claims 19 to 21, wherein Y X bytes in Y adjacent blocks of slots are one slot of the data frame, and Y is an integer greater than or equal to 1.

24. The method according to any of claims 19 to 21, wherein Z X bytes in the block of time slots of Z equal intervals are one time slot of the data frame, and Z is an integer greater than or equal to 1.

25. The method according to any of claims 19 to 24, wherein M2 of the M bits are used for detecting errors or correcting transmission errors of the N bits, wherein M2 is smaller than M.

26. The method according to any one of claims 19 to 25, wherein the data frame further comprises position indication information for indicating a start position of a slot cycle.

27. The method of claim 26, wherein the number of bytes of the location indication information is 1 or 2.

28. The method of any one of claims 19 to 27, wherein X has a value of one of 8, 16, 24, 32.

29. The method according to any one of claims 19 to 28, wherein M has a value of a multiple of 8.

30. A method of transmitting data, comprising:

receiving a first data frame, the first data frame comprising one or more time slots;

demapping a second data frame from the first data frame, wherein a payload area of the second data frame is used for bearing service data, the payload area of the second data frame comprises at least one bearing unit, each bearing unit in the at least one bearing unit corresponds to at least one check overhead, each check overhead in the at least one check overhead is used for carrying out bit interleaving parity check on the corresponding bearing unit, and the bit rate of the first data frame is less than 1.25Gbit/s;

And demapping the service data from the second data frame.

31. The method of claim 30, wherein the step of determining the position of the probe is performed,

32. The method of claim 30, wherein the bearer unit comprises an overhead region and a payload region, and wherein the at least one parity overhead is located in the overhead region of the bearer unit.

33. The method of claim 32, wherein the overhead area of the bearer unit further comprises at least one of protection switching overhead or mapping overhead.

34. The method according to any one of claims 30 to 33, wherein the check overhead is X-bit interleaved parity BIP-8.

35. The method of any of claims 30 to 34, wherein the overhead area of the first data frame comprises a Path Monitoring (PM) overhead, a tandem connection monitoring 1 (TCM 1) overhead, a tandem connection monitoring 2 (TCM 2) overhead, and a latency measurement overhead.

36. The method according to any one of claims 30 to 35, wherein the frame structure of the first data frame is 4 rows by 3824 columns of bytes or 2 rows by 3824 columns of bytes.

37. A method of transmitting data, comprising:

mapping service data into a data frame, wherein the data frame comprises K time slot blocks, each time slot block of the K time slot blocks comprises M bits and N X bytes, the M bits are used for bearing N pieces of first indication information, each piece of first indication information in the N pieces of first indication information is used for respectively indicating that each object borne by X bytes of N X bytes comprises at least one of service data or padding, K is an integer greater than or equal to 1, N is an integer greater than or equal to 1, X is an integer greater than 1, and M is an integer greater than or equal to N;

and transmitting the data frame.

38. The method of claim 37, wherein N is equal to 1.

39. The method according to claim 37 or 38, wherein the first indication information indicates that the object carried by X bytes further includes second indication information, the second indication information being located in a specific byte of the X bytes, the second indication information being used to indicate the number of bytes used to carry the service data in (X-1) bytes other than the specific byte.

40. The method according to any one of claims 37 to 39, wherein each X bytes of said N X bytes is a time slot of said data frame.

41. The method according to any one of claims 37 to 39, wherein Y X bytes in Y adjacent blocks of said slots are one slot of said data frame, said Y being an integer greater than or equal to 1.

42. The method according to any one of claims 37 to 39, wherein Z X bytes in the block of time slots of Z equal intervals are one time slot of the data frame, and Z is an integer greater than or equal to 1.

43. The method of any one of claims 37 to 42, wherein X has a value of one of 8, 16, 24 and 32.

44. The method of any one of claims 37 to 43, wherein M has a multiple of 2.

45. The method of any one of claims 37 to 43, wherein the M bits are divided into N groups, each of the N groups including bits for carrying one of the N first indication information.

46. The method of any one of claims 37 to 42, wherein M has a value of 2, x has a value of 16, and n has a value of 1.

47. An apparatus for transmitting data, comprising: module for performing the method according to any one of claims 1 to 11, or for performing the method according to any one of claims 12 to 18, or for performing the method according to any one of claims 19 to 29, or for performing the method according to any one of claims 30 to 36, or for performing the method according to any one of claims 37 to 46.

48. A chip comprising a processor and a communication interface for receiving and transmitting data frames to the processor or for sending data frames to other communication devices than the communication device comprising the chip, the processor for performing the method of any one of claims 1 to 11 or the method of any one of claims 12 to 18 or the method of any one of claims 19 to 29 or the method of any one of claims 30 to 36 or the method of any one of claims 37 to 46.