CN105515987A - SDN framework based virtual optical network oriented mapping method - Google Patents
SDN framework based virtual optical network oriented mapping method Download PDFInfo
- Publication number
- CN105515987A CN105515987A CN201510874461.6A CN201510874461A CN105515987A CN 105515987 A CN105515987 A CN 105515987A CN 201510874461 A CN201510874461 A CN 201510874461A CN 105515987 A CN105515987 A CN 105515987A
- Authority
- CN
- China
- Prior art keywords
- node
- mapping
- link
- virtual
- territory
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
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
Abstract
The invention discloses an SDN framework based virtual optical network oriented mapping method. The method comprises: step 1: determining a virtual request and network parameters of a physical bottom layer as well as a topologic structure chart, creating a topologic auxiliary chart by taking VON-FP values as weight values of links, and determining an optimization target; step 2: arranging the links on the topologic auxiliary chart in an ascending order according to the VON-FP values, performing classification according to the virtual request, and determining a mapping mode according to a mapping rule; step 3: establishing a framework of a method for population based global search and individual based local heuristic search, and performing solution mapping on classified virtual optical network requests by using the search method; and step 4: repeatedly and iteratively searching for a mapping method to obtain an optimal mapping scheme when a fitness function is minimal, and distributing the scheme to an SDN based NOX framework to perform specific data calculation and traffic forwarding operation. According to the method, the efficiency of multi-domain virtual optical network mapping is improved and the failure rate of the whole network after mapping is reduced.
Description
Technical field
The invention belongs to networking technology area, be specifically related to a kind of mapping method based on SDN framework Virtual optical-fiber network.
Background technology
Along with large data service and the explosive growth based on cloud market demand, the virtual network congestion being applied to solution traditional network architecture more and more and can't resolve of network.In all virtual network problems, of greatest concern is that virtual optical network maps (virtualopticalnetworkembedding, VONE).Optical-fiber network virtual has at a high speed, high bandwidth dynamically, the advantage of vast capacity and rich interface, network reflects, and affects the operating efficiency of whole network.Virtual optical network maps the key issue faced and mainly contains: constraints, the design realization of mapping method and the optimization of network mapping of optical-fiber network transmission.
Network mapping is by the node in virtual network requests and link, when meeting constraints, is mapped on physics optical-fiber network, and expense summation is minimized for specific optimization aim.The mapping of network affects the time delay of whole network, the Service Quality Metrics (QualityofService, QoS) such as power consumption.Virtual optical network in recent years in single domain maps and there has been solution, and maps for the virtual optical network in multiple domain, with the biological treatability of network (networksurvivability) for optimization aim, is not yet well solved.The mapping problems of network has been proved to be as NP-hard problem, belongs to quadratic assignment problem category.
Because multiple-domain network pelagical resources distribute to different bottom-layer networks, this inevitably causes the opacity between territory, controller is difficult to coordinate to transmit between transmission and territory in territory, and does not consider constraints and the biological treatability of optical-fiber network in existing mapping method completely.Such as need observe the coherence and continuity of frequency-division section on optical network link during optical-fiber network transmission, and during mapping link, there is certain mortality.Therefore the application proposes a kind of based on software defined network framework (softwaredefinednetwork, SDN) multi-domain virtual optical-fiber network mapping scheme, and solved by a kind of method of global search based on population and the partial heuristic search based on individuality, under being intended to multiple domain parallel processing condition, advantage that in SDN framework, control plane is separated with datum plane is utilized to optimize the survivability of network in multiple domain.
Summary of the invention
The object of the invention is to for above-mentioned the problems of the prior art, a kind of mapping method based on SDN framework Virtual optical-fiber network is provided, the method is with center control, programming network, promote multiple domain walk abreast map efficiency, and adopt a kind of method of global search based on population and the partial heuristic search based on individuality to map, under the constraints taking into full account optical-fiber network, effectively reduce the mortality of virtual network.
To achieve these goals, the technical solution used in the present invention is:
Step 1: each network parameter and the topology diagram of determining virtual optical network request and physics bottom, and create the auxiliary topological diagram being link metric with VON-FP value, determine optimization aim;
Step 2: the link on auxiliary topological diagram is pressed the arrangement of VON-FP value ascending order, classify according to virtual optical network request, and according to the classifying rules determination mapping mode mapped;
Step 3: the method frame formulating a kind of global search based on population and the partial heuristic search based on individuality, carries out solving mapping with this searching method by the virtual optical network request of having classified; ;
Step 4: the optimum mapping scheme when method that iteration search maps show that fitness function is minimum, the NOX framework program distributed to based on SDN carries out concrete data and calculates and traffic forwarding operations.
Described step 1 builds Gv (Vv, Ev, Cv, Tv when determining virtual request, CDv) undirected topological diagram, Vv is the intersection of dummy node, and Ev is the intersection of virtual link, Cv is the expense of resource on node, and Tv is the expense that link transmits, and CDv represents the domain name belonging to it; Physics bottom is described Gs (Dp, Lp), and wherein Dp is the intersection in territory, Lp is the collection of domain-to-domain link, and domain-to-domain link space enough meets transport overhead, then domain name is that the Dp of i is described as Dpi (Ni, Ei, Bi, Ci, Fi), wherein Ni is territory interior joint, and Ei is territory link, and Bi is the fringe node in territory, Ci and Fi represents frequency band groove available on resource available on physical node in territory and physical link respectively, and each frequency band tankage is 12.5GB/s.
Described step 2 calculates link VON-FP value, the weights being link with this value create auxiliary topological diagram on original physical topological diagram, known L (x, y) represent that node x is with the domain-to-domain link between y, definition P (x, y) be the probability of its failure that makes mistakes, so the survivability of this section of link:
Survivability
(x,y)＝1-P
(x,y)。
The link failure rate that described step 4 defines whole network total is:
FP
VL＝1-∏
(x,y)∈Vv(1-P
(x,y))；
Definition optimum mapping scheme is fitness function Fitness (x) when getting minimum value:
Classify according to virtual request, and according to mapping ruler determination mapping mode be:
1) if two end nodes did not all map in virtual request link, and belonging to two nodes, territory is identical, be then mapped in same domain; 2) if two end nodes did not all map in virtual request link, and there is multiple common territory in the affiliated territory of two nodes, Stochastic choice territory during mapping; 3) if the affiliated territory of virtual request both link ends node does not have common territory, then select two affiliated territories that domain-to-domain link is the most forward in auxiliary view sequence, two nodes are mapped to respectively on the fringe node in respective territory; 4) if the node of virtual request link one end is deployed, then by other end node mapping in same domain.
The concrete grammar formulating the method frame of a kind of global search based on population and the partial heuristic search based on individuality is: 1) determine that the method for the global search based on population and the partial heuristic search based on individuality adopts cultural gene algorithm frame 2) determine parameter, define chromosomal main frame vector H
i krepresent that it is carried on the physical node of the dummy node k on i-th chromosome, chromosomal state vector S
i krepresent and change chromosomal mapping status, if S
i k=0, then corresponding dummy node should remap, otherwise keep the current mapping of this dummy node, mbest is defined as local best mapping scheme, namely best at current iteration fitness function, nbest is defined as up to the present obtained optimum value, and NR (u) is the sort method of a kind of node u, and Pv is the probability selected:
Here u is dummy node or physical node; If u is a physical node, so L (u) is the set of all connection u node links, and C (u) is remaining node resource, and b (l) is remaining link circuit resource; If u is a dummy node U, L (U) is all set connecting u node virtual link, the node resource that C (u) is demand, the link circuit resource that b (l) is demand.
Definition initialization: 1) for physical node v, if v belongs to Hi and the S of correspondence
i kbe 1, then defining this node is what can touch, otherwise this node is for touching; 2) for dummy node u, if the ski of correspondence is 0, listed in Priority Queues PQ; 3) calculate dummy node in all PQ and all physical nodes that can not touch according to NR (u) function, and the dummy node in queue PQ is pressed the descending of NR (u) value; 4) the dummy node u in PQ queue is fallen out by NR (u) value is descending, set up candidate list CL (v) be made up of physical node v, the physical node of eligible list is necessary for can not touch and remain node resource and meets resource requirement, selects physical node v remove maps virtual node u with the probability of Pv from CL (v); 5) step 4 repeatedly), until PQ queue is empty.
The method performing the global search based on population and the partial heuristic search based on individuality is: 1) arrange nbest to+∞, all state vector S
i kzero, all chromosomal main frame vector Hi of initialization, then Sik to 1 is set at random, for each chromosome, check its feasibility and calculate its fitness function F (X), calculate the mbest of current population and nbest=mbest is set; 2) produce new filial generation by selection, crossover and mutation, select the chromosome namely selecting to have minimum fitness function F (x), and it is put into next son generation, remaining chromosome is included into queue TQ; Cross and variation is matched by remaining feasible chromosome in queue TQ, then carries out intersecting obtaining two new chromosomes with crossover probability Pc; Namely variation makes a variation with the probability of Pm to the new chromosome produced in queue; Finally these new chromosomes are put into the next generation; 3) Local Search is carried out in simulated annealing, for chromosome all in queue TQ, carries out local search with simulated annealing, selects the elite's chromosome in zones of different; When the temperature of system T is lower than predefined Tmin, following operation please be perform: by the fitness function of mobility detect coloured differently body, if fitness function reduces, accept it, otherwise, accept it with the probability of Ph; Then system T carries out moving back temperature with decay factor r: T (n+1)=r*T (n); 4) according to light network restraining conditional filtering chromosome, heavily initialization, chromosomal fitness function f (x) of light network restraining condition can not be met and be set to+∞, all fitness functions f (x) in queue TQ of falling out are the chromosome of+∞, by these infeasible chromosomal state vector S
i kzero setting, and by its main frame vector Hi initialization, after initialization completes, again S is set at random
i kto 1, the chromosome after finally these being upgraded puts into next son generation; 5) initialization upgrades each chromosome main frame vector H
i, check feasibility, calculate fitness function, and upgrade mbest, if more excellent than previous generation, upgrade nbest; 6) above-mentioned steps 1 is repeated) to step 5), until arrive the maximum number of iteration, finally exporting nbest is the solution that virtual optical network maps.
The mapping scheme obtained that the method for the global search based on population and the partial heuristic search based on individuality solves is distributed to the method that NOX framework carries out processing by step 4: according to NOX framework by transfer of data with calculate routing plan and be separately responsible for by N-NOX and P-NOX respectively; N-NOX is used for data retransmission as local control; P-NOX is responsible for being accepted request from application layer by network management protocol as global controller, and add up the resource information transmitted by OpenFlow agreement from local control, analytical calculation routing plan also notifies the localized routing device in each territory.
Compared with prior art, the present invention has following beneficial effect: by formulating the method frame of the global search based on population and the partial heuristic search based on individuality, the virtual optical network request of having classified is carried out solving mapping with this searching method, the NOX framework finally distributed to by mapping scheme based on SDN carries out concrete data calculating and traffic forwarding operations, NOX framework is adopted to dispose, effectively can promote the efficiency that multi-domain virtual optical-fiber network maps, and reduce the mortality mapping rear whole network.
Further, step 2 of the present invention calculates the survivability of link, link survivability refers to that network bears and the ability recovered from fault, it is one of most important requirement in evaluating network, directly affect the approve-useful index in network service quality (QoS), its importance is especially obvious under the optical-fiber network of large throughput.
Accompanying drawing explanation
Fig. 1 the present invention searches for the flow chart of mapping method;
Fig. 2 the present invention is based on the NOX configuration diagram of SDN;
The embody rule schematic diagram of Fig. 3 NOX framework of the present invention;
The routine virtual optical network configuration diagram of Fig. 4 (a);
Physics optical-fiber network configuration diagram before and after the routine virtual optical network of Fig. 4 (b) maps;
The NSFNET in Fig. 5 territory emulates topological diagram;
The NSFNET in Fig. 6 tri-territories emulates topological sketch plan;
Fig. 7 VON quantity simulation result statistical chart;
The number simulation result statistical chart in Fig. 8 territory.
Embodiment
Below in conjunction with accompanying drawing, the present invention is described in further detail.
The mapping method that the present invention is based on SDN framework Virtual optical-fiber network comprises the following steps:
Step 1, determines each network parameter and the topology diagram of virtual request and physics bottom, and creates the topological auxiliary view being link metric with VON-FP value, determines optimization aim.
1.1, virtual request is determined, virtual request is a undirected topological diagram, describes Gv (Vv, Ev, Cv, Tv, CDv), wherein Vv is the intersection of dummy node, Ev is the intersection of virtual link, Cv is the expense of resource on node, and Tv is the expense that link transmits, and CDv then represents the domain name belonging to it.
1.2, determine physics bottom, physics bottom is described to Gs (Dp, Lp), and wherein Dp is the intersection in territory, and Lp is the collection (this programme supposition domain-to-domain link space enough meets transport overhead) of domain-to-domain link.Domain name is that the Dp of i can be described as again Dpi (Ni, Ei, Bi, Ci, Fi), wherein Ni is territory interior joint, and Ei is territory link, and Bi is the fringe node in territory, Ci and Fi represents frequency band groove available on resource available on physical node in territory and physical link respectively, according to binary phase shift keying (BinaryPhaseShiftKeying, BPSK), each frequency band tankage is 12.5GB/s.
1.3, calculate link VON-FP value, the weights being link with this value are created a width and are assisted topological diagram on original physical topological diagram.
1.4, can survival ability optimization aim with low link failure rate and height, known L (x, y) represents that node x is with the domain-to-domain link between y, the probability that definition P (x, y) is the failure that makes mistakes, 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
FP
VL＝1-∏
(x,y)∈Vv(1-P
(x,y))；
Optimization object function namely gets the minimum value of fitness function Fitness (x):
Step 2, presses the arrangement of VON-FP value ascending order, to map, classifies according to virtual request, according to mapping ruler determination mapping mode by the link on topological auxiliary view.
If in 2.1 virtual request links, two end nodes did not all map, and belonging to two nodes, territory is identical, be then mapped in same domain, because link error rate is far smaller than domain-to-domain link usually in territory.
If two end nodes did not all map in 2.2 virtual request links, and there is multiple common territory in the affiliated territory of two nodes, Stochastic choice territory during mapping, when carrying out node mapping, selects the physical node near fringe node, to map between territory as far as possible.
If the affiliated territory of 2.3 virtual request both link ends nodes does not have common territory, then select two affiliated territories that domain-to-domain link is the most forward in auxiliary view sequence, two nodes are mapped on the fringe node in respective territory respectively, to map between territory.
If the node of 2.4 virtual request link one end is deployed, then try one's best other end node mapping in same domain.
Step 3, formulates the method frame of a kind of global search based on population and the partial heuristic search based on individuality, the virtual optical network request of having classified is carried out solving mapping with this searching method, as shown in Figure 1.
3.1, the method frame of a kind of global search based on population and the partial heuristic search based on individuality is formulated.Global policies adopts genetic algorithm, and local searching strategy adopts simulated annealing.
3.2, determine parameter, define chromosomal main frame vector Hik and represent that it is carried on the physical node of the dummy node k on i-th chromosome.Chromosomal state vector Sik represents and changes chromosomal mapping status, if Sik=0, then corresponding dummy node should remap.Otherwise keep the current mapping of this dummy node.Mbest is defined as local best mapping scheme, namely best at current iteration fitness function.Nbest is defined as up to the present obtained optimum value.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, so L (u) is the set of all connection u node links, and C (u) is remaining node resource, and b (l) is remaining link circuit resource.For the set that a dummy node U, L (U) they are all connection u node virtual links, the node resource that C (u) is demand, the link circuit resource that b (l) is demand.
3.3, initial method is defined.Initial method is specially:
3.3.1, for physical node v, if v belongs to Hi and the ski of correspondence is 1, then defining this node is what can touch; Otherwise this node is for touching.
3.3.2, for dummy node u, if the ski of correspondence is 0, listed in Priority Queues PQ.
3.3.3, dummy node in all PQ and all physical nodes that can not touch is calculated according to NR (u) function.Dummy node in queue PQ is pressed the descending of NR (u) value.
3.3.4, the dummy node u in PQ queue is fallen out by NR (u) value is descending, set up candidate list CL (v) be made up of physical node v, the physical node of eligible list is necessary for can not touch and remain node resource and meets resource requirement.From CL (v), physical node v maps virtual node u is selected with the probability of Pv.
3.3.5, step 3.3.4 repeatedly, until PQ queue is empty.
3.4, nbest to+∞ is set, all state vector Sik zeros.The all chromosomal main frame vector Hi of initialization.Again Sik to 1 is set at random.For each chromosome, check its feasibility and calculate its fitness function F (X).Calculate the mbest of current population and nbest=mbest is set.
3.5, new filial generation is produced by selection, crossover and mutation.Select: the chromosome selecting to have minimum fitness function F (x), and it is put into next son generation, and remaining chromosome is included into queue TQ.Cross and variation: match remaining feasible chromosome in queue TQ, then carries out intersecting obtaining two new chromosomes with crossover probability Pc (this programme is decided to be 0.9).Variation: the new chromosome produced in queue is made a variation with the probability of Pm.Finally these new chromosomes are put into the next generation.
3.6, Local Search is carried out in simulated annealing.For chromosome all in queue TQ, carry out local search with simulated annealing, this means the elite's chromosome can selected in zones of different.When the temperature (it is 100 that this case defines initial T) of system (T) is lower than predefined Tmin (this case is defined as 0.1), please perform following operation: by the fitness function of mobility detect coloured differently body, if result is better, accept it, otherwise, accept it with the probability of Ph.Then system (T) carries out moving back temperature with decay factor r:
T(n+1)＝r*T(n)
3.7, according to light network restraining conditional filtering chromosome, heavily initialization is carried out.Light network restraining condition (consistency of such as frequency band groove and continuity) chromosomal fitness function f (x) can not be met and be set to+∞.All fitness functions f (x) in queue TQ of falling out are the chromosome of+∞, by these infeasible chromosomal state vector Sik zero setting, and by its main frame vector Hi initialization.Arrange Sik to 1 at random again after initialization completes, the chromosome after finally these being upgraded puts into next son generation.
3.8, contemporary optimal solution is calculated.Initialization upgrades each chromosome main frame vector Hi, checks its feasibility, calculates fitness function, not and upgrade mbest, if more excellent than previous generation, does not upgrade nbest.
Step 4, the optimum mapping scheme when method that iteration search maps show that fitness function is minimum, and distribute to the NOX framework process based on SDN.
4.1, step 3.3 is repeated to step 3.7, until arrive the maximum number of iteration.Finally exporting nbest is the solution that virtual optical network maps.
4.2, according to NOX framework, transfer of data and calculating routing plan are separately responsible for by N-NOX and P-NOX.
4.2.1, N-NOX as local control in the method for data retransmission.
4.2.2, P-NOX accepted request from application layer by network management protocol at this programme as global controller, and add up the resource information transmitted by OpenFlow agreement from local control, analytical calculation method for routing also notifies the localized routing device in each territory.
The present invention is based on the relation of P-NOX and N-NOX in the NOX framework of SDN as shown in Figure 2.See Fig. 3, the routing iinformation that the optimum mapping scheme that the method according to the global search based on population and the partial heuristic search based on individuality is tried to achieve is carried out the overall situation by global controller distributes; Local control carries out data retransmission according to the instruction of global controller.
See Fig. 4 (a), virtual optical network has the resource requirement separately of three dummy nodes to be 2,3,3, and respective subordinate territory is territory 1, territory 1, territory 2, and virtual optical network has two links, and demand is respectively 30GB/s and 15GB/s; See Fig. 4 (b), the enabled node of physics optical-fiber network and link circuit resource are shown in square frame in figure, and different color table shows occupancy before and after mapping.The dummy node that triangle VA, VB, VC are corresponding when being mapping.
See Fig. 5, the present invention adopts graphicaccess network topological diagram to carry out the emulation of individual domain, and the weights in figure on every bar link are the mortality of this link.See Fig. 6, the present invention adopts graphicaccess network topological diagram to carry out the emulation in three territories, and hollow circle is territory interior nodes, and solid circle is fringe node; Solid line is link in territory, and dotted line is domain-to-domain link.See reflecting 2 in Fig. 7, figure, 4,6,8 virtual optical network solve by FP-MA and B-VONE method respectively, are mapped in the mean virtual optical-fiber network mortality in single or three territories.See reflecting 4 in Fig. 8, figure, 8 virtual optical network solve by FP-MA and B-VONE method respectively, are mapped in 1, the mean virtual optical-fiber network mortality in 2 or 3 territories.
Noun annotates:
SDN: software defined network;
VON: virtual optical network;
VL: virtual link;
FP: mortality;
VON-FP: virtual optical network mortality, the lower network survivability of mortality is better;
FP-MA: the mapping method that the present invention optimizes virtual optical network mortality;
B-VONE: for the basic virtual optical network mapping method compared.
Claims (9)
1., based on a mapping method for SDN framework Virtual optical-fiber network, it is characterized in that:
Step 1: each network parameter and the topology diagram of determining virtual optical network request and physics bottom, and create the auxiliary topological diagram being link metric with VON-FP value, determine optimization aim;
Step 2: the link on auxiliary topological diagram is pressed the arrangement of VON-FP value ascending order, classify according to virtual optical network request, and according to the classifying rules determination mapping mode mapped;
Step 3: the method frame formulating a kind of global search based on population and the partial heuristic search based on individuality, carries out solving mapping with this searching method by the virtual optical network request of having classified;
Step 4: the optimum mapping scheme when method that iteration search maps show that fitness function is minimum, the NOX framework program distributed to based on SDN carries out concrete data and calculates and traffic forwarding operations.
2. the mapping method based on SDN framework Virtual optical-fiber network according to claim 1, it is characterized in that: when described step 1 determines virtual request, build Gv (Vv, Ev, Cv, Tv, CDv) undirected topological diagram, Vv is the intersection of dummy node, and Ev is the intersection of virtual link, and Cv is the expense of resource on node, Tv is the expense that link transmits, and CDv represents the domain name belonging to it; Physics bottom is described Gs (Dp, Lp), and wherein Dp is the intersection in territory, Lp is the collection of domain-to-domain link, and domain-to-domain link space enough meets transport overhead, then domain name is that the Dp of i is described as Dpi (Ni, Ei, Bi, Ci, Fi), wherein Ni is territory interior joint, and Ei is territory link, and Bi is the fringe node in territory, Ci and Fi represents frequency band groove available on resource available on physical node in territory and physical link respectively, and each frequency band tankage is 12.5GB/s.
3. the mapping method based on SDN framework Virtual optical-fiber network according to claim 1, it is characterized in that: described step 2 calculates link VON-FP value, the weights being link with this value create auxiliary topological diagram on original physical topological diagram, known L (x, y) represent that node x is with the domain-to-domain link between y, the probability that definition P (x, y) is its failure that makes mistakes, so survivability of this section of link:
Survivability
(x,y)＝1-P
(x,y)。
4. the mapping method based on SDN framework Virtual optical-fiber network according to claim 3, is characterized in that, the link failure rate that described step 4 defines whole network total is:
Definition optimum mapping scheme is fitness function Fitness (x) when getting minimum value:
5. the mapping method based on SDN framework Virtual optical-fiber network according to claim 1, is characterized in that, classify according to virtual request, and according to mapping ruler determination mapping mode is:
1) if two end nodes did not all map in virtual request link, and belonging to two nodes, territory is identical, be then mapped in same domain; 2) if two end nodes did not all map in virtual request link, and there is multiple common territory in the affiliated territory of two nodes, Stochastic choice territory during mapping; 3) if the affiliated territory of virtual request both link ends node does not have common territory, then select two affiliated territories that domain-to-domain link is the most forward in auxiliary view sequence, two nodes are mapped to respectively on the fringe node in respective territory; 4) if the node of virtual request link one end is deployed, then by other end node mapping in same domain.
6. the mapping method based on SDN framework Virtual optical-fiber network according to claim 1, it is characterized in that, the concrete grammar formulating the method frame of a kind of global search based on population and the partial heuristic search based on individuality is: 1) determine that the method for the global search based on population and the partial heuristic search based on individuality adopts cultural gene algorithm frame; 2) determine parameter, define chromosomal main frame vector H
i krepresent that it is carried on the physical node of the dummy node k on i-th chromosome, chromosomal state vector S
i krepresent and change chromosomal mapping status, if S
i k=0, then corresponding dummy node should remap, otherwise keep the current mapping of this dummy node, mbest is defined as local best mapping scheme, namely best at current iteration fitness function, nbest is defined as up to the present obtained optimum value, and NR (u) is the sort method of a kind of node u, and Pv is the probability selected:
Here u is dummy node or physical node; If u is a physical node, so L (u) is the set of all connection u node links, and C (u) is remaining node resource, and b (l) is remaining link circuit resource; If u is a dummy node U, L (U) is all set connecting u node virtual link, the node resource that C (u) is demand, the link circuit resource that b (l) is demand.
7. the mapping method based on SDN framework Virtual optical-fiber network according to claim 6, is characterized in that, definition initialization: 1) for physical node v, if v belongs to Hi and the S of correspondence
i kbe 1, then defining this node is what can touch, otherwise this node is for touching; 2) for dummy node u, if the ski of correspondence is 0, listed in Priority Queues PQ; 3) calculate dummy node in all PQ and all physical nodes that can not touch according to NR (u) function, and the dummy node in queue PQ is pressed the descending of NR (u) value; 4) the dummy node u in PQ queue is fallen out by NR (u) value is descending, set up candidate list CL (v) be made up of physical node v, the physical node of eligible list is necessary for can not touch and remain node resource and meets resource requirement, selects physical node v remove maps virtual node u with the probability of Pv from CL (v); 5) step 4 repeatedly), until PQ queue is empty.
8. the mapping method based on SDN framework Virtual optical-fiber network according to claim 6, it is characterized in that, the method performing the global search based on population and the partial heuristic search based on individuality is: 1) arrange nbest to+∞, all state vector S
i kzero, all chromosomal main frame vector Hi of initialization, then Sik to 1 is set at random, for each chromosome, check its feasibility and calculate its fitness function F (X), calculate the mbest of current population and nbest=mbest is set; 2) produce new filial generation by selection, crossover and mutation, select the chromosome namely selecting to have minimum fitness function F (x), and it is put into next son generation, remaining chromosome is included into queue TQ; Cross and variation is matched by remaining feasible chromosome in queue TQ, then carries out intersecting obtaining two new chromosomes with crossover probability Pc; Namely variation makes a variation with the probability of Pm to the new chromosome produced in queue; Finally these new chromosomes are put into the next generation; 3) Local Search is carried out in simulated annealing, for chromosome all in queue TQ, carries out local search with simulated annealing, selects the elite's chromosome in zones of different; When the temperature of system T is lower than predefined Tmin, following operation please be perform: by the fitness function of mobility detect coloured differently body, if fitness function reduces, accept it, otherwise, accept it with the probability of Ph; Then system T carries out moving back temperature with decay factor r: T (n+1)=r*T (n); 4) according to light network restraining conditional filtering chromosome, carry out heavily initialization, chromosomal fitness function f (x) of light network restraining condition can not be met and be set to+∞, all fitness functions f (x) in queue TQ of falling out are the chromosome of+∞, by these infeasible chromosomal state vector S
i kzero setting, and by its main frame vector Hi initialization, after initialization completes, again S is set at random
i kto 1, the chromosome after finally these being upgraded puts into next son generation; 5) initialization upgrades each chromosome main frame vector H
i, check its feasibility, calculate fitness function, and upgrade mbest, if more excellent than previous generation, upgrade nbest; 6) above-mentioned steps 1 is repeated) to step 5), until arrive the maximum number of iteration, finally exporting nbest is the solution that virtual optical network maps.
9. the mapping method based on SDN framework Virtual optical-fiber network according to claim 1, it is characterized in that, the mapping scheme obtained that the method for the global search based on population and the partial heuristic search based on individuality solves is distributed to the method that NOX framework carries out processing and is by step 4: according to NOX framework by transfer of data with calculate routing plan and be separately responsible for by N-NOX and P-NOX respectively; N-NOX is used for data retransmission as local control; P-NOX is responsible for being accepted request from application layer by network management protocol as global controller, and add up the resource information transmitted by OpenFlow agreement from local control, analytical calculation routing plan also notifies the localized routing device in each territory.
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 true CN105515987A (en) | 2016-04-20 |
| CN105515987B 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) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105978713A (en) * | 2016-05-06 | 2016-09-28 | 西安电子科技大学 | Elastic optical network based resource distribution method in virtual network mapping |
| CN106059799A (en) * | 2016-05-19 | 2016-10-26 | 西安电子科技大学 | Virtual network mapping method of elastic optical network facing SDN |
| CN106230512A (en) * | 2016-07-21 | 2016-12-14 | 国网信息通信产业集团有限公司 | A kind of electric power ubiquitous soft exchange group network system |
| CN107196806A (en) * | 2017-06-09 | 2017-09-22 | 西安电子科技大学 | The topology radiated based on subgraph closes on matching virtual network mapping method |
| CN107911245A (en) * | 2017-11-20 | 2018-04-13 | 信阳师范学院 | Virtual network mapping model and algorithm in a kind of core elastic optical network |
| CN108270684A (en) * | 2018-01-25 | 2018-07-10 | 重庆邮电大学 | The resources balance virtual optical network mapping method that a kind of time-frequency combination fragment perceives |
| CN108347380A (en) * | 2018-02-27 | 2018-07-31 | 重庆邮电大学 | A kind of virtual optical network collaboration mapping method based on the perception of frequency spectrum dispersion |
| CN108449230A (en) * | 2018-03-15 | 2018-08-24 | 达闼科技（北京）有限公司 | Network performance detecting system, method and relevant apparatus |
| CN109921991A (en) * | 2019-01-14 | 2019-06-21 | 湘潭大学 | A kind of SDN controller portion arranging method based on Dinkelbach |
| CN110290069A (en) * | 2019-06-18 | 2019-09-27 | 西安交通大学 | A kind of reliable multicast method for routing under SDN scene |
| CN110505539A (en) * | 2018-05-17 | 2019-11-26 | 中兴通讯股份有限公司 | Physical light network virtualization mapping method, device, controller and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140122683A1 (en) * | 2012-10-30 | 2014-05-01 | Futurewei Technologies, Inc. | System and Method for Virtual Network Abstraction and Switching |
| US20140149542A1 (en) * | 2012-11-29 | 2014-05-29 | Futurewei Technologies, Inc. | Transformation and Unified Control of Hybrid Networks Composed of OpenFlow Switches and Other Programmable Switches |
| 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 |
-
2015
- 2015-12-02 CN CN201510874461.6A patent/CN105515987B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140122683A1 (en) * | 2012-10-30 | 2014-05-01 | Futurewei Technologies, Inc. | System and Method for Virtual Network Abstraction and Switching |
| US20140149542A1 (en) * | 2012-11-29 | 2014-05-29 | Futurewei Technologies, Inc. | Transformation and Unified Control of Hybrid Networks Composed of OpenFlow Switches and Other Programmable Switches |
| 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 |
Cited By (16)
| 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 |
| CN105978713A (en) * | 2016-05-06 | 2016-09-28 | 西安电子科技大学 | Elastic optical network based resource distribution method in virtual network mapping |
| CN106059799A (en) * | 2016-05-19 | 2016-10-26 | 西安电子科技大学 | Virtual network mapping method of elastic optical network facing 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 |
| CN107196806A (en) * | 2017-06-09 | 2017-09-22 | 西安电子科技大学 | The topology radiated based on subgraph closes on matching virtual network mapping method |
| CN107911245A (en) * | 2017-11-20 | 2018-04-13 | 信阳师范学院 | Virtual network mapping model and algorithm in a kind of core elastic optical network |
| CN108270684A (en) * | 2018-01-25 | 2018-07-10 | 重庆邮电大学 | The resources balance virtual optical network mapping method that a kind of time-frequency combination fragment perceives |
| CN108347380A (en) * | 2018-02-27 | 2018-07-31 | 重庆邮电大学 | A kind of virtual optical network collaboration mapping method based on the perception of frequency spectrum dispersion |
| CN108449230A (en) * | 2018-03-15 | 2018-08-24 | 达闼科技（北京）有限公司 | Network performance detecting system, method and relevant apparatus |
| CN108449230B (en) * | 2018-03-15 | 2020-07-03 | 达闼科技（北京）有限公司 | Network performance detection system, method and related device |
| CN110505539A (en) * | 2018-05-17 | 2019-11-26 | 中兴通讯股份有限公司 | Physical light network virtualization mapping method, device, controller and storage medium |
| CN110505539B (en) * | 2018-05-17 | 2021-10-26 | 中兴通讯股份有限公司 | Physical optical network virtualization mapping method, device, controller and storage medium |
| CN109921991A (en) * | 2019-01-14 | 2019-06-21 | 湘潭大学 | A kind of SDN controller portion arranging method based on Dinkelbach |
| CN109921991B (en) * | 2019-01-14 | 2021-06-04 | 湘潭大学 | SDN controller deployment method based on Dinkelbach |
| CN110290069A (en) * | 2019-06-18 | 2019-09-27 | 西安交通大学 | A kind of reliable multicast method for routing under SDN scene |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105515987B (en) | 2018-11-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105515987A (en) | SDN framework based virtual optical network oriented mapping method | |
| Liao et al. | Density cluster based approach for controller placement problem in large-scale software defined networkings | |
| CN105900403A (en) | System and method for zoning in software defined networks | |
| CN101321134B (en) | Service quality routing selection method under dynamic network condition | |
| CN112104558B (en) | Method, system, terminal and medium for implementing block chain distribution network | |
| CN105960783A (en) | Inter-domain SDN traffic engineering | |
| CN108566659A (en) | A kind of online mapping method of 5G networks slice based on reliability | |
| Karagiannis et al. | Comparison of alternative architectures in fog computing | |
| CN103259744A (en) | Method for mapping mobile virtual network based on clustering | |
| CN105074735A (en) | Accelerated learning by sharing information between multiple learning machines | |
| CN106817306B (en) | Method and device for determining target route | |
| CN106161270B (en) | A kind of network deployment method | |
| CN106209618A (en) | A kind of communication mixed networking method and system improving intelligence adapted electric energy effect | |
| CN114143264A (en) | Traffic scheduling method based on reinforcement learning in SRv6 network | |
| CN105050149A (en) | Routing method for overcoming congestion of tree type Zigbee network | |
| CN114726743A (en) | Service function chain deployment method based on federal reinforcement learning | |
| CN111885493A (en) | Micro-cloud deployment method based on improved cuckoo search algorithm | |
| CN111181792A (en) | SDN controller deployment method and device based on network topology and electronic equipment | |
| CN103795641B (en) | The optical network resource management method mapped based on multidimensional frame | |
| CN116634504A (en) | Unmanned aerial vehicle networking topology relation and bandwidth allocation optimization strategy based on improved NSGA-II algorithm | |
| CN104901892A (en) | QoS multicasting route optimizer based on ant colony algorithm and realization method of QoS multicasting route optimizer | |
| Meng et al. | Intelligent routing orchestration for ultra-low latency transport networks | |
| CN112333102B (en) | Software defined network routing method and system based on knowledge graph | |
| CN109889393A (en) | A kind of geographically distributed figure processing method and system | |
| CN105306367A (en) | A method of communicating information over a network and a system for communicating information over a 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 |