CN106922002B - Network slice virtual resource allocation method based on internal auction mechanism - Google Patents
Network slice virtual resource allocation method based on internal auction mechanism Download PDFInfo
- Publication number
- CN106922002B CN106922002B CN201710282627.4A CN201710282627A CN106922002B CN 106922002 B CN106922002 B CN 106922002B CN 201710282627 A CN201710282627 A CN 201710282627A CN 106922002 B CN106922002 B CN 106922002B
- Authority
- CN
- China
- Prior art keywords
- slice
- resources
- resource
- slices
- demand
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 29
- 238000011084 recovery Methods 0.000 claims abstract description 7
- 238000011156 evaluation Methods 0.000 claims abstract description 3
- 238000013468 resource allocation Methods 0.000 claims description 18
- 230000000903 blocking effect Effects 0.000 claims description 15
- 230000002159 abnormal effect Effects 0.000 claims description 10
- 238000013507 mapping Methods 0.000 claims description 4
- 238000012163 sequencing technique Methods 0.000 claims description 2
- 238000010295 mobile communication Methods 0.000 abstract description 2
- 230000009286 beneficial effect Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000004064 recycling Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
- H04W28/24—Negotiating SLA [Service Level Agreement]; Negotiating QoS [Quality of Service]
Landscapes
- Engineering & Computer Science (AREA)
- Quality & Reliability (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a network slice virtual resource allocation method based on an internal auction mechanism, belonging to the technical field of mobile communication. The method comprises the following steps: the network slice determines the demand and the recovery and the auction quotation thereof according to the user state information, and allocates virtual resources by utilizing an internal auction; the user state information comprises newly arrived user information and recovered service user information, and the demand and the recovery quantity can meet the QoS (quality of service) requirements of the network slice and improve the resource utilization rate of the network slice; the internal auction method includes: determining quotations by combining the priorities of the slices, integrating the quotations of all the slices to perform auction, and determining the allocation resources of the winning slices; wherein the priority is a comprehensive evaluation of the current user state and the service requirement. The network slice virtual resource method based on the internal auction mechanism can meet the QoS requirements of network slices with larger demand difference and improve the resource utilization rate.
Description
Technical Field
The invention belongs to the technical field of mobile communication, and relates to a network slice virtual resource allocation method based on an internal auction mechanism.
Background
In the 5G era, there will be various application scenarios with different network requirements, and network slicing based on NFV, SDN, SON technologies is also a key technology of 5G network architecture. The network slices are virtual networks aiming at different service requirements on a physical infrastructure, are completely isolated and have flexibility, and can dynamically meet the requirements of respective services and users. Due to the tight coupling of control and data forwarding in the architecture, the resource allocation algorithm in the conventional network cannot be flexibly applied to a 5G network with network slices, and how to meet the QoS requirements of various service users and improve the resource utilization rate is an urgent problem to be solved.
In game theory, auctions have been widely studied. In wireless networks, the auction of wireless spectrum is an important application, where auction participants bid on their own required resources, and resource holders or auctioneers decide and price allocated resources based on these bids. However, in order to meet the QoS requirement of the user, the virtual resource often submits the request at the requirement upper limit, which results in over-supply of the resource and waste of the resource. For different slices, customizing a new slice and allocating resources in time according to a user request in real time also causes unnecessary resource waste.
An infrastructure provider (InP) is logically separated from a service provider, and may be regarded as InP that provides infrastructure or radio network resources for a Mobile Virtual Network Operator (MVNO). At present, the final resource allocation scheme is generally determined by InP according to the user's needs in the MVNO, and researchers have proposed allocation schemes such as dynamic resource optimization and random game strategies, which can achieve higher resource utilization rate.
At present, the following disadvantages exist in the prior art:
since the resources are finally allocated by the device provider, the MVNOs cannot participate in the decision making, and the flexible service requirements cannot be met in the face of the resource allocation of the 5G network slice. In addition, the existing most of virtual resource allocation does not consider the larger demand difference between 5G scenes, and how to achieve that network slices are independent of each other while flexibly meeting the service demand is the key of 5G virtual resource allocation.
Disclosure of Invention
In view of the above, the present invention provides a method for allocating virtual resources of a network slice based on an internal auction mechanism, which can effectively improve the resource utilization rate, reduce the time delay, and meet the QoS requirements of slice users.
In order to achieve the purpose, the invention provides the following technical scheme:
a network slice virtual resource allocation method based on an internal auction mechanism comprises the following steps:
s1: abstracting resources;
s2: collecting the slice state of each slice, and summarizing the slice state to MVNO; the slice state comprises a user state, a residual resource state and slice exception information, the user state comprises a slice strength gamma and a slice service blocking rate P, and the slice exception information is a binary number represented by 0 or 1;
s3: the resource demand and the resource recovery are determined by comprehensively considering the condition of each slice;
s4: judging whether the resource demand exceeds the total resource amount, if not, allocating resources according to the demand by utilizing an internal auction method according to the priority; if the total resource quantity exceeds the priority, time delay weight factors are introduced, the slices with resource requirements are sequenced according to the priority and the time delay weight factors to form an array, the model is simplified to carry out sub-channel distribution, and at the moment, the CPU and the sub-channels are assumed to be distributed in proportion, and the CPU of the distributed channels is adjusted and distributed according to the requirements; the priority is the comprehensive evaluation of the current user state and the service requirement;
s5: and after the distribution is finished, checking whether the current slice meets the user requirement, if so, updating the slice state, and otherwise, continuously repeating the steps S2-S5 for distribution.
Further, the S1 includes the following steps:
s101: initializing; the initialization is that MVNOs make slices of various services according to the service requirements of the slices, and allocate certain resources to the slices to meet basic requirements;
s102: an internal auction; the internal auction is that a user accesses each slice according to the service type, the slices feed back to the MVNO according to the user state, quotations are determined according to the priorities of the slices, the quotations of all the slices are integrated for auction, bidding information is formulated, the MVNO allocates resources for the user according to decisions and integrates the air gap resources in time, and the resource allocation result of the successful bid slice is determined;
s103: submitting a scheme; the submission scheme is that InP establishes a purchase and lease strategy according to a request and MVNO;
s104: mapping resources; and the resource mapping is that the MVNO recycles InP leased physical resources or InP recycles idle physical resources according to the allocation strategy.
Further, the resource allocation result of the winning bid slice is obtained by the MVNO according to the parameters and pricing of the unit resource in proportion, the formed bid quotation is divided into slice demand resource quotation and slice recovery resource quotation, and the system defaults that when the slice abnormal information is 0, the slice does not participate in the allocation of any resource.
Further, the slice demand resource quotation is formulated by
Determining;
wherein,
is the possibility of the user to resume the service;
is the time user x left;is the benefit of recovering the required resources of the service users;
is the income of new user demand resources;
is the cost of reserving resources.
Further, the recycled resource quote is formulated by
Determining;
wherein,
is a discount factor, and
is the yield of the total resources of the slice;
is all resources that are present for the slice;
and the current yield of slicing, WlIs the amount of resources that a slice can reclaim.
Further, the priority in the step S4 is represented as δ ═ log3(U +1) determined by the urgency U of the exception information, if the incomplete determination reservation is not finished, a new priority has been formed, allowing a slice with a higher priority to enter the allocation queue; the emergency degree is as follows:
wherein p isnIn order to slice the traffic blocking rate of the new traffic,
is the maximum value of the traffic blocking rate, p, of the new trafficrIn order to restore the traffic blocking rate of the traffic,
the maximum value of the service blocking rate for recovering the service; when the slice abnormal information is 1, the emergency degree of the abnormal information is a number which is larger than 0 and smaller than 2, but considering that the priority is a number between 0 and 1, a discount can be generated on the bidding price of the slice, and the priority needs to be obtained according to the emergency degree; when the slice exception information is 0, the default U of the system is 0, which means that there is no need when the slice is not in an exception state.
Further, when the resource demand does not exceed the resource quantity of the MVNO, determining the process of a reservation strategy, determining whether bidders bid, and allocating resources with the maximum utility function as a target; the utility function considerations include slice demand resource quotations and slice priorities;
when the reserved quantity is exceeded, a time delay weight factor is introduced except for the priority, resources are allocated by taking the difference value between the maximized demand and the income of the recovered idle resources as a target, and the QoS demand of a user is met; the time delay weight factor consideration factors comprise the maximum time delay threshold tolerated by the slice and the maximum packet loss rate allowed by the slice.
Further, when the resource demand exceeds the reserved amount, slices with high priority and high delay requirement need to be preferentially met, the resource allocation at the moment is divided into two stages, a subchannel is allocated in the first stage, the CPU is assumed to be allocated evenly according to the proportion, the CPU allocation and adjustment in the second stage are carried out after the subchannel allocation is finished, the user demand needs to be considered in the two stages, and the rate demand is adjusted in the second stage.
Further, the step of preferentially satisfying the slice with high priority and high delay requirement includes the following steps:
s401: recovering and integrating all idle resources in the idle resource slices;
s402: sequencing required slices according to the product sequence of quotation, priority and time delay weight factors, and distributing partial required resources for the required slices in sequence;
s403: after the distribution of each slice is finished, checking whether the residual resource number can be continuously distributed;
s404: marking the allocated resources as occupied, checking whether the slice state meets the slice QoS requirement, if so, ending the allocation, allocating the next slice, otherwise, updating the slice requirement and continuing to queue and allocate;
s405: steps S401-S405 are repeated until all users are allocated or there are no available resources.
The invention has the beneficial effects that:
the MVNO can dynamically allocate resources to meet the QoS requirements of the users according to the user states and the service requirements of the network slices. The invention customizes the special virtual resource block of different virtual network slices according to different service requirements; on the basis, the slice triggers a switch to provide a demand application according to the user state; on the basis, the price is taken as a credit factor, and resources are recovered and distributed according to the priority of the slices; in addition, the gap resources during the resource allocation of the slices are integrated to be reserved resources, so that the time delay caused by resource allocation is reduced, and the method and the device can meet the QoS of the user and maximize the benefit.
Drawings
In order to make the object, technical scheme and beneficial effect of the invention more clear, the invention provides the following drawings for explanation:
FIG. 1 is a schematic view of a research scenario;
FIG. 2 is a network slice virtual resource allocation auction model;
FIG. 3 is a flow diagram of a network slice virtual resource auction workflow;
FIG. 4 is an auction pricing update workflow diagram
FIG. 5 is a flow chart of a first stage resource allocation when demand exceeds a reserved amount;
fig. 6 is a flowchart of a reserved resource allocation method based on an internal auction mechanism.
Detailed Description
Preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
Referring to fig. 1, fig. 1 is a schematic view of a research scenario of the present invention. In the embodiment of the invention, L service network slices are arranged in the coverage range of a base station, each slice serves users of respective service, and one user can only have one service running in any time, namely, one user can only access one slice, and X users accessing slice L at the time of t are arranged. In the virtual network slice, only the transceiver equipment and no controller, the slice only needs to provide service for users and records user state information, and additionally notifies the user state exceeding the threshold value, but does not have the capability of evaluating the current state and predicting the future state.
Referring to fig. 2, fig. 2 shows a network slice virtual resource allocation auction model, which includes the following steps:
step 201: establishing a purchase and lease strategy by the InP and the MVNO according to the request; the MVNO recycles the InP leased physical resources or the InP recycles the idle physical resources according to the allocation strategy,
step 202: the MVNO processing resource is divided into two parts, one is allocated resource and the other is recycled resource, only when the slice triggers allocation or a recycling switch according to the state of the slice, the slice needs to submit an application to the MVNO, otherwise, the slice only needs to monitor the state of the slice, the resource of the slice cannot be freely called among the slices, the recycled resource and the gap resource are uniformly processed by the MVNO,
step 203: the MVNO allocates resources to the slices according to an allocation policy,
step 204: the MVNO recovers the idle physical resources according to the allocation policy,
step 205: the slice provides services to the user and records user status information.
Referring to fig. 3, fig. 3 is a flow chart of the network slice virtual resource auction work, which includes the following steps:
step 301: the slice state needs to be updated according to the user state after the user arrives,
step 302: if the slice works normally, recording the current slice state, wherein the slice state comprises a user state, a residual resource state and slice abnormal information, and the user state comprises a slice strength gamma and a slice service blocking rate P; wherein the slice exception information is a binary number, 0 represents a normal state, 1 represents an exception state,
step 303: if the slice is in an abnormal state, go to step 304,
step 304: obtaining the demand according to the difference between the reachable rate of the user state and the reachable rate of the slice resource,
step 305: calculating slice priority δ log3(U+1)；
Wherein U is the urgency of the abnormal information,
wherein，pnIn order to slice the traffic blocking rate of the new traffic,
is the maximum value of the traffic blocking rate, p, of the new trafficrIn order to restore the traffic blocking rate of the traffic,the maximum value of the traffic blocking rate for the restoration traffic.
Step 306: calculating the quotation of the demand resources:
wherein,
is the possibility for the user to resume the service,
is the time user x left;
is a benefit of the demand resource;
is the cost of reserving resources.
Step 307: if the slice is not in the state of needing resources, judging whether the slice has idle resources and can be recycled
Step 308: obtaining the recovery amount according to the difference value of the reachable rate of the user state and the reachable rate of the slice resource,
step 309: calculating a recycled resource quotation:
wherein,is a discount factor, and
respectively, the revenue of the total resources of the slice and the existing revenue of the slice.
Step 310: the MVNO forms an internal auction model based on the state information provided by the slices, the consolidated slot resources, and the priorities of the individual slices,
step 311: the resources are allocated and reclaimed according to the allocation policy,
step 312: and if no free resources of the slice can be recycled, recording the current state of the slice per se.
Referring to fig. 4, fig. 4 is a flow chart of an auction pricing update work, comprising the steps of:
step 401: MVNO updates and arranges the residual resource amount,
step 402: it is determined whether there are remaining resources that can be allocated,
step 403: updating the pricing of the unit resource according to the remaining resource amount,
step 404: the MVNO aggregates all the slice states, decides to allocate resources taking into account the situation (revenue, QoS, etc.) of each slice comprehensively, and recovers resources,
step 405: the slice state is updated after the allocation is completed,
step 406: judging whether the slice needs resources, if not, ending the distribution,
step 407: if the resource is needed, the slice requirement is updated, and the step 401 is returned to continue to apply for resource allocation.
Referring to fig. 5, fig. 5-5 are flow charts of first-stage resource allocation when the demand exceeds the reserved amount, and the steps are as follows:
step 501: recycling and integrating all idle resources in the idle resource slices, finding out the slices with higher priority for each slice l to form an array X,
step 502: sorting the required slices according to the product sequence of quotation and time delay weight factor, distributing partial required resources for the slices in turn,
step 503: finding available resources in a calling resource and matching
Step 504: checking whether the residual resource number can be continuously allocated or not, and ensuring that the allocated resource is an available resource
Step 505: marking the allocated resources as occupied, checking whether the slice state meets the slice QoS requirement, if all the slice states meet the slice QoS requirement, ending the allocation, and returning to the step 1 to allocate the next slice;
step 506: if all are satisfied, return to step 504 to continue the allocation. And repeating the steps until all the users are allocated or no available resources exist.
Referring to fig. 6, fig. 6 is a reserved resource allocation method based on an internal auction mechanism, which includes the following steps:
step 601: collecting user state information and residual resource state of each slice, and summarizing the user state information and residual resource state to MVNO
Step 602: the MVNO collects all the slice states, comprehensively considers the conditions (income, QoS and the like) of each slice to decide whether to allocate resources or not and recover the resource amount, the MVNO collects all the slice states including all the slice information in abnormal states, the slice only needs to provide services for users, records the user state information, notifies the slice states exceeding a threshold value, but does not have the capability of evaluating the current state and predicting the future state,
step 603: comparing all the demand information with the total resource amount to determine whether the required resource exceeds the total resource amount,
step 604: if the total resource amount is not exceeded, allocating resources according to the requirements by utilizing an internal auction method according to the priority;
step 605: if the total resource quantity exceeds the priority level, delay weight factors are introduced, the slices with resource requirements are sorted into an array according to the priority level and the delay weight factors, distribution is completed in two stages,
step 606: the first stage of the simplified model performs sub-channel assignment, assuming that the CPU is allocated proportionally to the sub-channels,
step 607: the second stage performs CPU allocation and adjustment on the slices of allocated channels,
step 608: checking whether the current slice meets the user requirement after the distribution is finished, if not, continuously repeating the steps for distribution,
step 609: and if the user requirements are met, updating the slice state.
The invention has the beneficial effects that:
the MVNO can dynamically allocate resources to meet the QoS requirements of the users according to the user states and the service requirements of the network slices. The invention customizes the special virtual resource block of different virtual network slices according to different service requirements; on the basis, the slice triggers a switch to provide a demand application according to the user state; on the basis, the price is taken as a credit factor, and resources are recovered and distributed according to the priority of the slices; in addition, the gap resources during the resource allocation of the slices are integrated to be reserved resources, so that the time delay caused by resource allocation is reduced, and the method and the device can meet the QoS of the user and maximize the benefit.
Finally, it is noted that the above-mentioned preferred embodiments illustrate rather than limit the invention, and that, although the invention has been described in detail with reference to the above-mentioned preferred embodiments, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the scope of the invention as defined by the appended claims.
Claims (9)
1. A network slice virtual resource allocation method based on an internal auction mechanism is characterized in that: the method comprises the following steps:
s1: abstracting resources;
s2: collecting the slice state of each slice, and summarizing the slice state to MVNO; the slice state comprises a user state, a residual resource state and slice exception information, the user state comprises a slice strength gamma and a slice service blocking rate P, and the slice exception information is a binary number represented by 0 or 1;
s3: the resource demand and the resource recovery are determined by comprehensively considering the condition of each slice;
s4: judging whether the resource demand exceeds the total resource amount, if not, allocating resources according to the demand by utilizing an internal auction method according to the priority; if the total resource quantity exceeds the priority, time delay weight factors are introduced, the slices with resource requirements are sequenced according to the priority and the time delay weight factors to form an array, the model is simplified to carry out sub-channel distribution, and at the moment, the CPU and the sub-channels are assumed to be distributed in proportion, and the CPU of the distributed channels is adjusted and distributed according to the requirements; the priority is the comprehensive evaluation of the current user state and the service requirement;
s5: and after the distribution is finished, checking whether the current slice meets the user requirement, if so, updating the slice state, and otherwise, continuously repeating the steps S2-S5 for distribution.
2. The method for allocating virtual resources on a network slice based on an internal auction mechanism as claimed in claim 1, wherein: the S1 includes the steps of:
s101: initializing; the initialization is that MVNOs make slices of various services according to the service requirements of the slices, and allocate certain resources to the slices to meet basic requirements;
s102: an internal auction; the internal auction is that a user accesses each slice according to the service type, the slices feed back to the MVNO according to the user state, quotations are determined according to the priorities of the slices, the quotations of all the slices are integrated for auction, bidding information is formulated, the MVNO allocates resources for the user according to decisions and integrates the air gap resources in time, and the resource allocation result of the successful bid slice is determined;
s103: submitting a scheme; the submission scheme is that InP establishes a purchase and lease strategy according to a request and MVNO;
s104: mapping resources; and the resource mapping is that the MVNO recycles InP leased physical resources or InP recycles idle physical resources according to the allocation strategy.
3. The method for allocating virtual resources on a network slice based on an internal auction mechanism as claimed in claim 2, wherein: the resource allocation result of the winning bid slice is obtained by integrating the parameters and pricing of unit resources in proportion by MVNO, the formed bid quotations are divided into slice demand resource quotations and slice recovery resource quotations, and the default of the system is that when the slice abnormal information is 0, the slice does not participate in the allocation of any resource.
4. The method for allocating virtual resources on a network slice based on an internal auction mechanism as claimed in claim 3, wherein: the slice demand resource quotation is formulated
Determining;
wherein,
is the possibility of the user to resume the service;
is the time user x left;
is the benefit of recovering the required resources of the service users;
is the income of new user demand resources;
is the cost of reserving resources.
5. The method for allocating virtual resources on a network slice based on an internal auction mechanism as claimed in claim 3, wherein: the recycled resource quote is formulated
Determining;
wherein,
is a discount factor, and
is the yield of the total resources of the slice;
is all resources that are present for the slice;
and the current yield of slicing, WlIs the amount of resources that a slice can reclaim.
6. The method for allocating virtual resources on a network slice based on an internal auction mechanism as claimed in claim 1, wherein: the priority in step S4 is represented as δ ═ log3(U +1) determined by the urgency U of the exception information, if the incomplete determination reservation is not finished, a new priority has been formed, allowing a slice with a higher priority to enter the allocation queue; the emergency degree is as follows:
wherein p isnIn order to slice the traffic blocking rate of the new traffic,
is the maximum value of the traffic blocking rate, p, of the new trafficrIn order to restore the traffic blocking rate of the traffic,
for rehabilitationMaximum traffic blocking rate of the traffic; when the slice abnormal information is 1, the emergency degree of the abnormal information is a number which is larger than 0 and smaller than 2, but considering that the priority is a number between 0 and 1, a discount can be generated on the bidding price of the slice, and the priority needs to be obtained according to the emergency degree; when the slice exception information is 0, the default U of the system is 0, which means that there is no need when the slice is not in an exception state.
7. The method for allocating virtual resources on a network slice based on an internal auction mechanism as claimed in claim 1, wherein: when the resource demand does not exceed the resource quantity of the MVNO, determining the process of a reservation strategy, determining whether bidders bid, and allocating resources with the maximum utility function as a target; the utility function considerations include slice demand resource quotations and slice priorities;
when the reserved quantity is exceeded, a time delay weight factor is introduced except for the priority, resources are allocated by taking the difference value between the maximized demand and the income of the recovered idle resources as a target, and the QoS demand of a user is met; the time delay weight factor consideration factors comprise the maximum time delay threshold tolerated by the slice and the maximum packet loss rate allowed by the slice.
8. The method for allocating virtual resources on a network slice based on an internal auction mechanism as claimed in claim 7, wherein: when the resource demand exceeds the reserved quantity, the slice with high priority and high time delay requirement needs to be met preferentially, the resource allocation at the moment is divided into two stages, a subchannel is allocated in the first stage, the CPU is assumed to be allocated evenly according to the proportion, the CPU allocation and adjustment in the second stage are carried out after the subchannel allocation is finished, the user demand needs to be considered in the two stages, and the speed demand is adjusted in the second stage.
9. The method for allocating virtual resources on a network slice based on an internal auction mechanism as claimed in claim 8, wherein: the method for meeting the slice with high priority and high time delay requirement preferentially comprises the following steps:
s401: recovering and integrating all idle resources in the idle resource slices;
s402: sequencing required slices according to the product sequence of quotation, priority and time delay weight factors, and distributing partial required resources for the required slices in sequence;
s403: after the distribution of each slice is finished, checking whether the residual resource number can be continuously distributed;
s404: marking the allocated resources as occupied, checking whether the slice state meets the slice QoS requirement, if so, ending the allocation, allocating the next slice, otherwise, updating the slice requirement and continuing to queue and allocate;
s405: steps S401-S405 are repeated until all users are allocated or there are no available resources.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710282627.4A CN106922002B (en) | 2017-04-26 | 2017-04-26 | Network slice virtual resource allocation method based on internal auction mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710282627.4A CN106922002B (en) | 2017-04-26 | 2017-04-26 | Network slice virtual resource allocation method based on internal auction mechanism |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106922002A CN106922002A (en) | 2017-07-04 |
| CN106922002B true CN106922002B (en) | 2020-02-07 |
Family
ID=59568364
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710282627.4A Active CN106922002B (en) | 2017-04-26 | 2017-04-26 | Network slice virtual resource allocation method based on internal auction mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106922002B (en) |
Families Citing this family (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107463443A (en) * | 2017-07-12 | 2017-12-12 | 桂林电子科技大学 | A kind of distribution method based on the parallel mechanism insensitive to identity |
| CN109379208B (en) * | 2017-08-11 | 2022-04-05 | 华为技术有限公司 | Network object management method and device |
| CN109511138B (en) * | 2017-09-15 | 2023-04-28 | 上海诺基亚贝尔股份有限公司 | Method, apparatus and computer readable medium for resource allocation in a communication network |
| WO2019051798A1 (en) * | 2017-09-15 | 2019-03-21 | 上海诺基亚贝尔股份有限公司 | Resource allocation method and apparatus, and computer storage medium |
| CN107743100B (en) * | 2017-09-30 | 2020-11-06 | 重庆邮电大学 | Online adaptive network slice virtual resource allocation method based on service prediction |
| CN107682135B (en) * | 2017-09-30 | 2020-06-02 | 重庆邮电大学 | NOMA-based network slice self-adaptive virtual resource allocation method |
| CN107835104B (en) * | 2017-10-24 | 2021-03-16 | 广东工业大学 | Method, system, equipment and storage medium for sharing NF user permission among network slices |
| CN109769269B (en) | 2017-11-09 | 2021-01-12 | 华为技术有限公司 | Communication method and network device |
| CN108776926B (en) * | 2018-06-07 | 2021-06-22 | 南京航空航天大学 | Wireless network resource allocation optimal auction method based on deep learning |
| EP3864804A1 (en) * | 2018-10-11 | 2021-08-18 | Koninklijke KPN N.V. | Dynamic slice priority handling |
| CN109600798B (en) * | 2018-11-15 | 2020-08-28 | 北京邮电大学 | Multi-domain resource allocation method and device in network slice |
| CN111200845B (en) * | 2018-11-19 | 2022-09-23 | 华为技术有限公司 | Resource information sending method, device and system |
| CN109495907B (en) | 2018-11-29 | 2020-05-12 | 北京邮电大学 | Intention-driven wireless access networking method and system |
| CN109743213B (en) | 2019-02-28 | 2021-08-13 | 腾讯科技（深圳）有限公司 | Network slice processing method, equipment and system |
| CN109743217B (en) * | 2019-03-08 | 2021-03-16 | 西安交通大学 | Self-adaptive resource adjusting method based on SVRA algorithm |
| CN113826359B (en) | 2019-03-22 | 2024-08-20 | 皇家Kpn公司 | Third party network and network slice management |
| CN110062360B (en) * | 2019-04-04 | 2022-03-15 | 南京邮电大学 | Resource allocation method based on mMTC service classification |
| US11297534B2 (en) | 2019-08-09 | 2022-04-05 | Cisco Technology, Inc. | Intelligent and optimal resource selection within a network slice |
| CN110830390B (en) * | 2019-11-11 | 2023-03-31 | 南京邮电大学 | QoS driven mobile edge network resource allocation method |
| CN114095382B (en) * | 2020-08-05 | 2023-11-10 | 中国移动通信集团重庆有限公司 | Method, system, device and equipment for scheduling virtual resources of network slice |
| CN112243264B (en) * | 2020-10-14 | 2023-11-24 | 中国联合网络通信集团有限公司 | Service customization method, system and network equipment |
| TWI756974B (en) | 2020-12-09 | 2022-03-01 | 財團法人工業技術研究院 | Machine learning system and resource allocation method thereof |
| CN113543228A (en) * | 2021-06-10 | 2021-10-22 | 中国电子科技集团公司电子科学研究院 | Satellite-ground converged network slice resource scheduling method, system and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106412040A (en) * | 2016-09-19 | 2017-02-15 | 北京邮电大学 | Cache resource allocation method and apparatus |
| CN106549806A (en) * | 2016-10-26 | 2017-03-29 | 清华大学 | A kind of network section manager and its management method |
-
2017
- 2017-04-26 CN CN201710282627.4A patent/CN106922002B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106412040A (en) * | 2016-09-19 | 2017-02-15 | 北京邮电大学 | Cache resource allocation method and apparatus |
| CN106549806A (en) * | 2016-10-26 | 2017-03-29 | 清华大学 | A kind of network section manager and its management method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106922002A (en) | 2017-07-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106922002B (en) | Network slice virtual resource allocation method based on internal auction mechanism | |
| CN108076486B (en) | Dynamic wireless resource allocation algorithm based on load balancing | |
| CN110096318B (en) | Task unloading method and device based on mobile edge calculation | |
| EP2304899B1 (en) | Priority-based admission control in a network with variable channel data rates | |
| JP2003516685A (en) | Dynamic negotiation of resources for user equipment in wireless communication systems | |
| CN111614754B (en) | Fog-calculation-oriented cost-efficiency optimized dynamic self-adaptive task scheduling method | |
| CN105718316A (en) | Job scheduling method and apparatus | |
| CN111901145B (en) | Power Internet of things heterogeneous shared resource allocation system and method | |
| CN113347267B (en) | MEC server deployment method in mobile edge cloud computing network | |
| CN109743217B (en) | Self-adaptive resource adjusting method based on SVRA algorithm | |
| CN110830390B (en) | QoS driven mobile edge network resource allocation method | |
| CN109743751B (en) | Resource allocation method and device for wireless access network | |
| CN109040193B (en) | Mobile device cloud resource allocation method based on independent subtasks | |
| CN110287024A (en) | The dispatching method of multi-service oriented device multi-user in a kind of industrial intelligent edge calculations | |
| Samanta et al. | Distributed resource distribution and offloading for resource-agnostic microservices in industrial iot | |
| CN110012507B (en) | Internet of vehicles resource allocation method and system with priority of user experience | |
| CN101594642B (en) | Resource allocation method and resource allocation device used for communication network element device | |
| CN111314234B (en) | Flow distribution method and device, storage medium and electronic equipment | |
| CN115118327B (en) | Satellite communication resource scheduling method and system based on dynamic measurement feedback | |
| CN105979549B (en) | A kind of load-balancing method and device | |
| CN109673055B (en) | Resource allocation method for joint communication and calculation based on two-dimensional region filling | |
| US20150003238A1 (en) | System and method for management and control of communication channels | |
| JPH0879240A (en) | Information service quality control system | |
| CN110996396A (en) | Mobile edge network resource allocation method based on online combined auction | |
| CN111680860B (en) | Deterministic cross online matching method in space-time crowdsourcing platform |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20231019 Address after: Room 1406, Building 1, Nord Holiday Garden, No. 369 Qianhai Road, Nanshan District, Shenzhen City, Guangdong Province, 518000 Patentee after: Jia Zhe Address before: 1003, Building A, Zhiyun Industrial Park, No. 13 Huaxing Road, Henglang Community, Dalang Street, Longhua District, Shenzhen City, Guangdong Province, 518000 Patentee before: Shenzhen Wanzhida Technology Transfer Center Co.,Ltd. Effective date of registration: 20231019 Address after: 1003, Building A, Zhiyun Industrial Park, No. 13 Huaxing Road, Henglang Community, Dalang Street, Longhua District, Shenzhen City, Guangdong Province, 518000 Patentee after: Shenzhen Wanzhida Technology Transfer Center Co.,Ltd. Address before: 400065 Chongqing Nan'an District huangjuezhen pass Chongwen Road No. 2 Patentee before: CHONGQING University OF POSTS AND TELECOMMUNICATIONS |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20231120 Address after: Room 807-814, Building A, Xinian Center, No. 6021 Shennan Avenue, Tian'an Community, Shatou Street, Futian District, Shenzhen City, Guangdong Province, 518000 Patentee after: Shenzhen Letou Technology Co.,Ltd. Address before: Room 1406, Building 1, Nord Holiday Garden, No. 369 Qianhai Road, Nanshan District, Shenzhen City, Guangdong Province, 518000 Patentee before: Jia Zhe |