CN105049353A - Method for configuring routing path of business and controller - Google Patents

Abstract

The invention discloses a method for configuring a routing path of a business. The method comprises the steps as follows: determining the shortest routing path of each business and a dumb path of each business according to a source node identification and a target node identification corresponding to each business in a business set, and a network topology; determining flow distribution conditions of the sides of the shortest routing path of each business and the dump path of each business according to a flow requirement of each business, and determining a target function of the business set according to resource occupation accumulating amount of each shortest routing path and the resource occupation accumulating amount of each dump path, and configuring a final routing path for each business in the business set according to the target function of the business set and a constraint condition. The method for configuring the routing path of the business provided by the embodiment of the invention could increase business capacity of the routing path in the SDN so as to improve resource utilization rate of the whole network in the SDN.

Description

A kind of is method and the controller of business configuration routed path

Technical field

The present invention relates to communication technical field, be specifically related to a kind of method for business configuration routed path and controller.

Background technology

Software defined network (SoftwareDefinedNetwork, SDN) be a kind of novel network architecture, its design concept is separated with data retransmission plane network-based control plane, thus control bottom hardware by the software platform in controller, realize Internet resources distributed in demand flexibly.

Compared with legacy network, the essential characteristic of SDN has 3 points:

(1) control and forward separating: Forwarding plane is made up of the equipment of controlled forwarding, pass-through mode and service logic controlled by the controller on chain of command.

(2) be provided with open interface between control plane and Forwarding plane: SDN provides open programmable interface for control plane, in this way, controller only needs to pay close attention to inherent logic, and does not need to pay close attention to bottom and more realize details.

(3) centralized control in logic.Controller can control multiple forwarding unit, namely controls whole SDN, thus can obtain the network state view of the overall situation, namely network topology, and realizes the optimal control to network according to this network topology.

In prior art, the routed path of business is all that then upgrade routing table, be handed down to forwarding unit, forwarding unit, when receiving business, according to the routed path in routing table, can forward business datum by controller in advance for business configuration is good.

In prior art; usually be business configuration routed path according to shortest route routing algorithm; but the capacity in network topology between two routing nodes is limited; be configured according to the method in shortest route path; path between certain two routing node possible is shared by multiple business, and often there will be service conflict, the path between some routing node also may be in idle state; so just cause the actual capacity of the routed path in SDN very low, resource utilization is low.

Summary of the invention

For solving the volume of business problem of routed path in prior art SDN, the embodiment of the present invention provides a kind of method for business configuration routed path, can improve the volume of business of routed path in SDN, thus improve the resource utilization of the whole network in SDN.The embodiment of the present invention additionally provides corresponding controller.

First aspect present invention provides a kind of method for business configuration routed path, and described method is applied to the controller of software defined network SDN, and described method comprises:

Obtain each business of service set source node identification corresponding respectively, destination node mark and traffic demand;

The source node identification corresponding respectively according to each business of described service set and destination node mark, and the network topology at described service set institute's active node and all destination node places, determine the shortest route path of described each business and the mute path of described each business, the shortest route path of described each business is the described business routed path that resource occupation accumulation amount is minimum in described network topology, the mute path of described each business is the described business routed path that resource occupation accumulation amount is maximum in described network topology, business corresponding to described mute path cannot be transmitted in the mute path of described each business, described resource occupation accumulation amount represents the resource occupation amount sum on the limit forming described routed path, described limit represents the annexation between two routing nodes of direct communication in described network topology,

According to the traffic demand of described each business, determine the flow distribution situation on the limit in the shortest route path of described each business and the mute path of described each business;

According to every bar, described in the resource occupation accumulation amount in shortest route path and every bar, the resource occupation accumulation amount in mute path determines the target function of described services sets, according to the flow distribution situation on the limit in the shortest route path of described each business and the mute path of described each business, the residual flow capacity on every bar limit of described network topology and the complete configuration requirement of described services sets determine the constraints of described services sets, the residual flow capacity on described every bar limit is that described limit is for configuring the maximum stream flow of described service set business, the complete configuration requirement of described services sets represents and is configured in described network topology by whole business of described service set by the traffic demand of described each business,

According to target function and the constraints of described services sets, it is the final route path of each business described in each business configuration of described service set.

In conjunction with first aspect, in the implementation that the first is possible, the described target function according to described services sets and constraints, be the final route path of each business described in each business configuration of described service set, comprise:

According to described target function, traffic constraints set of circumstances and the complete configuration constraint set of circumstances of business carry out the first calculating, described traffic constraints set of circumstances comprises the traffic constraints condition on limit described in described every bar, and described business complete configuration constraint set of circumstances comprises the complete configuration constraint condition of business of described each business;

According to the mute path comprised in the described first result calculated, calculate the new shortest route path of described each business;

According to the new shortest route path of described each business, upgrade described target function, described traffic constraints set of circumstances and the complete configuration constraint set of circumstances of business;

The second calculating is carried out according to target function, the traffic constraints set of circumstances after renewal and the complete configuration constraint set of circumstances of business after upgrading after upgrading, until the described second result calculated does not comprise the mute path of described any one business of service set, according to the final route path that the described second result calculated is each business described in each business configuration of described service set.

In conjunction with first aspect or the first possible implementation of first aspect, in the implementation that the second is possible, described in the resource occupation accumulation amount in shortest route path described in the every bar of described basis and every bar, the resource occupation accumulation amount in mute path determines the target function of described services sets, determine the constraints of described services sets according to the flow distribution situation on limit in the shortest route path of described each business and the mute path of described each business, the residual flow capacity on every bar limit of described network topology and the complete configuration requirement of described services sets, comprising:

For routed path described in every bar arranges one respectively for characterizing the variable of described routed path, described routed path comprises described mute path and described shortest route path;

According to the summation of first sum of products and second sum of products, determine the target function of described services sets, described first product is the product of the variable that the resource occupation accumulation amount in a described mute path is corresponding with described mute path, described first sum of products be first product in the mute path of all business of described service set and, described second product is the resource occupation accumulation amount in a described shortest route path and the product in described shortest route path, described second sum of products be second product in the shortest route path of all business of described service set and;

For limit described in every bar, the summation of the 3rd sum of products and the 4th sum of products is not more than the restriction relation of the residual flow capacity on described limit, be defined as the traffic constraints condition in described constraints, described 3rd product is the product of one article of described shortest route path variable that flow distribution situation is corresponding with described shortest route path on described limit, described 3rd sum of products be the 3rd product in the shortest route path of all business of described service set and, described 4th product is the product of one article of described mute path variable that flow distribution situation is corresponding with described mute path on described limit, described 4th sum of products be the 4th product in the mute path of all business of described service set and,

For described each business, 5th sum of products is equaled the equality constraint relation of 1, be defined as the complete configuration constraint condition of business in described constraints, described 5th product is the product for characterizing coefficient that whether one article of described routed path taken by the described business variable corresponding with described routed path, described 5th sum of products be the 5th product of the routed path of all business of described service set and.

In conjunction with the implementation that first aspect the second is possible, in the implementation that the third is possible, described by the summation of first sum of products and second sum of products, be defined as the target function of described services sets, described first product is the product of the resource occupation accumulation amount in mute path described in the described every bar variable corresponding with mute path described in described every bar, the product in shortest route path described in the resource occupation accumulation amount that described second product is shortest route path described in described every bar and described every bar, comprising:

By the summation of first sum of products and second sum of products, be defined as the target function of described services sets, described first product takies the product of the accumulation amount variable corresponding with mute path described in described every bar for the flow in mute path described in described every bar, and described second product takies the product in shortest route path described in accumulation amount and described every bar for the flow in shortest route path described in described every bar.

In conjunction with the implementation that first aspect the second is possible, in the 4th kind of possible implementation, described by the summation of first sum of products and second sum of products, be defined as the target function of described services sets, described first product is the product of the resource occupation accumulation amount in mute path described in the described every bar variable corresponding with mute path described in described every bar, the product in shortest route path described in the resource occupation accumulation amount that described second product is shortest route path described in described every bar and described every bar, comprising:

By the summation of first sum of products and second sum of products, be defined as the target function of described services sets, described first product is the product of the length in mute path described in the described every bar variable corresponding with mute path described in described every bar, the product in shortest route path described in the length that described second product is shortest route path described in described every bar and described every bar.

In conjunction with the implementation that first aspect the second is possible, in the 5th kind of possible implementation, described according to upgrade after target function, upgrade after traffic constraints set of circumstances and upgrade after the complete configuration constraint set of circumstances of business carry out the second calculating, until the described second result calculated does not comprise the mute path of described any one business of service set, comprising:

According to the traffic constraints set of circumstances after the target function after renewal, renewal, the complete configuration constraint set of circumstances of business after renewal, and variable corresponding to described each described routed path carries out the second calculating for natural constraints, until the described second result calculated does not comprise the mute path of described any one business of service set, obtain the final route path that described each business is unique.

In conjunction with the implementation that first aspect the second is possible, in the 6th kind of possible implementation, described according to upgrade after target function, upgrade after traffic constraints set of circumstances and upgrade after the complete configuration constraint set of circumstances of business carry out the second calculating, until the described second result calculated does not comprise the mute path of described any one business of service set, comprising:

The second calculating is carried out, until the described second result calculated does not comprise the mute path of described any one business of service set according to target function, the traffic constraints set of circumstances after renewal and the complete configuration constraint set of circumstances of business after upgrading after upgrading;

When the arbitrary business in described each business is to when should have at least two routed paths, the variable adding described each described routed path corresponding re-starts calculating for natural constraints, obtains the final route path that described each business is unique.

In conjunction with the implementation that first aspect the second is possible, in the 7th kind of possible implementation, described according to upgrade after target function, upgrade after traffic constraints set of circumstances and upgrade after the complete configuration constraint set of circumstances of business carry out the second calculating, until the described second result calculated does not comprise the mute path of described any one business of service set, comprising:

The second calculating is carried out, until the described second result calculated does not comprise the mute path of described any one business of service set according to target function, the traffic constraints set of circumstances after renewal and the complete configuration constraint set of circumstances of business after upgrading after upgrading;

When the arbitrary business in described each business is to when should have at least two routed paths, using make described target function value minimum routed path as the final route path of described arbitrary business, obtain the final route path that described each business is unique.

Second aspect present invention provides a kind of controller being applied to software defined network SDN, comprising:

Acquisition module, for obtaining each business of service set source node identification corresponding respectively, destination node mark and traffic demand;

First determination module, the source node identification that each business of described service set for obtaining according to described acquisition module is corresponding respectively and destination node mark, and the network topology at described service set institute's active node and all destination node places, determine the shortest route path of described each business and the mute path of described each business, the shortest route path of described each business is the described business routed path that resource occupation accumulation amount is minimum in described network topology, the mute path of described each business is the described business routed path that resource occupation accumulation amount is maximum in described network topology, business corresponding to described mute path cannot be transmitted in the mute path of described each business, described resource occupation accumulation amount represents the resource occupation amount sum on the limit forming described routed path, described limit represents the annexation between two routing nodes of direct communication in described network topology,

Second determination module, for the traffic demand of described each business obtained according to described acquisition module, determines the flow distribution situation on the limit in the shortest route path of described each business that described first determination module is determined and the mute path of described each business;

3rd determination module, the target function of described services sets is determined for the resource occupation accumulation amount in mute path described in the resource occupation accumulation amount in shortest route path according to every bar and every bar, the flow distribution situation on the shortest route path of described each business determined according to described second determination module and the limit in the mute path of described each business, the residual flow capacity on every bar limit of described network topology and the complete configuration requirement of described services sets determine the constraints of described services sets, the residual flow capacity on described every bar limit is that described limit is for configuring the maximum stream flow of described service set business, the complete configuration requirement of described services sets represents and is configured in described network topology by whole business of described service set by the traffic demand of described each business,

Configuration module, for the target function of described services sets determined according to described 3rd determination module and constraints, is the final route path of each business described in each business configuration of described service set.

In conjunction with second aspect, in the implementation that the first is possible, described configuration module comprises:

First linear computing element, for according to described target function, traffic constraints set of circumstances and the complete configuration constraint set of circumstances of business carry out the first calculating, described traffic constraints set of circumstances comprises the traffic constraints condition on limit described in described every bar, and described business complete configuration constraint set of circumstances comprises the complete configuration constraint condition of business of described each business;

Second linear computing element, for the mute path that comprises in the first result calculated of calculating according to described first linear computing element, calculates the new shortest route path of described each business;

Updating block, for the new shortest route path of described each business calculated according to described second linear computing element, upgrades described target function, described traffic constraints set of circumstances and the complete configuration constraint set of circumstances of business;

Third linear computing unit, the second calculating is carried out, until the described second result calculated does not comprise the mute path of described any one business of service set for target function, the traffic constraints set of circumstances after renewal and the complete configuration constraint set of circumstances of business after upgrading after upgrading according to described updating block.

Dispensing unit, for the final route path being each business described in each business configuration of described service set according to the second result calculated of described 3rd computing unit.

In conjunction with second aspect or the first possible implementation of second aspect, in the implementation that the second is possible, described 3rd determination module comprises:

Setting unit, for arranging one respectively for characterizing the variable of described routed path for routed path described in every bar, described routed path comprises described mute path and described shortest route path;

First determining unit, for the summation according to first sum of products and second sum of products, determine the target function of described services sets, described first product is the product of the variable that the resource occupation accumulation amount in a described mute path is corresponding with described mute path, described first sum of products be first product in the mute path of all business of described service set and, described second product is the resource occupation accumulation amount in a described shortest route path and the product in described shortest route path, described second sum of products be second product in the shortest route path of all business of described service set and,

Second determining unit, for for limit described in every bar, the summation of the 3rd sum of products and the 4th sum of products is not more than the restriction relation of the residual flow capacity on described limit, be defined as the traffic constraints condition in described constraints, described 3rd product is the product of one article of described shortest route path variable that flow distribution situation is corresponding with described shortest route path on described limit, described 3rd sum of products be the 3rd product in the shortest route path of all business of described service set and, described 4th product is the product of one article of described mute path variable that flow distribution situation is corresponding with described mute path on described limit, described 4th sum of products be the 4th product in the mute path of all business of described service set and,

3rd determining unit, for for described each business, 5th sum of products is equaled the equality constraint relation of 1, be defined as the complete configuration constraint condition of business in described constraints, described 5th product is the product for characterizing coefficient that whether one article of described routed path taken by the described business variable corresponding with described routed path, described 5th sum of products be the 5th product of the routed path of all business of described service set and.

In conjunction with the implementation that second aspect the second is possible, in the implementation that the third is possible,

Described first determining unit, specifically for the summation by first sum of products and second sum of products, be defined as the target function of described services sets, described first product takies the product of the accumulation amount variable corresponding with mute path described in described every bar for the flow in mute path described in described every bar, and described second product takies the product in shortest route path described in accumulation amount and described every bar for the flow in shortest route path described in described every bar.

In conjunction with the implementation that second aspect the second is possible, in the 4th kind of possible implementation,

Described first determining unit, specifically for the summation by first sum of products and second sum of products, be defined as the target function of described services sets, described first product is the product of the length in mute path described in the described every bar variable corresponding with mute path described in described every bar, the product in shortest route path described in the length that described second product is shortest route path described in described every bar and described every bar.

In conjunction with the implementation that second aspect the second is possible, in the 5th kind of possible implementation,

Described third linear computing unit, specifically for according to upgrade after target function, upgrade after traffic constraints set of circumstances, upgrade after the complete configuration constraint set of circumstances of business, and variable corresponding to described each described routed path carries out the second calculating for natural constraints, until the described second result calculated does not comprise the mute path of described any one business of service set, obtain the final route path that described each business is unique.

In conjunction with the implementation that second aspect the second is possible, in the 6th kind of possible implementation,

Described third linear computing unit, specifically for carrying out the second calculating according to the traffic constraints set of circumstances after the target function after renewal, renewal and the complete configuration constraint set of circumstances of business after upgrading, until the described second result calculated does not comprise the mute path of described any one business of service set; When the arbitrary business in described each business is to when should have at least two routed paths, the variable adding described each described routed path corresponding re-starts calculating for natural constraints, obtains the final route path that described each business is unique.

In conjunction with the implementation that second aspect the second is possible, in the 7th kind of possible implementation,

Described third linear computing unit, specifically for carrying out the second calculating according to the traffic constraints set of circumstances after the target function after renewal, renewal and the complete configuration constraint set of circumstances of business after upgrading, until the described second result calculated does not comprise the mute path of described any one business of service set; When the arbitrary business in described each business is to when should have at least two routed paths, using make described target function value minimum routed path as the final route path of described arbitrary business, obtain the final route path that described each business is unique.

The method for business configuration routed path that the embodiment of the present invention provides, source node identification, destination node mark and the traffic demand corresponding respectively according to each business of service set, and the residual flow capacity on limit in network topology, be the final route path of each business described in each business configuration of described service set.

With the allocation plan in shortest route path in prior art cause the volume of business in SDN low compared with, the method for business configuration routed path that the embodiment of the present invention provides, fully take into account the residual flow capacity on every bar limit in the traffic demand of each business of service set and network topology, thus make each business of service set can be configured to the final route path of not conflicting with other business in network topology, do not conflict with other business and refer to that the flow occupancy with the common edge in the final route path of other business is no more than the residual flow capacity on this limit.Thus the optimum routed path configuration achieved business, both improve the volume of business of routed path in SDN, improve again the whole network resource utilization of SDN.

Accompanying drawing explanation

In order to be illustrated more clearly in the technical scheme in the embodiment of the present invention, below the accompanying drawing used required in describing embodiment is briefly described, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those skilled in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to these accompanying drawings.

Fig. 1 is SDN configuration diagram in the embodiment of the present invention;

Fig. 2 is SDN layering schematic diagram in the embodiment of the present invention;

Fig. 3 is the logical construction schematic diagram for the method for business configuration routed path in the embodiment of the present invention;

Fig. 4 is a schematic diagram of network topology in the embodiment of the present invention;

Fig. 5 is another schematic diagram of network topology in the embodiment of the present invention;

Fig. 6 is another schematic diagram of network topology in the embodiment of the present invention;

Fig. 7 is another schematic diagram of network topology in the embodiment of the present invention;

Fig. 8 is the embodiment schematic diagram for the method for business configuration routed path in the embodiment of the present invention;

Fig. 9 is an embodiment schematic diagram of the controller in the embodiment of the present invention in SDN;

Figure 10 is another embodiment schematic diagram of the controller in the embodiment of the present invention in SDN;

Figure 11 is another embodiment schematic diagram of the controller in the embodiment of the present invention in SDN;

Figure 12 is another embodiment schematic diagram of the controller in the embodiment of the present invention in SDN;

Figure 13 is another embodiment schematic diagram of the controller in the embodiment of the present invention in SDN.

Embodiment

The embodiment of the present invention provides a kind of method for business configuration routed path, can improve the volume of business of routed path in SDN, thus improve the resource utilization of the whole network in SDN.The embodiment of the present invention additionally provides corresponding controller.Below be described in detail respectively.

Below in conjunction with the accompanying drawing in the embodiment of the present invention, be clearly and completely described the technical scheme in the embodiment of the present invention, obviously, described embodiment is only the present invention's part embodiment, instead of whole embodiments.Based on the embodiment in the present invention, those skilled in the art, not making the every other embodiment obtained under creative work prerequisite, belong to the scope of protection of the invention.

Fig. 1 is the configuration diagram of SDN in the embodiment of the present invention.As shown in Figure 1, SDN comprises controller and multiple forwarding unit, forwarding unit is only responsible for the forwarding of data, controller is responsible for each business configuration routed path, and upgrade routing table, the routing table of renewal is handed down to each forwarding unit, and each forwarding unit, when receiving business datum, forwards according to routing table.Controller can be the software that long-range server also can be mounted on remote server, comprising SDN control software design (as network operating system), provides various network service.All devices in controller centralized management network, virtual whole network is resource pool, the demand different according to user and overall network topology, flexible dynamically Resources allocation, SDN controller has the global view of network, be in charge of whole network, to lower floor, communicated with basic network by the agreement of standard; To upper strata, provide control ability to Internet resources by open interface to application layer.It should be noted that, although be operated in the hardware devices such as the SDN switch of infrastructure layer too much not consider logic control at needs, but as being responsible for the equipment of concrete data transmission disposal in SDN, forwarding to complete high-speed data, still will follow switch operation principle.See in essence, no matter be switch or router in legacy equipment, its operation principle is all when receiving packet, is compared by some list items that some property field in packet and equipment self store, and then carries out respective handling according to the requirement of list item when a match has been found.SDN switch is also similar principle, but what there are differences with legacy equipment is, each list item in equipment is not generated voluntarily in this locality by the network environment of equipment self according to periphery, but issued by remote controllers unification, therefore the control logic (such as link discovery, address learning, router-level topology etc.) of various complexity all without the need to realizing in SDN switch.

The route computing method for SDN framework that the embodiment of the present invention provides and device section are deployed in key-course.It should be noted that, key-course and infrastructure layer not necessarily can be separated physically, that is, application layer, key-course just may be arranged on a certain of infrastructure layer even (as SDN switch etc.) and without the need to special SDN hardware control device on several SDN equipment, also may controller be responsible for the server (can Control Server be referred to as) of the data retransmission network equipment independent of infrastructure layer or be arranged in a software form on Control Server, be arranged on the virtual machine of Control Server even in a software form.At present, implementation and the agreement of the SDN controller of multiple producer all have difference, the main flow implementation method of SDN controller is pure software, pure soft SDN controller lands in the market in network virtualization field, the NSX controller of such as VMware, separate with physical network, VMware claims that NSX is the product of a Full-virtualization, compatible with any network hardware.And hardware SDN is relevant with flow lead at present, as traffic engineering, video monitoring, security fields etc., the SDN controller (i.e. Control Server) with hardware net equipment entity and in SDN or multiple stage SDN switch are connected, concrete connected mode is depending on the scale of concrete SDN and demand, need to understand, due to performance limitations, Control Server has maximum connection switch quantity, how Control Server is connected with switch, how networking is not in the research range of the embodiment of the present invention for SDN, for the ease of understanding, refer to Fig. 1, Fig. 1 is a kind of networking schematic diagram when SDN controller has corresponding independently hardware device (as a station server) in SDN.The implementation of the embodiment of the present invention to key-course is not restricted, as being that pure software (as network operating system) realizes, can also be at independently network equipment entity hard-wired (being implemented in independent of on the Control Server of infrastructure layer network node or computer cluster) etc.

Fig. 2 is the layering schematic diagram of SDN in the embodiment of the present invention.As shown in Figure 2, the typical architecture of SDN is divided into three layers, and the superiors are application layer (ApplicationLayer), comprises various different application, network simulation, the network planning etc.The layout of middle key-course (ControlLayer) primary responsibility data-plane resource, the maintenance etc. of network topology and state information, physically, this level can be placed on an independent physical server, also can be placed in a distributed manner on multiple stage physical server.Network equipment layer (InfrastructureLayer) primary responsibility of the bottom, based on the data processing of stream table, forwarding and state collection, comprises router, switch etc.

The method that the embodiment of the present invention provides is from Computing Principle, relate to the process solving the linear programming problem with constraints and target function, this linear programming problem can be expressed as the general type of the Mathematical Modeling of the linear programming problem comprising target function, constraints and Condition of Non-Negative Constrains.

It should be noted that, in the embodiment of the present invention, routed path is also called for short path, and routing node is also called for short node.Network topology comprises multiple routing node and has the limit between two routing nodes of correspondence, while the annexation between two routing nodes representing direct communication in described network topology.Network topology in the embodiment of the present invention comprises source node and the destination node of each business of service set to be configured.Service set comprises multiple business.

Fig. 3 is the logical construction schematic diagram for the method for business configuration routed path in the embodiment of the present invention.

As shown in Figure 3, the present invention proposes a kind of method for business configuration routed path, and be applied to the controller of SDN, controller mainly comprises three modules:

(1) shortest route path calculation module: for the shortest route path according to network topology, link cost computing service, shortest route path in the embodiment of the present invention is the routed path of Least-cost, as: consume the routed path that rate are minimum, certainly, also can be the shortest routed path of length.Distance the length of routed path represents from the source node of this routed path to destination node.

(2) linear programming computing module: for constructing the minimized target function of resource occupation amount, and the value of variable corresponding to each path is solved according to target function and constraints, ensure that the business on path is not conflicted, needed for the business that limit namely between every two routing nodes configures, flow accumulation amount is no more than the residual flow capacity on this limit, the residual flow capacity on limit is that described limit is for configuring the maximum stream flow of described service set business, also residual flow capacity can be interpreted as it is the idle flux capacity on this limit before this business configuration, because last business configuration may consume a part of flux capacity on this limit, residual flow capacity thus, if be not previously used before this limit, then residual flow capacity is the total flow capacity on this limit.

(3) overall SDN routing calculation module: calculate global optimum's result for the result according to shortest route path and linear programming instrument.

Optimal result is exactly ensureing under the prerequisite that the business of service set is not conflicted, the shortest routed path.

Controller receives the routing path calculation demand of business, and business can be batch, and overall SDN routing calculation module utilizes shortest route path and linear programming to calculate global optimum's result, upgrades routing table according to this optimal result.

Overall situation SDN route computing method, is described in detail as follows:

Input:

If the relational expression of network topology is: G=(V, E), the set of routing node of V for comprising in network topology, can be expressed as: V={v1, v2, vn}, E is the set on the limit between two routing nodes having correspondence, can be expressed as: E={e1, e2, em}, the capacity on limit is expressed as cap (e) (e belongs to E), the cost on limit represents cost (e) (e belongs to E), the maximum stream flow for configuring described service set business that the capacity on limit refers to, the cost on limit refers to the resource that flow that business takies will consume, this resource can be rate, take a flux unit and need consumption 1 point of, in this embodiment, unit is exactly unit concept physically, as: 1,000,000, 1 point, 1 yuan etc.

The set in the final route path of each business of service set can be expressed as: R={r1, r2, rn}, r is the paths set up from certain source node to destination node, and the residual flow capacity on every bar limit can meet the traffic demand (being designated as r (r)) of business on this paths, residual flow capacity refers to the maximum stream flow for configuring described service set business, also can be understood as is this limit when this configuration routed path starts, the maximum idle flux capacity also during non-configuration service.

Export: the final route path of each business of service set.

Computing service is concentrated the process in the final route path of each business can consult following several step to understand:

Step 1, each business for service set determines a mute path, mute set of paths can be expressed as: DummyPath={dp1, dp2, dp3, dpn}, mute set of paths is added in all set of paths, all set of paths are expressed as: AllPath={dp1, dp2, dp3, dpn}, in the embodiment of the present invention, mute path can be neotectonics, also can be construct in advance, obtain when needing to use, mute path is to build the infinitely-great path of the virtual path cost of linear programming model in the embodiment of the present invention, such as: consume the path that rate are maximum, or the path that path is maximum, or all limits of the network topology for all business of this services sets of accommodation.It should be noted that, for the business that will dispose, the mute path that different business can be corresponding identical.It should be noted that, mute path can not change in computational process.

Step 2, relational expression G=(V according to network topology, and the cost cost (e) on limit E), utilize shortest route routing algorithm to calculate the shortest route path of each business, the set in the shortest route path that services sets is corresponding can be expressed as: SP={sp1, sp2, sp3,, spn}, continues to add in all set of paths AllPath by the set in shortest route path corresponding for services sets, AllPath after interpolation is expressed as: AllPath={dp1, dp2, dp3 ... dpn, sp1, sp2, sp3,, spn}.

Step 3, structure target function and and constraints.

(1) target function: tectonic network topology resource consumes minimum target function, or the target function that the length of routed path is minimum.

(2) constraints: capacity cap (e) and the business on limit configure two constraintss completely, the capacity constraints on limit i.e. traffic constraints condition, total flow on this limit required for all business can not be greater than the residual flow capacity on this limit, and business complete configuration constraint condition is configured in described network topology by the traffic demand of whole business of described service set by described each business.

All need, for the mute path of every bar and every bar shortest route path arrange a variable respectively, to characterize this routed path with this variable in target function and constraints.

Step 4, based on the target function of step 3 and constraints, linear programming method is utilized to solve the value of variable corresponding to each routed path;

If in the value of the variable that each routed path solved in step 5 step 4 is corresponding, the variable in relevant mute path is not 0, then on the basis comprising mute path, again the routed path that each business is new is counted, and upgrade target function and constraints, re-start iterative computation, until variate-value corresponding to all mute paths is all 0, variate-value corresponding to mute path is 0, represent that this mute path is displaced, in the process in the mute path of displacement, be not limited to twice iterative computation, may need repeatedly to upgrade, repeatedly calculate and all mute paths all could be cemented out; If in the value of the variable that each routed path is corresponding, the variable in relevant mute path is 0, then continue step 6.

Step 6, after displacing all mute paths, if there is one or more business to occur shunting, namely service needed is configured at least two paths and could realizes configuration, then add variate-value corresponding to each routed path be all natural number (in fact or be 0, 1) constraints, again calculate again once, ensure the corresponding unique final route path of a business, in fact, also can be when starting to calculate at first, directly adding variate-value corresponding to each routed path is all natural constraints, business just can be avoided to occur the situation of shunting configuration.

Final route paths all in step 7, final output R.

In order to further illustrate the method for business configuration routed path in the embodiment of the present invention, composition graphs 4 ~ Fig. 7, be described using instantiation: only as an example, Fig. 4 is for the schematic diagram of a network topology of 6 routing nodes in the embodiment of the present invention, it should be noted that in the present embodiment, D-F represents D node and the internodal path of F, D node and F node are two nodes adjacent in network topology, D node and the direct communication of F node.As shown in Figure 4, an embodiment of the method for business configuration routed path in the embodiment of the present invention comprises:

(1) have 6 routing nodes in network topology, the flux capacity on each limit is 4 units, and the length on every bar limit is 1 unit, represents two nodes comprising the two ends on limit on every bar limit.The maximum stream flow for configuration service that the capacity on limit refers to, the length on limit can be the physical distance in real network, also can be the abstract expression according to real network physical distance, the cost on limit refers to the resource that flow that business takies will consume, this resource can be rate, and taking a flux unit needs consumption 1 point of, in this embodiment, unit is exactly unit concept physically, as: 1,000,000,1 point, 1 yuan etc.

(2) 2 business are had in this example:

Business 1:A-F, traffic demand: 4 units (namely, source node identification is A, and destination node is designated F, and traffic demand is 4 units);

Business 2:E-D, traffic demand: 1 unit (namely, source node identification is E, and destination node is designated D, and traffic demand is 1 unit).

Fig. 5 is for the schematic diagram of a network topology of 6 routing nodes in the embodiment of the present invention.As shown in Figure 5, shortest route road is carried out as calculated to business 1 and business 2: the shortest route path of business 1 is A-D-F, the shortest route path of business 2 is E-F-D, a limit F-D is shared in the shortest route path of business 1 and business 2, the capacity of F-D only has 4 units, and the traffic demand of these two business needs 5 units altogether, traffic demand is more than the capacity of DF, therefore there is conflict (can not share DF this edge) in these two business, wherein has a service needed to change a paths.

Because these two business exist conflict, so need the business of being respectively 1 and business 2 to construct a mute path, carry out linear programming preparation, in the present embodiment, the mute path of the business that will dispose is identical, and includes all limits of the network topology of wish accommodation business 1 and business 2, as shown in table 1, table 1 takies scale for the flow on limit in business 1 and business 2 pairs of network topologies, has arranged the flow business 1 and business 2 every bar limit in network topology and take situation in table 1.

Table 1: business takies scale to the flow on limit in network topology

A-B	A-D	B-C	C-F	D-F	E-F	Business 1	Business 2
								0	0	0	0	0	0	1	0
0	0	0	0	0	0	0	1
								0	4	0	0	4	0	1	0
0	0	0	0	1	1	0	1

As shown in table 1, the flow in the mute path of front two behavior business 1 and business 2 takies description, the flow in above-mentioned two the shortest route paths generated for business 1 and business 2 of two behaviors next takies description, first row in rear two row represents business 1, secondary series represents business 2, in rear two row, the path of 1 this business of expression, the path of 0 expression this business non-.

If four variablees that four paths of above-mentioned business 1 and business 2 are corresponding are respectively: X1, X2, X3, X4, wherein, X1 represents the mute path of business 1, the shortest route path that X2 represents the mute path of business 2, X3 represents business 1, X4 represents the shortest route path of business 2, as shown in table 2, table 2 takies scale for each path flow, the situation of flow shared by the clear and definite each bar limit illustrated in each path in table 2.

Table 2: path flow takies scale

Residual flow capacity because of every bar limit is all 4 units, so in this business routed path layoutprocedure, and the traffic constraints condition that the total capacity demand fulfillment of the business that can carry on each bar limit is as shown in table 3.

Table 3: traffic constraints condition

Residual flow capacity	Limit
		4	A-B
4	A-D
		4	B-C
4	C-F
		4	D-F
4	E-F

Because mute path is virtual route, and resource occupation amount is infinitely great, so this mute path can not be used, and the complete configuration constraint condition of demand fulfillment business on the other hand.Namely the sum of products of the coefficient that this variable of variable of every paths is corresponding equals 1, represent each business be received into this network and each several part of this business that each path corresponding to this business is transmitted and equal this business, business complete configuration constraint condition is as shown in table 4:

Table 4: the complete configuration constraint condition of business

X1	X2	X3	X4	Operational integer	Business
						1	0	1	0	1	Business 1
0	1	0	1	1	Business 2

Can construct following linear programming model expression formula by table 2 to table 4, linear programming model can comprise target function and constraints:

Wherein, can construct following target function according to table 2, this target function is the minimum target function of path cost, and minimum namely the consumed resource of path cost is minimum:

minz＝10000*X1+10000*X2+8*X3+2*X4

The complete configuration constraint condition of this path cost minimized target function demand fulfillment following traffic constraints conditions and traffic, wherein, * represent the multiplication sign of multiplying, <=represents and is less than or equal to, and <=is namely not more than:

0*X1+0*X2+0*X3+0*X4<＝4

0*X1+0*X2+4*X3+0*X4<＝4

0*X1+0*X2+0*X3+0*X4<＝4

0*X1+0*X2+0*X3+0*X4<＝4

0*X1+0*X2+4*X3+1*X4<＝4

0*X1+0*X2+0*X3+1*X4<＝4

1*X1+0*X2+1*X3+0*X4＝1

0*X1+1*X2+0*X3+1*X4＝1

Can be calculated by linear programming instrument:

X1=0.25, X2=0, X3=0.75, X4=1, the one group of solution meeting above-mentioned linear programming problem constraints of namely trying to achieve, and X1=0.25, X2=0, X3=0.75, X4=1, the result shows that business 1 have chosen a part of mute path, mute path just calculates for linear programming, be actual non-existent virtual route, so also need to continue iterative computation until the mute path of business 1 is swapped out, namely will obtain X1=0.

In above-mentioned example, the residual flow capacity that can there is D-F when D-F this edge while when configuration service 1 and business 2 is less than the total flow demand of business 1 and business 2, that is there is flow conflict in D-F limit, by linear programming, conflict is quantized in the embodiment of the present invention, if D-F capacity increases 1, then can avoid this flow conflict, when the capacity of D-F increases 1, by above-mentioned linear programming relation, obtain X1=0, X2=0, X3=1, X4=1, now, the value of the target function that path cost is minimum is 10, and above-mentioned X1=0.25, X2=0, X3=0.75, during X4=1, the value of the target function that path cost is minimum is 2508, as can be seen here, when the capacity of D-F increases 1, the minimized target function value of path cost reduce 2498, therefore, that is when the capacity of D-F does not change, the cost being equivalent to D-F increases 2498.

Further, upgrade the cost on every bar limit, as shown in Figure 6, in the middle of this example, the cost of other sections does not change, and the cost of D-F has become 1+2498, can think that D-F disconnects.It should be noted that here just in order to calculate, be considered as D-F and disconnecting.

After the cost of DF has become 1+2498, utilize the network topology of this renewal (be equivalent to upgrade in the network topology analyzed, D node and F node disconnect, do not change in actual networking), through shortest route path computing, obtain the shortest route path that business 1 and business 2 two are new: the new shortest route path of business 1 is: A-B-C-F, and the new shortest route path of business 2 is: E-F-C-B-A-D, as shown in Figure 7.

Re-start linear programming to prepare, as shown in table 5, table 5 is that business takies scale to the flow on limit in network topology, enumerates out the flow occupancy on business 1 and business 2 every bar limit in network topology in table 5.

Table 5: business takies scale to the flow on limit in network topology

A-B	A-D	B-C	C-F	D-F	E-F	Business 1	Business 2
								0	0	0	0	0	0	1	0
0	0	0	0	0	0	0	1
								0	4	0	0	4	0	1	0
0	0	0	0	1	1	0	1
								4	0	4	4	0	0	1	0
1	1	1	1	0	1	0	1

The mute path of two behavior business 1 and business 2 before table 5, relative to the computational process of table 1 to table 4, the mute path of business 1 and business 2 does not change, two the shortest route paths calculated before and after four behavior business 1 next and business 2, namely table 5 be equivalent to by the new shortest route path of the business 1 calculated be: A-B-C-F, the new shortest route path of business 2 is: E-F-C-B-A-D has been recorded in the 5th row and the 6th row of table 2 in a tabular form.Represent business 1 and business 2 respectively in last two row, value is that 0 interval scale does not choose this paths, and value is that 1 interval scale chooses this paths.

If six variablees that above-mentioned six paths are corresponding are: X1, X2, X3, X4, X5, X6, wherein, the mute path that X1 represents the mute path of business 1, X2 represents business 2, X3 represent the original shortest route path of business 1, X4 represents the original shortest route path of business 2, X5 represents the shortest routed path that business 1 is new, X6 represents the shortest routed path that business 2 is new.As shown in table 6, table 6 takies scale for each path flow, the situation of flow shared by the clear and definite each bar limit illustrated in each path in table 6.

Table 6: path flow takies scale.

Residual flow capacity because of every bar limit is all 4 units, so the traffic constraints condition that the total capacity demand fulfillment of the business that can carry in this business routed path layoutprocedure on each bar limit is as shown in table 7.

Table 7: traffic constraints condition

Residual flow capacity	Limit
		4	A-B
4	A-D
		4	B-C
4	C-F
		4	D-F
4	E-F

Because mute path is virtual route, and resource occupation amount is infinitely great, so this mute path can not be used, and the therefore complete configuration constraint condition of demand fulfillment business.Namely the sum of products of the coefficient that the variable of every paths is corresponding with this variable equals 1, represent each business be received into this network and each several part of this business that each path corresponding to this business is transmitted with to equal this business complete configuration constraint condition as shown in table 8:

Table 8: the complete configuration constraint condition of business

Can construct following linear programming model expression formula by table 6 to table 8 above, linear programming model can comprise target function and constraints:

Wherein, can construct following target function according to table 6, this target function is the minimum target function of path cost, and minimum namely the consumed resource of path cost is minimum;

minz＝10000*X1+10000*X2+8*X3+2*X4+12*X5+5*X6

Meet following constraints, wherein, * represents the multiplication sign of multiplying, and <=represents and is less than or equal to, and is namely not more than:

0*X1+0*X2+0*X3+0*X4+4*X5+1*X6<＝4

0*X1+0*X2+4*X3+0*X4+0*X5+1*X6<＝4

0*X1+0*X2+0*X3+0*X4+4*X5+1*X6<＝4

0*X1+0*X2+0*X3+0*X4+4*X5+1*X6<＝4

0*X1+0*X2+4*X3+1*X4+0*X5+0*X6<＝4

0*X1+0*X2+0*X3+1*X4+0*X5+1*X6<＝4

1*X1+0*X2+1*X3+0*X4+1*X5+0*X6＝1

0*X1+1*X2+0*X3+1*X4+0*X5+1*X6＝1

Can be calculated by linear programming instrument:

X1=0, X2=0, X3=0.75, X4=1, X5=0.25, X6=0, the one group of solution meeting above-mentioned linear programming problem constraints of namely trying to achieve, X1=0, X2=0, illustrate that mute path is displaced entirely, this solution is feasible, business 2 walks E-F-D path, but shunting has appearred in business 1, has walked A-D-F and A-B-C-F two paths.In order to avoid shunting appears in business, can add that these six variablees of X1, X2, X3, X4, X5, X6 are the restrictive condition of natural number (be 0, or be 1), re-start above-mentioned linear programming and calculate, namely:

minz＝10000*X1+10000*X2+8*X3+2*X4+12*X5+5*X6

Meet following constraints, wherein, * represents the multiplication sign of multiplying, and <=represents and is less than or equal to, and is namely not more than:

0*X1+0*X2+0*X3+0*X4+4*X5+1*X6<＝4

0*X1+0*X2+4*X3+0*X4+0*X5+1*X6<＝4

0*X1+0*X2+0*X3+0*X4+4*X5+1*X6<＝4

0*X1+0*X2+0*X3+0*X4+4*X5+1*X6<＝4

0*X1+0*X2+4*X3+1*X4+0*X5+0*X6<＝4

0*X1+0*X2+0*X3+1*X4+0*X5+1*X6<＝4

1*X1+0*X2+1*X3+0*X4+1*X5+0*X6＝1

0*X1+1*X2+0*X3+1*X4+0*X5+1*X6＝1

X1, X2, X3, X4, X5, X6 are natural number.

Can be calculated by integral linear programming instrument:

X1=0, X2=0, X3=0, X4=1, X5=1, X6=0, the one group of solution meeting above-mentioned linear programming problem constraints of namely trying to achieve, in this group solution, X1=0, X2=0 represent that mute path is displaced entirely, X3=0, X4=1, X5=1, X6=0 are natural number, and the value of X4 equals the number of services of business 2, the value of X5 equals the number of services of business 1, the situation that expression business 1 and 2 is not all shunted, obtains final route path: namely the final route path of business 1 is A-B-C-F, and the final route path of business 2 is E-F-D.

Optionally, after mute path is displaced, also can not add variable is natural restrictive condition, re-start above-mentioned linear programming to calculate, but when business existence shunting, the method that can directly adopt mark stream to round, first checks whether and meets traffic constraints, ungratifiedly to exclude, choose that paths that target function is minimum.Such as: in above-mentioned example, business 1 point has flowed away A-D-F and A-B-C-F two paths, computing service 1 only walks two kinds of situations in A-D-F and A-B-C-F path respectively, when only walking A-D-F, still can conflict on D-F limit with business 2, therefore this paths of A-D-F can be got rid of.Finally determine that business 1 walks this paths of A-B-C-F.

Also can be just directly adopting integral linear programming when utilizing table 3 and table 4 to carry out mute pathway permutations, directly adding X1, X2, X3, X4, X5, X6 be the restriction of natural condition, and the situation of service distributing just can be avoided to occur.

Be all turn to target with Least-cost to build the function of linear programming model in above-mentioned example, in fact, can also be minimised as target constructor with path, like this, the form of table 2 is just transformed to table 9.

Table 9: path table

Residual flow capacity because of every bar limit is all 4 units, so the traffic constraints condition that the total capacity demand fulfillment of the business that can carry in this business routed path layoutprocedure on each bar limit is as shown in table 3.

Table 10: traffic constraints condition

Residual flow capacity	Limit
		4	A-B
4	A-D
		4	B-C
4	C-F
		4	D-F
4	E-F

Because mute path is virtual route, and resource occupation amount is infinitely great, so this mute path can not be used, and the therefore complete configuration constraint condition of demand fulfillment business.Namely the sum of products of the coefficient that the variable of every paths is corresponding with this variable equals 1, represent each business be received into this network and each several part of this business that each path corresponding to this business is transmitted with to equal this business complete configuration constraint condition as shown in table 11:

Table 11: the complete configuration constraint condition of business

X1	X2	X3	X4	Operational integer	Business
						1	0	1	0	1	Business 1
0	1	0	1	1	Business 2

Can construct following linear programming model expression formula by table 9 to table 11 like this, linear programming model comprises target function and constraints:

Wherein, can construct following target function according to table 9, this target function is the minimum target function of path.

minz＝10000*X1+10000*X2+2*X3+2*X4

Meet:

0*X1+0*X2+0*X3+0*X4<＝4

0*X1+0*X2+4*X3+0*X4<＝4

0*X1+0*X2+0*X3+0*X4<＝4

0*X1+0*X2+0*X3+0*X4<＝4

0*X1+0*X2+4*X3+1*X4<＝4

0*X1+0*X2+0*X3+1*X4<＝4

1*X1+0*X2+1*X3+0*X4＝1

0*X1+1*X2+0*X3+1*X4＝1

Just can solve X1, X2, X3, X4 according to the mode that solves of aforementioned cost minimization, the minimized mode of solution procedure occupancy is consistent, and this place does not do and too much repeats.

It should be noted that, just provide twice iterative process in above-mentioned example all to displace by mute path, in fact in the process in the mute path of displacement, iterative process may have repeatedly, but no matter there is how many times, can calculate with reference to the mode of above-mentioned second time iterative process, until all mute paths are all displaced.

Described from above embodiment and example, fully take into account the residual flow capacity on every bar limit in the traffic demand of each business of service set and network topology, thus make each business of service set can be configured to the final route path of not conflicting with other business in network topology, not conflicting with other business refers to that the flow occupancy with the common edge in the final route path of other business is no more than the residual flow capacity on this limit.Thus the optimum routed path configuration achieved business, both improve the volume of business of routed path in SDN, improve again the whole network resource utilization of SDN.

Consult Fig. 8, an embodiment of the method for business configuration routed path that the embodiment of the present invention provides comprises:

101, the controller of software defined network SDN obtains each business of service set source node identification corresponding respectively, destination node mark and traffic demand.

102, described controller is according to the source node identification of described service set each business difference correspondence and destination node mark, and the network topology at described service set institute's active node and all destination node places, determine the shortest route path of described each business and the mute path of described each business, the shortest route path of described each business is the described business routed path that resource occupation accumulation amount is minimum in described network topology, the mute path of described each business is the described business routed path that resource occupation accumulation amount is maximum in described network topology, business corresponding to described mute path cannot be transmitted in the mute path of described each business, described resource occupation accumulation amount represents the resource occupation amount sum on the limit forming described routed path, described limit represents the annexation between two routing nodes of direct communication in described network topology.

103, described controller is according to the traffic demand of described each business, determines the flow distribution situation on the limit in the shortest route path of described each business and the mute path of described each business.

104, described in the resource occupation accumulation amount in described controller shortest route path according to every bar and every bar, the resource occupation accumulation amount in mute path determines the target function of described services sets, according to the flow distribution situation on the limit in the shortest route path of described each business and the mute path of described each business, the residual flow capacity on every bar limit of described network topology and the complete configuration requirement of described services sets determine the constraints of described services sets, the residual flow capacity on described every bar limit is that described limit is for configuring the maximum stream flow of described service set business, the complete configuration requirement of described services sets represents and is configured in described network topology by the traffic demand of whole business of described service set by described each business.

105, described controller is according to the target function of described services sets and constraints, is the final route path of each business described in each business configuration of described service set.

With the allocation plan in shortest route path in prior art cause the volume of business in SDN low compared with, the method for business configuration routed path that the embodiment of the present invention provides, fully take into account the residual flow capacity on every bar limit in the traffic demand of each business of service set and network topology, thus make each business of service set can be configured to the final route path of not conflicting with other business in network topology, do not conflict with other business and refer to that the flow occupancy with the common edge in the final route path of other business is no more than the residual flow capacity on this limit.Thus the optimum routed path configuration achieved business, both improve the volume of business of routed path in SDN, improve again the whole network resource utilization of SDN.

Alternatively, on the basis of embodiment corresponding to above-mentioned Fig. 8, in first embodiment of the method for business configuration routed path that the embodiment of the present invention provides, the described target function according to described services sets and constraints, for the final route path of each business described in each business configuration of described service set, can comprise:

According to described target function, traffic constraints set of circumstances and the complete configuration constraint set of circumstances of business carry out the first calculating, described traffic constraints set of circumstances comprises the traffic constraints condition on limit described in described every bar, and described business complete configuration constraint set of circumstances comprises the complete configuration constraint condition of business of described each business;

According to the mute path comprised in the described first result calculated, calculate the new shortest route path of described each business;

According to the new shortest route path of described each business, upgrade described target function, described traffic constraints set of circumstances and the complete configuration constraint set of circumstances of business;

The second calculating is carried out according to target function, the traffic constraints set of circumstances after renewal and the complete configuration constraint set of circumstances of business after upgrading after upgrading, until the described second result calculated does not comprise the mute path of described any one business of service set, according to the final route path that the described second result calculated is each business described in each business configuration of described service set.

It should be noted that, according to the mute path comprised in the described first result calculated, calculate the new shortest route path of described each business, specifically based on the mute path comprised in the first result calculated, upgrade described network topology, can be specifically the annexation on limit in network topology, according to the network topology after renewal, calculate the new shortest route path of described each business.

It should be noted that, the second calculating is carried out according to target function, the traffic constraints set of circumstances after renewal and the complete configuration constraint set of circumstances of business after upgrading after upgrading, until the described second result calculated does not comprise the mute path of described any one business of service set, obtain the final route path of described each business, it can be an iterative process, namely this is according to the target function after renewal, in result after traffic constraints set of circumstances after renewal and the complete configuration constraint set of circumstances of business after upgrading calculate, if the mute path of the business of described service set does not all displace, then continue iteration according to said process, namely according in this result of calculation not by the mute path swapped out, again calculate the new shortest route path of described each business, again upgrade described target function, described traffic constraints set of circumstances and the complete configuration constraint set of circumstances of business, again according to the described target function that these upgrade again, described traffic constraints set of circumstances and the complete configuration constraint set of circumstances of business calculate, like this one takes turns iteration goes down, until take turns in iterative computation one, the mute path of described each business is all displaced, no longer carry out next round iteration, the result of epicycle iterative computation is exactly the final route path of described each business.

Alternatively, above-mentioned be on the embodiment of the method for business configuration routed path or the basis of first embodiment, in second embodiment of the method for business configuration routed path that the embodiment of the present invention provides, described in the resource occupation accumulation amount in shortest route path described in the every bar of described basis and every bar, the resource occupation accumulation amount in mute path determines the target function of described services sets, according to the flow distribution situation on the limit in the shortest route path of described each business and the mute path of described each business, the residual flow capacity on every bar limit of described network topology and the complete configuration requirement of described services sets determine the constraints of described services sets, can comprise:

For routed path described in every bar arranges one respectively for characterizing the variable of described routed path, described routed path comprises described mute path and described shortest route path;

According to the summation of first sum of products and second sum of products, determine the target function of described services sets, described first product is the product of the variable that the resource occupation accumulation amount in a described mute path is corresponding with described mute path, described first sum of products be first product in the mute path of all business of described service set and, described second product is the resource occupation accumulation amount in a described shortest route path and the product in described shortest route path, described second sum of products be second product in the shortest route path of all business of described service set and;

For limit described in every bar, the summation of the 3rd sum of products and the 4th sum of products is not more than the restriction relation of the residual flow capacity on described limit, be defined as the traffic constraints condition in described constraints, described 3rd product is the product of one article of described shortest route path variable that flow distribution situation is corresponding with described shortest route path on described limit, described 3rd sum of products be the 3rd product in the shortest route path of all business of described service set and, described 4th product is the product of one article of described mute path variable that flow distribution situation is corresponding with described mute path on described limit, described 4th sum of products be the 4th product in the mute path of all business of described service set and,

For described each business, 5th sum of products is equaled the equality constraint relation of 1, be defined as the complete configuration constraint condition of business in described constraints, described 5th product is the product for characterizing coefficient that whether one article of described routed path taken by the described business variable corresponding with described routed path, described 5th sum of products be the 5th product of the routed path of all business of described service set and.

Alternatively, above-mentioned be second embodiment of the method for business configuration routed path basis on, in 3rd embodiment of the method for business configuration routed path that the embodiment of the present invention provides, described by the summation of first sum of products and second sum of products, be defined as the target function of described services sets, described first product is the product of the resource occupation accumulation amount in mute path described in the described every bar variable corresponding with mute path described in described every bar, the product in shortest route path described in the resource occupation accumulation amount that described second product is shortest route path described in described every bar and described every bar, comprise:

By the summation of first sum of products and second sum of products, be defined as the target function of described services sets, described first product takies the product of the accumulation amount variable corresponding with mute path described in described every bar for the flow in mute path described in described every bar, and described second product takies the product in shortest route path described in accumulation amount and described every bar for the flow in shortest route path described in described every bar.

Alternatively, above-mentioned be second embodiment of the method for business configuration routed path basis on, in 4th embodiment of the method for business configuration routed path that the embodiment of the present invention provides, described by the summation of first sum of products and second sum of products, be defined as the target function of described services sets, described first product is the product of the resource occupation accumulation amount in mute path described in the described every bar variable corresponding with mute path described in described every bar, the product in shortest route path described in the resource occupation accumulation amount that described second product is shortest route path described in described every bar and described every bar, can comprise:

By the summation of first sum of products and second sum of products, be defined as the target function of described services sets, described first product is the product of the length in mute path described in the described every bar variable corresponding with mute path described in described every bar, the product in shortest route path described in the length that described second product is shortest route path described in described every bar and described every bar.

Alternatively, above-mentioned be first or second embodiment of the method for business configuration routed path basis on, in 5th embodiment of the method for business configuration routed path that the embodiment of the present invention provides, described according to upgrade after target function, upgrade after traffic constraints set of circumstances and upgrade after the complete configuration constraint set of circumstances of business carry out the second calculating, until the described second result calculated does not comprise the mute path of described any one business of service set, can comprise:

According to the traffic constraints set of circumstances after the target function after renewal, renewal, the complete configuration constraint set of circumstances of business after renewal, and variable corresponding to described each described routed path carries out the second calculating for natural constraints, until the described second result calculated does not comprise the mute path of described any one business of service set, obtain the final route path that described each business is unique.

Alternatively, above-mentioned be first or second embodiment of the method for business configuration routed path basis on, in 6th embodiment of the method for business configuration routed path that the embodiment of the present invention provides, described according to upgrade after target function, upgrade after traffic constraints set of circumstances and upgrade after the complete configuration constraint set of circumstances of business carry out the second calculating, until the described second result calculated does not comprise the mute path of described any one business of service set, can comprise:

The second calculating is carried out, until the described second result calculated does not comprise the mute path of described any one business of service set according to target function, the traffic constraints set of circumstances after renewal and the complete configuration constraint set of circumstances of business after upgrading after upgrading;

When the arbitrary business in described each business is to when should have at least two routed paths, the variable adding described each described routed path corresponding re-starts calculating for natural constraints, obtains the final route path that described each business is unique.

Alternatively, above-mentioned be first or second embodiment of the method for business configuration routed path basis on, the embodiment of the present invention provide for business configuration routed path method the 7th embodiment in,

Described according to upgrade after target function, upgrade after traffic constraints set of circumstances and upgrade after the complete configuration constraint set of circumstances of business carry out the second calculating, until the described second result calculated does not comprise the mute path of described any one business of service set, can comprise:

The second calculating is carried out, until the described second result calculated does not comprise the mute path of described any one business of service set according to target function, the traffic constraints set of circumstances after renewal and the complete configuration constraint set of circumstances of business after upgrading after upgrading;

When the arbitrary business in described each business is to when should have at least two routed paths, using make described target function value minimum routed path as the final route path of described arbitrary business, obtain the final route path that described each business is unique.

The description that the embodiment of the method for business configuration routed path that Fig. 8 is corresponding or each embodiment can consult Fig. 1 to Fig. 7 part is understood, and this place does not do and too much repeats.

Consult Fig. 9, an embodiment of the controller 20 of the software defined network SDN that the embodiment of the present invention provides comprises:

Acquisition module 201, for obtaining each business of service set source node identification corresponding respectively, destination node mark and traffic demand;

First determination module 202, the source node identification that each business of described service set for obtaining according to described acquisition module 201 is corresponding respectively and destination node mark, and the network topology at described service set institute's active node and all destination node places, determine the shortest route path of described each business and the mute path of described each business, the shortest route path of described each business is the described business routed path that resource occupation accumulation amount is minimum in described network topology, the mute path of described each business is the described business routed path that resource occupation accumulation amount is maximum in described network topology, business corresponding to described mute path cannot be transmitted in the mute path of described each business, described resource occupation accumulation amount represents the resource occupation amount sum on the limit forming described routed path, described limit represents the annexation between two routing nodes of direct communication in described network topology,

Second determination module 203, for the traffic demand of the described each business according to described acquisition module 201 acquisition, determine the flow distribution situation on the limit in the shortest route path of described each business that described first determination module 202 is determined and the mute path of described each business;

3rd determination module 204, the target function of described services sets is determined for the resource occupation accumulation amount in mute path described in the resource occupation accumulation amount in shortest route path according to every bar and every bar, the flow distribution situation on the shortest route path of described each business determined according to described second determination module 203 and the limit in the mute path of described each business, the residual flow capacity on every bar limit of described network topology and the complete configuration requirement of described services sets determine the constraints of described services sets, the residual flow capacity on described every bar limit is that described limit is for configuring the maximum stream flow of described service set business, the complete configuration requirement of described services sets represents and is configured in described network topology by whole business of described service set by the traffic demand of described each business,

Configuration module 205, for the target function of described services sets determined according to described 3rd determination module 204 and constraints, is the final route path of each business described in each business configuration of described service set.

With the allocation plan in shortest route path in prior art cause the volume of business in SDN low compared with, what the embodiment of the present invention provided is controller, fully take into account the residual flow capacity on every bar limit in the traffic demand of each business of service set and network topology, thus make each business of service set can be configured to the final route path of not conflicting with other business in network topology, not conflicting with other business refers to that the flow occupancy with the common edge in the final route path of other business is no more than the residual flow capacity on this limit.Thus the optimum routed path configuration achieved business, both improve the volume of business of routed path in SDN, improve again the whole network resource utilization of SDN.

Alternatively, on the basis of embodiment corresponding to above-mentioned Fig. 9, consult Figure 10, in first embodiment of the controller 20 that the embodiment of the present invention provides, described configuration module 205 comprises:

First linear computing element 2051, for according to described target function, traffic constraints set of circumstances and the complete configuration constraint set of circumstances of business carry out the first calculating, described traffic constraints set of circumstances comprises the traffic constraints condition on limit described in described every bar, and described business complete configuration constraint set of circumstances comprises the complete configuration constraint condition of business of described each business;

Second linear computing element 2052, for the mute path that comprises in the first result calculated of calculating according to described first linear computing element 2051, calculates the new shortest route path of described each business;

Updating block 2053, for the new shortest route path of described each business calculated according to described second linear computing element 2052, upgrades described target function, described traffic constraints set of circumstances and the complete configuration constraint set of circumstances of business;

Third linear computing unit 2054, the second calculating is carried out, until the described second result calculated does not comprise the mute path of described any one business of service set for target function, the traffic constraints set of circumstances after renewal and the complete configuration constraint set of circumstances of business after upgrading after upgrading according to described updating block 2053.

Dispensing unit 2055, for the final route path being each business described in each business configuration of described service set according to the second result calculated of described 3rd computing unit 2054.

Alternatively, on the basis of embodiment corresponding to above-mentioned Figure 10, consult Figure 11, in first embodiment of the controller 20 that the embodiment of the present invention provides, described 3rd determination module 204 comprises:

Setting unit 2041, for arranging one respectively for characterizing the variable of described routed path for routed path described in every bar, described routed path comprises described mute path and described shortest route path;

First determining unit 2042, for the summation according to first sum of products and second sum of products, determine the target function of described services sets, described first product is the product of the variable that described setting unit 2041 that the resource occupation accumulation amount in a described mute path is corresponding with described mute path is arranged, described first sum of products be first product in the mute path of all business of described service set and, described second product is the resource occupation accumulation amount in a described shortest route path and the product in described shortest route path, described second sum of products be second product in the shortest route path of all business of described service set and,

Second determining unit 2043, for for limit described in every bar, the summation of the 3rd sum of products and the 4th sum of products is not more than the restriction relation of the residual flow capacity on described limit, be defined as the traffic constraints condition in described constraints, described 3rd product is the product of one article of described shortest route path variable that flow distribution situation is corresponding with described shortest route path on described limit, described 3rd sum of products be the 3rd product in the shortest route path of all business of described service set and, described 4th product is the product of one article of described mute path variable that flow distribution situation is corresponding with described mute path on described limit, described 4th sum of products be the 4th product in the mute path of all business of described service set and,

3rd determining unit 2044, for for described each business, 5th sum of products is equaled the equality constraint relation of 1, be defined as the complete configuration constraint condition of business in described constraints, described 5th product is the product for characterizing coefficient that whether one article of described routed path taken by the described business variable corresponding with described routed path, described 5th sum of products be the 5th product of the routed path of all business of described service set and.

Alternatively, on the basis of embodiment corresponding to above-mentioned Figure 11, in the 3rd embodiment of the controller 20 that the embodiment of the present invention provides,

Described first determining unit 2042, specifically for the summation by first sum of products and second sum of products, be defined as the target function of described services sets, described first product takies the product of the accumulation amount variable corresponding with mute path described in described every bar for the flow in mute path described in described every bar, and described second product takies the product in shortest route path described in accumulation amount and described every bar for the flow in shortest route path described in described every bar.

Alternatively, on the basis of embodiment corresponding to above-mentioned Figure 11, in the 4th embodiment of the controller 20 that the embodiment of the present invention provides,

Described first determining unit 2042, specifically for the summation by first sum of products and second sum of products, be defined as the target function of described services sets, described first product is the product of the length in mute path described in the described every bar variable corresponding with mute path described in described every bar, the product in shortest route path described in the length that described second product is shortest route path described in described every bar and described every bar.

Alternatively, on the basis of embodiment corresponding to above-mentioned Figure 11, in the 5th embodiment of the controller 20 that the embodiment of the present invention provides,

Described third linear computing unit 2054, specifically for according to upgrade after target function, upgrade after traffic constraints set of circumstances, upgrade after the complete configuration constraint set of circumstances of business, and variable corresponding to described each described routed path carries out the second calculating for natural constraints, until the described second result calculated does not comprise the mute path of described any one business of service set, obtain the final route path that described each business is unique.

Alternatively, on the basis of embodiment corresponding to above-mentioned Figure 11, in the 6th embodiment of the controller 20 that the embodiment of the present invention provides,

Described third linear computing unit, specifically for carrying out the second calculating according to the traffic constraints set of circumstances after the target function after renewal, renewal and the complete configuration constraint set of circumstances of business after upgrading, until the described second result calculated does not comprise the mute path of described any one business of service set; When the arbitrary business in described each business is to when should have at least two routed paths, the variable adding described each described routed path corresponding re-starts calculating for natural constraints, obtains the final route path that described each business is unique.

Alternatively, on the basis of embodiment corresponding to above-mentioned Figure 11, in the 7th embodiment of the controller 20 that the embodiment of the present invention provides,

Described third linear computing unit, specifically for carrying out the second calculating according to the traffic constraints set of circumstances after the target function after renewal, renewal and the complete configuration constraint set of circumstances of business after upgrading, until the described second result calculated does not comprise the mute path of described any one business of service set; When the arbitrary business in described each business is to when should have at least two routed paths, using make described target function value minimum routed path as the final route path of described arbitrary business, obtain the final route path that described each business is unique.

In the embodiment of the present invention, first determination module, the second determination module, the 3rd determination module can be determination modules, first determining unit, the second determining unit, the 3rd determining unit also can be determining units, and the first linear computing element, the second linear computing element and iterative computation unit also can be computing units.The present invention is not specifically limited the division of module, unit.

The description that the embodiment of the controller that Fig. 9-Figure 11 is corresponding or each embodiment can consult Fig. 1 to Fig. 8 part is understood, and this place does not do and too much repeats.

In multiple embodiments of above-mentioned controller, should be understood that, under a kind of implementation, acquisition module can be realized by I/O I/O equipment (such as network interface card), first determination module, the second determination module, the 3rd determination module, configuration module, (in other words, namely cooperatively interacted by the special instruction in processor and the memory that is coupled with described processor realize) that can be realized by the program in processor execute store or instruction; Under another kind of implementation, acquisition module can be realized by I/O I/O equipment (such as network interface card), first determination module, the second determination module, the 3rd determination module, configuration module also can realize respectively by proprietary circuit, specific implementation, see prior art, repeats no more here; Under another implementation; acquisition module can be realized by I/O I/O equipment (such as network interface card); first determination module, the second determination module, the 3rd determination module, configuration module also can pass through field programmable gate array (FPGA; Field-ProgrammableGateArray) realize; specific implementation is see prior art; here repeat no more; the present invention includes but be not limited to aforementioned implementation; should be understood that; as long as according to the scheme that thought of the present invention realizes, all fall into the scope that the embodiment of the present invention is protected.

Present embodiments provide a kind of hardware configuration of controller, shown in Figure 12, a kind of hardware configuration of controller can comprise:

Transceiving device, software components and hardware device three part;

Transceiving device is the hardware circuit for completing pack receiving and transmitting;

Hardware device also can claim " hardware processing module ", or it is simpler, also can referred to as " hardware ", hardware device mainly comprises the hardware circuit realizing some specific function based on FPGA, ASIC and so on special hardware circuit (also can coordinate other support devices, as memory), its processing speed is compared general processor and is often wanted fast a lot, but function is once customization, be just difficult to change, therefore, to implement and dumb, be commonly used to process some fixing functions.It should be noted that, hardware device in actual applications, also MCU (microprocessor can be comprised, as single-chip microcomputer) or the processor such as CPU, but the major function of these processors has been not the process of large data, and be mainly used in carrying out some controls, under this application scenarios, the system of being arranged in pairs or groups by these devices is hardware device.

Software components (or also simple " software ") mainly comprise general processor (such as CPU) and some supporting devices (as the memory device such as internal memory, hard disk) thereof, treatment tool can be allowed for corresponding processing capacity by programming, when realizing with software, can according to business flexible configuration, but often speed is compared hardware device and is wanted slow.After software processes, the data processed can be sent by transceiving device by hardware device, the interface that also can be connected with transceiving device by is to the complete data of transceiving device transmission processing.

In the present embodiment, transceiving device for obtain the business of routed path to be configured source node identification, destination node mark and traffic demand, software components or hardware device are used for determining shortest route path and final route path etc.

Other functions of hardware device and software components are discussed in the aforementioned embodiment in detail, repeat no more here.

Can be realized by I/O I/O equipment (such as network interface card) below in conjunction with accompanying drawing with regard to acquisition module, determination module, configuration module can be the technical scheme that can be realized by the program in processor execute store or instruction to do detailed introduction:

Figure 13 is the structural representation of the controller 20 that the embodiment of the present invention provides.Controller 20 is applied to software defined network SDN, described controller 20 comprises processor 210, memory 250 and I/O I/O equipment 230, memory 250 can comprise read-only memory and random access memory, and provides operational order and data to processor 210.A part for memory 250 can also comprise nonvolatile RAM (NVRAM).

In some embodiments, memory 250 stores following element, executable module or data structure, or their subset, or their superset:

In embodiments of the present invention, by calling the operational order (this operational order can store in an operating system) that memory 250 stores,

Obtain each business of service set source node identification corresponding respectively, destination node mark and traffic demand;

The source node identification corresponding respectively according to each business of described service set and destination node mark, and the network topology at described service set institute's active node and all destination node places, determine the shortest route path of described each business and the mute path of described each business, the shortest route path of described each business is the described business routed path that resource occupation accumulation amount is minimum in described network topology, the mute path of described each business is the described business routed path that resource occupation accumulation amount is maximum in described network topology, business corresponding to described mute path cannot be transmitted in the mute path of described each business, described resource occupation accumulation amount represents the resource occupation amount sum on the limit forming described routed path, described limit represents the annexation between two routing nodes of direct communication in described network topology,

According to the traffic demand of described each business, determine the flow distribution situation on the limit in the shortest route path of described each business and the mute path of described each business;

According to every bar, described in the resource occupation accumulation amount in shortest route path and every bar, the resource occupation accumulation amount in mute path determines the target function of described services sets, according to the flow distribution situation on the limit in the shortest route path of described each business and the mute path of described each business, the residual flow capacity on every bar limit of described network topology and the complete configuration requirement of described services sets determine the constraints of described services sets, the residual flow capacity on described every bar limit is that described limit is for configuring the maximum stream flow of described service set business, the complete configuration requirement of described services sets represents and is configured in described network topology by whole business of described service set by the traffic demand of described each business,

According to target function and the constraints of described services sets, it is the final route path of each business described in each business configuration of described service set.

With the allocation plan in shortest route path in prior art cause the volume of business in SDN low compared with, the controller that the embodiment of the present invention provides, fully take into account the residual flow capacity on every bar limit in the traffic demand of each business of service set and network topology, thus make each business of service set can be configured to the final route path of not conflicting with other business in network topology, not conflicting with other business refers to that the flow occupancy with the common edge in the final route path of other business is no more than the residual flow capacity on this limit.Thus the optimum routed path configuration achieved business, both improve the volume of business of routed path in SDN, improve again the whole network resource utilization of SDN.

Processor 210 controls the operation of controller 20, and processor 210 can also be called CPU (CentralProcessingUnit, CPU).Memory 250 can comprise read-only memory and random access memory, and provides instruction and data to processor 210.A part for memory 250 can also comprise nonvolatile RAM (NVRAM).Each assembly of concrete application middle controller 20 is coupled by bus system 220, and wherein bus system 220 is except comprising data/address bus, can also comprise power bus, control bus and status signal bus in addition etc.But for the purpose of clearly demonstrating, in the drawings various bus is all designated as bus system 220.

The method that the invention described above embodiment discloses can be applied in processor 210, or is realized by processor 210.Processor 210 may be a kind of integrated circuit (IC) chip, has the disposal ability of signal.In implementation procedure, each step of said method can be completed by the instruction of the integrated logic circuit of the hardware in processor 210 or software form.Above-mentioned processor 210 can be general processor, digital signal processor (DSP), application-specific integrated circuit (ASIC) (ASIC), ready-made programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic, discrete hardware components.Can realize or perform disclosed each method, step and the logic diagram in the embodiment of the present invention.The processor etc. of general processor can be microprocessor or this processor also can be any routine.Step in conjunction with the method disclosed in the embodiment of the present invention directly can be presented as that hardware decoding processor is complete, or combines complete by the hardware in decoding processor and software module.Software module can be positioned at random asccess memory, flash memory, read-only memory, in the storage medium of this area maturations such as programmable read only memory or electrically erasable programmable memory, register.This storage medium is positioned at memory 250, and processor 210 reads the information in memory 250, completes the step of said method in conjunction with its hardware.

Alternatively, processor 210 specifically for:

According to described target function, traffic constraints set of circumstances and the complete configuration constraint set of circumstances of business carry out the first calculating, described traffic constraints set of circumstances comprises the traffic constraints condition on limit described in described every bar, and described business complete configuration constraint set of circumstances comprises the complete configuration constraint condition of business of described each business;

According to the mute path comprised in the described first result calculated, calculate the new shortest route path of described each business;

According to the new shortest route path of described each business, upgrade described target function, described traffic constraints set of circumstances and the complete configuration constraint set of circumstances of business;

The second calculating is carried out according to target function, the traffic constraints set of circumstances after renewal and the complete configuration constraint set of circumstances of business after upgrading after upgrading, until the described second result calculated does not comprise the mute path of described any one business of service set, according to the final route path that the described second result calculated is each business described in each business configuration of described service set.

Alternatively, processor 210 specifically for:

For routed path described in every bar arranges one respectively for characterizing the variable of described routed path, described routed path comprises described mute path and described shortest route path;

According to the summation of first sum of products and second sum of products, determine the target function of described services sets, described first product is the product of the variable that the resource occupation accumulation amount in a described mute path is corresponding with described mute path, described first sum of products be first product in the mute path of all business of described service set and, described second product is the resource occupation accumulation amount in a described shortest route path and the product in described shortest route path, described second sum of products be second product in the shortest route path of all business of described service set and;

For limit described in every bar, the summation of the 3rd sum of products and the 4th sum of products is not more than the restriction relation of the residual flow capacity on described limit, be defined as the traffic constraints condition in described constraints, described 3rd product is the product of one article of described shortest route path variable that flow distribution situation is corresponding with described shortest route path on described limit, described 3rd sum of products be the 3rd product in the shortest route path of all business of described service set and, described 4th product is the product of one article of described mute path variable that flow distribution situation is corresponding with described mute path on described limit, described 4th sum of products be the 4th product in the mute path of all business of described service set and,

For described each business, 5th sum of products is equaled the equality constraint relation of 1, be defined as the complete configuration constraint condition of business in described constraints, described 5th product is the product for characterizing coefficient that whether one article of described routed path taken by the described business variable corresponding with described routed path, described 5th sum of products be the 5th product of the routed path of all business of described service set and.

Alternatively, processor 210 is specifically for the summation by first sum of products and second sum of products, be defined as the target function of described services sets, described first product takies the product of the accumulation amount variable corresponding with mute path described in described every bar for the flow in mute path described in described every bar, and described second product takies the product in shortest route path described in accumulation amount and described every bar for the flow in shortest route path described in described every bar.

Alternatively, processor 210 is specifically for the summation by first sum of products and second sum of products, be defined as the target function of described services sets, described first product is the product of the length in mute path described in the described every bar variable corresponding with mute path described in described every bar, the product in shortest route path described in the length that described second product is shortest route path described in described every bar and described every bar.

Alternatively, processor 210 is specifically for when defining arbitrary business according to the result of calculation of linear programming to when should have at least two routed paths, give up described linear programming result of calculation, add the constraints that variable corresponding to the described mute path of every bar and described every bar shortest route path is all integer, re-use linear programming to calculate the complete configuration constraint condition of described traffic constraints conditions and traffic, displace the described mute path of every bar.

Alternatively, processor 210 specifically for according to upgrade after target function, upgrade after traffic constraints set of circumstances, upgrade after the complete configuration constraint set of circumstances of business, and variable corresponding to described each described routed path carries out the second calculating for natural constraints, until the described second result calculated does not comprise the mute path of described any one business of service set, obtain the final route path that described each business is unique.

Alternatively, processor 210 is specifically for carrying out the second calculating according to the traffic constraints set of circumstances after the target function after renewal, renewal and the complete configuration constraint set of circumstances of business after upgrading, until the result of described second calculating does not comprise the mute path of described any one business of service set; When the arbitrary business in described each business is to when should have at least two routed paths, the variable adding described each described routed path corresponding re-starts calculating for natural constraints, obtains the final route path that described each business is unique.

Alternatively, processor 210 is specifically for carrying out the second calculating according to the traffic constraints set of circumstances after the target function after renewal, renewal and the complete configuration constraint set of circumstances of business after upgrading, until the result of described second calculating does not comprise the mute path of described any one business of service set; When the arbitrary business in described each business is to when should have at least two routed paths, using make described target function value minimum routed path as the final route path of described arbitrary business, obtain the final route path that described each business is unique

The description that the embodiment of the controller that Figure 13 is corresponding or each embodiment can consult Fig. 1 to Figure 12 part is understood, and this place does not do and too much repeats.

One of ordinary skill in the art will appreciate that all or part of step in the various methods of above-described embodiment is that the hardware that can carry out instruction relevant by program has come, this program can be stored in a computer-readable recording medium, and storage medium can comprise: ROM, RAM, disk or CD etc.

What provide the embodiment of the present invention above is described in detail for the controller in the method for business configuration routed path and SDN, apply specific case herein to set forth principle of the present invention and execution mode, the explanation of above embodiment just understands method of the present invention and core concept thereof for helping; Meanwhile, for one of ordinary skill in the art, according to thought of the present invention, all will change in specific embodiments and applications, in sum, this description should not be construed as limitation of the present invention.

Claims (16)

1. be a method for business configuration routed path, it is characterized in that, described method is applied to the controller of software defined network SDN, and described method comprises:

Obtain each business of service set source node identification corresponding respectively, destination node mark and traffic demand;

The source node identification corresponding respectively according to each business of described service set and destination node mark, and the network topology at described service set institute's active node and all destination node places, determine the shortest route path of described each business and the mute path of described each business, the shortest route path of described each business is the described business routed path that resource occupation accumulation amount is minimum in described network topology, the mute path of described each business is the described business routed path that resource occupation accumulation amount is maximum in described network topology, business corresponding to described mute path cannot be transmitted in the mute path of described each business, described resource occupation accumulation amount represents the resource occupation amount sum on the limit forming described routed path, described limit represents the annexation between two routing nodes of direct communication in described network topology,

According to the traffic demand of described each business, determine the flow distribution situation on the limit in the shortest route path of described each business and the mute path of described each business;

According to every bar, described in the resource occupation accumulation amount in shortest route path and every bar, the resource occupation accumulation amount in mute path determines the target function of described services sets, according to the flow distribution situation on the limit in the shortest route path of described each business and the mute path of described each business, the residual flow capacity on every bar limit of described network topology and the complete configuration requirement of described services sets determine the constraints of described services sets, the residual flow capacity on described every bar limit is that described limit is for configuring the maximum stream flow of described service set business, the complete configuration requirement of described services sets represents and is configured in described network topology by whole business of described service set by the traffic demand of described each business,

According to target function and the constraints of described services sets, it is the final route path of each business described in each business configuration of described service set.

2. method according to claim 1, is characterized in that, the described target function according to described services sets and constraints, is the final route path of each business described in each business configuration of described service set, comprises:

According to described target function, traffic constraints set of circumstances and the complete configuration constraint set of circumstances of business carry out the first calculating, described traffic constraints set of circumstances comprises the traffic constraints condition on limit described in described every bar, and described business complete configuration constraint set of circumstances comprises the complete configuration constraint condition of business of described each business;

According to the mute path comprised in the described first result calculated, calculate the new shortest route path of described each business;

According to the new shortest route path of described each business, upgrade described target function, described traffic constraints set of circumstances and the complete configuration constraint set of circumstances of business;

The second calculating is carried out according to target function, the traffic constraints set of circumstances after renewal and the complete configuration constraint set of circumstances of business after upgrading after upgrading, until the described second result calculated does not comprise the mute path of described any one business of service set, according to the final route path that the described second result calculated is each business described in each business configuration of described service set.

3. method according to claim 1 and 2, it is characterized in that, described in the resource occupation accumulation amount in shortest route path described in the every bar of described basis and every bar, the resource occupation accumulation amount in mute path determines the target function of described services sets, determine the constraints of described services sets according to the flow distribution situation on limit in the shortest route path of described each business and the mute path of described each business, the residual flow capacity on every bar limit of described network topology and the complete configuration requirement of described services sets, comprising:

For routed path described in every bar arranges one respectively for characterizing the variable of described routed path, described routed path comprises described mute path and described shortest route path;

According to the summation of first sum of products and second sum of products, determine the target function of described services sets, described first product is the product of the variable that the resource occupation accumulation amount in a described mute path is corresponding with described mute path, described first sum of products be first product in the mute path of all business of described service set and, described second product is the resource occupation accumulation amount in a described shortest route path and the product in described shortest route path, described second sum of products be second product in the shortest route path of all business of described service set and;

For limit described in every bar, the summation of the 3rd sum of products and the 4th sum of products is not more than the restriction relation of the residual flow capacity on described limit, be defined as the traffic constraints condition in described constraints, described 3rd product is the product of one article of described shortest route path variable that flow distribution situation is corresponding with described shortest route path on described limit, described 3rd sum of products be the 3rd product in the shortest route path of all business of described service set and, described 4th product is the product of one article of described mute path variable that flow distribution situation is corresponding with described mute path on described limit, described 4th sum of products be the 4th product in the mute path of all business of described service set and,

For described each business, 5th sum of products is equaled the equality constraint relation of 1, be defined as the complete configuration constraint condition of business in described constraints, described 5th product is the product for characterizing coefficient that whether one article of described routed path taken by the described business variable corresponding with described routed path, described 5th sum of products be the 5th product of the routed path of all business of described service set and.

4. method according to claim 3, it is characterized in that, described by the summation of first sum of products and second sum of products, be defined as the target function of described services sets, described first product is the product of the resource occupation accumulation amount in mute path described in the described every bar variable corresponding with mute path described in described every bar, the product in shortest route path described in the resource occupation accumulation amount that described second product is shortest route path described in described every bar and described every bar, comprising:

By the summation of first sum of products and second sum of products, be defined as the target function of described services sets, described first product takies the product of the accumulation amount variable corresponding with mute path described in described every bar for the flow in mute path described in described every bar, and described second product takies the product in shortest route path described in accumulation amount and described every bar for the flow in shortest route path described in described every bar.

5. method according to claim 3, it is characterized in that, described by the summation of first sum of products and second sum of products, be defined as the target function of described services sets, described first product is the product of the resource occupation accumulation amount in mute path described in the described every bar variable corresponding with mute path described in described every bar, the product in shortest route path described in the resource occupation accumulation amount that described second product is shortest route path described in described every bar and described every bar, comprising:

By the summation of first sum of products and second sum of products, be defined as the target function of described services sets, described first product is the product of the length in mute path described in the described every bar variable corresponding with mute path described in described every bar, the product in shortest route path described in the length that described second product is shortest route path described in described every bar and described every bar.

6. method according to claim 3, it is characterized in that, described according to upgrade after target function, upgrade after traffic constraints set of circumstances and upgrade after the complete configuration constraint set of circumstances of business carry out the second calculating, until the described second result calculated does not comprise the mute path of described any one business of service set, comprising:

According to the traffic constraints set of circumstances after the target function after renewal, renewal, the complete configuration constraint set of circumstances of business after renewal, and variable corresponding to described each described routed path carries out the second calculating for natural constraints, until the described second result calculated does not comprise the mute path of described any one business of service set, obtain the final route path that described each business is unique.

7. method according to claim 3, it is characterized in that, described according to upgrade after target function, upgrade after traffic constraints set of circumstances and upgrade after the complete configuration constraint set of circumstances of business carry out the second calculating, until the described second result calculated does not comprise the mute path of described any one business of service set, comprising:

The second calculating is carried out, until the described second result calculated does not comprise the mute path of described any one business of service set according to target function, the traffic constraints set of circumstances after renewal and the complete configuration constraint set of circumstances of business after upgrading after upgrading;

When the arbitrary business in described each business is to when should have at least two routed paths, the variable adding described each described routed path corresponding re-starts calculating for natural constraints, obtains the final route path that described each business is unique.

8. method according to claim 3, it is characterized in that, described according to upgrade after target function, upgrade after traffic constraints set of circumstances and upgrade after the complete configuration constraint set of circumstances of business carry out the second calculating, until the described second result calculated does not comprise the mute path of described any one business of service set, comprising:

The second calculating is carried out, until the described second result calculated does not comprise the mute path of described any one business of service set according to target function, the traffic constraints set of circumstances after renewal and the complete configuration constraint set of circumstances of business after upgrading after upgrading;

When the arbitrary business in described each business is to when should have at least two routed paths, using make described target function value minimum routed path as the final route path of described arbitrary business, obtain the final route path that described each business is unique.

9. be applied to a controller of software defined network SDN, it is characterized in that, comprising:

Acquisition module, for obtaining each business of service set source node identification corresponding respectively, destination node mark and traffic demand;

First determination module, the source node identification that each business of described service set for obtaining according to described acquisition module is corresponding respectively and destination node mark, and the network topology at described service set institute's active node and all destination node places, determine the shortest route path of described each business and the mute path of described each business, the shortest route path of described each business is the described business routed path that resource occupation accumulation amount is minimum in described network topology, the mute path of described each business is the described business routed path that resource occupation accumulation amount is maximum in described network topology, business corresponding to described mute path cannot be transmitted in the mute path of described each business, described resource occupation accumulation amount represents the resource occupation amount sum on the limit forming described routed path, described limit represents the annexation between two routing nodes of direct communication in described network topology,

Second determination module, for the traffic demand of described each business obtained according to described acquisition module, determines the flow distribution situation on the limit in the shortest route path of described each business that described first determination module is determined and the mute path of described each business;

3rd determination module, the target function of described services sets is determined for the resource occupation accumulation amount in mute path described in the resource occupation accumulation amount in shortest route path according to every bar and every bar, the flow distribution situation on the shortest route path of described each business determined according to described second determination module and the limit in the mute path of described each business, the residual flow capacity on every bar limit of described network topology and the complete configuration requirement of described services sets determine the constraints of described services sets, the residual flow capacity on described every bar limit is that described limit is for configuring the maximum stream flow of described service set business, the complete configuration requirement of described services sets represents and is configured in described network topology by whole business of described service set by the traffic demand of described each business,

Configuration module, for the target function of described services sets determined according to described 3rd determination module and constraints, is the final route path of each business described in each business configuration of described service set.

10. controller according to claim 9, is characterized in that, described configuration module comprises:

First linear computing element, for according to described target function, traffic constraints set of circumstances and the complete configuration constraint set of circumstances of business carry out the first calculating, described traffic constraints set of circumstances comprises the traffic constraints condition on limit described in described every bar, and described business complete configuration constraint set of circumstances comprises the complete configuration constraint condition of business of described each business;

Second linear computing element, for the mute path that comprises in the first result calculated of calculating according to described first linear computing element, calculates the new shortest route path of described each business;

Updating block, for the new shortest route path of described each business calculated according to described second linear computing element, upgrades described target function, described traffic constraints set of circumstances and the complete configuration constraint set of circumstances of business;

Third linear computing unit, the second calculating is carried out, until the described second result calculated does not comprise the mute path of described any one business of service set for target function, the traffic constraints set of circumstances after renewal and the complete configuration constraint set of circumstances of business after upgrading after upgrading according to described updating block.

Dispensing unit, for the final route path being each business described in each business configuration of described service set according to the second result calculated of described 3rd computing unit.

11. controllers according to claim 9 or 10, it is characterized in that, described 3rd determination module comprises:

Setting unit, for arranging one respectively for characterizing the variable of described routed path for routed path described in every bar, described routed path comprises described mute path and described shortest route path;

First determining unit, for the summation according to first sum of products and second sum of products, determine the target function of described services sets, described first product is the product of the variable that the resource occupation accumulation amount in a described mute path is corresponding with described mute path, described first sum of products be first product in the mute path of all business of described service set and, described second product is the resource occupation accumulation amount in a described shortest route path and the product in described shortest route path, described second sum of products be second product in the shortest route path of all business of described service set and,

Second determining unit, for for limit described in every bar, the summation of the 3rd sum of products and the 4th sum of products is not more than the restriction relation of the residual flow capacity on described limit, be defined as the traffic constraints condition in described constraints, described 3rd product is the product of one article of described shortest route path variable that flow distribution situation is corresponding with described shortest route path on described limit, described 3rd sum of products be the 3rd product in the shortest route path of all business of described service set and, described 4th product is the product of one article of described mute path variable that flow distribution situation is corresponding with described mute path on described limit, described 4th sum of products be the 4th product in the mute path of all business of described service set and,

3rd determining unit, for for described each business, 5th sum of products is equaled the equality constraint relation of 1, be defined as the complete configuration constraint condition of business in described constraints, described 5th product is the product for characterizing coefficient that whether one article of described routed path taken by the described business variable corresponding with described routed path, described 5th sum of products be the 5th product of the routed path of all business of described service set and.

12. controllers according to claim 11, is characterized in that,

Described first determining unit, specifically for the summation by first sum of products and second sum of products, be defined as the target function of described services sets, described first product takies the product of the accumulation amount variable corresponding with mute path described in described every bar for the flow in mute path described in described every bar, and described second product takies the product in shortest route path described in accumulation amount and described every bar for the flow in shortest route path described in described every bar.

13. controllers according to claim 11, is characterized in that,

Described first determining unit, specifically for the summation by first sum of products and second sum of products, be defined as the target function of described services sets, described first product is the product of the length in mute path described in the described every bar variable corresponding with mute path described in described every bar, the product in shortest route path described in the length that described second product is shortest route path described in described every bar and described every bar.

14. controllers according to claim 11, is characterized in that,

Described third linear computing unit, specifically for according to upgrade after target function, upgrade after traffic constraints set of circumstances, upgrade after the complete configuration constraint set of circumstances of business, and variable corresponding to described each described routed path carries out the second calculating for natural constraints, until the described second result calculated does not comprise the mute path of described any one business of service set, obtain the final route path that described each business is unique.

15. controllers according to claim 11, is characterized in that,

Described third linear computing unit, specifically for carrying out the second calculating according to the traffic constraints set of circumstances after the target function after renewal, renewal and the complete configuration constraint set of circumstances of business after upgrading, until the described second result calculated does not comprise the mute path of described any one business of service set; When the arbitrary business in described each business is to when should have at least two routed paths, the variable adding described each described routed path corresponding re-starts calculating for natural constraints, obtains the final route path that described each business is unique.

16. controllers according to claim 11, is characterized in that,

Described third linear computing unit, specifically for carrying out the second calculating according to the traffic constraints set of circumstances after the target function after renewal, renewal and the complete configuration constraint set of circumstances of business after upgrading, until the described second result calculated does not comprise the mute path of described any one business of service set; When the arbitrary business in described each business is to when should have at least two routed paths, using make described target function value minimum routed path as the final route path of described arbitrary business, obtain the final route path that described each business is unique.