Bearing method, and communication node and storage medium
By using a fine-grained frame structure and fg-BU sequences, the FlexE protocol divides the FlexE time slot into 480 sub-time slots, supporting flexible adjustments to various time slot sizes. This solves the problem that the FlexE protocol is unable to support customer services smaller than 5G, achieving efficient transmission and reduced latency.
Patent Information
- Application Number
- PCT/CN2024/083893
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2023-05-18
- Filing Date
- 2024-03-26
- Publication Date
- 2024-11-21
AI Technical Summary
The existing FlexE protocol is difficult to effectively carry customer services with speeds lower than 5G, especially when the number of time slots is limited and the single time slot bandwidth granularity is too large, it cannot meet the transmission needs of high-volume and low-speed customer services.
A fine-grained frame structure is adopted, dividing the FlexE time slot into 480 sub-time slots, each with a bandwidth of 10M. Customer services are carried through fine-grained basic unit (fg-BU) sequences, and flexible adjustment of various time slot sizes is supported in the carrying frame, including sub-time slot sizes of 1, 2, 4, and 8 code blocks. Different customer code block sizes are adapted through mapping and multiframe transmission.
It enables efficient transmission of customer services of 10M and above without increasing costs, reduces latency, adapts to different customer service needs, and supports flexible carrying of various time slot sizes.
Smart Images

Figure CN2024083893_21112024_PF_FP_ABST
Abstract
Description
Carrying method, communication node and storage medium Technical Field
[0001] The present application relates to the field of communication technology, for example, to a bearing method, a communication node and a storage medium. Background Art
[0002] The Flexible Ethernet (FlexE) protocol standard technical specification defines a method for delivering customer services at speeds of n (n is a positive integer) * 5G (in bits per second). FlexE physical interfaces can efficiently carry customer services at speeds above 5G.
[0003] To address the need to carry customer services at speeds slower than 5G, a fine-grained frame structure has emerged. In this fine-grained frame structure, sub-slot sizes can be 2, 4, or 8 blocks. Therefore, how to deliver customer services with different slot sizes is an urgent issue.
[0004] Summary of the Invention
[0005] The present application provides a carrying method, a communication node and a storage medium.
[0006] In a first aspect, an embodiment of the present application provides a transmission method, including:
[0007] Determining a frame structure of a bearer frame, the bearer frame including multiple code blocks, the bearer frame including multiple time slots, the time slots supporting multiple time slot sizes, and using one time slot size in the determined frame structure;
[0008] determining a frame structure of a multiframe including the bearer frame;
[0009] Mapping target data to the bearer frame in the multiframe for transmission.
[0010] In a second aspect, an embodiment of the present application provides a transmission method, including:
[0011] Acquire target data carried in a time slot of a bearer frame according to a first time slot size, the bearer frame including multiple code blocks, the bearer frame including multiple time slots, and the time slots supporting multiple time slot sizes;
[0012] The target data is carried in a multiframe and transmitted according to a second time slot size, and the first time slot size is not equal to the second time slot size.
[0013] In a third aspect, an embodiment of the present application provides a communication node, including:
[0014] one or more processors;
[0015] a storage device for storing one or more programs;
[0016] When the one or more programs are executed by the one or more processors, the one or more processors implement the method provided in the embodiments of the present application.
[0017] In a fourth aspect, an embodiment of the present application provides a storage medium, wherein the storage medium stores a computer program, and when the computer program is executed by a processor, the method described in the present application is implemented. BRIEF DESCRIPTION OF THE DRAWINGS
[0018] FIG1a is a schematic diagram of a scenario of an optical module combination provided in an embodiment of the present application;
[0019] Figure 1b is a schematic diagram of the 64 / 66 encoding rule of the 802.3 protocol;
[0020] FIG1c is a schematic diagram of inserting an overhead block into data according to an embodiment of the present application;
[0021] FIG1d is a schematic diagram of an fg-BU frame structure provided in an embodiment of the present application;
[0022] FIG1e is a schematic diagram of a load-bearing principle provided by an embodiment of the present application;
[0023] FIG1f is a schematic diagram of compressing customer services and then carrying them according to an embodiment of the present application;
[0024] FIG1g is a schematic diagram of carrying data in a size of 2 code blocks provided in an embodiment of the present application;
[0025] Figure 1h is a bearer frame structure provided by an embodiment of the present application;
[0026] FIG2 is a schematic diagram of a flow chart of a transmission method provided in an embodiment of the present application;
[0027] FIG3 is a schematic diagram of a flow chart of another transmission method provided in an embodiment of the present application;
[0028] FIG4a is a schematic diagram of a multiframe structure in which each time slot carries two client code blocks according to an embodiment of the present application;
[0029] FIG4 b is a schematic diagram of a structure in which each time slot carries four client code block multiframes according to an embodiment of the present application;
[0030] FIG4c is a bearer frame structure provided in an embodiment of the present application;
[0031] FIG4 d is a schematic diagram of the structure of a multiframe in which each time slot carries two client code blocks, provided by an embodiment of the present application;
[0032] FIG4e is a schematic diagram of the structure of a multiframe in which each time slot carries four client code blocks, provided by an embodiment of the present application;
[0033] FIG4f is a schematic diagram of a bearer frame structure of a multiframe in which each time slot carries 8 client code blocks, provided by an embodiment of the present application;
[0034] FIG4g is a schematic diagram of the structure of a bearer frame provided in an embodiment of the present application;
[0035] FIG4h is a schematic diagram of the structure of a multiframe in which each time slot carries two client code blocks, provided by an embodiment of the present application;
[0036] FIG4i is a schematic diagram of the structure of a multiframe in which each time slot carries four client code blocks, provided by an embodiment of the present application;
[0037] FIG4j is a schematic diagram of the structure of a multiframe in which each time slot carries 8 client code blocks, provided by an embodiment of the present application;
[0038] FIG4k is a schematic diagram of the structure of a bearer frame provided in an embodiment of the present application;
[0039] FIG41 is a schematic diagram of the structure of a multiframe in which each time slot carries two client code blocks, provided by an embodiment of the present application;
[0040] FIG4m is a schematic diagram of the structure of a multiframe in which each time slot carries four client code blocks, provided by an embodiment of the present application;
[0041] FIG4n is a schematic diagram of the structure of a multiframe in which each time slot carries 8 client code blocks, provided by an embodiment of the present application;
[0042] FIG4o is a schematic diagram of the structure of a bearer frame provided in an embodiment of the present application;
[0043] FIG4p is a schematic diagram of the structure of a multiframe in which each time slot carries two client code blocks, provided by an embodiment of the present application;
[0044] FIG4q is a schematic diagram of the structure of a multiframe in which each time slot carries four client code blocks, provided by an embodiment of the present application;
[0045] FIG4r is a schematic diagram of the structure of a multiframe in which each time slot carries 8 client code blocks, provided by an embodiment of the present application;
[0046] FIG4s is a schematic diagram of a scenario of penetrating different network systems provided by an embodiment of the present application;
[0047] FIG4t is another bearer frame structure provided in an embodiment of the present application;
[0048] Figure 4u is another bearer frame structure provided in an embodiment of the present application;
[0049] [Corrected 15.04.2024 according to Rule 26] FIG4v is a schematic diagram of the structure of a bearer frame for carrying customer services provided in an embodiment of the present application;
[0050] [Corrected 15.04.2024 according to Rule 26] FIG4w is a schematic diagram of the structure of another bearer frame for carrying customer services provided in an embodiment of the present application;
[0051] [Corrected 15.04.2024 according to Rule 26] FIG4x is a schematic diagram of the structure of another bearer frame for carrying customer services provided in an embodiment of the present application;
[0052] [Corrected 15.04.2024 according to Rule 26] FIG4y is a schematic diagram of the structure of another bearer frame for carrying customer services provided in an embodiment of the present application;
[0053] FIG5 is a schematic structural diagram of another bearer frame for carrying customer services provided in an embodiment of the present application;
[0054] FIG6a is a schematic structural diagram of another bearer frame for carrying customer services provided in an embodiment of the present application;
[0055] FIG6 b is another bearer frame structure provided in an embodiment of the present application;
[0056] FIG7 is a schematic structural diagram of a transmission device provided in an embodiment of the present application;
[0057] FIG8 is a schematic structural diagram of another transmission device provided in an embodiment of the present application;
[0058] FIG9 is a schematic structural diagram of a communication node provided in an embodiment of the present application. DETAILED DESCRIPTION
[0059] To make the purpose, technical solutions and advantages of this application more clear, the embodiments of this application will be described in detail below with reference to the accompanying drawings. It should be noted that, unless there is a conflict, the embodiments and features in the embodiments of this application can be combined with each other in any way.
[0060] The steps shown in the flowcharts of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions. Also, although a logical order is shown in the flowcharts, in some cases, the steps shown or described can be performed in an order different from that shown here.
[0061] The fine-grained slicing technology for packet networks introduces a fine-grained frame structure, dividing a 5G-rate FlexE timeslot into 480 subslots. Each subslot has a bandwidth of 10 Mbps and can carry customer services of 10 Mbps or higher. Each subslot in the fine-grained frame structure is sized at 8 code blocks. To reduce latency, subslots are reduced to 2 or 4 code blocks. Therefore, fine-grained frame delivery scenarios with subslot sizes of 2, 4, and 8 code blocks need to be addressed.
[0062] The rapid increase in user network information traffic has prompted the rapid development of communication network information transmission bandwidth. The interface bandwidth speed of communication equipment has increased from 10M (unit: bit / second, the same content below) to 100M, 1G, 10G, and 100G. A large number of commercial 100G optical modules have begun to be used on the market. At present, 400G optical modules have been developed, but the price of 400G optical modules is expensive, exceeding the price of 4 100G optical modules, affecting the value of 400G optical modules. In order to transmit 400G services on 100G optical modules, the FlexE protocol combines multiple 100G optical modules to form a high-speed transmission channel. Figure 1a is a scenario diagram of an optical module combination provided in an embodiment of the present application. As shown in Figure 1a, four 100G optical modules are combined through the FlexE protocol to form a 400G transmission channel, which is equivalent to the transmission speed of one 400G optical module, solving the transmission needs of 400G services without increasing costs. For the physical layer with a rate of 100G, the Ethernet protocol defines that before sending a 100G data message, the data packet message is 64 / 66 encoded, and the 64-bit data block is expanded into a 66-bit information block. The added 2 bits are located in front of the 66-bit block as the start mark of the 66-bit block, and then it is sent out from the optical port in the form of a 66-bit block.
[0063] Figure 1b illustrates the 64 / 66 encoding rule of the 802.3 protocol. Each code block consists of 66 bytes. The first two bits are the synchronization header. A synchronization header bit of "01" indicates a D block (data block). The following 8 bytes (64 bits) contain 8 bytes of data. A synchronization header bit of "11" indicates a control block. The first byte following this indicates the control block type, followed by the next 7 bytes containing the control block's content. The content of these 7 bytes is determined by the control block type. Both S blocks and T blocks are control blocks. The first byte of an S block is 0x78, indicating that the control block is an S block. In addition to indicating the end of a block, a T block can also carry client bytes (located in the last 7 bytes of the block). In the Ethernet standard, there are 8 types of T code blocks: T0, T1, T2, T3, T4, T5, T6, and T7. The T0 code block (the first byte is 0x87) does not carry customer information, the T1 code block (the first byte is 0x99) carries 1 byte of customer information, the T2 code block (the first byte is 0x99) carries 2 bytes of customer information, and so on. The T7 code block (when receiving, the optical port identifies the 66-bit block from the received data stream, and then recovers the original 64-bit data from the 66-bit block) , reassemble the data message. For 100G services, every 20 66-bit data blocks are divided into a data block group, each group contains 20 data blocks, representing 20 time slots, and each time slot represents a service speed of 5G (bit / s) bandwidth. When sending 66-bit data blocks, after each 1023 data block groups (1023*20 data blocks) are sent, a FlexE overhead block is inserted. Figure 1c is a schematic diagram of inserting overhead blocks in data provided by an embodiment of the present application. Figure 1c shows that after each 1023*20 The data block carries the overhead block on a block (corresponding to the slash fill position). After inserting the overhead block, continue to send the data block. After sending the second 1023*20 data blocks, insert the overhead block again, and so on. In this way, in the process of sending data blocks, the overhead block will be inserted periodically. The interval between two adjacent overhead blocks is 1023*20 data blocks. For a physical line speed of 100G (bit / s), the FlexE protocol divides the physical port into 20 time slots, so the bandwidth corresponding to each time slot is 5G. FlexE protocol definition While the number of time slots and bandwidth required to carry high-speed services can meet the requirements, FlexE faces some challenges for high-volume, low-speed customer services: 1. A 100G physical channel has only 20 time slots, which is too few. 2. Each time slot has a 5G bandwidth, but the granularity of a single time slot is too large to carry customer services slower than 5G. In some scenarios, where there are many customer services and the bandwidth per service is relatively small—for example, with a large number of time slots and small granularity of bandwidth per time slot—the FlexE protocol is unsuitable for these applications.In order to solve the need for carrying customer services at speeds lower than 5G, the fine-grained slicing technology of the slicing packet network proposes a fine-grained frame structure to carry and transmit a sequence of fine-grained basic units (fg-BU for short) on the 5G speed time slots of the FlexE protocol. Figure 1d is a schematic diagram of an fg-BU frame structure provided by an embodiment of the present application. Referring to Figure 1d, an fg-BU frame structure is composed of an S block + 195 D blocks + T blocks. There are 24 fg-BU sub-time slots (Slots) in an fg-BU frame. 20 fg-BU frame structures constitute a multi-frame. There are 480 fg-BU sub-time slots in a fine-grained multi-frame. The fine-grained basic unit (fg-BU) includes an overhead part and carries customer information. A 5G bearer pipe is divided into 480 sub-time slots through the fine-grained basic unit. After deducting the overhead part, the bandwidth of each sub-time slot is 10M, which can carry 10M rate customer services and meet the carrying requirements of ordinary Ethernet services (customer services select multiple sub-time slots to carry according to the speed).
[0064] FIG1e is a schematic diagram of a bearing principle provided in an embodiment of the present application. For the bearing principle, see FIG1e .
[0065] In the fine-grained basic unit, the size of each carrying sub-timeslot is 8 code blocks, where each code block consists of 65 bits (each 66-bit code block is compressed to 65 bits, and the compression method is to compress the first 2 synchronization header bits in each code block into 1 synchronization header bit). The size of each sub-timeslot is 8*65=520 bits. Figure 1f is a schematic diagram of a method of carrying customer services after compression, provided by an embodiment of the present application. When the fine-grained sub-timeslot carries 10M customer services, the 10M customer services are first 64 / 66 encoded. After encoding, each 8 66-bit code blocks are grouped and carried on a time slot. Before carrying, each 66-bit code block is compressed to 65 bits (the 2-bit synchronization header bits are compressed to 1 bit) to form 8 65-bit code blocks, which are carried on a sub-timeslot. There are 24 sub-timeslots in an fg-BU frame, and customer services select some sub-timeslots to carry. The fg-BU frames carrying customer services are then mapped into the timeslots of the FlexE protocol and sent out, and are delivered to the remote destination device through the timeslots of the 5G rate of the FlexE protocol.
[0066] The size of each sub-time slot in the above-mentioned fg-BU frame is 8 code blocks (actually compressed code blocks). Figure 1g is a schematic diagram of a method of carrying according to the size of 2 code blocks provided in an embodiment of the present application. Referring to Figure 1g, in actual applications, some scenarios require that customer services be carried according to the size of 2 code blocks. If directly carried in each sub-time slot in the fg-BU frame, 4 groups of 2 code block customer services need to be aggregated and carried on one sub-time slot in the fg-BU frame. This method will require waiting for 4 groups of 2 code blocks to be aggregated into 8 code blocks, increasing the delay time.
[0067] The FlexE standard uses time slots to represent customer bearer locations. To distinguish them, the fg-BU frame divides the customer bearer locations into sub-time slots for comparison. This patent does not involve FlexE time slots, but only considers the bearer frame structure of customer services. In this patent, the position of customer services in the bearer frame is called a time slot (relative to the FlexE time slot, it is actually a sub-time slot) to simplify the name. In actual applications, some scenarios may also require customer services to be carried according to the size of 1 code block, 4 code blocks, 16 code blocks, 32 code blocks, etc. In order to adapt to different customer code block size scenarios, a universal bearer frame structure is constructed. The frame structure still consists of S code blocks, multiple D code blocks and T code blocks. The frame structure (total length of the frame, total number of code blocks, code block position order, main overhead field content, etc.) remains unchanged. Only the three parameters of each time slot size in the frame, the number of time slots in the frame, and the number of frames in the multiframe are changed according to the constraints to achieve different scenario applications. After the frame structure is determined, the size of each time slot in the frame is set to x (which can be expressed in bytes, code blocks, compressed code blocks, or transcoded code blocks), the number of time slots in the frame is y, and a multiframe is composed of z frames. x, y, and z are positive integers, and the product of the two parameters x and y is fixed, as is the product of the two parameters y and z. The product of the two parameters x and y is constant, corresponding to the total amount of client information carried in a frame (which can be expressed in bytes, code blocks, compressed code blocks, or transcoded code blocks). When the frame structure remains unchanged, regardless of how the time slot size and number of time slots in a frame change, the total amount of client information corresponding to all time slots in a frame remains constant, thereby ensuring that the frame length remains unchanged. The product of the two parameters y and z is constant, corresponding to the total number of time slots in a multiframe. Regardless of how the number of time slots in a frame changes, the total number of time slots in a multiframe remains fixed. Figure 1h shows a bearer frame structure provided by an embodiment of the present application. Figure 1h shows that multiframe 1 includes z bearer frames.
[0068] In an exemplary embodiment, FIG2 is a flow chart of a transmission method provided in an embodiment of the present application. Referring to FIG2 , this embodiment includes the following steps:
[0069] S110: Determine the frame structure of the bearer frame.
[0070] A bearer frame can be considered a frame that carries data, such as target data. Target data can be considered data to be carried, such as customer services. A bearer frame includes multiple code blocks, each of which includes multiple time slots. Each time slot supports multiple time slot sizes, and the determined frame structure uses one time slot size.
[0071] In order to adapt to scenarios with different customer code block sizes, this application constructs a universal bearer frame structure. The bearer frame includes multiple code blocks. The code blocks are not limited here and can be determined based on actual scenarios. For example, the multiple code blocks include S code blocks, multiple D code blocks and T code blocks.
[0072] The structure of the bearer frame remains unchanged; only three parameters change: the size of each slot in the frame, the number of slots in the frame, and the number of frames in the multiframe. Because the slot size can be varied, the bearer frame supports multiple slot sizes, and a bearer frame can use only one slot size at a time to carry data. The choice of slot size is not restricted and can be determined based on the communication node's usage scenario. The slot size of the bearer frame can be linked to the client code block size. If the two are equal, for a client code block size of 2, the slot size of the bearer frame can be 2.
[0073] The structure of the bearer frame remains unchanged by adjusting the variable timeslot size, the number of timeslots, and the number of bearer frames contained in the multiframe.
[0074] In this embodiment, the number of time slots may be determined based on the time slot size, and the number of bearer frames in a multiframe may be determined based on the number of time slots.
[0075] The step of determining the structure of the bearer frame may at least include determining the time slot size and the number of time slots of the bearer frame.
[0076] The slot size can be constrained by the communication scenario. The slot size, number of slots, and number of bearer frames in a multiframe can be considered parameters related to the total amount of information carried in a bearer frame and the total number of slots in a frame. Regardless of how the slot size of a bearer frame changes, the total amount of information carried in a bearer frame and the total number of slots in a multiframe remain constant.
[0077] S120: Determine a frame structure of a multiframe including the bearer frame.
[0078] Determining the structure of the multiframe in this step may include at least determining the number of bearer frames in the multiframe. The number of bearer frames in the multiframe may be determined by a timeslot size, such as indirectly by determining the number of timeslots in the bearer frame based on the timeslot size, and then determining the number of bearer frames in the multiframe based on the number of timeslots in the bearer frame.
[0079] It should be noted that the time slot size, the number of time slots in a bearer frame, and the number of bearer frames in a multiframe may be associated with a communication standard and / or a communication scenario. A fixed time slot size, the number of time slots in a bearer frame, and the number of bearer frames in a multiframe may be adopted in a certain communication standard. The fixed time slot size, the number of time slots in a bearer frame, and the number of bearer frames in a multiframe may be predetermined and directly used during the communication process. Steps S110 and S120 may directly obtain a predetermined result, such as obtaining a predetermined time slot size.
[0080] S130: Map the target data to the bearer frame in the multiframe for transmission.
[0081] The target data can be considered as the customer service to be carried and transmitted on the multiframe. The target data is mapped to the time slot of the bearer frame in the multiframe for transmission.
[0082] The time slots of the bearer frames of the embodiments of the present application support multiple time slot sizes. During the communication process, only one time slot size can be used to determine the structure of the bearer frame and the structure of the multiframe. The resulting multiframe can support multiple communication scenarios. In a fixed communication scenario, such as a non-penetrating scenario where the time slot size does not change, communication with a fixed time slot size can be achieved, thereby enabling the transmission of target data in that scenario. Because the multiframe supports variable time slot sizes, when applied to a communication scenario corresponding to another time slot size, the target data scenario in that scenario can also be achieved. The communication scenario corresponding to another time slot size can be a client code block in that communication scenario corresponding to another time slot size.
[0083] Based on the above embodiment, a modified embodiment of the above embodiment is proposed. It should be noted that, in order to simplify the description, only the differences from the above embodiment are described in the modified embodiment.
[0084] In one embodiment, the product of the time slot size in a bearer frame and the number of time slots in the bearer frame is fixed, and the product of the number of time slots in the bearer frame and the number of bearer frames in the multiframe is fixed.
[0085] For the convenience of description in this application, the time slot size in the bearer frame can be recorded as x, the number of time slots in the bearer frame can be recorded as y, and the number of bearer frames in the multiframe can be recorded as z.
[0086] In this embodiment, the product of x and y is fixed, and the product of y and z is fixed, so as to ensure the total amount of information carried in the bearer frame and the total number of time slots in the multiframe.
[0087] In one embodiment, the code block includes a start code block (i.e., an S code block), a data code block (i.e., a D code block), and an end code block (i.e., a T code block), and the bearer frame includes an overhead field, which is carried in the data code block or the start code block or the end code block, and the overhead field indicates the number of the bearer frames in the multiframe and the position of the bearer frame in the multiframe.
[0088] The bearer frame consists of an S code block, multiple D code blocks, and a T code block, and includes overhead bytes. If the S code block does not carry a client code block, the overhead byte length is equal to the T code block carrying length, which is equivalent to the T code block not carrying a client code block. This is equivalent to only the D code block in the bearer frame carrying the client code block, and the S code block and T code block do not carry the client code block. In this way, the bearer frame's carrying rate = number of D code blocks / (number of D code blocks + 2). When the client code block is not compressed and the overhead bytes are carried on the D code block, when it is necessary to carry 4.8G client services on 5G bandwidth, the number of D code blocks required in the bearer frame must be greater than 180 to achieve this.
[0089] The bearer frame contains an overhead field. The overhead field specifies the number of frames in the multiframe (e.g., the number of bearer frames in the multiframe) and the order of each frame (e.g., the position of the bearer frame in the multiframe). For example, the overhead field contains information indicating the multiframe structure, such as the Multi-Frame Indicator (MFI) or the Multi-Frame Alignment Signal (MFAS). The multiframe information carried in all frames changes periodically, indicating the order of the frames within the multiframe. Each change in the multiframe information represents the size of a multiframe. For example, the MFI consists of five bits: the first frame has MFI = 00000, the second frame has MFI = 00001, the third frame has MFI = 00010, the fourth frame has MFI = 00011, and so on. The 32nd frame has MFI = 11111, the 33rd frame has MFI = 00000, and the 34th frame has MFI = 00001. The MFI value changes within each frame. A multiframe consists of 32 frames, from the first frame with MFI = 00000 to the 32nd frame with MFI = 11111. The MFI value changes periodically, with MFI = 00000-11111 forming a multiframe. When the MFI consists of 5 bits, a maximum of 32 frames can form a multiframe. If the MFI consists of 3 bits, a maximum of 8 frames can form a multiframe, with MFI varying from 000 to 111. The number of bits in the MFI can be defined as 5. Using all 5 bits indicates that 32 frames form a multiframe, with MFI varying from 00000 to 11111. When only the lower three bits are valid, an eight-frame multiframe can be formed, with MFI varying from xx000 to xx111 (ignoring the upper two bits). Using different bits in the multiframe flag can indicate different multiframe sizes.
[0090] In one embodiment, the overhead field is located in the first data code block in the data code block, the carrying area of the carrying frame includes data code blocks other than the first data code block, the area of the first data code block other than the area where the mapping overhead field is located, and the area of the end code block other than the area where the end block is located, and the target data is carried in the carrying area.
[0091] In this embodiment, the overhead field is located in the D code block, that is, the first D code block position, the last byte in the first D code block (that is, the area in the first data code block except the area where the mapping overhead field is located), all (such as 8) bytes in all subsequent D code blocks (that is, the data code blocks except the first data code block) and the last 7 bytes of the last T code block constitute the carrying area of the bearer frame (that is, the area in the end code block except the area where the end block is located).
[0092] The bearer area can be considered as an idle area in the bearer frame that can be used to map customer traffic. Since the first data block carries overhead fields, the bearer area includes the area of the first data block that is not mapped with overhead fields, as well as all data blocks except the first data block. Since the end block must include the end block, the area outside the end block can be used as the bearer area.
[0093] In one embodiment, the carrying area of the carrying frame includes the data code block, an area of the start code block excluding an area where the overhead field and the start block are located, and an area of the end code block excluding an area where the end block is located.
[0094] In one embodiment, the bearer area of the bearer frame includes the data code block, an area in the start code block excluding an area where the overhead field is located, and an area in the end code block excluding an area where the end block is located.
[0095] In this embodiment, the overhead field can be located in the start code block, so the bearer area can include all data code blocks, the area in the bearer area except the mapping overhead field and the start block, and the area in the end code block except the end block.
[0096] In one embodiment, the bearer frame satisfies one or more of the following conditions:
[0097] The number of code blocks included in the bearer area of the bearer frame is i times a first value, and the number of code blocks of the target data is i times a second value, where the first value is determined based on the length of the target data code block, and the second value is determined based on the length of the code block in the bearer area;
[0098] The number of time slots corresponding to the target data is a factor of the total number of time slots in the multiframe.
[0099] This embodiment does not limit how the first value and the second value are determined. For example, the first value may be the length of the target data code block, and the second value may be the length of the bearer area code block. Alternatively, the first value may be a value obtained by calculating the length of the target data code block, and the second value may be a value obtained by calculating the length of the bearer area code block.
[0100] For example, the length of the bearer frame needs to meet several principles. Principle 1: The number of D code blocks in the selected bearer frame is a, and b client code blocks can be carried in a D code block. Since there are 64 bearer bits in a D code block and the client code block length is 66 bits, the condition a*64=b*66 (a and b are positive integers) must be met to select appropriate a and b parameters to achieve the goal of carrying b client code blocks in a D code block. The formula is simplified to: a*32=b*33. To find the values of a and b, in order for the formula to be valid, a must be a multiple of 33 and b must be a multiple of 32. Therefore, the above formula is further equivalently replaced by the formula: (n*33)*32=(n*32)*33. That is: a=n*33, b=n*32, n is a positive integer (that is, the number of code blocks is i times the first value, and the number of code blocks of the target data is i times the second value, the first value is determined based on the length of the target data code block, and the second value is the length of the bearer area code block). Principle 2: If each time slot is 2 code blocks, there are b / 2 time slots for b code block positions in the frame. When the total number of time slots is 480, the b / 2 time slots in each frame must be a factor of 480 (i.e., the number of time slots corresponding to the target data is a factor of the total number of time slots in the multiframe). Principle 3: If there are a maximum of 480 time slots in each frame and there are b / 2 time slots in each frame, then b / 2 is not greater than 480, i.e., n*16 is not greater than 480 (i.e., the number of time slots corresponding to the target data is not greater than the total number of time slots in the multiframe). Principle 4: In terms of bearer frame efficiency, the number of D code blocks must be greater than 180, and a=(n*33) is greater than 180.
[0101] In one embodiment, the first value is the length of the target data code block, and the second value is the length of the bearer area code block; or
[0102] The first value is the length of the target data divided by a common divisor, and the second value is the length of the bearer area code block divided by a common divisor. The common divisor is the common divisor of the length of the target data and the length of the bearer area code block (e.g., a=n*33, b=n*32).
[0103] In one embodiment, when the start code block does not carry overhead, the bearer frame includes 1 start code block, 198 data code blocks and 1 end code block, and the code block length of the target data is 66 bits; when the start code block carries overhead, the bearer frame includes 1 start code block, 197 data code blocks and 1 end code block, and the code block length of the target data is 66 bits.
[0104] In one embodiment, the time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 192, and both x and y are positive integers.
[0105] In one embodiment, the time slot size is 2 code blocks, the number of time slots of the bearer frame is 96 time slots, and the multiframe consists of 5 bearer frames; or,
[0106] The time slot size is 4 code blocks, the number of time slots in the bearer frame is 48 time slots, and the multiframe consists of 10 bearer frames; or,
[0107] The time slot size is 8 code blocks, the number of the bearer frame time slots is 24 time slots, and the multiframe is composed of the 20 bearer frames.
[0108] In one embodiment, when the start code block does not carry overhead, the bearer frame includes 1 start code block, 330 data code blocks and 1 end code block, and the code block length of the target data is 66 bits;
[0109] In the case where the start code block carries overhead, the bearer frame includes 1 start code block, 329 data code blocks and 1 end code block, and the code block length of the target data is 66 bits.
[0110] In one embodiment, the time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 320, and both x and y are positive integers.
[0111] In one embodiment, the time slot size is 2 code blocks, the number of time slots of the bearer frame is 160 time slots, and the multiframe consists of 3 bearer frames; or,
[0112] The time slot size is 4 code blocks, the number of time slots in the bearer frame is 80 time slots, and the multiframe consists of 6 bearer frames; or,
[0113] The time slot size is 8 code blocks, the number of the bearer frame time slots is 40 time slots, and the multiframe is composed of the 12 bearer frames.
[0114] In one embodiment, when the start code block does not carry overhead, the bearer frame includes 1 start code block, 495 data code blocks and 1 end code block;
[0115] In the case where the start code block carries overhead, the bearer frame includes 1 start code block, 494 data code blocks and 1 end code block.
[0116] In one embodiment, the time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 480, and both x and y are positive integers.
[0117] In one embodiment, the time slot size is 2 code blocks, the number of time slots of the bearer frame is 240 time slots, and the multiframe consists of 2 bearer frames; or,
[0118] The time slot size is 4 code blocks, the number of time slots in the bearer frame is 120 time slots, and the multiframe is composed of 4 bearer frames; or,
[0119] The time slot size is 8 code blocks, the number of the bearer frame time slots is 60 time slots, and the multiframe is composed of the 8 bearer frames.
[0120] In one embodiment, when the start code block does not carry overhead, the bearer frame includes 1 start code block, 990 data code blocks and 1 end code block, and the code block length of the target data is 66 bits;
[0121] In the case where the start code block carries overhead, the bearer frame includes 1 start code block, 989 data code blocks and 1 end code block, and the code block length of the target data is 66 bits.
[0122] In one embodiment, the time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 960, and both x and y are positive integers.
[0123] In one embodiment, the time slot size is 2 code blocks, the number of time slots of the bearer frame is 480 time slots, and the multiframe consists of one bearer frame; or
[0124] The time slot size is 4 code blocks, the number of time slots in the bearer frame is 240 time slots, and the multiframe is composed of 2 bearer frames; or,
[0125] The time slot size is 8 code blocks, the number of the bearer frame time slots is 120 time slots, and the multiframe is composed of the 4 bearer frames.
[0126] In one embodiment, when the start code block does not carry overhead, the bearer frame includes 1 start code block, 65 data code blocks and 1 end code block, and the code block length of the target data is 65;
[0127] In the case where the start code block carries overhead, the bearer frame includes 1 start code block, 64 data code blocks and 1 end code block, and the code block length of the target data is 65.
[0128] In one embodiment, the time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 64, and both x and y are positive integers.
[0129] In one embodiment, the time slot size is 2 code blocks, the number of time slots of the bearer frame is 32 time slots, and the multiframe consists of 15 bearer frames; or,
[0130] The time slot size is 4 code blocks, the number of time slots in the bearer frame is 16 time slots, and the multiframe consists of 30 bearer frames; or,
[0131] The time slot size is 8 code blocks, the number of the bearer frame time slots is 8 time slots, and the multiframe is composed of the 60 bearer frames.
[0132] In one embodiment, when the start code block does not carry overhead, the bearer frame includes 1 start code block, 195 data code blocks and 1 end code block, and the code block length of the target data is 65;
[0133] In the case where the start code block carries overhead, the bearer frame includes 1 start code block, 194 data code blocks and 1 end code block, and the code block length of the target data is 65.
[0134] In one embodiment, the time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 192, and both x and y are positive integers.
[0135] In one embodiment, the time slot size is 2 code blocks, the number of time slots of the bearer frame is 96 time slots, and the multiframe consists of 5 bearer frames; or,
[0136] The time slot size is 4 code blocks, the number of time slots in the bearer frame is 48 time slots, and the multiframe consists of 10 bearer frames; or,
[0137] The time slot size is 8 code blocks, the number of the bearer frame time slots is 24 time slots, and the multiframe is composed of the 20 bearer frames.
[0138] In one embodiment, when the start code block does not carry overhead, the bearer frame includes 1 start code block, 325 data code blocks and 1 end code block, and the code block length of the target data is 65 code blocks;
[0139] In the case where the start code block carries overhead, the bearer frame includes 1 start code block, 324 data code blocks and 1 end code block, and the code block length of the target data is 65 code blocks.
[0140] In one embodiment, the time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 320, and both x and y are positive integers.
[0141] In one embodiment, the time slot size is 2 code blocks, the number of time slots of the bearer frame is 160 time slots, and the multiframe consists of 3 bearer frames; or,
[0142] The time slot size is 4 code blocks, the number of time slots in the bearer frame is 80 time slots, and the multiframe consists of 6 bearer frames; or,
[0143] The time slot size is 8 code blocks, the number of the bearer frame time slots is 40 time slots, and the multiframe is composed of the 12 bearer frames.
[0144] In one embodiment, obtaining target data carried in a bearer frame timeslot according to a first timeslot size includes:
[0145] receiving a bearer frame carrying the target data;
[0146] According to a set rule, the idle code blocks between the bearer frames are restored to their original idle distribution state;
[0147] extracting the target data from the bearer frame according to a first time slot size;
[0148] Based on the idle code blocks and the local clock, clock information of the target data is recovered.
[0149] In one embodiment, the set rule includes one of the following:
[0150] Inserting a first fixed number of idle code blocks between adjacent bearer frames;
[0151] Inserting a second fixed number of idle code blocks between each equal number of bearer frames;
[0152] A third fixed number of idle code blocks are inserted into one multiframe period.
[0153] In one embodiment, the number of the start code blocks is 1, the number of the end code blocks is 1, and the number of the data code blocks is 198.
[0154] The time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 192, and both x and y are positive integers.
[0155] In one embodiment, the number of the start code blocks is 1, the number of the end code blocks is 1, and the number of the data code blocks is 330.
[0156] The time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 320, and both x and y are positive integers.
[0157] In one embodiment, the time slot size is 1 code block, and the number of time slots in the carrier frame is 320 time slots; the time slot size is 2 code blocks, and the number of time slots in the carrier frame is 160 time slots; the time slot size is 4 code blocks, and the number of time slots in the carrier frame is 80 time slots; the time slot size is 8 code blocks, and the number of time slots in the carrier frame is 40 time slots.
[0158] In one embodiment, the number of the start code blocks is 1, the number of the end code blocks is 1, and the number of the data code blocks is 495.
[0159] The time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 480, and both x and y are positive integers.
[0160] In one embodiment, the number of the start code blocks is 1, the number of the end code blocks is 1, and the number of the data code blocks is 990.
[0161] The time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 960, and both x and y are positive integers.
[0162] In one embodiment, the number of the start code blocks is 1, the number of the end code blocks is 1, and the number of the data code blocks is 195.
[0163] The time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 192, and both x and y are positive integers.
[0164] In one embodiment, the number of the start code blocks is 1, the number of the end code blocks is 1, and the number of the data code blocks is 65.
[0165] The time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 64, and both x and y are positive integers.
[0166] In one embodiment, the number of the start code blocks is 1, the number of the end code blocks is 1, and the number of the data code blocks is 195.
[0167] The time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 192, and both x and y are positive integers.
[0168] In one embodiment, the number of the start code blocks is 1, the number of the end code blocks is 1, and the number of the data code blocks is 325.
[0169] The time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 320, and both x and y are positive integers.
[0170] In one embodiment, the time slot size includes one or more of: 2 code blocks, 4 code blocks, and 8 code blocks.
[0171] In one embodiment, the code block length of the target data includes: 66 bits, 65 bits or 257 bits.
[0172] In one embodiment, determining the frame structure of the bearer frame includes:
[0173] Determine a time slot size used by the bearer frame, that is, determine x used for communication;
[0174] The number of time slots in the bearer frame is determined, that is, y used for communication is determined.
[0175] In one embodiment, determining the frame structure of the multiframe including the bearer frame includes:
[0176] The number of the bearer frames included in the multiframe is determined, that is, z is determined.
[0177] In one embodiment, mapping target data to the bearer frame in the multiframe for transmission includes:
[0178] Mapping the target data onto the bearer frame;
[0179] Inserting idle code blocks between the bearer frames according to a set rule;
[0180] The bearer frame is transmitted.
[0181] In one embodiment, the setting rule is not limited as long as it is consistent between the communicating parties.
[0182] In one embodiment, the set rule includes one of the following:
[0183] Inserting a first fixed number of idle code blocks between adjacent bearer frames;
[0184] Inserting a second fixed number of idle code blocks between each equal number of bearer frames;
[0185] A third fixed number of idle code blocks are inserted into one multiframe period.
[0186] The values of the first fixed number, the second fixed number, and the third fixed number are not limited.
[0187] In one embodiment, the method further includes: receiving a bearer frame carrying the target data;
[0188] According to a set rule, the idle code blocks between the bearer frames are restored to their original idle distribution state;
[0189] extracting the target data from the bearer frame;
[0190] Based on the idle code blocks and the local clock, clock information of the target data is recovered.
[0191] The idle distribution condition can be considered the distribution of idle code blocks. The original distribution condition can be considered the condition in which idle code blocks are distributed according to a predetermined pattern within a bearer frame when the source device transmits a bearer frame carrying target data. The source device can be considered the device that originates the target data. For example, when a source device communicates with a sink device, the target data may be transferred through an intermediate device. An intermediate device can be considered an intermediate forwarding device during the communication between the source and sink devices.
[0192] The method for recovering the clock information is not limited at this time, and it can be determined by an algorithm, for example.
[0193] In an exemplary embodiment, FIG3 is a flow chart of another transmission method provided by an embodiment of the present application. Referring to FIG3 , the present application is applicable to the case of realizing the delivery of customer services with different time slot sizes. The method can be executed by a transmission device, and the transmission device can be executed by software and / or hardware, and the transmission device can be integrated on a communication node. FIG2 shows a technical solution for carrying and transmitting target data in a scenario where communication is performed with a fixed time slot size. This embodiment shows a technical solution for carrying and transmitting target data in a scenario where the time slot size changes. The change in time slot size can be that the time slot size of the corresponding network of the communication node is different when acquiring data and sending data. As shown in FIG3 , this embodiment includes the following steps:
[0194] S210: Acquire target data carried in the bearer frame timeslot according to the first timeslot size.
[0195] The bearer frame includes multiple code blocks, and the bearer frame includes multiple time slots, and the time slots support multiple time slot sizes.
[0196] S220: Transmit the target data in a multiframe according to the second time slot size.
[0197] The first time slot size is not equal to the second time slot size. In this embodiment, when a communication node is in a penetration scenario, it can obtain target data according to the first time slot size and then send the target data according to the second time slot size. If the first time slot size is smaller than the second time slot size, the target data can be spliced. If the second time slot size is larger than the second time slot size, the target data can be split.
[0198] The transmission method provided in this embodiment uses a first time slot size to acquire target data and a second time slot size to carry and transmit the target data. This enables transmission of client services with different time slot sizes in a scenario where a communication node communicates with two networks corresponding to different time slot sizes. The networks corresponding to different time slot sizes may include a first network (network 1) with client code blocks of the first time slot size and a second network (network 2) with client code blocks of the second time slot size.
[0199] Based on the above embodiment, a variant embodiment of the above embodiment is proposed. It should be noted that in order to make the description concise, only the differences from the above embodiment are described in the variant embodiment. For the detailed details of this embodiment, please refer to the above embodiment.
[0200] In one embodiment, the first time slot size is smaller than the second time slot size, and transmitting the target data in a multiframe according to the second time slot size includes:
[0201] The target data obtained in j time slots are spliced and carried in a multiframe for transmission, the time slot size of the spliced target data is a second time slot size, and j is a ratio of the second time slot size to the first time slot size.
[0202] In one embodiment, the first time slot size includes: 2 or 4, and the second time slot size includes: 4 or 8.
[0203] In one embodiment, the target data is acquired on a bearer frame according to a size of 2 code blocks, and the target data of every 4 time slots is spliced into 8 code blocks, which are then carried and transmitted in the bearer frame. In one embodiment, the target data is acquired on a bearer frame according to a size of 8 code blocks, and the 8 code blocks are split into 4 code blocks. The target data corresponding to each split code block is then carried and transmitted in the bearer frame.
[0204] In one embodiment, the first time slot size is larger than the second time slot size, and transmitting the target data in a multiframe according to the second time slot size includes:
[0205] Splitting target data in one time slot into k target data of a second time slot size, where k is a ratio of the first time slot size to the second time slot size;
[0206] The split target data is carried in a multiframe for transmission.
[0207] In one embodiment, the first time slot size includes 4 or 8, and the second time slot size includes 2 or 4.
[0208] In one embodiment, the product of the time slot size in a bearer frame and the number of time slots in the bearer frame is fixed, and the product of the number of time slots in the bearer frame and the number of bearer frames in the multiframe is fixed.
[0209] In one embodiment, the code block includes a start code block, a data code block and an end code block, and the bearer frame includes an overhead field, which is carried in the data code block or the start code block or the end code block, and the overhead field indicates the number of the bearer frames in the multiframe and the position of the bearer frame in the multiframe.
[0210] In one embodiment, the overhead field is located in the first data code block in the data code block, the carrying area of the carrying frame includes data code blocks other than the first data code block, the area of the first data code block other than the area where the mapping overhead field is located, and the area of the end code block other than the area where the end block is located, and the target data is carried in the carrying area.
[0211] In one embodiment, the bearer area of the bearer frame includes the data code block, an area in the start code block excluding an area where the overhead field is located, and an area in the end code block excluding an area where the end block is located.
[0212] In one embodiment, the bearer frame satisfies one or more of the following conditions:
[0213] The number of code blocks included in the bearer area of the bearer frame is i times a first value, and the number of code blocks of the target data is i times a second value, where the first value is determined based on the length of the target data code block, and the second value is determined based on the length of the code block in the bearer area;
[0214] The number of time slots corresponding to the target data is a factor of the total number of time slots in the multiframe.
[0215] In one embodiment, the first value is the length of the target data code block, and the second value is the length of the bearer area code block; or
[0216] The first value is the length of the target data divided by a common divisor, and the second value is the length of the bearer area code block divided by a common divisor. The common divisor is the common divisor of the length of the target data and the length of the bearer area code block.
[0217] In one embodiment, when the start code block does not carry overhead, the bearer frame includes 1 start code block, 198 data code blocks and 1 end code block, and the code block length of the target data is 66 bits; when the start code block carries overhead, the bearer frame includes 1 start code block, 197 data code blocks and 1 end code block, and the code block length of the target data is 66 bits.
[0218] In one embodiment, the time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 192, and both x and y are positive integers.
[0219] In one embodiment, the time slot size is 2 code blocks, the number of time slots of the bearer frame is 96 time slots, and the multiframe consists of 5 bearer frames; or,
[0220] The time slot size is 4 code blocks, the number of time slots in the bearer frame is 48 time slots, and the multiframe consists of 10 bearer frames; or,
[0221] The time slot size is 8 code blocks, the number of the bearer frame time slots is 24 time slots, and the multiframe is composed of the 20 bearer frames.
[0222] In one embodiment, when the start code block does not carry overhead, the bearer frame includes 1 start code block, 330 data code blocks and 1 end code block, and the code block length of the target data is 66 bits;
[0223] In the case where the start code block carries overhead, the bearer frame includes 1 start code block, 329 data code blocks and 1 end code block, and the code block length of the target data is 66 bits.
[0224] In one embodiment, the time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 320, and both x and y are positive integers.
[0225] In one embodiment, the time slot size is 2 code blocks, the number of time slots of the bearer frame is 160 time slots, and the multiframe consists of 3 bearer frames; or,
[0226] The time slot size is 4 code blocks, the number of time slots in the bearer frame is 80 time slots, and the multiframe consists of 6 bearer frames; or,
[0227] The time slot size is 8 code blocks, the number of the bearer frame time slots is 40 time slots, and the multiframe is composed of the 12 bearer frames.
[0228] In one embodiment, when the start code block does not carry overhead, the bearer frame includes 1 start code block, 495 data code blocks and 1 end code block;
[0229] In the case where the start code block carries overhead, the bearer frame includes 1 start code block, 494 data code blocks and 1 end code block.
[0230] In one embodiment, the time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 480, and both x and y are positive integers.
[0231] In one embodiment, the time slot size is 2 code blocks, the number of time slots of the bearer frame is 240 time slots, and the multiframe consists of 2 bearer frames; or,
[0232] The time slot size is 4 code blocks, the number of time slots in the bearer frame is 120 time slots, and the multiframe is composed of 4 bearer frames; or,
[0233] The time slot size is 8 code blocks, the number of the bearer frame time slots is 60 time slots, and the multiframe is composed of the 8 bearer frames.
[0234] In one embodiment, when the start code block does not carry overhead, the bearer frame includes 1 start code block, 990 data code blocks and 1 end code block, and the code block length of the target data is 66 bits;
[0235] In the case where the start code block carries overhead, the bearer frame includes 1 start code block, 989 data code blocks and 1 end code block, and the code block length of the target data is 66 bits.
[0236] In one embodiment, the time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 960, and both x and y are positive integers.
[0237] In one embodiment, the time slot size is 2 code blocks, the number of time slots of the bearer frame is 480 time slots, and the multiframe consists of one bearer frame; or
[0238] The time slot size is 4 code blocks, the number of time slots in the bearer frame is 240 time slots, and the multiframe is composed of 2 bearer frames; or,
[0239] The time slot size is 8 code blocks, the number of the bearer frame time slots is 120 time slots, and the multiframe is composed of the 4 bearer frames.
[0240] In one embodiment, when the start code block does not carry overhead, the bearer frame includes 1 start code block, 65 data code blocks and 1 end code block, and the code block length of the target data is 65;
[0241] In the case where the start code block carries overhead, the bearer frame includes 1 start code block, 64 data code blocks and 1 end code block, and the code block length of the target data is 65.
[0242] In one embodiment, the time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 64, and both x and y are positive integers.
[0243] In one embodiment, the time slot size is 2 code blocks, the number of time slots of the bearer frame is 32 time slots, and the multiframe consists of 15 bearer frames; or,
[0244] The time slot size is 4 code blocks, the number of time slots in the bearer frame is 16 time slots, and the multiframe consists of 30 bearer frames; or,
[0245] The time slot size is 8 code blocks, the number of the bearer frame time slots is 8 time slots, and the multiframe is composed of the 60 bearer frames.
[0246] In one embodiment, when the start code block does not carry overhead, the bearer frame includes 1 start code block, 195 data code blocks and 1 end code block, and the code block length of the target data is 65;
[0247] In the case where the start code block carries overhead, the bearer frame includes 1 start code block, 194 data code blocks and 1 end code block, and the code block length of the target data is 65.
[0248] In one embodiment, the time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 192, and both x and y are positive integers.
[0249] In one embodiment, the time slot size is 2 code blocks, the number of time slots of the bearer frame is 96 time slots, and the multiframe consists of 5 bearer frames; or,
[0250] The time slot size is 4 code blocks, the number of time slots in the bearer frame is 48 time slots, and the multiframe consists of 10 bearer frames; or,
[0251] The time slot size is 8 code blocks, the number of the bearer frame time slots is 24 time slots, and the multiframe is composed of the 20 bearer frames.
[0252] In one embodiment, when the start code block does not carry overhead, the bearer frame includes 1 start code block, 325 data code blocks and 1 end code block, and the code block length of the target data is 65 code blocks;
[0253] In the case where the start code block carries overhead, the bearer frame includes 1 start code block, 324 data code blocks and 1 end code block, and the code block length of the target data is 65 code blocks.
[0254] In one embodiment, the time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 320, and both x and y are positive integers.
[0255] In one embodiment, the time slot size is 2 code blocks, the number of time slots of the bearer frame is 160 time slots, and the multiframe consists of 3 bearer frames; or,
[0256] The time slot size is 4 code blocks, the number of time slots in the bearer frame is 80 time slots, and the multiframe consists of 6 bearer frames; or,
[0257] The time slot size is 8 code blocks, the number of the bearer frame time slots is 40 time slots, and the multiframe is composed of the 12 bearer frames.
[0258] In one embodiment, the number of the start code blocks is 1, the number of the end code blocks is 1, and the number of the data code blocks is 198.
[0259] The time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 192, and both x and y are positive integers.
[0260] In one embodiment, the number of the start code blocks is 1, the number of the end code blocks is 1, and the number of the data code blocks is 330.
[0261] The time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 320, and both x and y are positive integers.
[0262] In one embodiment, the number of the start code blocks is 1, the number of the end code blocks is 1, and the number of the data code blocks is 495.
[0263] The time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 480, and both x and y are positive integers.
[0264] In one embodiment, the number of the start code blocks is 1, the number of the end code blocks is 1, and the number of the data code blocks is 990.
[0265] The time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 960, and both x and y are positive integers.
[0266] In one embodiment, the number of the start code blocks is 1, the number of the end code blocks is 1, and the number of the data code blocks is 195.
[0267] The time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 192, and both x and y are positive integers.
[0268] In one embodiment, the number of the start code blocks is 1, the number of the end code blocks is 1, and the number of the data code blocks is 65.
[0269] The time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 64, and both x and y are positive integers.
[0270] In one embodiment, the number of the start code blocks is 1, the number of the end code blocks is 1, and the number of the data code blocks is 195.
[0271] The time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 192, and both x and y are positive integers.
[0272] In one embodiment, the number of the start code blocks is 1, the number of the end code blocks is 1, and the number of the data code blocks is 325.
[0273] The time slot size is x code blocks, the number of the bearer frame time slots is y time slots, the product of x and y is 320, and both x and y are positive integers.
[0274] In one embodiment, the time slot size includes one or more of: 2 code blocks, 4 code blocks, and 8 code blocks.
[0275] In one embodiment, the code block length of the target data includes: 66 bits, 65 bits or 257 bits.
[0276] The following is an exemplary description of the present application. The transmission method provided by the present application can be considered as a customer service carrying method of different time slot sizes. The present application relates to a customer service carrying method of different time slot sizes, especially a method for transmitting customer services between a time slot frame structure of 8 code blocks and a time slot frame structure of 2 code blocks.
[0277] For different sub-timeslot sizes, the size of the sub-timeslot in the frame and the number of frames in the multiframe are changed to achieve the delivery of services of different customer granularity without changing the frame structure.
[0278] In specific applications, the network's bearer frame structure can have several fixed sizes. To accommodate fg-BU frame bearer scenarios, the bearer frame structure is defined as consisting of an S block, 195 D blocks, and a T block (corresponding to 1 start block, 1 end block, and 195 data blocks). In the bearer frame structure, x*y = 192 (corresponding to a timeslot size of x blocks, y timeslots in the bearer frame, and the product of x and y being 192, both positive integers). When the bearer frame is divided into y = 24 timeslots, each timeslot carries x = 8 client blocks, and z = 20 frames form a multiframe, the total number of timeslots in a multiframe is 480 (y*z = 480). The total number of client blocks carried in the frame is 8 * 24 = 192, and the product of x and y is 192, meaning the frame carries a total of 192 client blocks. The product of y and z is 480, and the multiframe carries 480 client time slots. For the same bearer frame, when the client is 2 code blocks, the time slot size parameter x in the bearer frame is 2, and each time slot carries 2 client code blocks. After x is determined, y is calculated to be 96 (when the product of x and y is 192). After y is determined, z is further calculated to be 5 (when the product of y and z is 480). In this way, each time slot in the same frame structure carries 2 client code blocks, 96 time slots are set in each frame, and a multiframe is composed of 5 frames. There are a total of 480 time slots in the multiframe. Figure 4a is a schematic diagram of the multiframe structure in which each time slot carries 2 client code blocks provided by an embodiment of the present application; Figure 4b is a schematic diagram of the structure of a multiframe in which each time slot carries 4 client code blocks provided by an embodiment of the present application. Figure 4a shows two multiframes, multiframe 1 and multiframe 2, each multiframe includes 5 bearer frames, and each bearer frame has a time slot size of 2 code blocks, with a total number of time slots of 96. Similarly, when the client has 4 code blocks, x is 4, and y is calculated to be 48 (when the product of x and y is 192). Furthermore, z is calculated to be 10 (when the product of y and z is 480). In this way, each time slot in the frame structure carries 4 client code blocks, and each frame has 48 time slots. A multiframe consists of 10 frames, and there are 480 time slots in the multiframe, as shown in Figure 4b.
[0279] In addition to the example above, the bearer frame structure is determined as follows: A bearer frame consists of an S code block, a D code block, and a T code block. For a bearer frame structure with 7 bytes of overhead, the overhead bytes are placed in the first D code block position, the number of time slots is 480, and the client code block length is 66 bits. Since the client code block is 66 bits, the D code block carrying customer services only has 64 bits of payload space. When a (a is a positive integer) D code blocks (a T code block is equivalent to a D code block when it carries customer content) carry b client code blocks, the bearer frame length must meet several principles. Principle 1: The number of D code blocks in the bearer frame is selected to be a, so that a D code block can carry b client code blocks. Since the D code contains 64 payload bits and the client code block length is 66 bits, the condition a*64=b*66 (a and b are positive integers) must be satisfied. Selecting appropriate a and b parameters ensures that b client code blocks can be carried in a D code block. The formula simplifies to: a*32 = b*33. To find the values of a and b, for the formula to hold, a must be a multiple of 33, and b must be a multiple of 32. Therefore, the above formula can be further replaced with: (n*33)*32 = (n*32)*33. That is, a = n*33, b = n*32, where n is a positive integer. Principle 2: If each time slot consists of 2 code blocks, there are b / 2 time slots for b code block positions in a frame. For a total of 480 time slots, b / 2 time slots in each frame must be a factor of 480. Principle 3: Given a maximum of 480 time slots per frame and b / 2 time slots per frame, b / 2 must not exceed 480, meaning n*16 must not exceed 480. Principle 4: For bearer frame efficiency, the number of D code blocks must be greater than 180, and a = (n*33) must be greater than 180. Combining Principles 1 and 2, we deduce that b / 2 = (n*32) / 2 = n*16 must be a factor of 480, and n can only be 1, 2, 3, 5, 6, 10, 15, or 30. Principle 3 deduces that n is no greater than 30, and Principle 4 deduces that n is greater than 5, so n can only be 6, 10, 15, or 30. The bearer frame can have the following structures: The first bearer frame structure (n=6): 1 S code block + 198 D code blocks + 1 T code block; the second bearer frame structure (n=10): 1 S code block + 330 D code blocks + 1 T code block; the third bearer frame structure (n=15): 1 S code block + 495 D code blocks + 1 T code block; the fourth bearer frame structure (n=30): 1 S code block + 990 D code blocks + 1 T code block.
[0280] Figure 4c is a bearer frame structure provided by an embodiment of the present application. The first bearer frame structure is shown in Figure 4c. The overhead byte length is 7 bytes, and the overhead byte is carried on the first D code block. The last byte in the first D code block, the 8 bytes in all subsequent D code blocks, and the last 7 bytes of the last T code block constitute the bearer area of the bearer frame, a total of 192*66 bits, which can carry 192 client code blocks (each client code block is 66 bits long). The bearer area can be divided into different time slot formats: such as 2 code blocks and 96 time slots per time slot, 4 code blocks and 48 time slots per time slot, 8 code blocks and 24 time slots per time slot, and so on.
[0281] For the first bearer frame structure, when the client code block size is 2 code blocks, 2 code blocks per time slot and 96 time slots are used to carry client services. Five bearer frames form a multiframe, and the bearer frame carries the client service structure. Figure 4d is a schematic diagram of the structure of a multiframe carrying 2 client code blocks per time slot, provided by an embodiment of the present application. As shown in Figure 4d, the bearer frame time slot size is 2 code blocks, and a bearer frame has 96 time slots.
[0282] Figure 4e is a structural schematic diagram of a multiframe carrying 4 client code blocks per time slot provided by an embodiment of the present application, and Figure 4f is a structural schematic diagram of a bearer frame carrying 8 client code blocks per time slot provided by an embodiment of the present application. When the client code block size is 4 code blocks, 4 code blocks per time slot and 48 time slots are used to carry client services, 10 bearer frames constitute a multiframe, and the structure of the bearer frame carrying client services is shown in Figure 4e; when the client code block size is 8 code blocks, 8 code blocks per time slot and 24 time slots are used to carry client services, 20 bearer frames constitute a multiframe, and the structure of the bearer frame carrying client services is shown in Figure 4f.
[0283] Figure 4g is a structural diagram of a bearer frame provided by an embodiment of the present application. The second bearer frame structure is shown in Figure 4g. The overhead byte length is 7 bytes, in the first D code block. The last byte in the first D code block, the 8 bytes in all subsequent D code blocks, and the last 7 bytes of the last T code block constitute the bearer area of the bearer frame, a total of 320*66 bits, which can carry 320 client code blocks (each client code block is 66 bits long). The bearer area can be divided into different time slot formats: such as 1 code block and 320 time slots per time slot, 2 code blocks and 160 time slots per time slot, 4 code blocks and 80 time slots per time slot, 8 code blocks and 40 time slots per time slot, and so on.
[0284] Figure 4h is a structural diagram of a multiframe in which each time slot carries 2 customer code blocks provided by an embodiment of the present application. For the second bearer frame structure, when the customer code block size is 2 code blocks, 2 code blocks and 160 time slots are used to carry customer services, 3 bearer frames constitute a multiframe, and the structure of the bearer frame carrying customer services is shown in Figure 4h; when the customer code block size is 4 code blocks, 4 code blocks and 80 time slots are used to carry customer services, 6 bearer frames constitute a multiframe, and the structure of the bearer frame carrying customer services is shown in Figure 4i; when the customer code block size is 8 code blocks, 8 code blocks and 40 time slots are used to carry customer services per time slot, 12 bearer frames constitute a multiframe, and the structure of the bearer frame carrying customer services is shown in Figure 4j.
[0285] Figure 4k is a structural diagram of a bearer frame provided by an embodiment of the present application. The third bearer frame structure is shown in Figure 4k. The overhead byte length is 7 bytes, in the first D code block. The last byte in the first D code block, the 8 bytes in all subsequent D code blocks, and the last 7 bytes of the last T code block constitute the bearer area of the bearer frame, a total of 480*66 bits, which can carry 480 client code blocks (each client code block is 66 bits long). The bearer area can be divided into different time slot formats: such as 1 code block and 480 time slots per time slot, 2 code blocks and 240 time slots per time slot, 4 code blocks and 120 time slots per time slot, 8 code blocks and 60 time slots per time slot, and so on.
[0286] Figure 4l is a structural schematic diagram of a multiframe carrying 2 customer code blocks per time slot provided by an embodiment of the present application; Figure 4m is a structural schematic diagram of a multiframe carrying 4 customer code blocks per time slot provided by an embodiment of the present application; Figure 4n is a structural schematic diagram of a multiframe carrying 8 customer code blocks per time slot provided by an embodiment of the present application; for the third bearer frame structure, when the customer code block size is 2 code blocks, 2 code blocks per time slot and 240 time slots are used to carry customer services, 2 bearer frames constitute a multiframe, and the structure of the bearer frame carrying customer services is shown in Figure 4l; when the customer code block size is 4 code blocks, 4 code blocks per time slot and 120 time slots are used to carry customer services, 4 bearer frames constitute a multiframe, and the structure of the bearer frame carrying customer services is shown in Figure 4m; when the customer code block size is 8 code blocks, 8 code blocks per time slot and 60 time slots are used to carry customer services, 8 bearer frames constitute a multiframe, and the structure of the bearer frame carrying customer services is shown in Figure 4n.
[0287] Figure 4o is a schematic diagram of the structure of a bearer frame provided by an embodiment of the present application; Figure 4p is a schematic diagram of the structure of a multiframe carrying two client code blocks per time slot provided by an embodiment of the present application; Figure 4q is a schematic diagram of the structure of a multiframe carrying four client code blocks per time slot provided by an embodiment of the present application; Figure 4r is a schematic diagram of the structure of a multiframe carrying eight client code blocks per time slot provided by an embodiment of the present application; The fourth bearer frame structure is shown in Figure 4o. The overhead byte length is 7 bytes and is in the first D code block. The last byte of the first D code block, the 8 bytes of all subsequent D code blocks, and the last 7 bytes of the last T code block constitute the bearer area of the bearer frame, totaling 960*66 bits, which can carry 960 client code blocks (each client code block is 66 bits long). The bearer area can be divided into different time slot formats: 2 code blocks per time slot and 480 time slots, 4 code blocks per time slot and 240 time slots, 8 code blocks per time slot and 120 time slots, and so on.
[0288] For the fourth bearer frame structure, when the client block size is 2 blocks, 2 blocks per time slot and 480 time slots are used to carry customer services. One bearer frame constitutes a multiframe, and the structure of the bearer frame carrying customer services is shown in Figure 4p. When the client block size is 4 blocks, 4 blocks per time slot and 240 time slots are used to carry customer services. Two bearer frames constitute a multiframe, and the structure of the bearer frame carrying customer services is shown in Figure 4q. When the client block size is 8 blocks, 8 blocks per time slot and 120 time slots are used to carry customer services. Four bearer frames constitute a multiframe, and the structure of the bearer frame carrying customer services is shown in Figure 4r.
[0289] Figure 4s is a schematic diagram of a scenario of penetrating different network systems provided by an embodiment of the present application. For the previous application example, the same customer service needs to penetrate two different network systems. The same frame structure is used in the two network systems, but the size of the time slots in one network system is different. As shown in Figure 4s, the same customer service is carried and transmitted in network one, and is carried and transmitted in network two through device 3. The customer service is carried in network one according to the frame structure parameters of network one (x1, y1 and z1, for example, x1=2, y1=96 and z1=5), and is carried in network two according to the frame structure parameters of network two (x2, y2 and z2, for example, x2=8, y2=24 and z2=20) after passing through device 3. Each time slot in network one is 2 code blocks, and each time slot in network two is 8 code blocks. When a customer service is transmitted from Network 1 to Network 2, the timeslot in the frame from Device 2 to Device 3 consists of two code blocks. Device 3 receives customer service with two code blocks in each timeslot. For the same customer service, Device 3 needs to continuously receive code blocks from this customer across four timeslots. These four timeslots of code blocks are combined into eight code blocks, which are then placed in one timeslot in Network 2's frame structure and sent from Device 3 to Device 4. Each timeslot in Network 2 is eight code blocks in size. The eight code blocks of customer service in one timeslot in Network 2's frame structure come from the customer service code blocks in four timeslots in Network 1. Device 3 converts the four timeslots in Network 1 (each consisting of two code blocks) into one timeslot in Network 2 (each consisting of eight code blocks). Similarly, when customer service is transmitted from Network 2 to Network 1, each timeslot in Network 2 consists of eight code blocks, while each timeslot in Network 1 consists of two code blocks. In the process of transmitting customer services from Network 2 to Network 1, the time slot in the time frame sent by Device 4 to Device 3 is 8 code blocks. Device 3 receives customer services of 8 code blocks in one time slot. For the same customer service, Device 3 needs to place the received 8 code blocks in the 4 time slot positions of the customer in Network 1, and send them to Device 2. The 4 time slots in Network 1 complete the code block carrying of one time slot in Network 2, and Device 3 completes the carrying conversion from 1 time slot in Network 2 (each time slot consists of 8 code blocks) to 4 time slots in Network 1 (each time slot consists of 4 code blocks).
[0290] The first to fourth examples of bearer frame structures above are examples in which the overhead byte length is 7 bytes, the overhead bytes are carried in the D code block, and the code block length is 66 bits. In specific applications, the overhead byte length can be other byte lengths, and the overhead bytes can be located anywhere in the frame. The overhead bytes in the frame structure are 6 bytes, and the overhead bytes are carried in the S code block. In this way, the first frame structure changes from Figure 4c to Figure 4t, and Figure 4t also falls into the category of the first frame structure. Similarly, the second frame structure changes from Figure 4g to Figure 4u, and Figure 4u also falls into the category of the second frame structure. The third and fourth frame structures also have similar methods. Whether the overhead bytes are placed in the D code block or the S code block, it does not change the number of time slots and the time slot structure in the frame. They all belong to the same type of frame structure.
[0291] In the example above, the client block is a 66-bit block as defined by Ethernet. In applications, the client block can be compressed or transcoded first. The length of the time slot in the bearer frame is determined based on the length of the compressed or transcoded block. For example, the client block length can be compressed from 66 bits to 65 bits, and the bearer frame structure can be designed based on the 65-bit block length. When the client block length is compressed from 66 bits to 65 bits, the client block length becomes shorter, and the corresponding client service bandwidth decreases, which reduces the efficiency requirements for the bearer frame. The number of D blocks in the bearer frame must be greater than 64 to meet the bandwidth requirements. Since the client block length is 65 bits, the D block carrying the client service only has 64 bits of payload space. When a (a is a positive integer) D blocks (T blocks are equivalent to D blocks when carrying client content) carry b client blocks, the bearer frame length must meet several principles. Principle 5: The number of D blocks in the selected bearer frame is a, and a D blocks can carry b client blocks. Since there are 64 bearer bits in the D code and the client code block length is 65 bits, the condition a*64=b*65 (a and b are positive integers) must be satisfied to select appropriate a and b parameters to achieve the carrying of b client code blocks in a D code block. To find the values of a and b, for the formula to be valid, a must be a multiple of 65 and b must be a multiple of 64. Therefore, the above formula is further equivalently replaced by the formula: (n*65)*64=(n*64)*65. That is, a=n*65, b=n*64, where n is a positive integer (the first value is the length of the target data code block, and the second value is the length of the bearer area code block). Principle 6: If each time slot is 2 code blocks, there are b / 2 time slots for b code block positions in the frame. When the total number of time slots is 480, the b / 2 time slots in each frame must be a factor of 480. Principle 7: Each frame has a maximum of 480 time slots. Each frame has b / 2 time slots, so b / 2 is no greater than 480, meaning n*64 is no greater than 480. Principle 8: Frame efficiency requires that the number of D code blocks be greater than 64, so a = (n*65) is greater than 64. Combining Principles 5 and 6, we deduce that b / 2 = (n*64) / 2 = n*32 must be a factor of 480, and n can only be 1, 3, 5, or 15. Principle 7 deduces that n is no greater than 7.5, and Principle 8 deduces that n is greater than or equal to 1, so n can only be 1, 3, or 5. The bearer frame can have the following structures: the fifth bearer frame structure (n=1): 1 S code block + 65 D code blocks + 1 T code block; the sixth bearer frame structure (n=3): 1 S code block + 195 D code blocks + 1 T code block; the seventh bearer frame structure (n=5): 1 S code block + 325 D code blocks + 1 T code block;
[0292] The fifth bearer frame structure is shown in Figure 4w (n=1). The overhead byte is 7 bytes long and is located in the first D block. The last byte of the first D block, the 8 bytes of all subsequent D blocks, and the last 7 bytes of the last T block form the bearer area of the bearer frame, totaling 64 x 65 bits, capable of carrying 64 client blocks (each 65 bits long). The bearer area can be divided into different time slot formats: 1 block per time slot and 64 time slots, 2 blocks per time slot and 32 time slots, 4 blocks per time slot and 16 time slots, 8 blocks per time slot and 8 time slots, and so on.
[0293] For the fifth bearer frame structure, when the customer code block unit is 2 code blocks, 2 code blocks and 32 time slots are used per time slot to carry customer services, and 15 bearer frames constitute a multiframe. Figure 4w is a structural schematic diagram of a bearer frame for carrying customer services provided in an embodiment of the present application. The bearer frame carrying customer services structure is shown in Figure 4w; when the customer code block size is 4 code blocks, 4 code blocks and 16 time slots are used per time slot to carry customer services, and 30 bearer frames constitute a multiframe; when the customer code block size is 8 code blocks, 8 code blocks and 8 time slots are used per time slot to carry customer services, and 60 bearer frames constitute a multiframe.
[0294] Figure 4x is a structural diagram of another bearer frame for carrying customer services provided in an embodiment of the present application; the sixth bearer frame structure is shown in Figure 4x (n=3), and the overhead byte length is 7 bytes, in the first D code block. The last byte in the first D code block, the 8 bytes in all subsequent D code blocks, and the last 7 bytes of the last T code block constitute the bearer area of the bearer frame, a total of 192*65 bits, which can carry 192 customer code blocks (each customer code block is 65 bits long). The bearer area can be divided into different time slot formats: such as 1 code block and 192 time slots per time slot, 2 code blocks and 96 time slots per time slot, 4 code blocks and 48 time slots per time slot, 8 code blocks and 24 time slots per time slot, and so on.
[0295] For the second bearer frame structure, when the client code block size is 2 code blocks, 2 code blocks per time slot and 96 time slots are used to carry customer services, and 5 bearer frames constitute a multiframe; when the client code block size is 4 code blocks, 4 code blocks per time slot and 48 time slots are used to carry customer services, and 10 bearer frames constitute a multiframe; when the client code block size is 8 code blocks, 8 code blocks per time slot and 24 time slots are used to carry customer services, and 20 bearer frames constitute a multiframe.
[0296] Figure 4y is a structural diagram of another bearer frame for carrying customer services provided in an embodiment of the present application. The third bearer frame structure is shown in Figure 4y (n=5), and the overhead byte length is 7 bytes, in the first D code block. The last byte in the first D code block, the 8 bytes in all subsequent D code blocks, and the last 7 bytes of the last T code block constitute the bearer area of the bearer frame, a total of 320*66 bits, which can carry 320 customer code blocks (each customer code block is 65 bits long). The bearer area can be divided into different time slot formats: such as 1 code block and 320 time slots per time slot, 2 code blocks and 160 time slots per time slot, 4 code blocks and 80 time slots per time slot, 8 code blocks and 40 time slots per time slot, and so on.
[0297] For the third bearer frame structure, when the client code block size is 2 code blocks, 2 code blocks per time slot and 160 time slots are used to carry customer services, and 3 bearer frames constitute a multiframe; when the client code block size is 4 code blocks, 4 code blocks per time slot and 80 time slots are used to carry customer services, and 6 bearer frames constitute a multiframe; when the client code block size is 8 code blocks, 8 code blocks per time slot and 40 time slots are used to carry customer services, and 12 bearer frames constitute a multiframe.
[0298] Figure 4z is a schematic diagram of the structure of another bearer frame for carrying customer services provided in an embodiment of the present application; Figure 5 is a schematic diagram of the structure of another bearer frame for carrying customer services provided in an embodiment of the present application; and Figure 6a is a schematic diagram of the structure of another bearer frame for carrying customer services provided in an embodiment of the present application. In the fifth, sixth, and seventh bearer frame structures described above, the overhead byte length is 7 bytes, and the overhead field is located in the first D code block. In specific applications, the overhead byte length can be other byte lengths, and the overhead bytes can be located anywhere in the frame. For example, if the frame structure has 6 overhead bytes and is carried in an S code block, the fifth frame structure changes from Figure 4w to Figure 4z, and Figure 4z also falls within the fifth frame structure category. Similarly, the sixth frame structure changes from Figure 4x to Figure 5, and Figure 5 also falls within the sixth frame structure category. The seventh frame structure changes from Figure 4y to Figure 6a, and Figure 6a also falls within the seventh frame structure category. Whether the overhead bytes are placed in the D code block or the S code block does not change the number of time slots or the time slot structure in the frame; both belong to the same frame structure category.
[0299] Figure 6b is another bearer frame structure provided by an embodiment of the present application. When the start code block carries overhead, the bearer frame includes 1 start code block, 494 data code blocks and 1 end code block.
[0300] The client code block is a 66-bit code block defined by Ethernet. In addition to being compressed into a 65-bit length to design a bearer frame, the bearer frame can also be designed after transcoding. For example, a 66-bit code block is transcoded into a 257-bit code block (4 66-bit code blocks are transcoded into a 257-bit code block), and the time slot length of the bearer frame is designed according to the 257 code block length. These are all within the scope of this patent.
[0301] Customer services are mapped into bearer frames and transmitted via them. When network intermediate devices forward bearer frames, clock skew between different devices can cause transmission speed discrepancies. To adjust the speed of intermediate devices, they insert appropriate idle blocks (I blocks) between transmitted bearer frames. When speed adjustment is required, intermediate devices add or remove appropriate idle blocks to achieve the desired speed. This requires the source device to insert a certain number of idle blocks between transmitted bearer frames. To facilitate recovery of the customer service clock frequency, the sink device needs to know the original distribution of idle blocks and how intermediate devices add or delete idle blocks. This requires that the idle blocks inserted between bearer frames by the source device when transmitting bearer frames must follow a certain distribution pattern. This way, regardless of how intermediate devices on the network add or delete idle blocks, the sink device can understand the idle block insertion pattern of the source device. If the actual received idle block distribution is inconsistent with the idle block distribution inserted when the source device transmits, it indicates that an intermediate device has added or deleted idle blocks. The sink device can then determine the original idle block distribution and facilitate recovery of the customer service clock. The idle block pattern inserted by the source device when transmitting bearer frames can be one of the following: 1. Inserting one idle block, or two, three, or other equal numbers of idle blocks between adjacent bearer frames (i.e., inserting a fixed number of idle blocks between adjacent bearer frames); 2. Inserting a fixed number of idle blocks between equal numbers of bearer frames. For example: n idle code blocks are inserted between every m bearer frames, where n and m are positive integers (i.e., a second fixed number of idle code blocks are inserted between every equal number of bearer frames); 3. A fixed number of idle code blocks are inserted in a multiframe period (i.e., a third fixed number of idle code blocks are inserted in a multiframe period). For example, a multiframe consists of m frames, and a total of n idle code blocks are inserted in the m frames of the multiframe. The n idle code blocks are distributed in the m bearer frames in the multiframe according to a certain pattern. For example, one idle code block is inserted between frame 1 and frame 2, 0 idle code blocks are inserted between frame 2 and frame 3, 0 idle code blocks are inserted between frame 3 and frame 4, and 1 idle code block is inserted between frame 4 and frame 5. Similarly, a corresponding number of idle code blocks are inserted between other frames according to the set pattern.
[0302] The source device maps the client service to the bearer frame, inserts an appropriate number of idle code blocks between the bearer frames according to a certain rule, and then sends it out (i.e., maps the target data to the bearer frame; inserts idle code blocks between the bearer frames according to the set rule; and transmits the bearer frame). After receiving the bearer frame, the destination device restores the original idle distribution according to the idle code block insertion rule of the source device, extracts the client service, and recovers the client service clock information (i.e., restores the idle code blocks between the bearer frames to the original idle distribution according to the set rule; extracts the target data from the bearer frame; and recovers the clock information of the target data based on the idle code blocks and the local clock).
[0303] This application selects the corresponding bearer time slot size according to the size of the customer code block to achieve the best bearing effect.
[0304] The above cases are several specific implementation methods of this application. The specific implementations have different forms and contents, such as arbitrarily combining various embodiments or omitting, replacing or adding the technical features included in each embodiment, but these changes are within the scope of protection of this application.
[0305] In an exemplary embodiment, the present application provides a transmission device that can be integrated into a communication node. FIG7 is a schematic structural diagram of a transmission device provided in an embodiment of the present application. Referring to FIG7 , the transmission device includes:
[0306] A first determining module 510 is configured to determine a frame structure of a bearer frame, wherein the bearer frame includes multiple code blocks, the bearer frame includes multiple time slots, the time slots support multiple time slot sizes, and one time slot size is used in the determined frame structure;
[0307] A second determining module 520 is configured to determine a frame structure of a multiframe including the bearer frame;
[0308] The mapping module 530 is configured to map target data to the bearer frame in the multiframe for transmission.
[0309] The transmission device provided in this embodiment is used to implement the transmission method of the embodiment shown in Figure 2. The implementation principle and technical effects of the transmission device provided in this embodiment are similar to those of the method of the embodiment shown in Figure 2, and are not described in detail here.
[0310] Based on the above embodiment, a modified embodiment of the above embodiment is proposed. It should be noted that, in order to simplify the description, only the differences from the above embodiment are described in the modified embodiment.
[0311] In one embodiment, the product of the time slot size in a bearer frame and the number of time slots in the bearer frame is fixed, and the product of the number of time slots in the bearer frame and the number of bearer frames in the multiframe is fixed.
[0312] In one embodiment, the code block includes a start code block, a data code block and an end code block, and the bearer frame includes an overhead field, which is carried in the data code block or the start code block or the end code block, and the overhead field indicates the number of the bearer frames in the multiframe and the position of the bearer frame in the multiframe.
[0313] In one embodiment, the overhead field is located in the first data code block in the data code block, the carrying area of the carrying frame includes data code blocks other than the first data code block, the area of the first data code block other than the area where the mapping overhead field is located, and the area of the end code block other than the area where the end block is located, and the target data is carried in the carrying area.
[0314] In one embodiment, the bearer area of the bearer frame includes the data code block, an area in the start code block excluding an area where the overhead field is located, and an area in the end code block excluding an area where the end block is located.
[0315] In one embodiment, the bearer frame satisfies one or more of the following conditions:
[0316] The number of code blocks included in the bearer area of the bearer frame is i times a first value, and the number of code blocks of the target data is i times a second value, where the first value is determined based on the length of the target data code block, and the second value is determined based on the length of the code block in the bearer area;
[0317] The number of time slots corresponding to the target data is a factor of the total number of time slots in the multiframe.
[0318] In one embodiment, the first value is the length of the target data code block, and the second value is the length of the bearer area code block; or
[0319] The first value is the length of the target data divided by a common divisor, and the second value is the length of the bearer area code block divided by a common divisor. The common divisor is the common divisor of the length of the target data and the length of the bearer area code block.
[0320] In one embodiment, the number of start code blocks is 1, the number of end code blocks is 1, the number of data code blocks is 198, the time slot size is x code blocks, the number of carrying frame time slots is y time slots, the product of x and y is 192, and both x and y are positive integers.
[0321] In one embodiment, the number of start code blocks is 1, the number of end code blocks is 1, the number of data code blocks is 330, the time slot size is x code blocks, the number of carrying frame time slots is y time slots, the product of x and y is 320, and both x and y are positive integers.
[0322] In one embodiment, the number of start code blocks is 1, the number of end code blocks is 1, the number of data code blocks is 495, the time slot size is x code blocks, the number of carrying frame time slots is y time slots, the product of x and y is 480, and both x and y are positive integers.
[0323] In one embodiment, the number of start code blocks is 1, the number of end code blocks is 1, the number of data code blocks is 990, the time slot size is x code blocks, the number of carrying frame time slots is y time slots, the product of x and y is 960, and both x and y are positive integers.
[0324] In one embodiment, the number of start code blocks is 1, the number of end code blocks is 1, the number of data code blocks is 195, the time slot size is x code blocks, the number of carrying frame time slots is y time slots, the product of x and y is 192, and both x and y are positive integers.
[0325] In one embodiment, the number of start code blocks is 1, the number of end code blocks is 1, the number of data code blocks is 65, the time slot size is x code blocks, the number of carrying frame time slots is y time slots, the product of x and y is 64, and both x and y are positive integers.
[0326] In one embodiment, the number of start code blocks is 1, the number of end code blocks is 1, the number of data code blocks is 195, the time slot size is x code blocks, the number of carrying frame time slots is y time slots, the product of x and y is 192, and both x and y are positive integers.
[0327] In one embodiment, the number of start code blocks is 1, the number of end code blocks is 1, the number of data code blocks is 325, the time slot size is x code blocks, the number of carrying frame time slots is y time slots, the product of x and y is 320, and both x and y are positive integers.
[0328] In one embodiment, the time slot size includes one or more of: 2 code blocks, 4 code blocks, and 8 code blocks.
[0329] In one embodiment, the code block length of the target data includes: 66 bits, 65 bits or 257 bits.
[0330] In one embodiment, the first determining module 510 is specifically configured to:
[0331] Determining a timeslot size used by the bearer frame;
[0332] The number of time slots in the bearer frame is determined.
[0333] In one embodiment, the second determining module 520 is configured to:
[0334] Determine the number of the bearer frames included in the multiframe.
[0335] The transmission device provided in this embodiment is used to implement the transmission method of the embodiment shown in FIG2 . The implementation principle and technical effects of the transmission device provided in this embodiment are similar to those of the transmission method of the embodiment shown in FIG2 , and are not described in detail here.
[0336] In one embodiment, mapping target data to the bearer frame in the multiframe for transmission includes:
[0337] Mapping the target data onto the bearer frame;
[0338] Inserting idle code blocks between the bearer frames according to a set rule;
[0339] The bearer frame is transmitted.
[0340] In one embodiment, the set rule includes one of the following:
[0341] Inserting a first fixed number of idle code blocks between adjacent bearer frames;
[0342] Inserting a second fixed number of idle code blocks between each equal number of bearer frames;
[0343] A third fixed number of idle code blocks are inserted into one multiframe period.
[0344] In an exemplary embodiment, the present application provides another transmission device, which can be integrated into a communication node. The transmission device of this embodiment can be located on the same communication node as the transmission device shown in Figure 7, or on a different communication node. Figure 8 is a schematic diagram of the structure of another transmission device provided in an embodiment of the present application. Referring to Figure 8, the transmission device includes:
[0345] An acquisition module 710 is configured to acquire target data carried in a time slot of a bearer frame according to a first time slot size, wherein the bearer frame includes multiple code blocks, the bearer frame includes multiple time slots, and the time slots support multiple time slot sizes;
[0346] The bearing module 720 is configured to carry the target data in a multiframe for transmission according to a second time slot size, where the first time slot size is not equal to the second time slot size.
[0347] Based on the above embodiment, a modified embodiment of the above embodiment is proposed. It should be noted that, in order to simplify the description, only the differences from the above embodiment are described in the modified embodiment.
[0348] In one embodiment, the acquisition module 710 is specifically configured to:
[0349] receiving a bearer frame carrying the target data;
[0350] According to a set rule, the idle code blocks between the bearer frames are restored to their original idle distribution state;
[0351] extracting the target data from the bearer frame according to a first time slot size;
[0352] Based on the idle code blocks and the local clock, clock information of the target data is recovered.
[0353] In one embodiment, the set rule includes one of the following:
[0354] Inserting a first fixed number of idle code blocks between adjacent bearer frames;
[0355] Inserting a second fixed number of idle code blocks between each equal number of bearer frames;
[0356] A third fixed number of idle code blocks are inserted into one multiframe period.
[0357] In one embodiment, the first time slot size is smaller than the second time slot size, and the carrier module 720 is specifically configured as follows:
[0358] The target data obtained in j time slots are spliced and carried in a multiframe for transmission, the time slot size of the spliced target data is a second time slot size, and j is a ratio of the second time slot size to the first time slot size.
[0359] In one embodiment, the first time slot size includes: 2 or 4, and the second time slot size includes: 4 or 8.
[0360] In one embodiment, the first time slot size is larger than the second time slot size, and the carrier module 720 is specifically configured as follows:
[0361] Splitting target data in one time slot into k target data of a second time slot size, where k is a ratio of the first time slot size to the second time slot size;
[0362] The split target data is carried in a multiframe for transmission.
[0363] In one embodiment, the first time slot size includes 4 or 8, and the second time slot size includes 2 or 4.
[0364] In an exemplary embodiment, the present application also provides a communication node. Figure 9 is a schematic diagram of the structure of a communication node provided in an embodiment of the present application. As shown in Figure 9, the communication node provided in the present application includes one or more processors 71 and a storage device 72. The processor 71 in the communication node can be one or more, and Figure 9 uses one processor 71 as an example. The storage device 72 is used to store one or more programs. The one or more programs are executed by the one or more processors 71, so that the one or more processors 71 implement the transmission method described in the embodiment of the present application.
[0365] The communication node further includes: a communication device 73 , an input device 74 and an output device 75 .
[0366] The processor 71 , storage device 72 , communication device 73 , input device 74 and output device 75 in the communication node may be connected via a bus or other means. FIG9 takes the bus connection as an example.
[0367] The input device 74 may be used to receive input digital or character information and generate key signal input related to user settings and function control of the communication node. The output device 75 may include a display device such as a display screen.
[0368] The communication device 73 may include a receiver and a transmitter. The communication device 73 is configured to perform information transmission and reception communication according to the control of the processor 71.
[0369] The storage device 72, as a computer-readable storage medium, can be configured to store software programs, computer executable programs, and modules, such as program instructions / modules corresponding to the transmission method described in the embodiment of the present application (for example, the request sending module 31, the receiving module 32, the first calculation module 33, the parameter sending module 34, and the second calculation module 37 in the transmission device). The storage device 72 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; and the data storage area may store data created according to the use of the communication node, etc. In addition, the storage device 72 may include a high-speed random access memory and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some instances, the storage device 72 may further include a memory remotely located relative to the processor 71, and these remote memories may be connected to the communication node via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.
[0370] The present application also provides a storage medium storing a computer program that, when executed by a processor, implements any of the methods described in the present application. The storage medium stores a computer program that, when executed by a processor, implements any of the transmission methods described in the present application. For example:
[0371] Determining a frame structure of a bearer frame, the bearer frame including multiple code blocks, the bearer frame including multiple time slots, the time slots supporting multiple time slot sizes, and using one time slot size in the determined frame structure;
[0372] determining a frame structure of a multiframe including the bearer frame;
[0373] Mapping target data to the bearer frame in the multiframe for transmission.
[0374] Transmission method, such as:
[0375] Acquire target data carried in a time slot of a bearer frame according to a first time slot size, the bearer frame including multiple code blocks, the bearer frame including multiple time slots, and the time slots supporting multiple time slot sizes;
[0376] The target data is carried in a multiframe and transmitted according to a second time slot size, and the first time slot size is not equal to the second time slot size.
[0377] The computer storage medium of the embodiment of the present application can adopt any combination of one or more computer-readable media.Computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium.Computer-readable storage medium can be, for example, but not limited to, a system, device or component of electricity, magnetism, light, electromagnetic, infrared, or semiconductor, or any combination thereof.More specific examples (non-exhaustive list) of computer-readable storage medium include: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM), a flash memory, an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof.Computer-readable storage medium can be any tangible medium containing or storing a program, which can be used by an instruction execution system, device or device or used in combination with it.
[0378] A computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such a propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium that can transmit, propagate, or transport a program for use by or in conjunction with an instruction execution system, apparatus, or device.
[0379] The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wire, optical cable, radio frequency (RF), etc., or any suitable combination of the foregoing.
[0380] The computer program code for performing the operations of the present application can be written in one or more programming languages or a combination thereof, including object-oriented programming languages such as Java, Smalltalk, C++, and conventional procedural programming languages such as "C" or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as an independent software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computer (e.g., using an Internet service provider to connect via the Internet).
[0381] The above description is merely an exemplary embodiment of the present application and is not intended to limit the scope of protection of the present application.
[0382] It will be appreciated by those skilled in the art that the term communication node encompasses any suitable type of wireless user equipment, such as a mobile phone, a portable data processing device, a portable web browser or a vehicle-mounted mobile station.
[0383] In general, various embodiments of the present application may be implemented in hardware or dedicated circuits, software, logic, or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software that can be executed by a controller, microprocessor, or other computing device, although the present application is not limited thereto.
[0384] Embodiments of the present application may be implemented by executing computer program instructions by a data processor of a mobile device, for example, in a processor entity, or by hardware, or by a combination of software and hardware. The computer program instructions may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages.
[0385] The block diagram of any logic flow in the drawings of the present application may represent program steps, or may represent interconnected logic circuits, modules and functions, or may represent a combination of program steps and logic circuits, modules and functions. A computer program may be stored on a memory. The memory may be of any type suitable for the local technical environment and may be implemented using any suitable data storage technology, such as, but not limited to, read-only memory (ROM), random access memory (RAM), optical storage devices and systems (digital versatile discs (DVD) or compact disks (CD)), etc. Computer-readable media may include non-transient storage media. A data processor may be of any type suitable for the local technical environment, such as, but not limited to, a general-purpose computer, a special-purpose computer, a microprocessor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), and a processor based on a multi-core processor architecture.
Claims
1. A transmission method, comprising: Determine a frame structure of a bearer frame, the bearer frame includes multiple code blocks, the bearer frame includes multiple time slots, the time slots support multiple time slot sizes, and one time slot size is used in the determined frame structure; Determining a frame structure of a multiframe including the bearer frame; The target data is mapped into the multiframe for transmission.
2. The method according to claim 1, wherein: The product of the time slot size in the bearer frame and the number of time slots in the bearer frame is fixed, and the product of the number of time slots in the bearer frame and the number of bearer frames in the multiframe is fixed.
3. The method according to claim 1, wherein: The multiple code blocks include a start code block, a data code block and an end code block, and the bearer frame includes an overhead field, which is carried in the data code block or the start code block or the end code block, and the overhead field indicates the number of the bearer frames in the multiframe and the position of the bearer frame in the multiframe.
4. The method according to claim 3, wherein: The overhead field is located in the first data code block in the data code block, the carrying area of the carrying frame includes data code blocks other than the first data code block, the area in the first data code block other than the area where the overhead field is mapped, and the area in the end code block other than the area where the end block is located, and the target data is carried in the carrying area.
5. The method according to claim 3, wherein: The bearing area of the bearing frame includes the data code block, the area in the start code block except the area where the overhead field is located, and the area in the end code block except the area where the end block is located.
6. The method according to claim 3, wherein: The bearer frame meets one or more of the following conditions: The number of code blocks included in the bearer area in the bearer frame is i times a first value, and the number of code blocks of the target data is i times a second value, the first value is determined based on the code blocks of the target data, and the second value is determined based on the code blocks of the bearer area; The number of time slots corresponding to the target data is a factor of the total number of time slots in the multiframe.
7. The method according to claim 6, wherein: The first value is the length of the code block of the target data, and the second value is the length of the code block of the bearing area; or, The first value is the length of the target data divided by a common divisor, and the second value is the length of the code block of the carrying area divided by a common divisor, and the common divisor is the common divisor of the length of the target data and the length of the code block of the carrying area.
8. The method according to claim 6, wherein: When the start code block does not carry overhead, the bearer frame includes 1 start code block, 198 data code blocks and 1 end code block, and the code block length of the target data is 66 bits; when the start code block carries overhead, the bearer frame includes 1 start code block, 197 data code blocks and 1 end code block, and the code block length of the target data is 66 bits.
9. The method according to claim 6, wherein: The time slot size is x code blocks, the number of time slots of the bearer frame is y time slots, the product of x and y is 192, and x and y are both positive integers.
10. The method according to claim 9, wherein: The time slot size is 2 code blocks, the number of time slots of the bearer frame is 96 time slots, and the multiframe is composed of 5 bearer frames; or, The time slot size is 4 code blocks, the number of time slots of the bearer frame is 48 time slots, and the multiframe is composed of 10 bearer frames; or, The time slot size is 8 code blocks, the number of time slots of the bearer frame is 24 time slots, and the multiframe is composed of the 20 bearer frames.
11. The method according to claim 6, wherein: In the case where the start code block does not carry overhead, the bearer frame includes 1 start code block, 330 data code blocks and 1 end code block, and the code block length of the target data is 66 bits; In the case where the start code block carries overhead, the bearer frame includes 1 start code block, 329 data code blocks and 1 end code block, and the code block length of the target data is 66 bits.
12. The method according to claim 11, wherein The time slot size is x code blocks, the number of time slots of the bearer frame is y time slots, the product of x and y is 320, and x and y are both positive integers.
13. The method according to claim 11, wherein: The time slot size is 2 code blocks, the number of time slots of the bearer frame is 160 time slots, and the multiframe is composed of 3 bearer frames; or, The time slot size is 4 code blocks, the number of time slots of the bearer frame is 80 time slots, and the multiframe is composed of 6 bearer frames; or, The time slot size is 8 code blocks, the number of time slots of the bearer frame is 40 time slots, and the multiframe is composed of the 12 bearer frames.
14. The method according to claim 6, wherein: In the case where the start code block does not carry overhead, the bearer frame includes 1 start code block, 495 data code blocks and 1 end code block; In the case where the start code block carries overhead, the bearer frame includes 1 start code block, 494 data code blocks and 1 end code block.
15. The method according to claim 14, wherein: The time slot size is x code blocks, the number of time slots of the bearer frame is y time slots, and the product of x and y is The product is 480, and both x and y are positive integers.
16. The method according to claim 15, wherein: The time slot size is 2 code blocks, the number of time slots of the bearer frame is 240 time slots, and the multiframe is composed of 2 bearer frames; or, The time slot size is 4 code blocks, the number of time slots of the bearer frame is 120 time slots, and the multiframe is composed of 4 bearer frames; or, The time slot size is 8 code blocks, the number of time slots of the bearer frame is 60 time slots, and the multiframe is composed of the 8 bearer frames.
17. The method according to claim 6, wherein: In the case where the start code block does not carry overhead, the bearer frame includes 1 start code block, 990 data code blocks and 1 end code block, and the code block length of the target data is 66 bits; In the case where the start code block carries overhead, the bearer frame includes 1 start code block, 989 data code blocks and 1 end code block, and the code block length of the target data is 66 bits.
18. The method according to claim 17, wherein: The time slot size is x code blocks, the number of time slots of the bearer frame is y time slots, the product of x and y is 960, and x and y are both positive integers.
19. The method according to claim 18, wherein: The time slot size is 2 code blocks, the number of time slots of the bearer frame is 480 time slots, and the multiframe consists of one bearer frame; or, The time slot size is 4 code blocks, the number of time slots of the bearer frame is 240 time slots, and the multiframe is composed of 2 bearer frames; or, The time slot size is 8 code blocks, the number of time slots of the bearing frame is 120 time slots, and the multiframe is composed of the 4 frames.
20. The method according to claim 6, wherein: In the case where the start code block does not carry overhead, the bearer frame includes 1 start code block, 65 data code blocks and 1 end code block, and the code block length of the target data is 65; In the case where the start code block carries overhead, the bearer frame includes 1 start code block, 64 data code blocks and 1 end code block, and the code block length of the target data is 65.
21. The method according to claim 20, wherein: The time slot size is x code blocks, the number of time slots of the bearer frame is y time slots, the product of x and y is 64, and x and y are both positive integers.
22. The method according to claim 21, wherein: The time slot size is 2 code blocks, the number of time slots of the bearer frame is 32 time slots, and the multiframe is composed of 15 bearer frames; or, The time slot size is 4 code blocks, the number of time slots of the bearer frame is 16 time slots, and the multiframe is composed of 30 bearer frames; or, The time slot size is 8 code blocks, the number of time slots of the bearer frame is 8 time slots, and the multiframe is composed of the 60 bearer frames.
23. The method according to claim 6, wherein: In the case where the start code block does not carry overhead, the bearer frame includes 1 start code block, 195 data code blocks and 1 end code block, and the code block length of the target data is 65; In the case where the start code block carries overhead, the bearer frame includes 1 start code block, 194 data code blocks and 1 end code block, and the code block length of the target data is 65.
24. The method according to claim 23, wherein: The time slot size is x code blocks, the number of time slots of the bearer frame is y time slots, the product of x and y is 192, and x and y are both positive integers.
25. The method according to claim 24, wherein: The time slot size is 2 code blocks, the number of time slots of the bearer frame is 96 time slots, and the multiframe is composed of 5 bearer frames; or, The time slot size is 4 code blocks, the number of time slots of the bearer frame is 48 time slots, and the multiframe is composed of 10 bearer frames; or, The time slot size is 8 code blocks, the number of time slots of the bearer frame is 24 time slots, and the multiframe is composed of the 20 bearer frames.
26. The method according to claim 6, wherein: In the case where the start code block does not carry overhead, the bearer frame includes 1 start code block, 325 data code blocks and 1 end code block, and the code block length of the target data is 65 code blocks; In the case where the start code block carries overhead, the bearer frame includes 1 start code block, 324 data code blocks and 1 end code block, and the code block length of the target data is 65 code blocks.
27. The method according to claim 26, wherein: The time slot size is x code blocks, the number of time slots of the bearer frame is y time slots, the product of x and y is 320, and x and y are both positive integers.
28. The method according to claim 27, wherein: The time slot size is 2 code blocks, the number of time slots of the bearer frame is 160 time slots, and the multiframe is composed of 3 bearer frames; or, The time slot size is 4 code blocks, the number of time slots of the bearer frame is 80 time slots, and the multiframe is composed of 6 bearer frames; or, The time slot size is 8 code blocks, the number of time slots of the bearer frame is 40 time slots, and the multiframe is composed of the 12 bearer frames.
29. The method of claim 1, wherein: Determining the frame structure of the bearer frame includes: Determining a time slot size used by the bearer frame; The number of time slots in the bearer frame is determined.
30. The method of claim 1, wherein: The determining of the frame structure of the multiframe including the bearer frame comprises: Determine the number of the bearer frames included in the multiframe.
31. The method of claim 1, wherein: Mapping the target data into the multiframe for transmission includes: Mapping the target data onto the bearer frame; Inserting idle code blocks between the bearer frames according to a set rule; The bearer frame is transmitted.
32. The method according to claim 31, wherein: The setting rule includes one of the following: Inserting a first fixed number of idle code blocks between adjacent bearer frames; Inserting a second fixed number of idle code blocks between each equal number of bearer frames; A third fixed number of idle code blocks are inserted into one multiframe period.
33. The method of claim 1, further comprising: Receiving a bearer frame carrying the target data; According to a set rule, the idle code blocks between the bearer frames are restored to the original idle distribution state; Extracting the target data from the bearer frame; Based on the idle code blocks and the local clock, clock information of the target data is recovered.
34. A transmission method, comprising: According to the first time slot size, target data carried in a time slot of a bearer frame is acquired, wherein the bearer frame includes multiple code blocks, the bearer frame includes multiple time slots, and the time slots support multiple time slot sizes; The target data is carried in a multiframe and transmitted according to a second time slot size, and the first time slot size is not equal to the second time slot size.
35. The method of claim 34, wherein: The first time slot size is smaller than the second time slot size, and the transmitting the target data in a multiframe according to the second time slot size includes: The target data acquired in j time slots are spliced and carried in the multiframe for transmission, the time slot size of the spliced target data is the second time slot size, and j is the ratio of the second time slot size to the first time slot size.
36. The method of claim 35, wherein: The first time slot size includes: 2 or 4, and the second time slot size is 4 or 8.
37. The method of claim 34, wherein: The first time slot size is larger than the second time slot size, and the transmitting the target data in a multiframe according to the second time slot size includes: Splitting target data in one time slot into k target data of the second time slot size, where k is a ratio of the first time slot size to the second time slot size; The split target data is carried in the multiframe for transmission.
38. The method of claim 37, wherein: The first time slot size is 4 or 8, and the second time slot size is 2 or 4.
39. A communication node, comprising: at least one processor; A storage device for storing at least one program; When the at least one program is executed by the at least one processor, the at least one processor implements the method according to any one of claims 1 to 38.
40. A storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the method according to any one of claims 1 to 38.
Citation Information
Patent Citations
FlexE low-speed service processing method and device
CN111917506A
Method and device for optimizing network delay in flexible Ethernet
CN115189811A
Data transmission method, communications device, and storage medium
US20200328767A1
Service data processing method and apparatus
US20210084383A1
Service processing method and service processing device
WO2022267882A1
