CN116112448A - Broadband resource allocation scheduling method - Google Patents
Broadband resource allocation scheduling method Download PDFInfo
- Publication number
- CN116112448A CN116112448A CN202310173267.XA CN202310173267A CN116112448A CN 116112448 A CN116112448 A CN 116112448A CN 202310173267 A CN202310173267 A CN 202310173267A CN 116112448 A CN116112448 A CN 116112448A
- Authority
- CN
- China
- Prior art keywords
- link
- broadband
- scheduling
- resource allocation
- time
- 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.)
- Pending
Links
- 238000013468 resource allocation Methods 0.000 title claims abstract description 58
- 238000000034 method Methods 0.000 title claims abstract description 49
- 238000004364 calculation method Methods 0.000 claims description 4
- 230000005251 gamma ray Effects 0.000 claims description 4
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 239000013589 supplement Substances 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/80—Actions related to the user profile or the type of traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/821—Prioritising resource allocation or reservation requests
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/822—Collecting or measuring resource availability data
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to the technical field of broadband resource allocation, and particularly discloses a broadband resource allocation scheduling method, which comprises the following steps: s1, acquiring historical broadband resource occupation data of each link of a resource pool, and acquiring an initial broadband resource allocation strategy according to the historical broadband resource occupation data of the links; s2, carrying out broadband resource scheduling according to an initial broadband resource allocation strategy, acquiring real-time broadband resource occupation data of each link, and dynamically scheduling broadband resources allocated to each link according to the data of each link and the real-time broadband resource occupation data; the method can provide the allocation duty ratio matched with the use state of each link, and when the use state of the broadband resources of the links is higher, the dynamic scheduling is carried out according to the specific conditions of other links, so that the influence of the broadband resource scheduling process on the normal operation of other links is reduced, and the ordered dynamic allocation of the resources of each link is further ensured.
Description
Technical Field
The invention relates to the technical field of broadband resource allocation, in particular to a broadband resource allocation scheduling method.
Background
With the rapid development of internet technology, the application of network resources has taken up important links of production and life, so that in normal operation of many industries, the application needs to be realized by means of broadband resources, and the stability of network bandwidth can affect the normal operation of many industries, so that the network bandwidth needs to be ensured to meet corresponding requirements.
The existing broadband resource allocation scheduling method is mainly used for dynamically adjusting according to the real-time link bandwidth occupation degree so as to ensure that the bandwidth occupation requirements of all links can be met, and meanwhile, the bandwidth use requirements of all links can be met as much as possible.
However, this approach is prone to mutual effects when the bandwidth occupation of each link is high, resulting in that the demands of part of the links are not satisfied, and meanwhile, the basic bandwidth demands of part of the links may also be affected, thereby affecting the satisfaction of the basic demands.
Disclosure of Invention
The invention aims to provide a broadband resource allocation scheduling method, which solves the following technical problems:
how to meet the requirement of the link broadband resources and ensure the orderly dynamic allocation of the link resources.
The aim of the invention can be achieved by the following technical scheme:
a broadband resource allocation scheduling method, the method comprising:
s1, acquiring historical broadband resource occupation data of each link of a resource pool, and acquiring an initial broadband resource allocation strategy according to the historical broadband resource occupation data of the links;
s2, broadband resource scheduling is carried out according to an initial broadband resource allocation strategy, real-time broadband resource occupation data of each link are obtained, and broadband resources allocated to each link are dynamically scheduled according to the data of each link and the real-time broadband resource occupation data.
In one embodiment, the initial wideband resource allocation policy is obtained by:
s11, acquiring historical broadband resource occupation data of each link of a resource pool and analyzing and acquiring real-time occupation ratio Or of the link in a historical period i (t)；
S12, through the formula
Calculating to obtain a historical resource occupation coefficient of the ith link;
wherein t is 0 For a first preset period of time, n (Or' i (t) =0) is Or i (t) at t-t 0 Deriving the number of 0 s by time t; f (f) z A table function is referenced for the segment; max (Or) i (t)) is t-t 0 Up to t period maximum occupancy, min (Or i (t)) is t-t 0 The minimum occupation ratio of the period of time t is reached, Y is a quantized piecewise function, and x is a preset adjustment coefficient;
s13, through the formula
Calculating to obtain initial broadband resource allocation duty ratio P of ith link i ；
Wherein N is the number of links in the resource pool, i.e. [1, N ].
In one embodiment, the process of dynamically scheduling the broadband resources allocated by each link includes:
dividing all resources of a resource pool into unit parts in advance, and distributing the unit parts according to an initial broadband resource distribution ratio P i To assign a corresponding unit share to each link;
acquiring real-time occupation information of each link, and determining a current state value of the link according to the real-time and historical occupation information of the link;
and when any link state value exceeds a corresponding preset threshold value, determining a resource allocation scheduling strategy according to the current state values of other links.
In one embodiment, the method for calculating the current state value of the link is as follows:
acquiring historical occupation data of the link before the current time and the current time point;
by the formula
Calculating to obtain the current state value W of the ith link i ；
Wherein t is 1 For a second preset period, alpha is a weight adjustment coefficient;
to the current state value W i And a preset threshold W th And (3) performing comparison:
if W is i ≥W th Executing a resource allocation scheduling strategy;
otherwise, maintaining the link initial wideband resource allocation duty cycle P i 。
In an embodiment, the resource allocation scheduling policy includes:
acquisition of W i ＜W th And are arranged in order from small to large;
according to the current state value W of the ith link i And obtaining the scheduled unit number, calling one unit number each time according to the unit number according to the arrangement order, and circularly obtaining the corresponding unit number.
In one embodiment, the method for obtaining the number of scheduled units is as follows:
by formula n adi ＝[f x (W i -W th )*P i ]+1 calculation to obtain the number of units n adi ；
Wherein f x For presetting a comparison table function]To round the symbol.
In an embodiment, the resource allocation scheduling policy includes:
acquisition of W i ＜W th According to W i Is arranged according to the size and priority order of the (a);
according to the current state value W of the ith link i And obtaining the scheduled unit number, calling one unit number each time according to the unit number according to the arrangement order, and circularly obtaining the corresponding unit number.
In one embodiment, the sequential arrangement is as follows:
by the formula
Calculating to obtain a sequencing value Sort of the link, and arranging according to the sequence from the small Sort to the large Sort;
wherein Tp is the priority value of the link, and the higher the priority of the link, the greater the Tp value; gamma ray 1 、γ 2 Is a preset weight coefficient.
The invention has the beneficial effects that:
(1) According to the invention, the initial broadband resource allocation strategy is determined according to the historical broadband resource occupation data of each link, and then the broadband resources allocated to each link are dynamically scheduled according to the data of each link and the real-time broadband resource occupation data, so that the allocation duty ratio matched with the use state of each link can be provided for each link, and when the use state of the broadband resources of the links is higher, the dynamic scheduling is carried out according to the specific conditions of other links, so that the influence of the broadband resource scheduling process on the normal operation of other links is reduced, and the ordered dynamic allocation of the resources of each link is further ensured.
(2) The invention can preferentially call the space of the idle link, and avoids the risk of influencing the link by single call in a cyclic call mode, namely, the orderly dynamic allocation of the resources of each link is ensured.
(3) The invention can avoid the larger influence of the resource allocation scheduling process on the links with higher priority, thereby meeting the different service requirements of different links.
Drawings
The invention is further described below with reference to the accompanying drawings.
FIG. 1 is a flow chart of steps of a wideband resource allocation scheduling method of the present invention;
fig. 2 is a step flow chart of step S1 of the wideband resource allocation scheduling method of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Referring to fig. 1, in one embodiment, a method for scheduling wideband resource allocation is provided, where the method includes:
s1, acquiring historical broadband resource occupation data of each link of a resource pool, and acquiring an initial broadband resource allocation strategy according to the historical broadband resource occupation data of the links;
s2, broadband resource scheduling is carried out according to an initial broadband resource allocation strategy, real-time broadband resource occupation data of each link are obtained, and broadband resources allocated to each link are dynamically scheduled according to the data of each link and the real-time broadband resource occupation data.
According to the technical scheme, the method for broadband resource allocation scheduling in the embodiment determines an initial broadband resource allocation strategy according to the historical broadband resource occupation data of each link, and then dynamically schedules the broadband resources allocated to each link according to the data of each link and the real-time broadband resource occupation data.
As an embodiment of the present invention, referring to fig. 2, the initial wideband resource allocation policy is obtained by the following steps:
s11, acquiring historical broadband resource occupation data of each link of a resource pool and analyzing and acquiring real-time occupation ratio Or of the link in a historical period i (t)；
S12, through the formula
/>
Calculating to obtain a historical resource occupation coefficient of the ith link;
wherein t is 0 For a first preset period of time, n (Or' i (t) =0) is Or i (t) at t-t 0 Deriving the number of 0 s by time t; f (f) z A table function is referenced for the segment; max (Or) i (t)) is t-t 0 Up to t period maximum occupancy, min (Or i (t)) is t-t 0 The minimum occupation ratio of the period of time t is reached, Y is a quantized piecewise function, and x is a preset adjustment coefficient;
s13, through the formula
Calculating to obtain initial broadband resource allocation duty ratio P of ith link i ；
Wherein N is the number of links in the resource pool, i.e. [1, N ].
Through the above technical solution, this embodiment provides a method for obtaining an initial wideband resource allocation policy, by first obtaining historical wideband resource occupation data of each link in a resource pool and analyzing and obtaining real-time occupation ratio Or of the link in a historical period i (t) and then pass through the formula
Calculating to obtain historical resource occupation coefficient of ith link, wherein n (Or' i (t) =0) is Or i (t) at t-t 0 The number derived to time t is 0, it is apparent that when the occupancy status of the link fluctuates more, n (Or' i The larger the value of (t) =0), the piecewise reference table function f z Obtained by fitting empirical data, according to n (Or' i Setting corresponding values in different regions where the (t) =0 value is located, thus f z (n(Or′ i (t) =0)) exhibits a fluctuation stable condition of the link,
then embody the link at t 0 The accumulated occupation state in the time period is obtained by fitting the quantized piecewise function Y and the preset adjustment coefficient x according to data, thereby passing through the historical resource occupation coefficient O Li Further, the occupation status of the broadband resources of the current link can be judged by +.>
Calculating to obtain initial broadband resource allocation duty ratio P of ith link i And the allocation process of the initial broadband resource is realized.
It should be noted that the first preset period t 0 The selective setting is not limited herein, depending on the specific application.
As one embodiment of the present invention, the process of dynamically scheduling the broadband resources allocated to each link includes:
dividing all resources of a resource pool into unit parts in advance, and distributing the unit parts according to an initial broadband resource distribution ratio P i To assign a corresponding unit share to each link;
acquiring real-time occupation information of each link, and determining a current state value of the link according to the real-time and historical occupation information of the link;
and when any link state value exceeds a corresponding preset threshold value, determining a resource allocation scheduling strategy according to the current state values of other links.
By the above technical solution, in this embodiment, the process of dynamically scheduling the broadband resources allocated to each link includes: dividing all resources of a resource pool into resources in advanceUnit, according to initial broadband resource allocation duty ratio P i To assign a corresponding unit share to each link; acquiring real-time occupation information of each link, and determining a current state value of the link according to the real-time and historical occupation information of the link; when the state value of any link exceeds the corresponding preset threshold value, the resource allocation scheduling strategy is determined according to the current state values of other links, and obviously, on the premise that the adaptive allocation of different links can be realized through the process, the scheduling of resources is conveniently realized in the form of unit shares, and meanwhile, the division of the unit shares is relatively smaller, so that the normal operation process of the scheduling link is not influenced.
As one embodiment of the present invention, the method for calculating the current state value of the link includes:
acquiring historical occupation data of the link before the current time and the current time point;
by the formula
Calculating to obtain the current state value W of the ith link i ；
Wherein t is 1 For a second preset period, alpha is a weight adjustment coefficient;
to the current state value W i And a preset threshold W th And (3) performing comparison:
if W is i ≥W th Executing a resource allocation scheduling strategy;
otherwise, maintaining the link initial wideband resource allocation duty cycle P i 。
Through the above technical solution, the present embodiment provides a method for calculating a current state value of a link, by first obtaining the current time of the link and the historical occupation data before the current time point, and then passing through a formula
Calculating to obtain the current state value W of the ith link i Wherein->
Embodying the currentReal-time condition->
Representing t before the current point in time 1 The historical condition of the time period, α, is a weight adjustment coefficient which is determined based on the degree of influence in the empirically analyzed data, and therefore, by
The current state can be judged by integrating the historical influence data and the real-time data, and then the current state value W is passed i And a preset threshold W th In the comparison process of W i ≥W th Executing a resource allocation scheduling policy; at W i ＜W th Maintaining the initial wideband resource allocation duty cycle P for the link i 。
As one embodiment of the present invention, the resource allocation scheduling policy includes:
acquisition of W i ＜W th And are arranged in order from small to large;
according to the current state value W of the ith link i And obtaining the scheduled unit number, calling one unit number each time according to the unit number according to the arrangement order, and circularly obtaining the corresponding unit number.
Through the above technical solution, this embodiment provides a resource allocation scheduling policy, specifically, according to W i Is determined by first obtaining W i ＜W th And acquiring more idle links, then according to W i Ordered from small to large; then according to the current state value W of the ith link i The method comprises the steps of obtaining the number of scheduled units, calling one unit each time according to the unit number according to the arrangement sequence, and circularly obtaining the corresponding unit number according to the unit number; through the process, the space of the idle link can be preferentially called, and meanwhile, the risk that the link is influenced by single call is avoided through a circular calling mode, namely, the orderly dynamic allocation of the link resources is ensured.
As one embodiment of the invention, the method for acquiring the scheduled unit number is as follows:
by formula n adi ＝[f x (W i -W th )*P i ]+1 calculation to obtain the number of units n adi ；
Wherein f x For presetting a comparison table function]To round the symbol.
Through the above technical solution, this embodiment provides a method for obtaining the number of scheduling units, through formula n adi ＝[f x (W i -W th )*P i ]+1 calculation to obtain the number of units n adi Wherein [ the]To round the symbol, f x A function set for a comparison table fitted based on empirical data according to W i And W is equal to th The interval in which the difference is located is set to different amounts, and therefore, by obtaining the number of units n adi The method can select corresponding unit parts to realize the supplement of the link broadband resources and ensure the orderly dynamic allocation of the link resources.
As one embodiment of the present invention, the resource allocation scheduling policy includes:
acquisition of W i ＜W th According to W i Is arranged according to the size and priority order of the (a);
according to the current state value W of the ith link i And obtaining the scheduled unit number, calling one unit number each time according to the unit number according to the arrangement order, and circularly obtaining the corresponding unit number.
Through the above technical solution, this embodiment provides a method for obtaining the number of scheduling units, which supplements the factors of the link priority in comparison with the previous embodiment, and first obtains W i ＜W th According to W i And then calling a unit part each time according to the unit part arrangement order, and circularly obtaining the corresponding unit part according to the unit part arrangement order, thereby avoiding the larger influence of the resource allocation scheduling process on the links with higher priority, and further meeting the different requirements of different links.
As an embodiment of the present invention, the sequential arrangement is as follows:
by the formula
Calculating to obtain a sequencing value Sort of the link, and arranging according to the sequence from the small Sort to the large Sort;
wherein Tp is the priority value of the link, and the higher the priority of the link, the greater the Tp value; gamma ray 1 、γ 2 Is a preset weight coefficient.
Through the above technical solution, the present embodiment provides a method for acquiring the ranking value of the link, that is, by
Calculating, wherein Tp is a priority value of the link, and the higher the priority of the link is, the larger the Tp value is; gamma ray 1 、γ 2 Is a preset weight coefficient, which is obtained according to the historical data fit, therefore, the higher the priority, the W i The larger the bandwidth is, the more rearward the ordering is, thereby realizing the purpose of preferentially occupying the broadband resources of the idle links with lower priority.
The foregoing describes one embodiment of the present invention in detail, but the description is only a preferred embodiment of the present invention and should not be construed as limiting the scope of the invention. All equivalent changes and modifications within the scope of the present invention are intended to be covered by the present invention.
Claims (8)
1. A method for scheduling allocation of broadband resources, the method comprising:
s1, acquiring historical broadband resource occupation data of each link of a resource pool, and acquiring an initial broadband resource allocation strategy according to the historical broadband resource occupation data of the links;
s2, broadband resource scheduling is carried out according to an initial broadband resource allocation strategy, real-time broadband resource occupation data of each link are obtained, and broadband resources allocated to each link are dynamically scheduled according to the data of each link and the real-time broadband resource occupation data.
2. The method for scheduling wideband resource allocation according to claim 1, wherein the initial wideband resource allocation policy is obtained by:
s11, acquiring historical broadband resource occupation data of each link of a resource pool and analyzing and acquiring real-time occupation ratio Or of the link in a historical period i (t)；
S12, through the formula
Calculating to obtain a historical resource occupation coefficient of the ith link;
wherein t is 0 For a first preset period of time, n (Or' i (t) =0) is Or i (t) at t-t 0 Deriving the number of 0 s by time t; f (f) z A table function is referenced for the segment; max (Or) i (t)) is t-t 0 Up to t period maximum occupancy, min (Or i (t)) is t-t 0 The minimum occupation ratio of the period of time t is reached, Y is a quantized piecewise function, and x is a preset adjustment coefficient;
s13, through the formula
Calculating to obtain initial broadband resource allocation duty ratio P of ith link i ；
Wherein N is the number of links in the resource pool, i.e. [1, N ].
3. The method for scheduling wideband resource allocation as claimed in claim 2, wherein the process of dynamically scheduling the wideband resources allocated to each link includes:
dividing all resources of a resource pool into unit parts in advance, and distributing the unit parts according to an initial broadband resource distribution ratio P i To assign a corresponding unit share to each link;
acquiring real-time occupation information of each link, and determining a current state value of the link according to the real-time and historical occupation information of the link;
and when any link state value exceeds a corresponding preset threshold value, determining a resource allocation scheduling strategy according to the current state values of other links.
4. A method for scheduling allocation of broadband resources according to claim 3, wherein the method for calculating the current state value of the link is as follows:
acquiring historical occupation data of the link before the current time and the current time point;
by the formula
Calculating to obtain the current state value W of the ith link i ；
Wherein t is 1 For a second preset period, alpha is a weight adjustment coefficient;
to the current state value W i And a preset threshold W th And (3) performing comparison:
if W is i ≥W th Executing a resource allocation scheduling strategy;
otherwise, maintaining the link initial wideband resource allocation duty cycle P i 。
5. The method for scheduling wideband resource allocation as claimed in claim 4, wherein the resource allocation scheduling policy includes:
acquisition of W i ＜W th And are arranged in order from small to large;
according to the current state value W of the ith link i And obtaining the scheduled unit number, calling one unit number each time according to the unit number according to the arrangement order, and circularly obtaining the corresponding unit number.
6. The method for allocating and scheduling broadband resources according to claim 5, wherein the method for obtaining the number of scheduled units is as follows:
by formula n adi ＝[f x (W i －W th )*P i ]+1 calculation to obtain the number of units n adi ；
Wherein f x For presetting a comparison table function]To round the symbol.
7. The method for scheduling wideband resource allocation as claimed in claim 4, wherein the resource allocation scheduling policy includes:
acquisition of W i ＜W th According to W i Is arranged according to the size and priority order of the (a);
according to the current state value W of the ith link i And obtaining the scheduled unit number, calling one unit number each time according to the unit number according to the arrangement order, and circularly obtaining the corresponding unit number.
8. The method for scheduling wideband resource allocation as claimed in claim 7, wherein the sequential arrangement is as follows:
by the formula
Calculating to obtain a sequencing value Sort of the link, and arranging according to the sequence from the small Sort to the large Sort;
wherein Tp is the priority value of the link, and the higher the priority of the link, the greater the Tp value; gamma ray 1 、γ 2 Is a preset weight coefficient.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310173267.XA CN116112448A (en) | 2023-02-28 | 2023-02-28 | Broadband resource allocation scheduling method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310173267.XA CN116112448A (en) | 2023-02-28 | 2023-02-28 | Broadband resource allocation scheduling method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116112448A true CN116112448A (en) | 2023-05-12 |
Family
ID=86256187
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310173267.XA Pending CN116112448A (en) | 2023-02-28 | 2023-02-28 | Broadband resource allocation scheduling method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116112448A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1768495A (en) * | 2003-01-28 | 2006-05-03 | 波音公司 | Systems and methods for digital processing of satellite communications data |
| CN102724761A (en) * | 2012-06-23 | 2012-10-10 | 电子科技大学 | Dynamic resource allocation method for orthogonal frequency division multiple access (OFDMA) system |
| WO2017037687A1 (en) * | 2015-09-06 | 2017-03-09 | Mariana Goldhamer | Virtualization and central coordination in wireless networks |
| CN111858064A (en) * | 2020-07-29 | 2020-10-30 | 山东有人信息技术有限公司 | Dynamic memory allocation method and system |
| CN112737823A (en) * | 2020-12-22 | 2021-04-30 | 国网北京市电力公司 | Resource slice allocation method and device and computer equipment |
-
2023
- 2023-02-28 CN CN202310173267.XA patent/CN116112448A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1768495A (en) * | 2003-01-28 | 2006-05-03 | 波音公司 | Systems and methods for digital processing of satellite communications data |
| CN102724761A (en) * | 2012-06-23 | 2012-10-10 | 电子科技大学 | Dynamic resource allocation method for orthogonal frequency division multiple access (OFDMA) system |
| WO2017037687A1 (en) * | 2015-09-06 | 2017-03-09 | Mariana Goldhamer | Virtualization and central coordination in wireless networks |
| CN111858064A (en) * | 2020-07-29 | 2020-10-30 | 山东有人信息技术有限公司 | Dynamic memory allocation method and system |
| CN112737823A (en) * | 2020-12-22 | 2021-04-30 | 国网北京市电力公司 | Resource slice allocation method and device and computer equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107066332B (en) | Distributed system and scheduling method and scheduling device thereof | |
| CN104079501B (en) | Queue scheduling method based on multiple priorities | |
| CN106793133B (en) | Scheduling method for guaranteeing multi-service QoS in electric power wireless communication system | |
| CN110087324B (en) | Resource allocation method, device, access network equipment and storage medium | |
| DE102021103438B4 (en) | Intelligent scheduling of Wi-Fi services for applications | |
| CN111757468A (en) | Resource allocation method and device, storage medium and electronic device | |
| CN107197530B (en) | Downlink resource allocation algorithm for channel fluctuation perception in LTE system | |
| CN109257303B (en) | QoS queue scheduling method and device and satellite communication system | |
| CN107423134B (en) | Dynamic resource scheduling method for large-scale computing cluster | |
| CN116112448A (en) | Broadband resource allocation scheduling method | |
| CN105873128B (en) | A kind of LTE fairness dispatching method based on delay sensitive | |
| KR20070029065A (en) | Method and apparatus for scheduling in a communication system | |
| CN113115327A (en) | Method, device, equipment and storage medium for dynamically optimizing network performance | |
| CN110602747A (en) | Method for scheduling wide-band and narrow-band mixed service channel resources of power wireless communication system | |
| CN109041247B (en) | Self-adaptive resource scheduling method based on user Qos requirement and queuing strategy | |
| CN113905448B (en) | Wireless network resource scheduling method, device and equipment | |
| CN114257515B (en) | Bandwidth secondary scheduling method and device | |
| CN115664988A (en) | Kubernetes-oriented complex service deployment and scheduling method | |
| CN107155220B (en) | Resource scheduling method and device | |
| CN115022978A (en) | Wireless network uplink scheduling method based on self-adaptive grouping and reinforcement learning | |
| CN105992381B (en) | A kind of dispatching method | |
| US10511419B2 (en) | Multi-user grouping | |
| CN102264143B (en) | User access adaptive scheduling method and device in TD-SCDMA (Time Division-Synchronization Code Division Multiple Access) system | |
| CN101877912B (en) | Scheduling method and scheduler | |
| CN112543510A (en) | Resource allocation method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |