A method for uniformly allocating time slots in a time-sharing processing system and a readable storage medium

Abstract

The present invention relates to the technical field of optical transport network (OTN), and in particular to a method for uniformly allocating time slots of a time-sharing processing system and a readable storage medium. The method comprises: obtaining the bit rate of the current service and the clock frequency of the time-sharing processing system; calculating the rate at which the time-sharing processing system processes the current service based on the bit rate of the current service in combination with the bit width when the time-sharing processing system processes the current service; calculating the number of time slots required for the service of the current service and the number of processing time slots of the time-sharing processing system in combination with the clock frequency of the time-sharing processing system; calculating the processing time slot positions corresponding to the time slots required for the service of the current service, and uniformly allocating the time slots required for all services of the current service to the processing time slots of the time-sharing processing system. The present invention can effectively solve the time slot allocation problem when the number of time slots required for the service is not an integer, and can achieve uniform allocation of service processing time slots of any service rate.

Description

Technical Field

[0001] The present invention relates to the technical field of optical transmission network communication, and in particular to a time slot uniform allocation method for a time-sharing processing system and a readable storage medium. Background Art

[0002] When a Field Programmable Gate Array (FPGA) is required to process optical channel transport unit (OTUk) service signals of multiple rates, a time-sharing processing system is used to process multiple OTUk service signals to reduce the FPGA resource usage.

[0003] The time-sharing processing system divides time into a series of time segments, each of which is called a processing time slot, and each processing time slot only processes one type of service. The allocation of processing time slots actually has two meanings: one is the allocation of the number of time slots required for the service, and the other is the allocation of time slot positions. The allocation of the number of time slots required for the service is the number of time slots allocated to each service. The data rate of the service determines the number of time slots required for the service allocated to this service. The time slot position allocation is the specific position distribution of the processing time slots allocated to the service required time slots in the time-sharing processing system processing time slots.

[0004] In the optical transport network (OTN) equipment, the number of time slots required for time-sharing processing of OTUk services must match the speed of OTUk, and the number of time slots required for each OTUk service must be accurately calculated. The location distribution of processing time slots will affect the service delay and delay jitter performance to a certain extent. In the time-sharing processing system, in order to reduce service processing delay and service delay jitter, it is required to reduce the cache depth and try to evenly distribute the processing time slots of the time-sharing processing system to each OTUk service signal.

[0005] The method for uniformly allocating time slots in the existing time-sharing processing system is as follows: first, the processing time slots of the time-sharing processing system are divided into multiple processing cycles; then, the number of time slots required for the service is calculated according to the service rate; finally, the processing time slots in the corresponding processing cycle are allocated to the corresponding service according to the relationship between the number of time slots required for the service and the number of processing cycles. However, the existing scheme mainly has the following problems: 1) It cannot be accurately allocated when the number of time slots required for the service is non-integer. The number of time slots required for the service calculated by some service rates may be a non-integer value. At this time, the number of time slots cannot be accurately allocated to this service, resulting in poor effectiveness of service processing time slot allocation. 2) Non-uniform allocation of processing time slots. When the number of time slots required for the service corresponding to the service rate is not an integer multiple of the processing cycle, the required time slots are not evenly allocated, but only when the number of time slots required for the service is an integer multiple of the processing cycle, they are evenly allocated, resulting in insufficient versatility of service processing time slot allocation. Therefore, how to design a method that can improve the effectiveness and versatility of service processing time slot allocation is a technical problem that needs to be solved urgently. Summary of the invention

[0006] In view of the deficiencies of the above-mentioned prior art, the technical problem to be solved by the present invention is: how to provide a method for uniformly allocating time slots in a time-sharing processing system, which can effectively solve the time slot allocation problem when the number of time slots required for the service is not an integer, and can achieve uniform allocation of service processing time slots for any service rate, thereby improving the effectiveness and versatility of service processing time slot allocation, and providing a new idea for uniform allocation of time slots in a time-sharing processing system.

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

[0008] A method for uniformly allocating time slots in a time-sharing processing system, comprising:

[0009] S1: Obtain the bit rate of the current service and the clock frequency of the time-sharing processing system;

[0010] S2: Calculate the rate at which the time-sharing processing system processes the current service based on the bit rate of the current service and the bit width of the time-sharing processing system when processing the current service;

[0011] S3: Calculate the number of time slots required for the current service and the number of time slots processed by the time-sharing processing system according to the rate at which the time-sharing processing system processes the current service and the clock frequency of the time-sharing processing system;

[0012] The calculated number of time slots required for the service and the number of processing time slots are integers;

[0013] S4: Calculate the processing time slot position corresponding to the service required time slot of the current service based on the number of service required time slots of the current service and the number of processing time slots of the time-sharing processing system, and evenly distribute all service required time slots of the current service to the processing time slots of the time-sharing processing system.

[0014] Preferably, in step S2, the rate at which the time-sharing processing system processes the current business is calculated by the following formula:

[0015]

[0016] Where: Indicates the rate at which the time-sharing processing system processes the current business n; represents the bit rate of the current service n; W service Indicates the bit width of the time-sharing processing system processing the current business n times.

[0017] Preferably, in step S3, the number of time slots required for the current service is calculated by the following formula:

[0018]

[0019] Where: Slot_num n Indicates the number of time slots required for the current service n; Indicates the rate at which the time-sharing processing system processes the current business n; f system Indicates the clock frequency of the time-sharing processing system; (f system ,f service ) indicates f system and f service The greatest common factor of .

[0020] Preferably, in step S3, the number of processing time slots of the time-sharing processing system is calculated by the following formula:

[0021]

[0022] Where: Slot_Period n Indicates the number of processing time slots of the time-sharing processing system for processing the current business n times; Indicates the rate at which the time-sharing processing system processes the current business n; f system Indicates the clock frequency of the time-sharing processing system; (f system ,f service ) indicates f system and f service The greatest common factor of .

[0023] Preferably, in step S4, all time slots required for the current service are sequentially allocated to corresponding processing time slots of the time-sharing processing system until the allocation of all time slots required for the current service is completed;

[0024] When allocating the time slot required for a service to the current processing time slot of the time-sharing processing system: first, calculate the position identifier of the current processing time slot by the number of time slots required for the current service and the number of processing time slots of the time-sharing processing system; then, determine whether the current processing time slot is the time slot required for the current service based on the position identifier of the current processing time slot.

[0025] Preferably, the position identifier of the current processing time slot is calculated by the following formula:

[0026] R(m+1)=(R(m)+m*Slot_num n )modSlot_Period n ;

[0027] Among them, 0≤m<(Slot Period n -2), and R(0)=0;

[0028] Where: R(m) represents the position identifier of the current processing time slot m; Slot_Period n Indicates the number of processing time slots for the time-sharing processing system to process the current business n times; SLot_num n Indicates the number of time slots required for the current service n; mod indicates performing a modulo operation.

[0029] Preferably, whether the current processing time slot is used as the service required time slot of the current service is determined by the following formula:

[0030]

[0031] Where, 0≤m<(Slot_Period n -1);

[0032] Wherein: S(m)=1, indicating that the mth processing time slot is the required processing time slot for the current service n; S(m)=0, indicating that the mth processing time slot is not the required processing time slot for the current service n.

[0033] The present invention also discloses a readable storage medium on which a computer management program is stored. When the computer management program is executed by a processor, the steps of the method for uniformly allocating time slots of a time-sharing processing system of the present invention are implemented.

[0034] Compared with the prior art, the time slot uniform allocation method of the time-sharing processing system in the present invention has the following beneficial effects:

[0035] The present invention calculates the rate at which a time-sharing processing system processes the current service based on the bit rate of the current service combined with the bit width when the time-sharing processing system processes the current service, and then calculates the number of time slots required for the current service and the number of processing time slots of the time-sharing processing system in combination with the clock frequency of the time-sharing processing system, and finally evenly distributes the time slots required for the current service to the processing time slots of the time-sharing processing system. On the one hand, the number of time slots required for the service and the number of processing time slots calculated by the present invention are integers, which can effectively solve the allocation problem when the number of time slots required for service processing is not an integer, and the integer number of time slots required and the number of processing time slots can better realize the uniform allocation of service processing time slots, thereby improving the effectiveness of service processing time slot allocation; on the other hand, the present invention calculates the number of time slots required for the service and the number of processing time slots based on the bit rate of the service in combination with the clock frequency of the time-sharing processing system, which can realize accurate allocation of the number of time slots required for the service and the number of processing time slots for any service rate, thereby realizing the uniform allocation of all the time slots required for the current service to the processing time slots of the time-sharing processing system, that is, it can better realize the uniform allocation of service processing time slots for any service bit rate, thereby improving the versatility of service processing time slot allocation, and providing a new idea for the uniform allocation of time slots in the time-sharing processing system. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] In order to make the purpose, technical solution and advantages of the invention more clear, the present invention will be further described in detail below with reference to the accompanying drawings, in which:

[0037] Figure 1 The logical block diagram of the method for uniformly allocating time slots in a time-sharing processing system. DETAILED DESCRIPTION

[0038] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. The components of the embodiments of the present invention generally described and shown in the drawings here can be arranged and designed in various different configurations. Therefore, the following detailed description of the embodiments of the present invention provided in the drawings is not intended to limit the scope of the claimed invention, but only represents selected embodiments of the present invention. Based on the embodiments in the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work belong to the scope of protection of the present invention.

[0039] It should be noted that similar numbers and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in the subsequent drawings. In the description of the present invention, it should be noted that the orientation or position relationship indicated by the terms "center", "upper", "lower", "left", "right", "vertical", "horizontal", "inside", "outside", etc. is based on the orientation or position relationship shown in the drawings, or the orientation or position relationship in which the invention product is usually placed when used, which is only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as a limitation of the present invention. In addition, the terms "first", "second", "third", etc. are only used to distinguish the description, and cannot be understood as indicating or implying relative importance. In addition, the terms "horizontal", "vertical", etc. do not mean that the components are required to be absolutely horizontal or suspended, but can be slightly tilted. For example, "horizontal" only means that its direction is more horizontal than "vertical", and does not mean that the structure must be completely horizontal, but can be slightly tilted. In the description of the present invention, it is also necessary to explain that, unless otherwise clearly specified and limited, the terms "set", "install", "connect", and "connect" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection, or it can be indirectly connected through an intermediate medium, or it can be the internal communication of two elements. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to specific circumstances.

[0040] The following is a further detailed description through specific implementation methods:

[0041] Embodiment 1:

[0042] This embodiment discloses a method for uniformly allocating time slots in a time-sharing processing system.

[0043] like Figure 1 As shown, the time slot uniform allocation method of the time-sharing processing system includes:

[0044] S1: Obtain the bit rate of the current service and the clock frequency of the time-sharing processing system;

[0045] S2: Calculate the rate at which the time-sharing processing system processes the current service based on the bit rate of the current service and the bit width of the time-sharing processing system when processing the current service;

[0046] S3: Calculate the number of time slots required for the current service and the number of time slots processed by the time-sharing processing system according to the rate at which the time-sharing processing system processes the current service and the clock frequency of the time-sharing processing system;

[0047] The calculated number of time slots required for the service and the number of processing time slots are integers;

[0048] S4: Calculate the processing time slot position corresponding to the service required time slot of the current service based on the number of service required time slots of the current service and the number of processing time slots of the time-sharing processing system, and evenly distribute all service required time slots of the current service to the processing time slots of the time-sharing processing system.

[0049] It should be noted that the method for uniformly allocating time slots in the time-sharing processing system of the present invention can generate corresponding software codes or software services through program programming, and can then be run and implemented on servers and computers.

[0050] In this embodiment, the proposed time slot uniform allocation method for a time-sharing processing system is mainly applied to service processing time slot allocation when a field programmable gate array (FPGA) processes optical channel transport unit (OTUk) service signals of multiple rates.

[0051] The present invention calculates the rate at which a time-sharing processing system processes the current service based on the bit rate of the current service combined with the bit width when the time-sharing processing system processes the current service, and then calculates the number of time slots required for the current service and the number of processing time slots of the time-sharing processing system in combination with the clock frequency of the time-sharing processing system, and finally evenly distributes the time slots required for the current service to the processing time slots of the time-sharing processing system. On the one hand, the number of time slots required for the service and the number of processing time slots calculated by the present invention are integers, which can effectively solve the allocation problem when the number of time slots required for service processing is not an integer, and the integer number of time slots required and the number of processing time slots can better realize the uniform allocation of service processing time slots, thereby improving the effectiveness of service processing time slot allocation; on the other hand, the present invention calculates the number of time slots required for the service and the number of processing time slots based on the bit rate of the service in combination with the clock frequency of the time-sharing processing system, which can realize accurate allocation of the number of time slots required for the service and the number of processing time slots for any service rate, thereby realizing the uniform allocation of all the time slots required for the current service to the processing time slots of the time-sharing processing system, that is, it can better realize the uniform allocation of service processing time slots for any service bit rate, thereby improving the versatility of service processing time slot allocation, and providing a new idea for the uniform allocation of time slots in the time-sharing processing system.

[0052] During the specific implementation process, in the OTN field, according to the G.709 specification formulated by the ITU-T standards organization, the ODUk service rate is given in the form of a fraction, as shown in Table 1 below.

[0053] Table 1 Service Rate

[0054]

[0055] The rate at which the time-sharing processing system processes the current business is calculated using the following formula:

[0056]

[0057]

[0058] Where: Indicates the rate at which the time-sharing processing system processes the current business n; represents the bit rate of the current service n; W service Indicates the bit width of the time-sharing processing system processing the current business n times.

[0059] The number of time slots required for the current service is calculated using the following formula:

[0060]

[0061] Where: Slot_num n Indicates the number of time slots required for the current service n; Indicates the rate at which the time-sharing processing system processes the current business n; f system Indicates the clock frequency of the time-sharing processing system; (f system ,f service ) indicates f system and f service The greatest common factor of .

[0062] The number of processing time slots in a time-sharing processing system is calculated using the following formula:

[0063]

[0064] Where: Slot_Period n Indicates the number of processing time slots of the time-sharing processing system for processing the current business n times; Indicates the rate at which the time-sharing processing system processes the current business n; f system Indicates the clock frequency of the time-sharing processing system; (f system ,f servi ) indicates f system and f service The greatest common factor of .

[0065] Through the above-mentioned calculation formula and calculation method, the present invention can make the calculated number of time slots required for the service and the number of processing time slots integers, thereby effectively solving the allocation problem when the number of time slots required for service processing is not an integer, and the integer required number of time slots and the number of processing time slots can better achieve the uniform allocation of service processing time slots, thereby further improving the effectiveness and versatility of service processing time slot allocation.

[0066] In the specific implementation process, all the time slots required by the current service are allocated to the corresponding processing time slots of the time-sharing processing system in turn until the allocation of all the time slots required by the current service is completed;

[0067] Among them, when allocating the time slot required for the service to the current processing time slot of the time-sharing processing system: first, the position identifier of the current processing time slot is calculated by the number of time slots required for the service of the current service and the number of processing time slots of the time-sharing processing system; then, according to the position identifier of the current processing time slot, it is determined whether the current processing time slot is the time slot required for the service of the current service.

[0068] The position identifier of the current processing time slot is calculated using the following formula:

[0069] R(m+1)=(R(m)+m*Slot_num n )modSlot_Period n ;

[0070] Among them, 0≤m<(Slot Period n -2), and R(0)=0;

[0071] Where: R(m) represents the position identifier of the current processing time slot m; Slot_Period n Indicates the number of processing time slots for the time-sharing processing system to process the current business n times; SLot_num n Indicates the number of time slots required for the current service n; mod indicates performing a modulo operation.

[0072] The following formula is used to determine whether the current processing time slot is the time slot required by the current service:

[0073]

[0074] Where, 0≤m<(Slot_Period n -1);

[0075] Wherein: S(m)=1, indicating that the mth processing time slot is the required processing time slot for the current service n; S(m)=0, indicating that the mth processing time slot is not the required processing time slot for the current service n.

[0076] The present invention calculates the number of time slots required for a service and the number of processing time slots based on the bit rate of the service in combination with the clock frequency of the time-sharing processing system, and the above-mentioned calculation formula and calculation method can realize accurate allocation of the number of time slots required for a service and the number of processing time slots for any service rate, thereby realizing uniform allocation of all the time slots required for the current service to the processing time slots of the time-sharing processing system, that is, it can better realize uniform allocation of service processing time slots for any service bit rate, thereby further improving the versatility of service processing time slot allocation.

[0077] Embodiment 2:

[0078] This embodiment discloses a readable storage medium.

[0079] A readable storage medium stores a computer management program, which, when executed by a processor, implements the steps of the method for uniformly allocating time slots in a time-sharing processing system of the present invention. The readable storage medium may be a device with a readable storage function such as a USB disk or a computer.

[0080] Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present invention rather than to limit the technical solution. Those skilled in the art should understand that those modifications or equivalent substitutions of the technical solution of the present invention that do not depart from the purpose and scope of the technical solution should be included in the scope of the claims of the present invention.

Claims

1. A method for uniformly allocating time slots in a time-sharing processing system, characterized in that: include: S1: Obtain the bit rate of the current service and the clock frequency of the time-sharing processing system; S2: Calculate the rate at which the time-sharing processing system processes the current service based on the bit rate of the current service and the bit width of the time-sharing processing system when processing the current service; In step S2, the rate at which the time-sharing processing system processes the current business is calculated using the following formula: Where: Indicates the rate at which the time-sharing processing system processes the current business n; represents the bit rate of the current service n; W service Indicates the bit width of the time-sharing processing system processing the current business n times; S3: Calculate the number of time slots required for the current service and the number of time slots processed by the time-sharing processing system according to the rate at which the time-sharing processing system processes the current service and the clock frequency of the time-sharing processing system; wherein the calculated number of time slots required for the service and the number of time slots processed are integers; In step S3, the number of time slots required for the current service is calculated using the following formula: Where: Slot_num n Indicates the number of time slots required for the current service n; f system Indicates the clock frequency of the time-sharing processing system; represents f system and The greatest common factor of ; In step S3, the number of processing time slots of the time-sharing processing system is calculated by the following formula: Where: Slot_Period n Indicates the number of processing time slots of the time-sharing processing system for processing the current business n times; S4: Calculate the processing time slot position corresponding to the service required time slot of the current service based on the number of service required time slots of the current service and the number of processing time slots of the time-sharing processing system, and evenly distribute all service required time slots of the current service to the processing time slots of the time-sharing processing system.

2. The method for uniformly allocating time slots in a time-sharing processing system as claimed in claim 1, characterized in that: In step S4, all the time slots required for the current service are sequentially allocated to the corresponding processing time slots of the time-sharing processing system until the allocation of all the time slots required for the current service is completed; When allocating the time slot required for a service to the current processing time slot of the time-sharing processing system: first, calculate the position identifier of the current processing time slot by the number of time slots required for the current service and the number of processing time slots of the time-sharing processing system; then, determine whether the current processing time slot is the time slot required for the current service based on the position identifier of the current processing time slot.

3. The method for uniformly allocating time slots in a time-sharing processing system as claimed in claim 2, characterized in that: The position identifier of the current processing time slot is calculated using the following formula: R(m+1)=(R(m)+m*Slot_num n )mod Slot_Period n ; Among them, 0≤m<(Slot Period n -2), and R(0)=0; Where: R(m) represents the position identifier of the current processing time slot m; Slot_Period n Indicates the number of processing time slots for the time-sharing processing system to process the current business n times; Slot_num n Indicates the number of time slots required for the current service n; mod indicates performing a modulo operation.

4. The method for uniformly allocating time slots in a time-sharing processing system as claimed in claim 3, characterized in that: The following formula is used to determine whether the current processing time slot is the time slot required by the current service: Where, 0≤m<(Slot_Period n -1); Wherein: S(m)=1, indicating that the mth processing time slot is the required processing time slot for the current service n; S(m)=0, indicating that the mth processing time slot is not the required processing time slot for the current service n.

5. A readable storage medium, characterized in that: A computer management program is stored thereon, and when the computer management program is executed by the processor, the steps of the method for uniformly allocating time slots in a time-sharing processing system as described in any one of claims 1 to 4 are implemented.

Images