CN102223668B - Resource seizing method for long term evolution (LTE) system during service congestion - Google Patents
Resource seizing method for long term evolution (LTE) system during service congestion Download PDFInfo
- Publication number
- CN102223668B CN102223668B CN201010148707.9A CN201010148707A CN102223668B CN 102223668 B CN102223668 B CN 102223668B CN 201010148707 A CN201010148707 A CN 201010148707A CN 102223668 B CN102223668 B CN 102223668B
- Authority
- CN
- China
- Prior art keywords
- business
- candidate
- seizing
- preempted
- service
- 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
Abstract
The invention discloses a resource seizing method for a long term evolution (LTE) system during service congestion, comprising the following steps: determining 'a seizing service', 'a seized service queue' and 'candidate services' which are distributed with the priority lower than that of the seizing service in the seized service queue; and selecting m candidate services in the seized service queue, wherein, the accumulated sum of available bit rate (ABR) of the m candidate services is larger than the ABR of the seizing service in the acceptation and refusing directions of the seizing service, while the accumulated sum of the ABR of m-1 candidate services is smaller or equal to the ABR of the seizing service; if the m candidate services exist, performing forced release processing on the m selected candidate services, accepting the seized service to finish the seizing process; and if the m candidate services do not exist, determining that the seizing is failed, and putting the seizing service into a failure acceptation list. By utilizing the method, the services with high access bit rate and low priority can be selectively released, thus ensuring to seize the high-priority services accessed by the user.
Description
Technical field
The present invention relates to mobile communication technology field, relate in particular to the resource seizing method while there is traffic congestion in Long Term Evolution LTE (Long TermEvolution) system.
Background technology
At the hot zones of LTE system applies, in the time running into the activities such as great rally or match, can there is at short notice the situation of a large number of users connecting system, the resource occupation fast rise of system, receives refusal if there is subsequently service access just to there will be again.From operator's angle, wishing provides the service of differentiation to the user of different brackets, and so when congested when occurring, hope can guarantee that high-priority users still can communicate by connecting system by technological means.
Under limited resources supplIes, if the mode that access service can only be seized by resource again could access, thus the resource realization access that high-priority users is seized low priority user.User's priority is that operator works out according to user's CAMEL-Subscription-Information, being reflected in business is exactly ARP (the distribution maintenance priority of service bearer, Allocation and Retention Priority) priority, its effective value is 1～14, the corresponding priority of the less expression of numeral is higher, can can ARP have also pointed out the attribute of seizing of this service bearer, that is: seize others and be seized by others.
When the first acceptance judging failure of request of business foundation or modification, can think that now system has occurred congested, and in order to guarantee the business admission of high priority, just need to seize the service resources of low priority, thereby reach the object of receiving high-priority service by discharging low priority traffice.
In published domestic and international patent, the patent No. is the method for pre-emptively having provided in the Chinese patent " resource seizing method in a kind of WCDMA system " of CN 100450301 when congested in WCDMA system, firmly blocked or soft block for system, toll breakdown a user or then a business judges whether unblocking at every turn, if can not unblocking, also need to continue to toll breakdown.Because needs judge whether unblocking repeatedly, and only toll breakdown a user or business at every turn, have the complicated and problem such as more consuming time of flow process, can cause the advanced level user that can not seize for need in time that the consequence of resource is provided, thereby the business that affects advanced level user is set up, affect user and experience.
Summary of the invention
Technical problem to be solved by this invention is, resource seizing method when traffic congestion in Long Term Evolution LTE system is provided, when solving in LTE system traffic congestion how fast and effectively for high-priority users is carried out the problem that resource is seized, guarantee the access of high-priority users business when congested, improve user's satisfaction.
In order to address the above problem, the resource seizing method while the present invention proposes traffic congestion in a kind of Long Term Evolution LTE system, comprising:
What receiving was refused has the business of seizing attribute as " seizing business ", will be have there is the business composition " being preempted service queue " that can be preempted attribute in access service, in being preempted service queue, distribute keep priority lower than the access service of seizing business as " candidate's business ";
From be preempted service queue, choose m candidate's business, described m candidate's business is greater than the ABR of the business of seizing in the cumulative sum of access bit rate ABR of seizing business admission refusal direction, and the cumulative sum of the ABR of m-1 candidate's business is less than or equal to the ABR of the business of seizing;
If there is described m candidate's business, described m candidate's business selecting all tolled breakdown to discharge and process, to receive seizing business, preemption processes is complete.
Described method further comprises: if there is no described m candidate's business, seize failure, and this is seized to business and puts into receiving failed list.
Further, the described concrete selection mode of choosing m candidate's business from be preempted service queue is:
By thering is the business that can be preempted attribute according to distributing maintenance priority ARP to sort from high to low in access service, same ARP rank is sorted from low to high according to the access bit rate ABR that seizes business admission refusal direction, obtain and be preempted service queue;
Being preempted in service queue after sequence finds first to keep candidate's business of priority ARP lower than the distribution of seizing business, first candidate's business to tail of the queue is all this candidate's business of seizing of seizing business thus, and from tail of the queue toward team, a direction order is chosen m candidate's business.
Further, the described concrete selection mode of choosing m candidate's business from be preempted service queue is:
By thering is the business that can be preempted attribute according to distributing maintenance priority ARP to sort from low to high in access service, same ARP rank is sorted from high to low according to the access bit rate ABR that seizes business admission refusal direction, obtain and be preempted service queue;
Being preempted in service queue after sequence, keeping the candidate business of priority ARP to last lower than the distribution of seizing business from team's head is all this candidate's business of seizing of seizing business, m candidate's business from team's head starts to choose.
Further, the described concrete selection mode of choosing m candidate's business from be preempted service queue is:
From be preempted service queue, keep, in candidate's business of priority ARP, choosing at random m candidate's business lower than the distribution of seizing business.
Further, the described concrete selection mode of choosing m candidate's business from be preempted service queue is:
To in access service, there is the business that can be preempted attribute according to distributing maintenance priority ARP order from high to low or from low to high to sort, same ARP rank is sorted from high to low according to the access bit rate ABR that seizes business admission refusal direction, obtain and be preempted service queue;
Being preempted in service queue lower than the distribution of seizing business from sequence keeps choosing at random m candidate's business in candidate's business of priority ARP.
Further, the described concrete selection mode of choosing m candidate's business from be preempted service queue is:
From keeping candidate's business of priority ARP lower than the distribution of seizing business, sort from high to low according to the access bit rate ABR that seizes business admission refusal direction, obtain and be preempted service queue;
From the candidate's business sequence, choose m candidate's business according to access bit rate ABR order from high to low.
Further, the described concrete selection mode of choosing m candidate's business from be preempted service queue is:
From keeping candidate's business of priority ARP lower than the distribution of seizing business, sort from high to low according to the access bit rate ABR that seizes business admission refusal direction, identical access bit rate ABR sorts from low to high to obtain by ARP priority and is preempted service queue;
From the candidate's business sequence, choose in descending order m candidate's business according to access bit rate ABR.
The number m of described m candidate's business, value is natural number, m is less than or equal to total number of whole candidate's business.
Resource seizing method in LTE system of the present invention when traffic congestion, compared to existing technology, because resource is dynamic dispatching, do not need the unblocking that judges whether repeatedly, and according to the disposable selection forced release service of the bearer service speed number of seizing business, avoided repeatedly judge whether congested consuming time.In the time of resource congestion, because the present invention can select forced release service according to access bit rate under priority same case, if system hardware and software is processed also enough used times of resource, apply resource seizing method of the present invention, optionally preferentially first remove access bit rate large business, thereby can guarantee to toll breakdown few business of trying one's best, and what toll breakdown is all low priority user, thereby the business that guarantees to seize user and access high priority, has improved the satisfaction of high-end user to operator.
Accompanying drawing explanation
Fig. 1 is the flow chart of realizing resource seizing method in the embodiment of the present invention.
Embodiment
For making the object, technical solutions and advantages of the present invention clearer, below in conjunction with accompanying drawing, the present invention is described in further detail.
While the present invention is directed in LTE system traffic congestion, may cause high-priority users because receiving refusal cannot guarantee the problem of the service access of high-priority users, a kind of resource seizing method has been proposed, seize the required resource of business by calculating, select multiplely to toll breakdown lower than the access service of seizing service priority, realize and toll breakdown once multiple access service, receive seizing business, can realize fast and effectively resource seizes, guarantee the access of high-priority users business when congested, thereby improve user's satisfaction.
The business of receiving for the first time refusal as the user who seizes business, can seize that to carry before other resource be that it has the ability that can seize other service resources, and its ARP priority wants enough height, higher than the ARP priority of the access service of being tolled breakdown.
As the access service that can be preempted of candidate's business, its ARP priority is lower than seizing its business of seizing, and will have the attribute that can be preempted.
Carrying out resource while seizing, the resource quantity of seizing is to determine according to the speed characteristic of seizing the speed characteristic of business and being preempted business.Seize business if GBR (guarantees bit rate, GuaranteedBitrate) its ABR (access bit rate of business, Access Bitrate) equal GBR, if NGBR (non-ensured bit rate, Non Guaranteed Bitrate) business, its ABR equals PBR (priority bit rate, Priority Bitrate).
Resource seizing method in Long Term Evolution LTE system in the present embodiment when traffic congestion, as shown in Figure 1, comprising:
Step 1: keep priority ARP according to distributing, what receiving was refused has the business of seizing attribute as " seizing business ", will be have there is the business composition " being preempted service queue " that can be preempted attribute in access service, in being preempted service queue, distribute keep priority lower than the access service of seizing business as " candidate's business ";
Step 2: choose m candidate's business from be preempted service queue, described m candidate's business is greater than the ABR of the business of seizing in the cumulative sum of access bit rate ABR of seizing business admission refusal direction, and the cumulative sum of the ABR of m-1 candidate's business is less than or equal to the ABR of the business of seizing;
Step 3: judge whether to exist m candidate's business of the condition that meets step 2, if there is described m candidate's business, described m candidate's business selecting all tolled breakdown to discharge and process, receive seizing business, preemption processes is complete.
Described method further comprises: if there is no described m candidate's business, seize failure, and this is seized to business and puts into receiving failed list.Now, described in expression, be preempted and allly in service queue keep the cumulative sum of the access bit rate ABR of candidate's business of priority ARP to seize the access bit rate ABR of business described in being less than lower than the distribution of seizing business.
The number m of described m candidate's business, value is natural number, m is less than or equal to total number of whole candidate's business.
The business of seizing is that up-admission is limited, and candidate's forced release service just sorts according to up ABR in the time that ARP is identical, while selecting forced release service to count, also selects according to up ABR; If descending acceptance is limited, candidate's forced release service just sorts according to descending ABR in the time that ARP is identical, while selecting forced release service to count, also selects according to descending ABR.
Wherein: choose m candidate's business from be preempted service queue time, its selection mode comprises following six kinds:
The first: will there is the business that can be preempted attribute according to distributing maintenance priority ARP to sort from high to low in access service, same ARP rank is sorted from low to high according to the access bit rate ABR that seizes business admission refusal direction, obtain and be preempted service queue;
Being preempted in service queue after sequence finds first to keep candidate's business of priority ARP lower than the distribution of seizing business, and from then on business to tail of the queue is all this candidate's business of seizing of seizing business, and chooses m candidate's business from tail of the queue toward team's head order.
The second: will there is the business that can be preempted attribute according to distributing maintenance priority ARP to sort from low to high in access service, same ARP rank is sorted from high to low according to the access bit rate ABR that seizes business admission refusal direction, obtain and be preempted service queue;
The team's head being preempted in service queue after sequence is all this candidate's business of seizing of seizing business to last lower than candidate's business of the distribution maintenance priority ARP that seizes business, m candidate's business from team's head starts to choose.
The third: is according to the sortord from high to low described in the first or according to the sortord from low to high described in the second, sequence obtains and is preempted service queue, being preempted in service queue from sequence keeps, in candidate's business of priority ARP, choosing at random m candidate's business lower than the distribution of seizing business.
The 4th kind: do not sort to being preempted queue, only from be preempted service queue, keep, in candidate's business of priority ARP, choosing at random m candidate's business lower than the distribution of seizing business.
The 5th kind: from keeping candidate's business of priority ARP lower than the distribution of seizing business, sort from high to low according to the access bit rate ABR that seizes business admission refusal direction, obtain and be preempted service queue; From the candidate's business sequence, choose in descending order m candidate's business according to access bit rate ABR.
The 6th kind: from keeping candidate's business of priority ARP lower than the distribution of seizing business, sort from high to low according to the access bit rate ABR that seizes business admission refusal direction, identical access bit rate ABR sorts from low to high to obtain by ARP priority and is preempted service queue; From the candidate's business sequence, choose in descending order m candidate's business according to access bit rate ABR.
Choose m candidate's business as example to sort from high to low according to ARP priority below, the resource seizing method shown in Fig. 1 is elaborated, its detailed process that realizes that resource seizes is:
Step 11: the business that can be preempted in access service is sorted from high to low according to ARP priority, business in same ARP priority sorts from low to high according to the access bit rate ABR of the receiving refusal direction of seizing user, forms the service queue that is preempted after sequence;
Step 12: being preempted from described sequence found in service queue lower than first that seize business ARP value and be preempted business as starting point, from starting point to tail of the queue, be all to be seized business and carry out candidate's business that resource is seized by this, choose m candidate's business from tail of the queue toward front sequence, the cumulative sum of the access bit rate ABR of this m candidate's business is greater than the ABR of the business of seizing, and the cumulative sum of the access bit rate ABR of m-1 candidate's business is less than or equal to the ABR of the business of seizing.
Step 13: if there is such m candidate's business, the m selecting candidate's business all will be tolled breakdown to discharge and be processed, tolls breakdown and receives seizing business afterwards, and preemption processes is complete; If there is no such m candidate's business, does not toll breakdown, and seizes failure, and the business of seizing is put into receiving failed list.Now, described in expression, be preempted and allly in service queue keep the cumulative sum of the access bit rate ABR of candidate's business of priority ARP to seize the access bit rate ABR of business described in being less than lower than the distribution of seizing business.
Can be with reference to the concrete mode of implementation step shown in Fig. 1 and corresponding selection m candidate's business in conjunction with implementing for other the five kinds execution modes of choosing m candidate's business.
Embodiment mono-
Suppose a business with the descending acceptance refusal of the ability of seizing, it distributes and keeps priority ARP is 3, and guaranteed bit rate for downlink GBR is 256kbps, and descending access bit rate ABR is 256kbps.
Suppose to access and there is the service bearer that is preempted attribute and have:
An ARP is 5, the business that descending GBR is 128kbps, hereinafter referred ARP5GBR128;
An ARP is 6, the business that descending GBR is 64kbps, hereinafter referred ARP6GBR64;
An ARP is 7, the business that descending GBR is 32kbps, hereinafter referred ARP7GBR32;
An ARP is 8, the business that descending GBR is 32kbps, hereinafter referred ARP8GBR32;
An ARP is 9, the business that descending GBR is 128kbps, hereinafter referred ARP9GBR128;
An ARP is 7, the NGBR business that descending PBR is 64kbps, hereinafter referred ARP7NGBR64;
An ARP is 8, the NGBR business that descending PBR is 64kbps, hereinafter referred ARP8NGBR64;
An ARP is 8, the NGBR business that descending PBR is 32kbps, hereinafter referred ARP8NGBR32;
An ARP is 10, the NGBR business that descending PBR is 8kbps, hereinafter referred ARP10NGBR8.
Step 101: (ARP value is less according to ARP priority by the service bearer having accessed, priority is higher) from high to low, when identical ARP, obtain being preempted queue according to descending ABR (because the business of seizing is descending acceptance refusal) sequence from low to high:
ARP5GBR128、ARP6GBR64、ARP7GBR32、ARP7NGBR64、ARP8GBR32、ARP8NGBR32、ARP8NGBR64、ARP9GBR128、ARP10NGBR8。
Wherein, the business that the low business of ARP priority is can not preempting priority high, according to priority height sequence can be known the selectable starting point that is preempted business fast, and the object that ABR chooses is from low to high to guarantee that the business number of tolling breakdown when (ARP is minimum) selection is tolled breakdown from tail of the queue is as far as possible few.
Step 102: the ARP that seizes business is 3, access service ARP is minimum is at present 5, so access service can be seized by this business, can serve as candidate's business, the ABR cumulative sum of five business that start from tail of the queue is 8+128+64+32+32=264, be greater than the service rate 256 of the business of seizing, and the ABR cumulative sum of four business that start from tail of the queue is 8+128+64+32=232, be less than and seize service rate 256, so the forced release service of selecting is five (m=5): ARP8GBR32 of tail of the queue, ARP8NGBR32, ARP8NGBR64, ARP9GBR128, ARP10NGBR8.
Step 103: toll breakdown these five business of selecting in step 102, then receive seizing business, seize complete.
Embodiment bis-
Suppose a business with the descending acceptance refusal of the ability of seizing, it distributes and keeps priority ARP is 8, and descending GBR is 512kbps, and descending ABR is 512kbps.
Suppose to access and there is the service bearer that is preempted attribute and have:
An ARP is 6, the business that descending GBR is 64kbps, hereinafter referred ARP6GBR64;
An ARP is 7, the business that descending GBR is 32kbps, hereinafter referred ARP7GBR32;
An ARP is 9, the NGBR business that descending PBR is 64kbps, hereinafter referred ARP9NGBR64;
An ARP is 10, the business that descending GBR is 128kbps, hereinafter referred ARP10GBR128;
An ARP is 11, the NGBR business that descending PBR is 32kbps, hereinafter referred ARP11NGBR32;
An ARP is 12, the NGBR business that descending PBR is 16kbps, hereinafter referred ARP12NGBR16.
Step 201: (ARP value is less according to ARP priority by the carrying of access service, priority is higher) from high to low, when identical ARP, sort from low to high according to descending ABR (because the business of seizing is descending acceptance refusal): ARP6GBR64, ARP7GBR32, ARP9NGBR64, ARP10GBR128, ARP11NGBR32, ARP12NGBR16.
Step 202: the ARP that seizes business is 8, so the first two business in queue can not be preempted, preemptible candidate business is:
ARP9NGBR64、ARP10GBR128、ARP11NGBR32、ARP12NGBR16。
The ABR that the cumulative sum 240 of the ABR of all candidate's business is less than the business of seizing is 512, can not find m the candidate's business satisfying condition.
Step 203: even if toll breakdown all candidate's business in step 202, can not guarantee that the business of seizing can access, so do not toll breakdown, seize failure, the business of seizing is put into receiving failed list.
Embodiment tri-
Suppose a business with the up-admission refusal of the ability of seizing, it distributes and keeps priority ARP is 3, and up assurance bit rate GBR is 256kbps, and up access bit rate ABR is 256kbps.
Suppose to access and there is the service bearer that is preempted attribute and have:
An ARP is 5, the business that up GBR is 128kbps, hereinafter referred ARP5GBR128;
An ARP is 6, the business that up GBR is 64kbps, hereinafter referred ARP6GBR64;
An ARP is 7, the business that up GBR is 32kbps, hereinafter referred ARP7GBR32;
An ARP is 8, the business that up GBR is 32kbps, hereinafter referred ARP8GBR32;
An ARP is 9, the business that up GBR is 16kbps, hereinafter referred ARP9GBR16;
An ARP is 7, the NGBR business that up PBR is 64kbps, hereinafter referred ARP7NGBR64;
An ARP is 8, the NGBR business that up PBR is 64kbps, hereinafter referred ARP8NGBR64;
An ARP is 8, the NGBR business that up PBR is 32kbps, hereinafter referred ARP8NGBR32;
An ARP is 10, the NGBR business that up PBR is 8kbps, hereinafter referred ARP10NGBR8.
Step 301: sequentially (ARP value is less from low to high according to ARP priority by the service bearer having accessed, priority is higher), when identical ARP, obtain being preempted queue according to up ABR (because the business of seizing is up-admission refusal) sequence from high to low:
ARP10NGBR8、ARP9GBR16、ARP8NGBR64、ARP8GBR32、ARP8NGBR32、ARP7NGBR64、ARP7GBR32、ARP6GBR64、ARP5GBR128。
Wherein, the business that the low business of ARP priority is can not preempting priority high, according to priority sequence can be known selectable starting point and the end point that is preempted business fast from low to high, and the object that ABR chooses is from high to low to guarantee that the business number of tolling breakdown is as far as possible few.
Step 302: the ARP that seizes business is 3, access service ARP is minimum is at present 5, so access service can be seized business and seizes by this, can serve as candidate's business, before queue, the ABR cumulative sum of 8 business is 8+16+64+32+32+64+32+64=312 > 256, be greater than the service rate of the business of seizing, and front 7 cumulative sums are 248 < 256, so the forced release service of selecting is 8 (m=8): ARP10NGBR8 above, ARP9GBR16, ARP8NGBR64, ARP8GBR32, ARP8NGBR32, ARP7NGBR64, ARP7GBR32, ARP6GBR64,
Step 303: toll breakdown these 8 business of selecting in step 302, then receive seizing business, seize complete.
Embodiment tetra-
According to the sortord of embodiment mono-or three, obtain respectively ARP priority from high to low, from low to high be preempted service queue, can from be preempted the candidate's business service queue, choose at random m candidate's business, need guarantee that the cumulative sum of the access bit rate ABR of m candidate's business is greater than the ABR of the business of seizing, and the cumulative sum of the ABR of m-1 candidate's business is less than or equal to the ABR of the business of seizing.If there is m candidate's business, toll breakdown, receive seizing business; Otherwise, do not toll breakdown, seize failure, the business of seizing is put into receiving failed list.
Embodiment five
Suppose a business with the descending acceptance refusal of the ability of seizing, it distributes and keeps priority ARP is 3, and guaranteed bit rate for downlink GBR is 256kbps, and descending access bit rate ABR is 256kbps.
Suppose to access and there is the service bearer that is preempted attribute and have:
An ARP is 5, the business that descending GBR is 128kbps, hereinafter referred ARP5GBR128;
An ARP is 6, the business that descending GBR is 64kbps, hereinafter referred ARP6GBR64;
An ARP is 7, the business that descending GBR is 32kbps, hereinafter referred ARP7GBR32;
An ARP is 8, the business that descending GBR is 32kbps, hereinafter referred ARP8GBR32;
An ARP is 9, the business that descending GBR is 16kbps, hereinafter referred ARP9GBR16;
An ARP is 7, the NGBR business that descending PBR is 64kbps, hereinafter referred ARP7NGBR64;
An ARP is 8, the NGBR business that descending PBR is 64kbps, hereinafter referred ARP8NGBR64;
An ARP is 8, the NGBR business that descending PBR is 32kbps, hereinafter referred ARP8NGBR32;
An ARP is 10, the NGBR business that descending PBR is 8kbps, hereinafter referred ARP10NGBR8.
Step 501: the ARP that seizes business is 3, access service ARP is minimum is at present 5, so access service can be seized by this business, can serve as candidate's business, the descending access bit rate of service bearer ABR (because the business of seizing the is descending acceptance refusal) sequence from high to low lower than seizing business ARP priority having accessed is obtained being preempted queue:
ARP5GBR128、ARP8NGBR64、ARP7NGBR64、ARP6GBR64、ARP8GBR32、ARP8NGBR32、ARP7GBR32、ARP9GBR16、ARP10NGBR8。
Wherein, sort from low to high and guarantee that the preferred ARP of forced release service starting from team's head is low by ARP priority for identical access bit rate ABR, and the object that ABR chooses is from high to low to guarantee that the business number of tolling breakdown is as far as possible few.
Step 502: before queue, the ABR cumulative sum of three business is 128+64+64=256, equal the service rate of the business of seizing, and will select ABR cumulative sum to be greater than to seize service rate, so the forced release service selected is four (m=4): ARP5GBR128, ARP8NGBR64, ARP7NGBR64, ARP6GBR64 above.
Step 503: toll breakdown these four business of selecting in step 502, then receive seizing business, seize complete.
The foregoing is only embodiments of the invention, be not limited to the present invention, for a person skilled in the art, the present invention can have various modifications and variations.Within the spirit and principles in the present invention all, any modification of doing, be equal to replacement, improvement etc., within all should being included in claim scope of the present invention.
Claims (8)
1. resource seizing method when traffic congestion in Long Term Evolution LTE system, comprising:
What receiving was refused has the business of seizing attribute as seizing business, be preempted service queue by thering is the business composition that can be preempted attribute in access service, in being preempted service queue, distribute keep priority lower than the access service of seizing business as candidate's business;
From be preempted service queue, choose m candidate's business, described m candidate's business is greater than the ABR of the business of seizing in the cumulative sum of access bit rate ABR of seizing business admission refusal direction, and the cumulative sum of the ABR of m-1 candidate's business is less than or equal to the ABR of the business of seizing;
If there is described m candidate's business, described m candidate's business selecting all tolled breakdown to discharge and process, to receive seizing business, preemption processes is complete.
2. resource seizing method as claimed in claim 1, is characterized in that, described method further comprises:
If there is no described m candidate's business, seizes failure, and this is seized to business and puts into receiving failed list.
3. resource seizing method as claimed in claim 1 or 2, is characterized in that, the described concrete selection mode of choosing m candidate's business from be preempted service queue is:
By thering is the business that can be preempted attribute according to distributing maintenance priority ARP to sort from high to low in access service, same ARP rank is sorted from low to high according to the access bit rate ABR that seizes business admission refusal direction, obtain and be preempted service queue;
Being preempted in service queue after sequence finds first to keep candidate's business of priority ARP lower than the distribution of seizing business, first candidate's business to tail of the queue is all this candidate's business of seizing business thus, and from tail of the queue toward team, a direction order is chosen m candidate's business.
4. resource seizing method as claimed in claim 1 or 2, is characterized in that, the described concrete selection mode of choosing m candidate's business from be preempted service queue is:
By thering is the business that can be preempted attribute according to distributing maintenance priority ARP to sort from low to high in access service, same ARP rank is sorted from high to low according to the access bit rate ABR that seizes business admission refusal direction, obtain and be preempted service queue;
Being preempted in service queue after sequence, keeping the candidate business of priority ARP to last lower than the distribution of seizing business from team's head is all this candidate's business of seizing business, m candidate's business from team's head starts to choose.
5. resource seizing method as claimed in claim 1 or 2, is characterized in that, the described concrete selection mode of choosing m candidate's business from be preempted service queue is:
From be preempted service queue, keep, in candidate's business of priority ARP, choosing at random m candidate's business lower than the distribution of seizing business.
6. resource seizing method as claimed in claim 1 or 2, is characterized in that, the described concrete selection mode of choosing m candidate's business from be preempted service queue is:
To in access service, there is the business that can be preempted attribute according to distributing maintenance priority ARP order from high to low or from low to high to sort, same ARP rank is sorted from high to low according to the access bit rate ABR that seizes business admission refusal direction, obtain and be preempted service queue;
Being preempted in service queue lower than the distribution of seizing business from sequence keeps choosing at random m candidate's business in candidate's business of priority ARP.
7. resource seizing method as claimed in claim 1 or 2, is characterized in that, the described concrete selection mode of choosing m candidate's business from be preempted service queue is:
From keeping candidate's business of priority ARP lower than the distribution of seizing business, sort from high to low according to the access bit rate ABR that seizes business admission refusal direction, obtain and be preempted service queue;
From the candidate's business sequence, choose m candidate's business according to access bit rate ABR order from high to low.
8. resource seizing method as claimed in claim 1 or 2, is characterized in that, the described concrete selection mode of choosing m candidate's business from be preempted service queue is:
From keeping candidate's business of priority ARP lower than the distribution of seizing business, sort from high to low according to the access bit rate ABR that seizes business admission refusal direction, identical access bit rate ABR sorts from low to high to obtain by ARP priority and is preempted service queue;
From the candidate's business sequence, choose in descending order m candidate's business according to access bit rate ABR.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010148707.9A CN102223668B (en) | 2010-04-15 | 2010-04-15 | Resource seizing method for long term evolution (LTE) system during service congestion |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010148707.9A CN102223668B (en) | 2010-04-15 | 2010-04-15 | Resource seizing method for long term evolution (LTE) system during service congestion |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102223668A CN102223668A (en) | 2011-10-19 |
| CN102223668B true CN102223668B (en) | 2014-07-02 |
Family
ID=44780065
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010148707.9A Active CN102223668B (en) | 2010-04-15 | 2010-04-15 | Resource seizing method for long term evolution (LTE) system during service congestion |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102223668B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103517342A (en) * | 2012-06-21 | 2014-01-15 | 中兴通讯股份有限公司 | Adaptive Trap message treatment method and device |
| CN103582028A (en) * | 2013-11-15 | 2014-02-12 | 大唐移动通信设备有限公司 | Core network side user resource management method and device |
| CN104053183B (en) * | 2014-05-07 | 2017-11-24 | 华东师范大学 | A kind of method for managing network resource of LTE system |
| CN104320854B (en) * | 2014-10-21 | 2018-03-06 | 中国联合网络通信集团有限公司 | Resource regulating method and device |
| KR20160071603A (en) * | 2014-12-12 | 2016-06-22 | 삼성전자주식회사 | Method and Apparatus for controlling congestion in a wireless communication system |
| CN109213594B (en) * | 2017-07-06 | 2022-05-17 | 阿里巴巴集团控股有限公司 | Resource preemption method, device, equipment and computer storage medium |
| CN109450803B (en) * | 2018-09-11 | 2022-05-31 | 阿里巴巴（中国）有限公司 | Traffic scheduling method, device and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1753389A (en) * | 2005-11-01 | 2006-03-29 | 清华大学 | Method of real time soft seizing wave length route photo network |
| CN1805588A (en) * | 2005-01-10 | 2006-07-19 | 华为技术有限公司 | Method of allocating cell resources |
| CN1980456A (en) * | 2005-12-02 | 2007-06-13 | 中兴通讯股份有限公司 | Resource seizing method of WCDMA system |
-
2010
- 2010-04-15 CN CN201010148707.9A patent/CN102223668B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1805588A (en) * | 2005-01-10 | 2006-07-19 | 华为技术有限公司 | Method of allocating cell resources |
| CN1753389A (en) * | 2005-11-01 | 2006-03-29 | 清华大学 | Method of real time soft seizing wave length route photo network |
| CN1980456A (en) * | 2005-12-02 | 2007-06-13 | 中兴通讯股份有限公司 | Resource seizing method of WCDMA system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102223668A (en) | 2011-10-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102223668B (en) | Resource seizing method for long term evolution (LTE) system during service congestion | |
| KR100426357B1 (en) | Scheduling Method for QoS and Resource Management in Mobile Communication System | |
| CN106470169A (en) | A kind of service request method of adjustment and equipment | |
| EP1695581B1 (en) | Method and device for managing resources shared by different operators in a communication system | |
| US8165021B2 (en) | Policy-based resource management | |
| CN104918283B (en) | A kind of jamming control method and equipment | |
| CN101674602B (en) | Resource allocating method of shared network and device thereof | |
| EP2374246B1 (en) | Admission control systems and methods | |
| WO2001056323A1 (en) | Pre-emptive bandwidth allocation by dynamic positioning | |
| US8600767B2 (en) | Bid-based control of networks | |
| CN102238068B (en) | Message transmitting method and system | |
| US5778320A (en) | Method for allocating communication resources among groups of communication units | |
| CN101868000A (en) | Method, device and base station for preempting resources | |
| CN108681481B (en) | Service request processing method and device | |
| CN100417290C (en) | Congestion control method in No.3 generation mobile communication system | |
| CN104053183A (en) | Network resource management method of LTE system | |
| CN100551164C (en) | The acceptance controlling method of according to priority seizing and lining up in the broadband CDMA system | |
| US20170223541A1 (en) | Method and apparatus for controlling access to a telecommunications network | |
| CN101674636B (en) | Congestion control method in third generation mobile communication | |
| CN100450301C (en) | Resource seizing method of WCDMA system | |
| CN110839249A (en) | Service control method, system, control device and storage medium | |
| CN101753423A (en) | Method and device for managing traffic | |
| CN106851748B (en) | Channel allocation method and device | |
| CN112242877B (en) | Data transmission method, device and system | |
| CN109429335B (en) | Method and equipment for seizing cluster voice users across operators |
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 |