CN100438698C - Method for service call queuing - Google Patents
Method for service call queuing Download PDFInfo
- Publication number
- CN100438698C CN100438698C CNB2005101017585A CN200510101758A CN100438698C CN 100438698 C CN100438698 C CN 100438698C CN B2005101017585 A CNB2005101017585 A CN B2005101017585A CN 200510101758 A CN200510101758 A CN 200510101758A CN 100438698 C CN100438698 C CN 100438698C
- Authority
- CN
- China
- Prior art keywords
- service request
- formation
- queuing
- service
- access
- 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
Abstract
The present invention discloses a method for a service call queuing. An admittance attempt is carried out by selecting the queuing service request according to arrangement conditions, by releasing resource triggering or further by a mode of combining the releasing resource triggering and period triggering. The present invention ensures that a user can enter a network in time when the resource is released, and the difference service characteristics can be embodied by arranging queuing service selection condition. In addition, the present invention only needs one timer with a periodic triggering function to replace the solution that all the users in the queue respectively arrange the timer so as to save the system resource and simplify system implementation. The arrangement of a double trigger mechanism can ensure that the attempt can be initiated periodically when the resource is not released so as to avoid the starvation of the user. The present invention can effectively reduce calling rejecting rate and raise system capacity and successful probability of user's accessing so as to benefit the network operation index as well as the user's serviceability.
Description
Technical field
The present invention relates to the access technology of user in the communication system, be specifically related to a kind of method of service call queuing.
Background technology
WCDMA (Wideband Code Division Multiple Access, system of broadband wireless communication based on code division multiple access) is an interference limiting system, after new calling of access, up total received power in broadband (RTWP, Received Total Wideband Power), descending carrier transmitting power (TCP, Transmitted Carrier Power) will improve, control as the number of users that system is not inserted, may occur disturbing too big and communication quality decline that cause, even call drop.Therefore need to adopt Admission Control (CAC, Call Admission Control) that the user that request inserts is controlled.New call out or switch or on existing basis of calling out, increase new business or existing business is carried out all needing to carry out access control when transmission channel is reshuffled.
Because the existence of access control has been arranged, when the momentary load of network than higher the time, the new calling of Client-initiated will be rejected, this has increased the call denial rate virtually, and in fact, it is very high that on behalf of offered load, the momentary load height continue, and just can discharge enough resources and admit new user after peak value past or other user's terminated call.Therefore, if the user can be waited in line when temporarily being rejected access calling out, that not only helps to reduce the call denial rate of network, for the user, postpone insert also than admission reject to be easy to accept many.
In the WCDMA system, class of business is abundant, except traditional speech business, also has data service.One big characteristics of data service are exactly sudden strong, moment data traffic big, for example open webpage, file in download and all have suddenly, and data traffic is very big at short notice, and most browse relative with data volume in reading time very little.Add the complicated and changeable of wireless environment, these have all caused, and offered load fluctuates acutely the characteristics that momentary load is high in the WCDMA system.From these aspects, be necessary for the queuing mechanism of new calling.When carrying out access control, mainly contain following scheme at present:
Prior art one: if newly call out not by access, the directly refusal of not lining up.
Its shortcoming is: though simple, cause higher call denial rate.Because the fluctuation of WCDMA offered load is big, the momentary load height so call denial may take place at random, also can be refused new user even offered load is low.
Prior art two: if newly call out not by access, then rank, but each the new usefulness in the formation is used independent timer control per family, timer length is fixed.
Its shortcoming is: each user uses independent timer, causes the timer resource occupation too much, safeguards complicated.Timer length is fixed, and can not embody User Priority.Resource discharges stylish user and can not get notice, can't in time be access in network, has hysteresis effect.
Summary of the invention
The object of the present invention is to provide and a kind ofly realize differentiated service and make the user can in time enter the method for the service call queuing of network, adopt this method further can also save the timer resource.
In order to achieve the above object, the technical solution used in the present invention is:
A kind of method of service call queuing comprises:
A, the new service request that will be rejected access are stamped timestamp and are put into formation;
B, when system has resource to discharge, judge earlier that resource discharges trigger switch and whether opens, then start trigger process as if opening, described trigger process comprises:
Select the service request dequeue to carry out access successively and attempt, all service request have all been passed through the access trial in formation, and this trigger process finishes, and waits for next time and triggering.
Described new service request comprises professional newly-built, professional switching, increase new business on existing call basis or existing business carried out that transmission channel is reshuffled etc.
When the service request of queuing occurring in the formation, start timer in the steps A, this timer has cycle triggering function, when timer expiry, then carries out described trigger process.
Wherein, when timer expiry, judge whether the timer cycle trigger switch is opened earlier, then carry out described trigger process if open.
Described service request has the maximum queuing time of setting separately; In the described trigger process, carry out successively also comprising before the access trial in selection service request dequeue: the queuing time that calculates all service request in the formation according to the timestamp of each service request, the service request that surpasses its maximum queuing time is deleted from formation, and carry out final user and refuse flow process.
In the access cut-and-try process, if service request is arranged by access, this service request connecting system then; If there is service request still to be rejected access, then continue to put back to formation, the formation timestamp of going into that it is original remains unchanged.
Described formation has the maximum length of setting; In the steps A new service request is put into formation and judge whether formation is full earlier before, if less than, then new service request is stamped the current time stamp and put into formation; If it is full, whether then further judge has in the formation and should and carry out the service request that final user refuses flow process by deletion from formation, if have, then this service request is deleted from formation and carried out final user and refuse flow process, new service request is stamped the current time stamp put into formation, if do not have, then new service request is carried out final user and refuse flow process.
If formation is full,, then this new service request is carried out final user and refuse flow process in the steps A if the priority of new service request is lower than the priority of all queuing service requests; If the priority of new service request is higher than the priority of part or all of queuing service request, then judge whether have in the formation and should and carry out the service request that final user refuses flow process by deletion from formation according to condition a; Described condition a is: this service request is that all priority are lower than weights maximum in the queuing service request of new service request, if equate when weights, gets wherein that queuing time is the longest; As eligible a, then this service request is deleted from formation and carried out final user and refuse flow process; Described weights meet: the queuing time of service request is long more, priority is high more, and weights are more little.
The step of described trigger process comprises: according to condition b the service request in the formation is selected, successively the service request dequeue of eligible b is carried out access and attempt; Described condition b is: this service request is that all did not also carry out weights minimum in the service request that access attempts in this trigger process, and when weights are equal, gets wherein that queuing time is the longest; Described weights meet: the queuing time of service request is long more, priority is high more, and weights are more little.
The computational methods of each service request weights are:
Adopt technique scheme, beneficial technical effects of the present invention is:
1) adopts resource to discharge and trigger professional dequeue, the user can in time enter network when having guaranteed resource release, can set out simultaneously the alternative condition of formation business, for example can according to the priority of business and queuing time wait the selection of carrying out the dequeue business, embody the differentiated service feature.
2) cycle of employing is simultaneously triggered professional dequeue, only uses a timer, has replaced being provided with respectively for each queuing user the solution of timer, has saved system resource, has simplified system's realization; And can guarantee when having resource to discharge, can periodically not initiate to attempt, avoid the user hungry to death.
Also the present invention is described in further detail in conjunction with the accompanying drawings below by embodiment.
Description of drawings
The method flow schematic diagram of a kind of service call queuing of Fig. 1 embodiment of the invention.
Embodiment
The invention provides a kind of method of service call queuing, after the user initiates new service request, if be rejected access, then this service request being stamped timestamp ranks, when system has resource to discharge, start trigger process, service request is carried out the access trial successively in the selection formation; If the heartbeat timer is disposed in formation, overtime when a heart beat cycle, start described trigger process equally; Service request is finally refused or dequeue is made the service request that access attempts select by the Rule of judgment of setting, these Rule of judgment can be according to the maximum queuing time of service request, attribute such as queuing time, priority is provided with, to embody the differentiated service feature.
The noun that relates in the specific descriptions that will carry out has following implication below:
Service request: be the signaling that CN (Core Network, core net) issues RNC (Radio NetworkController, radio network controller), the inside has illustrated the professional and relevant service parameter that needs to set up or reshuffle which kind of type; Alleged new service request comprises professional newly-built, professional switching, increases new business on existing call basis, existing business is carried out that transmission channel is reshuffled etc. among the present invention.
Maximum queuing time and priority: for embodying the differentiated service feature, operator can be according to each service request RAB (Radio Access Bearer, RAB) attribute is provided with its priority and maximum queuing time, the important evidence when judging as dequeue or final refusal.Priority is generally the Priority Level cell value of Allocation/Retention Priority attribute in the RAB assignment request, and its scope generally gets 1～14, and the more little then priority of this cell value is high more.Maximum queuing time then can be provided with according to the priority of this service request.
Timestamp: timestamp is the lint-long integer of mark time, according to the comparison of former and later two timestamps, during can knowing concrete time of process.Service request for queuing is all stamped the timestamp that it enters formation, can calculate the queuing time of each service request so when needed, the important evidence when judging as dequeue or final refusal.
Formation maximum length: be to strengthen the controllability of formation, determine to allow the service request number of lining up simultaneously according to actual needs, avoid queuing request too much, occupying system resources.
The heartbeat timer: heartbeat timer general reference has the timer of cycle triggering function, is a timer internal relevant with formation, and its heartbeat duration can be provided with; The heartbeat timer starts when occurring first queuing service request in the formation, and the heartbeat timer stops when formation is sky; The each overtime trigger process of all can carrying out a time of heartbeat timer.
Describe realization of the present invention in detail with a kind of new business call queuing method in the wireless telecommunication system below, (dotted arrow among Fig. 1 is represented control procedure to its main flow process as shown in Figure 1, not drawing among the figure, each adjudicates the negative decision result of branch, because the negative decision result directly causes process to finish.For example: if access is not rejected, then process finishes, and new user successfully enters network), comprise the steps:
1, new service request is gone into the formation step: described formation can be set maximum length, and described service request can have the maximum queuing time of setting separately; After the user initiates new service request and is rejected access, judge whether formation is full:
If formation less than, then this new service request is stamped the current time and is stabbed, put into formation;
If formation is full,, then this new service request is carried out final user and refuse flow process if the priority of new service request is lower than the priority of all queuing service requests; If the priority of new service request is higher than the priority of part or all of queuing service request, then the service request in the formation is judged according to the condition a that sets, if have the service request of eligible a in the formation then it is deleted from formation and carries out final user and refuse flow process, new service request is stamped the current time stab and put into formation;
Described condition a is: this service request be all Priority Level cell values than weights maximum in the queuing service request of this new service request big (being that the priority ratio new service request is low), if weights equate, get then wherein that queuing time is the longest; Described weights meet: the queuing time of service request is long more, priority is high more, and weights are more little.In this programme, the scope of Priority Level cell value gets 1～14, and the more little then priority of this cell value is high more, and weights adopt following computational methods:
The queuing time of service request in formation can stab with the current time when calculating and deduct the timestamp acquisition that the service request of being noted enters formation.The implication of weight calculation method is: guarantee that queuing time is long more, then weights are more little, and the priority of dequeue is high more.When queuing time allowed queuing time near the maximum of this business, weights rose near minimum value 0.The minimum weights of queuing service request are 0 in the such scheme, are 14 to the maximum.
2, resource discharges and triggers step: have resource to discharge in RNC, start trigger process.In addition, resource can also be set discharge trigger switch, determine whether when resource discharges, starting trigger process.It can be two value parameters of being set by external command that described resource discharges trigger switch; Described trigger process comprises:
1) calculates the queuing time of all service request in the formation according to the timestamp of each service request, if surpass the maximum queuing time of this service request, then this service request is deleted from formation and carried out final user and refuse flow process, return RAB and assign failure;
2) according to the condition b that sets the service request in the formation is selected, successively the service request dequeue of eligible b is carried out access and attempt;
Described condition b is: this service request is that all did not also carry out weights minimum in the service request that access attempts in this trigger process, and when weights are equal, gets wherein that queuing time is the longest; Described weights implication is with condition a.
That is to say:
Calculate the weights of all service request in the formation, a service request dequeue of weights minimum is carried out resource allocation attempt, promptly access is attempted; In the access cut-and-try process, if this service request is allowed to access, then this service request can connecting system, if this service request still is rejected access, then continues to put back to formation, and the formation timestamp of going into that it is original remains unchanged.Select the weights reckling of remaining service request in the formation to carry out the access trial again ... until all service request have all been passed through the access trial in the formation, then this resource discharges the process end that triggers, and waits for next time and triggering.
In a single day adopt single trigger mechanism to carry out access in the above-described embodiments and attempt, promptly have resource to discharge, RNC will check formation, and select user's dequeue to carry out access according to the condition of setting and attempt.
The present invention also can two trigger mechanisms, and its process is similar to the above embodiments, and improvements are to introduce the heartbeat timer, when the service request of queuing occurring in the formation, start the heartbeat timer, when the heartbeat timer expiry, then start heart beat cycle and trigger step; As follows:
Heart beat cycle triggers step: when the heartbeat timer expiry, start above-mentioned trigger process equally.The heart beat cycle trigger switch can also be set, described heart beat cycle trigger switch is the same with resource release trigger switch, also be two value parameters that to set by external command, whether start trigger process during at the heartbeat timer expiry by changing its on off state decision.
Adopt two trigger mechanisms to carry out access in said process and attempt, promptly no matter have resource to discharge or the heartbeat timer expiry, RNC can check formation, and selects user's dequeue to carry out access and attempt; In addition, give concrete final refusal or access in the above-described embodiments and attempt Rule of judgment, can carry out further abundant or simplification according to real network situation and concrete service needed in actual use.
The method that the present invention carries out the new business call queuing can effectively reduce the call denial rate, improves power system capacity and user's the access probability of success, and is no matter for network operation index, still for user's serviceability, all of great advantage.
The above; only for the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, and anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the content of claim.
Claims (10)
1, a kind of method of service call queuing is characterized in that, comprising:
A, the new service request that will be rejected access are stamped timestamp and are put into formation;
B, when system has resource to discharge, judge earlier that resource discharges trigger switch and whether opens, then start trigger process as if opening, described trigger process comprises:
Select the service request dequeue to carry out access successively and attempt, all service request have all been passed through the access trial in formation, and this trigger process finishes, and waits for next time and triggering.
2, the method for service call queuing according to claim 1 is characterized in that: described new service request comprises professional newly-built, professional switching, increase new business or existing business is carried out transmission channel reshuffle on existing call basis.
3, the method for service call queuing according to claim 1 is characterized in that: this method also comprises:
When the service request of queuing occurring in the formation, start timer, this timer has cycle triggering function, when timer expiry, then carries out described trigger process.
4, the method for service call queuing according to claim 3 is characterized in that: when timer expiry, judge whether the timer cycle trigger switch is opened earlier, then carry out described trigger process if open.
5, the method for service call queuing according to claim 1 is characterized in that: described service request has the maximum queuing time of setting separately; In the described trigger process, carry out successively also comprising before the access trial in selection service request dequeue: the queuing time that calculates all service request in the formation according to the timestamp of each service request, the service request that surpasses its maximum queuing time is directly deleted from formation, and carry out final user and refuse flow process.
6, the method for service call queuing according to claim 1 is characterized in that: in the access cut-and-try process, if service request is arranged by access, and this service request connecting system then; If there is service request still to be rejected access, then continue to put back to formation, the formation timestamp of going into that it is original remains unchanged.
7, the method for service call queuing according to claim 1 is characterized in that: described formation has the maximum length of setting; In the steps A new service request is put into formation and judge whether formation is full earlier before, if less than, then new service request is stamped the current time stamp and put into formation; If it is full, whether then further judge has in the formation and should and carry out the service request that final user refuses flow process by deletion from formation, if have, then this service request is deleted from formation and carried out final user and refuse flow process, new service request is stamped the current time stamp put into formation, if do not have, then new service request is carried out final user and refuse flow process.
8, the method for service call queuing according to claim 7 is characterized in that: if formation is full, if the priority of new service request is lower than the priority of all queuing service requests, then this new service request is carried out final user and refuse flow process; If the priority of new service request is higher than the priority of part or all of queuing service request, then judge whether have in the formation and should and carry out the service request that final user refuses flow process by deletion from formation according to condition a; Described condition a is: this service request is that all priority are lower than weights maximum in the queuing service request of new service request, if weights equate, get wherein that queuing time is the longest; As eligible a, then this service request is deleted from formation and carried out final user and refuse flow process; Described weights meet: the queuing time of service request is long more, priority is high more, and weights are more little.
9, the method for service call queuing according to claim 6 is characterized in that: described trigger process comprises: according to condition b the service request in the formation is selected, successively the service request dequeue of eligible b is carried out access and attempt; Described condition b is: this service request is that all did not also carry out weights minimum in the service request that access attempts in this trigger process, and when weights are equal, gets wherein that queuing time is the longest; Described weights meet: the queuing time of service request is long more, priority is high more, and weights are more little.
10, according to Claim 8 or the method for 9 described service call queuings, it is characterized in that: the computational methods of each service request weights are:
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005101017585A CN100438698C (en) | 2005-11-23 | 2005-11-23 | Method for service call queuing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005101017585A CN100438698C (en) | 2005-11-23 | 2005-11-23 | Method for service call queuing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1859738A CN1859738A (en) | 2006-11-08 |
| CN100438698C true CN100438698C (en) | 2008-11-26 |
Family
ID=37298588
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005101017585A Active CN100438698C (en) | 2005-11-23 | 2005-11-23 | Method for service call queuing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100438698C (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101193162B (en) * | 2006-11-29 | 2010-05-19 | 中兴通讯股份有限公司 | Hierarchical service routing method for customer service system |
| CN113014488B (en) * | 2021-02-22 | 2022-09-30 | 上海井星信息科技有限公司 | Weight-based multi-channel contact center unified soft queuing method |
| CN115695317B (en) * | 2022-12-23 | 2023-04-07 | 海马云（天津）信息技术有限公司 | Queuing and dequeuing method and device of access request, electronic equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6222822B1 (en) * | 1996-04-23 | 2001-04-24 | Cisco Systems, Incorporated | Method for optimizing a digital transmission network operation through transient error monitoring and control and system for implementing said method |
| CN1337130A (en) * | 1999-01-15 | 2002-02-20 | 诺基亚网络有限公司 | Flow control method in telecommunications system |
| US6738363B1 (en) * | 1999-11-05 | 2004-05-18 | Nortel Networks Limited | Method and apparatus for scheduling call admission control in satellite and wireless networks |
| CN1571574A (en) * | 2004-05-09 | 2005-01-26 | 中兴通讯股份有限公司 | A wireless communication system access control method |
| CN1856159A (en) * | 2005-04-25 | 2006-11-01 | 中兴通讯股份有限公司 | Access controlling method with rob and queue by priority in wideband CDMA system |
-
2005
- 2005-11-23 CN CNB2005101017585A patent/CN100438698C/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6222822B1 (en) * | 1996-04-23 | 2001-04-24 | Cisco Systems, Incorporated | Method for optimizing a digital transmission network operation through transient error monitoring and control and system for implementing said method |
| CN1337130A (en) * | 1999-01-15 | 2002-02-20 | 诺基亚网络有限公司 | Flow control method in telecommunications system |
| US6738363B1 (en) * | 1999-11-05 | 2004-05-18 | Nortel Networks Limited | Method and apparatus for scheduling call admission control in satellite and wireless networks |
| CN1571574A (en) * | 2004-05-09 | 2005-01-26 | 中兴通讯股份有限公司 | A wireless communication system access control method |
| CN1856159A (en) * | 2005-04-25 | 2006-11-01 | 中兴通讯股份有限公司 | Access controlling method with rob and queue by priority in wideband CDMA system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1859738A (en) | 2006-11-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4712951B2 (en) | Method for controlling the data flow granted to a communication node | |
| KR100426357B1 (en) | Scheduling Method for QoS and Resource Management in Mobile Communication System | |
| CN100414882C (en) | Wireless network controller storage resource monitoring method and system | |
| CN106250500A (en) | The dynamic management approach of database connection pool and system | |
| EP2005669A1 (en) | Prioritising data transmission | |
| CN1163010C (en) | Dynamical channel configuration method for CDMA celllar mobile communication system | |
| CN100417290C (en) | Congestion control method in No.3 generation mobile communication system | |
| CN100438698C (en) | Method for service call queuing | |
| CN108924939A (en) | The leading code distributing method of uplink for NB-IoT system area subset priority | |
| CN101272542A (en) | HSDPA scheduling method in communication system | |
| CN100551164C (en) | The acceptance controlling method of according to priority seizing and lining up in the broadband CDMA system | |
| CN106604286A (en) | LTE-U and WiFi non-authorized frequency band coexistence adaptive channel access method based on virtualized network architecture | |
| CN100514938C (en) | Method and system for controlling Iub interface band width resource in wireless network | |
| CN100353811C (en) | Up compression mode selecting method for broadband CDMA mobile communication system | |
| CN100581167C (en) | Resource access method and apparatus | |
| CN101742476B (en) | Subscription service issuing system and issuing method | |
| CN101340612B (en) | Packet scheduling method for logic channel of radio communication system | |
| CN106165520B (en) | It is a kind of to trigger method, base station equipment, user equipment and the system kept out of the way | |
| CN100433892C (en) | Method and equipment for controlling admittance of down going call in wireless mobile communication system | |
| CN100450301C (en) | Resource seizing method of WCDMA system | |
| CN101674636B (en) | Congestion control method in third generation mobile communication | |
| CN100488311C (en) | Uplink load control method and device | |
| CN100442912C (en) | Method for insuring super wireless-user immediatly accessing internet | |
| CN100415055C (en) | Wireless resource distributing process and apparatus | |
| CN102905321B (en) | Admission control method in cognitive radio network |
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 |