CN108200202B - A kind of service function chain security deployment method calculating network applied to cloud and mist - Google Patents
A kind of service function chain security deployment method calculating network applied to cloud and mist Download PDFInfo
- Publication number
- CN108200202B CN108200202B CN201810118870.7A CN201810118870A CN108200202B CN 108200202 B CN108200202 B CN 108200202B CN 201810118870 A CN201810118870 A CN 201810118870A CN 108200202 B CN108200202 B CN 108200202B
- Authority
- CN
- China
- Prior art keywords
- sfc
- deployment
- physical
- indicate
- tcost
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/51—Discovery or management thereof, e.g. service location protocol [SLP] or web services
-
- 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/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
Abstract
The invention discloses a kind of service function chain security deployment methods that network is calculated applied to cloud and mist, the combination bottom-layer network calculated in known cloud computing and mist and the online service function chain with security requirement dispose request, under the position of user and the position precondition of service terminal, a kind of method for finding out effective deployment services function chain request, in the request of deployment services function chain, consider each virtual network function in each service function chain request, link connection situation and meet under the relevant constraints such as demand for security, to consume least server resource and bandwidth resources, and reducing the blocking rate of service function chain request is target, the request of service function chain is disposed.The present invention has many advantages, such as that applied widely, lower deployment cost is low, mapping blocking rate is small.
Description
Technical field
The invention belongs to network function technical field of virtualization, and in particular to a kind of service that network is calculated applied to cloud and mist
The design of function chain security deployment method.
Background technique
Virtualization technology is a kind of cutting edge technology that network flexibility can be improved, with the development of virtualization technology, net
Network virtualization of function (Network Function Virtualization, NFV) technology has been suggested traditional network
Function is transferred to virtual network function (Virtual Network Function, VNF), to improve the flexibility of network.It is more
A virtual network function forms service function chain (Service Function Chain, SFC) in a specific sequence to guarantee to use
The service strategy at family, is then deployed in cloud network and provides service for user.
With increasing for cloud network user, centralized cloud computing is faced with some challenges, as network congestion and network are prolonged
Become increasingly severe late, the safety of service is also challenged.In order to solve these challenges, distributed mist calculating is mentioned
Cloud computing is extended and supplemented out.Based on the wireless access network that mist calculates, i.e. mist wireless access network, it has also become wireless access network
One new research direction.In mist wireless access network, there are some nodes with mist computing capability, the node phase with cloud computing
Seemingly, these mist nodes can provide service for user, but the Service Source capacity of mist node is usually less than the service money of cloud node
Source capacity.Similar to cloud node, these mist nodes can be virtualized, to improve the flexibility of wireless access network.Joint
Network congestion and network delay can be reduced using cloud computing and mist calculating, and safer service is provided for mobile subscriber.
The hot spot that service function chain is current research is disposed in cloud computing, there are many researchs.For example, there is research
Person has studied the deployment issue of traffic aware and energy efficient service function chain, proposes a kind of heuritic approach to dispose clothes
Business function chain reduces total lower deployment cost to cloud computing environment.This algorithm can reduce total lower deployment cost, but author does not have
There is research mist to calculate.Cloud computing and mist calculating, which is used in combination, can reduce network congestion and network delay, and mention for mobile subscriber
For safer service.There is researcher to carry out the SDN/NFV deployment experiment for calculating 5G service based on cloud and mist, the portion Lai Youhua VNF
It affixes one's name to while meeting constraint (such as delay).
With the increase that service function chain is requested, how to guarantee that the safety of service becomes a huge challenge.In order to
The safety for guaranteeing service when servicing under attack has had research of the part about NFV safety, such as SAMA algorithm, master
Wanting thought is that the deployment of service function chain is carried out based on traffic aware and energy efficient method, to minimize total be deployed to
This, while meeting the size constraint of network node.Although this method can be realized the deployment of virtual network function, it does not have
The safety issue for considering service function chain does not account for characteristic and related constraint that mist calculates network yet, cannot utilize mist meter
The advantage of calculation.
For the deployment issue of virtual network function, related researcher also proposed PATH-EXTENSION, main
Thought considers shared and reuses existing virtual network function, to reduce the consumption of Internet resources.Although this method can
It realizes the placement of virtual network function, and considers shared and reuse existing virtual network function, but it is also without examining
Consider characteristic and related constraint that mist calculates network, the advantage that cannot be calculated using mist, and do not account for entire service function chain
Safety issue.
Summary of the invention
The purpose of the invention is to the link companies of each virtual network function in considering entire service function chain request
It connects situation and meets under the relevant constraints such as demand for security, cloud and mist is calculated to the node resource and bandwidth resources point of bottom-layer network
The each service function chain request of dispensing, so that in the resource benefit for being deployed to power and bottom-layer network for improving the request of service function chain
Total mapping cost is minimum while with rate, proposes a kind of service function chain Ministry of State Security management side that network is calculated applied to cloud and mist
Method.
The technical solution of the present invention is as follows: a kind of service function chain security deployment method for calculating network applied to cloud and mist, packet
Include following steps:
S1, the initial SFC of building dispose request queue ArrivalSFC, and expired SFC is arrived in wherein expired SFC request storage
In request set FinishedSFC, and initial total lower deployment cost TCost=0 is set, is initially blocked SFC deployment request set
SFCbloFor sky.
S2, judge whether ArrivalSFC is sky, if then entering step S9, otherwise enter step S3.
S3, the resource that expired SFC request occupies is discharged according to set FinishedSFC.
S4, first in ArrivalSFC is disposed using MSSFCD algorithm, MCSGSFCD algorithm or MCSGFCDFA algorithm
SFC deployment request SFC1, and obtain SFC1Deployment scheme set DS lower deployment cost TCost (DS).
S5, judge whether set DS is sky, if then entering step S7, otherwise enter step S6.
S6, total lower deployment cost TCost and physical network are updated according to TCost (DS), enters step S8.
S7, by SFC1It is added to SFCblo。
S8, by SFC1It is removed from ArrivalSFC, return step S2.
S9, output TCost and SFCblo。
The beneficial effects of the present invention are:
(1) applied widely: traditional virtual network function or service function chain Deployment Algorithm is for virtual net mostly
What network and data center network proposed, or do not account for calculating the deployment services function chain in network in cloud and mist.Energy of the present invention
The service function chain request network is calculated suitable for cloud and mist, therefore compared with traditional Deployment Algorithm, applicable model of the invention
It encloses wider.
(2) lower deployment cost is low: due to the invention proposes MSSFCD algorithm/MCSGSFCD algorithm/MCSGFCDFA algorithm,
It is requested using the advantage deployment services function chain of cloud and mist calculations incorporated, the cost of the deployment scheme found in this way is also just lower.
(3) mapping blocking rate is small: the safety due to considering deployment scheme in the present invention is meeting service function chain
Under the constraint of demand for security, the consumption of Internet resources can be effectively reduced, so a possibility that mapping successfully is also bigger, resistance
Plug rate is also just smaller.
Detailed description of the invention
Fig. 1 show a kind of service function chain security deployment that network is calculated applied to cloud and mist provided in an embodiment of the present invention
Method flow diagram.
Fig. 2 show MSSFCD algorithm flow chart provided in an embodiment of the present invention.
Fig. 3 show MCSGSFCD algorithm flow chart provided in an embodiment of the present invention.
Fig. 4 show MCSGFCDFA algorithm flow chart provided in an embodiment of the present invention.
Specific embodiment
Carry out detailed description of the present invention illustrative embodiments with reference to the drawings.It should be appreciated that shown in attached drawing and
The embodiment of description is only exemplary, it is intended that is illustrated the principle and spirit of the invention, and is not limited model of the invention
It encloses.
The embodiment of the invention provides a kind of service function chain security deployment methods that network is calculated applied to cloud and mist, such as scheme
Shown in 1, include the following steps S1-S9:
S1, the initial SFC of building dispose request queue ArrivalSFC, and expired SFC is arrived in wherein expired SFC request storage
In request set FinishedSFC, and initial total lower deployment cost TCost=0 is set, is initially blocked SFC deployment request set
SFCbloFor sky.
S2, judge whether ArrivalSFC is sky, if then entering step S9, otherwise enter step S3.
S3, the resource that expired SFC request occupies is discharged according to set FinishedSFC.
S4, first in ArrivalSFC is disposed using MSSFCD algorithm, MCSGSFCD algorithm or MCSGFCDFA algorithm
SFC deployment request SFC1, and obtain SFC1Deployment scheme set DS lower deployment cost TCost (DS).
S5, judge whether set DS is sky, if then entering step S7, otherwise enter step S6.
S6, total lower deployment cost TCost and physical network are updated according to TCost (DS), enters step S8.
Wherein, the formula of total lower deployment cost TCost is updated are as follows:
TCost=TCostb+TCost(DS) (16)
Wherein TCost indicates updated total lower deployment cost, TCostbIndicate total lower deployment cost before updating.
S7, by SFC1It is added to SFCblo。
S8, by SFC1It is removed from ArrivalSFC, return step S2.
S9, output TCost and SFCblo。
In the embodiment of the present invention, MSSFCD algorithm is the maximized Deployment Algorithm of safety, is used to mention to the maximum extent
The safety of high service function chain deployment scheme.In MSSFCD algorithm, virtual network is disposed using maximizing safety strategy
Function finds safest path to safest physical node, to improve service function chain deployment scheme to greatest extent
Safety, finally obtain safest deployment scheme.As each virtual network function vf of deploymentiTo physical node nj, and find
Safest path pemWhen, it can find from current physical node njTo the safest path p of useri+1(nj,LU), Optimization Dept.
The solution of administration, blocking rate and safety so as to improve final deployment scheme.If the service function that MSSFCD algorithm solves
The safety of energy chain deployment scheme is not able to satisfy the demand for security of service function chain deployment request, the deployment request of this service function chain
It will be rejected.
As shown in Fig. 2, MSSFCD algorithm the following steps are included:
S4-1-1, traversal NFEach of virtual network function vfi, i=1,2 ..., | NF |；NFIt disposes and requests for SFC
Virtual network function set, | NF | be NFThe quantity of middle virtual network function.
S4-1-2, judge NFIn virtual network function whether be traversed, if then entering step S4-1-17, otherwise
Enter step S4-1-3.
Each physical node n in S4-1-3, traversal physical networkj∈NP, NPFor the physical node collection in physical network
It closes；J=1,2 ..., | NP |, | NP | for the quantity of physical node in physical network.
S4-1-4, judge whether the physical node in physical network has been traversed, it is no if then entering step S4-1-10
Then enter step S4-1-5.
S4-1-5, judge physical node njWhether virtual network function vf is metiPosition constraint, if then entering step
S4-1-6, otherwise return step S4-1-3.
S4-1-6, by vfiIt is deployed to physical node njOn, and calculate vfiDeployment scheme safety VNFSecurity
(vfi→nj) and lower deployment cost VNFCost (vfi→nj)。
VNFSecurity(vfi→nj) calculation formula are as follows:
VNFSecurity(vfi→nj)=s (nj) (1)
Wherein s (nj) indicate physical node njSafety coefficient.
VNFCost(vfi→nj) calculation formula are as follows:
VNFCost(vfi→nj)=p (nj)ε(vfi) (2)
Wherein p (nj) indicate physical node njUnit cost, ε (vfi) indicate virtual network function vfiNode resource
Demand.
S4-1-7, SFC link e is searchedmWater channel principium pemAnd from njL is constrained to user's deployed positionUMost peace
Complete trails pi+1(nj,LU)；M=1,2 ..., | EF |, | EF | it is SFC number of links.
S4-1-8, path p is calculatedemSafety PathSecurity (pem), path pemLower deployment cost PathCost
(pem) and path pi+1(nj,LU) safety PathSecurity (pi+1(nj,LU))。
PathSecurity(pem) calculation formula are as follows:
Wherein s (lk) indicate physical link lkSafety coefficient；K=1,2 ..., | EP |, | EP | for physics in physical network
The quantity of link.
PathCost(pem) calculation formula are as follows:
Wherein p (lk) indicate physical link lkUnit cost, ε (em) indicate SFC link emBandwidth resources demand.
PathSecurity(pi+1(nj,LU)) calculation formula are as follows:
S4-1-9, according to VNFSecurity (vfi→nj)、VNFCost(vfi→nj)、PathSecurity(pem)、
PathCost(pem) and PathSecurity (pi+1(nj,LU)) calculate virtual network function vfiIt is deployed to physical node nj's
Overall security TSecurity (vfi→nj) and lower deployment cost TCost (vfi→nj), return step S4-1-3.
TSecurity(vfi→nj) calculation formula are as follows:
TCost(vfi→nj) calculation formula are as follows:
S4-1-10, judge whether that overall security TSecurity (vf can be foundi→nj) maximum deployment scheme, if
It is to enter step S4-1-12, otherwise enters step S4-1-11.
S4-1-11, SFC is emptied1Deployment scheme set DS, enter step S4-1-16.
S4-1-12, by virtual network function vfiWith SFC link emDeployment scheme be stored into SFC1Deployment scheme set
In DS, S4-1-13 is entered step.
S4-1-13, the overall security TSecurity (DS) ' for calculating DS, calculation formula are as follows:
Wherein VNFSecurity (DS (vfa)) indicate a-th of virtual network function vf of trustshipaPhysical node DS (vfa)
Safety, a=1,2 ..., i；PathSecurity(DS(em)) indicate trustship SFC link emPhysical link DS (em) peace
Quan Xing, s (DS (vfa)) indicate physical node DS (vfa) safety coefficient.
S4-1-14, judge whether otherwise meet TSecurity (DS) ' < SR returns if then entering step S4-1-15
Step S4-1-1.
S4-1-15, SFC is emptied1Deployment scheme set DS, enter step S4-1-16.
S4-1-16, output DS are sky, and enable TCost (DS)=0, enter step S5.
S4-1-17, SFC link e is calculated according to formula (3)|ES|All mapping paths safety, from all mapping roads
The highest path p of safety is searched in diametere|ES|, it is stored in DS, and calculate lower deployment cost TCost (DS), calculation formula
Are as follows:
Wherein VNFCost (DS (vfi)) indicate i-th of virtual network function vf of trustshipiPhysical node DS (vfi) portion
Affix one's name to cost, PathCost (DS (em)) indicate trustship SFC link emPhysical link DS (em) lower deployment cost, p (DS (vfi))
Indicate physical node DS (vfi) unit cost.
S4-1-18, output DS and TCost (DS), enter step S5.
Since higher security deployment scheme will lead to higher total lower deployment cost, in order to meet the deployment of service function chain
Total lower deployment cost is reduced while the security requirement of request, the embodiment of the present invention also proposed cost minimization and safety is protected
The Deployment Algorithm MCSGSFCD of barrier.In MCSGSFCD algorithm, use cost minimization and security strategies as boot policy
Deployment while meeting the demand for security of deployment scheme of service function chain deployment request, subtracts to dispose virtual network function
Total lower deployment cost of the deployment scheme of few service function chain deployment request.In MCSGSFCD algorithm, it is similar to MSSFCD algorithm,
It will find from current physical node njTo the safest path p of useri+1(nj,LU) reduce total lower deployment cost.
As shown in figure 3, MCSGSFCD algorithm the following steps are included:
S4-2-1, traversal NFEach of virtual network function vfi, i=1,2 ..., | NF |；NFIt disposes and requests for SFC
Virtual network function set, | NF | be NFThe quantity of middle virtual network function.
S4-2-2, judge NFIn virtual network function whether be traversed, if then entering step S4-2-14, otherwise
Enter step S4-2-3.
Each physical node n in S4-2-3, traversal physical networkj∈NP, NPFor the physical node collection in physical network
It closes；J=1,2 ..., | NP |, | NP | for the quantity of physical node in physical network.
S4-2-4, judge whether the physical node in physical network has been traversed, it is no if then entering step S4-2-10
Then enter step S4-2-5.
S4-2-5, judge physical node njWhether virtual network function vf is metiPosition constraint, if then entering step
S4-2-6, otherwise return step S4-2-3.
S4-2-6, by vfiIt is deployed to physical node njOn, and calculate vfiDeployment scheme lower deployment cost VNFCost
(vfi→nj)。
VNFCost(vfi→nj) calculation formula are as follows:
VNFCost(vfi→nj)=p (nj)ε(vfi) (2)
Wherein p (nj) indicate physical node njUnit cost, ε (vfi) indicate virtual network function vfiNode resource
Demand；
S4-2-7, SFC link e is searchedmWater channel principium pemAnd from njL is constrained to user's deployed positionUMost peace
Complete trails pi+1(nj,LU)；M=1,2 ..., | EF |, | EF | it is SFC number of links.
S4-2-8, path p is calculatedemSafety PathSecurity (pem), path pemLower deployment cost PathCost
(pem), path pi+1(nj,LU) safety PathSecurity (pi+1(nj,LU)), path pi+1(nj,LU) lower deployment cost
PathCost(pi+1(nj,LU)) and remaining virtual network function pre- deployment scheme maximum security MaxSecurity (pi +1(nj,LU))。
PathSecurity(pem) calculation formula are as follows:
Wherein s (lk) indicate physical link lkSafety coefficient；K=1,2 ..., | EP |, | EP | for physics in physical network
The quantity of link.
PathCost(pem) calculation formula are as follows:
Wherein p (lk) indicate physical link lkUnit cost, ε (em) indicate SFC link emBandwidth resources demand.
PathSecurity(pi+1(nj,LU)) calculation formula are as follows:
Wherein s (lk) indicate physical link lkSafety coefficient；K=1,2 ..., | EP |, | EP | for physics in physical network
The quantity of link.
PathCost(pi+1(nj,LU)) calculation formula are as follows:
Wherein ε (em+1) indicate SFC link em+1Bandwidth resources demand.
MaxSecurity(pi+1(nj,LU)) calculation formula are as follows:
Wherein s (nt) indicate physical node ntSafety coefficient, ntIndicate path pi+1(nj,LU) in physical node.
S4-2-9, according to VNFCost (vfi→nj)、PathCost(pem)、PathSecurity(pi+1(nj,LU))、
PathCost(pi+1(nj,LU)) and MaxSecurity (pi+1(nj,LU)) calculate deployment scheme set DS overall security
TSecurity (DS) " and by virtual network function vfiIt is deployed to physical node njLower deployment cost TCost (vfi→nj) ", it returns
Return step S4-2-3.
The calculation formula of TSecurity (DS) " are as follows:
Wherein VNFSecurity (DS (vfa)) indicate a-th of virtual network function vf of trustshipaPhysical node DS (vfa)
Safety, a=1,2 ..., i；PathSecurity(DS(em)) indicate trustship SFC link emPhysical link DS (em) peace
Quan Xing, s (DS (vfa)) indicate physical node DS (vfa) safety coefficient.
TCost(vfi→nj) " calculation formula are as follows:
S4-2-10, judge whether that lower deployment cost TCost (vf can be foundi→nj) " minimum, and overall security
Otherwise the deployment scheme of TSecurity (DS) " >=SR enters step S4-2-12 if then entering step S4-2-11；SR is indicated
The overall safety demand index of SFC deployment request.
S4-2-11, by virtual network function vfiWith SFC link emDeployment scheme be stored into SFC1Deployment scheme set
In DS, return step S4-2-1.
S4-2-12, SFC is emptied1Deployment scheme set DS, enter step S4-2-13.
S4-2-13, output DS are sky, and enable TCost (DS)=0, enter step S5.
S4-2-14, SFC link e is calculated according to formula (3)|ES|All mapping paths safety, from all mapping roads
The highest path p of safety is searched in diametere|ES|, it is stored in DS, and calculate lower deployment cost TCost (DS), calculation formula
Are as follows:
Wherein VNFCost (DS (vfi)) indicate i-th of virtual network function vf of trustshipiPhysical node DS (vfi) portion
Affix one's name to cost, PathCost (DS (em)) indicate trustship SFC link emPhysical link DS (em) lower deployment cost, p (DS (vfi))
Indicate physical node DS (vfi) unit cost.
S4-2-15, output DS and TCost (DS).
MCSGSFCD algorithm use cost minimizes and security strategies are as the guidance plan for disposing virtual network function
Slightly minimize total lower deployment cost.Although this MCSGSFCD algorithm can reduce total lower deployment cost, use cost is minimum
Change the increase that will lead to blocking rate as boot policy with security strategies.Therefore, it is proposed in the embodiment of the present invention
MCSGFCDFA algorithm reduces blocking rate.In MCSGFCDFA algorithm, a safety is obtained using MSSFCD algorithm first
Then maximized initial deployment scheme attempts the deployment scheme for finding a total lower deployment cost of minimum.If finding such one
A new deployment scheme, and the safety of this new deployment scheme meets the demand for security of service function chain request, and
Total lower deployment cost of this new deployment scheme is more at low cost than the always deployment of initial deployment scheme, then is taken using new deployment scheme
For initial deployment scheme.Feedback adjustment process in this way, can reduce total lower deployment cost and blocking rate.
As shown in figure 4, MCSGFCDFA algorithm the following steps are included:
S4-3-1, SFC is obtained using MSSFCD algorithm1Deployment scheme set DS and its lower deployment cost TCost (DS).
S4-3-2, traversal NFEach of virtual network function vfi, i=1,2 ..., | NF |；NFIt disposes and requests for SFC
Virtual network function set, | NF | be NFThe quantity of middle virtual network function.
S4-3-3, judge NFIn virtual network function whether be traversed, if then entering step S4-3-17, otherwise
Enter step S4-3-4.
Each physical node n in S4-3-4, traversal physical networkj∈NP, NPFor the physical node collection in physical network
It closes；J=1,2 ..., | NP |, | NP | for the quantity of physical node in physical network.
S4-3-5, judge whether the physical node in physical network has been traversed, it is no if then entering step S4-3-11
Then enter step S4-3-6.
S4-3-6, judge physical node njWhether virtual network function vf is metiPosition constraint, if then entering step
S4-3-7, otherwise return step S4-3-4.
S4-3-7, by vfiIt is deployed to physical node njOn, and calculate vfiDeployment scheme lower deployment cost VNFCost
(vfi→nj), calculation formula are as follows:
VNFCost(vfi→nj)=p (nj)ε(vfi) (2)
Wherein p (nj) indicate physical node njUnit cost, ε (vfi) indicate virtual network function vfiNode resource
Demand.
S4-3-8, SFC link e is searchedmWater channel principium pemAnd from njL is constrained to user's deployed positionUMost peace
Complete trails pi+1(nj,LU)；M=1,2 ..., | EF |, | EF | it is SFC number of links.
S4-3-9, path p is calculatedemLower deployment cost PathCost (pem) and path pi+1(nj,LU) lower deployment cost
PathCost(pi+1(nj,LU))。
PathCost(pem) calculation formula are as follows:
Wherein p (lk) indicate physical link lkUnit cost, ε (em) indicate SFC link emBandwidth resources demand.
PathCost(pi+1(nj,LU)) calculation formula are as follows:
Wherein ε (em+1) indicate SFC link em+1Bandwidth resources demand.
S4-3-10, according to VNFCost (vfi→nj)、PathCost(pem) and PathCost (pi+1(nj,LU)) calculate and incite somebody to action
Virtual network function vfiIt is deployed to physical node njLower deployment cost TCost (vfi→nj) ", return step S4-3-4.
TCost(vfi→nj) " calculation formula are as follows:
S4-3-11, judge whether that lower deployment cost TCost (vf can be foundi→nj) " the smallest deployment scheme, if then into
Enter step S4-3-13, otherwise enters step S4-3-12.
S4-3-12, SFC is emptied1Deployment scheme set DS ', enter step S4-3-20.
S4-3-13, by virtual network function vfiWith SFC link emDeployment scheme be stored into SFC1Deployment scheme set
In DS ', S4-3-14 is entered step.
S4-3-14, the overall security TSecurity (DS ') for calculating DS ', calculation formula are as follows:
Wherein VNFSecurity (DS ' (vfa)) indicate a-th of virtual network function vf of trustshipaPhysical node DS '
(vfa) safety, a=1,2 ..., i；PathSecurity(DS'(em)) indicate trustship SFC link emPhysical link DS '
(em) safety, s (DS ' (vfa)) indicate physical node DS ' (vfa) safety coefficient.
S4-3-15, judge whether otherwise meet TSecurity (DS ') < SR returns if then entering step S4-3-16
Step S4-3-2；SR indicates the overall safety demand index of SFC deployment request.
S4-3-16, SFC is emptied1Deployment scheme set DS ', enter step S4-3-20.
S4-3-17, SFC link e is calculated according to formula (4)|ES|All mapping paths lower deployment cost, from all mappings
The smallest path p of lower deployment cost is searched in pathe|ES|, be stored in DS ', and calculate lower deployment cost TCost (DS ') with it is whole
Body safety TSecurity (DS ').
The calculation formula of TCost (DS ') are as follows:
Wherein VNFCost (DS ' (vfi)) indicate i-th of virtual network function vf of trustshipiPhysical node DS ' (vfi)
Lower deployment cost, PathCost (DS ' (em)) indicate trustship SFC link emPhysical link DS (em) lower deployment cost, p (DS '
(vfi)) indicate physical node DS ' (vfi) unit cost.
S4-3-18, judge whether that meeting DS ' not is sky, and TSecurity (DS ')>=SR, and TCost (DS ')<TCost
(DS), if then entering step S4-3-19, S4-3-20 is otherwise entered step.
S4-3-19, DS=DS ', TCost (DS)=TCost (DS ') are enabled.
S4-3-20, output DS and TCost (DS), enter step S5.
The embodiment of the present invention can be deployed in the cloud and mist based on SDN and calculate in network, to realize the deployment of service function chain.
Network --- for traditional network architecture, SDN is a kind of revolutionary change for cloud and mist calculating based on SDN.It will control
Function processed is separated from the network switching equipment, moves it into the control environment being logically independent --- network control system it
In, and SDN network is based on OpenFlow agreement transmitting message.The system can be run on general server, any user
Can at any time, directly carry out control function programming.Therefore, control function is both no longer limited in router, is also no longer limited to only
Having the production firm of equipment can program and define.The essence of SDN is the programmable of Logical central control layer.
SDN helps to realize the virtualization of network, to realize the calculating of network and the integration of storage resource, finally makes
As long as obtaining through some simple software tools combinations, the control and management to whole network can be achieved with.This is based on SDN
Cloud and mist calculates one of numerous advantages of network, and determines to realize calculating in the middle part of network in cloud and mist for service function chain with it
The key factor of administration.
What network operator can be proposed the embodiment of the present invention calculates network deployment services function in the cloud and mist based on SDN
The method of energy chain is deployed on the control layer in the control router of SDN, and SDN control router can dispatch the control itself having
Management function processed collects the whole network information, obtains all node resource situations and the resource of link in network, the information such as time delay.
The topological and corresponding resource information of the whole network can be obtained by the control mode of this centralization router.
When there is the request of service function chain to arrive, SDN controls router and can be adjusted according to the whole network information that oneself is grasped
The dispositions method based on service function chain being deployed on its control layer is spent, the key parameters such as lower deployment cost, reject rate are calculated,
And feed back to operator.
Those of ordinary skill in the art will understand that the embodiments described herein, which is to help reader, understands this hair
Bright principle, it should be understood that protection scope of the present invention is not limited to such specific embodiments and embodiments.This field
Those of ordinary skill disclosed the technical disclosures can make according to the present invention and various not depart from the other each of essence of the invention
The specific variations and combinations of kind, these variations and combinations are still within the scope of the present invention.
Claims (5)
1. a kind of service function chain security deployment method for calculating network applied to cloud and mist, which comprises the following steps:
S1, the initial SFC of building dispose request queue ArrivalSFC, and wherein expired SFC request storage is requested to expired SFC
In set FinishedSFC, and initial total lower deployment cost TCost=0 is set, is initially blocked SFC deployment request set SFCblo
For sky；
S2, judge whether ArrivalSFC is sky, if then entering step S9, otherwise enter step S3；
S3, the resource that expired SFC request occupies is discharged according to set FinishedSFC；
S4, using Deployment Algorithm or the cost minimization of the maximized Deployment Algorithm of safety, cost minimization and safety guarantee
With first SFC deployment request SFC in the low-resistance plug rate Deployment Algorithm deployment ArrivalSFC of safety guarantee1, and obtain SFC1
Deployment scheme set DS lower deployment cost TCost (DS)；
S5, judge whether set DS is sky, if then entering step S7, otherwise enter step S6；
S6, total lower deployment cost TCost and physical network are updated according to TCost (DS), enters step S8；
S7, by SFC1It is added to SFCblo；
S8, by SFC1It is removed from ArrivalSFC, return step S2；
S9, output TCost and SFCblo。
2. service function chain security deployment method according to claim 1, which is characterized in that the safety is maximized
Deployment Algorithm the following steps are included:
S4-1-1, traversal NFEach of virtual network function vfi, i=1,2 ..., | NF |；NFFor the void of SFC deployment request
Quasi- network function set, | NF | it is NFThe quantity of middle virtual network function；
S4-1-2, judge NFIn virtual network function whether be traversed, if then entering step S4-1-17, otherwise enter step
Rapid S4-1-3；
Each physical node n in S4-1-3, traversal physical networkj∈NP, NPFor the physical node set in physical network；J=
1,2 ..., | NP |, | NP | for the quantity of physical node in physical network；
S4-1-4, judge whether the physical node in physical network has been traversed, if then entering step S4-1-10, otherwise into
Enter step S4-1-5；
S4-1-5, judge physical node njWhether virtual network function vf is metiPosition constraint, if then entering step S4-1-
6, otherwise return step S4-1-3；
S4-1-6, by vfiIt is deployed to physical node njOn, and calculate vfiDeployment scheme safety VNFSecurity (vfi→
nj) and lower deployment cost VNFCost (vfi→nj)；
VNFSecurity(vfi→nj) calculation formula are as follows:
VNFSecurity(vfi→nj)=s (nj) (1)
Wherein s (nj) indicate physical node njSafety coefficient；
VNFCost(vfi→nj) calculation formula are as follows:
VNFCost(vfi→nj)=p (nj)ε(vfi) (2)
Wherein p (nj) indicate physical node njUnit cost, ε (vfi) indicate virtual network function vfiNode resource demand；
S4-1-7, SFC link e is searchedmWater channel principium pemAnd from njL is constrained to user's deployed positionUMost safe road
Diameter pi+1(nj,LU)；M=1,2 ..., | EF |, | EF | it is SFC number of links；
S4-1-8, path p is calculatedemSafety PathSecurity (pem), path pemLower deployment cost PathCost (pem) with
And path pi+1(nj,LU) safety PathSecurity (pi+1(nj,LU))；
PathSecurity(pem) calculation formula are as follows:
Wherein s (lk) indicate physical link lkSafety coefficient；K=1,2 ..., | EP |, | EP | for physical link in physical network
Quantity；
PathCost(pem) calculation formula are as follows:
Wherein p (lk) indicate physical link lkUnit cost, ε (em) indicate SFC link emBandwidth resources demand；
PathSecurity(pi+1(nj,LU)) calculation formula are as follows:
S4-1-9, according to VNFSecurity (vfi→nj)、VNFCost(vfi→nj)、PathSecurity(pem)、PathCost
(pem) and PathSecurity (pi+1(nj,LU)) calculate virtual network function vfiIt is deployed to physical node njGeneral safety
Property TSecurity (vfi→nj) and lower deployment cost TCost (vfi→nj), return step S4-1-3；
TSecurity(vfi→nj) calculation formula are as follows:
TCost(vfi→nj) calculation formula are as follows:
S4-1-10, judge whether that overall security TSecurity (vf can be foundi→nj) maximum deployment scheme, if then
S4-1-12 is entered step, S4-1-11 is otherwise entered step；
S4-1-11, SFC is emptied1Deployment scheme set DS, enter step S4-1-16；
S4-1-12, by virtual network function vfiWith SFC link emDeployment scheme be stored into SFC1Deployment scheme set DS
In, enter step S4-1-13；
S4-1-13, the overall security TSecurity (DS) ' for calculating DS, calculation formula are as follows:
Wherein VNFSecurity (DS (vfa)) indicate a-th of virtual network function vf of trustshipaPhysical node DS (vfa) peace
Quan Xing, a=1,2 ..., i；PathSecurity(DS(em)) indicate trustship SFC link emPhysical link DS (em) safety
Property, s (DS (vfa)) indicate physical node DS (vfa) safety coefficient；
S4-1-14, judge whether to meet TSecurity (DS) ' < SR, if then entering step S4-1-15, otherwise return step
S4-1-1；
S4-1-15, SFC is emptied1Deployment scheme set DS, enter step S4-1-16；
S4-1-16, output DS are sky, and enable TCost (DS)=0, enter step S5；
S4-1-17, SFC link e is calculated according to formula (3)|ES|All mapping paths safety, from all mapping paths
Search the highest path p of safetye|ES|, it is stored in DS, and calculate lower deployment cost TCost (DS), calculation formula are as follows:
Wherein VNFCost (DS (vfi)) indicate i-th of virtual network function vf of trustshipiPhysical node DS (vfi) be deployed to
This, PathCost (DS (em)) indicate trustship SFC link emPhysical link DS (em) lower deployment cost, p (DS (vfi)) indicate
Physical node DS (vfi) unit cost；
S4-1-18, output DS and TCost (DS), enter step S5.
3. service function chain security deployment method according to claim 1, which is characterized in that the cost minimization and peace
All risk insurance barrier Deployment Algorithm the following steps are included:
S4-2-1, traversal NFEach of virtual network function vfi, i=1,2 ..., | NF |；NFFor the void of SFC deployment request
Quasi- network function set, | NF | it is NFThe quantity of middle virtual network function；
S4-2-2, judge NFIn virtual network function whether be traversed, if then entering step S4-2-14, otherwise enter step
Rapid S4-2-3；
Each physical node n in S4-2-3, traversal physical networkj∈NP, NPFor the physical node set in physical network；J=
1,2 ..., | NP |, | NP | for the quantity of physical node in physical network；
S4-2-4, judge whether the physical node in physical network has been traversed, if then entering step S4-2-10, otherwise into
Enter step S4-2-5；
S4-2-5, judge physical node njWhether virtual network function vf is metiPosition constraint, if then entering step S4-2-
6, otherwise return step S4-2-3；
S4-2-6, by vfiIt is deployed to physical node njOn, and calculate vfiDeployment scheme lower deployment cost VNFCost (vfi→
nj)；
VNFCost(vfi→nj) calculation formula are as follows:
VNFCost(vfi→nj)=p (nj)ε(vfi) (2)
Wherein p (nj) indicate physical node njUnit cost, ε (vfi) indicate virtual network function vfiNode resource demand；
S4-2-7, SFC link e is searchedmWater channel principium pemAnd from njL is constrained to user's deployed positionUMost safe road
Diameter pi+1(nj,LU)；M=1,2 ..., | EF |, | EF | it is SFC number of links；
S4-2-8, path p is calculatedemSafety PathSecurity (pem), path pemLower deployment cost PathCost (pem),
Path pi+1(nj,LU) safety PathSecurity (pi+1(nj,LU)), path pi+1(nj,LU) lower deployment cost PathCost
(pi+1(nj,LU)) and remaining virtual network function pre- deployment scheme maximum security MaxSecurity (pi+1(nj,
LU))；
PathSecurity(pem) calculation formula are as follows:
Wherein s (lk) indicate physical link lkSafety coefficient；K=1,2 ..., | EP |, | EP | for physical link in physical network
Quantity；
PathCost(pem) calculation formula are as follows:
Wherein p (lk) indicate physical link lkUnit cost, ε (em) indicate SFC link emBandwidth resources demand；
PathSecurity(pi+1(nj,LU)) calculation formula are as follows:
Wherein s (lk) indicate physical link lkSafety coefficient；K=1,2 ..., | EP |, | EP | for physical link in physical network
Quantity；
PathCost(pi+1(nj,LU)) calculation formula are as follows:
Wherein ε (em+1) indicate SFC link em+1Bandwidth resources demand；
MaxSecurity(pi+1(nj,LU)) calculation formula are as follows:
Wherein s (nt) indicate physical node ntSafety coefficient, ntIndicate path pi+1(nj,LU) in physical node；
S4-2-9, according to VNFCost (vfi→nj)、PathCost(pem)、PathSecurity(pi+1(nj,LU))、PathCost
(pi+1(nj,LU)) and MaxSecurity (pi+1(nj,LU)) calculate deployment scheme set DS overall security TSecurity
(DS) " and by virtual network function vfiIt is deployed to physical node njLower deployment cost TCost (vfi→nj) ", return step S4-
2-3；
The calculation formula of TSecurity (DS) " are as follows:
Wherein VNFSecurity (DS (vfa)) indicate a-th of virtual network function vf of trustshipaPhysical node DS (vfa) peace
Quan Xing, a=1,2 ..., i；PathSecurity(DS(em)) indicate trustship SFC link emPhysical link DS (em) safety
Property, s (DS (vfa)) indicate physical node DS (vfa) safety coefficient；
TCost(vfi→nj) " calculation formula are as follows:
S4-2-10, judge whether that lower deployment cost TCost (vf can be foundi→nj) " minimum, and overall security TSecurity
(DS) " otherwise >=SR deployment scheme enters step S4-2-12 if then entering step S4-2-11；SR indicates that SFC deployment is asked
The overall safety demand index asked；
S4-2-11, by virtual network function vfiWith SFC link emDeployment scheme be stored into SFC1Deployment scheme set DS
In, return step S4-2-1；
S4-2-12, SFC is emptied1Deployment scheme set DS, enter step S4-2-13；
S4-2-13, output DS are sky, and enable TCost (DS)=0, enter step S5；
S4-2-14, SFC link e is calculated according to formula (3)|ES|All mapping paths safety, from all mapping paths
Search the highest path p of safetye|ES|, it is stored in DS, and calculate lower deployment cost TCost (DS), calculation formula are as follows:
Wherein VNFCost (DS (vfi)) indicate i-th of virtual network function vf of trustshipiPhysical node DS (vfi) be deployed to
This, PathCost (DS (em)) indicate trustship SFC link emPhysical link DS (em) lower deployment cost, p (DS (vfi)) indicate
Physical node DS (vfi) unit cost；
S4-2-15, output DS and TCost (DS).
4. service function chain security deployment method according to claim 2, which is characterized in that the cost minimization and peace
All risk insurance barrier low-resistance plug rate Deployment Algorithm the following steps are included:
S4-3-1, SFC is obtained using the maximized Deployment Algorithm of safety1Deployment scheme set DS and its lower deployment cost TCost
(DS)；
S4-3-2, traversal NFEach of virtual network function vfi, i=1,2 ..., | NF |；NFFor the void of SFC deployment request
Quasi- network function set, | NF | it is NFThe quantity of middle virtual network function；
S4-3-3, judge NFIn virtual network function whether be traversed, if then entering step S4-3-17, otherwise enter step
Rapid S4-3-4；
Each physical node n in S4-3-4, traversal physical networkj∈NP, NPFor the physical node set in physical network；J=
1,2 ..., | NP |, | NP | for the quantity of physical node in physical network；
S4-3-5, judge whether the physical node in physical network has been traversed, if then entering step S4-3-11, otherwise into
Enter step S4-3-6；
S4-3-6, judge physical node njWhether virtual network function vf is metiPosition constraint, if then entering step S4-3-
7, otherwise return step S4-3-4；
S4-3-7, by vfiIt is deployed to physical node njOn, and calculate vfiDeployment scheme lower deployment cost VNFCost (vfi→
nj), calculation formula are as follows:
VNFCost(vfi→nj)=p (nj)ε(vfi) (2)
Wherein p (nj) indicate physical node njUnit cost, ε (vfi) indicate virtual network function vfiNode resource demand；
S4-3-8, SFC link e is searchedmWater channel principium pemAnd from njL is constrained to user's deployed positionUMost safe road
Diameter pi+1(nj,LU)；M=1,2 ..., | EF |, | EF | it is SFC number of links；
S4-3-9, path p is calculatedemLower deployment cost PathCost (pem) and path pi+1(nj,LU) lower deployment cost
PathCost(pi+1(nj,LU))；
PathCost(pem) calculation formula are as follows:
Wherein p (lk) indicate physical link lkUnit cost, ε (em) indicate SFC link emBandwidth resources demand；
PathCost(pi+1(nj,LU)) calculation formula are as follows:
Wherein ε (em+1) indicate SFC link em+1Bandwidth resources demand；
S4-3-10, according to VNFCost (vfi→nj)、PathCost(pem) and PathCost (pi+1(nj,LU)) calculate will be virtual
Network function vfiIt is deployed to physical node njLower deployment cost TCost (vfi→nj) ", return step S4-3-4；
TCost(vfi→nj) " calculation formula are as follows:
S4-3-11, judge whether that lower deployment cost TCost (vf can be foundi→nj) " the smallest deployment scheme, if then entering step
Rapid S4-3-13, otherwise enters step S4-3-12；
S4-3-12, SFC is emptied1Deployment scheme set DS ', enter step S4-3-20；
S4-3-13, by virtual network function vfiWith SFC link emDeployment scheme be stored into SFC1Deployment scheme set DS '
In, enter step S4-3-14；
S4-3-14, the overall security TSecurity (DS ') for calculating DS ', calculation formula are as follows:
Wherein VNFSecurity (DS ' (vfa)) indicate a-th of virtual network function vf of trustshipaPhysical node DS ' (vfa)
Safety, a=1,2 ..., i；PathSecurity(DS′(em)) indicate trustship SFC link emPhysical link DS ' (em) peace
Quan Xing, s (DS ' (vfa)) indicate physical node DS ' (vfa) safety coefficient；
S4-3-15, judge whether to meet TSecurity (DS ') < SR, if then entering step S4-3-16, otherwise return step
S4-3-2；SR indicates the overall safety demand index of SFC deployment request；
S4-3-16, SFC is emptied1Deployment scheme set DS ', enter step S4-3-20；
S4-3-17, SFC link e is calculated according to formula (4)|ES|All mapping paths lower deployment cost, from all mapping paths
The middle the smallest path p of lookup lower deployment coste|ES|, it is stored in DS ', and calculate lower deployment cost TCost (DS ') and whole peace
Full property TSecurity (DS ')；
The calculation formula of TCost (DS ') are as follows:
Wherein VNFCost (DS ' (vfi)) indicate i-th of virtual network function vf of trustshipiPhysical node DS ' (vfi) deployment
Cost, PathCost (DS ' (em)) indicate trustship SFC link emPhysical link DS (em) lower deployment cost, p (DS ' (vfi))
Indicate physical node DS ' (vfi) unit cost；
S4-3-18, judge whether that meeting DS ' not is sky, and TSecurity (DS ')>=SR, and TCost (DS ')<TCost
(DS), if then entering step S4-3-19, S4-3-20 is otherwise entered step；
S4-3-19, DS=DS ', TCost (DS)=TCost (DS ') are enabled；
S4-3-20, output DS and TCost (DS), enter step S5.
5. service function chain security deployment method according to claim 1, which is characterized in that updated in the step S6 total
The formula of lower deployment cost TCost are as follows:
TCost=TCostb+TCost(DS) (16)
Wherein TCost indicates updated total lower deployment cost, TCostbIndicate total lower deployment cost before updating.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810118870.7A CN108200202B (en) | 2018-02-06 | 2018-02-06 | A kind of service function chain security deployment method calculating network applied to cloud and mist |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810118870.7A CN108200202B (en) | 2018-02-06 | 2018-02-06 | A kind of service function chain security deployment method calculating network applied to cloud and mist |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108200202A CN108200202A (en) | 2018-06-22 |
| CN108200202B true CN108200202B (en) | 2019-11-12 |
Family
ID=62593038
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810118870.7A Active CN108200202B (en) | 2018-02-06 | 2018-02-06 | A kind of service function chain security deployment method calculating network applied to cloud and mist |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108200202B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109120416B (en) * | 2018-08-20 | 2020-03-10 | 电子科技大学 | Self-adaptive delay shutdown method of server based on cloud network |
| CN109379230B (en) * | 2018-11-08 | 2020-05-22 | 电子科技大学 | Service function chain deployment method based on breadth-first search |
| CN109412963B (en) * | 2018-11-16 | 2021-08-17 | 电子科技大学 | Service function chain deployment method based on stream splitting |
| CN113055234B (en) * | 2021-03-18 | 2022-06-14 | 湘潭大学 | Service function chain deployment method based on edge calculation |
| CN116938683B (en) * | 2023-09-15 | 2023-12-01 | 金盾检测技术股份有限公司 | Network path analysis system and method based on network security anomaly detection |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| CN105406992A (en) * | 2015-10-28 | 2016-03-16 | 浙江工商大学 | Business requirement transformation and deployment method for SDN (Software Defined Network) |
| CN107094099A (en) * | 2017-05-19 | 2017-08-25 | 西安交通大学苏州研究院 | A kind of high reliability business function chain and its construction method |
| CN107332913A (en) * | 2017-07-04 | 2017-11-07 | 电子科技大学 | A kind of Optimization deployment method of service function chain in 5G mobile networks |
| CN107395501A (en) * | 2017-08-29 | 2017-11-24 | 电子科技大学 | A kind of cross-domain dispositions method of network service function chain |
| CN107395506A (en) * | 2017-09-07 | 2017-11-24 | 电子科技大学 | A kind of service function chain dispositions method of propagation delay time optimization |
| CN107483286A (en) * | 2017-08-14 | 2017-12-15 | 电子科技大学 | Merge the method with deployment services functional chain under a kind of environment based on cloud and mist |
| US10187209B2 (en) * | 2015-04-27 | 2019-01-22 | Cisco Technology, Inc. | Cumulative schemes for network path proof of transit |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9917745B2 (en) * | 2013-09-27 | 2018-03-13 | Futurewei Technologies, Inc. | Validation of chained network services |
| US9825856B2 (en) * | 2014-01-06 | 2017-11-21 | Futurewei Technologies, Inc. | Service function chaining in a packet network |
-
2018
- 2018-02-06 CN CN201810118870.7A patent/CN108200202B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10187209B2 (en) * | 2015-04-27 | 2019-01-22 | Cisco Technology, Inc. | Cumulative schemes for network path proof of transit |
| 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 |
| CN105406992A (en) * | 2015-10-28 | 2016-03-16 | 浙江工商大学 | Business requirement transformation and deployment method for SDN (Software Defined Network) |
| CN107094099A (en) * | 2017-05-19 | 2017-08-25 | 西安交通大学苏州研究院 | A kind of high reliability business function chain and its construction method |
| CN107332913A (en) * | 2017-07-04 | 2017-11-07 | 电子科技大学 | A kind of Optimization deployment method of service function chain in 5G mobile networks |
| CN107483286A (en) * | 2017-08-14 | 2017-12-15 | 电子科技大学 | Merge the method with deployment services functional chain under a kind of environment based on cloud and mist |
| CN107395501A (en) * | 2017-08-29 | 2017-11-24 | 电子科技大学 | A kind of cross-domain dispositions method of network service function chain |
| CN107395506A (en) * | 2017-09-07 | 2017-11-24 | 电子科技大学 | A kind of service function chain dispositions method of propagation delay time optimization |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108200202A (en) | 2018-06-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108200202B (en) | A kind of service function chain security deployment method calculating network applied to cloud and mist | |
| CN103346922B (en) | The controller of determination network state based on SDN and determine method | |
| CN107819662B (en) | A kind of service function chain real-time migration method calculating network applied to cloud and mist | |
| CN102497362B (en) | The network attack trace back method and device of Abnormal network traffic | |
| CN104853384B (en) | A kind of content buffering method based on popularity in 5th Generation Mobile Communication System | |
| CN103746911B (en) | A kind of SDN structure and its communication means | |
| CN104158755B (en) | The methods, devices and systems of transmitting message | |
| CN104092756B (en) | A kind of resource dynamic distributing method of the cloud storage system based on DHT mechanism | |
| EP2520048B1 (en) | Non-blocking adminission control | |
| CN104660507B (en) | The control method and device of forwarding data flow routing | |
| CN109792409A (en) | For abandoning method, system and the computer-readable medium of message during congestion events | |
| CN108174397A (en) | A kind of multiple gateway Synergistic method of task-driven | |
| CN107483286A (en) | Merge the method with deployment services functional chain under a kind of environment based on cloud and mist | |
| WO2005018254A3 (en) | Provision of services by reserving resources in a communications network having resource management according to policy rules | |
| Shukla et al. | A 3-tier architecture for network latency reduction in healthcare internet-of-things using fog computing and machine learning | |
| Yan et al. | A survey of low-latency transmission strategies in software defined networking | |
| CN110278118A (en) | End-to-end quality of service safeguards system | |
| CN107786460A (en) | A kind of management of electricity transaction system request and current-limiting method based on token bucket algorithm | |
| CN105681438A (en) | Centralized caching decision strategy in content-centric networking | |
| Wang et al. | Software defined autonomic QoS model for future Internet | |
| CN107959593B (en) | A kind of software defined network mapping method of virtual network | |
| Jin et al. | Utility max–min fair resource allocation for communication networks with multipath routing | |
| WO2021017968A1 (en) | Method, apparatus and system for processing access request in content delivery system | |
| CN101686170B (en) | Grading transmission quality assurance system based on multi-exit user routing | |
| CN101902405A (en) | Emergency service-oriented temporary bandwidth allocation method and system thereof |
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 |