CN109743751A - The resource allocation methods and device of wireless access network - Google Patents
The resource allocation methods and device of wireless access network Download PDFInfo
- Publication number
- CN109743751A CN109743751A CN201910156045.0A CN201910156045A CN109743751A CN 109743751 A CN109743751 A CN 109743751A CN 201910156045 A CN201910156045 A CN 201910156045A CN 109743751 A CN109743751 A CN 109743751A
- Authority
- CN
- China
- Prior art keywords
- service request
- node
- constraint condition
- business
- physical
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 38
- 238000013468 resource allocation Methods 0.000 title claims abstract description 23
- 238000009826 distribution Methods 0.000 claims description 25
- 230000005540 biological transmission Effects 0.000 claims description 8
- 239000011800 void material Substances 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 6
- 230000008569 process Effects 0.000 description 5
- 230000004044 response Effects 0.000 description 5
- 238000001514 detection method Methods 0.000 description 4
- 238000003860 storage Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 230000002452 interceptive effect Effects 0.000 description 3
- 230000037361 pathway Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 230000008878 coupling Effects 0.000 description 2
- 230000007774 longterm Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 206010033799 Paralysis Diseases 0.000 description 1
- 239000012141 concentrate Substances 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 230000005611 electricity Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000004744 fabric Substances 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000011835 investigation Methods 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 238000007711 solidification Methods 0.000 description 1
- 230000008023 solidification Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000005303 weighing Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/08—Load balancing or load distribution
- H04W28/084—Load balancing or load distribution among network function virtualisation [NFV] entities; among edge computing entities, e.g. multi-access edge computing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Theoretical Computer Science (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the invention provides a kind of resource allocation methods of wireless access network and devices, it is implemented on software defined network SDN controller, this method comprises: receiving at least one service request, each service request includes virtual network topology and business constraint condition；According to the demand information of the service quality of each service request, at least one described service request is ranked up, ranking results are obtained；According to the ranking results, and the virtual network topology and business constraint condition for according to each service request being included, resource is distributed for each service request, to realize dynamic allocation Internet resources, to solve according to the ranking results, and the virtual network topology and business constraint condition for according to each service request being included, the problems such as distributing resource for each service request.
Description
[technical field]
The present invention relates to the communications field more particularly to the resource allocation methods and device of a kind of wireless access network.
[background technique]
Have the characteristics that distribution is flexible, type of business is more, demand difference is big, reliability requirement is high for power business, electricity
Power wireless network because the flexibility of its access is high, at low cost advantage due to be widely used, become power telecom network
Important component.However, current electric power wireless network is made of the special equipment for having sophisticated functions, it is a kind of soft or hard
The Closed Architecture of part vertically integrated, the solidification of physical resource cause network utilization low so that resource is difficult to share.
In the prior art, by the network virtualization of software defined network (Software Defined Network, SDN)
Control plane can be separated with data plane, using the controller concentrated in logic, and then can be chosen more effectively by technology
Flow scheduling and resource allocation methods reduce the operation cost of network so as to preferably utilize Internet resources, improve network
Performance and quality of service.Therefore, how further investigation in electric power wireless access network efficiently distributes network by SDN Technique dynamic
Resource is necessary.
However, due to that can distribute multiple virtual resources on a physical resource, virtual resource allocation is mostly all
The considerations of lacking to air interference factor.In addition, there are also the void that some other work concentrates on certain specific wireless networks
Quasi-ization, such as long-term evolving network (Long Term Evolution, LTE), Wireless Fidelity (Wireless
Fidelity, Wi-Fi) network, worldwide interoperability for microwave accesses (Worldwide Interoperability for Microwave
Access, Wi-MAX) network etc..It in wireless access network, needs to solve there are still following problems: being difficult to meet different business
Differentiated service quality, network resource utilization are low, network load is unevenly distributed weighing apparatus.Therefore, how Internet resources to be dynamically distributed
It is a problem to be solved with solving the above problems.
[summary of the invention]
In view of this, the embodiment of the invention provides a kind of resource allocation methods of wireless access network and devices, to reality
Internet resources are now dynamically distributed, to solve according to the ranking results, and the virtual network for being included according to each service request
Topology and business constraint condition are the problems such as each service request distributes resource.
In a first aspect, the embodiment of the present invention provides a kind of resource allocation methods of wireless access network, it is implemented in software definition
On network SDN controller, which comprises
At least one service request is received, each service request includes virtual network topology and business constraint condition；
According to the demand information of the service quality of each service request, at least one described service request is ranked up, is obtained
To ranking results；
According to the ranking results, and the virtual network topology and business constraint item for being included according to each service request
Part distributes resource for each service request.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, according to each business
The demand information of the service quality of request is ranked up at least one described service request, obtains ranking results, comprising:
According to the priority of each service request, the service request for belonging to same priority is divided to a set；
According to the tolerant of delay of each service request, each service request belonged in a set is ranked up；
Identical at least two service request of identical and tolerant of delay if there is priority, according to bandwidth demand be this extremely
Few two service requests are ranked up, and obtain ranking results.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, according to each industry
Included virtual network topology and business constraint condition are requested in business, distribute resource for each service request, comprising:
It is topological according to the virtual network, determine the node type of resource required for the service request；
Connectivity constraint condition, assignment constraints condition and the capacity-constrained item for being included according to the business constraint condition
Part obtains the candidate physical node for meeting the business constraint condition for each node type；
At least one the smallest physical node of prescribed coefficient is obtained in candidate physical node, as target physical node,
The prescribed coefficient and average residual resource are in inversely prroportional relationship；
In the physical link composed by target physical node, obtains while meeting hop count constraint condition and bandwidth constraint item
The physical link of part, to distribute to corresponding service request as reliable links.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, according to the industry
Connectivity constraint condition, assignment constraints condition and the capacity constraints that business constraint condition is included, for each node type
Obtain the candidate physical node for meeting the business constraint condition, comprising:
For each node type, obtains while meeting connectivity constraint condition, assignment constraints condition and capacity-constrained item
The candidate physical node of part；Wherein, the connectivity constraint condition is if physical node npCarrying dummy nodeIt holds
Carry next dummy node of the businessPhysical node np+1With physical node npConnection；The assignment constraints condition is
Belong to the dummy node of same business on a physical node；The capacity constraints are that the active volume of physical node is big
In the expected capacity of dummy node.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, the hop count is about
Beam condition is less than or equal to the time delay of the end-to-end transmission of business for the time delay of the physical link generation distributed.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, the bandwidth is about
Beam condition is greater than the bandwidth demand of business for the residual available bandwidth of the physical link distributed.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, if meeting simultaneously
The physical link of hop count constraint condition and bandwidth constraint condition is at least two, the physical link composed by target physical node
In, the physical link of hop count constraint condition and bandwidth constraint condition is obtained while meeting, to distribute to correspondence as reliable links
Service request, comprising: at least two physical links, obtain finishing service after the highest physical link conduct of profit
Reliable links distribute to corresponding service request.
Second aspect, the embodiment of the present invention provide a kind of resource allocation device of wireless access network, are set to software definition
On network SDN controller, described device includes:
Receiving module, for receiving at least one service request, each service request include virtual network topology and
Business constraint condition；
Sorting module asks at least one described business for the demand information according to the service quality of each service request
It asks and is ranked up, obtain ranking results；
Distribution module is used for according to the ranking results, and the virtual network topology for being included according to each service request
With business constraint condition, resource is distributed for each service request.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, the sequence mould
Block is specifically used for:
According to the priority of each service request, the service request for belonging to same priority is divided to a set；
According to the tolerant of delay of each service request, each service request belonged in a set is ranked up；
Identical at least two service request of identical and tolerant of delay if there is priority, according to bandwidth demand be this extremely
Few two service requests are ranked up, and obtain ranking results.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, the distribution mould
Block is specifically used for:
It is topological according to the virtual network, determine the node type of resource required for the service request；
Connectivity constraint condition, assignment constraints condition and the capacity-constrained item for being included according to the business constraint condition
Part obtains the candidate physical node for meeting the business constraint condition for each node type；
At least one the smallest physical node of prescribed coefficient is obtained in candidate physical node, as target physical node,
The prescribed coefficient and average residual resource are in inversely prroportional relationship；
In the physical link composed by target physical node, obtains while meeting hop count constraint condition and bandwidth constraint item
The physical link of part, to distribute to corresponding service request as reliable links.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, the distribution mould
Block is used for the connectivity constraint condition, assignment constraints condition and the capacity constraints that are included according to the business constraint condition,
When meeting the candidate physical node of the business constraint condition for the acquisition of each node type, it is specifically used for:
For each node type, obtains while meeting connectivity constraint condition, assignment constraints condition and capacity-constrained item
The candidate physical node of part；Wherein, the connectivity constraint condition is if physical node npCarrying dummy nodeIt holds
Carry next dummy node of the businessPhysical node np+1With physical node npConnection；The assignment constraints condition is
Belong to the dummy node of same business on a physical node；The capacity constraints are that the active volume of physical node is big
In the expected capacity of dummy node.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, the hop count is about
Beam condition is less than or equal to the time delay of the end-to-end transmission of business for the time delay of the physical link generation distributed.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, the bandwidth is about
Beam condition is greater than the bandwidth demand of business for the residual available bandwidth of the physical link distributed.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, if meeting simultaneously
The physical link of hop count constraint condition and bandwidth constraint condition is at least two, and the distribution module is used in target physical node
In composed physical link, the physical link of hop count constraint condition and bandwidth constraint condition is obtained while meeting, using as can
When line link distributes to corresponding service request, it is specifically used for: at least two physical links, after obtaining finishing service
The highest physical link of profit distributes to corresponding service request as reliable links.
The embodiment of the present invention has the advantages that
In the embodiment of the present invention, the demand information of the service quality of each service request based on the received, to described at least one
A service request is ranked up, and obtains ranking results, therefore can satisfy the differentiated service quality of different business, then according to
Ranking results, and the virtual network topology and business constraint condition for being included according to each service request, are each service request
Resource is distributed, the reasonable distribution of Internet resources is realized, improves network resource utilization, avoids load point to a certain extent
The unbalanced problem of cloth, realizes dynamic allocation Internet resources.
[Detailed description of the invention]
In order to illustrate the technical solution of the embodiments of the present invention more clearly, below will be to needed in the embodiment attached
Figure is briefly described, it should be apparent that, drawings in the following description are only some embodiments of the invention, for this field
For those of ordinary skill, without creative efforts, it can also be obtained according to these attached drawings other attached drawings.
Fig. 1 is the virtualization system based on SDN provided by the embodiment of the present invention；
Fig. 2 is the flow diagram of the resource allocation methods of wireless access network provided by the embodiment of the present invention；
Fig. 3 is another flow diagram of the resource allocation methods of wireless access network provided by the embodiment of the present invention；
Fig. 4 is the functional block diagram of the resource allocation device of wireless access network provided by the embodiment of the present invention；
Fig. 5 is the topology example figure of software defined network controller provided by the embodiment of the present invention.
[specific embodiment]
For a better understanding of the technical solution of the present invention, being retouched in detail to the embodiment of the present invention with reference to the accompanying drawing
It states.
It will be appreciated that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.Base
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts it is all its
Its embodiment, shall fall within the protection scope of the present invention.
The term used in embodiments of the present invention is only to be not intended to be limiting merely for for the purpose of describing particular embodiments
The present invention.In the embodiment of the present invention and the "an" of singular used in the attached claims, " described " and "the"
It is also intended to including most forms, unless the context clearly indicates other meaning.
It should be appreciated that term "and/or" used herein is only a kind of incidence relation for describing affiliated partner, indicate
There may be three kinds of relationships, for example, A and/or B, can indicate: individualism A, exist simultaneously A and B, individualism B these three
Situation.In addition, character "/" herein, typicallys represent the relationship that forward-backward correlation object is a kind of "or".
Depending on context, word as used in this " if " can be construed to " ... when " or " when ...
When " or " in response to determination " or " in response to detection ".Similarly, depend on context, phrase " if it is determined that " or " if detection
(condition or event of statement) " can be construed to " when determining " or " in response to determination " or " when the detection (condition of statement
Or event) when " or " in response to detection (condition or event of statement) ".
Referring to FIG. 1, it is the virtualization system based on SDN provided by the embodiment of the present invention, as shown in Figure 1, this is
System includes physical layer, control layer and operation layer.Wherein, service layer requests (SR1~SRk as shown in Figure 1) to various businesses,
Service request is sent to control layer by the northbound interface between operation layer and control layer.SDN controller in control layer is
The core for realizing resource virtualizing, is mainly responsible for the centralized control of resource, realizes the abstract of physical resource, United Dispatching and divides
Match, path planning etc..SDN controller need be in response to the service request that receives service dynamic distribution physical node and
Physical link.Physical layer is bottom physical resource, mainly includes the physical resources such as gateway, wireless router and bandwidth, physics
It is interacted between layer and control layer by southbound interface, realizes the wireless network access services of power business.
Wherein, the physical network in physical layer shown in FIG. 1 can be indicated with weighted undirected graph G=(N, L), wherein N table
Show the physical node set in physical network, L indicates physics link set.Physical node (ni∈ N, i ∈ { 1,2 ..., N }), N
Indicate the number of physical node.For arbitrary node np, the capacity of bearer service is Cap (np).For arbitrarily connecting physics section
Point niWith physical node njPhysical link l (i, j) ∈ L | i ≠ j, i, j ∈ { 1,2 ..., N }, bandwidth are B (l), and time delay is
D(l).P (i, j) ∈ P is indicated from physical node niTo physical node njLink set, P indicates all physics link sets.
Based on system shown in FIG. 1, the embodiment of the invention provides a kind of resource allocation methods of wireless access network, the party
Method is implemented on SDN controller.Referring to FIG. 2, its resource allocation side for wireless access network provided by the embodiment of the present invention
The flow diagram of method, as shown in Fig. 2, this method may comprise steps of:
S201, at least one service request is received, each service request includes virtual network topology and business constraint
Condition.
Specifically, as shown in Figure 1, the SDN controller in control layer can receive what operation layer provided by northbound interface
Service request (SR1~SRk as shown in Figure 1), in the embodiment of the present invention, each service request includes virtual network topology and industry
Business constraint condition.
It should be noted that virtual network topology is used to indicate that the service request needs the node type of resource to be used,
Such as wireless router and gateway.Virtual network topology can use weighted undirected graph GV=(NV, LV) indicate, wherein NVIndicate virtual
Node collection, LVIndicate virtual link collection.To any dummy nodeM indicates dummy node
Number.For any dummy nodeIt can useIndicate desired node capacity.For any virtual link lV
(u, v) ∈ LV, with B (lV(u, v)) indicate desired bandwidth.In the embodiment of the present invention, SDN controller is according to virtual in service request
Each node type that network topology is included, finds the physical node for meeting its constraint condition.
In a kind of specific embodiment, business constraint condition may include connectivity constraint condition, assignment constraints item
Part, capacity constraints, hop count constraint condition and bandwidth constraint condition.
S202, the demand information according to the service quality of each service request, arrange at least one described service request
Sequence obtains ranking results.
S203, according to the ranking results, and the virtual network topology and business that are included according to each service request are about
Beam condition distributes resource for each service request.
For step S202, the embodiment of the invention provides following feasible embodiments.
For example, the service quality of service request may include priority, tolerant of delay and bandwidth demand.
Specifically, the service request for belonging to same priority can be divided to one according to the priority of each service request
A set；Then, according to the tolerant of delay of each service request, each service request belonged in a set is ranked up；Such as
Fruit is identical there are priority and identical at least two service request of tolerant of delay, is at least two business according to bandwidth demand
Request is ranked up.Therefore, successively service request is ranked up according to priority, tolerant of delay and bandwidth demand.For example, can
With the sequence according to priority from high to low, each service request is divided to different sets.In another example according to tolerant of delay by short
To long sequence, each service request for belonging to identity set is ranked up.In another example according to descending suitable of bandwidth demand
Ordered pair service request is ranked up.
For step S203, the embodiment of the invention provides following feasible embodiments.
Specifically, according to the sequence in ranking results, successively service request is handled after obtaining ranking results,
That is, resource is distributed for each service request, with finishing service.SDN controller can be global by OpenFlow agreement, manages object
The resource status of layer is managed, and is that different power businesses carries out unified Resource Distribution and Schedule, resource shape by northbound interface
State mainly includes the state and link state of physical node.
In a kind of specific embodiment, the virtual network topology and business constraint that are included according to each service request
Condition, distributing resource for each service request may include:
Firstly, it is topological according to the virtual network, determine the node type of resource required for the service request；Then,
Connectivity constraint condition, assignment constraints condition and the capacity constraints for being included according to the business constraint condition, for every
A node type obtains the candidate physical node for meeting the business constraint condition；Then, it obtains and refers in candidate physical node
Determine at least one the smallest physical node of coefficient, as target physical node, the prescribed coefficient and average residual resource are in anti-
Proportionate relationship；Finally, obtain in the physical link composed by target physical node while meeting hop count constraint condition and bandwidth
The physical link of constraint condition is distributed to corresponding using physical link composed by the target physical node as reliable links
Service request.
In a kind of feasible embodiment, the connectivity constraint condition that is included according to the business constraint condition, point
With constraint condition and capacity constraints, the candidate physical section for meeting the business constraint condition is obtained for each node type
Point, comprising:
For each node type, obtains while meeting connectivity constraint condition, assignment constraints condition and capacity-constrained item
The node of part；Wherein, the connectivity constraint condition is if physical node npCarrying dummy nodeCarry the business
Next dummy nodePhysical node np+1With physical node npConnection；The assignment constraints condition is same to belong to
The dummy node of business is on a physical node；The capacity constraints are that the active volume of physical node is greater than virtual section
The expected capacity of point.
Wherein, for connectivity constraint condition, if physical node npCarrying dummy nodeThen to carry the industry
Next dummy node of businessPhysical node np+1It must be with physical node npConnection, can be indicated with following formula:
In the formula, gP, p+1Indicate physical node npWith physical node np+1Connectivity, gP, p+1=1 indicates two physics
Node connection, gP, p+1Indicate that two physical nodes are not connected to when=0.
Wherein, for assignment constraints condition, the dummy node for belonging to same business can only be on a physical node, can be with
It is indicated with following formula:
It should be noted that physical node may include gateway, wireless router etc. in the embodiment of the present invention, has and hold
The ability of load business, state with capacity, redundancy capacity and active volume by being indicated.
Wherein, a physical node can distribute multiple dummy nodes, refer to distribution in the physical node with capacity
On the occupied capacity of dummy node, can use the description of following formula:
In the formula, Capcon(np) indicate physical node npUsed capacity,For variable, dummy node n is indicatedqWith object
Manage node npThe relations of distribution, in the assignment procedure, if physical node npDistribute to dummy node nq, then the variable-value is 1,
Otherwise, which is 0.Indicate dummy node nqDesired node capacity.
Wherein, redundancy capacity CapredIt refers to the spare capacity of physical node, is a fixed value, for avoiding node
It operates at full capacity.
Wherein, active volume refers to the capacity for the dummy node that physical node can also carry, and can use following public affairs
Formula indicates:
Caprem(np)=Cap (np)-Capcon(np)-Capred
In the formula, Caprem(np) indicate active volume, Cap (np) indicate physical node bearer service capacity.
In the embodiment of the present invention, need to obtain and meet the nodes of capacity constraints, that is, obtain physical node can
It is greater than the node of the expected capacity of dummy node with capacity, that is, the active volume of physical node is greater than the expectation of dummy node
When capacity, the dummy node can be just distributed to, can be indicated with following formula:
It can be each node type by using connectivity constraint condition, assignment constraints condition and capacity constraints
Then the candidate physical node for obtaining while meeting these three constraint conditions needs to obtain at least one physics using prescribed coefficient
Node, using as target physical node.
In a kind of feasible embodiment, the prescribed coefficient and average residual resource are in inversely prroportional relationship, so that providing
In the assigning process of source, the node more than remaining bandwidth is preferred, which can use following formula description:
In the formula, α and β indicate proportionality coefficient, for adjustingValue, constant γ is set as a lesser number
Value, for avoidingThe case where equal to 0, occurs.
The bandwidth status of physical link, which can be divided into, in the embodiment of the present invention, in physical layer has used bandwidth and available bandwidth.
Wherein, the band used with the bandwidth that bandwidth includes physical link bearer service request with other interfering links in interference domain
It is wide；Available bandwidth includes the bandwidth and residual available bandwidth for interfering all physics link sharings in domain.The description of above-mentioned bandwidth is such as
Under:
For bandwidth has been used, B is usedconWhat (l (i, j)) was expressed as physical link l (i, a j) ∈ L has used bandwidth resources,
It is described as follows using formula:
In the formula,For variable, virtual link l is indicatedVThe relations of distribution between (u, v) and physical link l (i, j),
In the assignment procedure, if physical link l (i, j) distributes to virtual link lV(u, v), the variable-value are 1, otherwise, the variable
Value is 0.
For residual available bandwidth, it is contemplated that there are interference problems for wireless network, when two physical link work are identical
Channel and its physical node in niAnd njWireless coverage in when can generate interference.With interference domain D (i, j) expression and object
The link set that reason link l (i, j) is mutually interfered, is described as follows using formula:
D (i, j)={ l (p, q)
∈ L | ch (p, q)
=ch (i, j), [d (i, p)≤dIOr d (i, q)≤dIOr d (j, p)≤dIOr d (j, q)≤dI]}
Wherein, ch (i, j) indicate physical link l (i, j) where channel, d (i, j) indicate two physical nodes between away from
From dIIndicate the disturbance range of the radio under given transmission power.
Therefore, Brem(l (i, j)) indicates the residual available bandwidth resource of physical link l (i, a j) ∈ L, utilizes formula
It is described as follows:
For the bandwidth that other interfering links in interference domain use, due to the presence of air interference, residual available bandwidth is not
Can all carry new service request, and all link sharings in an interference domain, thus introduce interference domain D (i,
J) average available link bandwidth b (i, j) in, is described using following formula:
Wherein, | D (i, j) | indicate the number of physical link in D (i, j).
In addition, the available bandwidth B (p) of physical pathway p is equal to the physics chain in the physical pathway with minimum remaining bandwidth
The available bandwidth on road can use following formula description:
The average available bandwidth b (p) of physical pathway p can equal to the link on the path with minimum average residual bandwidth
With bandwidth, following formula description can use:
Based on foregoing description, in the embodiment of the present invention, bandwidth constraint condition is available for the residue of the physical link distributed
Band is wider than the bandwidth demand of business, that is, can use following formula description:
C4:V (lV(u, v))≤Brem(l (i, j))
In the formula, Brem(l (i, j)) indicates the residual available bandwidth of physical link, B (lV(u, v)) indicate business band
Wide demand.
Based on foregoing description, in the embodiment of the present invention, time delay that hop count constraint condition generates for the physical link that is distributed
Less than or equal to the time delay of the end-to-end transmission of business, that is, can use following formula description:
C5: ∑ D (l (i, j)) < D
In the formula, D indicates the time delay of the end-to-end transmission of business.
Further, the physical link that hop count constraint condition and bandwidth constraint condition are met while if obtaining exists at least
Two, then at least two physical links, the highest physical link of profit is as reliable links after obtaining finishing service
Distribute to corresponding service request.
Specifically, SDN controller also needs to be provided in conjunction with the profit for completing the business when receiving service request
Source distribution.The profit for completing the business refers to that the income of service request subtracts the cost using physical resource.
For example, mainly considering the physical node of bearer service request and disappearing for bandwidth resources using the cost of physical resource
Consumption, can use following formula and describes the cost:
In the formula, Co (SR) indicates to use the cost of physical resource, c1Indicate the cost of unit physical link bandwidth, c2
Indicate the cost of unit physical node capacity.
For example, the income of service request mainly requests to obtain by finishing service, it can use following formula and obtain industry
The income of business request:
In the formula, Re (SR) indicates the income of service request, rcIndicate to complete a grade as the income of the business of c, kc
Indicate that completed grade is the quantity of the business of c.
So the profit for completing the business can use following formula description:
In the formula, Pr (SR) indicates to complete the profit of the business.
In conclusion SDN controller is that the resource of service request distribution can use following formula in the embodiment of the present invention
It indicates:
That is, meet above-mentioned C1 at the same time, C2, C3 while constraint condition represented by C4, C5, are obtained and are completed the industry
The profit greatest physical node and physical link of business, as the resource for the traffic assignments.
Referring to FIG. 3, its another process for the resource allocation methods of wireless access network provided by the embodiment of the present invention
Schematic diagram, as shown in figure 3, this method may comprise steps of:
Relevant parameter is arranged in S301, the resource data for initializing electric power wireless access network.
The service request that S302, basis reach within the same period, recording its priority, tolerant of delay and bandwidth needs
It asks, successively each service request is ranked up according to priority, tolerant of delay and bandwidth demand.
S303, for the service request in ranking results, about according to connectivity constraint condition, assignment constraints condition and capacity
Beam condition, the node type for including by virtual network topology in each service request obtain the time for meeting above three condition
Select physical node set.
S304, prescribed coefficient is selected in each candidate physical node setPhysics section of the smallest node as distribution
Point.
S305, physical link is generated according to each physical node that distribution obtains, then judges business on the physical link
Duration and tolerant of delay between size, if business the duration on physical link be less than or equal to tolerance when
Prolong, executes step S306.Conversely, executing step S307.
S306, the physical link can distribute to the service request, which is distributed to the service request, return
The physical link.
S307, judge size between the waiting time of the service request and tolerant of delay, if the waiting time be greater than or
Equal to tolerant of delay, step S308 is executed, conversely, executing step S309.
S308, the service request can be distributed to without physical link, return without available link, terminate process.
S309, modification prescribed coefficientIn proportionality coefficient α and β, then execute step S304, that is, reselecting finger
Determine coefficientPhysical node of the smallest node as distribution.
In the embodiment of the present invention, SDN controller considers the need of the service quality of service request when carrying out resource allocation
It asks, realizes the cross-layer and bi-directional perception to resource status and QoS requirement, can dynamically carry out resource allocation, reduce
Network cost improves the utilization efficiency of Internet resources.Moreover, when carrying out resource allocation, considering cost, profit, object
Situations such as managing node load balancing, optimizes resource allocation, promotes the performance of resource allocation.Additionally, it is contemplated that high preferential
The preferential distribution of grade business, while opening the equilibrium of rate link, reduces local link pressure, reduce link paralyse because of congestion from
And the case where bearer service can not be continued appearance, improve network utilization.
The embodiment of the invention also provides a kind of resource allocation devices of wireless access network, are set to software defined network
On SDN controller.Referring to FIG. 4, its function for the resource allocation device of wireless access network provided by the embodiment of the present invention
Block diagram, as shown in figure 4, described device includes:
Receiving module 40, for receiving at least one service request, each service request includes virtual network topology
With business constraint condition；
Sorting module 41, for the demand information according to the service quality of each service request, at least one described business
Request is ranked up, and obtains ranking results；
Distribution module 42, for being opened up according to the ranking results, and according to the virtual network that each service request is included
Flutter with business constraint condition, for each service request distribute resource.
In a kind of specific embodiment, the sorting module 41 is specifically used for:
According to the priority of each service request, the service request for belonging to same priority is divided to a set；
According to the tolerant of delay of each service request, each service request belonged in a set is ranked up；
Identical at least two service request of identical and tolerant of delay if there is priority, according to bandwidth demand be this extremely
Few two service requests are ranked up, and obtain ranking results.
In a kind of specific embodiment, the distribution module 42 is specifically used for:
It is topological according to the virtual network, determine the node type of resource required for the service request；
Connectivity constraint condition, assignment constraints condition and the capacity-constrained item for being included according to the business constraint condition
Part obtains the candidate physical node for meeting the business constraint condition for each node type；
At least one the smallest physical node of prescribed coefficient is obtained in candidate physical node, as target physical node,
The prescribed coefficient and average residual resource are in inversely prroportional relationship；
In the physical link composed by target physical node, obtains while meeting hop count constraint condition and bandwidth constraint item
The physical link of part, to distribute to corresponding service request as reliable links.
In a kind of specific embodiment, the distribution module 42 for being included according to the business constraint condition
Connectivity constraint condition, assignment constraints condition and capacity constraints meet the business about for the acquisition of each node type
When the candidate physical node of beam condition, it is specifically used for:
For each node type, obtains while meeting connectivity constraint condition, assignment constraints condition and capacity-constrained item
The candidate physical node of part；Wherein, the connectivity constraint condition is if physical node npCarrying dummy nodeIt holds
Carry next dummy node of the businessPhysical node np+1With physical node npConnection；The assignment constraints condition is
Belong to the dummy node of same business on a physical node；The capacity constraints are that the active volume of physical node is big
In the expected capacity of dummy node.
In a kind of specific embodiment, the hop count constraint condition is small for the time delay of the physical link generation distributed
In or equal to the end-to-end transmission of business time delay.
In a kind of specific embodiment, bandwidth constraint condition is stated as the residual available bandwidth of the physical link distributed
Greater than the bandwidth demand of business.
In a kind of specific embodiment, if meeting the physical link of hop count constraint condition and bandwidth constraint condition simultaneously
It is at least two, the distribution module 42 is for obtaining while meeting jump in the physical link composed by target physical node
The physical link of number constraint condition and bandwidth constraint condition, when distributing to corresponding service request as reliable links, specifically
For: at least two physical links, the highest physical link of profit is as reliable links point after obtaining finishing service
The corresponding service request of dispensing.
The embodiment of the invention also provides a kind of software defined network controllers, referring to FIG. 5, it is the embodiment of the present invention
The topology example figure of provided software defined network controller, as shown in figure 5, including memory 500 and processor 600, institute
It states and is stored with computer-readable instruction in memory 500, when the computer-readable instruction is executed by the processor 600, make
It obtains the processor 600 and executes the above method.
The embodiment of the invention also provides a kind of computer readable storage mediums, comprising: computer executable instructions work as institute
The above method is executed when stating computer executable instructions operation.
It is apparent to those skilled in the art that for convenience and simplicity of description, the system of foregoing description,
The specific work process of device and module, can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.
In several embodiments provided by the present invention, it should be understood that disclosed system, device and method can be with
It realizes by another way.For example, the apparatus embodiments described above are merely exemplary, for example, the module
It divides, only a kind of logical function partition, there may be another division manner in actual implementation, for example, multiple modules or group
Part can be combined or can be integrated into another system, or some features can be ignored or not executed.Another point, it is shown
Or the mutual coupling, direct-coupling or communication connection discussed can be through some interfaces, device or module it is indirect
Coupling or communication connection can be electrical property, mechanical or other forms.
The module as illustrated by the separation member may or may not be physically separated, aobvious as module
The component shown may or may not be physical module, it can and it is in one place, or may be distributed over multiple
In network unit.Some or all of the modules therein can be selected to realize the mesh of this embodiment scheme according to the actual needs
's.
It, can also be in addition, each functional module in each embodiment of the present invention can integrate in one processing unit
It is that modules physically exist alone, can also be integrated in one unit with two or more modules.Above-mentioned integrated list
Member both can take the form of hardware realization, can also realize in the form of hardware adds SFU software functional unit.
The above-mentioned integrated unit being realized in the form of SFU software functional unit can store and computer-readable deposit at one
In storage media.Above-mentioned SFU software functional unit is stored in a storage medium, including some instructions are used so that a computer
It is each that device (can be personal computer, server or network equipment etc.) or processor (Processor) execute the present invention
The part steps of embodiment the method.And storage medium above-mentioned includes: USB flash disk, mobile hard disk, read-only memory (Read-
Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic or disk etc. it is various
It can store the medium of program code.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all in essence of the invention
Within mind and principle, any modification, equivalent substitution, improvement and etc. done be should be included within the scope of the present invention.
Claims (14)
1. a kind of resource allocation methods of wireless access network, which is characterized in that it is implemented on software defined network SDN controller,
The described method includes:
At least one service request is received, each service request includes virtual network topology and business constraint condition；
According to the demand information of the service quality of each service request, at least one described service request is ranked up, is arranged
Sequence result；
According to the ranking results, and the virtual network topology and business constraint condition for being included according to each service request, it is
Each service request distributes resource.
2. the method according to claim 1, wherein according to the demand information of the service quality of each service request,
At least one described service request is ranked up, ranking results are obtained, comprising:
According to the priority of each service request, the service request for belonging to same priority is divided to a set；
According to the tolerant of delay of each service request, each service request belonged in a set is ranked up；
Identical at least two service request of identical and tolerant of delay if there is priority, according to bandwidth demand be this at least two
A service request is ranked up, and obtains ranking results.
3. according to the method described in claim 1, the virtual network topology and business constraint that are included according to each service request
Condition distributes resource for each service request, comprising:
It is topological according to the virtual network, determine the node type of resource required for the service request；
Connectivity constraint condition, assignment constraints condition and the capacity constraints for being included according to the business constraint condition, needle
The candidate physical node for meeting the business constraint condition is obtained to each node type；
At least one the smallest physical node of prescribed coefficient is obtained in candidate physical node, it is described as target physical node
Prescribed coefficient and average residual resource are in inversely prroportional relationship；
In the physical link composed by target physical node, obtains while meeting hop count constraint condition and bandwidth constraint condition
Physical link, to distribute to corresponding service request as reliable links.
4. according to the method described in claim 3, it is characterized in that, the connectivity for being included according to the business constraint condition about
Beam condition, assignment constraints condition and capacity constraints meet the business constraint condition for the acquisition of each node type
Candidate physical node, comprising:
For each node type, obtains while meeting connectivity constraint condition, assignment constraints condition and capacity constraints
Candidate physical node；Wherein, the connectivity constraint condition is if physical node npCarrying dummy nodeCarrying should
Next dummy node of businessPhysical node np+1With physical node npConnection；The assignment constraints condition is to belong to
The dummy node of same business is on a physical node；The capacity constraints are that the active volume of physical node is greater than void
The expected capacity of quasi- node.
5. according to the method described in claim 3, it is characterized in that, the hop count constraint condition produces for the physical link distributed
Raw time delay is less than or equal to the time delay of the end-to-end transmission of business.
6. according to the method described in claim 3, it is characterized in that, the bandwidth constraint condition is the physical link that is distributed
Residual available bandwidth is greater than the bandwidth demand of business.
7. according to the method described in claim 3, it is characterized in that, if meeting hop count constraint condition and bandwidth constraint condition simultaneously
Physical link be at least two, in the physical link composed by target physical node, obtain and meanwhile meet hop count constraint item
The physical link of part and bandwidth constraint condition, to distribute to corresponding service request as reliable links, comprising: it is described at least
In two physical links, the highest physical link of profit is distributed to corresponding business as reliable links and is asked after acquisition finishing service
It asks.
8. a kind of resource allocation device of wireless access network, which is characterized in that it is set on software defined network SDN controller,
Described device includes:
Receiving module, for receiving at least one service request, each service request includes virtual network topology and business
Constraint condition；
Sorting module, for the demand information according to the service quality of each service request, at least one described service request into
Row sequence, obtains ranking results；
Distribution module, for according to the ranking results, and the virtual network topology and industry for being included according to each service request
Business constraint condition distributes resource for each service request.
9. device according to claim 8, which is characterized in that the sorting module is specifically used for:
According to the priority of each service request, the service request for belonging to same priority is divided to a set；
According to the tolerant of delay of each service request, each service request belonged in a set is ranked up；
Identical at least two service request of identical and tolerant of delay if there is priority, according to bandwidth demand be this at least two
A service request is ranked up, and obtains ranking results.
10. device according to claim 8, the distribution module, are specifically used for:
It is topological according to the virtual network, determine the node type of resource required for the service request；
Connectivity constraint condition, assignment constraints condition and the capacity constraints for being included according to the business constraint condition, needle
The candidate physical node for meeting the business constraint condition is obtained to each node type；
At least one the smallest physical node of prescribed coefficient is obtained in candidate physical node, it is described as target physical node
Prescribed coefficient and average residual resource are in inversely prroportional relationship；
In the physical link composed by target physical node, obtains while meeting hop count constraint condition and bandwidth constraint condition
Physical link, to distribute to corresponding service request as reliable links.
11. device according to claim 10, which is characterized in that the distribution module is used for according to the business constraint item
Connectivity constraint condition, assignment constraints condition and the capacity constraints that part is included obtain for each node type and meet
When the candidate physical node of the business constraint condition, it is specifically used for:
For each node type, obtains while meeting connectivity constraint condition, assignment constraints condition and capacity constraints
Candidate physical node；Wherein, the connectivity constraint condition is if physical node npCarrying dummy nodeCarrying should
Next dummy node of businessPhysical node np+1With physical node npConnection；The assignment constraints condition is to belong to
The dummy node of same business is on a physical node；The capacity constraints are that the active volume of physical node is greater than void
The expected capacity of quasi- node.
12. device according to claim 10, which is characterized in that the hop count constraint condition is the physical link that is distributed
The time delay of generation is less than or equal to the time delay of the end-to-end transmission of business.
13. device according to claim 10, which is characterized in that the bandwidth constraint condition is the physical link that is distributed
Residual available bandwidth be greater than business bandwidth demand.
14. device according to claim 10, which is characterized in that if meeting hop count constraint condition and bandwidth constraint item simultaneously
The physical link of part is at least two, and the distribution module is for obtaining in the physical link composed by target physical node
The physical link for meeting hop count constraint condition and bandwidth constraint condition simultaneously, is asked using distributing to corresponding business as reliable links
When asking, be specifically used for: at least two physical links, the highest physical link conduct of profit can after obtaining finishing service
Line link distributes to corresponding service request.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2019/094832 WO2020177255A1 (en) | 2018-06-26 | 2019-07-05 | Resource allocation method and device for wireless access network |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2018106714677 | 2018-06-26 | ||
| CN201810671467 | 2018-06-26 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109743751A true CN109743751A (en) | 2019-05-10 |
| CN109743751B CN109743751B (en) | 2021-08-03 |
Family
ID=66369047
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910156045.0A Active CN109743751B (en) | 2018-06-26 | 2019-03-01 | Resource allocation method and device for wireless access network |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN109743751B (en) |
| WO (1) | WO2020177255A1 (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110557345A (en) * | 2019-08-19 | 2019-12-10 | 广东电网有限责任公司 | power communication network resource allocation method |
| WO2020177255A1 (en) * | 2018-06-26 | 2020-09-10 | 国网江苏省电力有限公司南京供电分公司 | Resource allocation method and device for wireless access network |
| CN112491741A (en) * | 2020-10-19 | 2021-03-12 | 国网上海市电力公司 | Virtual network resource allocation method and device and electronic equipment |
| CN113032112A (en) * | 2019-12-25 | 2021-06-25 | 上海商汤智能科技有限公司 | Resource scheduling method and device, electronic equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104009871A (en) * | 2014-06-06 | 2014-08-27 | 中国科学院声学研究所 | SDN controller implementation method and SDN controller |
| WO2016164061A1 (en) * | 2015-04-08 | 2016-10-13 | Hewlett Packard Enterprise Development Lp | Big data transfer |
| CN107770096A (en) * | 2017-12-11 | 2018-03-06 | 国网河南省电力公司信息通信公司 | A kind of SDN/NFV network dynamic resource allocation algorithms based on load balancing |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9378043B1 (en) * | 2015-05-28 | 2016-06-28 | Altera Corporation | Multilayer quality of service (QOS) for network functions virtualization platforms |
| CN106341351B (en) * | 2016-09-30 | 2019-05-24 | 西安空间无线电技术研究所 | A kind of path resources distribution method distinguished in hybrid network based on QoS |
| CN108512760B (en) * | 2018-03-09 | 2020-07-28 | 西安电子科技大学 | Routing method based on SDN guarantee service QoS |
| CN109743751B (en) * | 2018-06-26 | 2021-08-03 | 国网江苏省电力有限公司南京供电分公司 | Resource allocation method and device for wireless access network |
-
2019
- 2019-03-01 CN CN201910156045.0A patent/CN109743751B/en active Active
- 2019-07-05 WO PCT/CN2019/094832 patent/WO2020177255A1/en active Application Filing
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104009871A (en) * | 2014-06-06 | 2014-08-27 | 中国科学院声学研究所 | SDN controller implementation method and SDN controller |
| WO2016164061A1 (en) * | 2015-04-08 | 2016-10-13 | Hewlett Packard Enterprise Development Lp | Big data transfer |
| CN107770096A (en) * | 2017-12-11 | 2018-03-06 | 国网河南省电力公司信息通信公司 | A kind of SDN/NFV network dynamic resource allocation algorithms based on load balancing |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020177255A1 (en) * | 2018-06-26 | 2020-09-10 | 国网江苏省电力有限公司南京供电分公司 | Resource allocation method and device for wireless access network |
| CN110557345A (en) * | 2019-08-19 | 2019-12-10 | 广东电网有限责任公司 | power communication network resource allocation method |
| CN110557345B (en) * | 2019-08-19 | 2020-09-25 | 广东电网有限责任公司 | Power communication network resource allocation method |
| CN113032112A (en) * | 2019-12-25 | 2021-06-25 | 上海商汤智能科技有限公司 | Resource scheduling method and device, electronic equipment and storage medium |
| CN112491741A (en) * | 2020-10-19 | 2021-03-12 | 国网上海市电力公司 | Virtual network resource allocation method and device and electronic equipment |
| CN112491741B (en) * | 2020-10-19 | 2022-09-23 | 国网上海市电力公司 | Virtual network resource allocation method and device and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2020177255A1 (en) | 2020-09-10 |
| CN109743751B (en) | 2021-08-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3241319B1 (en) | Systems and methods for sdt to interwork with nfv and sdn | |
| US20190150158A1 (en) | Systems and methods for performing traffic engineering through network slices | |
| CN110896355B (en) | Network slice selection method and device | |
| CN109743751A (en) | The resource allocation methods and device of wireless access network | |
| CN109600262A (en) | Resource self-configuring and self-organization method and device in URLLC transmission network slice | |
| CN108076486A (en) | A kind of dynamic radio resource allocation algorithm based on load balancing | |
| US10356185B2 (en) | Optimal dynamic cloud network control | |
| CN108965014A (en) | The service chaining backup method and system of QoS perception | |
| CN112867088B (en) | Dynamic adjustment method and system for cloud-edge-end communication architecture | |
| CN115396514B (en) | Resource allocation method, device and storage medium | |
| CN114268548A (en) | Network slice resource arranging and mapping method based on 5G | |
| CN112073237B (en) | Large-scale target network construction method in cloud edge architecture | |
| Liu et al. | SN-VNE: A virtual network embedding algorithm for satellite networks | |
| Hirayama et al. | RAN slicing in multi-CU/DU architecture for 5G services | |
| Rafique et al. | An iot-aware vnf placement proof of concept in a hybrid edge-cloud smart city environment | |
| Mroziński et al. | Cost-aware DU placement and flow routing in 5G packet xHaul networks | |
| Overbeck et al. | Design of a 5G Network Slicing Architecture for Mixed-Critical Services in Cellular Energy Systems | |
| US11201816B2 (en) | Optimal routing in a communications network | |
| Shakeri et al. | Proactive admission control and dynamic resource management in SDN-based virtualized networks | |
| Li et al. | Complexity in 5G Network Applications and use cases | |
| CN107888398B (en) | A kind of service bearer system and control method | |
| Zacarias et al. | Optimum Network Slicing for Ultra-reliable Low Latency Communication (URLLC) Services in Campus Networks | |
| Nguyen et al. | Location-aware dynamic network provisioning | |
| Kokkinos et al. | Network Slicing in 5G Infrastructures from the Edge to the Core | |
| CN105847172B (en) | Job flow control 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220915 Address after: No.1, OTI street, Jianye District, Nanjing City, Jiangsu Province, 210019 Patentee after: STATE GRID JIANGSU ELECTRIC POWER Co.,Ltd. NANJING POWER SUPPLY BRANCH Patentee after: STATE GRID JIANGSU ELECTRIC POWER Co.,Ltd. Patentee after: STATE GRID CORPORATION OF CHINA Patentee after: NANJING SUYI INDUSTRIAL Co.,Ltd. Patentee after: JIANGSU YUANNENG ELECTRIC POWER ENGINEERING Co.,Ltd. Address before: No.1, OTI street, Jianye District, Nanjing City, Jiangsu Province, 210019 Patentee before: STATE GRID JIANGSU ELECTRIC POWER Co.,Ltd. NANJING POWER SUPPLY BRANCH Patentee before: STATE GRID JIANGSU ELECTRIC POWER Co.,Ltd. Patentee before: STATE GRID CORPORATION OF CHINA |
|
| TR01 | Transfer of patent right |