CN108200202A - A kind of service function chain security deployment method that network is calculated applied to cloud and mist - Google Patents

A kind of service function chain security deployment method that network is calculated applied to cloud and mist Download PDF

Info

Publication number
CN108200202A
CN108200202A CN201810118870.7A CN201810118870A CN108200202A CN 108200202 A CN108200202 A CN 108200202A CN 201810118870 A CN201810118870 A CN 201810118870A CN 108200202 A CN108200202 A CN 108200202A
Authority
CN
China
Prior art keywords
sfc
deployment
represent
physical
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.)
Granted
Application number
CN201810118870.7A
Other languages
Chinese (zh)
Other versions
CN108200202B (en
Inventor
孙罡
赵东成
廖丹
虞红芳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
University of Electronic Science and Technology of China
Original Assignee
University of Electronic Science and Technology of China
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by University of Electronic Science and Technology of China filed Critical University of Electronic Science and Technology of China
Priority to CN201810118870.7A priority Critical patent/CN108200202B/en
Publication of CN108200202A publication Critical patent/CN108200202A/en
Application granted granted Critical
Publication of CN108200202B publication Critical patent/CN108200202B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a kind of service function chain security deployment methods that network is calculated applied to cloud and mist, request is disposed in known cloud computing and the combination bottom-layer network of mist calculating and the online service function chain with security requirement, under the position of user and the position precondition of service terminal, find out a kind of method of effective deployment services function chain request, when deployment services function chain is asked, 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 minimum server resource and bandwidth resources, and it is target to reduce the blocking rate that service function chain is asked, 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

A kind of service function chain security deployment method that network is calculated applied to cloud and mist
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 technology
Virtualization technology is a kind of cutting edge technology that can improve network flexibility, 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), so as to improve the flexibility of network.It is more A virtual network function forms service function chain (Service Function Chain, SFC) to ensure to use in a specific sequence Then the service strategy at family is deployed in cloud network the service of providing to the 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 carried It out extends and supplements cloud computing.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 for carrying mist computing capability, the node phase with cloud computing Seemingly, these mist nodes can provide service to the 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, and safer service is provided for mobile subscriber using cloud computing and mist calculating.
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 the service function chain of Energy Efficient, it is proposed that a kind of heuritic approach takes to dispose Function chain of being engaged in is to cloud computing environment to reduce total lower deployment cost.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 carry for mobile subscriber For safer service.There is the SDN/NFV that researcher calculated based on cloud and mist 5G services to dispose experiment, to optimize VNF portions Administration meets constraint (such as delay) simultaneously.
With the increase that service function chain is asked, how to ensure the safety of service becomes a huge challenge.In order to Ensure the safety of service when servicing under attack, there is research of the part about NFV safety, such as SAMA algorithms, master It is that the deployment of service function chain is carried out based on the method for traffic aware and Energy Efficient to want thought, to minimize total be deployed to This, while meet the size constraint of network node.Although this method can realize the deployment of virtual network function, it does not have Consider the safety issue of service function chain, also do not account for characteristic and related constraint that mist calculates network, it is impossible to utilize mist meter The advantage of calculation.
For the deployment issue of virtual network function, related researcher also proposed PATH-EXTENSION, main Thought considers virtual network function existing for shared and reuse, so as to reduce the consumption of Internet resources.Although this method can It realizes the placement of virtual network function, and considers shared and virtual network function existing for reusing, but it is also without examining Consider characteristic and related constraint that mist calculates network, it is impossible to the advantage calculated using mist, and do not account for entire service function chain Safety issue.
Invention content
The purpose of the invention is to the link companies of each virtual network function in entire service function chain request is considered It connects situation and meets under the relevant constraints such as demand for security, cloud and mist is calculated into the node resource of bottom-layer network and bandwidth resources point The each service function chain request of dispensing so that in the resource profit 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, it is proposed that a kind of service function chain Ministry of State Security management side that network is calculated applied to cloud and mist Method.
The technical scheme is that：A kind of service function chain security deployment method that network is calculated applied to cloud and mist, packet Include following steps：
The initial SFC deployment request queue ArrivalSFC of S1, structure, by wherein expired SFC requests storage to expired SFC In request set FinishedSFC, and initial total lower deployment cost TCost=0 is set, is initially blocked SFC deployment request sets SFCbloFor sky.
S2, judge whether ArrivalSFC is empty, if then entering step S9, otherwise enter step S3.
S3, the resource that expired SFC requests occupy is discharged according to set FinishedSFC.
S4, using MSSFCD algorithms, MCSGSFCD algorithms or MCSGFCDFA algorithms dispose ArrivalSFC in first SFC deployment requests SFC1, and obtain SFC1Deployment scheme set DS lower deployment cost TCost (DS).
S5, judge whether set DS is empty, 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 to step S2.
S9, output TCost and SFCblo。
The beneficial effects of the invention are as follows：
(1) it is applied widely：Traditional virtual network function or service function chain Deployment Algorithm are for virtual net mostly It is that network and data center network propose or do not account for the deployment services function chain in cloud and mist calculates network.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：Since the present invention proposes MSSFCD algorithms/MCSGSFCD algorithms/MCSGFCDFA algorithms, It is asked 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：Due to considering the safety of deployment scheme in the present invention, meeting service function chain Under the constraint of demand for security, the consumption of Internet resources can be effectively reduced, so it is also bigger to map successful possibility, resistance Plug rate is also just smaller.
Description of the drawings
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 charts provided in an embodiment of the present invention.
Fig. 3 show MCSGSFCD algorithm flow charts provided in an embodiment of the present invention.
Fig. 4 show MCSGFCDFA algorithm flow charts 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 the model of the present invention It encloses.
An embodiment of the present 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：
The initial SFC deployment request queue ArrivalSFC of S1, structure, by wherein expired SFC requests storage to expired SFC In request set FinishedSFC, and initial total lower deployment cost TCost=0 is set, is initially blocked SFC deployment request sets SFCbloFor sky.
S2, judge whether ArrivalSFC is empty, if then entering step S9, otherwise enter step S3.
S3, the resource that expired SFC requests occupy is discharged according to set FinishedSFC.
S4, using MSSFCD algorithms, MCSGSFCD algorithms or MCSGFCDFA algorithms dispose ArrivalSFC in first SFC deployment requests SFC1, and obtain SFC1Deployment scheme set DS lower deployment cost TCost (DS).
S5, judge whether set DS is empty, 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 for updating total lower deployment cost TCost is：
TCost=TCostb+TCost(DS) (16)
Wherein TCost represents updated total lower deployment cost, TCostbRepresent total lower deployment cost before update.
S7, by SFC1It is added to SFCblo。
S8, by SFC1It is removed from ArrivalSFC, return to step S2.
S9, output TCost and SFCblo。
In the embodiment of the present invention, MSSFCD algorithms are the maximized Deployment Algorithm of safety, are used to carry to the maximum extent The safety of high service function chain deployment scheme.It is safe to use to maximize strategy to dispose virtual network in MSSFCD algorithms 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 work(that MSSFCD algorithms solve The safety of energy chain deployment scheme cannot meet 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 algorithms include the following steps：
S4-1-1, traversal NFIn each virtual network function vfi, i=1,2 ..., | NF |；NFIt disposes and asks 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 | the quantity for 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 to 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 be：
VNFSecurity(vfi→nj)=s (nj) (1)
Wherein s (nj) represent physical node njSafety coefficient.
VNFCost(vfi→nj) calculation formula be：
VNFCost(vfi→nj)=p (nj)ε(vfi) (2)
Wherein p (nj) represent physical node njUnit cost, ε (vfi) represent virtual network function vfiNode resource Demand.
S4-1-7, SFC links 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 be：
Wherein s (lk) represent physical link lkSafety coefficient；K=1,2 ..., | EP |, | EP | for physics in physical network The quantity of link.
PathCost(pem) calculation formula be：
Wherein p (lk) represent physical link lkUnit cost, ε (em) represent SFC links emBandwidth resources demand.
PathSecurity(pi+1(nj,LU)) calculation formula be：
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 to step S4-1-3.
TSecurity(vfi→nj) calculation formula be：
TCost(vfi→nj) calculation formula be：
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 links 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 is：
Wherein VNFSecurity (DS (vfa)) represent a-th of virtual network function vf of trustshipaPhysical node DS (vfa) Safety, a=1,2 ..., i；PathSecurity(DS(em)) represent trustship SFC links emPhysical link DS (em) peace Quan Xing, s (DS (vfa)) represent physical node DS (vfa) safety coefficient.
S4-1-14, judge whether to meet TSecurity (DS) '<SR if then entering step S4-1-15, is otherwise returned 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 links 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 For：
Wherein VNFCost (DS (vfi)) represent i-th of virtual network function vf of trustshipiPhysical node DS (vfi) portion Affix one's name to cost, PathCost (DS (em)) represent trustship SFC links emPhysical link DS (em) lower deployment cost, p (DS (vfi)) Represent 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 algorithms, by the use of cost minimization and security strategies as boot policy It disposes to dispose virtual network function, while the demand for security of deployment scheme of service function chain deployment request is met, subtract Total lower deployment cost of the deployment scheme of few service function chain deployment request.In MCSGSFCD algorithms, similar to MSSFCD algorithms, 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 algorithms include the following steps：
S4-2-1, traversal NFIn each virtual network function vfi, i=1,2 ..., | NF |；NFIt disposes and asks 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 | the quantity for 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 to 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 be：
VNFCost(vfi→nj)=p (nj)ε(vfi) (2)
Wherein p (nj) represent physical node njUnit cost, ε (vfi) represent virtual network function vfiNode resource Demand；
S4-2-7, SFC links 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 be：
Wherein s (lk) represent physical link lkSafety coefficient；K=1,2 ..., | EP |, | EP | for physics in physical network The quantity of link.
PathCost(pem) calculation formula be：
Wherein p (lk) represent physical link lkUnit cost, ε (em) represent SFC links emBandwidth resources demand.
PathSecurity(pi+1(nj,LU)) calculation formula be：
Wherein s (lk) represent 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 be：
Wherein ε (em+1) represent SFC links em+1Bandwidth resources demand.
MaxSecurity(pi+1(nj,LU)) calculation formula be：
Wherein s (nt) represent physical node ntSafety coefficient, ntRepresent 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 the overall security of deployment scheme set DS 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) " is：
Wherein VNFSecurity (DS (vfa)) represent a-th of virtual network function vf of trustshipaPhysical node DS (vfa) Safety, a=1,2 ..., i；PathSecurity(DS(em)) represent trustship SFC links emPhysical link DS (em) peace Quan Xing, s (DS (vfa)) represent physical node DS (vfa) safety coefficient.
TCost(vfi→nj) " calculation formula be：
S4-2-10, judge whether that lower deployment cost TCost (vf can be foundi→nj) " minimum, and overall security The deployment scheme of TSecurity (DS) " >=SR, if then entering step S4-2-11, otherwise enters step S4-2-12；SR is represented The overall safety demand index of SFC deployment requests.
S4-2-11, by virtual network function vfiWith SFC links emDeployment scheme be stored into SFC1Deployment scheme set In DS, return to 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 links 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 For：
Wherein VNFCost (DS (vfi)) represent i-th of virtual network function vf of trustshipiPhysical node DS (vfi) portion Affix one's name to cost, PathCost (DS (em)) represent trustship SFC links emPhysical link DS (em) lower deployment cost, p (DS (vfi)) Represent physical node DS (vfi) unit cost.
S4-2-15, output DS and TCost (DS).
MCSGSFCD algorithms use cost minimizes and security strategies are as the guiding 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 algorithms reduce blocking rate.In MCSGFCDFA algorithms, a safety is obtained using MSSFCD algorithms first Then maximized initial deployment scheme is attempted to find the deployment scheme of a total lower deployment cost of minimum.If find such one A new deployment scheme, and the demand for security of the safe sexual satisfaction service function chain request of this new deployment scheme, 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 algorithms include the following steps：
S4-3-1, SFC is obtained using MSSFCD algorithms1Deployment scheme set DS and its lower deployment cost TCost (DS).
S4-3-2, traversal NFIn each virtual network function vfi, i=1,2 ..., | NF |；NFIt disposes and asks 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 | the quantity for 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 to 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 is：
VNFCost(vfi→nj)=p (nj)ε(vfi) (2)
Wherein p (nj) represent physical node njUnit cost, ε (vfi) represent virtual network function vfiNode resource Demand.
S4-3-8, SFC links 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 be：
Wherein p (lk) represent physical link lkUnit cost, ε (em) represent SFC links emBandwidth resources demand.
PathCost(pi+1(nj,LU)) calculation formula be：
Wherein ε (em+1) represent SFC links 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 to step S4-3-4.
TCost(vfi→nj) " calculation formula be：
S4-3-11, judge whether that lower deployment cost TCost (vf can be foundi→nj) " minimum deployment scheme, if then into Enter step S4-3-13, otherwise enter 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 links 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：
Wherein VNFSecurity (DS ' (vfa)) represent a-th of virtual network function vf of trustshipaPhysical node DS ' (vfa) safety, a=1,2 ..., i；PathSecurity(DS’(em)) represent trustship SFC links emPhysical link DS ' (em) safety, s (DS ' (vfa)) represent physical node DS ' (vfa) safety coefficient.
S4-3-15, judge whether to meet TSecurity (DS ')<SR if then entering step S4-3-16, is otherwise returned Step S4-3-2；SR represents the overall safety demand index of SFC deployment requests.
S4-3-16, SFC is emptied1Deployment scheme set DS ', enter step S4-3-20.
S4-3-17, SFC links e is calculated according to formula (4)|ES|All mapping paths lower deployment cost, from all mappings The path p of lower deployment cost minimum 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 ') is：
Wherein VNFCost (DS ' (vfi)) represent i-th of virtual network function vf of trustshipiPhysical node DS ' (vfi) Lower deployment cost, PathCost (DS ' (em)) represent trustship SFC links emPhysical link DS (em) lower deployment cost, p (DS ' (vfi)) represent physical node DS ' (vfi) unit cost.
S4-3-18, judge whether that it is not sky, and TSecurity (DS ') >=SR, and TCost (DS ') to meet 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 messages.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 The production firm for having 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, it is achieved thereby that the calculating of network and the integration of storage resource, finally make It is combined as long as obtaining by some simple software tools, can be achieved with the control and management to whole network.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 work(in the cloud and mist based on SDN The method of energy chain is deployed on the key-course in the control router of SDN, and SDN control routers can dispatch the control itself carried Management function processed collects the whole network information, obtains all node resource situations and the information such as the resource of link, time delay in network. 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 can be adjusted according to the whole network information that oneself is grasped Degree is deployed in the dispositions method based on service function chain on its key-course, calculates the key parameters such as lower deployment cost, reject rate, 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 can make according to these technical inspirations disclosed by the invention various does not depart from the other each of essence of the invention The specific deformation of kind and combination, these deform and combine still within the scope of the present invention.

Claims (5)

  1. A kind of 1. service function chain security deployment method that network is calculated applied to cloud and mist, which is characterized in that include the following steps：
    The initial SFC deployment request queue ArrivalSFC of S1, structure asks wherein expired SFC request storages to expired SFC In set FinishedSFC, and initial total lower deployment cost TCost=0 is set, is initially blocked SFC deployment request sets SFCblo For sky；
    S2, judge whether ArrivalSFC is empty, if then entering step S9, otherwise enter step S3；
    S3, the resource that expired SFC requests occupy is discharged according to set FinishedSFC；
    S4, first SFC in ArrivalSFC is disposed using MSSFCD algorithms, MCSGSFCD algorithms or MCSGFCDFA algorithms Deployment request SFC1, and obtain SFC1Deployment scheme set DS lower deployment cost TCost (DS)；
    S5, judge whether set DS is empty, 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 to step S2；
    S9, output TCost and SFCblo。
  2. 2. service function chain security deployment method according to claim 1, which is characterized in that the MSSFCD algorithms include Following steps：
    S4-1-1, traversal NFIn each virtual network function vfi, i=1,2 ..., | NF |；NFVoid for SFC deployment requests Intend 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 | the quantity for 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 to 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 be：
    VNFSecurity(vfi→nj)=s (nj) (1)
    Wherein s (nj) represent physical node njSafety coefficient；
    VNFCost(vfi→nj) calculation formula be：
    VNFCost(vfi→nj)=p (nj)ε(vfi) (2)
    Wherein p (nj) represent physical node njUnit cost, ε (vfi) represent virtual network function vfiNode resource demand；
    S4-1-7, SFC links 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 be：
    Wherein s (lk) represent physical link lkSafety coefficient；K=1,2 ..., | EP |, | EP | for physical link in physical network Quantity；
    PathCost(pem) calculation formula be：
    Wherein p (lk) represent physical link lkUnit cost, ε (em) represent SFC links emBandwidth resources demand；
    PathSecurity(pi+1(nj,LU)) calculation formula be：
    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 to step S4-1-3；
    TSecurity(vfi→nj) calculation formula be：
    TCost(vfi→nj) calculation formula be：
    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, 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 links 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 is：
    Wherein VNFSecurity (DS (vfa)) represent a-th of virtual network function vf of trustshipaPhysical node DS (vfa) peace Quan Xing, a=1,2 ..., i；PathSecurity(DS(em)) represent trustship SFC links emPhysical link DS (em) safety Property, s (DS (vfa)) represent 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 to 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 links 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 is：
    Wherein VNFCost (DS (vfi)) represent i-th of virtual network function vf of trustshipiPhysical node DS (vfi) be deployed to This, PathCost (DS (em)) represent trustship SFC links emPhysical link DS (em) lower deployment cost, p (DS (vfi)) represent Physical node DS (vfi) unit cost；
    S4-1-18, output DS and TCost (DS), enter step S5.
  3. 3. service function chain security deployment method according to claim 1, which is characterized in that the MCSGSFCD algorithms packet Include following steps：
    S4-2-1, traversal NFIn each virtual network function vfi, i=1,2 ..., | NF |；NFVoid for SFC deployment requests Intend 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 | the quantity for 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 to 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 be：
    VNFCost(vfi→nj)=p (nj)ε(vfi) (2)
    Wherein p (nj) represent physical node njUnit cost, ε (vfi) represent virtual network function vfiNode resource demand；
    S4-2-7, SFC links 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 be：
    Wherein s (lk) represent physical link lkSafety coefficient；K=1,2 ..., | EP |, | EP | for physical link in physical network Quantity；
    PathCost(pem) calculation formula be：
    Wherein p (lk) represent physical link lkUnit cost, ε (em) represent SFC links emBandwidth resources demand；
    PathSecurity(pi+1(nj,LU)) calculation formula be：
    Wherein s (lk) represent physical link lkSafety coefficient；K=1,2 ..., | EP |, | EP | for physical link in physical network Quantity；
    PathCost(pi+1(nj,LU)) calculation formula be：
    Wherein ε (em+1) represent SFC links em+1Bandwidth resources demand；
    MaxSecurity(pi+1(nj,LU)) calculation formula be：
    Wherein s (nt) represent physical node ntSafety coefficient, ntRepresent 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 the overall security TSecurity of deployment scheme set DS (DS) " and by virtual network function vfiIt is deployed to physical node njLower deployment cost TCost (vfi→nj) ", return to step S4- 2-3；
    The calculation formula of TSecurity (DS) " is：
    Wherein VNFSecurity (DS (vfa)) represent a-th of virtual network function vf of trustshipaPhysical node DS (vfa) peace Quan Xing, a=1,2 ..., i；PathSecurity(DS(em)) represent trustship SFC links emPhysical link DS (em) safety Property, s (DS (vfa)) represent physical node DS (vfa) safety coefficient；
    TCost(vfi→nj) " calculation formula be：
    S4-2-10, judge whether that lower deployment cost TCost (vf can be foundi→nj) " minimum, and overall security TSecurity (DS) " deployment scheme of >=SR if then entering step S4-2-11, otherwise enters step S4-2-12；SR represents that SFC deployment please The overall safety demand index asked；
    S4-2-11, by virtual network function vfiWith SFC links emDeployment scheme be stored into SFC1Deployment scheme set DS In, return to 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 links 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 is：
    Wherein VNFCost (DS (vfi)) represent i-th of virtual network function vf of trustshipiPhysical node DS (vfi) be deployed to This, PathCost (DS (em)) represent trustship SFC links emPhysical link DS (em) lower deployment cost, p (DS (vfi)) represent Physical node DS (vfi) unit cost；
    S4-2-15, output DS and TCost (DS).
  4. 4. service function chain security deployment method according to claim 2, which is characterized in that the MCSGFCDFA algorithms Include the following steps：
    S4-3-1, SFC is obtained using MSSFCD algorithms1Deployment scheme set DS and its lower deployment cost TCost (DS)；
    S4-3-2, traversal NFIn each virtual network function vfi, i=1,2 ..., | NF |；NFVoid for SFC deployment requests Intend 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 | the quantity for 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 to 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 is：
    VNFCost(vfi→nj)=p (nj)ε(vfi) (2)
    Wherein p (nj) represent physical node njUnit cost, ε (vfi) represent virtual network function vfiNode resource demand；
    S4-3-8, SFC links 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 be：
    Wherein p (lk) represent physical link lkUnit cost, ε (em) represent SFC links emBandwidth resources demand；
    PathCost(pi+1(nj,LU)) calculation formula be：
    Wherein ε (em+1) represent SFC links 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 virtually Network function vfiIt is deployed to physical node njLower deployment cost TCost (vfi→nj) ", return to step S4-3-4；
    TCost(vfi→nj) " calculation formula be：
    S4-3-11, judge whether that lower deployment cost TCost (vf can be foundi→nj) " minimum 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 links 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：
    Wherein VNFSecurity (DS ' (vfa)) represent a-th of virtual network function vf of trustshipaPhysical node DS ' (vfa) Safety, a=1,2 ..., i；PathSecurity(DS’(em)) represent trustship SFC links emPhysical link DS ' (em) peace Quan Xing, s (DS ' (vfa)) represent 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 to step S4-3-2；SR represents the overall safety demand index of SFC deployment requests；
    S4-3-16, SFC is emptied1Deployment scheme set DS ', enter step S4-3-20；
    S4-3-17, SFC links e is calculated according to formula (4)|ES|All mapping paths lower deployment cost, from all mapping paths The middle path p for searching lower deployment cost minimume|ES|, it is stored in DS ', and calculate lower deployment cost TCost (DS ') and pacify with whole Full property TSecurity (DS ')；
    The calculation formula of TCost (DS ') is：
    Wherein VNFCost (DS ' (vfi)) represent i-th of virtual network function vf of trustshipiPhysical node DS ' (vfi) deployment Cost, PathCost (DS ' (em)) represent trustship SFC links emPhysical link DS (em) lower deployment cost, p (DS ' (vfi)) Represent physical node DS ' (vfi) unit cost；
    S4-3-18, judge whether that it is not sky, and TSecurity (DS ') >=SR, and TCost (DS ') to meet 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. 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 is：
    TCost=TCostb+TCost(DS) (16)
    Wherein TCost represents updated total lower deployment cost, TCostbRepresent total lower deployment cost before update.
CN201810118870.7A 2018-02-06 2018-02-06 A kind of service function chain security deployment method calculating network applied to cloud and mist Active CN108200202B (en)

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 true CN108200202A (en) 2018-06-22
CN108200202B 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)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109120416A (en) * 2018-08-20 2019-01-01 电子科技大学 A kind of adaptive delay closedown method of the server based on cloud network
CN109379230A (en) * 2018-11-08 2019-02-22 电子科技大学 A kind of service function chain dispositions method based on breadth first search
CN109412963A (en) * 2018-11-16 2019-03-01 电子科技大学 A kind of service function chain dispositions method split based on stream
CN113055234A (en) * 2021-03-18 2021-06-29 湘潭大学 Service function chain deployment method based on edge calculation
CN116938683A (en) * 2023-09-15 2023-10-24 金盾检测技术股份有限公司 Network path analysis system and method based on network security anomaly detection

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150092564A1 (en) * 2013-09-27 2015-04-02 Futurewei Technologies, Inc. Validation of Chained Network Services
US20150195197A1 (en) * 2014-01-06 2015-07-09 Futurewei Technologies, Inc. Service Function Chaining in a Packet Network
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
CN107395506A (en) * 2017-09-07 2017-11-24 电子科技大学 A kind of service function chain dispositions method of propagation delay time optimization
CN107395501A (en) * 2017-08-29 2017-11-24 电子科技大学 A kind of cross-domain dispositions method of network service function chain
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

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150092564A1 (en) * 2013-09-27 2015-04-02 Futurewei Technologies, Inc. Validation of Chained Network Services
US20150195197A1 (en) * 2014-01-06 2015-07-09 Futurewei Technologies, Inc. Service Function Chaining in a Packet Network
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

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109120416A (en) * 2018-08-20 2019-01-01 电子科技大学 A kind of adaptive delay closedown method of the server based on cloud network
CN109120416B (en) * 2018-08-20 2020-03-10 电子科技大学 Self-adaptive delay shutdown method of server based on cloud network
CN109379230A (en) * 2018-11-08 2019-02-22 电子科技大学 A kind of service function chain dispositions method based on breadth first search
CN109412963A (en) * 2018-11-16 2019-03-01 电子科技大学 A kind of service function chain dispositions method split based on stream
CN109412963B (en) * 2018-11-16 2021-08-17 电子科技大学 Service function chain deployment method based on stream splitting
CN113055234A (en) * 2021-03-18 2021-06-29 湘潭大学 Service function chain deployment method based on edge calculation
CN113055234B (en) * 2021-03-18 2022-06-14 湘潭大学 Service function chain deployment method based on edge calculation
CN116938683A (en) * 2023-09-15 2023-10-24 金盾检测技术股份有限公司 Network path analysis system and method based on network security anomaly detection
CN116938683B (en) * 2023-09-15 2023-12-01 金盾检测技术股份有限公司 Network path analysis system and method based on network security anomaly detection

Also Published As

Publication number Publication date
CN108200202B (en) 2019-11-12

Similar Documents

Publication Publication Date Title
CN108200202B (en) A kind of service function chain security deployment method calculating network applied to cloud and mist
Martini et al. Latency-aware composition of virtual functions in 5G
CN107819662B (en) A kind of service function chain real-time migration method calculating network applied to cloud and mist
CN103746911B (en) A kind of SDN structure and its communication means
CN102497362B (en) The network attack trace back method and device of Abnormal network traffic
CN103477591B (en) The system of the network bandwidth is shared among competitive application
CN104853384B (en) A kind of content buffering method based on popularity in 5th Generation Mobile Communication System
CN104092756B (en) A kind of resource dynamic distributing method of the cloud storage system based on DHT mechanism
CN107483286A (en) Merge the method with deployment services functional chain under a kind of environment based on cloud and mist
CN108833468A (en) Method for processing video frequency, device, equipment and medium based on mobile edge calculations
CN107113243A (en) For the system and method using Virtual network operator managing network flow
CN107005848A (en) System and method for arranging Virtual Service gateway for mobile management
CN104660507B (en) The control method and device of forwarding data flow routing
CN108243044A (en) The method and apparatus of service deployment
Zhao et al. A unified modeling framework for distributed resource allocation of general fork and join processing networks
CN108174397A (en) A kind of multiple gateway Synergistic method of task-driven
CN106537824A (en) Method and apparatus for reducing response time in information-centric networks
CN107454019A (en) Software defined network distribution method of dynamic bandwidth, device, equipment and storage medium
CN107404443A (en) Queue cache resources control method and device, server and storage medium
CN107124303A (en) The service chaining optimization method of low transmission time delay
Tedesco et al. Implementation and evaluation of a congestion aware routing algorithm for networks-on-chip
CN107786460A (en) A kind of management of electricity transaction system request and current-limiting method based on token bucket algorithm
CN108900618A (en) Content buffering method in a kind of information centre&#39;s network virtualization
Tan et al. A reliable intelligent routing mechanism in 5G core networks
CN107959593B (en) A kind of software defined network mapping method of virtual network

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