CN106533966B - A kind of the resource method of combination and device of network service - Google Patents
A kind of the resource method of combination and device of network service Download PDFInfo
- Publication number
- CN106533966B CN106533966B CN201611031521.9A CN201611031521A CN106533966B CN 106533966 B CN106533966 B CN 106533966B CN 201611031521 A CN201611031521 A CN 201611031521A CN 106533966 B CN106533966 B CN 106533966B
- Authority
- CN
- China
- Prior art keywords
- network
- terminal
- indicate
- flow
- value
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- 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
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/76—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention provides the resource method of combination and device of a kind of network service, is related to communication network field.Wherein, which comprises formalized description is carried out to network topology and network service respectively, obtains and corresponding first model of the network topology and the second model corresponding with network service；According to first model and second model difference constraint network flow path and Web Service Deployment node；The optimization aim of the resource layout of the network service is determined according to the constraint of the network flow path and the Web Service Deployment node；It is optimized according to the optimization aim using greedy algorithm, obtains the resource layout result of the network service.Through the invention, the resource utilization of network service node can not only be improved, but also can be realized the load balancing of network link flow, supports the dynamic expansion of network service resource.
Description
Technical field
The present invention relates to network communication technology fields, and in particular, to a kind of the resource method of combination and dress of network service
It sets.
Background technique
The function of computer network is divided into network-in-dialing and network services two main aspects.Network-in-dialing refers to carrying out
Route selection faces network path Problem of Failure to connect different terminal equipment, and it is fault-tolerant to need to realize that dynamic routing protocol guarantees
Property, it is limited in face of network link bandwidth, needs to carry out traffic engineering adjusting and avoid link congestion.Network service mentions for terminal device
For four to seven layers of network of function services, the intermediate equipment of bearer network service is deployed between terminal device, is handled and is flowed through
Customer flow.Network service can provide safety detection, traffic statistics, the functions such as network acceleration for terminal device.Network service is logical
It is often configured as functional sequence, provides the combination of multiple network service according to given sequence.
Software defined network and network function virtualization are the developing important technologies of current network.Software defined network is
By forwarding device open interface and centralized control in logic, the rule of correspondence is disposed in forwarding device, is realized to network flow
Precise control.Network function virtualization refers to operating in the network function of proprietary intermediate equipment using virtualization technology
On general processing platform, the dynamic allocation and extension of network function resource are realized.
Existing network service uses static resource method of combination.By the closed limitation of hardware device, Web Service Deployment
At gateway or network flow convergence, by assessing the processing capacity of intermediate equipment needed for deployment point in advance, alignment processing is enabled
The intermediate equipment of performance.In addition, the load of intermediate equipment may be implemented by software defined network technology in existing network service
It is balanced.For the intermediate equipment that static state enables, network flow path can be selected by flow lead, be made in different
Between equipment processing different user between network flow, by network flow according to consumption processing capacity be successively evenly distributed on it is corresponding
In intermediate equipment, the load balancing of intermediate equipment may be implemented.
The resource method of combination of existing network service cannot achieve multiple-objection optimization by technical restriction, specifically exist such as
Lower functional defect:
(1) static resource method of combination is deployed at gateway node, and network flow is big, needs the centre of high disposal performance
Equipment support, higher cost.
(2) static resource method of combination, in network flow sustainable growth, existing intermediate equipment can not provide enough places
It when reason ability, needs to carry out Longitudinal Extension, replaces with the higher intermediate equipment of process performance, scalability is poor, and upgrade cost is high.
(3) static resource method of combination increases the consumption of link bandwidth using flow lead, not to the money of link bandwidth
Source consumption is constrained, and there are problems that generating link congestion.
Summary of the invention
The object of the present invention is to provide a kind of resource method of combination of network service and devices.Wherein, the method is wanted
The technical issues of solution, is: how to reduce the multipoint fault probability of network service, and avoids generating the congestion of network link.
To achieve the goals above, the present invention provides a kind of resource method of combination of network service.The described method includes:
Formalized description is carried out to network topology and network service respectively, obtains the first mould corresponding with the network topology
Type and the second model corresponding with network service；
According to first model and second model difference constraint network flow path and Web Service Deployment node；
The money of the network service is determined according to the constraint of the network flow path and the Web Service Deployment node
The optimization aim of source layout；
It is optimized according to the optimization aim using greedy algorithm, obtains the resource layout result of the network service.
Optionally, first model are as follows:
G=(V, E, C)
Wherein, G indicates the network topology, and V indicates the set of network node, and E indicates the set of network link, and C is indicated
The set of terminal flow bandwidth.
Optionally, second model are as follows:
Wherein, DstIndicate the flow T of terminal s to terminal tstCorresponding network service,Indicate network function miIn function
Deployment sequence in sequence, N indicate that the integer more than or equal to zero, s, t ∈ H, H indicate the set of end host, and n expression is greater than
Or the integer equal to 1.
Optionally, the constraint in the network flow path are as follows:
Wherein, s, t ∈ H, H indicate the set of end host, i, and j ∈ V, V indicate the set of network node, (i, j) ∈ E, E
Indicate the set of network link,For 0-1 variable, 0 value is taken to indicate the flow T of terminal s to terminal tstWithout network link
(i, j) takes 1 value to indicate the flow T of terminal s to terminal tstBy network link (i, j), k ∈ V, (j, k) ∈ E,For 0-1 change
Amount takes 0 value to indicate the flow T of terminal s to terminal tstWithout network link (j, k), 1 value is taken to indicate the stream of terminal s to terminal t
Measure TstBy network link (j, k),For 0-1 variable, 0 value is taken to indicate the flow T of terminal s to terminal tstWithout network section
Point i takes 1 value to indicate the flow T of terminal s to terminal tstBy network node i, max (*, *) indicates larger among two values
Value, (j, i) ∈ E,For 0-1 variable, 0 value is taken to indicate the flow T of terminal s to terminal tstWithout network link (j, i), 1 is taken
Value indicates the flow T of terminal s to terminal tstBy network link (j, i), CstIndicate the flow T of terminal s to terminal tstIt is occupied
Network link bandwidth resources, L indicate network link (i, j) use network link bandwidth resources the upper bound.
Optionally, the constraint of the Web Service Deployment node are as follows:
Wherein, s, t ∈ H, H indicate the set of end host, i, and j ∈ V, V indicate the set of network node, mp∈ W, W table
Show the set of network function,For 0-1 variable, 0 value is taken to indicate the flow T of terminal s to terminal tstWithout network node i, take
The flow T of 1 value expression terminal s to terminal tstBy network node i,For 0-1 variable, 0 value is taken to indicate at network node i not
Use network function mpHandle the flow T from terminal s to terminal tst, 1 value is taken to indicate to use network function m at network node ipPlace
Manage the flow T from terminal s to terminal tst,Indicate network function mpDeployment sequence in functional sequence,WithRespectively
Indicate auxiliary variable,For 0-1 variable, 0 value is taken to indicate the flow T of terminal s to terminal tstWithout network link (i, j), take
The flow T of 1 value expression terminal s to terminal tstBy network link (i, j), N indicates the integer more than or equal to zero, mq∈ W,
Indicate network function mqDeployment sequence in functional sequence,For 0-1 variable, 0 value is taken to indicate that net is not used at network node i
Network function mqHandle the flow T from terminal s to terminal tst, 1 value is taken to indicate to use network function m at network node iqIt handles from end
Hold the flow T of s to terminal tst,Indicate network function mpHandle the flow T from terminal s to terminal tstThe calculating of required consumption
Resource, BiIndicate computing resource total at network node i, M indicates the maximum value that can be indicated in computer, and K expression is deployed with net
The sum of the node of network service, ziFor 0-1 variable, takes 0 value to indicate not disposing any network service at network node i, take 1 value table
Show and is deployed with network service at network node i.
Optionally, the optimization aim are as follows:
min(λ1L+λ2K)
Wherein, min (*) expression is minimized, and L indicates that network link (i, j) uses the upper bound of network link bandwidth resources,
K indicates the sum for being deployed with the node of network service, λ1With λ2For administrator or the parameter of application setting, and λ1+λ2=1.
Optionally, the method also includes:
The increased feelings of processing capacity needed for the variation of network service regulation or network service of the network service
Under condition, the Web Service Deployment node, and network flow path described in incremental update are adjusted.
Correspondingly, the present invention also provides a kind of resource layout devices of network service.Described device includes:
Description unit obtains opening up with the network for carrying out formalized description respectively to network topology and network service
Flutter corresponding first model and the second model corresponding with network service；
Constraint element, for according to first model and second model difference constraint network flow path and network
Service arrangement node；
Determination unit, for according to the constraint of the network flow path and Web Service Deployment node determination
The optimization aim of the resource layout of network service；
Optimize unit and obtains the network service for optimizing according to the optimization aim using greedy algorithm
Resource layout result.
Optionally, first model are as follows:
G=(V, E, C)
Wherein, G indicates the network topology, and V indicates the set of network node, and E indicates the set of network link, and C is indicated
The set of terminal flow bandwidth.
Optionally, second model are as follows:
Wherein, DstIndicate the flow T of terminal s to terminal tstCorresponding network service,Indicate network function miIn function
Deployment sequence in sequence, N indicate that the integer more than or equal to zero, s, t ∈ H, H indicate the set of end host, and n expression is greater than
Or the integer equal to 1.
As shown from the above technical solution, formalized description is carried out respectively to network topology and network service, obtain with it is described
Corresponding first model of network topology and the second model corresponding with network service；And according to first model and described
Second model distinguishes constraint network flow path and Web Service Deployment node；Further according to the network flow path and the net
The constraint of network service arrangement node determines the optimization aim of the resource layout of the network service；It is adopted further according to the optimization aim
It is optimized with greedy algorithm, obtains the resource layout of the network service as a result, not only having planned network flow path, but also determined
Web Service Deployment node, can be realized the high usage of computing resource and the load balancing of link bandwidth resource, to drop
The multipoint fault probability of low network service, and avoid generating the congestion of network link.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described.It should be evident that the accompanying drawings in the following description is only this
Some embodiments of invention for those of ordinary skill in the art without creative efforts, can be with
Other attached drawings are obtained according to these figures.
Fig. 1 is the flow chart of the resource method of combination for the network service that one embodiment of the invention provides；
Fig. 2 is the schematic diagram for the network topology that one embodiment of the invention provides；
Fig. 3 is the schematic diagram for the network service regulation that one embodiment of the invention provides；
Fig. 4 is the structural schematic diagram of the resource layout device for the network service that one embodiment of the invention provides；
Fig. 5 is the structural schematic diagram of the resource layout device for the network service that further embodiment of this invention provides.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
Fig. 1 is the flow chart of the resource method of combination for the network service that one embodiment of the invention provides.As shown in Figure 1, this
The resource method of combination of network service for inventing embodiment offer includes:
In step s101, formalized description is carried out to network topology and network service respectively, obtains opening up with the network
Flutter corresponding first model and the second model corresponding with network service.
Wherein, first model are as follows:
G=(V, E, C)
Wherein, G indicates the network topology, and V indicates the set of network node, and E indicates the set of network link, and C is indicated
The set of terminal flow bandwidth.
Wherein, second model are as follows:
Wherein, DstIndicate the flow T of terminal s to terminal tstCorresponding network service,Indicate network function miIn function
Deployment sequence in sequence, N indicate that the integer more than or equal to zero, s, t ∈ H, H indicate the set of end host, and n expression is greater than
Or the integer equal to 1.
Specifically, network topology includes host distribution, forwarding device distribution and network link bandwidth.To network topology form
Change is described as G=(V, E, C), and V is the set of network node, and E is the set of network link,GC group connector host
Set, C be terminal flow bandwidth set.Network service is related to firewall, intrusion detection, traffic statistics and application proxy etc.
Multiple network function, heterogeneous networks function are combined into user by particular sequence group and provide network service.Form is carried out to network service
Change description, network function set W={ m can be obtained1,m2,…,mn, the flow T of terminal s to terminal tst(s, t ∈ H) corresponding network
Service isRepresent network function miDeployment in functional sequence is suitable
Sequence,Value hour sequence preceding,0 value is taken to indicate TstNot by network function miIt is handled.
Then, in step s 102, constraint network flow path is distinguished according to first model and second model
With Web Service Deployment node.
Wherein, the constraint in the network flow path are as follows:
Wherein, s, t ∈ H, H indicate the set of end host, i, and j ∈ V, V indicate the set of network node, (i, j) ∈ E, E
Indicate the set of network link,For 0-1 variable, 0 value is taken to indicate the flow T of terminal s to terminal tstWithout network link
(i, j) takes 1 value to indicate the flow T of terminal s to terminal tstBy network link (i, j), k ∈ V, (j, k) ∈ E,For 0-1 change
Amount takes 0 value to indicate the flow T of terminal s to terminal tstWithout network link (j, k), 1 value is taken to indicate the stream of terminal s to terminal t
Measure TstBy network link (j, k),For 0-1 variable, 0 value is taken to indicate the flow T of terminal s to terminal tstWithout network section
Point i takes 1 value to indicate the flow T of terminal s to terminal tstBy network node i, max (*, *) indicates larger among two values
Value, (j, i) ∈ E,For 0-1 variable, 0 value is taken to indicate the flow T of terminal s to terminal tstWithout network link (j, i), 1 is taken
Value indicates the flow T of terminal s to terminal tstBy network link (j, i), CstIndicate the flow T of terminal s to terminal tstIt is occupied
Network link bandwidth resources, L indicate network link (i, j) use network link bandwidth resources the upper bound.
Wherein, the constraint of the Web Service Deployment node are as follows:
Wherein, s, t ∈ H, H indicate the set of end host, i, and j ∈ V, V indicate the set of network node, mp∈ W, W table
Show the set of network function,For 0-1 variable, 0 value is taken to indicate the flow T of terminal s to terminal tstWithout network node i, take
The flow T of 1 value expression terminal s to terminal tstBy network node i,For 0-1 variable, 0 value is taken to indicate at network node i not
Use network function mpHandle the flow T from terminal s to terminal tst, 1 value is taken to indicate to use network function m at network node ipPlace
Manage the flow T from terminal s to terminal tst,Indicate network function mpDeployment sequence in functional sequence,WithRespectively
Indicate auxiliary variable,For 0-1 variable, 0 value is taken to indicate the flow T of terminal s to terminal tstWithout network link (i, j), take
The flow T of 1 value expression terminal s to terminal tstBy network link (i, j), N indicates the integer more than or equal to zero, mq∈ W,
Indicate network function mqDeployment sequence in functional sequence,For 0-1 variable, 0 value is taken to indicate that net is not used at network node i
Network function mqHandle the flow T from terminal s to terminal tst, 1 value is taken to indicate to use network function m at network node iqIt handles from end
Hold the flow T of s to terminal tst,Indicate network function mpHandle the flow T from terminal s to terminal tstThe calculating of required consumption
Resource, BiIndicate computing resource total at network node i, M indicates the maximum value that can be indicated in computer, and K expression is deployed with net
The sum of the node of network service, ziFor 0-1 variable, takes 0 value to indicate not disposing any network service at network node i, take 1 value table
Show and is deployed with network service at network node i.
Specifically, for the constraint in network flow path, the flow between setting terminal is unipath and acyclic.For net
The constraint of network service arrangement node, network service meet isotonicity and uniqueness.In addition, by introducing auxiliary variable, to network
Service arrangement joint constraint is modeled, and auxiliary variable is incremented by order-preserving, service rule with network flow from source node to destination node
Functional parameter and the same sequence of auxiliary variable then.
And then, in step s 103, according to the constraint in the network flow path and the Web Service Deployment node
Determine the optimization aim of the resource layout of the network service.
Wherein, the optimization aim are as follows:
min(λ1L+λ2K)
Wherein, min (*) expression is minimized, and L indicates that network link (i, j) uses the upper bound of network link bandwidth resources,
K indicates the sum for being deployed with the node of network service, λ1With λ2For administrator or the parameter of application setting, and λ1+λ2=1.
Specifically, the resource layout of network service need to meet a variety of optimization aims, for the load for realizing network link flow
Equilibrium has Lmin, that is, the maximum load of network link is minimized, for the resource utilization for improving network service node, avoids dispersing
Node deployment increases failure rate, there is Kmin, that is, minimize the sum of Web Service Deployment node.
Single-object problem, optimization aim are converted by multi-objective optimization question are as follows:
min(λ1L+λ2K)
Wherein, λ1With λ2For administrator or the parameter of application setting, default λ when not manually setting1=Kmin/(Lmin+
Kmin), λ2=Lmin/(Lmin+Kmin), LminWith KminBy being minimized in each comfortable single-object problem.
Finally, optimizing according to the optimization aim using greedy algorithm in step S104, the network clothes are obtained
The resource layout result of business.
Specifically, the process optimized using greedy algorithm is as follows:
S1, the network service regulation set for initializing non-layout, include all input rules, and every rule specifies certain two end
Logical network service sequences needed for flow between end.The network service regulation set of layout is initialized, is empty set.
If the network service regulation collection of S2, non-layout are combined into sky, step S12 is gone to, otherwise chooses the network clothes of non-layout
Required network service center in regular collection of being engaged in manages the least rule r of ability.
S3, sequentially successively the network in selection rule r services m.
S4, selection have been deployed with the node that remaining computing resource is most in the node of network service, and on-premise network services m,
If feasible, S7 is gone to, otherwise deployment conditions are not satisfied in the surplus resources of existing deployment node.
S5, the node that computing resource is most in the node of non-on-premise network service is chosen, on-premise network services m, if feasible,
S7 is gone to, else rule r can not be disposed.
S6, regular r is labeled as not disposing being put into layout set, goes to S2.
S7, circulation step S3-S6 are all determined until the deployment node of the network service in regular r.
S8, the deployment node composition sequence P by network service in regular r, by the source terminal s and purpose terminal in regular r
T is separately added into the head and the tail of sequence P.
S9, the successively network node in selection sequence P are to (pi,pi+1) i=1,2 ..., | P | -1.
S10, network node p is choseniTo node pi+1All paths in the network link road that has used bandwidth resources minimum
Diameter disposes corresponding forward rule.
S11, circulation step S9-S10 go to step S2 until having path reachable between all-network node pair in sequence P.
S12, the Web Service Deployment node of all input rules and corresponding network flow path are determining, the money of network service
Source layout is completed.
Preferably, the method also includes: the network service network service regulation variation or the network service
In the increased situation of required processing capacity, the Web Service Deployment node, and network flow road described in incremental update are adjusted
Diameter.Whereby, the dynamic expansion of network service is supported
Specifically, the resource method of combination of network service provided in this embodiment being capable of adaptive resource constraint and service rule
Variation then, dynamic update deployment result.In terms of resource constraint, when the network service center reason ability for disposing rule consumption increases
Add, is more than the current deployment node processing power upper limit, new deployment node can be chosen according to step S4-S5, according to step S10
Choose the forward-path after updating in network node and sequence between adjacent deployment node.In terms of service regulation, there are modification, increase
Adduction deletes three kinds of situations of service regulation, is the forward rule and deployment node for deleting corresponding deployment for deleting service regulation
On network service resource, handle for increasing service regulation according to step S3-S11, for alteration ruler using deleting
Former service regulation and new modified two step of service regulation of increase are completed.
The present embodiment is obtained and the network topology by carrying out formalized description respectively to network topology and network service
Corresponding first model and the second model corresponding with network service；And according to first model and second model
Constraint network flow path and Web Service Deployment node respectively；Further according to the network flow path and the network service department
Affix one's name to the optimization aim of the resource layout of the determining network service of constraint of node；It is calculated further according to the optimization aim using greedy
Method optimizes, and obtains the resource layout of the network service as a result, not only having planned network flow path, but also has been determined that network takes
Business deployment node, can be realized the high usage of computing resource and the load balancing of link bandwidth resource, to reduce network clothes
The multipoint fault probability of business, and avoid generating the congestion of network link.
Fig. 2 is the schematic diagram for the network topology that one embodiment of the invention provides.Fig. 3 is the net that one embodiment of the invention provides
The schematic diagram of network service regulation.In conjunction with Fig. 2 and Fig. 3, specific embodiments of the present invention will be described in further detail.In Fig. 2
Network topology and Fig. 3 in network service regulation can be applied in cloud data center, carrier network and enterprise network.Fig. 2
In include 4 terminals H1-H4,6 forwarding device SW1-SW6, wherein at SW5 and SW6 in the processing capacity of on-premise network service
The computing capability upper limit for being limited to on-premise network service at 10, SW1-SW4 is 8.As shown in figure 3, the flow for H1 to H2 provides peace
The functions such as full inspection survey, firewall FW and intrusion detection IDS, the uninterrupted of H1 to H2 are 1, need the processing capacity of FW and IDS
Respectively 2 and 3；Safety detection and network acceleration service are provided for H1 to H3 flow, FW and IDS and agent functionality Proxy, H1
Uninterrupted to H3 is 2, and needing the processing capacity of FW and IDS is 4 and 6, and the processing capacity of Proxy is 3；For H1 to H4 flow
Network acceleration service is provided, the uninterrupted of Proxy, H1 to H4 are that 4, Proxy processing capacity is 6.
Thus it obtains, network topology are as follows:
G=(V, E, C)
V={ H1, H2, H3, H4, S1, S2, S3, S4, S5, S6 }
H={ H1, H2, H3, H4 }
E=(H1, S1), (S1, S2), (S1, S5), (S5, S6), (S6, S2), (S6, S4), (S3, S4), (S3, S5),
(H2, S2), (H3, S3), (H4, S4) },
C={ CH1H2=1, CH1H3=2, CH1H4=4 }
Wherein, CH1H2Indicate terminal H1To terminal H2The occupied network link bandwidth resources of flow, CH1H3Indicate terminal
H1To terminal H3The occupied network link bandwidth resources of flow, CH1H4Indicate terminal H1To terminal H4The occupied net of flow
Network link bandwidth resource.
Thus it obtains, network service are as follows:
W={ m1=FW, m2=IDS, m3=Proxy }
Network service regulation
Network service regulation
Network service regulation
Wherein, DstIndicate the flow T of terminal s to terminal tstCorresponding network service,Indicate network function miIn function
Deployment sequence in sequence.
Thus it obtains, the constraint in network flow path are as follows:
Thus it obtains, the constraint of Web Service Deployment node are as follows:
Thus it obtains, optimization aim are as follows:
min0.2L+0.8K
Thus it obtains, using the optimization process of greedy algorithm specifically:
L1, the non-layout network service regulation set Φ={ D of initializationH1H2,DH1H3,DH1H4, layout network service regulation
Set
If L2, Φ are sky, step L12 is gone to, required network service center in Φ is otherwise chosen and manages the least rule r of ability,
D is chosen firstH1H2。
L3, sequentially successively the network in selection rule r services m, to DH1H2, successively choose FW and IDS.
L4, selection have been deployed with the network node that remaining computing resource is most in the node of network service, on-premise network clothes
Business m goes to L7 if feasible, and otherwise deployment conditions are not satisfied in the surplus resources of existing deployment node, to DH1H2In FW without existing
There is deployment node to carry out in next step, to DH1H2In IDS existing deployment node SW5 surplus resources be up to 8 and (be deployed with DH1H2
FW), IDS can be disposed.
L5, the node that resource is most in the node of non-on-premise network service is chosen, on-premise network service m is gone to if feasible
L7, else rule r can not be disposed, to DH1H2In FW choose node SW5.
L6, regular r is labeled as not disposing being put into layout set, goes to L2.
L7, circulation step L3-L6 are all determined until the deployment node of the network service in regular r.
L8, the deployment node composition sequence P by network service in regular r, by the source terminal s and purpose terminal in regular r
T is separately added into the head and the tail of sequence P, to DH1H2,
L9, the successively node in selection sequence P are to (pi,pi+1) i=1,2 ..., | P | -1, it is rightNode to for
(H1,SW5FW)(SW5FW,W5IDS)(W5IDS,H2)。
L10, network node p is choseniTo node pi+1All paths in the network link road that has used bandwidth resources minimum
Diameter disposes corresponding forward rule, (H1, SW5FW) path be H1-SW1-SW5, (SW5FW,SW5IDS) path be SW5.
L11, circulation step L9-L10 go to L2 until having path reachable between nodes pair all in sequence P.
L12, the Web Service Deployment node of all input rules and corresponding network flow path are determining, the money of network service
Source layout is completed.
The resource method of combination of network service provided in this embodiment is capable of the change of adaptive resource constraint and service regulation
Change, dynamic updates deployment result.In terms of resource constraint, when the network service center reason ability increase for disposing rule consumption, surpass
The node processing power upper limit is disposed before excessive, new deployment node can be chosen according to step L4-L5, is chosen according to step L10
Forward-path after update in network node and sequence between adjacent deployment node.In terms of service regulation, there are modification, increase and
Three kinds of situations of service regulation are deleted, are in the forward rule and deployment node for delete corresponding deployment for deleting service regulation
Network service resource is handled for increasing service regulation according to step L3-L11, and alteration ruler is taken using original is deleted
Business rule and new modified two step of service regulation of increase are completed.
The embodiment of the present invention is based on software defined network and network function virtualization technology, to make computer network to user
Multiple network service is provided, by carrying out joint modeling to network topology and network service sequences, to network link bandwidth resources
With the computing resource progress layout for supporting Web Service Deployment, planning network flow path determines Web Service Deployment node, real
The high usage of existing computing resource and the load balancing of link bandwidth resource.
In a particular embodiment, the embodiment of the present invention can be applied to carrier network, data center network and
It in enterprise network, is provided for user and stablizes expansible network service, optimize network link loads, save network operation cost.
For embodiment of the method, for simple description, therefore, it is stated as a series of action combinations, but this field
Technical staff should be aware of, and embodiment of that present invention are not limited by the describe sequence of actions, because implementing according to the present invention
Example, some steps may be performed in other sequences or simultaneously.Secondly, those skilled in the art should also know that, specification
Described in embodiment belong to preferred embodiment, the actions involved are not necessarily necessary for embodiments of the present invention.
Fig. 4 is the structural schematic diagram of the resource layout device for the network service that one embodiment of the invention provides.Such as Fig. 4 institute
Show, the resource layout device for the network service that one embodiment of the invention provides includes description unit 201, constraint element 202, determines
Unit 203 and optimization unit 204, in which:
Description unit 201 obtains and the network for carrying out formalized description respectively to network topology and network service
Topologically corresponding first model and the second model corresponding with network service；
Constraint element 202, for according to first model and second model difference constraint network flow path and
Web Service Deployment node；
Determination unit 203, for being determined according to the constraint of the network flow path and the Web Service Deployment node
The optimization aim of the resource layout of the network service；
Optimize unit 204 and obtains the network service for optimizing according to the optimization aim using greedy algorithm
Resource layout result.
The resource layout device of network service provided in this embodiment is suitable for the corresponding network service of above embodiments
Resource method of combination, details are not described herein.
The present embodiment provides a kind of resource layout devices of network service, describe unit 201 and are used for network topology and net
Network service carries out formalized description respectively, obtains the first model corresponding with the network topology and corresponding with the network service
The second model；Constraint element 202 is used to distinguish constraint network flow path according to first model and second model
With Web Service Deployment node；Determination unit 203 is used for according to the network flow path and the Web Service Deployment node
Constraint determine the network service resource layout optimization aim；Optimization unit 204 according to the optimization aim for adopting
It is optimized with greedy algorithm, obtains the resource layout of the network service as a result, not only having planned network flow path, but also determined
Web Service Deployment node, can be realized the high usage of computing resource and the load balancing of link bandwidth resource, to drop
The multipoint fault probability of low network service, and avoid generating the congestion of network link.
In an alternate embodiment of the present invention, first model are as follows:
G=(V, E, C)
Wherein, G indicates the network topology, and V indicates the set of network node, and E indicates the set of network link, and C is indicated
The set of terminal flow bandwidth.
In an alternate embodiment of the present invention, second model are as follows:
Wherein, DstIndicate the flow T of terminal s to terminal tstCorresponding network service,Indicate network function miIn function
Deployment sequence in sequence, N indicate that the integer more than or equal to zero, s, t ∈ H, H indicate the set of end host, and n expression is greater than
Or the integer equal to 1.
Fig. 5 is the structural schematic diagram of the resource layout device for the network service that further embodiment of this invention provides.Such as Fig. 5 institute
Show, the resource layout device of the network service includes: processor (processor) 301, memory (memory) 302 and leads to
Believe bus 304；
Wherein, the processor 301, memory 302 complete mutual communication by the communication bus 304；
The processor 301 is used to call the program instruction in the memory 302, to execute above-mentioned each method embodiment
Provided method, for example, formalized description is carried out to network topology and network service respectively, obtains opening up with the network
Flutter corresponding first model and the second model corresponding with network service；According to first model and second model
Constraint network flow path and Web Service Deployment node respectively；According to the network flow path and the Web Service Deployment
The constraint of node determines the optimization aim of the resource layout of the network service；According to the optimization aim using greedy algorithm into
Row optimization, obtains the resource layout result of the network service.
The present embodiment discloses a kind of computer program product, and the computer program product includes being stored in non-transient calculating
Computer program on machine readable storage medium storing program for executing, the computer program include program instruction, when described program instruction is calculated
When machine executes, computer is able to carry out method provided by above-mentioned each method embodiment, for example, to network topology and network
Service carries out formalized description respectively, obtains and corresponding first model of the network topology and corresponding with network service
Second model；According to first model and second model difference constraint network flow path and Web Service Deployment section
Point；The resource layout of the network service is determined according to the constraint of the network flow path and the Web Service Deployment node
Optimization aim；It is optimized according to the optimization aim using greedy algorithm, obtains the resource layout knot of the network service
Fruit.
The present embodiment provides a kind of non-transient computer readable storage medium, the non-transient computer readable storage medium
Computer instruction is stored, the computer instruction makes the computer execute method provided by above-mentioned each method embodiment, example
Such as include: that formalized description is carried out respectively to network topology and network service, obtains the first mould corresponding with the network topology
Type and the second model corresponding with network service；Constraint network stream is distinguished according to first model and second model
Measure path and Web Service Deployment node；It is determined according to the constraint of the network flow path and the Web Service Deployment node
The optimization aim of the resource layout of the network service；It is optimized according to the optimization aim using greedy algorithm, obtains institute
State the resource layout result of network service.
Those of ordinary skill in the art will appreciate that: realize that all or part of the steps of above method embodiment can pass through
The relevant hardware of program instruction is completed, and program above-mentioned can be stored in a computer readable storage medium, the program
When being executed, step including the steps of the foregoing method embodiments is executed；And storage medium above-mentioned includes: ROM, RAM, magnetic disk or light
The various media that can store program code such as disk.
The embodiments such as base station described above are only schematical, wherein the unit as illustrated by the separation member
It may or may not be physically separated, component shown as a unit may or may not be physics list
Member, it can it is in one place, or may be distributed over multiple network units.It can be selected according to the actual needs
In some or all of the modules achieve the purpose of the solution of this embodiment.Those of ordinary skill in the art are not paying creativeness
Labour in the case where, it can understand and implement.
Through the above description of the embodiments, those skilled in the art can be understood that each embodiment can
It realizes by means of software and necessary general hardware platform, naturally it is also possible to pass through hardware.Based on this understanding, on
Stating technical solution, substantially the part that contributes to existing technology can be embodied in the form of software products in other words, should
Computer software product may be stored in a computer readable storage medium, such as ROM/RAM, magnetic disk, CD, including several fingers
It enables and using so that a computer equipment (can be personal computer, server or the network equipment etc.) executes each implementation
Method described in certain parts of example or embodiment.
Finally, it should be noted that the above various embodiments is only to illustrate the technical solution of the embodiment of the present invention, rather than it is right
It is limited；Although the embodiment of the present invention is described in detail referring to foregoing embodiments, the ordinary skill of this field
Personnel are it is understood that it is still possible to modify the technical solutions described in the foregoing embodiments, or to part
Or all technical features are equivalently replaced；And these are modified or replaceed, it does not separate the essence of the corresponding technical solution
The range of each embodiment technical solution of the embodiment of the present invention.
Claims (3)
1. a kind of resource method of combination of network service, which is characterized in that the described method includes:
Formalized description is carried out respectively to network topology and network service, obtain the first model corresponding with the network topology and
The second model corresponding with network service；
According to first model and second model difference constraint network flow path and Web Service Deployment node；
Determine that the resource of the network service is compiled according to the constraint of the network flow path and the Web Service Deployment node
The optimization aim of row；
It is optimized according to the optimization aim using greedy algorithm, obtains the resource layout result of the network service；
Wherein, first model are as follows:
G=(V, E, C)
Wherein, G indicates the network topology, and V indicates the set of network node, and E indicates the set of network link, and C indicates terminal
The set of flow bandwidth；
Wherein, second model are as follows:
Wherein, DstIndicate the flow T of terminal s to terminal tstCorresponding network service,Indicate network function miIn functional sequence
In deployment sequence, N indicates to be greater than or equal to zero integer, s, t ∈ H, and H indicates the set of end host, and n expression is greater than or waits
In 1 integer；
Wherein, the constraint in the network flow path are as follows:
Wherein, s, t ∈ H, H indicate the set of end host, i, and j ∈ V, V indicate the set of network node, (i, j) ∈ E, E expression
The set of network link,For 0-1 variable, 0 value is taken to indicate the flow T of terminal s to terminal tstWithout network link (i, j),
1 value is taken to indicate the flow T of terminal s to terminal tstBy network link (i, j), k ∈ V, (j, k) ∈ E,For 0-1 variable, 0 is taken
Value indicates the flow T of terminal s to terminal tstWithout network link (j, k), 1 value is taken to indicate the flow T of terminal s to terminal tst
By network link (j, k),For 0-1 variable, 0 value is taken to indicate the flow T of terminal s to terminal tstWithout network node i,
1 value is taken to indicate the flow T of terminal s to terminal tstThe larger value among two values is indicated by network node i, max (*, *),
(j, i) ∈ E,For 0-1 variable, 0 value is taken to indicate the flow T of terminal s to terminal tstWithout network link (j, i), 1 value is taken
Indicate the flow T of terminal s to terminal tstBy network link (j, i), CstIndicate the flow T of terminal s to terminal tstIt is occupied
Network link bandwidth resources, L indicate that network link (i, j) uses the upper bound of network link bandwidth resources；
Wherein, the constraint of the Web Service Deployment node are as follows:
Wherein, s, t ∈ H, H indicate the set of end host, i, and j ∈ V, V indicate the set of network node, mp∈ W, W indicate network
The set of function,For 0-1 variable, 0 value is taken to indicate the flow T of terminal s to terminal tstWithout network node i, 1 value table is taken
Show the flow T of terminal s to terminal tstBy network node i,For 0-1 variable, 0 value is taken to indicate that net is not used at network node i
Network function mpHandle the flow T from terminal s to terminal tst, 1 value is taken to indicate to use network function m at network node ipIt handles from end
Hold the flow T of s to terminal tst,Indicate network function mpDeployment sequence in functional sequence,WithIt respectively indicates auxiliary
Variable is helped,For 0-1 variable, 0 value is taken to indicate the flow T of terminal s to terminal tstWithout network link (i, j), 1 value table is taken
Show the flow T of terminal s to terminal tstBy network link (i, j), N indicates the integer more than or equal to zero, mq∈ W,It indicates
Network function mqDeployment sequence in functional sequence,For 0-1 variable, 0 value is taken to indicate uses no network function at network node i
It can mqHandle the flow T from terminal s to terminal tst, 1 value is taken to indicate to use network function m at network node iqIt handles from terminal s
To the flow T of terminal tst,Indicate network function mpHandle the flow T from terminal s to terminal tstThe calculating of required consumption provides
Source, BiIndicate computing resource total at network node i, M indicates the maximum value that can be indicated in computer, and K expression is deployed with network
The sum of the node of service, ziFor 0-1 variable, takes 0 value to indicate not disposing any network service at network node i, 1 value is taken to indicate
Network service is deployed at network node i；
Wherein, the optimization aim are as follows:
min(λ1L+λ2K)
Wherein, min (*) expression is minimized, and L indicates that network link (i, j) uses the upper bound of network link bandwidth resources, K table
Show the sum for being deployed with the node of network service, λ1With λ2For administrator or the parameter of application setting, and λ1+λ2=1.
2. the resource method of combination of network service according to claim 1, which is characterized in that the method also includes:
In the increased situation of processing capacity needed for the variation of network service regulation or network service of the network service,
Adjust the Web Service Deployment node, and network flow path described in incremental update.
3. a kind of resource layout device of network service, which is characterized in that described device includes:
Description unit obtains and the network topology pair for carrying out formalized description respectively to network topology and network service
The first model and the second model corresponding with network service answered；
Constraint element, for according to first model and second model difference constraint network flow path and network service
Dispose node；
Determination unit, for determining the network according to the constraint in the network flow path and the Web Service Deployment node
The optimization aim of the resource layout of service；
Optimize unit and obtains the resource of the network service for optimizing according to the optimization aim using greedy algorithm
Layout result；
Wherein, first model are as follows:
G=(V, E, C)
Wherein, G indicates the network topology, and V indicates the set of network node, and E indicates the set of network link, and C indicates terminal
The set of flow bandwidth；
Wherein, second model are as follows:
Wherein, DstIndicate the flow T of terminal s to terminal tstCorresponding network service,Indicate network function miIn functional sequence
In deployment sequence, N indicates to be greater than or equal to zero integer, s, t ∈ H, and H indicates the set of end host, and n expression is greater than or waits
In 1 integer；
Wherein, the constraint in the network flow path are as follows:
Wherein, s, t ∈ H, H indicate the set of end host, i, and j ∈ V, V indicate the set of network node, (i, j) ∈ E, E expression
The set of network link,For 0-1 variable, 0 value is taken to indicate the flow T of terminal s to terminal tstWithout network link (i, j),
1 value is taken to indicate the flow T of terminal s to terminal tstBy network link (i, j), k ∈ V, (j, k) ∈ E,For 0-1 variable, 0 is taken
Value indicates the flow T of terminal s to terminal tstWithout network link (j, k), 1 value is taken to indicate the flow T of terminal s to terminal tst
By network link (j, k),For 0-1 variable, 0 value is taken to indicate the flow T of terminal s to terminal tstWithout network node i,
1 value is taken to indicate the flow T of terminal s to terminal tstThe larger value among two values is indicated by network node i, max (*, *),
(j, i) ∈ E,For 0-1 variable, 0 value is taken to indicate the flow T of terminal s to terminal tstWithout network link (j, i), 1 value is taken
Indicate the flow T of terminal s to terminal tstBy network link (j, i), CstIndicate the flow T of terminal s to terminal tstIt is occupied
Network link bandwidth resources, L indicate that network link (i, j) uses the upper bound of network link bandwidth resources；
Wherein, the constraint of the Web Service Deployment node are as follows:
Wherein, s, t ∈ H, H indicate the set of end host, i, and j ∈ V, V indicate the set of network node, mp∈ W, W indicate network
The set of function,For 0-1 variable, 0 value is taken to indicate the flow T of terminal s to terminal tstWithout network node i, 1 value table is taken
Show the flow T of terminal s to terminal tstBy network node i,For 0-1 variable, 0 value is taken to indicate that net is not used at network node i
Network function mpHandle the flow T from terminal s to terminal tst, 1 value is taken to indicate to use network function m at network node ipIt handles from end
Hold the flow T of s to terminal tst,Indicate network function mpDeployment sequence in functional sequence,WithRespectively indicate auxiliary
Variable,For 0-1 variable, 0 value is taken to indicate the flow T of terminal s to terminal tstWithout network link (i, j), 1 value is taken to indicate
The flow T of terminal s to terminal tstBy network link (i, j), N indicates the integer more than or equal to zero, mq∈ W,Indicate net
Network function mqDeployment sequence in functional sequence,For 0-1 variable, 0 value is taken to indicate uses no network function at network node i
mqHandle the flow T from terminal s to terminal tst, 1 value is taken to indicate to use network function m at network node iqProcessing from terminal s to
The flow T of terminal tst,Indicate network function mpHandle the flow T from terminal s to terminal tstThe computing resource of required consumption,
BiIndicate computing resource total at network node i, M indicates the maximum value that can be indicated in computer, and K expression is deployed with network service
Node sum, ziFor 0-1 variable, takes 0 value to indicate not disposing any network service at network node i, 1 value is taken to indicate network
Network service is deployed at node i；
Wherein, the optimization aim are as follows:
min(λ1L+λ2K)
Wherein, min (*) expression is minimized, and L indicates that network link (i, j) uses the upper bound of network link bandwidth resources, K table
Show the sum for being deployed with the node of network service, λ1With λ2For administrator or the parameter of application setting, and λ1+λ2=1.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610365924 | 2016-05-27 | ||
| CN2016103659240 | 2016-05-27 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106533966A CN106533966A (en) | 2017-03-22 |
| CN106533966B true CN106533966B (en) | 2019-05-14 |
Family
ID=58356115
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611031521.9A Active CN106533966B (en) | 2016-05-27 | 2016-11-18 | A kind of the resource method of combination and device of network service |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106533966B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107483286B (en) * | 2017-08-14 | 2021-01-26 | 电子科技大学 | Method for merging and deploying service function chain based on cloud-fog environment |
| CN107800571B (en) * | 2017-10-23 | 2019-11-22 | 清华大学 | A kind of network function dynamic method of combination, device and system |
| CN108600101B (en) * | 2018-03-21 | 2020-08-07 | 北京交通大学 | Network service cross-domain arrangement method aiming at end-to-end time delay performance optimization |
| CN108718246B (en) * | 2018-04-03 | 2021-03-16 | 华中科技大学 | Resource scheduling method and system oriented to network function virtualization |
| CN108737192B (en) * | 2018-06-01 | 2020-07-07 | 北京航空航天大学 | Network service deployment method based on service reliability |
| CN113381868A (en) * | 2020-03-09 | 2021-09-10 | 中国电信股份有限公司 | Network arranging method and device and computer readable storage medium |
| CN114584376B (en) * | 2022-03-04 | 2024-04-26 | 中电科网络空间安全研究院有限公司 | Traffic handling method, device, equipment and computer readable storage medium |
| CN117278403B (en) * | 2023-09-18 | 2024-05-24 | 之江实验室 | Incremental compiling method and system based on heterogeneous equipment |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101894152B (en) * | 2010-06-29 | 2012-07-04 | 华中师范大学 | Resource bundle-based learning content generating method |
| CN104917629B (en) * | 2015-04-14 | 2018-08-17 | 中国人民解放军信息工程大学 | First ability method of combination of more switching node collaborations |
| CN105281955B (en) * | 2015-10-27 | 2018-10-09 | 上海华为技术有限公司 | A kind of system, the method and device of business and resource layout |
-
2016
- 2016-11-18 CN CN201611031521.9A patent/CN106533966B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN106533966A (en) | 2017-03-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106533966B (en) | A kind of the resource method of combination and device of network service | |
| CN107666412B (en) | The virtual network function dispositions method of service function chain | |
| US7827557B2 (en) | Method and apparatus for allocating resources to applications using a linearized objective function | |
| Oljira et al. | A model for QoS-aware VNF placement and provisioning | |
| CN110392999A (en) | Virtual filter platform in distributed computing system | |
| Amiri et al. | Congestion-free rerouting of flows on dags | |
| Wu et al. | Efficient and consistent flow update for software defined networks | |
| US11855893B2 (en) | Tag-based cross-region segment management | |
| Leivadeas et al. | Balancing delay and cost in virtual network function placement and chaining | |
| JPWO2012141241A1 (en) | Network, data transfer node, communication method and program | |
| CN110086640A (en) | The enabled method and apparatus of business | |
| CN108718246A (en) | A kind of resource regulating method and system of network-oriented virtualization of function | |
| CN109412963A (en) | A kind of service function chain dispositions method split based on stream | |
| Chen et al. | An sdn-based fabric for flexible data-center networks | |
| US11799755B2 (en) | Metadata-based cross-region segment routing | |
| Li et al. | Virtual machine placement in cloudlet mesh | |
| CN113612688B (en) | Distributed software defined network control system and construction method thereof | |
| CN106936731A (en) | The method and apparatus of the message forwarding in software defined network SDN | |
| Pašić et al. | Minimum cost survivable routing algorithms for generalized diversity coding | |
| Sun et al. | AI-based survivable design for hybrid virtual networks for single regional failures in cloud data centers | |
| US11405284B1 (en) | Generating network link utilization targets using a packet-loss-versus-link utilization model | |
| CN110417576B (en) | Deployment method, device, equipment and storage medium of hybrid software custom network | |
| Shu | Heterogeneous networking architecture based on SDN | |
| Lemeshko et al. | Fast ReRoute Tensor Model with Quality of Service Protection Under Multiple Parameters | |
| JP5595342B2 (en) | Multiple path search method and apparatus |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | 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 |