CN100478951C - Management method of index table - Google Patents
Management method of index table Download PDFInfo
- Publication number
- CN100478951C CN100478951C CNB2006101130741A CN200610113074A CN100478951C CN 100478951 C CN100478951 C CN 100478951C CN B2006101130741 A CNB2006101130741 A CN B2006101130741A CN 200610113074 A CN200610113074 A CN 200610113074A CN 100478951 C CN100478951 C CN 100478951C
- Authority
- CN
- China
- Prior art keywords
- index
- index value
- value
- zone bit
- round
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses an index list management method, in specific to comprises: a. This is a step to establish an one-to-one correlated flag bit for index values in an index circulation queue; the flag bit taking the first specific value means that the index value is in the circulation queue; taking the second specific value means that the index value is not in the circulation queue; b. This is an allocation step to take one index value from the index circulation queue, and change the corresponding flag bit from the first specific value to the second specific value; c. This is a recycling step to determine a flag bit corresponding with the index value, and accordingly identify the value of the flag bit; if the flag bit is taken as the second specific value, recycle the index value. The method avoids the defect, in prior arts, that multi-round ergode for an index circulation queue is executed to identify whether the index has been in the index circulation queue before a recycled index is released, so as to increase index list management efficiency.
Description
Technical field
The present invention relates to the concordance list administrative skill of widespread usage in the communications field, be meant a kind of management method of utilizing round-robin queue to realize a kind of high-level efficiency concordance list especially.
Background technology
In the communications field, be extensive use of the sign that concordance list is managed the various communication resources, and managing internal memory etc.In application process, the main effect of concordance list is with generating and reclaim index.In the prior art, generally required before an index is not recovered, the more identical index of sub-distribution.
In asynchronous transfer mode (ATM, the Asynchronous Transfer Mode) communication, need be used for identifying this logic channel, be called channel recognition symbol (CID, Channel Identifier) sign of traffic channel assignment.The distribution of CID and recovery just can realize by the index of reference table.
In ATM communication, the process of utilizing the distribution of concordance list management CID and recovery is without loss of generality as shown in Figure 1, supposes that index round-robin queue comprises 5 index,
Step 1A, the then formation of first of index round-robin queue after the initialization such as accompanying drawing 1 row, 5 respectively corresponding 5 CID to be allocated of index value;
Step 1B distributes first index value 2, moves a position after the queue head pointer, and the rear of queue pointer is motionless;
Step 1C, use after the index value 2, when need to discharge reclaiming index, judge that index value 2 is whether in index round-robin queue, index value 2 successively with index round-robin queue in other index value compare, dotted arrow is represented to travel through index round-robin queue and is compared judgement among the figure;
Step 1D if there is not index value 2 in the index round-robin queue, then inserts rear of queue to index value 2, moves a position behind the rear of queue pointer, and queue head pointer is motionless.
But prior art is under the bigger situation of concordance list, owing to will repeatedly travel through index round-robin queue, so efficient is very low.
Summary of the invention
In view of this, the object of the present invention is to provide a kind of management method of concordance list, realize based on round-robin queue equally, but efficient has been compared raising with existing concordance list management method.
A kind of concordance list management method provided by the invention comprises: a. is that the index value in the index round-robin queue is set up the step of zone bit one to one, zone bit is got first particular value and is represented index value in round-robin queue, gets second particular value and represents 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.
The described zone bit of this method 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.
Index value in the described index of this method 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 the next cycle of distributing and discharging the recovery index value.
There are head pointer and tail pointer in the described index of this method round-robin queue, after distributing an index value, moving a position behind the head pointer that points to this index value;
After reclaiming an index value, moving a position behind the tail pointer that points to this index value.
Described index value of this method and zone bit satisfy mapping relations in the position of sign array the inside: y=f (x), wherein, independent variable x represents index value, and y represents the position of the zone bit of index value correspondence in sign array the inside, mapping must be satisfied monotonicity, and y is continuous integer; The zone bit of described definite index value correspondence is specially: bring current index value into y=f (x) and obtain the position of zone bit in sign array the inside.
The method of a kind of communication resource management provided by the invention 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.
The described zone bit of this method 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.
Index value in the described index of this method 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 the next cycle of distributing and discharging the recovery index value.
There are head pointer and tail pointer in the described index of this method round-robin queue, after distributing an index value, moving a position behind the head pointer that points to this index value;
After reclaiming an index value, moving a position behind the tail pointer that points to this index value.
Described index value of this method and zone bit satisfy mapping relations in the position of sign array the inside: y=f (x), wherein, independent variable x represents index value, and y represents the position of the zone bit of index value correspondence in sign array the inside, mapping must be satisfied monotonicity, and y is continuous integer; The zone bit of described definite index value correspondence is specially: bring current index value into y=f (x) and obtain the position of zone bit in sign array the inside.
From above as can be seen, the invention provides a kind of new concordance list management method: set up one and the corresponding sign array of index round-robin queue, whether available the inside storage of sign array can represent index value the zone bit in the index round-robin queue, the using and discharge in the removal process of index value, judge that by the value of judging zone bit corresponding in the sign array index value is whether in formation with this index value.This method has effectively solved the defective that prior art exists, and when concordance list was enough big, the implementation result of method of the present invention was more obvious.
Description of drawings
Fig. 1 is existing application and the release removal process synoptic diagram that utilizes round-robin queue to realize concordance list;
Fig. 2 is the management process synoptic diagram of the concordance list based on index round-robin queue of the present invention.
Embodiment
The management method of high-level efficiency concordance list provided by the invention mainly comprises: set up one and the corresponding sign array of index round-robin queue, whether available the inside storage of sign array can represent index value the zone bit in the concordance list round-robin queue, and each index value has and only have the zone bit of a correspondence; Zone bit is got first particular value and is represented that index value in round-robin queue, gets second particular value and represent that index value is not in round-robin queue; In the use of index value, discharge in the removal process, determine the position of zone bit in the sign array of current index value correspondence, the value of zone bit on this position if zone bit is first particular value, shows that then current index value is in index round-robin queue in the judgement sign array; If zone bit is second particular value, show that then current index value is not in index round-robin queue.
The use of the described concordance list of this method is meant when system uses index value, the index value that the head pointer in the concordance list meeting allocation index round-robin queue points to; Discharge recovery and be meant index value after finishing using, system can discharge, and at this moment, concordance list can reclaim this index value at once.
Index value in the round-robin queue of index described in the present invention is that circulation is available, and all index values in index round-robin queue are finished using, and then index round-robin queue enters next application and discharges the cycle of reclaiming index value.
The present invention is further detailed explanation at specific embodiment 1 below in conjunction with accompanying drawing 2.
Embodiment 1:
Step 2A sets up one and the corresponding sign array of index round-robin queue; The whether available zone bit (FLAG) of corresponding index value in the storage representation index round-robin queue of sign array the inside, and the number of the number of zone bit and index value is identical.
Be without loss of generality, suppose: zone bit is got 0 and is represented index value in index round-robin queue, gets 1 and represents index value not in index round-robin queue; Initial index value is 2, and the index number is 5.Shown in A among Fig. 2, be the state after the initialization of index of the present invention round-robin queue.
Step 2B, when system need apply for an index, always get the index value that index round-robin queue head pointer points to, in the initial moment, first index value 2 is at first got by system, and index value 2 deducts index initial value 2, directly obtains the memory location subscript 0 of the zone bit corresponding with index value 2 in the sign array, and the 0th FLAG be set to 1, represent that this index value is assigned with.
Step 2C, when discharging recovery index value 2, index of reference value 2 deducts initial index value 2 and obtains the memory location 0 of index value 2 in the sign array.Judge that the 0th FLAG is 1, show that this index is in the state that is assigned with, need that this index is added to index round-robin queue and reclaim; So index value has been added to the afterbody of index round-robin queue, simultaneously this FLAG has been set to 0.
Further comprise among step 2A～2C, because the release of index value is unordered, therefore index value is through after application and discharging recovery, index value in the index round-robin queue also is a lack of alignment, and can obtain the position of respective flag position in the sign array by using index value to deduct the index initial value.
Circulation successively, all index values in index round-robin queue are finished using, and then index round-robin queue enters next application and discharges the cycle of reclaiming index value.
Embodiment 2:
In embodiment 2, mapping relations a: y=f (x) is satisfied in index value and the position that is identified at sign array the inside in the concordance list, and initial index value is a, and the index number is N, when system uses concordance list, determine the position of index value in the sign array according to mapping relations.And there is mapping relations a: y=f (x) in concordance list, and wherein, independent variable x represents index value, and y represents the zone bit of index value correspondence in the position of sign array the inside, and mapping must satisfy monotonicity, and y is continuous integer.
Set up one and the corresponding sign array of index round-robin queue; The whether available zone bit of corresponding index value in the storage representation index round-robin queue of sign array the inside, and the number of the number of zone bit and index value is identical.
Be without loss of generality, suppose: zone bit is got 0 and is represented index value in index round-robin queue, gets l and represents index value not in index round-robin queue; Initial index value is a, and the index number is N.
When system uses concordance list, determine the position of index value in the sign array according to mapping relations.Circulation successively, all index values in index round-robin queue are finished using, and then index round-robin queue enters next application and discharges the cycle of reclaiming index value.
In sum, the present invention has wide practical use in the communications field, can be used for distributing the logic channel CID in the ATM communication; At radio network controller (RNC, Radio Network Controller) in, when the cellphone subscriber will carry out voice call, to connect and set up RAB (RAB by setting up AAL2, Radio Access Bearer) time, use concordance list method CID allocation, can save time and on-hook time that user's communication is connected; When the mobile subscriber makes a phone call, when in RNC, setting up Radio Resource control (RRC, Radio Resource Control) connection, can be used for distributing and discharging user's temporary mark; On the IU interface, concordance list is used for identifying an IU and connects; At SCCP (SCCP, Signalling Connection Control Part), be used for identifying a SCCP and connect; In RNC, can be used as the sign of intra-office logical links; In RNC, can be used as sub-district ID, the context ID (CRNC Context ID, Controlling RadioNetwork Controller Context ID) of the control radio network controller that uses as communicating by letter with nodeB; In core net, can be used for distributing fast and release temporarily moved subscriber identity (TMSI, Temporary Mobile Subscriber Identity) and Packet Temporary Mobile Subscriber Identity (P-TMSI, Packet Temporary Mobile Subscriber Identity); In addition, concordance list also can be used for managing a bulk of memory field or structural array.
The above only is preferred embodiment of the present invention; not in order to restriction the present invention; the present invention has wide practical use in the communications field; therefore within the spirit and principles in the present invention all; any modification of being done, be equal to replacement, improvement etc., all should be included within 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.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006101130741A CN100478951C (en) | 2006-09-08 | 2006-09-08 | Management method of index table |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006101130741A CN100478951C (en) | 2006-09-08 | 2006-09-08 | Management method of index table |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101140572A CN101140572A (en) | 2008-03-12 |
| CN100478951C true CN100478951C (en) | 2009-04-15 |
Family
ID=39192526
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006101130741A Active CN100478951C (en) | 2006-09-08 | 2006-09-08 | Management method of index table |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100478951C (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104298747A (en) * | 2014-10-13 | 2015-01-21 | 福建星海通信科技有限公司 | Storage method and retrieval method of massive images |
| CN107800514B (en) * | 2017-11-16 | 2019-05-14 | 中国联合网络通信集团有限公司 | A kind of transmission method of downlink data and passback base station |
-
2006
- 2006-09-08 CN CNB2006101130741A patent/CN100478951C/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN101140572A (en) | 2008-03-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100531469C (en) | Method for configuring physical layer type of high-speed downlink share channel | |
| CN104350785B (en) | Mobile radio communication distribution system and mobile radio communication distribution method | |
| FI108507B (en) | Method and arrangement for managing connections | |
| CN101212813B (en) | Dynamic radio channel management system and method | |
| CN100420331C (en) | Method for sharing wireless accessing net by multi operators | |
| CN1889785B (en) | Method, system and network for processing switch failure in group switching process | |
| CN104640099A (en) | Business resource sharing method, business resource sharing device and terminal | |
| CN101827398A (en) | Radio bearer state transmitting method and device | |
| CN101365159B (en) | Bearing identification processing method and apparatus | |
| CN101730271A (en) | Method and device for recycling radio resource | |
| CN102857969A (en) | Congestion control method and system | |
| CN100478951C (en) | Management method of index table | |
| CN101400145A (en) | Random access collision back-off method | |
| CN102014434B (en) | Load re-distribution method and system for service gateway | |
| CN101188801B (en) | Method for configuring transmission carrier under public state | |
| CN105357694A (en) | 4G user data message processing method and system | |
| CN101626612A (en) | Method and system for realizing mobility management | |
| CN100372390C (en) | Retransmission method of protocol data unit | |
| CN101420761A (en) | Transmission bearing method, system and apparatus for broadcast multicast service | |
| CN101646151B (en) | Method and device for updating conversation | |
| CN103731816A (en) | Method for address management of user equipment | |
| CN101237417B (en) | Queue index method, device and traffic shaping method and device | |
| CN101175015B (en) | High-speed descending grouping access characteristic using method and device | |
| CN100596234C (en) | A-interface circuit management method, system and media gateway | |
| CN100381012C (en) | Method for data transmitting management in UE switching process |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |