CN100478951C - Management method of index table - Google Patents

Abstract

The invention discloses a management method of an index table, which specifically includes: a. The step of establishing a one-to-one corresponding flag bit for the index value in the index circular queue, and the flag bit takes the first specific value to indicate that the index value is in the circular queue , taking the second specific value indicates that the index value is not in the circular queue; b. taking an index value from the index circular queue, and changing the corresponding flag bit from the first specific value to the distribution step of the second specific value; c. Determine the flag bit corresponding to the index value and judge the value of the flag bit, if the flag bit takes the second specific value, then recycle the index value. This method avoids the multiple traversal of the index circular queue in order to judge whether the index is already in the index circular queue when releasing the reclaimed index in the prior art, and improves the management efficiency of the index table.

Description

A Management Method of Index Table

technical field

The invention relates to an index table management technology commonly used in the communication field, in particular to a management method for realizing a high-efficiency index table by using a circular queue.

Background technique

In the field of communication, index tables are widely used to manage the identification of various communication resources, and manage memory, etc. In the application process, the main function of the index table is to generate and recycle the index. In the prior art, it is generally required that the same index cannot be allocated again before an index is recycled.

In asynchronous transfer mode (ATM, Asynchronous Transfer Mode) communication, it is necessary to assign a symbol to the communication channel to identify this logical channel, which is called a channel identifier (CID, Channel Identifier). The allocation and recovery of CID can be realized by using the index table.

In ATM communication, the process of using the index table to manage the distribution and recovery of CID is shown in Figure 1. Without loss of generality, it is assumed that the index circular queue includes 5 indexes,

In step 1A, the initialized index circular queue is like the queue in the first row of Figure 1, and the five index values correspond to five CIDs to be allocated respectively;

Step 1B, assign the first index value 2, the queue head pointer moves back one position, and the queue tail pointer does not move;

Step 1C, after using the index value 2, when it is necessary to release the recycling index, it is necessary to determine whether the index value 2 is already in the index circular queue, and the index value 2 is compared with other index values in the index circular queue in turn, as indicated by the dotted arrow in the figure Traverse the index circular queue for comparison and judgment;

Step 1D, if there is no index value 2 in the index circular queue, then insert the index value 2 into the tail of the queue, the pointer of the tail of the queue moves back one position, and the pointer of the head of the queue does not move.

However, in the prior art, when the index table is large, the efficiency is very low because the index circular queue needs to be traversed many times.

Contents of the invention

In view of this, the purpose of the present invention is to provide an index table management method, which is also implemented based on a circular queue, but has improved efficiency compared with the existing index table management method.

An index table management method provided by the present invention includes: a. The step of establishing a one-to-one corresponding flag bit for the index value in the index circular queue, the flag bit takes the first specific value to indicate that the index value is in the circular queue, takes the first Two specific values indicate that the index value is not in the circular queue;

b. Take an index value from the index circular queue, and change the corresponding flag bit from the first specific value to the distribution step of the second specific value;

c. Determine the flag bit corresponding to the index value and judge the value of the flag bit, if the flag bit takes the second specific value, then recycle the index value.

In this method, the flag bit forms an identification array corresponding to the index circular queue, and the process of determining the flag bit corresponding to the index value includes: subtracting the initial value of the index from the current index value, and the result obtained is the index corresponding to the current index value The position of the flag in the identity array.

The index values in the index circular queue described in the method are cyclically available, until all the index values in the index circular queue are used up, then the index circular queue enters the next cycle of allocating and releasing index values.

The index circular queue described in the method has a head pointer and a tail pointer, and after an index value is allocated, the head pointer pointing to the index value is moved back by one position;

After recycling an index value, the tail pointer pointing to the index value is moved back by one position.

The position of the index value and the flag in the identification array described in the method satisfies the mapping relationship: y=f(x), wherein the independent variable x represents the index value, and y represents the position of the flag corresponding to the index value in the identification array, The mapping must satisfy monotonicity, and y is a continuous integer; the determination of the flag corresponding to the index value is specifically: taking the current index value into y=f(x) to obtain the position of the flag in the identification array.

A communication resource management method provided by the present invention includes:

a. Establish an index circular queue corresponding to the resources to be managed, and each index value is the identifier of its corresponding communication resource;

b. Allocate or reclaim the communication resource by managing the index circular queue, specifically:

b1. The step of establishing a one-to-one corresponding flag bit for the index value in the index circular queue, the flag bit takes the first specific value to indicate that the index value is in the circular queue, and gets the second specific value to indicate that the index value is not in the circular queue;

b2. Get an index value from the index circular queue, and change the corresponding flag bit from the first specific value to the distribution step of the second specific value;

b3. Determine the flag bit corresponding to the index value and judge the value of the flag bit, and reclaim the index value when the flag bit takes the second specific value.

In this method, the flag bit forms an identification array corresponding to the index circular queue, and the process of determining the flag bit corresponding to the index value includes: subtracting the initial value of the index from the current index value, and the result obtained is the index corresponding to the current index value The position of the flag in the identity array.

The index values in the index circular queue described in the method are cyclically available, until all the index values in the index circular queue are used up, then the index circular queue enters the next cycle of allocating and releasing index values.

The index circular queue described in the method has a head pointer and a tail pointer, and after an index value is allocated, the head pointer pointing to the index value is moved back by one position;

After recycling an index value, the tail pointer pointing to the index value is moved back by one position.

The position of the index value and the flag in the identification array described in the method satisfies the mapping relationship: y=f(x), wherein the independent variable x represents the index value, and y represents the position of the flag corresponding to the index value in the identification array, The mapping must satisfy monotonicity, and y is a continuous integer; the determination of the flag corresponding to the index value is specifically: taking the current index value into y=f(x) to obtain the position of the flag in the identification array.

As can be seen from the above, the present invention provides a new index table management method: establish an identification array corresponding to the index circular queue, and store in the identification array a sign that can indicate whether the index value in the index circular queue is available Bit, in the process of using and releasing the index value, judge whether the index value is already in the queue by judging the value of the flag bit corresponding to the index value in the flag array. This method effectively solves the defects in the prior art, and when the index table is large enough, the implementation effect of the method of the present invention is more obvious.

Description of drawings

Fig. 1 is the schematic diagram of the application and release recovery process of the existing index table realized by utilizing the circular queue;

FIG. 2 is a schematic diagram of the management process of the index table based on the index circular queue in the present invention.

Detailed ways

The management method of the high-efficiency index table provided by the present invention mainly includes: establishing an identification array corresponding to the index circular queue, storing in the identification array the flag bit that can indicate whether the index value in the index table circular queue is available, each index value There is and only one corresponding flag bit; the first specific value of the flag bit indicates that the index value is already in the circular queue, and the second specific value indicates that the index value is not in the circular queue; in the process of using, releasing and recycling the index value , determine the position of the flag bit corresponding to the current index value in the identification array, and judge the value of the flag bit at this position in the identity array. If the flag bit is the first specific value, it indicates that the current index value is already in the index circular queue In; if the flag bit is the second specific value, it indicates that the current index value is not in the index circular queue.

The use of the index table described in this method means that when the system uses the index value, the index table will allocate the index value pointed to by the head pointer in the index circular queue; release and recovery means that the system will release the index value after it is used. At this time, The index table will immediately reclaim the index value.

The index values in the index circular queue mentioned in the present invention are cyclically available, until all the index values in the index circular queue are used up, then the index circular queue enters the next cycle of applying for and releasing and recovering index values.

The present invention will be further described in detail in specific embodiment 1 below in conjunction with accompanying drawing 2.

Example 1:

Embodiment 1 specifically describes the process of managing communication resources based on an index table in the communication field. Generally speaking, in the communication process, most communication systems have strict requirements on time, and the management of many communication resources is realized by establishing an index value corresponding to the resource one by one, and storing the index value in the index table. Therefore, there is a need for a more efficient index table management method to meet this time requirement.

Step 2A, establish an identification array corresponding to the index circular queue; store the flag bit (FLAG) indicating whether the corresponding index value in the index circular queue is available in the identification array, and the number of flag bits is the same as the number of index values .

Without loss of generality, it is assumed that: the flag bit takes 0 to indicate that the index value is already in the index circular queue, and takes 1 to indicate that the index value is not in the index circular queue; the initial index value is 2, and the number of indexes is 5. As shown in A in FIG. 2 , it is the state of the index circular queue of the present invention after initialization.

Step 2B, when the system needs to apply for an index, it always takes the index value pointed to by the head pointer of the index circular queue. At the initial moment, the system first takes the first index value 2, and subtracts the index start value 2 from the index value 2, Directly obtain the subscript 0 of the storage location of the flag corresponding to the index value 2 in the identification array, and set the 0th FLAG to 1, indicating that the index value has been allocated.

Step 2C, when releasing and reclaiming the index value 2, subtract the starting index value 2 from the index value 2 to obtain the storage location 0 of the index value 2 in the identification array. It is judged that the 0th FLAG is 1, indicating that the index has been allocated, and the index needs to be added to the index circular queue for recycling; then the index value is added to the end of the index circular queue, and the FLAG is set to 0 at the same time.

Steps 2A-2C further include, because the release of index values is out of order, so after the index values are applied for, released and recycled, the index values in the index circular queue are also arranged out of order, and can always be subtracted by using the index value The index start value gets the position of the corresponding flag bit in the identification array.

Circulate in turn until all the index values in the index circular queue are used up, then the index circular queue enters the next cycle of applying for and releasing the recycled index values.

Example 2:

In embodiment 2, the index value in the index table and the position of the logo in the logo array satisfy a mapping relationship: y=f(x), and the starting index value is a, the number of indexes is N, and the index table is used in the system When , determine the position of the index value in the identity array according to the mapping relationship. And there is a mapping relationship in the index table: y=f(x), where the independent variable x represents the index value, y represents the position of the flag corresponding to the index value in the identification array, and the mapping must satisfy monotonicity, and y is continuous integer.

Establish an identification array corresponding to the index circular queue; the identification array stores flag bits indicating whether the corresponding index value in the index circular queue is available, and the number of flag bits is the same as the number of index values.

Without loss of generality, it is assumed that if the flag bit is set to 0, it means that the index value is already in the index circular queue, and if it is set to l, it means that the index value is not in the index circular queue; the initial index value is a, and the number of indexes is N.

When the system uses the index table, the position of the index value in the identification array is determined according to the mapping relationship. Circulate in turn until all the index values in the index circular queue are used up, then the index circular queue enters the next cycle of applying for and releasing the recycled index values.

In summary, the present invention has wide application prospect in communication field, can be used for distributing the logical channel CID in the ATM communication; When establishing an AAL2 connection to establish a radio access bearer (RAB, Radio Access Bearer), use the index table method to allocate CID, which can save the user's call connection time and hang-up time; When resource control (RRC, Radio Resource Control) is connected, it can be used to allocate and release the temporary identifier of the user; on the IU interface, the index table is used to identify an IU connection; in the signaling connection control part (SCCP, Signaling Connection Control Part ), which is used to identify an SCCP connection; it can be used as an identification of an intra-office logical link in the RNC; it can be used as a cell ID in the RNC, and as a context ID (CRNC Context ID, Controlling RadioNetwork Controller Context ID); in the core network, it can be used to quickly assign and release temporary mobile subscriber identity (TMSI, Temporary Mobile Subscriber Identity) and packet temporary mobile subscriber identity (P-TMSI, Packet Temporary Mobile Subscriber Identity); in addition, the index Tables can also be used to manage large memory areas or arrays of structures.

The above description is only a preferred embodiment of the present invention, and is not intended to limit the present invention. The present invention has a wide range of application prospects in the field of communication. Therefore, within the spirit and principles of the present invention, any modifications made, equivalent Replacement, improvement, etc. should all be included within the protection scope of the present invention.

Claims (10)

1. the management method of a concordance list comprises:

A. set up the step of zone bit one to one for the index value in the index round-robin queue, zone bit is got first particular value and is represented index value in round-robin queue, gets second particular value to represent that index value is not in round-robin queue;

B. from index round-robin queue, get an index value, and corresponding zone bit is changed into the allocation step of second particular value by first particular value;

C. determine the zone bit of index value correspondence and judge the value of this zone bit, zone bit is got the recycling step that second particular value then reclaims this index value.

2. method according to claim 1, it is characterized in that, described zone bit forms and index round-robin queue corresponding identification array, the process of the zone bit of described definite index value correspondence comprises: deduct the initial value of index with current index value, the result who obtains is the position of the zone bit of current index value correspondence in sign array the inside.

3. method according to claim 1, it is characterized in that, index value in the described index round-robin queue is that circulation is available, and all index values in index round-robin queue are finished using, and then index round-robin queue enters and nextly distributes and discharge the cycle of reclaiming index value.

4. method according to claim 1 is characterized in that, there are head pointer and tail pointer in described index round-robin queue, behind a dispensing head pointer index value pointed, moving a position behind the head pointer; After reclaiming an index value, this index value that moves behind the tail pointer after recovery is pointed in a position.

5. method according to claim 1, it is characterized in that, described index value and zone bit satisfy mapping relations in the position of sign array the inside: y=f (x), wherein, independent variable x represents index value, y represents the zone bit of index value correspondence in the position of sign array the inside, and mapping must be satisfied monotonicity, and y is continuous integer; The zone bit of described definite index value correspondence is specially: current index value substitution y=f (x) is obtained the position of zone bit in sign array the inside.

6. the method for a communication resource management comprises:

A. set up one with the corresponding index of the resource that will manage round-robin queue, each index value is the sign of its corresponding communication resource;

B. distribute or reclaim the described communication resource by managing described index round-robin queue, be specially:

B1. set up the step of zone bit one to one for the index value in the index round-robin queue, zone bit is got first particular value and is represented index value in round-robin queue, gets second particular value to represent that index value is not in round-robin queue;

B2. from index round-robin queue, get an index value, and corresponding zone bit is changed into the allocation step of second particular value by first particular value;

B3. determine the zone bit of index value correspondence and judge the value of this zone bit, zone bit is got the recycling step that second particular value then reclaims this index value.

7. method according to claim 6, it is characterized in that, described zone bit forms and index round-robin queue corresponding identification array, the process of the zone bit of described definite index value correspondence comprises: deduct the initial value of index with current index value, the result who obtains is the position of the zone bit of current index value correspondence in sign array the inside.

8. method according to claim 6, it is characterized in that, index value in the described index round-robin queue is that circulation is available, and all index values in index round-robin queue are finished using, and then index round-robin queue enters and nextly distributes and discharge the cycle of reclaiming index value.

9. method according to claim 6 is characterized in that, there are head pointer and tail pointer in described index round-robin queue, behind a dispensing head pointer index value pointed, moving a position behind the head pointer; After reclaiming an index value, this index value that moves behind the tail pointer after recovery is pointed in a position.

10. method according to claim 6, it is characterized in that, described index value and zone bit satisfy mapping relations in the position of sign array the inside: y=f (x), wherein, independent variable x represents index value, y represents the zone bit of index value correspondence in the position of sign array the inside, and mapping must be satisfied monotonicity, and y is continuous integer; The zone bit of described definite index value correspondence is specially: current index value substitution y=f (x) is obtained the position of zone bit in sign array the inside.

Images