CN102724763B - Time domain group scheduling method on basis of two-dimensional priority level - Google Patents
Time domain group scheduling method on basis of two-dimensional priority level Download PDFInfo
- Publication number
- CN102724763B CN102724763B CN201210186495.2A CN201210186495A CN102724763B CN 102724763 B CN102724763 B CN 102724763B CN 201210186495 A CN201210186495 A CN 201210186495A CN 102724763 B CN102724763 B CN 102724763B
- Authority
- CN
- China
- Prior art keywords
- priority
- business
- dimensional
- time domain
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 25
- 101100353168 Saccharomyces cerevisiae (strain ATCC 204508 / S288c) PRI1 gene Proteins 0.000 claims description 9
- 101150103950 priS gene Proteins 0.000 claims description 9
- 238000012163 sequencing technique Methods 0.000 claims description 6
- 101100353178 Saccharomyces cerevisiae (strain ATCC 204508 / S288c) PRI2 gene Proteins 0.000 claims description 5
- 101100353177 Schizosaccharomyces pombe (strain 972 / ATCC 24843) spp2 gene Proteins 0.000 claims description 5
- 101150047682 priL gene Proteins 0.000 claims description 5
- 238000006467 substitution reaction Methods 0.000 claims description 2
- 230000003993 interaction Effects 0.000 claims 1
- 238000004891 communication Methods 0.000 abstract description 10
- 238000004364 calculation method Methods 0.000 abstract description 3
- 238000005457 optimization Methods 0.000 abstract description 3
- 230000002452 interceptive effect Effects 0.000 description 5
- 101100464170 Candida albicans (strain SC5314 / ATCC MYA-2876) PIR1 gene Proteins 0.000 description 4
- 101000881131 Homo sapiens RNA/RNP complex-1-interacting phosphatase Proteins 0.000 description 4
- 102100037566 RNA/RNP complex-1-interacting phosphatase Human genes 0.000 description 4
- 101100231811 Saccharomyces cerevisiae (strain ATCC 204508 / S288c) HSP150 gene Proteins 0.000 description 4
- 101100464174 Schizosaccharomyces pombe (strain 972 / ATCC 24843) pir2 gene Proteins 0.000 description 4
- 238000000205 computational method Methods 0.000 description 3
- 230000007812 deficiency Effects 0.000 description 2
- 230000008034 disappearance Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000011156 evaluation Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000000052 comparative effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000004069 differentiation Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000001105 regulatory effect Effects 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 230000001953 sensory effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a time domain group scheduling method on the basis of a two-dimensional priority level. The method comprises the following steps of according to the service characteristics and QoS (quality of service) requirements of different services, calculating the two-dimensional priority level of each service; comparing the urgent coefficient of each service, and sequentially arranging the priority level of each service from high urgent coefficient to low urgent coefficient; comparing the first-dimensional priority levels in the two-dimensional priority levels of the services with the same urgent coefficient, and sequentially arranging the priority level of each service according to the sequence of the first-dimensional priority levels; and comparing the two-dimensional priority levels of the services with the same first-dimensional priority level, and sequentially arranging the priority level of each service from high two-dimensional priority level to low two-dimensional priority level, wherein the calculation of time domain priority level is finished, the sequence of the priority levels is the final time domain group scheduling result. The variety, the abruptness and the multiple requirements of a service are comprehensively considered, so that the time domain group scheduling method which is applied to the current wireless communication system is obtained, and the optimization of time domain group scheduling is realized.
Description
Technical field
The invention belongs to wireless communication field, relate to a kind of time domain grouping dispatching method, particularly relate to a kind of time domain grouping dispatching method based on Two-Dimensional Priority.
Background technology
Along with the development of radio communication, increasing type of service constantly occurs.User's business demand from simple speech business expand to such as visual telephone, real-time video, Interactive Web Page browse, all kinds of multimedia services such as database retrieval.And traditional mode classification that customer service system is divided into real time business and non-real-time service, the obvious present situation that has no longer been applicable to current wireless communication system.In addition, mobile subscriber's business demand is no longer confined to the pattern of " the single business in alone family ", and at synchronization, a user may need to carry out the business service that multiple QoS performance differs greatly simultaneously.Current wireless communication system has been transitioned into the system model of " multi-user, multi-service, a user multi-service " gradually, at synchronization, the multiple users of random distribution in community, the required business of these users is various, each user may have multiple business demand simultaneously.
Traditional packet scheduling is in the time carrying out the calculating of time domain priority, take based on user or the strategy process based on business, they can meet well the sensory experience of different user or the QoS demand of different business in some degree, reasonably dispatched users or business, for follow-up Radio Resource efficient allocation is laid a good foundation.But for the present situation of current wireless communication system, the time domain grouping scheduling based on these two kinds of methods all exists deficiency.
(1) scheduling of the time domain grouping based on user, considers unified all business datums of a user, and user data packets is taked to identical priority computational methods, has ignored the traffic performance difference of different business, thereby, can not reach good user awareness.
(2) scheduling of the time domain grouping based on business, often simply business is divided into real-time, non real-time, or think that simply a user at a time only has a kind of business demand, or think that the priority of some business is definitely higher than the priority of other business, and the burst demand of many demands of the diversity of business and user, business is not joined together to consider, therefore can not adapt to well current wireless communication system.
Summary of the invention
The object of the invention is to overcome the deficiency of the above-mentioned time domain dispatching method based on Different Strategies, for " multi-user, multi-service, one user multi-service " current wireless communication system present situation, continue to use the packet scheduling strategy of " based on business ", consider the diversity of business and many demand properties of user, in retaining this scientific thought of different business absolute priority, introduce the thought of all kinds of business relative priority, a kind of Radio Resource time domain grouping dispatching method based on Two-Dimensional Priority is provided, in the hope of in Radio Resource packet scheduling, the time domain scheduling process of each user grouping is carried out reasonably optimizing, and realize corresponding optimization aim.
The present invention is directed to the wireless communication system model of current " multi-user, multi-service, a user multi-service ", the concept of " Two-Dimensional Priority " has been proposed, introduce the basic model of Two-Dimensional Priority, by the calculating comparison to Two-Dimensional Priority, obtain time domain scheduling result, thereby solve the priority computational problem of " between different user, between same user's different business ".
Specific as follows:
A time domain grouping dispatching method based on Two-Dimensional Priority, first the method comprises the steps:, according to the traffic performance of different business and qos requirement, calculates the Two-Dimensional Priority of each business; The urgent coefficient of more each business, by the descending order first priority of arranging each business successively of urgent coefficient; The first dimension priority in the identical each business Two-Dimensional Priority of more urgent coefficient, is arranged in order the priority of each business by the sequencing of the first dimension priority; Compare the Two-Dimensional Priority of each business that the first dimension priority is identical, be arranged in order the priority of each business by the descending order of Two-Dimensional Priority; Time domain priority is calculated and is finished, and gained priority sequencing is final time domain grouping scheduling result.
Described Two-Dimensional Priority is according to calculating as drag: λ
si(PIR1
i, PIR2
i), wherein, λ
sifor urgent coefficient, PRI1
ibe the first dimension priority, PRI2
ibe Two-Dimensional Priority, s is class of service, and i is customer service.
The invention has the beneficial effects as follows:
The present invention, based on traffic performance and Performance Evaluation index, introduce the thought of Two-Dimensional Priority and relative priority, many demand properties of the diversity of associating consideration business, sudden and user, by the calculating comparison of urgent coefficient, the first dimension priority, Two-Dimensional Priority, obtain a kind of time domain grouping dispatching method that is applicable to current wireless communication system present situation, realized the optimization of time domain grouping scheduling.The advantage of Two-Dimensional Priority proposed by the invention has:
(1) according to the traffic performance of different business and corresponding Performance Evaluation index, the division of business, from simply real-time, non real-time, is expanded to the defined four kinds of QoS classifications of 3GPP, the diversity of business has obtained taking into full account;
(2) introduce the thought of urgent coefficient, break in the past in the time domain grouping dispatching method based on business, absolute priority between all kinds of business is ruled characteristic, introduce the consideration of the relative priority under certain condition, greatly promote each business and accepted the fairness of service, thereby more effectively ensured the fairness of system to all kinds of business service.
(3) provide α, β, the several factor of influence coefficients of γ, η and a, b, c, tetra-urgent indexes of d, can dynamically adjust according to user's demand, thereby the user who is embodied as better different demands provides the target of satisfied service.
(4) introduce the first dimension priority, part retained business absolute priority thought, has further ensured the validity that system time domain grouping is dispatched;
(5) introduce Two-Dimensional Priority, in conjunction with current widely accepted proportional fair scheduling, add traffic performance and the performance index factor of each business, specific computational methods are provided to all kinds of specific transactions, outstanding traffic performance and performance index have been taken into account validity and fairness simultaneously.
Brief description of the drawings
Fig. 1 Two-Dimensional Priority calculation flow chart.
Fig. 2 time domain priority calculation flow chart.
Specific embodiments
The Two-Dimensional Priority that this patent proposes is as follows, and it is an expression formula:
λ
si(PIR1
i,PIR2
i)
Wherein, λ
sifor urgent coefficient, PRI1
ibe the first dimension priority, PRI2
ibe Two-Dimensional Priority, s is class of service, and i is customer service.Introduce in detail the computational methods of each factor in Two-Dimensional Priority below:
[1.1] business classification and the first dimension priority
Different types of service has different traffic performances and QoS demand, and only has the different QoS requirements of different business to be met better, and corresponding serviced user's satisfaction just can get a greater increase.Common QoS performance parameter comprises: packet delay, delay variation, throughput and packet loss rate etc.In R7,3GPP is that traffic differentiation has defined four kinds of different QoS classifications, and they are respectively conversation class, Streaming Media class, interactive class, background classes.Different application can be classified as in different classifications, as voice conversation, video session (real-time streams), video telephone etc. can be classified as conversation class, streamed multimedia, non-conversational video (buffer stream) etc. can be classified as Streaming Media class, interactive game, web page browsing, online game, live chat etc. can be classified as interactive class, and file transfer, E-mail backstage download etc. can be classified as background classes.
The traffic performance of all kinds of business is as shown in table 1:
The classification of table 1 business and traffic performance
In this patent, we introduce the classification of 3GPP business, according to the traffic performance of different business and QoS demand, business is classified, the traffic performance of same class business is similar to QoS demand, in the time carrying out time domain grouping scheduling, takes into full account traffic performance and corresponding QoS demand.
Class of service and corresponding the first dimension priority P RI1
ivalue is in table 2.
Table 2 class of service and the first dimension priority
The first dimension priority P RI1
ibe the embodiment of absolute priority between all kinds of business, its effect is subject to the restriction of urgent coefficient, and between the equal business of urgent coefficient value, the first dimension priority will participate in the calculating comparison of time domain dispatching priority; Between the unequal business of value of urgent coefficient, the first dimension priority will not participate in the calculating comparison of time domain dispatching priority.
[1.2] urgent coefficient lambda
si
The introducing of urgent coefficient, the embodiment of the thought of all kinds of business relative priority just.In the ordinary course of things, we still think and between all kinds of business, are having first priority level characteristics, i.e. conversation class > Streaming Media class > interactive class > background classes.And in burst in emergency circumstances, the first priority level characteristics between all kinds of business that occur emergency situations will be weakened to disappearance, the substitute is the relative priority level characteristics of business.
Urgent coefficient lambda
sicalculated by formula (1):
λ
si=α(WT)
a+β(RBR)
b+γ(RT)
c+η(ER)
d (1)
Wherein, α, β, γ, η are factor of influence coefficient, and what it characterized is the degrees of concern of all kinds of business to its QoS indices.According to traffic performance, the factor of influence coefficient value of all kinds of business is in table 1.Urgent coefficient lambda
siit is the embodiment of relative priority between each business.
WT is for waiting for the time delay factor, and its value is by packet awaits time WT
iwith grouping maximum delay WT
maxdetermine, if WT
i<WT
max, WT=0, otherwise
rBR is the rate requirement factor, and its value is by ensureing bit rate GBR and customer service mean data rate ave_Thrput
idetermine, if GRB<ave_Thrput
i, RBR=0, otherwise
rT is the round trip delay time factor, and its value is by round trip delay time time RT
iwith can bear grouping maximum round trip delay time RT
maxdetermine, if RT
i<RT
max, RT=0, otherwise
eR is the bit error rate factor, and its value is by acceptable reception average SNR minimum value
average with reception
determine, if
eR=0, otherwise
A, b, c, d are urgent index, what it characterized is the degree of concern of system to corresponding QoS index, also levy customer service as burst index table and wait for the urgency level of accepting scheduling, its value can distribute target to regulate according to the resource of the demand of each business and system.Such as getting a=c=1, b=d=2, represents to compare time delay, and system is more paid close attention to high efficiency and the reliability of transmission, and now factor of influence RBR, ER will show larger effect.
From analyzing above, work as λ
si=0 o'clock, we thought, now, under ordinary circumstance, are having first priority level characteristics between all kinds of business; Work as λ
siwhen >0, we think, have occurred emergency case, and the first priority level characteristics between this type of business is weakened to disappearance.Now, by regulating urgent index value size, we just can be with the relative priority between corresponding amplitude adjusted business.
[1.3] second dimension priority P RI2
i
The second dimension priority P RI2
iintroducing, be the priority in order to distinguish different user business in same class business, consider the traffic performance of different kinds of business, we take the different priority computing formula based on business.
Wherein,
for the channel self-adapting factor, it is the embodiment of system effectiveness and fairness.
Thrput
iand ave_Thrput
irepresent respectively instantaneous data rates and the mean data rate of customer service i.
[2.1] can sum up thus, the calculating of Two-Dimensional Priority comprises the following steps, and sees Fig. 1:
Step 201: introduce the classification of 3GPP business, obtain class of service s and corresponding the first dimension priority P RI1
i;
Step 202: according to corresponding factor of influence coefficient and urgent index, calculate the urgent coefficient lambda of each customer service
si;
Step 203: the second dimension priority P RI2 that is calculated each customer service by formula (2)
i;
Step 204: substitution Two-Dimensional Priority model, obtains the Two-Dimensional Priority λ of each business
si(PIR1
i, PIR2
i);
[2.2] the respective two-dimensional priority that calculates each business is expressed formula λ
si(PIR1
i, PIR2
i) after, then carry out the comparison of Two-Dimensional Priority, obtain time domain priority P RI
i, step is as Fig. 2:
Step 301: the urgent coefficient lambda of observing each business
si, judge whether to occur λ
sithe situation of >0; If do not occur, jump to step 302; If there is λ
sithe situation of >0, and λ
si=0 business number is greater than 1, by urgent coefficient lambda
sidescending order is arranged in order the priority of each business, forwards step 302 to; If there is λ
sithe situation of >0, and λ
si=0 business number is less than or equal to 1, forwards step 303 to;
Step 302: for λ
si=0 business, the first dimension priority P RI1 of more each business
i, judge whether to occur that each business first ties up the situation that priority is equal; Tie up if there is some business first situation that priority is equal, forward step 304 to; If do not occur, forward 305 to;
Step 303: by urgent coefficient lambda
sidescending order is arranged in order the priority of each business, judges whether the situation that occurs that urgent coefficient is equal, if do not occurred, forwards step 306 to; If there is the urgent equal situation of coefficient, forward step 302 to;
Step 304: by the first dimension priority P RI1
ivalue, carry out priority arrangement between traffic packets and group.To the first dimension priority P RI1
ithe each group of business that value equates, respectively the second dimension priority P RI2 of business in comparative group
i, by the second dimension priority P RI2
isize order be arranged in order service priority in the group of each service groups, until service priority is arranged and finished in the group of all service groups, next, forward step 306 to.
Step 305: by the first dimension priority P RI1
isequencing be arranged in order the priority of each business, forward step 306 to;
Step 306: Two-Dimensional Priority relatively finishes, the priority P RI now obtaining
isequencing is final time domain scheduling result.
By above step, we can compare the Two-Dimensional Priority of each business, obtain priority P RI
irank results, i.e. time domain packet scheduling result, passes to frequency domain packet scheduling device by this scheduling result, then carries out follow-up allocation of radio resources.
Claims (8)
1. the time domain grouping dispatching method based on Two-Dimensional Priority, is characterized in that, the method comprises the steps:
First,, according to the traffic performance of different business and qos requirement, calculate the Two-Dimensional Priority of each business;
In step 101, the urgent coefficient of more each business, by the descending order first priority of arranging each business successively of urgent coefficient;
In step 102, the first dimension priority in the identical each business Two-Dimensional Priority of more urgent coefficient, is arranged in order the priority of each business by the sequencing of the first dimension priority;
In step 103, compare the Two-Dimensional Priority of each business that the first dimension priority is identical, be arranged in order the priority of each business by the descending order of Two-Dimensional Priority;
In step 104, time domain priority is calculated and is finished, and gained priority sequencing is final time domain grouping scheduling result;
Described urgent coefficient table is shown: λ
si=α (WT)
a+ β (RBR)
b+ γ (RT)
c+ η (ER)
d, wherein, α, β, γ, η are factor of influence coefficient, what it characterized is the degrees of concern of all kinds of business to its QoS indices; WT is for waiting for the time delay factor, and its value is by packet awaits time WT
iwith grouping maximum delay WT
maxdetermine, if WT
i<WT
max, WT=0, otherwise
rBR is the rate requirement factor, and its value is by ensureing bit rate GBR and customer service mean data rate ave_Thrput
idetermine, if GRB<ave_Thrput
i, RBR=0, otherwise
rT is the round trip delay time factor, and its value is by round trip delay time time RT
iwith can bear grouping maximum round trip delay time RT
maxdetermine, if RT
i<RT
max, RT=0, otherwise
eR is the bit error rate factor, and its value is by acceptable reception average SNR minimum value
with reception average SNR
determine, if
eR=0, otherwise
a, b, c, d are urgent index, and what it characterized is the degree of concern of system to corresponding QoS index, also levy customer service as burst index table and wait for the urgency level of accepting scheduling.
2. the time domain grouping dispatching method based on Two-Dimensional Priority according to claim 1, is characterized in that, described Two-Dimensional Priority is according to calculating as drag: λ
si(PRI1
i, PRI2
i), wherein, λ
sifor urgent coefficient, PRI1
ibe the first dimension priority, PRI2
ibe Two-Dimensional Priority, s is class of service, and i is customer service.
3. the time domain grouping dispatching method based on Two-Dimensional Priority according to claim 1, is characterized in that: the value of a, b, c, d distributes target to regulate according to the resource of the demand of each business and system.
4. the time domain grouping dispatching method based on Two-Dimensional Priority according to claim 3, is characterized in that: get a=c=1, b=d=2.
5. the time domain grouping dispatching method based on Two-Dimensional Priority according to claim 2, is characterized in that, described the first dimension priority is according to the traffic performance of different business and the QoS demand assignment of classifying, assignment is as follows: session service, class 1, s=1, PRI1
i=4; Streaming Media class business, class 2, s=2, PRI1
i=3; Interaction service, class 3, s=3, PRI1
i=2; Background business, class 4, s=4, PRI1
i=1.
6. the time domain grouping dispatching method based on Two-Dimensional Priority according to claim 1, is characterized in that, between the equal business of urgent coefficient value, the first dimension priority will participate in the calculating comparison of time domain dispatching priority; Between the unequal business of value of urgent coefficient, the first dimension priority will not participate in the calculating comparison of time domain dispatching priority.
7. the time domain grouping dispatching method based on Two-Dimensional Priority according to claim 1, is characterized in that, the second described dimension priority list is shown:
Wherein,
for the channel self-adapting factor, Thrput
iand ave_Thrput
irepresent respectively instantaneous data rates and the mean data rate of customer service i.
8. the time domain grouping dispatching method based on Two-Dimensional Priority according to claim 1, is characterized in that, described Two-Dimensional Priority is to obtain as follows:
In step 201, introduce the classification of 3GPP business, obtain class of service s and corresponding the first dimension priority P RI1
i;
In step 202, according to corresponding factor of influence coefficient and urgent index, calculate the urgent coefficient lambda of each customer service
si;
In step 203, calculate the second dimension priority P RI2 of each customer service
i;
In step 204, substitution Two-Dimensional Priority model, obtains the Two-Dimensional Priority λ of each business
si(PRI1
i, PRI2
i).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210186495.2A CN102724763B (en) | 2012-06-07 | 2012-06-07 | Time domain group scheduling method on basis of two-dimensional priority level |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210186495.2A CN102724763B (en) | 2012-06-07 | 2012-06-07 | Time domain group scheduling method on basis of two-dimensional priority level |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102724763A CN102724763A (en) | 2012-10-10 |
| CN102724763B true CN102724763B (en) | 2014-11-05 |
Family
ID=46950367
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210186495.2A Expired - Fee Related CN102724763B (en) | 2012-06-07 | 2012-06-07 | Time domain group scheduling method on basis of two-dimensional priority level |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102724763B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104066193A (en) * | 2014-06-06 | 2014-09-24 | 电信科学技术研究院 | Scheduling method and device |
| CN107580340B (en) * | 2016-07-05 | 2020-01-17 | 普天信息技术有限公司 | Resource scheduling method in V2X network |
| CN110298522A (en) * | 2018-03-22 | 2019-10-01 | 阿里巴巴集团控股有限公司 | The management method and device of work item |
| US10691490B2 (en) * | 2018-07-06 | 2020-06-23 | Apple Inc. | System for scheduling threads for execution |
| CN110121213B (en) * | 2019-03-22 | 2022-06-28 | 全球能源互联网研究院有限公司 | Multi-service resource scheduling method and device |
| CN111428973B (en) * | 2020-03-11 | 2024-04-12 | 慧镕电子系统工程股份有限公司 | Virtual resource allocation method capable of effectively improving resource utilization rate |
| CN112243255B (en) * | 2020-10-14 | 2023-06-09 | 中国联合网络通信集团有限公司 | Determination method and device for scheduling priority |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1870769A (en) * | 2005-05-26 | 2006-11-29 | 华为技术有限公司 | Arbitration method and unit of cross connection matrix based on priority propagation |
| CN102110022A (en) * | 2011-03-22 | 2011-06-29 | 上海交通大学 | Sensor network embedded operation system based on priority scheduling |
-
2012
- 2012-06-07 CN CN201210186495.2A patent/CN102724763B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1870769A (en) * | 2005-05-26 | 2006-11-29 | 华为技术有限公司 | Arbitration method and unit of cross connection matrix based on priority propagation |
| CN102110022A (en) * | 2011-03-22 | 2011-06-29 | 上海交通大学 | Sensor network embedded operation system based on priority scheduling |
Non-Patent Citations (4)
| Title |
|---|
| 多优先级队列分组调度研究;蒋维成;《中国优秀硕士学位论文》;20091015(第2009年第10期);第4.1.1节 * |
| 漆华妹等.软交换网络中基于多维QoS目标优先级调度机制.《万方会议论文》.2006,第3节. * |
| 蒋维成.多优先级队列分组调度研究.《中国优秀硕士学位论文》.2009,(第2009年第10期),第4.1.1节. * |
| 软交换网络中基于多维QoS目标优先级调度机制;漆华妹等;《万方会议论文》;20061231;第3节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102724763A (en) | 2012-10-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102724763B (en) | Time domain group scheduling method on basis of two-dimensional priority level | |
| CN104079501B (en) | Queue scheduling method based on multiple priorities | |
| CN102014052B (en) | Virtual dynamic priority packet dispatching method | |
| CN101111070B (en) | Fairness resource scheduling method based on resource scheduling in broadband wireless access system | |
| CN103248965B (en) | A kind of transmission of video array dispatching method based on approximate time delay | |
| CN101790239A (en) | Packet dispatching method and forward service dispatcher | |
| CN103442412B (en) | A kind of network selecting method based on Weighted optimal bipartite graph matching | |
| CN102075440A (en) | Service-quality-sensitive 802.11e multimedia data grouping scheduling method | |
| CN104093009A (en) | Video transmission method in wireless self-organized network on basis of network utility | |
| CN104009936A (en) | Queue scheduling method based on dynamic weight calculation | |
| CN102025732A (en) | Dynamic adaptive cognitive network quality of service (QoS) mapping method | |
| CN107197530B (en) | Downlink resource allocation algorithm for channel fluctuation perception in LTE system | |
| CN104619034A (en) | Real-time service-oriented packet scheduling method for LTE communication system | |
| CN103929374A (en) | Multilevel queue scheduling method based on service type | |
| CN113328879B (en) | Cloud data center network QoS (quality of service) guaranteeing method based on network calculus | |
| CN107204930B (en) | Token adding method and device | |
| Navarro-Ortiz et al. | Quality of experience based resource sharing in IEEE 802.11 e HCCA | |
| CN102769914B (en) | Fair scheduling method based on mixed businesses in wireless network | |
| CN110636014A (en) | Satellite network queue scheduling algorithm based on traffic self-similarity characteristic | |
| CN103987122B (en) | Cluster multimedia service downlink radio resource dispatching method under TD LTE public networks | |
| CN101175064B (en) | Forwarding periodic line scheduling method based on service quality | |
| CN101924793B (en) | P2P streaming media-based secondary coding play method and system | |
| CN104969644A (en) | Resource allocation method and apparatus | |
| WO2019161552A1 (en) | Method for dynamically adjusting bandwidth | |
| Yoon et al. | Weighted bandwidth sharing scheme to guarantee the video quality in home networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20141105 Termination date: 20180607 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |