CN106533966A - Network service resource arranging method and apparatus - Google Patents

Abstract

The invention provides a network service resource arranging method and apparatus and relates to the field of communication network. The method includes the steps of conducting formal description for network topology and network service to obtain a first model corresponding to the network topology and a second model corresponding to the network service, respectively constraining network flow paths and network service disposition nodes according to the first model and the second model, determining the optimization target of network service resource arrangement according to the constraint of the network flow paths and the network service disposition nodes, and employing a greedy algorithm for optimization according to the optimization target to obtain the result of network service resource arrangement. The resource utilization rate of network service nodes can be improved, the load balancing of network link flow can be realized, and dynamic expansion of network service resources can be supported.

Description

A kind of resource method of combination of network service and device

Technical field

The present invention relates to network communication technology field, in particular it relates to the resource method of combination and dress of a kind of network service Put.

Background technology

The function of computer network is divided into two main aspects of network-in-dialing and network service.Network-in-dialing refers to carry out Route selection, needs to realize that dynamic routing protocol guarantee is fault-tolerant in the face of network path Problem of Failure to connect different terminal equipment Property, limit in the face of network link bandwidth, need to carry out traffic engineering and adjust to avoid link congestion.Network service is carried for terminal device For four to seven layers of function services of network, the intermediate equipment of bearer network service is deployed between terminal device, what process was flowed through Customer flow.Network service can provide the functions such as safety detection, traffic statistics, network acceleration for terminal device.Network service leads to Functional sequence is often configured to, and the combination of multiple network service is provided according to given order.

Software defined network and network function virtualization are the developing important technologies of current network.Software defined network is By forwarding unit open interface and centralized Control in logic, the rule of correspondence is disposed in forwarding unit, realized to network traffics Precise control.Network function virtualization refers to operate in the network function of proprietary intermediate equipment using Intel Virtualization Technology On general processing platform, dynamically distributes and the extension of network function resource are realized.

Existing network service adopts static resource method of combination.Limited by hardware device closing, Web Service Deployment At gateway or network traffics convergence, by the disposal ability of intermediate equipment needed for assessment deployment point in advance, alignment processing is enabled The intermediate equipment of performance.Additionally, existing network service is by software defined network technology, it is possible to achieve the load of intermediate equipment It is balanced.For the intermediate equipment that static state is enabled, network traffics path can be selected by flow lead, make it is different in Between equipment process different user between network traffics, by network traffics according to consume disposal ability priority be evenly distributed on it is corresponding In intermediate equipment, it is possible to achieve the load balancing of intermediate equipment.

The resource method of combination of existing network service, by technology restriction, it is impossible to realize multiple-objection optimization, is specifically present such as Lower functional defect：

(1) static resource method of combination, is deployed at gateway node, and network traffics are big, need the centre of high disposal performance Equipment is supported, relatively costly.

(2) static resource method of combination, in network traffics sustainable growth, existing intermediate equipment cannot provide enough places During reason ability, need to carry out Longitudinal Extension, replace with the higher intermediate equipment of process performance, autgmentability is poor, upgrade cost is high.

(3) static resource method of combination, increased the consumption of link bandwidth using flow lead, not the money to link bandwidth Source is consumed into row constraint, there is a problem of producing link congestion.

The content of the invention

It is an object of the invention to provide the resource method of combination and device of a kind of network service.Wherein, methods described is wanted The technical problem of solution is：The multipoint fault probability of network service how is reduced, and avoids producing the congestion of network link.

To achieve these goals, the present invention provides a kind of resource method of combination of network service.Methods described includes：

Formalized description is carried out respectively to network topology and network service, the first mould corresponding with the network topology is obtained Type and the second model corresponding with the 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 traffics path and the Web Service Deployment node The optimization aim of source layout；

It is optimized using greedy algorithm according to the optimization aim, obtains the resource layout result of the network service.

Alternatively, first model is：

G=(V, E, C)

Wherein, G represents the network topology, and V represents the set of network node, and E represents the set of network link, and C is represented The set of terminal flow bandwidth.

Alternatively, second model is：

Wherein, D_stRepresent terminal s to the flow T of terminal t_stCorresponding network service,Represent network function m_iIn function Deployment order in sequence, N represent the integer more than or equal to zero, and s, t ∈ H, H represent the set of end host, and n is represented and is more than Or the integer equal to 1.

Alternatively, the network traffics path is constrained to：

Wherein, s, t ∈ H, H represent the set of end host, i, j ∈ V, and V represents the set of network node, (i, j) ∈ E, E The set of network link is represented,For 0-1 variables, take 0 value and represent terminal s to the flow T of terminal t_stWithout network link (i, j), takes 1 value and represents terminal s to the flow T of terminal t_stThrough network link (i, j), k ∈ V, (j, k) ∈ E,Become for 0-1 Amount, takes 0 value and represents terminal s to the flow T of terminal t_stWithout network link (j, k), take 1 value and represent terminal s to the stream of terminal t Amount T_stThrough network link (j, k),For 0-1 variables, take 0 value and represent terminal s to the flow T of terminal t_stWithout network section Point i, takes 1 value and represents terminal s to the flow T of terminal t_stThrough network node i, max (*, *) represents larger among two values Value, (j, i) ∈ E,For 0-1 variables, take 0 value and represent terminal s to the flow T of terminal t_stWithout network link (j, i), 1 is taken Value represents terminal s to the flow T of terminal t_stThrough network link (j, i), C_stRepresent terminal s to the flow T of terminal t_stIt is shared Network link bandwidth resources, L represents the upper bound of the network link (i, j) using network link bandwidth resources.

Alternatively, the Web Service Deployment node is constrained to：

Wherein, s, t ∈ H, H represent the set of end host, and i, j ∈ V, V represent the set of network node, m_p∈ W, W table Show the set of network function,For 0-1 variables, take 0 value and represent terminal s to the flow T of terminal t_stWithout network node i, take 1 value represents terminal s to the flow T of terminal t_stThrough network node i,For 0-1 variables, take 0 value and represent at network node i not Using network function m_pProcess the flow T from terminal s to terminal t_st, take 1 value and represent at network node i using network function m_pPlace Flow T of the reason from terminal s to terminal t_st,Represent network function m_pDeployment order in functional sequence,WithDifference table Show auxiliary variable,For 0-1 variables, take 0 value and represent terminal s to the flow T of terminal t_stWithout network link (i, j), 1 is taken Value represents terminal s to the flow T of terminal t_stThrough network link (i, j), N represents the integer more than or equal to zero, m_q∈ W, Represent network function m_qDeployment order in functional sequence,For 0-1 variables, take 0 value and represent unused net at network node i Network function m_qProcess the flow T from terminal s to terminal t_st, take 1 value and represent at network node i using network function m_qProcess from end Flow Ts of the end s to terminal t_st,Represent network function m_pProcess the flow T from terminal s to terminal t_stThe calculating of required consumption Resource, B_iComputing resource total at network node i is represented, the maximum that M can be represented in representing computer, K are represented and be deployed with net The sum of the node of network service, z_iFor 0-1 variables, take 0 value and represent and at network node i, do not dispose any network service, take 1 value table Show network service is deployed with network node i.

Alternatively, the optimization aim is：

min(λ₁L+λ₂K)

Wherein, min (*) represents and minimizes that L represents the upper bound of the network link (i, j) using network link bandwidth resources, K represents the sum of the node for being deployed with network service, λ₁With λ₂For keeper or the parameter of application setting, and λ₁+λ₂=1.

Alternatively, methods described also includes：

In the feelings that the disposal ability needed for the network service rule change of the network service or the network service increases Under condition, the Web Service Deployment node, and network traffics path described in incremental update are adjusted.

Correspondingly, the present invention also provides a kind of resource layout device of network service.Described device includes：

Description unit, for carrying out formalized description respectively to network topology and network service, obtains opening up with the network Flutter corresponding first model and the second model corresponding with the network service；

Constraint element, for according to first model and second model difference constraint network flow path and network Service arrangement node；

Determining unit, described in being determined according to the constraint of the network traffics path and the Web Service Deployment node The optimization aim of the resource layout of network service；

Optimization unit, for being optimized using greedy algorithm according to the optimization aim, obtains the network service Resource layout result.

Alternatively, first model is：

G=(V, E, C)

Wherein, G represents the network topology, and V represents the set of network node, and E represents the set of network link, and C is represented The set of terminal flow bandwidth.

Alternatively, second model is：

Wherein, D_stRepresent terminal s to the flow T of terminal t_stCorresponding network service,Represent network function m_iIn function Deployment order in sequence, N represent the integer more than or equal to zero, and s, t ∈ H, H represent the set of end host, and n is represented and is more 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 the 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 traffics path and the net The constraint of network service arrangement node determines the optimization aim of the resource layout of the network service；Adopt further according to the optimization aim It is optimized with greedy algorithm, obtains the resource layout result of the network service, both planned network traffics path, is determined again Web Service Deployment node, can realize the load balancing of the high usage and link bandwidth resource of computing resource, so as to drop The multipoint fault probability of low network service, and avoid producing the congestion of network link.

Description of the drawings

In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing Accompanying drawing to be used needed for having technology description is briefly described.It should be evident that drawings in the following description are only this Some embodiments of invention, for those of ordinary skill in the art, on the premise of not paying creative work, can be with Other accompanying drawings are obtained according to these figures.

Fig. 1 is the flow chart of the resource method of combination of the network service that one embodiment of the invention is provided；

Fig. 2 is the schematic diagram of the network topology that one embodiment of the invention is provided；

Fig. 3 is the schematic diagram of the network service rule that one embodiment of the invention is provided；

Fig. 4 is the structural representation of the resource layout device of the network service that one embodiment of the invention is provided；

Fig. 5 is the structural representation of the resource layout device of the network service that further embodiment of this invention is provided.

Specific embodiment

Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete Site preparation is described, it is clear that described embodiment is only a part of embodiment of the invention, rather than the embodiment of whole.It is based on Embodiment in the present invention, it is every other that those of ordinary skill in the art are obtained under the premise of creative work is not made Embodiment, belongs to the scope of protection of the invention.

Fig. 1 is the flow chart of the resource method of combination of the network service that one embodiment of the invention is provided.As shown in figure 1, this The resource method of combination for inventing the network service of embodiment offer includes：

In step S101, formalized description is carried out respectively to network topology and network service, obtains opening up with the network Flutter corresponding first model and the second model corresponding with the network service.

Wherein, first model is：

G=(V, E, C)

Wherein, G represents the network topology, and V represents the set of network node, and E represents the set of network link, and C is represented The set of terminal flow bandwidth.

Wherein, second model is：

Wherein, D_stRepresent terminal s to the flow T of terminal t_stCorresponding network service,Represent network function m_iIn function Deployment order in sequence, N represent the integer more than or equal to zero, and s, t ∈ H, H represent the set of end host, and n is represented and is more than Or the integer equal to 1.

Specifically, network topology includes main frame distribution, forwarding unit distribution and network link bandwidth.To network topology form Change is described as G=(V, E, C), and set of the V for network node, E are the set of network link,GC group connector main frame Set, C for terminal flow bandwidth set.Network service is related to fire wall, intrusion detection, traffic statistics and application proxy etc. Multiple network function, heterogeneous networks function provide the user network service by particular sequence combination.Form is carried out to network service Change description, network function set W={ m are obtained₁,m₂,…,m_n, the flow T of terminal s to terminal t_st(s, t ∈ H) map network Service and beRepresent network function m_iDeployment in functional sequence is suitable Sequence,Value hour order front,Take 0 value and represent T_stNot by network function m_iIt is handled.

Then, in step s 102, according to first model and second model difference constraint network flow path With Web Service Deployment node.

Wherein, the network traffics path is constrained to：

Wherein, s, t ∈ H, H represent the set of end host, i, j ∈ V, and V represents the set of network node, (i, j) ∈ E, E The set of network link is represented,For 0-1 variables, take 0 value and represent terminal s to the flow T of terminal t_stWithout network link (i, j), takes 1 value and represents terminal s to the flow T of terminal t_stThrough network link (i, j), k ∈ V, (j, k) ∈ E,Become for 0-1 Amount, takes 0 value and represents terminal s to the flow T of terminal t_stWithout network link (j, k), take 1 value and represent terminal s to the stream of terminal t Amount T_stThrough network link (j, k),For 0-1 variables, take 0 value and represent terminal s to the flow T of terminal t_stWithout network section Point i, takes 1 value and represents terminal s to the flow T of terminal t_stThrough network node i, max (*, *) represents larger among two values Value, (j, i) ∈ E,For 0-1 variables, take 0 value and represent terminal s to the flow T of terminal t_stWithout network link (j, i), 1 is taken Value represents terminal s to the flow T of terminal t_stThrough network link (j, i), C_stRepresent terminal s to the flow T of terminal t_stIt is shared Network link bandwidth resources, L represents the upper bound of the network link (i, j) using network link bandwidth resources.

Wherein, the Web Service Deployment node is constrained to：

Wherein, s, t ∈ H, H represent the set of end host, and i, j ∈ V, V represent the set of network node, m_p∈ W, W table Show the set of network function,For 0-1 variables, take 0 value and represent terminal s to the flow T of terminal t_stWithout network node i, take 1 value represents terminal s to the flow T of terminal t_stThrough network node i,For 0-1 variables, take 0 value and represent at network node i not Using network function m_pProcess the flow T from terminal s to terminal t_st, take 1 value and represent at network node i using network function m_pPlace Flow T of the reason from terminal s to terminal t_st,Represent network function m_pDeployment order in functional sequence,WithDifference table Show auxiliary variable,For 0-1 variables, take 0 value and represent terminal s to the flow T of terminal t_stWithout network link (i, j), 1 is taken Value represents terminal s to the flow T of terminal t_stThrough network link (i, j), N represents the integer more than or equal to zero, m_q∈ W, Represent network function m_qDeployment order in functional sequence,For 0-1 variables, take 0 value and represent unused net at network node i Network function m_qProcess the flow T from terminal s to terminal t_st, take 1 value and represent at network node i using network function m_qProcess from end Flow Ts of the end s to terminal t_st,Represent network function m_pProcess the flow T from terminal s to terminal t_stThe calculating of required consumption Resource, B_iComputing resource total at network node i is represented, the maximum that M can be represented in representing computer, K are represented and be deployed with net The sum of the node of network service, z_iFor 0-1 variables, take 0 value and represent and at network node i, do not dispose any network service, take 1 value table Show network service is deployed with network node i.

Specifically, for the constraint in network traffics 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.Additionally, by introducing auxiliary variable, to network Service arrangement joint constraint is modeled, and auxiliary variable is incremented by order-preserving, service rule from source node to destination node with network traffics Functional parameter then and the same sequence of auxiliary variable.

And then, in step s 103, the constraint according to the network traffics path and the Web Service Deployment node Determine the optimization aim of the resource layout of the network service.

Wherein, the optimization aim is：

min(λ₁L+λ₂K)

Wherein, min (*) represents and minimizes that L represents the upper bound of the network link (i, j) using network link bandwidth resources, K represents the sum of the node for being deployed with network service, λ₁With λ₂For keeper or the parameter of application setting, and λ₁+λ₂=1.

Specifically, the resource layout of network service need to meet various optimization aims, be the load for realizing network link flow Equilibrium, has L_min, that is, the maximum load of network link is minimized, is the resource utilization for improving network service node, it is to avoid dispersion Node deployment increases fault rate, has K_min, that is, minimize the sum of Web Service Deployment node.

Multi-objective optimization question is converted into into single-object problem, optimization aim is：

min(λ₁L+λ₂K)

Wherein, λ₁With λ₂For keeper or the parameter of application setting, default λ when not manually setting₁=K_min/(L_min+ K_min), λ₂=L_min/(L_min+K_min), L_minWith K_minBy taking minimum of a value in each comfortable single-object problem.

Finally, in step S104, it is optimized using greedy algorithm according to the optimization aim, obtains the network clothes The resource layout result of business.

Specifically, the process being optimized using greedy algorithm is as follows：

S1, the network service regular collection for initializing non-layout, comprising all input rules, often rule specifies certain two end Logical network service sequences needed for flow between end.The network service regular collection of initialization layout, is empty set.

If S2, the network service regular collection of non-layout are sky, step S12 is gone to, otherwise choose the network clothes of non-layout Network service needed for business regular collection processes the minimum regular r of ability.

S3, network service m sequentially successively in selection rule r.

S4, selection have been deployed with the most node of remaining computing resource in the node of network service, and on-premise network services m, If feasible, S7 is gone to, the otherwise surplus resources of existing deployment node are unsatisfactory for deployment conditions.

The most node of computing resource in S5, the node of the non-on-premise network service of selection, on-premise network service m, if feasible, S7 is gone to, else rule r cannot be disposed.

S6, regular r is labeled as disposing it is put in layout set, goes to S2.

The deployment node of the network service of S7, circulation step S3-S6 in regular r all determines.

S8, by the deployment node composition sequence P of network service in regular r, by source terminal s and purpose terminal in regular r T, is separately added into the head and the tail of sequence P.

Network node in S9, successively selection sequence P is to (p_i,p_i+1) i=1,2 ..., | P | -1.

S10, selection network node p_iTo node p_i+1All paths in network link using the minimum road of bandwidth resources Footpath, deployment correspondence forwarding rule.

S11, circulation step S9-S10 have path reachable between all-network node pair in sequence P, go to step S2.

The determination of S12, the Web Service Deployment node of all input rules and corresponding network flow path, the money of network service Source layout is completed.

Preferably, methods described also includes：In the change of network service rule or the network service of the network service In the case that required disposal ability increases, the Web Service Deployment node, and network traffics road described in incremental update are adjusted Footpath.Thereby, support the dynamic expansion of network service

Specifically, the resource method of combination of the network service that the present embodiment is provided being capable of adaptive resource constraint and service rule Change then, dynamic update deployment result.In terms of resource constraint, increase when the network service that disposed rule is consumed processes ability Plus, 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 between the deployment node adjacent with sequence of network node after updating.In terms of service regulation, there is modification, increase Plus and delete three kinds of situations of service regulation, for delete service regulation delete correspondence deployment forwarding rule and deployment node On network service resource, for increasing service regulation according to the process of step S3-S11, for alteration ruler is using deleting Former service regulation and new two step of amended 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 the network service；And according to first model and second model Difference constraint network flow path and Web Service Deployment node；Further according to the network traffics path and the network service portion The constraint of administration's node determines the optimization aim of the resource layout of the network service；Further according to the optimization aim using greedy calculation Method is optimized, and obtains the resource layout result of the network service, had both planned network traffics path, determines network clothes again Business deployment node, can realize the load balancing of the high usage and link bandwidth resource of computing resource, so as to reduce network clothes The multipoint fault probability of business, and avoid producing the congestion of network link.

Fig. 2 is the schematic diagram of the network topology that one embodiment of the invention is provided.Fig. 3 is the net that one embodiment of the invention is provided The schematic diagram of network service regulation.The specific embodiment of the present invention is described in further detail with reference to Fig. 2 and Fig. 3.In Fig. 2 Network topology and Fig. 3 in network service rule can be applicable in cloud data center, carrier network and enterprise network.Fig. 2 In include 4 terminals H1-H4, at 6 forwarding unit SW1-SW6, wherein SW5 and SW6 on-premise network service disposal ability on 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, fire wall FW and intrusion detection IDS, the uninterrupted of H1 to H2 is 1, needs the disposal ability of FW and IDS Respectively 2 and 3；Safety detection and network acceleration service, FW and IDS and agent functionality Proxy, H1 are provided for H1 to H3 flows Uninterrupted to H3 is 2, and the disposal ability for needing FW and IDS is 4 and the disposal ability of 6, Proxy is 3；For H1 to H4 flows Network acceleration service is provided, the uninterrupted of Proxy, H1 to H4 is that 4, Proxy disposal abilities are 6.

Thus obtain, network topology is：

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={ C_H1H2=1, C_H1H3=2, C_H1H4=4 }

Wherein, C_H1H2Represent terminal H₁To terminal H₂Flow shared by network link bandwidth resources, C_H1H3Represent terminal H₁To terminal H₃Flow shared by network link bandwidth resources, C_H1H4Represent terminal H₁To terminal H₄Flow shared by net Network link bandwidth resource.

Thus obtain, network service is：

W={ m₁=FW, m₂=IDS, m₃=Proxy }

Network service rule

Network service rule

Network service rule

Wherein, D_stRepresent terminal s to the flow T of terminal t_stCorresponding network service,Represent network function m_iIn function Deployment order in sequence.

Thus obtain, network traffics paths is constrained to：

Thus obtain, Web Service Deployment node is constrained to：

Thus obtain, optimization aim is：

min0.2L+0.8K

Thus obtain, be specially using the optimization process of greedy algorithm：

L1, the non-layout network service regular collection Φ={ D of initialization_H1H2,D_H1H3,D_H1H4, layout network service is regular Set

If L2, Φ are sky, step L12 is gone to, otherwise chooses network service needed for Φ and process the minimum regular r of ability, D is chosen first_H1H2。

L3, network service m sequentially successively in selection rule r, to D_H1H2, FW and IDS is chosen successively.

L4, selection have been deployed with the most network node of remaining computing resource in the node of network service, on-premise network clothes Business m, if feasible, goes to L7, and the otherwise surplus resources of existing deployment node are unsatisfactory for deployment conditions, to D_H1H2In FW without existing There is deployment node to carry out next step, to D_H1H2In IDS existing deployment node SW5 surplus resources up to 8 (be deployed with D_H1H2 FW), IDS can be disposed.

The most node of resource in L5, the node of the non-on-premise network service of selection, on-premise network service m, if feasible, go to L7, else rule r cannot be disposed, to D_H1H2In FW choose node SW5.

L6, regular r is labeled as disposing it is put in layout set, goes to L2.

The deployment node of the network service of L7, circulation step L3-L6 in regular r all determines.

L8, by the deployment node composition sequence P of network service in regular r, by source terminal s and purpose terminal in regular r T, is separately added into the head and the tail of sequence P, to D_H1H2,

Node in L9, successively selection sequence P is to (p_i,p_i+1) i=1,2 ..., | P | -1 is rightNode to for (H1,SW5_FW)(SW5_FW,W5_IDS)(W5_IDS,H2)。

L10, selection network node p_iTo node p_i+1All paths in network link using the minimum road of bandwidth resources Footpath, deployment correspondence forwarding rule, (H1, SW5_FW) path be H1-SW1-SW5, (SW5_FW,SW5_IDS) path be SW5.

L11, circulation step L9-L10 have path reachable in sequence P between all nodes pair, go to L2.

The determination of L12, the Web Service Deployment node of all input rules and corresponding network flow path, the money of network service Source layout is completed.

The resource method of combination of the network service that the present embodiment is provided being capable of adaptive resource constraint and the change of service regulation Change, dynamic updates deployment result.In terms of resource constraint, increase when the network service that disposed rule is consumed processes ability, surpass The deployment node processing power upper limit before excessive, can choose new deployment node according to step L4-L5, choose according to step L10 Forward-path after renewal between network node deployment node adjacent with sequence.In terms of service regulation, exist modification, increase and Three kinds of situations of service regulation are deleted, is deleted in the forwarding rule and deployment node of correspondence deployment for service regulation is deleted Network service resource, for service regulation is increased according to the process of step L3-L11, for alteration ruler is taken using original is deleted Business rule and new two step of amended service regulation of increase are completed.

The embodiment of the present invention is based on software defined network and network function Intel Virtualization Technology, to make computer network to user Multiple network service is provided, by joint modeling being carried out to network topology and network service sequence, to network link bandwidth resources Layout is carried out with the computing resource of support Web Service Deployment, planning network flow path determines Web Service Deployment node, it is real The load balancing of the high usage and link bandwidth resource of existing computing resource.

In a particular embodiment, the embodiment of the present invention can apply to carrier network, data center network and In enterprise network, provide the user and stablize extendible network service, optimize network link loads, save network operation cost.

For embodiment of the method, in order to be briefly described, therefore which is all expressed as a series of combination of actions, but this area Technical staff should know that the embodiment of the present invention is not limited by described sequence of movement, because according to present invention enforcement Example, some steps can adopt other orders or while carry out.Secondly, those skilled in the art should also know, specification Described in embodiment belong to preferred embodiment, necessary to the involved action not necessarily embodiment of the present invention.

Fig. 4 is the structural representation of the resource layout device of the network service that one embodiment of the invention is provided.Such as Fig. 4 institutes Show, the resource layout device of the network service that one embodiment of the invention is provided includes describing unit 201, constraint element 202, determines Unit 203 and optimization unit 204, wherein：

Description unit 201, for carrying out formalized description respectively to network topology and network service, obtains and the network Topologically corresponding first model and the second model corresponding with the network service；

Constraint element 202, for according to first model and second model difference constraint network flow path and Web Service Deployment node；

Determining unit 203, for being determined according to the constraint of the network traffics path and the Web Service Deployment node The optimization aim of the resource layout of the network service；

Optimization unit 204, for being optimized using greedy algorithm according to the optimization aim, obtains the network service Resource layout result.

The resource layout device of the network service that the present embodiment is provided is applied to the corresponding network service of above example Resource method of combination, will not be described here.

The present embodiment provides a kind of resource layout device of network service, and description unit 201 is 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 for according to first model and second model difference constraint network flow path With Web Service Deployment node；Determining unit 203 is for according to the network traffics path and the Web Service Deployment node Constraint determine the network service resource layout optimization aim；Optimize unit 204 for adopting according to the optimization aim It is optimized with greedy algorithm, obtains the resource layout result of the network service, both planned network traffics path, is determined again Web Service Deployment node, can realize the load balancing of the high usage and link bandwidth resource of computing resource, so as to drop The multipoint fault probability of low network service, and avoid producing the congestion of network link.

In an alternate embodiment of the present invention, first model is：

G=(V, E, C)

Wherein, G represents the network topology, and V represents the set of network node, and E represents the set of network link, and C is represented The set of terminal flow bandwidth.

In an alternate embodiment of the present invention, second model is：

Wherein, D_stRepresent terminal s to the flow T of terminal t_stCorresponding network service,Represent network function m_iIn function Deployment order in sequence, N represent the integer more than or equal to zero, and s, t ∈ H, H represent the set of end host, and n is represented and is more than Or the integer equal to 1.

Fig. 5 is the structural representation of the resource layout device of the network service that further embodiment of this invention is provided.Such as Fig. 5 institutes Show, the resource layout device of the network service includes：Processor (processor) 301, memory (memory) 302 and logical Letter bus 304；

Wherein, the processor 301, memory 302 complete mutual communication by the communication bus 304；

The processor 301 is used to call the programmed instruction in the memory 302, to perform above-mentioned each method embodiment The method for being provided, for example, include：Formalized description is carried out respectively to network topology and network service, obtains opening up with the network Flutter corresponding first model and the second model corresponding with the network service；According to first model and second model Difference constraint network flow path and Web Service Deployment node；According to the network traffics path and the Web Service Deployment The constraint of node determines the optimization aim of the resource layout of the network service；Entered using greedy algorithm according to the optimization aim Row optimization, obtains the resource layout result of the network service.

The present embodiment discloses a kind of computer program, and the computer program includes being stored in non-transient calculating Computer program on machine readable storage medium storing program for executing, the computer program include programmed instruction, when described program instruction is calculated When machine is performed, computer is able to carry out the method provided by above-mentioned each method embodiment, for example, include：To network topology and network Service carries out formalized description respectively, obtains the first model corresponding with the network topology and corresponding with the 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 traffics path and the Web Service Deployment node Optimization aim；It is optimized using greedy algorithm according to the optimization aim, obtains the resource layout knot of the network service Really.

The present embodiment provides a kind of non-transient computer readable storage medium storing program for executing, the non-transient computer readable storage medium storing program for executing Storage computer instruction, the computer instruction make the computer perform the method provided by above-mentioned each method embodiment, example Such as include：Formalized description is carried out respectively to network topology and network service, the first mould corresponding with the network topology is obtained Type and the second model corresponding with the network service；According to first model and second model difference constraint network stream Amount path and Web Service Deployment node；Determined according to the constraint of the network traffics path and the Web Service Deployment node The optimization aim of the resource layout of the network service；It is optimized using greedy algorithm according to the optimization aim, obtains institute State the resource layout result of network service.

One of ordinary skill in the art will appreciate that：Realize that all or part of step of said method embodiment can pass through Completing, aforesaid program can be stored in a computer read/write memory medium the related hardware of programmed instruction, the program Upon execution, perform the step of including said method embodiment；And aforesaid storage medium includes：ROM, RAM, magnetic disc or light Disk etc. is various can be with the medium of store program codes.

The embodiments such as base station described above are only schematic, wherein the unit as separating component explanation Can be or may not be physically separate, as the part that unit shows can be or may not be physics list Unit, you can local to be located at one, or can also be distributed on multiple NEs.Which is selected according to the actual needs can In some or all of module realizing the purpose of this embodiment scheme.Those of ordinary skill in the art are not paying creativeness Work in the case of, you can to understand and implement.

Through the above description of the embodiments, those skilled in the art can be understood that each embodiment can By software plus required general hardware platform mode realizing, naturally it is also possible to by hardware.Based on such understanding, on State the part that technical scheme substantially contributes prior art in other words to embody in the form of software product, should Computer software product can be stored in a computer-readable storage medium, such as ROM/RAM, magnetic disc, CD etc., including some fingers Order is used so that a computer equipment (can be personal computer, server, or network equipment etc.) performs each enforcement Method described in some parts of example or embodiment.

Finally it should be noted that：Various embodiments above is only illustrating the technical scheme of embodiments of the invention rather than right Its restriction；Although being described in detail to embodiments of the invention with reference to foregoing embodiments, the ordinary skill of this area Personnel should be understood：Which still can be modified to the technical scheme described in foregoing embodiments, or to which part Or all technical characteristic carries out equivalent；And these modifications or replacement, do not make the essence disengaging of appropriate technical solution The scope of each embodiment technical scheme of embodiments of the invention.

Claims (10)

1. the resource method of combination of a kind of network service, it is characterised in that methods described 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 the network service；

According to first model and second model difference constraint network flow path and Web Service Deployment node；

Determine that according to the constraint of the network traffics path and the Web Service Deployment node resource of the network service is compiled The optimization aim of row；

It is optimized using greedy algorithm according to the optimization aim, obtains the resource layout result of the network service.

2. the resource method of combination of network service according to claim 1, it is characterised in that first model is：

G=(V, E, C)

Wherein, G represents the network topology, and V represents the set of network node, and E represents the set of network link, and C represents terminal The set of flow bandwidth.

3. the resource method of combination of network service according to claim 1, it is characterised in that second model is：

$D_{st}=\left\{d_i^{st}\right|d_i^{st}\∈N,0\≤d_i^{st}\≤n,i=1,...,n\}$

Wherein, D_stRepresent terminal s to the flow T of terminal t_stCorresponding network service,Represent network function m_iIn functional sequence In deployment order, N represents the integer more than or equal to zero, s, t ∈ H, and H represents the set of end host, and n is represented and is more than or waits In 1 integer.

4. the resource method of combination of network service according to claim 1, it is characterised in that the network traffics path It is constrained to：

$\∀s,t\∈H:\underset{i\∈V:(i,j)\∈E}{\Σ}{x}_{ij}^{st}-\underset{i\∈V:(j,k)\∈E}{\Σ}{x}_{jk}^{st}=\left\{\begin{array}{c}1,j=t\\ 0,j\≠s,t,j\∈V\\ -1,j=s\end{array}\right.$

$\∀s,t\∈Handi\∈V:y_i^{st}=max(\underset{j\∈V:(j,i)\∈E}{\Σ}{x}_{ji}^{st},\underset{j\∈V:(i,j)\∈E}{\Σ}{x}_{ij}^{st})$

$\∀s,t\∈Handi\∈V:y_i^{st}\≤1$

$\∀i,j\∈Vand(i,j)\∈E:\underset{s,t\∈H}{\Σ}{x}_{ij}^{st}.C_{st}\≤L$

Wherein, s, t ∈ H, H represent the set of end host, i, j ∈ V, and V represents the set of network node, and (i, j) ∈ E, E are represented The set of network link,For 0-1 variables, take 0 value and represent terminal s to the flow T of terminal t_stWithout network link (i, j), Taking 1 value represents terminal s to the flow T of terminal t_stThrough network link (i, j), k ∈ V, (j, k) ∈ E,For 0-1 variables, 0 is taken Value represents terminal s to the flow T of terminal t_stWithout network link (j, k), take 1 value and represent terminal s to the flow T of terminal t_st Through network link (j, k),For 0-1 variables, take 0 value and represent terminal s to the flow T of terminal t_stWithout network node i, Taking 1 value represents terminal s to the flow T of terminal t_stThrough network node i, max (*, *) represents the higher value among two values, (j, i) ∈ E,For 0-1 variables, take 0 value and represent terminal s to the flow T of terminal t_stWithout network link (j, i), 1 value is taken Represent terminal s to the flow T of terminal t_stThrough network link (j, i), C_stRepresent terminal s to the flow T of terminal t_stShared Network link bandwidth resources, L represent the upper bound of the network link (i, j) using network link bandwidth resources.

5. the resource method of combination of network service according to claim 1, it is characterised in that the Web Service Deployment section That what is put is constrained to：

$\∀s,t\∈Handi\∈Vand{m}_p\∈W:g_{ip}^{st}\≤y_i^{st}$

$\∀s,t\∈Handi\∈Vand{m}_p\∈Wand{d}_p^{st}\≠0:\underset{i\∈V}{\Σ}{g}_{ip}^{st}=1$

$\∀s,t\∈Handi,j\∈V:u_i^{st}-u_j^{st}+\left|V\right|x_{ij}^{st}\≤\left|V\right|-1$

$\∀s,t\∈Handi\∈V:1\≤u_i^{st}\≤\left|V\right|,u_i^{st}\∈N$

$\∀s,t\∈Handi,j\∈Vand{m}_p,m_q\∈W:(d_q^{st}-d_p^{st})(u_i^{st}-u_j^{st})\≤\left|W\right|\left|V\right|(2-g_{ip}^{st}-g_{iq}^{st})$

$\∀i\∈V:\underset{p\∈N}{\Σ}\underset{s,t\∈H}{\Σ}{g}_{ip}^{st}{A}_p^{st}\≤B_i$

$\∀i\∈V:\underset{p\∈N}{\Σ}\underset{s,t\∈H}{\Σ}{g}_{ip}^{st}\≤{\mathrm{Mz}}_i$

$\underset{i\∈V}{\Σ}{z}_i=K$

Wherein, s, t ∈ H, H represent the set of end host, and i, j ∈ V, V represent the set of network node, m_p∈ W, W represent network The set of function,For 0-1 variables, take 0 value and represent terminal s to the flow T of terminal t_stWithout network node i, 1 value table is taken Show terminal s to the flow T of terminal t_stThrough network node i,For 0-1 variables, take 0 value and represent unused net at network node i Network function m_pProcess the flow T from terminal s to terminal t_st, take 1 value and represent at network node i using network function m_pProcess from end Flow Ts of the end s to terminal t_st,Represent network function m_pDeployment order in functional sequence,WithAuxiliary is represented respectively Variable,For 0-1 variables, take 0 value and represent terminal s to the flow T of terminal t_stWithout network link (i, j), take 1 value and represent Flow T of terminal s to terminal t_stThrough network link (i, j), N represents the integer more than or equal to zero, m_q∈ W,Represent net Network function m_qDeployment order in functional sequence,For 0-1 variables, take 0 value and represent uses no network function at network node i m_qProcess the flow T from terminal s to terminal t_st, take 1 value and represent at network node i using network function m_qProcess from terminal s to The flow T of terminal t_st,Represent network function m_pProcess the flow T from terminal s to terminal t_stThe computing resource of required consumption, B_iComputing resource total at network node i is represented, the maximum that M can be represented in representing computer, K are represented and be deployed with network service Node sum, z_iFor 0-1 variables, take 0 value and represent and at network node i, do not dispose any network service, take 1 value and represent network Network service is deployed with node i.

6. the resource method of combination of network service according to claim 1, it is characterised in that the optimization aim is：

min(λ₁L+λ₂K)

Wherein, min (*) represents and minimizes that L represents the upper bound of the network link (i, j) using network link bandwidth resources, K tables Show the sum of the node for being deployed with network service, λ₁With λ₂For keeper or the parameter of application setting, and λ₁+λ₂=1.

7. the resource method of combination of network service according to claim 1, it is characterised in that methods described also includes：

In the case where the disposal ability needed for the network service rule change of the network service or the network service increases, Adjust the Web Service Deployment node, and network traffics path described in incremental update.

8. the resource layout device of a kind of network service, it is characterised in that described device includes：

Description unit, for carrying out formalized description respectively to network topology and network service, obtains and the network topology pair The first model answered and the second model corresponding with the network service；

Constraint element, for according to first model and second model difference constraint network flow path and network service Deployment node；

Determining unit, for determining the network according to the constraint in the network traffics path and the Web Service Deployment node The optimization aim of the resource layout of service；

Optimization unit, for being optimized using greedy algorithm according to the optimization aim, obtains the resource of the network service Layout result.

9. the resource layout device of network service according to claim 8, it is characterised in that first model is：

G=(V, E, C)

Wherein, G represents the network topology, and V represents the set of network node, and E represents the set of network link, and C represents terminal The set of flow bandwidth.

10. the resource layout device of network service according to claim 8, it is characterised in that second model is：

$D_{st}=\left\{d_i^{st}|d_i^{st}\∈N,0\≤d_i^{st}\≤n,i=1,...,n\right\}$

Wherein, D_stRepresent terminal s to the flow T of terminal t_stCorresponding network service,Represent network function m_iIn functional sequence In deployment order, N represents the integer more than or equal to zero, s, t ∈ H, and H represents the set of end host, and n is represented and is more than or waits In 1 integer.