CN107666412B - The virtual network function dispositions method of service function chain - Google Patents
The virtual network function dispositions method of service function chain Download PDFInfo
- Publication number
- CN107666412B CN107666412B CN201711153260.2A CN201711153260A CN107666412B CN 107666412 B CN107666412 B CN 107666412B CN 201711153260 A CN201711153260 A CN 201711153260A CN 107666412 B CN107666412 B CN 107666412B
- Authority
- CN
- China
- Prior art keywords
- vertex
- service function
- virtual network
- source point
- reliability value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- 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
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
Abstract
The invention discloses a kind of virtual network function dispositions methods of service function chain comprising successively chooses the VNF not disposed in service function chain；When current VNF is not the last one VNF, reliability value of each vertex to source point s in calculating vertex set；When non-purpose vertex meets default constraint, then its vertex is updated using the reliability value of vertex to source point s and preset reliability value；It chooses maximum vertex and presets the current VNF of the corresponding non-purpose vertex deployment of reliability value；When current VNF is the last one VNF in service function chain, the first calculated value is calculated；When vertex, which meets, to impose a condition, then the given threshold of current vertex is updated using the ratio of the attribute reliability value of the first calculated value of current vertex and current vertex；When vertex all in vertex set have traversed, then chooses vertex corresponding to maximum given threshold in all vertex and dispose the last one VNF, and export deployment scheme.
Description
Technical field
The present invention relates to virtual network function deployment techniques in network function virtualization network topology, and in particular to a kind of clothes
The virtual network function dispositions method for function chain of being engaged in.
Background technique
In recent years, with the more and more variable and diversity of the demand of user, communication service provider (TSP) is increasingly
Urgent need finds a kind of more flexible, the lower mode of cost and carrys out on-premise network service.In this regard, the NFV occurred makes flexibly
Effective Dynamical Deployment service function chain and do not have to change special equipment and be possibly realized；Since European Telecommunications Standards Institute (ETSI) mentions
Out after the standard description scheme of NFV, the framework problem of NFV is just being keen to the project of research at many scholars.
Fig. 1 describes a kind of simple NFV framework, contains all virtual machines, physical layer on virtualization layer in Fig. 3
All bottom layer nodes are contained, either virtual machine or bottom layer node there are resources such as certain calculating, storage, network etc.
Come for user service.On network function virtualized infrastructure (NFVI) is aforementioned network service, is claimed
Make service function chain (SFC), it include it is a series of by virtual link connect different virtual network functions (VNF), one
VNF can represent a kind of actual network function.
The reliability of NFV is the key factor and premise of successful execution SFC, in this regard, having at present about the research of NFV: closing
In the NFV Deployment Algorithm Guaranteeing Reliability with Enhanced Protection of Reliability Assurance
(GREP) and about NFV the abnormal frame Joints Minimum Total Failure Removal (MTFR) of reliability assessment is disposed.The
Though a kind of method can realize the reliability for guaranteeing user, its backup protection mechanism proposed will consume a large amount of money
Source provides and safeguards backup VNFs；Second algorithm is the reliability assessment carried out after NFV deployment is completed to it, not
The Deployment Algorithm for the Reliability Assurance being to provide.
In this regard, how to improve network reliability of service to meet user demand, and these users request is mapped to bottom
It goes urgently to be solved in layer network.
Summary of the invention
For above-mentioned deficiency in the prior art, the present invention provides a kind of clothes that can be improved network reliability of service
The virtual network function dispositions method for function chain of being engaged in.
In order to achieve the above object of the invention, the technical solution adopted by the present invention are as follows:
A kind of virtual network function dispositions method of service function chain is provided comprising:
Obtain the topological diagram of service function chain and bottom-layer network；
The source point of service function chain and purpose vertex are deployed in the respective nodes of bottom-layer network, and successively choose service
The virtual network function that do not disposed in function chain；
When current virtual network function is not the last one virtual network function in service function chain, vertex set is calculated
In conjunction each vertex to service function chain source point reliability value；
The non-purpose vertex in vertex set is traversed, when non-purpose vertex meets default constraint, then using vertex to clothes
The reliability value of the source point for function chain of being engaged in updates its vertex and presets reliability value；
When non-purpose vertex all in vertex set have traversed, then maximum vertex in all non-purpose vertex is chosen
It presets the corresponding non-purpose vertex of reliability value and disposes current virtual network function, and delete the maximum vertex in vertex set
The default corresponding non-purpose vertex of reliability value；
When current virtual network function is the last one virtual network function in service function chain, vertex set is calculated
Middle current vertex is made to the reliability value on purpose vertex and the product of the reliability value of the source point of current vertex to service function chain
For the first calculated value of current vertex；
All vertex in vertex set are traversed, when vertex, which meets, to impose a condition, then using the first meter of current vertex
The given threshold of the ratio of calculation value and the attribute reliability value of current vertex update current vertex；
When vertex all in vertex set have traversed, then choose in all vertex corresponding to maximum given threshold
The last one virtual network function is disposed on vertex, and exporting includes vertex set, the virtual link for disposing all virtual network functions
The deployment scheme of forward node in the set of paths of deployment, path.
Further, the calculating capacity for being constrained to non-purpose vertex is preset more than or equal to meter needed for network virtual function
Capacity is calculated, and the reliability value of source point of the non-purpose vertex to service function chain is greater than its vertex and presets reliability value.
Further, it imposes a condition and holds for the calculating capacity on vertex more than or equal to calculating needed for network virtual function
Amount, and the ratio of the attribute reliability value on the first calculated value and vertex is greater than or equal to given threshold.
Further, calculate vertex set in each vertex to service function chain source point reliability value calculation method
Include:
Vertex set and current source point are obtained, and vertex set to be updated is made to be equal to vertex set；
All out-degree sides for traversing current source point judge purpose vertex of the current out-degree in remaining bandwidth resource and out-degree
Whether first default constraint condition is all satisfied；
If satisfied, calculate current source point to service function chain source point reliability value, the reliability value on current out-degree side
Product with the attribute reliability value three on the purpose vertex on out-degree side is as the second calculated value；
When the second calculated value is simultaneously greater than the reliability value of source point of the purpose vertex on current out-degree side to service function chain
When it is expected the reliability value reached with user, the purpose vertex on current out-degree side is updated to service function chain using the second calculated value
Source point reliability value；
When all out-degree sides of current source point have traversed completion, using full in the purpose vertex on all out-degree sides of current source point
The current source point of vertex update of the second default constraint condition of foot, and delete the current source point in vertex set to be updated；
When vertex set to be updated is nonvoid set, continue all out-degree sides for traversing current source point, until top to be updated
Point set is combined into empty set, obtain later each vertex in vertex set to service function chain source point reliability value.
Further, the first default constraint condition is that current out-degree side remaining bandwidth resource is greater than or equal to and need to be deployed in out
Spend while virtual link required for bandwidth resources and the purpose vertex when out-degree of current source point belong to vertex set to be updated.
Further, the second default constraint condition is that reliability value is maximum.
Further, the second default constraint condition is that load factor is minimum.
Further, the calculation formula of load factor are as follows:
Wherein, δ is load factor；For vertex viRemaining computing resource capacity；For vertex viOut-degree side；For
Vertex viOut-degree line set；For vertex viAn out-degree side remaining bandwidth resource；For vertex viTo the road of source point
All bandwidth resources expenses on diameter；VPFor the vertex set in bottom-layer network.
Further, the virtual network function dispositions method of the service function chain further includes Optimization deployment scheme:
Obtain in deployment scheme the smallest link of bandwidth in service function chain, and the smallest link of computation bandwidth is to purpose top
The number of links that point includes in total；
When number of links is greater than zero, the purpose virtual network function of the smallest link of bandwidth is obtained to service function chain
All virtual network function composition function set between purpose vertex；
Judge between the purpose vertex of service function chain and the last one virtual network function and in function set it is adjacent
It whether there is forward node between two virtual network functions；
If it exists, then when the available computational resources of forward node are greater than or equal to the purpose vertex of adjacent service function chain
The required computing resource of virtual network function, and the virtual network function on the purpose vertex of adjacent service function chain is mobile
Afterwards, the remaining bandwidth resource of the position disposed to all links between a virtual network function deployed position thereon is wanted
More than or equal to the virtual network function on the purpose vertex of adjacent service function chain and thereon between a virtual network function
When the bandwidth demand of virtual link, the virtual network function on the purpose vertex of adjacent service function chain is deployed in adjacent service function
On the forward node on the purpose vertex of energy chain, and number of links is reduced one；
It include vertex set, the virtual chain for disposing all virtual network functions after output optimization when number of links is equal to zero
The set of paths of road deployment, on path forward node deployment scheme.
The invention has the benefit that due to the present invention mainly consider during deployment the high node of Reliability comparotive and
Link disposes virtual functions and link, and the degree of reiability value in bottom-layer network is smaller than 1 positive number in addition, therefore seeking
The node for looking for appropriate node to find when disposing virtual functions can disposed in this way as close to the source node location of reference
The time of searching route can be greatlyd save when virtual functions, to reduce the deployment time of entire service request, improve deployment effect
Rate.
The present invention is had found by the comparison to lot of experimental data, since the method for this programme is in request receptance and net
It has outstanding performance, therefore during request services dynamic and reaches, occur blocking or is rejected in terms of network load balancing
Time can be more late than the time that other similar algorithm occurs.
This programme is when disposing virtual network function, due to having comprehensively considered the loading condition in network, each network
Service request is all to guarantee bottom-layer network as much as possible in the case where guarantee meets reliability requirement during deployment
Load balancing.Therefore, bottom-layer network has more abilities to go to accommodate the service request to arrive below, so blocking rate is also got over
It is small.
In deployment, due to consideration that load balancing, the request service that bottom-layer network can receive increases, therefore resource benefit
It is naturally also just increased with rate.Along with the raising of resource utilization, for identical bottom-layer network, the cost of operator is also
It reduces, its price for obtaining payment required for identical service also can be reduced accordingly for a user in this way.
Detailed description of the invention
Fig. 1 is the flow chart of virtual network function dispositions method one embodiment of service function chain.
Fig. 2 be calculate vertex set in each vertex to service function chain source point reliability value flow chart.
Fig. 3 is simple NFV framework described in background technique.
Fig. 4 is that VNF maps an example.
Specific embodiment
A specific embodiment of the invention is described below, in order to facilitate understanding by those skilled in the art this hair
It is bright, it should be apparent that the present invention is not limited to the ranges of specific embodiment, for those skilled in the art,
As long as various change is in the spirit and scope of the present invention that the attached claims limit and determine, these variations are aobvious and easy
See, all are using the innovation and creation of present inventive concept in the column of protection.
The flow chart of virtual network function dispositions method one embodiment of service function chain is shown with reference to Fig. 1, Fig. 1；
As shown in Figure 1, the method comprising the steps of 101 to step 108.
In a step 101, the topological diagram of service function chain and bottom-layer network is obtained；A is service function chain in Fig. 4, and b is bottom
Layer network topology, as shown in a in Fig. 4, a service function chain SFC request includes a series of void being together in series by virtual link
Quasi- network function VNF, source node s, a destination node t, and connect these nodes and the virtual link of VNF.
The present invention uses SR=(NS,LS, s, t) and indicate SFC request, whereinIt indicates
Network function set, | NS| indicate the function quantity in request.Indicate the link set of SFC, | LS|
Indicate the number of links in request service.Subscript s and t in request SR respectively indicate the source point and destination node of request, they
Indicate two different nodes in bottom-layer network, and the two nodes do not have any resource requirement.
Bottom-layer network is by being distributed in the different bottom layer node in multiple geographical locations and connecting the physical link of these nodes
Composition.Bottom-layer network includes router, interchanger, server and physical link.Each bottom layer node has a series of service function
Can, these nodes contain corresponding Resource Properties, and same every physical link all has corresponding bandwidth resources capacity etc..At this
Bottom-layer network figure is used into G in inventionP=(VP,EP) mathematic(al) representation indicate, wherein bottom-layer network model use existing GT-
The WaxMan2 of ITM is generated at random, whereinIndicate bottom-layer network node set, | VP| indicate bottom
The quantity of network node； Indicate the set in bottom-layer network in (when out-degree), | EP| indicate physics
The quantity of link.
In a step 102, the source point of service function chain and purpose vertex are deployed in the respective nodes of bottom-layer network, and
Successively choose the virtual network function that do not dispose in service function chain；Service function chain in Fig. 4 shown in a, is taken for the first time
When function chain of being engaged in deployment, other than the source point of service function chain and purpose vertex, VNF1 to VNF3 is the virtual net that do not dispose
Network function.
In step 103, when current virtual network function is not the last one virtual network function in service function chain
When, calculate vertex set in each vertex to service function chain source point reliability value.
In one embodiment of the invention, calculate vertex set in each vertex to service function chain source point it is reliable
The calculation method 200 of property value includes:
In step 201, vertex set and current source point are obtained, and vertex set to be updated is made to be equal to vertex set；By
In service function chain source point s and destination node t after the respective nodes of bottom-layer network are disposed, carry out virtual network function
When can dispose, current source point when initial is the source point of service function chain.
In step 202, all out-degree sides for traversing current source point judge current out-degree side remaining bandwidth resource and out-degree
Whether the purpose vertex on side is all satisfied the first default constraint condition；As shown in b in Fig. 4, the out-degree side of node A is respectively AF, AE
And AB, node F, E and B are respectively the purpose vertex of out-degree side AF, AE and AB.
When implementation, the default constraint condition of this programme preferably first is greater than or equal to for current out-degree side remaining bandwidth resource to be needed
Be deployed in out-degree while virtual link required for bandwidth resources and the purpose vertex when out-degree of current source point belong to it is to be updated
Vertex set.
In step 203, if satisfied, calculate current source point to service function chain source point reliability value, current out-degree
While reliability value and out-degree while purpose vertex attribute reliability value three product as the second calculated value.
For current source point be service function chain source point when, the reliability value of the source point of current source point to service function chain
The as attribute reliability value of source point of service function chain itself, the value are the reliability value of each node inherently,
It will not change with the update of network.
In step 204, when the second calculated value is simultaneously greater than the purpose vertex to the source of service function chain on current out-degree side
When the reliability value of point and user it is expected the reliability value reached, the purpose vertex on current out-degree side is updated using the second calculated value
To the reliability value of the source point of service function chain.
When being unsatisfactory for above-mentioned condition for the second calculated value, then the purpose vertex on corresponding out-degree side is not updated to service function
The reliability value of the source point of chain.
In step 205, when all out-degree sides of current source point have traversed completion, using all out-degree sides of current source point
Meet the current source point of vertex update of the second default constraint condition in purpose vertex, and deletes current in vertex set to be updated
Source point.
When implementation, the default constraint condition of the second of this programme can be maximum for reliability value, or load factor is most
It is small.
The calculation formula of the load factor introduced during virtual network function deployment are as follows:
Wherein, δ is load factor；For vertex viRemaining computing resource capacity；For vertex viOut-degree side；For
Vertex viOut-degree line set；For vertex viAn out-degree side remaining bandwidth resource；For vertex viTo the road of source point
All bandwidth resources expenses on diameter；VPFor the vertex set in bottom-layer network.
Effect of this programme to two kinds of situations of the second default constraint condition is illustrated below:
Assuming that the reliability that user requires is 0.90 when progress service function chain is disposed, scheme with reference to the b in Fig. 4,
If selecting the current source point of the maximum vertex update of reliability value in vertex, finally formed clothes in step 101 to step 108
The deployment path of business functional link is the reliability of service function forward-path 2 (AECH) deployment scheme in the b figure in Fig. 4
It is 0.97, resource overhead is 232.
If selecting in the purpose vertex on all out-degree sides of current source point load factor in step 101 to step 108 most
The current source point of small vertex update, the deployment path of finally formed service function link are the service function in the b figure in Fig. 4
Energy forward-path 1 (AFGEDH), the reliability of the deployment scheme are 0.94, and resource overhead is 202.
It can thus be seen that carrying out virtual network function using the current source point of the maximum vertex update of reliability value in vertex
Deployment, to user come for, network is more smooth, have better user experience, for network operator TSPs, will
It can more costly CAPEX (fund expenditure) and OPEX (operational overhead).
It is this using the current source point of the smallest vertex update of load factor in the purpose vertex on all out-degree sides of current source point
Mode is to be re-introduced into load factor under the premise of meeting user and it is expected the reliability value reached, and load factor minimum can make often
The load on a vertex is more balanced, can suitably reduce network reliability of service under the premise of guaranteeing user dependability demand,
Bottom-layer network load can be made lighter, bottom-layer network will handle more requests, will will be greatly reduced network operator in this way
The CAPEX (fund expenditure) and OPEX (operational overhead) of TSPs, to improve resource utilization.
In step 206, when vertex set to be updated is nonvoid set, continue all out-degree sides for traversing current source point,
Until vertex set to be updated is empty set, obtain later each vertex in vertex set (other than the source point of service function chain,
His each vertex is the purpose vertex on an out-degree side, for details, reference can be made in Fig. 4 b figure) arrive service function chain source point
Reliability value.
At step 104, the non-purpose vertex in vertex set is traversed, when non-purpose vertex meets default constraint, then
Its vertex is updated using the reliability value of the source point on vertex to service function chain and presets reliability value.
Each vertex in this programme can have a vertex to preset reliability value, and reliability is preset on the vertex on each vertex
Value may have differences, and this programme, when disposing to each virtual network function, it is equal that reliability value is preset on vertex
It can initialize.
When implementation, the preferably default calculating capacity for being constrained to non-purpose vertex of this programme is greater than or equal to network virtual function
Required calculating capacity, and the reliability value of source point of the non-purpose vertex to service function chain is greater than its vertex and presets reliability
Value.
In step 105, when non-purpose vertex all in vertex set have traversed, then all non-purpose vertex are chosen
In maximum vertex preset the corresponding non-purpose vertex of reliability value and dispose current virtual network function, and delete in vertex set
Maximum vertex preset the corresponding non-purpose vertex of reliability value.
In step 106, when current virtual network function is the last one virtual network function in service function chain,
Calculate current vertex in vertex set to purpose vertex reliability value and the source point of current vertex to service function chain it is reliable
First calculated value of the product of property value as current vertex.
The reliability value on current vertex to purpose vertex is current vertex between purpose vertex in vertex set herein
The product of the attribute reliability value on all vertex on all out-degree sides and chain road of chain road.
In step 107, all vertex in vertex set are traversed, when vertex, which meets, to impose a condition, then using current
The ratio of the attribute reliability value of first calculated value and current vertex on vertex updates the given threshold of current vertex.
The set-up mode that given threshold herein presets reliability value with the vertex mentioned in step 104 is substantially the same, i.e.,
Each vertex in this programme can have a given threshold, and the vertex threshold value on each vertex may have differences, and
When disposing to each virtual network function, vertex threshold value can initialize this programme；But given threshold with
Identical parameter can be set into the initial value that reliability value is preset on vertex.
When implementation, this programme preferably sets the calculating capacity that condition is vertex and is greater than or equal to needed for network virtual function
Capacity is calculated, and the ratio of the attribute reliability value on the first calculated value and vertex is greater than or equal to given threshold.
In step 108, when vertex all in vertex set have traversed, then maximum setting in all vertex is chosen
The last one virtual network function is disposed on vertex corresponding to threshold value, and exporting includes the vertex for disposing all virtual network functions
Collection, the set of paths of virtual link deployment, on path forward node deployment scheme.
It is disposed using in this programme step 101 to the network that step 108 carries out, has comprehensively considered network reliability of service
And the CAPEX (fund expenditure) and OPEX (operational overhead) of network operator TSPs, but in the deployment scheme formed, some are empty
Quasi- chain road is there are some forward node, and the presence of forward node also will affect the CAPEX of network operator TSPs, and (fund is opened
Pin) and OPEX (operational overhead).
In order to further decrease the CAPEX (fund expenditure) and OPEX (operational overhead) of network operator TSPs, when implementation,
The virtual network function dispositions method of this programme preferred service function chain further includes the deployment formed to step 101 to step 108
Scheme optimizes, and specific optimization method 300 includes:
In step 301, the smallest link of bandwidth in service function chain is obtained in deployment scheme, and computation bandwidth is the smallest
The number of links that link includes in total to purpose vertex；
In step 302, when number of links is greater than zero, the purpose virtual network function of the smallest link of bandwidth is obtained extremely
All virtual network function composition function set between the purpose vertex of service function chain；
In step 303, judge between the purpose vertex of service function chain and the last one virtual network function and function
It whether there is forward node between two neighboring virtual network function in capable of gathering；
In step 304, and if it exists, then when the available computational resources of forward node are greater than or equal to adjacent service function chain
Purpose vertex virtual network function required computing resource, and the virtual net on the purpose vertex of adjacent service function chain
After network function is mobile, the residue of the position disposed to all links between a virtual network function deployed position thereon
Bandwidth resources are greater than or the virtual network function and a virtual network thereon on the purpose vertex equal to adjacent service function chain
When the bandwidth demand of the virtual link between function, the virtual network function on the purpose vertex of adjacent service function chain is deployed in
On the forward node on the purpose vertex of adjacent service function chain, and number of links is reduced one.
It in step 305, include the top for disposing all virtual network functions after output optimization when number of links is equal to zero
Point set, the set of paths of virtual link deployment, on path forward node deployment scheme.
Method is optimized to deployment scheme and is described in detail in conjunction with specific example below with reference to Fig. 4:
As shown in a figure in Fig. 4, it is assumed that the virtual chain that the bandwidth on the virtual link of VNF1 to VNF2 is 5, VNF2 to VNF3
The bandwidth of road is that the bandwidth on the virtual link of 15, VNF3 to purpose vertex t is 20, using the portion of step 101 to step 108
The deployment scheme that arranging method is formed is the service function forward-path 1 (AFGEDH) of b figure in Fig. 4, and VNF1 is deployed on node F,
VNF2 is deployed on node G, and VNF3 is deployed on node E.
By the bandwidth on virtual link it can be concluded that the bandwidth on the virtual link of VNF1 to VNF2 is minimum, bandwidth is the smallest
Link to purpose vertex includes that virtual link then has VNF1 to VNF2, VNF2 to VNF3, VNF3 to purpose vertex t, link in total
Number position 3.
The purpose virtual network function of the smallest link of bandwidth is to all virtual nets between the purpose vertex of service function chain
Network function composition function consolidation function set has VNF2 and VNF3.Found by the way of step 303 VNF3 to purpose vertex t it
Between there are a forward node D, need whether the available computational resources for judging forward node D are greater than or equal to needed for VNF3 at this time
The computing resource wanted, and after VNF3 is mobile, the position D disposed to virtual network function VNF2 deployed position thereon it
Between the remaining bandwidth resources of all links (GED) whether to be greater than or equal to VNF3 and the virtual link of a VNF2 thereon
VNF3 is then deployed on node D, and subtract one for number of links by bandwidth demand if two conditions above are all satisfied.
For whether there is forward node between virtual network function two neighboring in function set using above-mentioned identical
Mode carries out virtual network function and redeploys, and after can also first deploying the last one virtual network function, is disposing other
Virtual network function.
Assuming that all forward node all meet two conditions in 304, then excellent to step 305 eventually by step 301
Deployment scheme after change are as follows: VNF1 is deployed on node F, and VNF2 is deployed on node E, and VNF3 is deployed on node D.
After optimizing in this way to deployment scheme, which can save 15 bandwidth, considerably reduce
The CAPEX (fund expenditure) and OPEX (operational overhead) of network operator TSPs.
The certain applications scene and effect of the virtual network function dispositions method for the service function chain that this programme is related to below
Fruit is illustrated:
The dispositions method of this programme design can be deployed in SDN network, to realize the reliability portion of network service request
Administration, and the resources costs of network operator are saved, it separates control function from the network switching equipment, moves it into and patrols
Collect upper independent control environment --- among network control system, wherein SDN network is based on OpenFlow agreement transmitting message.It should
Network control system can be run on general server, any user can at any time, directly carry out control function programming.Therefore,
Control function was both no longer limited in router, and the production firm for being also no longer limited to only equipment can program and define.
After the dispositions method that this programme designs is deployed in SDN network, SDN helps to realize the virtualization of network, from
And the calculating of network and the integration of storage resource are realized, as long as finally making through some simple software tool combinations,
It is able to achieve the control and management to whole network.This is one of numerous advantages of SDN network, and determines to be realized with it more
The key factor that virtual machine migrates between multiple data centers.
The virtual network function dispositions method that this programme provides can also be deployed in the control routing of SDN by network operator
On control layer in device, SDN control router can dispatch the control management function itself having and collect entire bottom-layer network
Information, obtain network in all nodes and link circuit resource the case where and node between connection topology situation, pass through this
The control mode of the kind centralization router can obtain the support topology and corresponding resource information of the whole network.
When having multiple network service requests from the user when the identical or different time arrives, SDN controller can root
According to the whole network information that oneself is grasped, resource of the scheduling deployment on the controller Deployment Algorithm that effectively reliability perceives, meter
Deployment time required for disposing is calculated, the response time of service request in a network, resource of the service request in the whole network makes
With situation, the key parameters such as the receptance of service request, and feed back to network operator.
In conclusion the virtual network function dispositions method for the service function chain that this programme provides has deployment blocking rate
It is low, resource utilization is high, deployment is high-efficient, the advantages that time evening and the application scenarios that block are wide occurs.
Claims (9)
1. a kind of virtual network function dispositions method of service function chain characterized by comprising
Obtain the topological diagram of service function chain and bottom-layer network；
The source point of service function chain and purpose vertex are deployed in the respective nodes of bottom-layer network, and successively choose service function
The virtual network function that do not disposed in chain；
When current virtual network function is not the last one virtual network function in service function chain, calculate in vertex set
Each vertex to service function chain source point reliability value；
The non-purpose vertex in vertex set is traversed, when non-purpose vertex meets default constraint, then using vertex to service function
The reliability value of the source point of energy chain updates its vertex and presets reliability value；
When non-purpose vertex all in vertex set have traversed, then it is default to choose maximum vertex in all non-purpose vertex
Current virtual network function is disposed on the corresponding non-purpose vertex of reliability value, and it is default to delete the maximum vertex in vertex set
The corresponding non-purpose vertex of reliability value；
When current virtual network function be service function chain in the last one virtual network function when, calculate vertex set in when
Preceding vertex is used as and works as to the reliability value on purpose vertex and the product of the reliability value of the source point of current vertex to service function chain
First calculated value on preceding vertex；
All vertex in vertex set are traversed, when vertex, which meets, to impose a condition, then use the first calculated value of current vertex
The given threshold of current vertex is updated with the ratio of the attribute reliability value of current vertex；
When vertex all in vertex set have traversed, then vertex corresponding to maximum given threshold in all vertex is chosen
The last one virtual network function is disposed, and exporting includes the vertex set for disposing all virtual network functions, virtual link deployment
Set of paths, on path forward node deployment scheme.
2. the virtual network function dispositions method of service function chain according to claim 1, which is characterized in that described default
The calculating capacity on non-purpose vertex is constrained to more than or equal to calculating capacity needed for network virtual function, and non-purpose vertex is arrived
The reliability value of the source point of service function chain is greater than its vertex and presets reliability value.
3. the virtual network function dispositions method of service function chain according to claim 1, which is characterized in that the setting
Condition is the calculatings capacity on vertex more than or equal to calculating capacity needed for network virtual function, and the first calculated value and vertex
The ratio of attribute reliability value is greater than or equal to given threshold.
4. the virtual network function dispositions method of service function chain according to claim 1, which is characterized in that the calculating
The calculation method of reliability value of source point of each vertex to service function chain includes: in vertex set
Vertex set and current source point are obtained, and vertex set to be updated is made to be equal to vertex set；
Whether all out-degree sides for traversing current source point judge purpose vertex of the current out-degree in remaining bandwidth resource and out-degree
It is all satisfied the first default constraint condition；
If satisfied, calculating current source point to the reliability value of source point of service function chain, the reliability value on current out-degree side and going out
The product of the attribute reliability value three on the purpose vertex on side is spent as the second calculated value；
When second calculated value is simultaneously greater than the reliability value of source point of the purpose vertex on current out-degree side to service function chain
When it is expected the reliability value reached with user, the purpose vertex on current out-degree side is updated to service function chain using the second calculated value
Source point reliability value；
When all out-degree sides of current source point have traversed completion, is met in the purpose vertex using all out-degree sides of current source point
The current source point of vertex update of two default constraint conditions, and delete the current source point in vertex set to be updated；
When vertex set to be updated is nonvoid set, continue all out-degree sides for traversing current source point, until vertex set to be updated
Be combined into empty set, obtain later each vertex in vertex set to service function chain source point reliability value.
5. the virtual network function dispositions method of service function chain according to claim 4, which is characterized in that described first
Virtual link institute of the default constraint condition for current out-degree when remaining bandwidth resource, which is greater than or equal to, to be deployed in the out-degree
The purpose vertex on the out-degree side of the bandwidth resources and current source point that need belongs to vertex set to be updated.
6. the virtual network function dispositions method of service function chain according to claim 4, which is characterized in that described second
Default constraint condition is that reliability value is maximum.
7. the virtual network function dispositions method of service function chain according to claim 4, which is characterized in that described second
Default constraint condition is that load factor is minimum.
8. the virtual network function dispositions method of service function chain according to claim 7, which is characterized in that the load
The calculation formula of the factor are as follows:
Wherein, δ is load factor；For vertex viRemaining computing resource capacity；For vertex viOut-degree side；For vertex
viOut-degree line set；For vertex viAn out-degree side remaining bandwidth resource；For vertex viOnto the path of source point
All bandwidth resources expenses；VPFor the vertex set in bottom-layer network.
9. the virtual network function dispositions method of service function chain according to claim 1, which is characterized in that further include excellent
Change the deployment scheme:
The smallest link of bandwidth in service function chain in acquisition deployment scheme, and the smallest link of computation bandwidth is total to purpose vertex
The number of links for including altogether；
When number of links is greater than zero, the purpose virtual network function of the smallest link of bandwidth is obtained to the purpose of service function chain
All virtual network function composition function set between vertex；
Judge between the purpose vertex of service function chain and the last one virtual network function and in function set it is two neighboring
It whether there is forward node between virtual network function；
If it exists, then when the available computational resources of forward node are greater than or equal to the virtual of the purpose vertex of adjacent service function chain
The required computing resource of network function, and after the virtual network function movement on the purpose vertex of adjacent service function chain,
The remaining bandwidth resource of the position disposed to all links between a virtual network function deployed position thereon is greater than
Or it is equal to the virtual network function on the purpose vertex of adjacent service function chain and virtual between a virtual network function thereon
When the bandwidth demand of link, the virtual network function on the purpose vertex of adjacent service function chain is deployed in adjacent service function chain
Purpose vertex forward node on, and by number of links reduce one；
It include the vertex set for disposing all virtual network functions, virtual link portion after output optimization when number of links is equal to zero
The deployment scheme of forward node in the set of paths of administration, path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711153260.2A CN107666412B (en) | 2017-11-20 | 2017-11-20 | The virtual network function dispositions method of service function chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711153260.2A CN107666412B (en) | 2017-11-20 | 2017-11-20 | The virtual network function dispositions method of service function chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107666412A CN107666412A (en) | 2018-02-06 |
| CN107666412B true CN107666412B (en) | 2019-07-02 |
Family
ID=61144348
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711153260.2A Expired - Fee Related CN107666412B (en) | 2017-11-20 | 2017-11-20 | The virtual network function dispositions method of service function chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107666412B (en) |
Families Citing this family (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108400940B (en) * | 2018-02-27 | 2019-11-05 | 西南交通大学 | A kind of multicast virtual network function dispositions method based on Estimation of Distribution Algorithm |
| CN108684046B (en) * | 2018-04-23 | 2021-07-06 | 重庆邮电大学 | Random learning-based access network service function chain deployment method |
| CN108616425B (en) * | 2018-04-28 | 2021-06-01 | 电子科技大学 | Method for relieving cascade failure risk of service function chain |
| CN108737261B (en) * | 2018-05-10 | 2020-03-17 | 电子科技大学 | Two-stage virtual network function forwarding graph design method |
| CN108494685B (en) * | 2018-06-05 | 2020-07-31 | 中国人民解放军国防科技大学 | Optimal embedding method of service chain in multicast routing |
| CN108880895B (en) * | 2018-06-28 | 2021-04-23 | 重庆邮电大学 | SDN joint routing selection and network function deployment method based on user flow transmission overhead optimization |
| CN109379230B (en) * | 2018-11-08 | 2020-05-22 | 电子科技大学 | Service function chain deployment method based on breadth-first search |
| CN109831346B (en) * | 2019-03-29 | 2020-04-07 | 电子科技大学 | Method for deploying service function chain in network function virtualization environment |
| CN110311862B (en) * | 2019-06-14 | 2020-09-25 | 北京邮电大学 | Service chain mapping method and device |
| CN110311816B (en) * | 2019-06-28 | 2021-08-13 | 上海交通大学 | VNF (virtual network function) placement method for VNF co-location interference sensing in NFV (network virtual function) environment |
| CN111193604B (en) * | 2019-08-23 | 2021-08-17 | 腾讯科技（深圳）有限公司 | Deployment method, device, equipment and storage medium of virtual network function chain |
| CN111147307B (en) * | 2019-12-30 | 2022-04-29 | 重庆邮电大学 | Service function chain reliable deployment method based on deep reinforcement learning |
| CN112087329B (en) * | 2020-08-27 | 2022-06-07 | 重庆大学 | Network service function chain deployment method |
| CN113395334B (en) * | 2021-05-31 | 2022-12-13 | 河南信大网御科技有限公司 | Service function chain online updating method, system and equipment |
| CN113923129B (en) * | 2021-09-08 | 2023-08-29 | 中国人民解放军战略支援部队信息工程大学 | VNF demand prediction method and system based on data driving |
| CN114944985B (en) * | 2022-05-11 | 2023-11-24 | 重庆大学 | Reliability-oriented service function chain backup method in resource heterogeneous environment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104579732A (en) * | 2013-10-21 | 2015-04-29 | 华为技术有限公司 | Method, device and system for managing virtualized network function network elements |
| CN105141617A (en) * | 2015-09-14 | 2015-12-09 | 上海华为技术有限公司 | Deploying and adjusting method for service functions among data centers and deploying and adjusting device for service functions among data centers |
| WO2016186605A1 (en) * | 2015-05-15 | 2016-11-24 | Hewlett Packard Enterprise Development Lp | Composition constraints for network policies |
| CN106411678A (en) * | 2016-09-08 | 2017-02-15 | 清华大学 | Bandwidth guarantee type virtual network function (VNF) deployment method |
| CN106452930A (en) * | 2016-12-16 | 2017-02-22 | 北京邮电大学 | Detection-based fault diagnosis method and system of service function chain |
-
2017
- 2017-11-20 CN CN201711153260.2A patent/CN107666412B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104579732A (en) * | 2013-10-21 | 2015-04-29 | 华为技术有限公司 | Method, device and system for managing virtualized network function network elements |
| WO2016186605A1 (en) * | 2015-05-15 | 2016-11-24 | Hewlett Packard Enterprise Development Lp | Composition constraints for network policies |
| CN105141617A (en) * | 2015-09-14 | 2015-12-09 | 上海华为技术有限公司 | Deploying and adjusting method for service functions among data centers and deploying and adjusting device for service functions among data centers |
| CN106411678A (en) * | 2016-09-08 | 2017-02-15 | 清华大学 | Bandwidth guarantee type virtual network function (VNF) deployment method |
| CN106452930A (en) * | 2016-12-16 | 2017-02-22 | 北京邮电大学 | Detection-based fault diagnosis method and system of service function chain |
Non-Patent Citations (1)
| Title |
|---|
| NFV业务链资源分配技术;唐宏，罗雨佳;《运营技术广角》;20141231;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107666412A (en) | 2018-02-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107666412B (en) | The virtual network function dispositions method of service function chain | |
| Laghrissi et al. | A survey on the placement of virtual resources and virtual network functions | |
| CN104363159B (en) | A kind of opening virtual network constructing system and method based on software defined network | |
| CN104410672B (en) | Method, the method and device of forwarding service of network function virtualization applications upgrading | |
| CN103475722B (en) | A kind of business cooperation platform realizes system | |
| CN103888360B (en) | Method for integrating covering method to obtain service node in SDN based on greedy algorithm | |
| CN109743893A (en) | Method and apparatus for network slice | |
| CN110213369A (en) | A kind of service function chain autopatch system and its method of combination | |
| CN112738820A (en) | Dynamic deployment method and device of service function chain and computer equipment | |
| CN110087250B (en) | Network slice arranging scheme and method based on multi-objective joint optimization model | |
| CN106533966B (en) | A kind of the resource method of combination and device of network service | |
| WO2019218812A1 (en) | Physical optical network virtualization mapping method and apparatus, and controller and storage medium | |
| Wang et al. | Reliability-oriented and resource-efficient service function chain construction and backup | |
| CN106817306B (en) | Method and device for determining target route | |
| JP5869041B2 (en) | Method for mapping network topology request to physical network, computer program product, mobile communication system, and network configuration platform | |
| CN105407080B (en) | A kind of method and device for formulating deploying virtual machine strategy | |
| CN108964949A (en) | Virtual machine migration method, SDN controller and computer readable storage medium | |
| CN109412963A (en) | A kind of service function chain dispositions method split based on stream | |
| CN105872053A (en) | Data migration method and system | |
| CN109743259A (en) | A kind of traffic scheduling method and device of network | |
| CN102882979B (en) | Data acquisition based on cloud computing system and the system and method collecting shunting | |
| CN109743202A (en) | Management method, device, equipment and the readable storage medium storing program for executing of data | |
| CN113490279B (en) | Network slice configuration method and device | |
| Nguyen et al. | Efficient virtual network embedding with node ranking and intelligent link mapping | |
| Gharbaoui et al. | An experimental study on latency-aware and self-adaptive service chaining orchestration in distributed NFV and SDN infrastructures |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190702 Termination date: 20201120 |