Gmp mapping opportunity calculation method for otn and readable storage medium

Abstract

The application relates to a GMP mapping opportunity calculation method for OTN and a readable storage medium. The method comprises the following steps: clearing memories ram(1) to ram(k) at the beginning of a service frame; k represents the number of a group of bytes; calculating remainders Remainder(1) to Remainder(k) of k bytes in parallel in a payload area; calculating mapping opportunities Map_opportunity(1) to Map_opportunity(k) corresponding to the k bytes in parallel according to the remainders Remainder(1) to Remainder(k) of the k bytes; and storing the corresponding remainders Remainder(1) to Remainder(k) into memories ram(1) to ram(k) respectively. The application realizes parallel calculation of mapping opportunities through byte remainders, and can realize mapping opportunity calculation of any byte through the storage and calling of the remainders. The GMP calculation requirement involved in OTN, DWM and DCI optical transmission equipment can adopt the method of the application, so as to reduce the calculation resource and required storage space.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of optical transport network communication technology, in particular to a GMP mapping opportunity calculation method for OTN and a readable storage medium. BACKGROUND

[0002] Human society has entered the information age, and the rapid development of Internet has brought about an information explosion. Fiber-optic communication has become the best solution to the bandwidth problem, and wavelength division multiplexing (WDM) technology combined with OTN technology has been widely used in long-haul backbone networks, metropolitan area networks and access networks.

[0003] With the development of 5G technology, the arrival of new technologies such as the Internet of Things, big data and cloud computing, the demand for data centers has increased dramatically, and the bandwidth of data center interconnection (DCI) is also increasing. The combination of wavelength division multiplexing (WDM) technology and OTN technology has become the mainstream of DCI optical transmission technology.

[0004] OTN (Optical Transport Network) is one of the important technologies for 5G construction and has been widely deployed in optical communication networks. Among them, GMP (General Mapping Procedure) mapping as the core technology of OTN interface circuit is the main means of processing business mapping to OTN and branch mapping to trunk.

[0005] The existing GMP mapping is to calculate the mapping process of data blocks and padding blocks by Sigma-delta algorithm according to the number of bytes to be mapped and the total number of payload bytes. Specifically, for any byte, the mapping opportunity is calculated to determine whether it belongs to a data block or a padding block. However, in the prior art, the product of the byte and the number of bytes to be mapped needs to be stored, and the product is called when calculating the mapping opportunity of other bytes. The data volume of the product of the byte and the number of bytes to be mapped is large, which leads to the problem of large required storage space and many computing resources in calculating the mapping opportunity in the prior art. Therefore, how to design a method that can reduce the required computing resources and required storage space in calculating the mapping opportunity is a technical problem to be solved. SUMMARY

[0006] In view of the above problems of the prior art, the technical problem to be solved by the present application is to provide a GMP mapping opportunity calculation method for OTN, which realizes parallel calculation of mapping opportunities by byte remainders, and realizes mapping opportunity calculation of any byte by storing and calling remainders, thereby reducing the required computing resources and required storage space in calculating the mapping opportunity, and providing a new idea for GMP mapping opportunity calculation.

[0007] In order to solve the above technical problems, the present application adopts the following technical solutions:

[0008] The GMP mapping opportunity calculation method for OTN comprises:

[0009] S1: at the beginning of the service frame, clear the memories ram(1)~ram(k); k represents the number of bytes;

[0010] S2: calculate the remainders Remainder(1)~Remainder(k) of k bytes in parallel in the payload area;

[0011] S3: according to the remainders Remainder(1)~Remainder(k) of k bytes, calculate the mapping opportunities Map_opportunity(1)~Map_opportunity(k) corresponding to k bytes in parallel;

[0012] S4: store the corresponding remainders Remainder(1)~Remainder(k) in the memories ram(1)~ram(k) respectively.

[0013] Preferably, it further comprises:

[0014] S5: in the remaining payload area, calculate the remainders Remainder(1+k)~Remainder(2k) of nodes 1+k to 2k in parallel according to the values of the memories ram(1)~ram(k);

[0015] S6: calculate the mapping opportunities Map_opportunity(1+k)~Map_opportunity(2k) corresponding to nodes 1+k to 2k according to the remainders Remainder(1+k)~Remainder(2k) of nodes 1+k to 2k;

[0016] S7: store the corresponding remainders Remainder(1+k)~Remainder(2k) in the memories ram(1)~ram(k) to overwrite the remainders Remainder(1)~Remainder(k).

[0017] Preferably, in step S2, the remainders are calculated by the following formula:

[0018] Remainder(x)=(x×C m )modP server ,1≤x≤P server , and x is an integer;

[0019] In the formula, Remainder(x) represents the remainder of byte x; C m represents the number of bytes to be mapped; and P serverRemainder(x) represents the remainder of byte x; x represents any byte; C

[0020] In step S5, the remainder of any byte is calculated by the following formula:

[0021] Remainder(x+k) = (Remainder(x) + k x C m ) mod P server ;

[0022] In the formula, Remainder(x+k) represents the remainder of byte x+k; Remainder(x) represents the remainder of byte x; x represents any byte; C m represents the number of effective bytes to be mapped; and P server represents the total number of payload bytes.

[0023] The mapping opportunity is calculated by the following formula:

[0024]

[0025] Map_opportunity(x) = 1 indicates a data block; and Map_opportunity(x) = 0 indicates a padding block.

[0026] In the formula, Map_opportunity(x) represents the mapping opportunity; Remainder(x) represents the remainder of byte x; x represents any byte; C m represents the number of effective bytes to be mapped; and P server represents the total number of payload bytes.

[0027] In a single clock cycle, the calculation amount of each byte is (ram(k) + k x C m ) mod P server , and the storage amount of the memory is Remainder(k).

[0028] When the effective payload area has j groups of k bytes, the maximum storage amount of the memory is still Remainder(k), and Remainder(k) < P server .

[0029] The application further discloses a readable storage medium, which stores a computer management program, and the computer management program is executed by a processor to realize the steps of the GMP mapping opportunity calculation method for OTN.

[0030] Compared with the prior art, the GMP mapping opportunity calculation method for OTN has the following beneficial effects:

[0031] The present application calculates the corresponding mapping opportunity by calculating the remainder of the byte, and the mapping opportunity of any byte can be calculated by storing and calling the remainder, and the remainder has a smaller data amount compared with the product of the byte and the number of effective bytes to be mapped in the prior art, so that the required storage space for calculating the mapping opportunity is smaller, and the required calculation resources for calculating the mapping opportunity by calling the remainder are less. Therefore, the present application can realize parallel calculation of the mapping opportunity by the byte remainder, and can realize calculation of the mapping opportunity of any byte by storing and calling the remainder, so as to reduce the required calculation resources and the required storage space for calculating the mapping opportunity, and provide a new idea for calculation of the GMP mapping opportunity. BRIEF DESCRIPTION OF DRAWINGS

[0032] In order to make the objectives, technical solutions and advantages of the present application clearer, the present application will be further described in detail below with reference to the accompanying drawings, in which:

[0033] Figure 1 is a flowchart of the prior art;

[0034] Figure 2 is a flowchart of the GMP mapping opportunity calculation method for OTN. DETAILED DESCRIPTION

[0035] In order to make the objectives, technical solutions and advantages of the present application clearer, the present application will be further described in detail below with reference to the accompanying drawings, in which:

[0036] It should be noted that similar reference numerals and letters refer to like items in the accompanying drawings, and once an item is defined in one drawing, it need not be further defined and explained in subsequent drawings. In the description of the application, it should be understood that the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inner", "outer", and the like, specify relative positions or orientations based on the positions or orientations shown in the drawings, or the positions or orientations in which the application products are usually placed during use, and are only used to facilitate the description of the application and simplify the description, and therefore cannot be understood as indicating or implying that the devices or elements referred to must have a particular orientation, be constructed and operated in a particular orientation, and therefore cannot be understood as limiting the application. In addition, the terms "first", "second", "third", and the like are only used to distinguish the description and cannot be understood as indicating or implying relative importance. In addition, the terms "horizontal", "vertical", and the like do not mean that the components must be absolutely horizontal or vertical, but can be slightly inclined. For example, "horizontal" only means that its direction is more horizontal relative to "vertical", and does not mean that the structure must be completely horizontal, but can be slightly inclined. In the description of the application, it should also be noted that unless otherwise specified and limited, the terms "provided", "mounted", "connected", "linked", and the like should be understood broadly, for example, can be fixedly connected, can be detachably connected, or integrally connected; can be mechanically connected, can be electrically connected; can be directly connected, or indirectly connected through an intermediate medium; can be internal communication of two elements. For those skilled in the art, the specific meanings of the above terms in the application can be understood according to the specific circumstances.

[0037] The specific embodiments are further described in detail below:

[0038] Embodiment one:

[0039] In the prior art, according to the ITU-T G.709 specification, GMP mapping is implemented using a Sigma-delta algorithm, and the standard formula of the algorithm is as follows:

[0040]

[0041] Where x is the number of available bearing byte positions in the ODU frame. Map_opportunity(x) = 1 indicates a data block, and Map_opportunity(x) = 0 indicates a padding block. And the following formula can be derived:

[0042]

[0043] Where 1≤x+n≤P server , and x, n are integers.

[0044] From the above two formulas, the mapping opportunity of any byte can be calculated, and Map_opportunity(x+n) can be calculated through Map_opportunity(x).

[0045] When calculating in FPGA, due to the particularity of the structure of FPGA, the method of accumulation needs to be used to realize multiplication, and the actual calculation method of k byte mapping opportunities in a single clock cycle parallel calculation is:

[0046] Combining Figure 1 As shown in the prior art, the steps of calculating the mapping opportunities of k (k>1) bytes in a single clock cycle are as follows:

[0047] 1. At the beginning of the service frame, clear the accumulation memories ram(1)~ram(k);

[0048] 2. At the beginning of the payload area, calculate Map_opportunity(1)~Map_opportunity(k) respectively, and store 1xC m ~kxC m in the accumulation registers ram(1)~ram(k) respectively;

[0049] 3. In the remaining payload area, calculate Map_opportunity(k+1)~Map_opportunity(2k) respectively, and accumulate ram(1)~ram(k) respectively (kxCm);

[0050] 4. In the payload area, repeat step 3 until the next service frame starts and jump to step 1.

[0051] In the prior art, when calculating the mapping opportunities of k (k>1) bytes in a single clock cycle, the calculation amount of each byte each time is (ram(k)+kxCm)modP server , and the calculation amount each time will also increase with the increase of ram(k). The storage amount of the accumulation register each time is (ram(k)+kxCm). Assuming that there are j groups of k bytes in the effective payload area, where j=P server ÷k, then the maximum calculation amount is (j×kxCm)modP server , and the maximum storage amount of the accumulation memory is j×kxCm=P server ×Cm.

[0052] For example, in 10*ODU2←→ODU4 mapping, the data bit width is 256 bits, and it is required to calculate the mapping opportunities 4 times in a single clock cycle, where the C m of each service branch is 14650, and P server= 15200. According to the formula, the single calculation amount is (ram(k) + 4 x 14650) mod 15200, k = 1, 2, 3, 4, wherein 0≤ram(k)≤222, 621, 400, and the maximum storage amount of the accumulation memory is 222, 680, 000.

[0053] It can be seen that the prior art has the problems of large required calculation resources and large required storage space.

[0054] In view of the above problems, the embodiment discloses a GMP mapping opportunity calculation method for OTN.

[0055] As shown in the formula, the GMP mapping opportunity calculation method for OTN comprises the following steps. Figure 2

[0056] S1: At the beginning of the service frame, clear the memories ram(1) to ram(k); k represents the number of groups of bytes;

[0057] S2: Calculate the remainders Remainder(1) to Remainder(k) of the k bytes in parallel in the payload area;

[0058] S3: Calculate the mapping opportunities Map_opportunity(1) to Map_opportunity(k) corresponding to the k bytes in parallel according to the remainders Remainder(1) to Remainder(k) of the k bytes;

[0059] S4: Store the corresponding remainders Remainder(1) to Remainder(k) in the memories ram(1) to ram(k) respectively.

[0060] S5: In the remaining payload area, calculate the remainders Remainder(1+k) to Remainder(2k) of the nodes 1+k to 2k in parallel according to the values of the memories ram(1) to ram(k);

[0061] S6: Calculate the mapping opportunities Map_opportunity(1+k) to Map_opportunity(2k) corresponding to the nodes 1+k to 2k according to the remainders Remainder(1+k) to Remainder(2k) of the nodes 1+k to 2k;

[0062] S7: Store the corresponding remainders Remainder(1+k) to Remainder(2k) in the memories ram(1) to ram(k) to overwrite the remainders Remainder(1) to Remainder(k).

[0063] ​It should be noted that the GMP mapping opportunity calculation method of the present application can generate corresponding software code or software service through program programming, and then can be run and implemented on a server and a computer.

[0064] In this embodiment, steps S1 to S4 are to perform mapping opportunity calculation of the first group of bytes.

[0065] When there are multiple groups of bytes, the parallel calculation of mapping opportunities can be realized by referring to the method of steps S5 to S7: the remainder of the second group of bytes is calculated through the remainder of the first group of bytes stored in the memory, and then the mapping opportunity of the second group of bytes is calculated through the remainder of the second group of bytes, and the remainder of the second group of bytes is stored in the memory to overwrite the remainder of the first group of bytes. Similarly, the remainder and mapping opportunity of the third group of bytes can be calculated through the remainder of the second group of bytes stored in the memory, and the remainder and mapping opportunity of the fourth group of bytes can be calculated through the remainder of the third group of bytes stored in the memory.

[0066] The present application calculates the corresponding mapping opportunity by calculating the remainder of the byte, which can realize the parallel calculation of the mapping opportunity through the byte remainder, thereby improving the calculation efficiency of the mapping opportunity. At the same time, the present application stores the remainder corresponding to the mapping opportunity, and when calculating the mapping opportunity of multiple groups of bytes, the remainder stored in the memory is called to calculate the mapping opportunity of any other byte, and the remainder corresponding to the mapping opportunity is stored and overwrites the remainder of the previous group of bytes, that is, the mapping opportunity calculation of any byte can be realized through the storage and calling of the remainder. Compared with the product of the byte and the number of effective bytes to be mapped in the prior art, the remainder has a smaller data amount, so that the required storage space for calculating the mapping opportunity is smaller, and the required calculation resources for calling the remainder for mapping opportunity calculation are less. Therefore, the present application can realize the parallel calculation of the mapping opportunity through the byte remainder, and can realize the mapping opportunity calculation of any byte through the storage and calling of the remainder, thereby reducing the required calculation resources and the required storage space for calculating the mapping opportunity, and providing a new idea for the calculation of GMP mapping opportunity.

[0067] In the specific implementation process, the remainder is calculated by the following formula:

[0068] Remainder(x)=(x×C m )modP server ,1≤x≤P server , and x is an integer;

[0069] In the formula, Remainder(x) represents the remainder of byte x; C m represents the number of effective bytes to be mapped; P server represents the total number of payload bytes; and x represents any byte.

[0070] For any byte, the remainder is calculated using the following formula:

[0071] Remainder(x+n)=((x+n)×C m )modP server ;

[0072] =(x×C) m +n×C m )modP server ;

[0073] =((x×C) m )modP server +(n×C m )modP server )modP server ;

[0074] =(Remainder(x)+n×Remainder(1))modP server ;

[0075] =(Remainder(x)+n×C) m )modP server ;

[0076] That is, Remainder(x+k)=(Remainder(x)+k×C m )mod P server ;

[0077] In the formula: Remainder(x+k) represents the remainder of byte x+k; Remainder(x) represents the remainder of byte x; x represents any byte; C m Indicates the number of valid bytes to be mapped; P server This indicates the total number of net payload bytes.

[0078] The mapping opportunity is calculated using the following formula:

[0079]

[0080] Where Map_opportunity(x) = 1 indicates a data block; Map_opportunity(x) = 0 indicates a fill block;

[0081] In the formula: Map_opportunity(x) represents the mapping opportunity; Remainder(x) represents the remainder of byte x; x represents any byte; C m Indicates the number of valid bytes to be mapped; P server This indicates the total number of net payload bytes.

[0082] The present invention can effectively realize parallel computation of mapping opportunities by byte remainder through the above formula, and can realize the computation of mapping opportunities of any byte by storing and calling the remainder, thereby reducing the computational resources and storage space required to compute mapping opportunities.

[0083] In practical implementation, when calculating the mapping opportunities of k bytes within a single clock cycle, the computation amount for each byte per operation is (ram(k) + k × C). m )modP server Each time, the amount of memory stored is Remainder(k).

[0084] When the payload region contains j groups of k bytes, the maximum storage capacity of the memory is still Remainder(k), and Remainder(k) <P server Therefore, the maximum storage requirement for each byte is no more than P. server .

[0085] For example, in a 10*ODU2←→ODU4 mapping, the data width is 256 bits, and it is required to calculate 4 mapping opportunities within a single clock cycle, where the C of each service branch is... m =14650, P server =15200. According to the formula, the amount of calculation in a single operation is (ram(k) + 4 × 14650) mod 15200, k = 1, 2, 3, 4, where 0 ≤ ram(k) ≤ 15200. The maximum storage capacity of the accumulator is 15200.

[0086] This invention calculates the corresponding mapping opportunity by calculating the remainder of bytes, enabling parallel computation of mapping opportunities through byte remainders, thereby improving the computational efficiency of mapping opportunities. Simultaneously, this invention stores the remainders corresponding to mapping opportunities, and when calculating mapping opportunities for multiple sets of bytes, it can call the remainders stored in memory to calculate mapping opportunities for other arbitrary bytes, storing the remainders corresponding to the mapping opportunities and overwriting the remainders of the previous set of bytes. In other words, it can achieve the calculation of mapping opportunities for arbitrary bytes by storing and calling remainders. Compared to the product of bytes and the number of valid bytes to be mapped in existing technologies, the remainders have a smaller data volume, resulting in less storage space required for calculating mapping opportunities and less computational resources required when calling remainders to calculate mapping opportunities.

[0087] Example 2:

[0088] This embodiment discloses a readable storage medium storing a computer management program, which, when executed by a processor, implements the steps of the GMP mapping opportunity calculation method for OTN of the present invention.

[0089] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention and not to limit the technical solutions. Those skilled in the art should understand that any modifications or equivalent substitutions to the technical solutions of the present invention without departing from the spirit and scope of the present invention should be covered within the scope of the claims of the present invention.

Claims

1. A method for GMP mapping opportunity calculation for OTN, characterized in that, Comprising: S1: at the beginning of the service frame, clear the memory ram(1)~ram(k); k represents the number of bytes; S2: in the payload area, calculate the remainders Remainder(1)~Remainder(k) of k bytes in parallel; S3: according to the remainders Remainder(1)~Remainder(k) of k bytes, calculate the mapping opportunities Map_opportunity(1)~Map_opportunity(k) corresponding to k bytes in parallel; S4: store the corresponding remainders Remainder(1)~Remainder(k) into the memories ram(1)~ram(k) respectively.

2. The method for calculating GMP mapping opportunities for OTN according to claim 1, wherein, Also comprising: S5: in the remaining payload area, according to the values of the memories ram(1)~ram(k), calculate the remainders Remainder(1+k)~Remainder(2k) of nodes 1+k to 2k in parallel; S6: according to the remainders Remainder(1+k)~Remainder(2k) of nodes 1+k to 2k, calculate the mapping opportunities Map_opportunity(1+k)~Map_opportunity(2k) corresponding to nodes 1+k to 2k; S7: store the corresponding remainders Remainder(1+k)~Remainder(2k) into the memories ram(1)~ram(k) to overwrite the remainders Remainder(1)~Remainder(k).

3. The method for GMP mapping opportunity calculation for OTN of claim 1, wherein, In step S2, the remainders are calculated by the following formula: Remainder(x) = (x x C m ) mod P server , 1 < x < P server , and x is an integer; wherein: Remainder(x) represents the remainder of byte x; C m represents the number of valid bytes to be mapped; P server represents the total number of payload bytes; x represents any byte.

4. The method for calculating GMP mapping opportunities for OTN of claim 1, wherein, In step S4, the remainder of any byte is calculated by the following formula: Remainder(x+k) = (Remainder(x) + k x C m ) mod P server ; wherein: Remainder(x+k) represents the remainder of byte x+k; Remainder(x) represents the remainder of byte x; x represents any byte; C m represents the number of valid bytes to be mapped; P server represents the total number of payload bytes.

5. The method for GMP mapping opportunity calculation for OTN of claim 1, wherein, The mapping opportunity is calculated by the following formula: Map_opportunity(x)=1 indicates a data block; Map_opportunity(x)=0 indicates a padding block; where: Map_opportunity(x) represents a mapping opportunity; Remainder(x) represents a remainder of byte x; x represents an arbitrary byte; C m represents the number of valid bytes to be mapped; P server represents the total number of payload bytes.

6. The method for GMP mapping opportunity calculation for OTN of claim 1, wherein: When k bytes are mapped in one clock cycle, the calculation amount of each byte is (ram(k)+k×C m )mod P server , and the storage amount of each memory is Remainder(k); C m represents the number of valid bytes to be mapped; P server represents the total number of payload bytes.

7. The method for GMP mapping opportunity calculation for OTN of claim 6, wherein: When the payload area shares j groups of k bytes, the maximum storage of the memory is still Remainder(k), and Remainder(k) < P server .

8. A readable storage medium, characterized by, A computer program is stored thereon, which is executed by a processor to implement the steps of the GMP mapping opportunity calculation method for OTN according to any one of claims 1-7. A computer program is stored thereon, which is executed by a processor to implement the steps of the GMP mapping opportunity calculation method for OTN according to any one of claims 1-7.

Images