CN1719793A - Method for allocating channel resources - Google Patents
Method for allocating channel resources Download PDFInfo
- Publication number
- CN1719793A CN1719793A CN 200410062656 CN200410062656A CN1719793A CN 1719793 A CN1719793 A CN 1719793A CN 200410062656 CN200410062656 CN 200410062656 CN 200410062656 A CN200410062656 A CN 200410062656A CN 1719793 A CN1719793 A CN 1719793A
- Authority
- CN
- China
- Prior art keywords
- channel resource
- sign
- channel
- identification
- searching
- 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.)
- Granted
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
This invention discloses a method for distributing channel resources, which determines the latest assigned channel resource identification first when assigning channel resource identifications for new accessed terminals, then looks for idle channel resource identifications orderly from the latest assigned channel identification, if it finds out them, it assigns them to the current accessed terminals, which are designed to the latest distributed channel resource identification to set that said identification state is occupied, if it does not find out it, it stops the operation which can fully utilize idle channel resources.
Description
Technical field
The present invention relates to the channel resource allocation technology of wireless access system, be specifically related to a kind of method of allocation of channel resources may.
Background technology
Along with development of wireless communication devices, the professional ability that the professional ability that WCDMA (Wideband Code Division MultipleAccess Wideband Code Division Multiple Access (WCDMA)) system provides is provided much larger than GSM (Global System forMobile Communications global system for mobile communications).WCDMA adopts CDMA (Code Division Multiple Access), the number of channel that the number of channel that its NodeB (3-G (Generation Three mobile communication system) base station) provides provides far more than the gsm system base station.In order to demonstrate fully the superiority of WCDMA system, channel resource is fully utilized, need effectively manage channel resource, particularly at hot zones, the access of a large number of users is arranged, when hanging up, need to guarantee the channel resource utilance, to guarantee the impact resistance of system.
NodeB has special channel resource management module to realize the management of channel resource, relate to distribution to various ID resources (channel resource sign), as ULCircuitID (Up Line Circuit ID, demodulation upstream circuitry sign), FPID (Frame Protocol, Frame Protocol package identification) etc.
In the prior art that a kind of description NodeB distributes various ID resources (for example to ULCircuitID, FPID distribution), if for user A distributes FPID:(1,2), for user B distributes FPID:(3,4), then when user A on-hook, when user C inserts, system will distribute FPID:(1,2 for user C); Promptly in the ID of free time resource, adopt ID label allocative decision from small to large.But, when user's on-hook discharges the ID resource, can not guarantee that identical ID resource is released simultaneously in a plurality of modules like this because the ID resource that NodeB is distributed is often used simultaneously by a plurality of modules.For example NodeB is used by FP module, decoding module, coding module simultaneously for the FPID (1,2) that user A distributes, therefore, when user A on-hook, can not guarantee that the FPID that user A takies is simultaneously deleted in these three modules, the FPID (1,2) that takies as user A, also do not have in these three modules any one when deleted, if there is user C to insert, this moment, NodeB was user C distribution FPID (1,2) again.Like this, because FPID (1,2) is not also deleted in three modules fully, so must cause user C access failure.The defective of prior art is: when still having idle ID resource among the NodeB, can not be assigned to suitable ID resource for newly accessing terminal owing to above-mentioned collision problem causes system.At hot zones, when a large number of users access, on-hook are arranged, must cause the user to insert difficulty, system's impact resistance is poor.
In the another kind of prior art, when the user caused access failure because of the ID resource allocation conflict, the ID resource of system log (SYSLOG) conflict was skipped this resource automatically and is continued to adopt allocation strategy from small to large to distribute in the idle ID resource of residue.But system carries out when reality is used after distributing the ID resource the judgement of conflict ID, if conflict is arranged, then writes down the ID resource that this clashes, and redistributes new ID resource.This technology has increased system inserts processing to the user complexity.At hot zones, when a large number of users access, on-hook were arranged, the ID resource allocation that a large amount of new users insert all needed to attempt repeatedly, has seriously reduced the treatment effeciency of system, still show as the user at last and insert difficulty, thereby the impact resistance of system is significantly improved.
Summary of the invention
The technical problem to be solved in the present invention is: the method that a kind of allocation of channel resources may is provided, the idle channel resources sign is fully utilized, the probability of the channel resource identification collision that channel resource sign that being reduced to newly accesses terminal distributes and positive on-hook terminal are discharged.
In order to solve the problems of the technologies described above, the present invention adopts following technical scheme: a kind of method of allocation of channel resources may is provided, is used to the terminal distribution channel resource sign of new access, it is characterized in that, comprise step:
1) determines that the channel resource that distributes recently identifies;
2) calculating channel resource sum;
3) from the channel resource sign of nearest distribution, search the idle channel resources sign according to pre-defined rule, and judge whether to find, if find, then execution in step 4); If do not find, then carry out end process;
4) current channel resource sign is distributed to aforementioned terminals, and current channel resource is identified the channel resource sign of putting to nearest distribution, puts this channel resource identification-state for taking.
Wherein, described step 3) specifically comprises:
31), determine current channel resource sign of searching according to the channel resource sign of distributing recently;
32) with counter O reset;
33) whether the value of judging counter less than the channel resource sum, if judged result is for being that then execution in step 34); If judged result is carried out end process for not;
34) judge whether the state that the current channel resource of searching identifies is idle; If then forward step 4) to; If not, then the value with counter adds one, changes current channel resource sign of searching, and returns step 33).
Wherein, described step 31) in, the channel resource sign of searching with current is the predetermined displacement amount with respect to the displacement of the channel resource sign of nearest distribution, the greatest common divisor of described displacement and channel resource sum is 1, and between minimum allocatable channel resource identification and maximum allocatable channel resource identification; Described step 34) in, changing current channel resource sign of searching is that current channel resource sign is changed the predetermined displacement amount.
Wherein, described displacement can be following two kinds of forms:
D1: described displacement is the recruitment of channel resource sign;
D2: described displacement is the reduction of channel resource sign.
Wherein, when described displacement is the recruitment of channel resource sign, in the described step 1) minimum allocatable channel resource identification is identified as the channel resource that distributes recently; And described step 33) and 34) between also comprise step: the value J that adopts the channel resource sign that following formula determines to search:
J=MINID+ (J-MINID) MOD (channel resource sum)
Wherein, J is the value of the channel resource sign of searching; MINID is minimum allocatable channel resource identification.Optionally, when described displacement is the reduction of channel resource sign, in the described step 1) maximum allocatable channel resource identification is identified as the channel resource that distributes recently; And described step 33) and 34) between further comprising the steps of: the value J that adopts the channel resource sign that following formula determines to search:
J=MAXID-(MAXID-J) MOD (channel resource sum)
Wherein, J is the value of the channel resource sign of searching; MAXID is maximum allocatable channel resource identification.
With respect to prior art, the invention has the beneficial effects as follows: because the present invention is by identifying the various channel resources in the system, the channel resource that distributes since the last time identifies, search the allocative decision of idle channel resources according to pre-defined rule, make the distribution probability equal of system to all channel resources sign, make the idle channel resources sign be fully utilized, avoided in the prior art to the channel resource sign all the time from the channel resource sign beginning of minimum according to order assignment from small to large cause only to the continuous reusable situation of a few channels, thereby significantly reduced hot zones channel resource sign for the distribution that newly accesses terminal when busy hour call is frequent and identified the probability that clashes with the channel resource that positive on-hook user discharges, system is reduced greatly to the probability that the access interference reprocessing takes place whether inserts situation, strengthen user's call completing rate, improved the impact resistance of system.
Description of drawings
Fig. 1 is the schematic diagram of resource distribution module allocated channel sign;
Fig. 2 is an embodiment flow chart of taking to increase the formula distribution method of the present invention;
Fig. 3 is an embodiment flow chart of taking the degression type distribution method of the present invention.
Embodiment
In communication system, channel is the passage of transfer of data, system is numbered all channel resources so that discern and manage, and through the channel after the numbering unique channel resource sign is arranged, and system gives corresponding module by the allocation of channel resources may sign with channel resource allocation.As shown in Figure 1, system realizes by resource distribution module the distribution of various channel resource signs.After the resource distribution module success allocation of channel resources may sign, send to corresponding module, various modules just can carry out transfer of data.After resource distribution module distribution FPID resource, send to FP module, decoding module, coding module use, FP module and decoding module, FP module and coding module just can carry out the mutual of data like this.
In communication, channel allocation is to ensure communication quality, effectively utilize one of the key technology of channel resource, the distribution of channel has determined the operating position of wireless network resource, directly have influence on the utilance of device resource and the performance of system, therefore adopt a kind of method of rational allocation of channel resources may, make all channel resources to be fully utilized and play crucial effects for improving systematic function.
The present invention takes to identify since the channel resource that the last time distributes, and searches the allocative decision of idle channel resources according to pre-defined rule.When being the terminal distribution channel resource sign of new access, determine that at first the channel resource that distributes recently identifies, when first terminal inserts, the initialization value of channel resource sign is identified as the channel resource that distributes recently, when terminal inserts later on, the channel resource sign that will distribute recently for the channel resource sign conduct of previous terminal distribution; From the channel resource sign of nearest distribution, search the idle channel resources sign then according to pre-defined rule; If find, current channel resource sign is distributed to aforementioned terminals, the channel resource sign of aforementioned terminals is changed to the channel resource sign of nearest distribution, put this channel resource identification-state for taking; If do not find, carry out end process.
Below in conjunction with embodiment technical scheme provided by the present invention is specifically introduced:
Scheme one: increase the formula resource allocation methods
Fig. 2 is the embodiment flow chart of growth formula of the present invention resource allocation, be designated for the channel resource that distributes that newly accesses terminal in the growth formula resource allocation methods: the channel resource that distributes since the last time identifies, with each increment is that N searches, in order to make system guarantee all finding the idle channel resources sign as early as possible in the channel resource, N is defined as and the greatest common factor of channel resource sum is 1 and the number of scope between maximum allocatable channel resource identification and minimum allocatable channel resource identification, be that N is 1, perhaps N and ID number of resources are relatively prime.Simple scenario as, the NodeB system is that user A distributes FPID:(1,2), be that user B distributes FPID:(3,4), after user A on-hook, there is user C to insert again, then the channel resource that distributes recently this moment is designated FPID:(3,4), therefore distribute FPID:(5,6) for user C.
Growth formula channel resource allocation comprises step:
The channel resource that steps A 1, initialization distribute recently is designated minimum assignable channel resource sign;
Steps A 2, obtain the number of channel resource sign, can adopt following formula:
Number=maximum assignable channel resource sign-minimum assignable the channel of channel resource sign
Resource identification+1;
The initial value of the channel resource sign that steps A 3, setting are searched, can adopt following formula:
Channel resource sign+the N that J=distributes recently
Wherein, N is and the greatest common factor of ID number is 1 and the value between minimum allocatable channel resource identification and maximum allocatable channel resource identification, and promptly N is 1, and perhaps N and ID number are relatively prime;
Steps A 4, counter being set and with its zero clearing, is cycle-index with the number of channel resource sign, circulates;
Steps A 5, judge the value of counter, if still do not find idle channel resource sign during greater than cycle-index, then channel resource is all occupied, has not had the idle channel resources sign for uses that newly access terminal, channel resource sign distribution end; If do not surpass cycle-index, then execution in step A6;
The value that object is searched in steps A 6, calculating; When guaranteeing that channel resource sign is assigned to maximum assignable channel resource sign, begin to seek idling-resource from the assignable channel resource sign of minimum again, to searching the value of object, can adopt following operational formula:
J=MINID+ (J-MINID) MOD (channel resource sum)
Wherein, J is the value of the channel resource sign of searching; MINID is minimum allocatable channel resource identification;
Steps A 7, judge whether J channel resource sign is idle, judged result is for being, then execution in step A8; Judged result is not, then execution in step A8;
Steps A 8, current channel resource sign is distributed to aforementioned terminals, and current channel resource sign is put channel resource sign to nearest distribution, put this channel resource identification-state for taking.So far, finish for the allocation of channel resources may sign that newly accesses terminal;
Steps A 9, J is added N, and cycle-index is added one, jump to steps A 5 and continue to carry out.
Scheme two: degression type Resource Allocation Formula
Be designated for the channel resource that distributes that newly accesses terminal in the degression type Resource Allocation Formula: the channel resource that distributes since the last time identifies, with each decrement is that N searches, in order to make system guarantee all finding the idle channel resources sign as early as possible in the channel resource, N is defined as and the greatest common factor of channel resource sum is 1 and the number of scope between maximum allocatable channel resource identification and minimum allocatable channel resource identification, be that N is 1, perhaps the number of N and channel resource sign is relatively prime.Simple scenario as, the NodeB system is that user A distributes FPID:(9,10), be that user B distributes FPID:(7,8), after user A on-hook, there is user C to insert again, the channel resource of nearest distribution at this moment is designated FPID:(7,8), therefore, for user C distributes FPID:(5,6).
Fig. 3 is the embodiment flow chart of degression type Resource Allocation Formula of the present invention.
Below be the concrete steps of degression type channel resource allocation:
ID number of step D1, initialization distribution recently is maximum assignable channel resource sign;
Step D2, obtain the number of channel resource sign according to following formula:
Number=maximum assignable channel resource sign-minimum assignable the channel of channel resource sign
Resource identification+1;
The initial value of the channel resource sign that step D3, setting are searched, can calculate according to following formula:
Channel resource sign-the N that J=distributes recently,
Wherein, N is and the greatest common factor of the number of channel resource sign is 1 and the value between minimum allocatable channel resource identification and maximum allocatable channel resource identification, and promptly N is 1, and perhaps the number of N and channel resource sign is relatively prime;
Step D4, counter being set and with its zero clearing, is cycle-index with channel resource sign number, circulates;
The value of step D5, judgement counter; If still do not find idle channel resource sign during greater than cycle-index, then channel resource is all occupied, has not had the idle channel resources sign for the use that newly accesses terminal, and channel resource identifies to distribute and finishes.If surpass cycle-index, then 5 continuation are carried out downwards in proper order set by step;
Step D6, calculating channel resource identification, when guaranteeing to be assigned to for ID number minimum assignable channel resource sign, begin to seek idling-resource from the assignable channel resource sign of maximum again, the channel resource sign to current desire is distributed, adopt following operational formula:
J=MAXID-(MAXID-J) MOD (ID number)
Wherein, J is the value of the channel resource sign of searching; MAXID is maximum allocatable channel resource identification;
Step D7, judge that whether the J channel resource is idle; If judged result is for being, execution in step D8 then; If judged result is not, then execution in step D9;
Step D8, current channel resource sign is distributed to aforementioned terminals, and current channel resource sign is put channel resource sign to nearest distribution, put this channel resource identification-state for taking.So far, finish for the allocation of channel resources may sign that newly accesses terminal;
Step D9, J is deducted N, and cycle-index is added one, jump to step D5 and continue to carry out.
Above embodiment has introduced how to use concrete steps of the present invention in resource distribution module.Thought of the present invention and method can also be applied in the resource allocation algorithm of product; the above only is a preferred implementation of the present invention; should be understood that; for those skilled in the art; under the prerequisite that does not break away from the principle of the invention; can also make some improvements and modifications, these improvements and modifications also should be considered as protection scope of the present invention.
Claims (9)
1, a kind of method of allocation of channel resources may is used to the terminal distribution channel resource of new access to identify, and it is characterized in that, comprises step:
1) determines that the channel resource that distributes recently identifies;
2) calculating channel resource sum;
3) from the channel resource sign of nearest distribution, search the idle channel resources sign according to pre-defined rule, and judge whether to find, if find, then execution in step 4); If do not find, then carry out end process;
4) current channel resource sign is distributed to aforementioned terminals, and current channel resource is identified the channel resource sign of putting to nearest distribution, put this channel resource identification-state for taking.
2, the method for allocation of channel resources may according to claim 1 is characterized in that, described step 3) specifically comprises:
31), determine current channel resource sign of searching according to the channel resource sign of distributing recently;
32) with counter O reset;
33) whether the value of judging counter less than the channel resource sum, if judged result is for being that then execution in step 34); If judged result is carried out end process for not;
34) judge whether the state that the current channel resource of searching identifies is idle; If then forward step 4) to; If not, then the value with counter adds one, changes current channel resource sign of searching, and returns step 33).
3, the method for channel resource allocation according to claim 2, it is characterized in that: described step 31), the channel resource sign of searching with current is the predetermined displacement amount with respect to the displacement of the channel resource sign of nearest distribution, the greatest common divisor of described displacement and channel resource sum is 1, and between minimum allocatable channel resource identification and maximum allocatable channel resource identification; Described step 34) in, changing current channel resource sign of searching is that current channel resource sign is changed the predetermined displacement amount.
4, the method for channel resource allocation according to claim 3 is characterized in that: described displacement is the recruitment of channel resource sign.
5, the method for channel resource allocation according to claim 4 is characterized in that: described step 1) identifies minimum allocatable channel resource identification as the channel resource that distributes recently.
6, the method for channel resource allocation according to claim 5 is characterized in that: described step 33) and 34) between also comprise step: the value J that adopts the channel resource sign that following formula determines to search:
J=MINID+ (J-MINID) MOD (channel resource sum)
Wherein, J is the value of the channel resource sign of searching; MINID is minimum allocatable channel resource identification.
7, the method for channel resource allocation according to claim 6 is characterized in that: described displacement is the reduction of channel resource sign.
8, the method for channel resource allocation according to claim 7 is characterized in that: maximum allocatable channel resource identification is identified as the channel resource that distributes recently.
9, the method for channel resource allocation according to claim 8 is characterized in that, described step 33) and 34) between further comprising the steps of: the value J that adopts the channel resource sign that following formula determines to search:
J=MAXID-(MAXID-J) MOD (channel resource sum)
Wherein, J is the value of the channel resource sign of searching; MAXID is maximum allocatable channel resource identification.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100626562A CN100558060C (en) | 2004-07-08 | 2004-07-08 | A kind of method of allocation of channel resources may |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100626562A CN100558060C (en) | 2004-07-08 | 2004-07-08 | A kind of method of allocation of channel resources may |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1719793A true CN1719793A (en) | 2006-01-11 |
| CN100558060C CN100558060C (en) | 2009-11-04 |
Family
ID=35931523
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100626562A Expired - Fee Related CN100558060C (en) | 2004-07-08 | 2004-07-08 | A kind of method of allocation of channel resources may |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100558060C (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007065342A1 (en) * | 2005-12-07 | 2007-06-14 | Huawei Technologies Co., Ltd. | Method and apparatus for establishing adaptive downlink simulating load channels |
| CN102340432A (en) * | 2010-07-21 | 2012-02-01 | 浙江吉利汽车研究院有限公司 | Identifier allocation strategy for vehicle-mounted CAN (Controller Area Network) bus |
| CN101296474B (en) * | 2007-04-26 | 2013-01-02 | 华为技术有限公司 | Method and device for distributing transmission resource for mobile station |
| WO2014107993A1 (en) * | 2013-01-09 | 2014-07-17 | 腾讯科技（深圳）有限公司 | Channel allocation and acquisition method and device |
| WO2016070564A1 (en) * | 2014-11-05 | 2016-05-12 | 中兴通讯股份有限公司 | Method and apparatus for allocating resource identifiers in network management system |
| CN108694648A (en) * | 2018-05-15 | 2018-10-23 | 腾讯科技（深圳）有限公司 | Article exchange method, article mark register method, system, device and storage medium |
-
2004
- 2004-07-08 CN CNB2004100626562A patent/CN100558060C/en not_active Expired - Fee Related
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007065342A1 (en) * | 2005-12-07 | 2007-06-14 | Huawei Technologies Co., Ltd. | Method and apparatus for establishing adaptive downlink simulating load channels |
| CN101296474B (en) * | 2007-04-26 | 2013-01-02 | 华为技术有限公司 | Method and device for distributing transmission resource for mobile station |
| CN102340432A (en) * | 2010-07-21 | 2012-02-01 | 浙江吉利汽车研究院有限公司 | Identifier allocation strategy for vehicle-mounted CAN (Controller Area Network) bus |
| CN102340432B (en) * | 2010-07-21 | 2012-11-28 | 浙江吉利汽车研究院有限公司 | Identifier allocation strategy for vehicle-mounted CAN (Controller Area Network) bus |
| WO2014107993A1 (en) * | 2013-01-09 | 2014-07-17 | 腾讯科技（深圳）有限公司 | Channel allocation and acquisition method and device |
| US9591622B2 (en) | 2013-01-09 | 2017-03-07 | Tencent Technology (Shenzhen) Company Limited | Channel assignment, acquisition method and apparatus |
| WO2016070564A1 (en) * | 2014-11-05 | 2016-05-12 | 中兴通讯股份有限公司 | Method and apparatus for allocating resource identifiers in network management system |
| CN105610593A (en) * | 2014-11-05 | 2016-05-25 | 中兴通讯股份有限公司 | Method and device for resource identifier allocation in network management system |
| CN105610593B (en) * | 2014-11-05 | 2020-06-16 | 中兴通讯股份有限公司 | Method and device for distributing resource identification in network management system |
| CN108694648A (en) * | 2018-05-15 | 2018-10-23 | 腾讯科技（深圳）有限公司 | Article exchange method, article mark register method, system, device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100558060C (en) | 2009-11-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1097412C (en) | Management method for extra expenses channel in mobile telecommunication system | |
| US6473395B1 (en) | Method for allocating Walsh codes by group in a CDMA cellular system | |
| CN1430440A (en) | Memory control device and method for base station modem | |
| CN1297078C (en) | Reconnecting a CDMA2000 high speed packet data service from dormant state | |
| CN100338923C (en) | Method of realizing IP message partition and recombination based on network processor | |
| CN1650536A (en) | Rake receiver for tracking closely spaced multipath | |
| CN101035368A (en) | Method and system for configuring the high-speed packet access | |
| CN1281012C (en) | Up code scrambling distributing method in WCDMA system | |
| CN1133337C (en) | Resource allocation | |
| CN101080094A (en) | URNTI allocation method and its device | |
| CN1906872A (en) | Code channel management in a wireless communications system | |
| CN1719793A (en) | Method for allocating channel resources | |
| CN1805320A (en) | Method for code channel allocation in TD-SCDMA access system | |
| CN101043715A (en) | Method of uplink channel distribution | |
| CN1893316A (en) | Base station and method for allocating HS-DSCH channelisation codes in a wireless communication system | |
| CN1882152A (en) | Data configuration method for access network device | |
| CN1925376A (en) | Descending main scrambling code optimum distribution method in broad band CDMA system | |
| CN1145296C (en) | Code distributing method for CDMA system | |
| CN1533066A (en) | Up demodulation method for different speed service | |
| CN1275402C (en) | Channel code list renormalizing method for WCDMA system | |
| CN1158800C (en) | Method for preventing collision of extended orthogonal | |
| CN100344135C (en) | Checking method for IP address | |
| CN1283056C (en) | Channel code resource utilization method in broadband CDMA system | |
| CN1905430A (en) | Method and system for allocating high-speed physics downlink shared channel code | |
| CN1756137A (en) | Orthogonal variable spread-spectrum factor code tree state storing, distributing and releasing method and device |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20091104 Termination date: 20140708 |
|
| EXPY | Termination of patent right or utility model |