CN105515987B - A kind of mapping method based on SDN framework Virtual optical-fiber networks - Google Patents
A kind of mapping method based on SDN framework Virtual optical-fiber networks Download PDFInfo
- Publication number
- CN105515987B CN105515987B CN201510874461.6A CN201510874461A CN105515987B CN 105515987 B CN105515987 B CN 105515987B CN 201510874461 A CN201510874461 A CN 201510874461A CN 105515987 B CN105515987 B CN 105515987B
- Authority
- CN
- China
- Prior art keywords
- node
- domain
- mapping
- link
- chromosome
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/38—Flow based routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A kind of mapping method based on SDN framework Virtual optical-fiber networks, including step 1：It determines each network parameter and topology diagram of virtual request and physics bottom, and creates the topology auxiliary figure using VON-FP values as link metric, determine optimization aim；Step 2：Link on topology auxiliary figure is arranged by VON-FP value ascending orders, is classified according to virtual request, and mapping mode is determined according to mapping ruler；Step 3：A kind of method frame of the global search based on population and the partial heuristic search based on individual is formulated, the virtual optical network classified is asked to carry out solution mapping with this searching method；Step 4：The method of iteration search mapping obtains optimal mapping scheme when fitness function minimum, and the program, which is distributed to the NOX frameworks based on SDN, carries out specific data calculating and traffic forwarding operations.The method of the present invention improves the efficiency of multi-domain virtual optical-fiber network mapping, and reduces the mortality of whole network after mapping.
Description
Technical field
The invention belongs to network technique fields, and in particular to a kind of mapping side based on SDN framework Virtual optical-fiber networks
Method.
Background technology
With big data business and the explosive growth based on cloud data application, the virtualization of network more and more by
The network congestion that can't resolve applied to solution traditional network architecture.It is of greatest concern in all virtualization network problems
Be virtual optical network mapping (virtual optical network embedding, VONE).The virtualization of optical-fiber network has
At a high speed, the advantages of high bandwidth dynamic, vast capacity and rich interface, and network reflects, and affects the working efficiency of whole network.
The critical issue that virtual optical network mapping faces mainly has：The constraints of optical-fiber network transmission, the design of mapping method realize with
And the optimization of network mapping.
Network mapping is to be mapped to the node and link in virtual network requests in the case where meeting constraints
On physics optical-fiber network, and expense summation is minimized for specific optimization aim.The mapping of network affects whole network
Time delay, the Service Quality Metrics such as power consumption (Quality of Service, QoS).Virtual optical network mapping in single domain in recent years
Solution is there has been, and the virtual optical network in multiple domain is mapped, with the biological treatability (network of network
Survivability it is) optimization aim, good solution is not yet received.The mapping problems of network is proven NP-hard and asks
Topic, belongs to quadratic assignment problem scope.
Since multiple-domain network pelagical resources distribute to different bottom-layer networks, this is inevitably caused between domain not
The transparency, controller are difficult to coordinate to transmit in domain to transmit between domain, and do not consider light in existing mapping method completely
The constraints and biological treatability of network.Such as the consistency of frequency-division section and company on optical network link need to be abided by when optical-fiber network transmission
There are certain mortalitys when continuous property and mapping link.Therefore the application proposes a kind of based on software defined network framework
The multi-domain virtual optical-fiber network mapping scheme of (software defined network, SDN), and by a kind of based on the complete of population
The method of office's search and the partial heuristic search based on individual solves, it is intended under the conditions of multiple domain parallel processing, utilize SDN frameworks
The survivability of network in the advantage optimization multiple domain that middle control plane is detached with data plane.
Invention content
It is an object of the invention to, provide a kind of to be based on SDN framework Virtuals the problems in for the above-mentioned prior art
The mapping method of optical-fiber network, this method promote the efficiency that multiple domain maps parallel with center control, programming network,
And using the method mapping of a kind of global search based on population and the partial heuristic search based on individual, fully considering light
Under the constraints of network, the mortality of virtual network is effectively reduced.
To achieve the goals above, the technical solution adopted by the present invention is：
Step 1：Determine virtual optical network request and physics bottom each network parameter and topology diagram, and create with
VON-FP values are the auxiliary topological diagram of link metric, determine optimization aim；
Step 2：The link on topological diagram will be assisted to be arranged by VON-FP value ascending orders, divided according to virtual optical network request
Class, and determine mapping mode according to the classifying rules of mapping；
Step 3：A kind of method frame of the global search based on population and the partial heuristic search based on individual is formulated,
The virtual optical network classified is asked to carry out solution mapping with this searching method；；
Step 4：The method of iteration search mapping obtains optimal mapping scheme when fitness function minimum, by the party
Case distributes to the NOX frameworks based on SDN and carries out specific data calculating and traffic forwarding operations.
The step 1 builds Gv (Vv, Ev, Cv, Tv, CDv) undirected topological diagram when determining virtual request, and Vv is virtually to save
The intersection of point, Ev is the intersection of virtual link, and Cv is the expense of resource on node, and Tv is the expense transmitted on link, and CDv is indicated
Domain name belonging to it；Physics bottom is described Gs (Dp, Lp), and wherein Dp is the intersection in domain, and Lp is the collection of domain-to-domain link, chain between domain
Road space meets transport overhead enough, then domain name is that the Dp of i is described as Dpi (Ni, Ei, Bi, Ci, Fi), and wherein Ni is saved in domain
Point, Ei are domain links, and Bi is the fringe node in domain, Ci and Fi respectively represent in domain on physical node available resource and
Available frequency band slot on physical link, each frequency band tankage are 12.5GB/s.
The step 2 calculates link VON-FP values, is created on original physical topological diagram using this value as the weights of link auxiliary
Helping topological diagram, it is known that L (x, y) indicates that node x with the domain-to-domain link between y, defines the probability that P (x, y) fails for its error, that
The survivability of this section of link：
Survivability(x,y)=1-P(x,y)。
The step 4 defines the total link failure rate of whole network：
When definition optimum mapping scheme is that fitness function Fitness (x) is minimized：
Classified according to virtual request, and determines that mapping mode is according to mapping ruler：
1) if two end nodes did not all map in virtual request link, and the affiliated domain of two nodes is identical, then is mapped
In same domain；2) if two end nodes did not all map in virtual request link, and the affiliated domain of two nodes have it is multiple common
Domain, a domain is randomly choosed when mapping；3) if the affiliated domain of virtual request both link ends node does not have common domain, select
Two nodes, near two preceding affiliated domains, are respectively mapped to the fringe node in respective domain by domain-to-domain link in auxiliary figure sequence
On；If 4) node of virtual request link one end is disposed, another end node is mapped in same domain.
Formulate a kind of the specific of the method frame of global search based on population and the partial heuristic search based on individual
Method is：1) method for determining the global search based on population and the partial heuristic search based on individual is calculated using cultural gene
Method frame 2) determine parameter, define the host vector H of chromosomei kIndicate the dummy node k's that it is carried on i-th of chromosome
Physical node, the state vector S of chromosomei kWhether dummy node k of the recording carrying on i-th of chromosome needs to be reflected again
The state penetrated, if Si k=0, then corresponding dummy node should remap, otherwise keep the current mapping of the dummy node,
Mbest is defined as local best mapping scheme, i.e., best in current iteration fitness function, nbest be defined as be at present
The optimum value only obtained, NR (u) are a kind of sort methods of node u, and Pv is the probability of selection:
Here u is dummy node or physical node；If u is a physical node, L (u) is all connection u nodes
The set of link, C (u) are remaining node resource, and b (l) is remaining link circuit resource；If u is dummy node a U, L
(U) it is all set for connecting u node virtual links, C (u) is the node resource of demand, and b (l) is the link circuit resource of demand.
Definition initialization：1) for physical node v, if v belongs to Hi and corresponding Si kBe 1, then define this node be can
Tactile, otherwise this node is that can not touch；2) for dummy node u, if corresponding Si kIt is included in Priority Queues PQ for 0
In；3) dummy node and all physical nodes that can not be touched in all PQ are calculated according to NR (u) functions, and will be in queue PQ
Dummy node by NR (u) value descendings arrange；4) the dummy node u in PQ queues is fallen out by NR (u) values are descending, is established
One candidate list CL (v) being made of physical node v, the physical node of eligible list is necessary for touch and remaining node resource is full
Sufficient resource requirement selects physical node v demapping dummy nodes u with the probability of Pv from CL (v)；5) step 4) repeatedly, until
PQ queues are sky.
It executes the global search based on population and the method based on individual partial heuristic search is：1) nbest is set
To+∞, all state vector Si kZero, initializes the host vector Hi of all chromosomes, then at random by state vector Si kIt sets
It is 0 or 1, for each chromosome, checks its feasibility and calculate its fitness function F (X), calculate current population
Simultaneously nbest=mbest is arranged in mbest；2) new filial generation is generated by selection, intersection and variation, selection i.e. selection has minimum
The chromosome of fitness function F (x), and put it into next filial generation, remaining chromosome is included into queue TQ；Cross and variation
Remaining feasible chromosome in queue TQ is matched, is then intersected to obtain two new dyeing with crossover probability Pc
Body；Variation i.e. to the new chromosome that is generated in queue with the probability of Pm into row variation；Finally these new chromosomes are put into
In the next generation；3) simulated annealing carries out local search, for chromosome all in queue TQ, with simulated annealing into
Row local search selects the elite chromosome in different zones；When the temperature of system T is less than predefined Tmin, please execute
It operates below：Receive it if fitness function reduces by the mobile fitness function for detecting different chromosomes, otherwise, with
The probability of Ph receives it；Then system T carries out moving back temperature with decay factor r：T (n+1)=r*T (n)；4) according to light network restraining item
Part screens chromosome, initializes again, it is impossible to and the fitness function f (x) for meeting light network restraining condition chromosome is set to+∞,
Go out the chromosome that all fitness function f (x) in rank queue TQ are+∞, by the state vector S of these infeasible chromosomesi k
Zero setting, and its host vector Hi is initialized, again at random by state vector S after the completion of initializationi kIt is set to 0 or 1, finally by this
A little updated chromosomes are put into next filial generation；5) initialization updates each chromosome host vector Hi, check feasibility,
Fitness function is calculated, and updates mbest, if more excellent than previous generation, updates nbest；6) it repeats the above steps 1) to step
5), until the maximum number of arrival iteration, the solution that nbest is virtual optical network mapping is finally exported.
Step 4 is obtained what the method for the global search based on population and the partial heuristic search based on individual solved
Mapping scheme distributes to the method that NOX frameworks are handled：Data transmission and calculating routing plan are separated according to NOX frameworks
It is responsible for respectively by N-NOX and P-NOX；N-NOX is used for data forwarding as local control；P-NOX is negative as global controller
Duty receives request from application layer by network management protocol, counts and believes from local control by the resource that OpenFlow agreements transmit
Breath, analysis calculate routing plan and notify the localized routing device in each domain.
Compared with prior art, the present invention has following advantageous effect：By formulate global search based on population and
The virtual optical network classified is asked to be asked with this searching method by the method frame of the partial heuristic search based on individual
Mapping scheme is finally distributed to the NOX frameworks based on SDN and carries out specific data calculating and traffic forwarding operations by demapping,
It is disposed using NOX frameworks, can effectively promote the efficiency of multi-domain virtual optical-fiber network mapping, and reduce the mistake of whole network after mapping
Lose rate.
Further, the survivability of link is calculated in step 2 of the present invention, and link survivability refers to that network is born simultaneously
The ability restored from failure is one of most important requirement in evaluation network, directly affects in network service quality (QoS)
Approve- useful index, its importance is especially apparent under the optical-fiber network of big handling capacity.
Description of the drawings
Fig. 1 present invention searches for the flow chart of mapping method；
The present invention is based on the NOX configuration diagrams of SDN by Fig. 2；
The concrete application schematic diagram of Fig. 3 NOX frameworks of the present invention；
Fig. 4 (a) an example virtual optical network configuration diagrams；
The front and back physical light network architecture schematic diagram of Fig. 4 (b) an example virtual optical networks mapping；
The NSFNET in mono- domain Fig. 5 emulates topological diagram；
The topological sketch plan of NSFNET emulation in tri- domains Fig. 6；
Fig. 7 VON quantity simulation result statistical charts；
The number simulation result statistical chart in the domains Fig. 8.
Specific implementation mode
Present invention will be described in further detail below with reference to the accompanying drawings.
The present invention is based on the mapping methods of SDN framework Virtual optical-fiber networks to include the following steps：
Step 1, each network parameter and topology diagram of virtual request and physics bottom are determined, and is created with VON-FP values
For the topology auxiliary figure of link metric, optimization aim is determined.
1.1, determine that virtual request, virtual request are a undirected topological diagrams, description Gv (Vv, Ev, Cv, Tv, CDv),
Middle Vv is the intersection of dummy node, and Ev is the intersection of virtual link, and Cv is the expense of resource on node, and Tv is transmitted on link
Expense, CDv then indicate the domain name belonging to it.
1.2, physics bottom is determined, physics bottom is described as Gs (Dp, Lp), and wherein Dp is the intersection in domain, and Lp is between domain
The collection of link (this programme assumes that domain-to-domain link space meets transport overhead enough).Domain name be i Dp can be described as again Dpi (Ni,
Ei, Bi, Ci, Fi), wherein Ni is domain interior joint, and Ei is domain link, and Bi is the fringe node in domain, and Ci is respectively represented with Fi
Available frequency band slot in available resource and physical link in domain on physical node, according to binary phase shift keying (Binary
Phase Shift Keying, BPSK), each frequency band tankage is 12.5GB/s.
1.3, link VON-FP values are calculated, width auxiliary is created on original physical topological diagram as the weights of link using this value and is opened up
Flutter figure.
It 1.4, can survival ability optimization aim with low link failure rate and height, it is known that L (x, y) indicates node x between y
Domain-to-domain link defines the probability that P (x, y) is error failure, the survivability of this section of link：
Survivability(x,y)=1-P(x,y)；
The total link failure rate of whole network is defined as
Optimization object function namely takes the minimum value of fitness function Fitness (x)：
Step 2, by topology auxiliary figure on link by VON-FP value ascending orders arrangement, to map, according to virtual request into
Row classification, mapping mode is determined according to mapping ruler.
If 2.1, two end nodes did not all map in virtual request link, and the affiliated domain of two nodes is identical, then is reflected
It penetrates in same domain, because link error rate is generally much smaller than domain-to-domain link in domain.
2.2, if two end nodes did not all map in virtual request link, and the affiliated domain of two nodes have it is multiple common
Domain randomly chooses a domain when mapping, when carrying out node mapping, the physical node near fringe node is selected as possible, so as to domain
Between map.
If 2.3, the affiliated domain of virtual request both link ends node does not have common domain, select domain-to-domain link in auxiliary figure
Near two preceding affiliated domains in sequence, two nodes are respectively mapped on the fringe node in respective domain, to be mapped between domain.
If 2.4, the node of virtual request link one end is disposed, another end node is mapped in as possible identical
In domain.
Step 3, a kind of method frame of the global search based on population and the partial heuristic search based on individual is formulated,
The virtual optical network classified is asked to carry out solution mapping with this searching method, as shown in Figure 1.
3.1, a kind of method frame of the global search based on population and the partial heuristic search based on individual is formulated.Entirely
Office's strategy uses genetic algorithm, local searching strategy to use simulated annealing.
3.2, it determines parameter, defines the host vector H of chromosomei kIndicate that it is carried on the virtual section on i-th of chromosome
The physical node of point k.The state vector S of chromosomei kWhether dummy node k of the recording carrying on i-th of chromosome needs weight
The state being newly mapped, if Si k=0, then corresponding dummy node should remap.Otherwise the current of the dummy node is kept
Mapping.Mbest is defined as local best mapping scheme, i.e., best in current iteration fitness function.Nbest is defined as mesh
Before until the optimum value that is obtained.NR (u) is the sort method of node u, and Pv is select probability：
Here u can be dummy node or physical node.If u is a physical node, L (u) is all connection u
The set of node link, C (u) are remaining node resource, and b (l) is remaining link circuit resource.For dummy node a U, L
(U) it is all set for connecting u node virtual links, C (u) is the node resource of demand, and b (l) is the link circuit resource of demand.
3.3, initial method is defined.Initial method is specially：
3.3.1, for physical node v, if v belongs to Hi and corresponding Si kIt is 1, then defining this node can touch；Instead
This node be can not touch.
3.3.2, for dummy node u, if corresponding Si kIt is included in Priority Queues PQ for 0.
3.3.3 dummy node and all physical nodes that can not be touched in all PQ, are calculated according to NR (u) functions.By team
The dummy node arranged in PQ is arranged by NR (u) value descendings.
3.3.4 the dummy node u in PQ queues is fallen out by NR (u) values are descending, establishes one by physical node v
The candidate list CL (v) of composition, the physical node of eligible list is necessary for touch and remaining node resource meets resource requirement.With Pv
Probability physical node v maps virtual nodes u is selected from CL (v).
3.3.5, step 3.3.4 repeatedly, until PQ queues are sky.
3.4, nbest to+∞, all state vector S are seti kZero.Initialize the host vector Hi of all chromosomes.
Again at random by state vector Si kIt is set to 0 or 1.For each chromosome, checks its feasibility and calculate its fitness function F
(X).It calculates the mbest of current population and nbest=mbest is set.
3.5, new filial generation is generated by selection, intersection and variation.Selection：It selects with minimum fitness function F (x)
Chromosome, and put it into next filial generation, and remaining chromosome is included into queue TQ.Cross and variation：It will be remained in queue TQ
Remaining feasible chromosome is matched, and is then intersected to obtain two new dyes with crossover probability Pc (this programme is set to 0.9)
Colour solid.Variation：To the new chromosome that is generated in queue with the probability of Pm into row variation.Finally these new chromosomes are put into
In the next generation.
3.6, simulated annealing carries out local search.For chromosome all in queue TQ, simulated annealing is used
Carry out local search, it means that the elite chromosome in different zones can be selected.When temperature (this case definition of system (T)
Initial T is that when 100) being less than predefined Tmin (this case is defined as 0.1), please execute following operation：It is different by mobile detection
The fitness function of chromosome receives it if result is preferable, otherwise, receives it with the probability of Ph.Then system (T) is to decline
Subtracting coefficient r carries out moving back temperature：
T (n+1)=r*T (n)
3.7, it according to light network restraining conditional filtering chromosome, is initialized again.Light network restraining item cannot be met
The fitness function f (x) of part (such as consistency and continuity of frequency band slot) chromosome is set to+∞.Go out in rank queue TQ and owns
Fitness function f (x) is the chromosome of+∞, by the state vector S of these infeasible chromosomesi kZero setting, and its host is sweared
Measure Hi initialization.It is randomly provided S again after the completion of initializationi kTo 1, these updated chromosomes are finally put into next filial generation
In.
3.8, contemporary optimal solution is calculated.Initialization update each chromosome host vector Hi, checks its feasibility, calculates
Fitness function, not and update mbest updates nbest if more excellent than previous generation.
Step 4, the method that iteration search maps obtains optimal mapping scheme when fitness function minimum, and distributes
To the NOX frameworks processing based on SDN.
4.1, step 3.3 is repeated to step 3.7, until the maximum number of arrival iteration.Finally output nbest is virtual optical
The solution of network mapping.
4.2, data transmission and calculating routing plan are separated and is responsible for by N-NOX and P-NOX according to NOX frameworks.
4.2.1, N-NOX is used for data forwarding in the method as local control.
4.2.2, P-NOX receives request from application layer in this programme as global controller by network management protocol, statistics from
The resource information that local control is transmitted by OpenFlow agreements, analysis calculate method for routing and notify the part in each domain
Router.
The present invention is based on the relationship of P-NOX and N-NOX in the NOX frameworks of SDN is as shown in Figure 2.Referring to Fig. 3, overall situation control
The optimum mapping scheme that device will be acquired according to the method for the global search based on population and the partial heuristic search based on individual
Carry out global routing iinformation distribution；Local control carries out data forwarding according to the instruction of global controller.
Referring to Fig. 4 (a), virtual optical network is 2,3,3 there are three the respective resource requirement of dummy node, respective subordinate domain
For domain 1, domain 1, domain 2, it is respectively 30GB/s and 15GB/s that virtual optical network, which has both links, demand,；Referring to Fig. 4 (b), physical light
The enabled node and link circuit resource of network are shown in that box in figure, different color tables show the front and back occupancy of mapping.Triangle VA, VB, VC
Corresponding dummy node when to map.
Referring to Fig. 5, the present invention carries out the emulation of individual domain using graphicaccess network topological diagram, the weights in figure in each of the links
For the mortality of the link.Referring to Fig. 6, the present invention carries out the emulation in three domains, hollow circle using graphicaccess network topological diagram
For domain interior nodes, solid circle is fringe node；Solid line is link in domain, and dotted line is domain-to-domain link.It is anti-in figure referring to Fig. 7
It has reflected and has used FP-MA and B-VONE methods to solve respectively 2,4,6,8 virtual optical networks, be mapped in flat in single or three domains
Equal virtual optical network mortality.Referring to Fig. 8, is reflected in figure and 4,8 virtual optical networks are used into FP-MA and B-VONE methods respectively
It solves, the mean virtual optical-fiber network mortality being mapped in 1,2 or 3 domain.
Noun annotates：
SDN：Software defined network；
VON：Virtual optical network；
VL：Virtual link；
FP：Mortality；
VON-FP：Virtual optical network mortality, mortality is lower, and network survivability is better；
FP-MA：The mapping method that the present invention optimizes virtual optical network mortality；
B-VONE：Basic virtual optical network mapping method for comparing.
Claims (5)
1. a kind of mapping method based on SDN framework Virtual optical-fiber networks, it is characterised in that：
Step 1：It determines each network parameter and topology diagram of virtual optical network request and physics bottom, and creates with VON-
FP values are the auxiliary topological diagram of link metric, determine optimization aim；
Step 2：Link VON-FP values are calculated, auxiliary topological diagram, L are created as the weights of link on original physical topological diagram using this value
(x, y) indicates node x with the domain-to-domain link between y, and P (x, y) is the probability of its error failure, the survivability of this section of link：
Survivability(x,y)=1-P(x,y)；The link on topological diagram will be assisted to be arranged by VON-FP value ascending orders, according to virtual optical net
Network request is classified, and determines mapping mode according to the classifying rules of mapping；
Classified according to virtual request, and determines that mapping mode is according to mapping ruler：
1) if two end nodes did not all map in virtual request link, and the affiliated domain of two nodes is identical, then is mapped in phase
In same area；2) if two end nodes did not all map in virtual request link, and there are multiple common domains in the affiliated domain of two nodes,
A domain is randomly choosed when mapping；If 3) the affiliated domain of virtual request both link ends node does not have common domain, select between domain
Link, near two preceding affiliated domains, two nodes is respectively mapped on the fringe node in respective domain in auxiliary figure sequence；
If 4) node of virtual request link one end is disposed, another end node is mapped in same domain；
Step 3：A kind of method frame of the global search based on population and the partial heuristic search based on individual is formulated, will be divided
The good virtual optical network of class asks to carry out solution mapping with this searching method；
Specific method is：1) method for determining the global search based on population and the partial heuristic search based on individual uses text
Change genetic algorithm frame；2) it determines parameter, defines the host vector H of chromosomei kIndicate the void that it is carried on i-th of chromosome
The physical node of quasi- node k, the state vector S of chromosomei kWhether dummy node k of the recording carrying on i-th of chromosome needs
Again the state to be mapped, if Si k=0, then corresponding dummy node should remap, otherwise keep the dummy node
Current mapping, mbest are defined as local best mapping scheme, i.e., best in current iteration fitness function, nbest is defined as
Up to the present the optimum value obtained, NR (u) are a kind of sort methods of node u, and Pv is the probability of selection：
Here u is dummy node or physical node；
If u is a physical node, L (u) is the set of all connection u node links, and C (u) provides for remaining node
Source, b (l) are remaining link circuit resource；If it is the collection of all connection u node virtual links that u, which is dummy node a U, L (U),
It closes, C (u) is the node resource of demand, and b (l) is the link circuit resource of demand；
Step 4：The total link failure rate of whole network is：
When definition optimum mapping scheme is that fitness function Fitness (x) is minimized：
The method of iteration search mapping obtains optimal mapping scheme when fitness function minimum, and the program is distributed to base
Specific data calculating and traffic forwarding operations are carried out in the NOX frameworks of SDN.
2. the mapping method according to claim 1 based on SDN framework Virtual optical-fiber networks, it is characterised in that：It is described
Step 1 determine virtual request when build Gv (Vv, Ev, Cv, Tv, CDv) undirected topological diagram, Vv is the intersection of dummy node, Ev
It is the intersection of virtual link, Cv is the expense of resource on node, and Tv is the expense transmitted on link, and CDv indicates the domain belonging to it
Name；Physics bottom is described Gs (Dp, Lp), and wherein Dp is the intersection in domain, and Lp is the collection of domain-to-domain link, and domain-to-domain link space is enough
Meet transport overhead, then domain name is that the Dp of i is described as Dpi (Ni, Ei, Bi, Ci, Fi), and wherein Ni is domain interior joint, and Ei is in domain
Link, Bi are the fringe nodes in domain, and Ci and Fi is respectively represented in domain on physical node in available resource and physical link
Available frequency band slot, each frequency band tankage are 12.5GB/s.
3. the mapping method according to claim 1 based on SDN framework Virtual optical-fiber networks, which is characterized in that definition
Initialization：1) for physical node v, if v belongs to Hi and corresponding Si kBe 1, then defining this node can touch, otherwise this
Node is that can not touch；2) for dummy node u, if corresponding Si kIt is included in Priority Queues PQ for 0；3) according to NR (u)
Function calculates dummy node and all physical nodes that can not be touched in all PQ, and the dummy node in queue PQ is pressed NR
(u) value descending arranges；4) the dummy node u in PQ queues is fallen out by NR (u) values are descending, establishes one by physical node
The candidate list CL (v) that v is constituted, the physical node of eligible list is necessary for touch and remaining node resource meets resource requirement, with
The probability of Pv selects physical node v demapping dummy nodes u from CL (v)；5) step 4) repeatedly, until PQ queues are sky.
4. the mapping method according to claim 1 based on SDN framework Virtual optical-fiber networks, which is characterized in that execute
Global search based on population and the method based on individual partial heuristic search are：1) nbest to+∞ is set, it is all
State vector Si kZero, initializes the host vector Hi of all chromosomes, then at random by state vector Si kIt is set to 0 or 1, for
Each chromosome checks its feasibility and calculates its fitness function F (X), calculates the mbest of current population and setting
Nbest=mbest；2) new filial generation is generated by selection, intersection and variation, selection i.e. selection has minimum fitness function F
(x) chromosome, and put it into next filial generation, remaining chromosome is included into queue TQ；Cross and variation is i.e. by queue TQ
The middle feasible chromosome of residue is matched, and is then intersected to obtain two new chromosomes with crossover probability Pc；Variation is
To the new chromosome that is generated in queue with the probability of Pm into row variation；Finally these new chromosomes are put into the next generation；
3) simulated annealing carries out local search, and for chromosome all in queue TQ, local search is carried out with simulated annealing
Rope selects the elite chromosome in different zones；When the temperature of system T is less than predefined Tmin, following operation please be execute：
Receive it, otherwise, with the probability of Ph if fitness function reduces by the mobile fitness function for detecting different chromosomes
Receive it；Then system T carries out moving back temperature with decay factor r：T (n+1)=r*T (n)；4) it is contaminated according to light network restraining conditional filtering
Colour solid is initialized again, it is impossible to which the fitness function f (x) for meeting light network restraining condition chromosome is set to+∞, falls out
All fitness function f (x) are the chromosome of+∞ in queue TQ, by the state vector S of these infeasible chromosomesi kZero setting,
And initialize its host vector Hi, again at random by state vector S after the completion of initializationi kIt is set to 0 or 1, finally updates these
Chromosome afterwards is put into next filial generation；5) initialization updates each chromosome host vector Hi, check its feasibility, calculate
Fitness function, and mbest is updated, if more excellent than previous generation, update nbest；6) it repeats the above steps 1) to step 5), directly
To the maximum number for reaching iteration, the solution that nbest is virtual optical network mapping is finally exported.
5. the mapping method according to claim 1 based on SDN framework Virtual optical-fiber networks, which is characterized in that step 4
The obtained mapping scheme distribution that the method for global search based on population and the partial heuristic search based on individual is solved
The method handled to NOX frameworks is：By data transmission and routing plan is calculated separately respectively by N-NOX according to NOX frameworks
It is responsible for P-NOX；N-NOX is used for data forwarding as local control；P-NOX is responsible for logical from application layer as global controller
It crosses network management protocol and receives request, count the resource information transmitted from local control by OpenFlow agreements, analysis calculates road
By scheme and notify localized routing device in each domain.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510874461.6A CN105515987B (en) | 2015-12-02 | 2015-12-02 | A kind of mapping method based on SDN framework Virtual optical-fiber networks |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510874461.6A CN105515987B (en) | 2015-12-02 | 2015-12-02 | A kind of mapping method based on SDN framework Virtual optical-fiber networks |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105515987A CN105515987A (en) | 2016-04-20 |
| CN105515987B true CN105515987B (en) | 2018-11-13 |
Family
ID=55723642
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510874461.6A Active CN105515987B (en) | 2015-12-02 | 2015-12-02 | A kind of mapping method based on SDN framework Virtual optical-fiber networks |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105515987B (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105978713B (en) * | 2016-05-06 | 2019-03-08 | 西安电子科技大学 | Resource allocation methods based on elastic optical network in virtual network mapping |
| CN106059799B (en) * | 2016-05-19 | 2019-03-26 | 西安电子科技大学 | Mapping method of virtual network under elastic optical network towards SDN |
| CN106230512A (en) * | 2016-07-21 | 2016-12-14 | 国网信息通信产业集团有限公司 | A kind of electric power ubiquitous soft exchange group network system |
| CN107196806B (en) * | 2017-06-09 | 2019-12-24 | 西安电子科技大学 | Topological proximity matching virtual network mapping method based on sub-graph radiation |
| CN107911245A (en) * | 2017-11-20 | 2018-04-13 | 信阳师范学院 | Virtual network mapping model and algorithm in a kind of core elastic optical network |
| CN108270684B (en) * | 2018-01-25 | 2021-03-30 | 重庆邮电大学 | Time-frequency joint fragment sensing resource equalization virtual optical network mapping method |
| CN108347380B (en) * | 2018-02-27 | 2020-10-20 | 重庆邮电大学 | Virtual optical network collaborative mapping method based on spectrum dispersion perception |
| CN108449230B (en) * | 2018-03-15 | 2020-07-03 | 达闼科技（北京）有限公司 | Network performance detection system, method and related device |
| CN110505539B (en) * | 2018-05-17 | 2021-10-26 | 中兴通讯股份有限公司 | Physical optical network virtualization mapping method, device, controller and storage medium |
| CN109921991B (en) * | 2019-01-14 | 2021-06-04 | 湘潭大学 | SDN controller deployment method based on Dinkelbach |
| CN110290069B (en) * | 2019-06-18 | 2020-08-18 | 西安交通大学 | Reliable multicast routing method in SDN scene |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104301391A (en) * | 2014-09-19 | 2015-01-21 | 北京邮电大学 | Multi-domain optical network data center resource virtualization mapping method |
| CN104301812A (en) * | 2014-09-19 | 2015-01-21 | 中国电力科学研究院信息通信研究所 | Optical network system and network function visualizing method |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9929919B2 (en) * | 2012-10-30 | 2018-03-27 | Futurewei Technologies, Inc. | System and method for virtual network abstraction and switching |
| US9729425B2 (en) * | 2012-11-29 | 2017-08-08 | Futurewei Technologies, Inc. | Transformation and unified control of hybrid networks composed of OpenFlow switches and other programmable switches |
-
2015
- 2015-12-02 CN CN201510874461.6A patent/CN105515987B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104301391A (en) * | 2014-09-19 | 2015-01-21 | 北京邮电大学 | Multi-domain optical network data center resource virtualization mapping method |
| CN104301812A (en) * | 2014-09-19 | 2015-01-21 | 中国电力科学研究院信息通信研究所 | Optical network system and network function visualizing method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105515987A (en) | 2016-04-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105515987B (en) | A kind of mapping method based on SDN framework Virtual optical-fiber networks | |
| Aujla et al. | MEnSuS: An efficient scheme for energy management with sustainability of cloud data centers in edge–cloud environment | |
| CN108322333B (en) | Virtual network function placement method based on genetic algorithm | |
| CN111130858B (en) | Dynamic multi-target virtual network mapping method in SD-WAN scene | |
| CN105323166B (en) | A kind of method for routing preferential based on network energy efficiency towards cloud computing | |
| CN106936645B (en) | The optimization method of tree network topology structure based on queueing theory | |
| CN108174394A (en) | A kind of Arrangement algorithm of 5G networks slice | |
| CN105681153A (en) | Virtual network mapping method and device | |
| CN103560967A (en) | Virtual data center mapping method sensing service requirement | |
| CN108076158A (en) | Minimum load route selection method and system based on Naive Bayes Classifier | |
| CN102780628B (en) | On-chip interconnection network routing method oriented to multi-core microprocessor | |
| CN106817306B (en) | Method and device for determining target route | |
| CN103428804B (en) | Find mapping scheme and network code location method between network-on-chip task and node | |
| CN106209618A (en) | A kind of communication mixed networking method and system improving intelligence adapted electric energy effect | |
| CN108259387A (en) | A kind of exchange system and its routing algorithm built by interchanger | |
| CN105050149A (en) | Routing method for overcoming congestion of tree type Zigbee network | |
| Ke et al. | Aggregation on the fly: Reducing traffic for big data in the cloud | |
| CN114726743A (en) | Service function chain deployment method based on federal reinforcement learning | |
| CN110535705A (en) | A kind of service function chain building method of adaptive user delay requirement | |
| Zhu et al. | Efficient hybrid multicast approach in wireless data center network | |
| CN116634504A (en) | Unmanned aerial vehicle networking topology relation and bandwidth allocation optimization strategy based on improved NSGA-II algorithm | |
| Li et al. | A multi-stage approach for virtual network function migration and service function chain reconfiguration in NFV-enabled networks | |
| CN112333102B (en) | Software defined network routing method and system based on knowledge graph | |
| CN107707471A (en) | The energy-saving scheme of minimum conversion link number based on extensive SDN | |
| CN107911245A (en) | Virtual network mapping model and algorithm in a kind of core elastic optical network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |