CN100385863C - Media resource distributing method - Google Patents
Media resource distributing method Download PDFInfo
- Publication number
- CN100385863C CN100385863C CNB2005101214329A CN200510121432A CN100385863C CN 100385863 C CN100385863 C CN 100385863C CN B2005101214329 A CNB2005101214329 A CN B2005101214329A CN 200510121432 A CN200510121432 A CN 200510121432A CN 100385863 C CN100385863 C CN 100385863C
- Authority
- CN
- China
- Prior art keywords
- resource
- website
- service ability
- service
- channel utilization
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The present invention relates to a media resource distributing method which comprises the following steps: based on service abilities, resource stations in a system are graded and divided into different resource queues; based on the service abilities of the resource stations, which are requested by resource distributing requests, the resource queues are accessed in a certain order; when a resource station in some resource queue has the lowest passage utilization radio and has idle resources, the resources of the resource station are distributed. The order of arrangement of the resource stations in each of the resource queues can be ranked based on the ascending order or the descending order of the passage utilization radio; the access order of the resource queues can be ranked based on the from-weak-to-strong order of the service abilities of the resource stations. The present invention overcomes that the existing resource distributing methods have the defects of low-speed response to the resource distributing requests, influenced service quality and insufficient customer experiences; the present invention improves the efficiency and the speed of resource distribution at the same time that the balance of the resource distribution between the resource stations is satisfied, and the service ability summation of the system is improved as far as possible.
Description
Technical field
The present invention relates to the telecommunication technology field, relate in particular to a kind of media resource allocation method.
Background technology
In the field of telecommunications, in a system that service is provided, may comprise the resource of a lot of variety classeses and different service ability, different resources provides different service ability, and these service ability are including, but not limited to following content:
1, playing alert tones
2, DTMF (dual-tone multifrequency) input and reception
3, the generation of dtmf signal and transmission
4, recording
5, send fax
6, receive faxes
7, the detection and the reception of FSK (frequency shift keying) signal
8, the generation of fsk signal and transmission
9, literary composition language conversion (TTS)
10, speech recognition (ASR)
11, script is explained and is carried out
12, explanation and the execution of user interactive script UIScript (User Interactive Script)
A passage in the website is meant in certain service access, and the logical block of certain or certain several resource service can be provided.
Website is the unit of a resource management, and a website comprises a passage that certain service ability is provided at least.Usually, physically relevant or resource together is divided in a website, and the passage in the same website, all has identical resource capability.In other words, can think " attribute which resource capability a passage has ", with " website has the attribute of which resource capability ", be identical notion.
Passage in same website is shared the common resource of this website, such as the flow of the disposal ability of the disposal ability of CPU (central processing unit), DSP (digital signal processor), network interface, internal memory etc.When the current channel utilization index in the website increases, correspondingly can cause these passages to take the increase of the common resource of this website.General, when the utilization rate of resources such as CPU, the DSP of a website, network interface flow, internal memory reached certain thresholding, the utilization rate of these public resources was high more, and the service response speed of this website can slow down thereupon, even has influence on customer experience.
When the current occupancy of passage in the website reached certain numerical value, the utilization rate of the public resource of this website can reach or surpass a thresholding, and this moment, the response speed of service began to slow down thereupon.So, needing resource allocation algorithm, Resources allocation evenly between a plurality of websites as best one can takes place to reduce certain website that service is provided makes service quality descend because channel utilization index is too high phenomenon.
Different resource websites may provide different service ability.A resource allocation algorithm need select the website that can satisfy service request that service is provided between a plurality of resource websites.A resource allocation algorithm, the service ability of selected website must comprise the requirement of this time resource service.
A resource website may provide one or more service ability, and in other words, the passage that the resource website is interior may provide one or more service ability.Such as a resource website (interior passage) has service ability, dtmf signal detection and the service ability, the generation of dtmf signal and the service ability of transmission that receive of playing alert tones, the service ability of recording simultaneously.Conspicuous, if there are two or more resource websites all to satisfy the once requirement of service, but the quantity difference of the service ability that each resource website comprises, a resource service algorithm, should select to satisfy in a plurality of websites of this service request that website that the service ability that comprises is minimum.
When a resource allocation algorithm is received a resource allocation request,, in the middle of a plurality of resource websites, select one and can satisfy the resource website that service request requires according to the service ability that requires in the resource allocation request.A resource allocation algorithm needs the cost regular hour when the resource website of resource allocation request is satisfied in search.If the overlong time that resource allocation algorithm searching resource website is spent will cause and can not influence the customer experience of serviced object for the user provides service timely, reduce the quality that service is provided.So require a resource allocation algorithm, distribute one to satisfy the resource website that resource request requires as quickly as possible.
For a resource allocation algorithm, the speed of resource allocation is also different under the different situations.Usually, the influence provide service quality be the Expected Response time and the worst-case response time of a resource allocation algorithm.The Expected Response time of a resource allocation algorithm is meant in all cases, according to the probability that different situations take place, the mean value of the time that resource allocation algorithm spent.The worst-case response time of a resource allocation algorithm is meant in all cases, the value of the maximum time of resource allocation algorithm cost.
A resource allocation algorithm efficiently, should satisfy following requirement:
R1: the channel utilization index of each website is tended to balance; This just requires a resource allocation algorithm when resource allocation request of response, distributes the minimum resource website of channel utilization index as far as possible.
R2: the service ability summation that system is provided is high as much as possible; This just requires a resource allocation algorithm in response during a resource allocation request, distributes the website (passage) that satisfies the service ability minimum that request requires as far as possible, has the resource of higher service ability with reservation, satisfies the request that higher service ability requires;
R3: the speed of resource allocation is fast as much as possible, to improve service quality and customer experience; This just requires a resource allocation algorithm to improve the Expected Response time as far as possible, and worst-case response time is limited within the scope that can tolerate.
Resource allocation algorithm of the prior art is positioned over all resource websites that can distribute passage in the formation, and resource allocation algorithm is not dynamically adjusted the position of website in formation according to certain specific principle.As shown in Figure 1, resource allocation algorithm is searched for according to following steps:
1, when receiving a resource allocation request, resource allocation algorithm is retrieved resource websites all in the formation successively, judges whether this website satisfies the requirement of resource request.
2, when resource allocation algorithm finds first resource website that satisfies the request for allocation requirement, this website of mark.
3, find follow-uply when satisfying the resource website of request for allocation when resource allocation algorithm, the service ability of this resource website and the resource website of mark are before compared;
3.1 if the service ability of the resource website of mark is stronger before this resource website ratio, then continue to judge next resource website;
3.2 if the service ability of the resource website of mark is more weak before this resource website ratio, the next resource website of the then current resource website of mark, and continuation judgement;
3.3 if the service ability of the resource website of mark is identical or suitable before this resource website ratio, then carry out step 4;
4, the channel utilization index of this resource website and the resource website of mark are before compared;
If 4.1 the channel utilization index of this website than before resource website higher of mark, then continue to judge next website;
4.2 if the resource website of the channel utilization index of this website and mark before is identical or lower, the current resource website of mark then, and continue to judge next resource website;
5, after the judgement of finishing all resource websites, if markd resource website then returns this resource website; If do not have the resource website of mark, then return failure.
The shortcoming of prior art is: this resource allocation algorithm, though satisfy above-mentioned R1 and R2 rule.But for the possible situation of institute, resource allocation algorithm all must be judged all resource websites.The quantity of resource website is big more, and the time that resource allocation algorithm response first resource request for allocation is spent is just many more.When the resource website reaches certain quantity, resource allocation algorithm can not respond a resource allocation request in time, thereby influence service quality and customer experience.
Summary of the invention
Technical problem to be solved by this invention is: overcome the existing resources distribution method to the resource allocation request low-response, influence the deficiency of service quality and customer experience, a kind of resource allocation methods is provided, satisfy resource allocation between the resource website balance and improve system service ability summation as far as possible in, improve efficiency of resource distribution and speed.
Media resource allocation method provided by the invention may further comprise the steps:
Station resource in the system is pressed service ability carry out classification, be divided into different resource queues;
According to the service ability of desired resource website in the resource allocation request, access resources formation in certain sequence;
When the resource website that channel utilization index is minimum in certain resource queue is had time not busy resource, the resource of distributing this resource website.
Wherein, described when carrying out classification by service ability, the station resource in the system to be pressed the difference that service ability is provided be divided into different resource queues, the resource website in each resource queue provides kind identical service ability.
Wherein, the order of described access resources formation is the order that grows from weak to strong by resource website service ability.
Wherein, the station resource in the described resource queue is pressed the sequence arrangement of channel utilization index, during the access resources formation, only judges whether the resource website of the position that channel utilization index is minimum in the formation has idling-resource.
Further optimize, described sequence arrangement can be by the ascending order of channel utilization index or descending, during the access resources formation, only judges whether first or last the resource website in the formation has idling-resource.
Wherein, when distributing or discharging the resource of a website, recomputate the channel utilization index of website, and adjust the position of this website in formation, the height of station resource in the formation being pressed channel utilization index sorts.
Beneficial effect of the present invention is: adopt this multilevel feedback queue algorithm of the present invention, can realize resource allocation efficiently, following advantage is specifically arranged:
1) each resource queue arranges according to the ascending order (or descending) of the channel utilization index of resource website, receive resource allocation request at every turn, first resource websites in Resources allocation formation when descending (or last website) all, this website are minimum those of current channel utilization index in the resource website of equal service ability.So this resource allocation algorithm meets the requirement that the channel utilization index that makes each resource website tends to balance;
2) station resource point is divided into a plurality of formations according to service ability, during the resource allocation algorithm Resources allocation, in a plurality of resource queues, select the resource website according to different service ability according to different orders, promptly each more weak resource website of distribution services ability of all attempting earlier.So, this resource allocation algorithm, the service ability summation that system is provided is high as much as possible.
3) during the resource allocation algorithm Resources allocation, only visit first (or last) resource website of each resource queue.In actual applications in most cases, the resource quantity in the system all can be greater than the usage quantity of reality, and both each resource request all can have idle resource can supply to distribute.And in this case, this resource allocation algorithm only needs resource queue of visit just can find the resource that will distribute.Because the number of resource queue is limited in one the scope, so for the first resource assigning process, the time that resource allocation algorithm spent also limits within the specific limits, as seen, the Expected Response time of this resource allocation algorithm and worst-case response time are all very short.
In sum, this resource efficiently of the present invention algorithm tends to balance the resource utilization between a plurality of resource websites, has improved the service ability summation that system provided as much as possible, and makes the Expected Response time of resource allocation and worst-case response time all very short.
Description of drawings
Fig. 1 is an existing resource allocation process flow chart;
Fig. 2 carries out the principle schematic of resource allocation for the present invention adopts resource queue's stage division.
Embodiment
With embodiment the present invention is described in further detail with reference to the accompanying drawings below:
In order to solve the problem of existing resource allocation algorithm and similar resource allocation algorithm dispensing rate and efficient, the present invention adopts a kind of multi-level feedback data structure, satisfy resource allocation between the resource website balance and improve system service ability summation as far as possible in, improve efficiency of resource distribution and speed.
One, resource queue's classification
In a system that service is provided, different resource websites may be supported different service ability, and perhaps different resource websites may be supported the server-capabilities of varying number.According to the different service ability of website, divide different resource queues.
When distributing a kind of resource capability, may visit different resource queues.For the resource allocation request of different service ability, allocation algorithm is according to different sequential access resource queues.
By following rule, realize adopting the mode of multi-queue, the management resource website:
1, all the resource websites in resource queue provide kind identical service ability;
2, the resource website in the same formation is arranged according to the ascending order (also can be descending) of the channel utilization index of resource website;
3, during Resources allocation,, adopt the different a plurality of resource queues of sequential search to different service ability.
As shown in Figure 2, the present invention adopts multi-queue to realize that resource allocation illustrates as follows:
1, resource website 0, website 1, website 2 have service ability A, are arranged among the Res A of resource queue in sequencing queue structure (can adopt doubly linked list);
2, the channel utilization index of resource website 0 is Price 0, and the channel utilization index of website 1 is Price 1, and the channel utilization index of website 2 is Price 2;
3, the numerical relation of channel utilization index is as follows: Price 0≤Price 1≤Price 2;
4, resource website 3 has service ability B, in the Res B of resource queue;
5, resource website 4 and website 5 have service ability A and service ability B, are arranged in the sequencing queue structure among the Res A+B of resource queue;
6, the channel utilization index of resource website 4 and website 5 has relation: Price 4≤Price 5;
7, resource website 6 has service ability A and service ability C, in the Res A+C of resource queue;
8, for the request for allocation of service ability A, the search order of resource allocation algorithm between resource queue is: [Res A] → [Res A+B] → [Res A+C];
9, for the request for allocation of service ability B, the search order of resource allocation algorithm between resource queue is: [Res B] → [Res A+B]
10, for the request for allocation of service ability C, the search order of resource allocation algorithm between resource queue is: [Res A+C]
Two, Resources allocation in multi-queue
When resource allocation algorithm is received a resource allocation request, according to following steps searching resource website:
1, according to the service ability of desired resource website in the resource allocation request, obtains the order of searching resource formation;
2, according to the search order of resource queue, access resources formation successively;
3, when the free not busy resource of first resource website in certain resource (channel utilization index of this resource website less than 100% time), the resource of distributing this resource website.
Three, the feedback of formation
After the resource of having distributed certain resource website, recomputate the channel utilization index of this website, and this website is adjusted to suitable position in the sequencing queue structure, and keep the channel utilization index of the resource website in this resource queue to keep ascending order (or descending) according to channel utilization index.
After the resource that has discharged certain resource website, recomputate the channel utilization index of this website, and this website is adjusted to suitable position in the sequencing queue structure, and keep the channel utilization index of the resource website in this resource queue to keep ascending order (or descending) according to channel utilization index.
Utilize this multilevel feedback queue algorithm of the present invention, can realize resource allocation efficiently:
1) each resource queue arranges according to the ascending order (or descending) of the channel utilization index of resource website, receive resource allocation request at every turn, first resource websites in Resources allocation formation when descending (or last website) all, this website are minimum those of current channel utilization index in the resource website of equal service ability.So this resource allocation algorithm meets the requirement that the channel utilization index that makes each resource website tends to balance;
2) station resource point is divided into a plurality of formations according to service ability, during the resource allocation algorithm Resources allocation, in a plurality of resource queues, select the resource website according to different service ability according to different orders, both each all more weak resource website of distribution services ability of attempting earlier.So, this resource allocation algorithm, the service ability summation that system is provided is high as much as possible.
3) during the resource allocation algorithm Resources allocation, only visit first (or last) resource website of each resource queue.In actual applications in most cases, the resource quantity in the system all can be greater than the usage quantity of reality, and promptly each resource request all can have idle resource can supply to distribute.And in this case, this resource allocation algorithm only needs resource queue of visit just can find the resource that will distribute.Because the number of resource queue is limited in one the scope, so for the first resource assigning process, the time that resource allocation algorithm spent also limits within the specific limits, as seen, the Expected Response time of this resource allocation algorithm and worst-case response time are all very short.
This resource efficiently of the present invention algorithm tends to balance the resource utilization between a plurality of resource websites, has improved the service ability summation that system provided as much as possible, and makes the Expected Response time of resource allocation and worst-case response time all very short.
Those skilled in the art do not break away from essence of the present invention and spirit, can there be the various deformation scheme to realize the present invention, the above only is the preferable feasible embodiment of the present invention, be not so limit to interest field of the present invention, the equivalence that all utilizations specification of the present invention and accompanying drawing content are done changes, and all is contained within the interest field of the present invention.
Claims (5)
1. a media resource allocation method is characterized in that, may further comprise the steps:
Station resource in the system is pressed service ability carry out classification, be divided into different resource queues;
According to the service ability of desired resource website in the resource allocation request, the sequential access resource queue that grows from weak to strong by resource website service ability;
When the resource website that channel utilization index is minimum in the accessed resource queue is had time not busy resource, the resource of distributing this resource website.
2. media resource allocation method according to claim 1, it is characterized in that: described when carrying out classification by service ability, station resource in the system is pressed the difference that service ability is provided be divided into different resource queues, the resource website in each resource queue provides kind identical service ability.
3. media resource allocation method according to claim 1 and 2, it is characterized in that: the station resource in the described resource queue is pressed the sequence arrangement of channel utilization index, during the access resources formation, only judge whether the resource website of the position that channel utilization index is minimum in the formation has idling-resource.
4. media resource allocation method according to claim 3, it is characterized in that: described sequence arrangement is by the ascending order of channel utilization index or descending, during the access resources formation, only judge whether first or last the resource website in the formation has idling-resource.
5. media resource allocation method according to claim 3, it is characterized in that: when distributing or discharging the resource of a website, recomputate the channel utilization index of website, and adjust the position of this website in formation, the height of station resource in the formation being pressed channel utilization index sorts.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005101214329A CN100385863C (en) | 2005-12-29 | 2005-12-29 | Media resource distributing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005101214329A CN100385863C (en) | 2005-12-29 | 2005-12-29 | Media resource distributing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1866864A CN1866864A (en) | 2006-11-22 |
| CN100385863C true CN100385863C (en) | 2008-04-30 |
Family
ID=37425755
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005101214329A Expired - Fee Related CN100385863C (en) | 2005-12-29 | 2005-12-29 | Media resource distributing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100385863C (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1463099A (en) * | 2003-06-18 | 2003-12-24 | 清华大学 | Scheduling method for ensuring service quality of real time operation in OFDM |
| US6782535B1 (en) * | 1999-08-30 | 2004-08-24 | Creo Inc. | Dynamic queue width system and method |
| US6845154B1 (en) * | 2001-01-23 | 2005-01-18 | Intervoice Limited Partnership | Allocation of resources to flexible requests |
| CN1589442A (en) * | 2001-10-05 | 2005-03-02 | Bea系统公司 | System for application server messaging with multiple dispatch pools |
| CN1606301A (en) * | 2004-07-09 | 2005-04-13 | 清华大学 | A resource access shared scheduling and controlling method and apparatus |
| CN1620782A (en) * | 2002-02-22 | 2005-05-25 | 连宇通信有限公司 | Priority control method in wireless pocket data channel |
| CN1685747A (en) * | 2002-11-13 | 2005-10-19 | 中兴通讯股份有限公司 | Forward-link rate scheduling method and scheduler |
-
2005
- 2005-12-29 CN CNB2005101214329A patent/CN100385863C/en not_active Expired - Fee Related
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6782535B1 (en) * | 1999-08-30 | 2004-08-24 | Creo Inc. | Dynamic queue width system and method |
| US6845154B1 (en) * | 2001-01-23 | 2005-01-18 | Intervoice Limited Partnership | Allocation of resources to flexible requests |
| CN1589442A (en) * | 2001-10-05 | 2005-03-02 | Bea系统公司 | System for application server messaging with multiple dispatch pools |
| CN1620782A (en) * | 2002-02-22 | 2005-05-25 | 连宇通信有限公司 | Priority control method in wireless pocket data channel |
| CN1685747A (en) * | 2002-11-13 | 2005-10-19 | 中兴通讯股份有限公司 | Forward-link rate scheduling method and scheduler |
| CN1463099A (en) * | 2003-06-18 | 2003-12-24 | 清华大学 | Scheduling method for ensuring service quality of real time operation in OFDM |
| CN1606301A (en) * | 2004-07-09 | 2005-04-13 | 清华大学 | A resource access shared scheduling and controlling method and apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1866864A (en) | 2006-11-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1097913C (en) | ATM throttling | |
| CN102076091B (en) | Distribution method, apparatus for signal path assignment and base station control equipment of signal path | |
| US6898635B2 (en) | Mobile communication system and method of selecting server in mobile communication system | |
| CN1422506A (en) | Grade of service and fairness policy for bandwidth reservation system | |
| CN101986619A (en) | Bandwidth reservation-based VSAT satellite communication system bandwidth distribution method | |
| KR970012201A (en) | On-demand video system and video scheduling method of the system, physical resource scheduling method of on-demand customer service system, computer readable memory | |
| CN111163238B (en) | Intelligent scheduling method of online customer service system | |
| CN102223454B (en) | Method and apparatus for seat arrangement of call center | |
| CN1808951A (en) | Channel priority queuing method in multi-carrier communication system | |
| CN110460879B (en) | Video request scheduling method, device, server and storage medium | |
| CN103746934A (en) | CDN bandwidth balancing method, CDN control center and system | |
| GB2381996A (en) | Network bandwidth optimization method and system | |
| CN107666407B (en) | Service package selection method, device and system | |
| CN108055701B (en) | Resource scheduling method and base station | |
| CN1541002A (en) | Calling acception controller and calling acception control method | |
| CN1317180A (en) | Method for allocating/sharing resources among several communication network subscribers | |
| CN111741079A (en) | Micro-service architecture based interface processing method and system | |
| CN107493607A (en) | Network resource allocation method and Internet resources distributor | |
| CN112988354B (en) | Satellite communication system outbound resource optimization management method | |
| CN111586867B (en) | Resource allocation method and device of SCMA (sparse code multiple access) system | |
| CN100385863C (en) | Media resource distributing method | |
| CN102143053A (en) | Method, device and system for transmitting data | |
| CN100415055C (en) | Wireless resource distributing process and apparatus | |
| CN107911484B (en) | Message processing method and device | |
| CN103546872A (en) | Paging message sending method in trunking communication system |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080430 Termination date: 20121229 |