CN105530199A - Resource mapping method and device based on SDN (Software Defined Network) multi-domain optical network virtualization technology - Google Patents

Resource mapping method and device based on SDN (Software Defined Network) multi-domain optical network virtualization technology Download PDF

Info

Publication number
CN105530199A
CN105530199A CN201510886080.XA CN201510886080A CN105530199A CN 105530199 A CN105530199 A CN 105530199A CN 201510886080 A CN201510886080 A CN 201510886080A CN 105530199 A CN105530199 A CN 105530199A
Authority
CN
China
Prior art keywords
resource
node
bar
mapping
shortest path
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
Application number
CN201510886080.XA
Other languages
Chinese (zh)
Other versions
CN105530199B (en
Inventor
纪雨彤
马跃
邢宁哲
张辉
周则军
王安
聂正璞
李信
卢博
田宇
赵阳
徐鑫
常海娇
段寒硕
段程煜
来媛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
State Grid Corp of China SGCC
Information and Telecommunication Branch of State Grid Jibei Electric Power Co Ltd
Original Assignee
State Grid Corp of China SGCC
Information and Telecommunication Branch of State Grid Jibei Electric Power Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by State Grid Corp of China SGCC, Information and Telecommunication Branch of State Grid Jibei Electric Power Co Ltd filed Critical State Grid Corp of China SGCC
Priority to CN201510886080.XA priority Critical patent/CN105530199B/en
Publication of CN105530199A publication Critical patent/CN105530199A/en
Application granted granted Critical
Publication of CN105530199B publication Critical patent/CN105530199B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/78Architectures of resource allocation
    • H04L47/783Distributed allocation of resources, e.g. bandwidth brokers
    • H04L47/785Distributed allocation of resources, e.g. bandwidth brokers among multiple network domains, e.g. multilateral agreements
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/1097Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]

Abstract

The invention discloses a resource mapping method and device based on an SDN multi-domain optical network virtualization technology. The method comprises: when a virtual request is received, mapping the virtual nodes in the virtual request to physical nodes; aiming at every virtual link, obtaining K shortest paths corresponding to the virtual link; calculating the mapping probability of every shortest path according to the frequency spectrum bandwidth of every shortest path, determining the path with the maximum mapping probability; distributing frequency spectrum resource to the virtual link in certain modulation format on the path with the maximum mapping probability. Through the method of the invention, coordinate virtualization of the application resource and the bandwidth resource can be realized; after partial traffic is dredged, uniform mapping is carried out; the resource blocking rate is effectively reduced; and the service acceptance ratio is improved.

Description

Based on method for mapping resource and the device of SDN multi-area optical network Intel Virtualization Technology
Technical field
The present invention relates to network communication field, be specifically related to a kind of method for mapping resource based on SDN multi-area optical network Intel Virtualization Technology and device.
Background technology
Along with the development of UNE technology, dissimilar business and Internet resources interweave and are superimposed, and define isomerized internetworking environment, and what exacerbate the whole network Service control and resource management realizes difficulty.And software defined network (SoftwareDefinedNetwork, SDN) can be unified the various photosphere resource of scheduling and controlling, meet business variation, complicated demand, realize the intelligentized extension of optical-fiber network and enhancing.The explosion type of cloud computing, large data occurs, the storage resources of data center and computational resource have become the architecture of data center IT resource as the final carrier of large data.And along with the development of memory technology, centralised storage is no longer the main flow framework of data center.The memory access of mass data, needs the extremely strong distributed storage architecture of autgmentability, retractility to realize.Therefore, based on the research of cross-layer multi-area optical network framework, be also very important.Meanwhile, along with flow growth rapidly, certain Limitation and Confinement can be caused to the expansion of future optical networks, due to dispose optical fiber and terminal very expensive, the utilance how improving existing resource becomes very crucial.Network virtualization technology makes physical equipment resource can sharing, and is the effective way of reply the Internet explosion type development.
SDN is by by datum plane and management plane decoupling zero, makes network become sequencing, mobilism and service-aware.As the control protocol of SDN main flow, OpenFlow has had the open-standards interface exchanging level based on stream, have employed centerized fusion framework, achieves software definition route, exchange and network management etc.According to the standard of OpenFlow agreement, software defined network is transplanted in optical-fiber network, make service provider more freedom and flexibility new services is provided.At present, there are some about the expansion of OpenFlow agreement, complementary definition has been carried out to the optical data stream such as centre frequency and optical transport bandwidth of the road port up and down exchanged based on light, light carrier.By these expansions, OpenFlow agreement can be introduced area of light, and the light path realizing software defined network type develops and manages.
Along with the demand growth of network traffics is so quick, the capacity and the throughput that improve optical transport network are particularly important.The transfer of virtual technology of optical channel can improve the transmission capacity of future network.It is abstract that this technology makes business physics underlying resource can be selected to carry out in transmitting procedure, and obtain associated rights by different virtual networks or Virtual Service provider, realizes sharing or privatization of resource.Because the virtualized essence of optical-fiber network is exactly sharing based on resource apparatus, and optical channel virtual be virtual resource based on creating after Resource Fusion, therefore optical transport is virtual is realize the virtualized key technology of optical-fiber network.Wherein, light Virtual Concatenation be a kind of be applicable to data sensitive and have mass property application optical transport Intel Virtualization Technology.
At present, the storage resources of data center and computational resource have become the architecture of data center IT resource as the final carrier of large data.And along with the development of memory technology, centralised storage is no longer the main flow framework of data center.The multi-area optical network that data center is interconnected, allows the memory access of mass data, is the extremely strong distributed storage architecture of a kind of autgmentability, retractility.
Bottom-layer network Resource Abstract can be supplied to multiple service provider and rent although virtualized service provides, the sum of resource is certain and limited.Therefore, need a kind of method, can realize the Cooperative Virtual of application resource and bandwidth resources, after partial discharge is dredged, carry out unifying to map, effectively to reduce resource blockage rate, raising business accepts ratio.
Summary of the invention
In order to effectively reduce resource blockage rate, raising business accepts ratio, the present invention proposes a kind of method for mapping resource based on SDN multi-area optical network Intel Virtualization Technology and device, under the prerequisite not affecting service transmission quality and time delay, suitably can carry out the traffic grooming of part through node link frequently to Business Stream.
First aspect, the present invention proposes a kind of method for mapping resource based on SDN multi-area optical network Intel Virtualization Technology, comprising:
When receiving virtual request, the dummy node in described virtual request is mapped to physical node;
For every bar virtual link, obtain the K bar shortest path that this virtual link is corresponding;
According to the spectral bandwidth of every bar shortest path, calculate the mapping probabilities of every bar shortest path, and determine the path that mapping probabilities is maximum;
The path that described mapping probabilities is maximum adopt certain modulation format for this virtual link distribution frequency spectrum resource.
Preferably, described dummy node in described virtual request is mapped to physical node, comprises:
By all described dummy nodes according to resource capacity descending;
By all described physical nodes according to idling-resource descending;
The dummy node of described descending is mapped to according to the order of sequence the physical node of described descending.
Preferably, described dummy node in described virtual request is mapped to physical node, also comprises:
Each described dummy node is mapped to a described physical node;
Each described physical node carries a described dummy node;
The resource capacity of dummy node is less than or equal to the idling-resource of physical node corresponding to described dummy node.
Preferably, the K bar shortest path that this virtual link of described acquisition is corresponding, comprising: obtain K bar shortest path corresponding to this virtual link by KSP (KShortestPath, K bar shortest path first) algorithm.
Preferably, the spectral bandwidth of the every bar shortest path of described basis, calculates the mapping probabilities of every bar shortest path, comprising:
According to the constraints of transmission range and service quality, determine the described modulation format of shortest path described in every bar;
According to the bandwidth on demand of described modulation format and described virtual request, determine the spectral bandwidth of shortest path described in every bar;
According to described spectral bandwidth, calculate the mapping probabilities of every bar shortest path.
Preferably, the mapping probabilities of described shortest path is the proportion that the idle continuous frequency spectrum hop count current shortest path meeting preset capacity accounts for the spectral bandwidth sum on all described shortest paths.
Preferably, described frequency spectrum resource is obtained by initial hit algorithm.
Preferably, virtual link described in every bar is mapped to a described path; Path described in every bar carries a described virtual link.
Second aspect, the present invention also proposes a kind of resource mapping apparatus based on SDN multi-area optical network Intel Virtualization Technology, comprising:
Node mapping module: during for receiving virtual request, is mapped to physical node by the dummy node in described virtual request;
Path acquisition module: for for every bar virtual link, obtain the K bar shortest path that this virtual link is corresponding;
Path determination module: for the spectral bandwidth according to every bar shortest path, calculates the mapping probabilities of every bar shortest path, and determines the path that mapping probabilities is maximum;
Resource distribution module: distribute frequency spectrum resource for this virtual link for adopting certain modulation format on the maximum path of described mapping probabilities.
Preferably, described node mapping module comprises:
Dummy node sequencing unit: for by all described dummy nodes according to resource capacity descending;
Dummy node sequencing unit: for by all described physical nodes according to idling-resource descending;
Node is map unit according to the order of sequence: for the dummy node of described descending being mapped to according to the order of sequence the physical node of described descending.
As shown from the above technical solution, the present invention is directed to the resource selection strategy that virtual optical network maps, propose resource balance method innovatively, namely in Route Selection, link maps probability conception is proposed, the modulation format different based on route and bandwidth on demand determine the spectral bandwidth of this route, select the highest link of link maps probability to carry out the spectrum allocation may of route.The Cooperative Virtual of application resource and bandwidth resources can be realized by the present invention, after partial discharge is dredged, carry out unifying mapping, effectively to reduce resource blockage rate, and improve business and accept ratio.
Accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, be briefly described to the accompanying drawing used required in embodiment or description of the prior art below, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to these figure.
The flow chart of a kind of method for mapping resource based on SDN multi-area optical network Intel Virtualization Technology that Fig. 1 provides for one embodiment of the invention;
The blocking rate contrast of three kinds of mapping methods under different business sum that Fig. 2 provides for one embodiment of the invention;
The blocking rate contrast of three kinds of mapping methods under different business amount that Fig. 3 provides for one embodiment of the invention;
The resource of two kinds of mapping methods that Fig. 4 provides for one embodiment of the invention receives than over time;
The structural representation of a kind of resource mapping apparatus based on SDN multi-area optical network Intel Virtualization Technology that Fig. 5 provides for one embodiment of the invention.
Embodiment
Below in conjunction with accompanying drawing, the embodiment of invention is further described.Following examples only for technical scheme of the present invention is clearly described, and can not limit the scope of the invention with this.
Fig. 1 shows the flow chart of a kind of method for mapping resource based on SDN multi-area optical network Intel Virtualization Technology that the present embodiment provides, and comprising:
S101: when receiving virtual request, is mapped to physical node by the dummy node in described virtual request;
S102: for every bar virtual link, obtains the K bar shortest path that this virtual link is corresponding;
S103: according to the spectral bandwidth of every bar shortest path, calculates the mapping probabilities of every bar shortest path, and determines the path that mapping probabilities is maximum;
S104: adopt certain modulation format for this virtual link distribution frequency spectrum resource on the path that described mapping probabilities is maximum.
Wherein, when node mapping, each dummy node is mapped on corresponding physical node under the condition meeting geographical position and exchange capacity.Mapping principle is in the physics optical node of idle larger capacity with the virtual service node mapping of larger demand.Node mapping need meet following constraints:
Σv s ∈ v s ξ v r , v s = 1 , ∀ v r ∈ V r - - - ( 1 )
Σv r ∈ V r ξ v r , v s ≤ 1 , ∀ v s ∈ V s - - - ( 2 )
Σv s ∈ V s ξ v r , v s · C v s s ≥ C v r r , ∀ v r ∈ V r - - - ( 3 )
(1) formula represents that each dummy node needs to be mapped on a physical node;
(2) formula represents that a physical node carries a dummy node, and two namely different dummy nodes can not be mapped on same physical node;
(3) formula illustrates that the idling-resource of the actual physical node mapped needs to be more than or equal to the resource capacity needed for dummy node request.
During link maps, following constraints need be met:
Σ ( u s , v s ) ∈ E s f u s , v s e r - Σ ( v s , u s ) ∈ E s f v s , u s e r = ξ S r e r , u s - ξ d r e r , u s , ∀ e r ∈ E r , ∀ u s ∈ V s - - - ( 4 )
Σe r ∈ E r ( f u s , v s e r + f v s , u s e r ) ≤ 1 , ∀ ( u s , v s ) ∈ E s - - - ( 5 )
z-w+1=n r(6)
(4) formula is stream conservation constraints condition, ensures on the physical node of each non-end points, and data flow into and equal to flow out;
(5) formula can ensure that all virtual optical links are all link disjoint when being mapped to physical topology, namely different virtual links can not occur and be mapped to situation on same physical link;
(6) formula can be guaranteed all can meet bandwidth demand to the continuous idle frequency spectrum section of arbitrary virtual optical subnet request dispatching.
In order to ensure giving G r(V r, E r) the continuous idle frequency spectrum section of distributing is available continuous frequency spectrum section unique on a certain bar physical link, and the idle continuous frequency spectrum section that the Capacity Ratio of available continuous frequency spectrum section on this route frequency domain is distributed wants many, three constraintss below demand fulfillment:
Σ k δ ( u s , v s ) ( k ) = Σe r ∈ E r ( f u s , v s e r + f v s , u s e r ) , ∀ ( u s , v s ) ∈ E s - - - ( 7 )
w ≥ w s ( u s , v s ) , k · δ ( u s , v s ) ( k ) , ∀ ( u s , v s ) ∈ E s , ∀ k - - - ( 8 )
z ≤ ( z s ( u s , v s ) , k - B s ) δ ( u s , v s ) ( k ) + B s , ∀ ( u s , v s ) ∈ E s , ∀ k - - - ( 9 )
Wherein, the variable declaration of formula (1)-(9) is as shown in the table:
Virtual static mappings in software definition optical-fiber network is a np problem, in order to better describe the process of mapping, and the mapping relations of virtual optical subnet and physical network, therefore the present invention adopts the symbol in table.Wherein, VON (virtualopticalnetwork) represents virtual optical network; MCSB (multiplecontinuousspectrumblock, many continuous frequency spectrums block) represents at a certain frequency domain, comprises all available idle continuous frequency spectrum sections; CSB (continuousspectrumblock, continuous frequency spectrum block) represents idle sub-carrier available continuously in frequency domain.
The resource balance method that the resource selection strategy that the present embodiment maps for virtual optical network proposes, the Cooperative Virtual of application resource and bandwidth resources can be realized, after partial discharge is dredged, carry out unifying to map, effectively to reduce resource blockage rate, and improve business and accept ratio.
As the preferred version of the present embodiment, described dummy node in described virtual request is mapped to physical node, comprises:
By all described dummy nodes according to resource capacity descending;
By all described physical nodes according to idling-resource descending;
The dummy node of described descending is mapped to according to the order of sequence the physical node of described descending.
Particularly, virtual link described in every bar is mapped to a described path; Path described in every bar carries a described virtual link.
Further, described dummy node in described virtual request is mapped to physical node, also comprises: each described dummy node is mapped to a described physical node; Each described physical node carries a described dummy node; The resource capacity of dummy node is less than or equal to the idling-resource of physical node corresponding to described dummy node.
Further, the K bar shortest path that this virtual link of described acquisition is corresponding, comprising: obtain K bar shortest path corresponding to this virtual link by K bar shortest path KSP algorithm.
For example, the spectral bandwidth of the every bar shortest path of described basis, calculates the mapping probabilities of every bar shortest path, comprising: according to the constraints of transmission range and service quality, determine the described modulation format of shortest path described in every bar; According to the bandwidth on demand of described modulation format and described virtual request, determine the spectral bandwidth of shortest path described in every bar; According to described spectral bandwidth, calculate the mapping probabilities of every bar shortest path.
Further, the mapping probabilities of described shortest path is the proportion that the idle continuous frequency spectrum hop count current shortest path meeting preset capacity accounts for the spectral bandwidth sum on all described shortest paths, and namely mapping probabilities can be expressed as:
Wherein, (u s, v s) represent shortest path; P (u s, v s) represent the mapping probabilities of shortest path; W is integer variable, represents that distributing to VON asks G r(V r, E r) the initial subcarrier subscript of CSB, i.e. link (u s, v s) capacity of upper demand fulfillment.
Using resource balance method in the map, each virtual link, under the condition meeting certain spectrum width, being mapped in physical pathway by adopting KSP method.After finding corresponding k bar route, each physical link on this path can be detected and whether meet consistent wavelength and spectral continuity.The method needs to judge that virtual link to map in the set produced each node to (u s, v s) the combination of all routes, and record the mapping probabilities of each node to k bar route, be designated as P (u s, v s).In the k bar link of all candidates, select the route with the highest mapping probabilities, and in selected route, adopt certain modulation format to be that virtual link distributes frequency spectrum resource.In whole process, consider the equilibrium of network spectrum resource, the utilance of Internet resources can well be guaranteed like this.
Further, described frequency spectrum resource is obtained by initial hit algorithm.Initial hit algorithm is a professional frequency spectrum distributing method, specifically refers to: from first entry of Free Partition table, search this table, operation is distributed in the free area that can meet the demands at first, and this method object is that the time is searched in minimizing.For adapting to this algorithm, the Free Partition in Free Partition table (free area chain) will sort from low to high by address.This algorithm preferentially uses part free area, low location, causes many little free areas, retain large free area in high address space in space, low location.
With concrete data instance, the present embodiment adopts the NSFNET topology of 14 nodes in simulations.Suppose that the capacity of every section of physical link is 12.5THz, the granularity of subcarrier is 12.5GHz, and the CPU capacity of each node is 2000.The service request of virtual optical network produces at random, the arrival of business and leave away and all obey Poisson distribution.Wherein the number of dummy node is set as the random integers between 3 to 5, the cpu resource of each node request account for node resource ratio 0.5% to 1.0% between be uniformly distributed, the bandwidth of every root virtual link request is { 12.5,25, random distribution in 50,100}Gbps.
Method for mapping resource of the present invention and traditional Random Maps method and load are weighed Measures compare by the present embodiment, comparative result as in Figure 2-4, Fig. 2 and Fig. 3 is illustrated respectively in the blocking rate contrast under different business sum and different business amount, and Fig. 4 represents that the resource of two kinds of mapping methods receives than over time.
Fig. 2,3 is the change curve that three kinds of heuristic mapping methods (stochastic route, load balancing, resource are weighed) business maps blocking probability.Can find out that the resource blockage rate of three kinds of methods all presents ascendant trend along with the increase of service request quantity.When number of services is little, random routing method original stopper rate is minimum, but does not carry out any optimization to network state due to it, therefore rises rapidly along with the increase of business number.Resource balance method and load-balancing method performance remain basically stable, run the starting stage, the average behavior of load-balancing method is better than resource balance method, this is because the assignment of traffic of load-balancing method to core node have employed the strategy dredged, the flow distribution relative equilibrium of each business in network is made to make network state be in a kind of state of equilibrium.But, when simulation run enters plateau, network state relative saturation, the blocking rate of resource balance is lower than load-balancing method, this is because resource balance can either carry out traffic grooming, can reasonably utilize node capacity and link spectral again, reduce the mapping difficulty of virtual network topology, thus improve the success rate of mapping.As seen from Figure 4, resource balance method be mapped to power considerably beyond Random Maps method, resource balance method has obvious advantage.
Fig. 5 shows the structural representation of a kind of resource mapping apparatus based on SDN multi-area optical network Intel Virtualization Technology that the present embodiment provides, and comprising:
Node mapping module 11: during for receiving virtual request, is mapped to physical node by the dummy node in described virtual request;
Path acquisition module 12: for for every bar virtual link, obtain the K bar shortest path that this virtual link is corresponding;
Path determination module 13: for the spectral bandwidth according to every bar shortest path, calculates the mapping probabilities of every bar shortest path, and determines the path that mapping probabilities is maximum;
Resource distribution module 14: distribute frequency spectrum resource for this virtual link for adopting certain modulation format on the maximum path of described mapping probabilities.
Under SDN flexible spectrum optical-fiber network framework, optical switching device can be realized and be separated with the decoupling zero that data transmit plane, thus keyholed back plate unified is flexibly carried out to Internet resources.For the optical network environment of multiple domain, utilize the mutual of territory internal controller, realize cross-domain virtual mapping mechanism.Can solve in software definition optical-fiber network for the present invention of this framework, the problem that the partial discharge that after being distributed by virtual subnet service dynamic, bandwidth resource allocation inequality causes overloads and business is blocked; Realize the Cooperative Virtual of application resource and bandwidth resources simultaneously, after partial discharge is dredged, make network state be in a kind of state of equilibrium, carry out unifying to map.Effective raising business accepts ratio, reduces blocking rate.
As the preferred version of the present embodiment, described node mapping module 11 comprises:
Dummy node sequencing unit: for by all described dummy nodes according to resource capacity descending;
Dummy node sequencing unit: for by all described physical nodes according to idling-resource descending;
Node is map unit according to the order of sequence: for the dummy node of described descending being mapped to according to the order of sequence the physical node of described descending.
In specification of the present invention, describe a large amount of detail.But can understand, embodiments of the invention can be put into practice when not having these details.In some instances, be not shown specifically known method, structure and technology, so that not fuzzy understanding of this description.

Claims (10)

1. based on a method for mapping resource for SDN multi-area optical network Intel Virtualization Technology, it is characterized in that, comprising:
When receiving virtual request, the dummy node in described virtual request is mapped to physical node;
For every bar virtual link, obtain the K bar shortest path that this virtual link is corresponding;
According to the spectral bandwidth of every bar shortest path, calculate the mapping probabilities of every bar shortest path, and determine the path that mapping probabilities is maximum;
The path that described mapping probabilities is maximum adopt certain modulation format for this virtual link distribution frequency spectrum resource.
2. method according to claim 1, is characterized in that, described dummy node in described virtual request is mapped to physical node, comprising:
By all described dummy nodes according to resource capacity descending;
By all described physical nodes according to idling-resource descending;
The dummy node of described descending is mapped to according to the order of sequence the physical node of described descending.
3. method according to claim 2, is characterized in that, described dummy node in described virtual request is mapped to physical node, also comprises:
Each described dummy node is mapped to a described physical node;
Each described physical node carries a described dummy node;
The resource capacity of dummy node is less than or equal to the idling-resource of physical node corresponding to described dummy node.
4. method according to claim 1, is characterized in that, the K bar shortest path that this virtual link of described acquisition is corresponding, comprising: obtain K bar shortest path corresponding to this virtual link by K bar shortest path KSP algorithm.
5. method according to claim 1, is characterized in that, the spectral bandwidth of the every bar shortest path of described basis, calculates the mapping probabilities of every bar shortest path, comprising:
According to the constraints of transmission range and service quality, determine the modulation format of shortest path described in every bar;
According to the bandwidth on demand of described modulation format and described virtual request, determine the spectral bandwidth of shortest path described in every bar;
According to described spectral bandwidth, calculate the mapping probabilities of every bar shortest path.
6. method according to claim 5, is characterized in that, the mapping probabilities of described shortest path is the proportion that the idle continuous frequency spectrum hop count current shortest path meeting preset capacity accounts for the spectral bandwidth sum on all described shortest paths.
7. method according to claim 1, is characterized in that, described frequency spectrum resource is obtained by initial hit algorithm.
8. method according to claim 1, is characterized in that:
Virtual link described in every bar is mapped to a described path;
Path described in every bar carries a described virtual link.
9. based on a resource mapping apparatus for SDN multi-area optical network Intel Virtualization Technology, it is characterized in that, comprising:
Node mapping module: during for receiving virtual request, is mapped to physical node by the dummy node in described virtual request;
Path acquisition module: for for every bar virtual link, obtain the K bar shortest path that this virtual link is corresponding;
Path determination module: for the spectral bandwidth according to every bar shortest path, calculates the mapping probabilities of every bar shortest path, and determines the path that mapping probabilities is maximum;
Resource distribution module: distribute frequency spectrum resource for this virtual link for adopting certain modulation format on the maximum path of described mapping probabilities.
10. device according to claim 9, is characterized in that, described node mapping module comprises:
Dummy node sequencing unit: for by all described dummy nodes according to resource capacity descending;
Dummy node sequencing unit: for by all described physical nodes according to idling-resource descending;
Node is map unit according to the order of sequence: for the dummy node of described descending being mapped to according to the order of sequence the physical node of described descending.
CN201510886080.XA 2015-12-04 2015-12-04 Method for mapping resource and device based on SDN multi-area optical network virtualization technology Active CN105530199B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510886080.XA CN105530199B (en) 2015-12-04 2015-12-04 Method for mapping resource and device based on SDN multi-area optical network virtualization technology

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510886080.XA CN105530199B (en) 2015-12-04 2015-12-04 Method for mapping resource and device based on SDN multi-area optical network virtualization technology

Publications (2)

Publication Number Publication Date
CN105530199A true CN105530199A (en) 2016-04-27
CN105530199B CN105530199B (en) 2019-05-24

Family

ID=55772190

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510886080.XA Active CN105530199B (en) 2015-12-04 2015-12-04 Method for mapping resource and device based on SDN multi-area optical network virtualization technology

Country Status (1)

Country Link
CN (1) CN105530199B (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106713139A (en) * 2017-01-22 2017-05-24 国网辽宁省电力有限公司鞍山供电公司 Software defined Nyquist system and method in support of high-capacity power data transmission
CN106789707A (en) * 2016-11-28 2017-05-31 北京邮电大学 A kind of software definition Packet Transport Network overall situation service dynamic optimization method and device
CN108092733A (en) * 2016-11-21 2018-05-29 中兴通讯股份有限公司 Determining method of path that IP network is merged with optical transport network, apparatus and system
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
CN114745274A (en) * 2022-04-15 2022-07-12 烽火通信科技股份有限公司 Method and device for realizing virtual network mapping based on flexible grid optical network

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102904794A (en) * 2012-09-27 2013-01-30 北京邮电大学 Method and device for mapping virtual network
CN103428805A (en) * 2013-08-07 2013-12-04 湖南大学 Wireless network virtualization mapping method based on anti-interference performance of links
CN104993941A (en) * 2015-05-14 2015-10-21 西安电子科技大学 Openflow-based network highly-fault-tolerant virtual network mapping algorithm

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102904794A (en) * 2012-09-27 2013-01-30 北京邮电大学 Method and device for mapping virtual network
CN103428805A (en) * 2013-08-07 2013-12-04 湖南大学 Wireless network virtualization mapping method based on anti-interference performance of links
CN104993941A (en) * 2015-05-14 2015-10-21 西安电子科技大学 Openflow-based network highly-fault-tolerant virtual network mapping algorithm

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108092733A (en) * 2016-11-21 2018-05-29 中兴通讯股份有限公司 Determining method of path that IP network is merged with optical transport network, apparatus and system
CN108092733B (en) * 2016-11-21 2019-06-18 中兴通讯股份有限公司 Determining method of path that IP network is merged with optical transport network, apparatus and system
CN106789707A (en) * 2016-11-28 2017-05-31 北京邮电大学 A kind of software definition Packet Transport Network overall situation service dynamic optimization method and device
CN106789707B (en) * 2016-11-28 2019-10-29 北京邮电大学 A kind of software definition Packet Transport Network overall situation service dynamic optimization method and device
CN106713139A (en) * 2017-01-22 2017-05-24 国网辽宁省电力有限公司鞍山供电公司 Software defined Nyquist system and method in support of high-capacity power data transmission
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
CN108347380B (en) * 2018-02-27 2020-10-20 重庆邮电大学 Virtual optical network collaborative mapping method based on spectrum dispersion perception
CN114745274A (en) * 2022-04-15 2022-07-12 烽火通信科技股份有限公司 Method and device for realizing virtual network mapping based on flexible grid optical network

Also Published As

Publication number Publication date
CN105530199B (en) 2019-05-24

Similar Documents

Publication Publication Date Title
CN105530199A (en) Resource mapping method and device based on SDN (Software Defined Network) multi-domain optical network virtualization technology
CN108156041B (en) Differentiated virtual optical network mapping method based on security perception
US10069570B2 (en) Multi-layer modem reclamation systems and methods
CN105827528B (en) A kind of route selection method suitable for the flexible optical-fiber network of frequency spectrum
KR20060022680A (en) Method and system for global routing and bandwidth sharing
WO2023039965A1 (en) Cloud-edge computing network computational resource balancing and scheduling method for traffic grooming, and system
Walkowiak et al. Dynamic routing of anycast and unicast traffic in elastic optical networks
Botero et al. A novel paths algebra-based strategy to flexibly solve the link mapping stage of VNE problems
CN108134967A (en) A kind of electric power optical-fiber network routing frequency spectrum distributing method and system
CN111162865A (en) Virtual optical network mapping method for sensing fragments in space division multiplexing elastic optical network
Zheng et al. Dependence-aware service function chain embedding in optical networks
US20180076920A1 (en) Method and apparatus for efficient network utilization using superchannels
CN113300861B (en) Network slice configuration method, device and storage medium
Bao et al. Adaptive path splitting based survivable virtual network embedding in elastic optical networks
Yi et al. Provisioning virtualized cloud services in IP/MPLS-over-EON networks
Nace et al. Computing optimal max-min fair resource allocation for elastic flows
Fréchette et al. Shortest path versus multihub routing in networks with uncertain demand
Liu et al. Resource efficiency improved approach for shared path protection in EONs
Gupta et al. Service chain (SC) mapping with multiple SC instances in a wide area network
Khatiri et al. Resource balanced service chaining in NFV-enabled inter-datacenter elastic optical networks
Guler et al. Virtual multicast tree embedding over elastic optical networks
Gowd et al. A traffic delay and bandwidth based multipath scheduling approach for optimal routing in underwater optical network
Yu et al. Deterministic service function chaining over beyond 5g edge fabric
Hong et al. Effective virtual optical network embedding based on topology aggregation in multi-domain optical networks
CN110113376A (en) A kind of Multipath Transmission load balance optimization algorithm based on mobile edge calculations

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
CP01 Change in the name or title of a patent holder

Address after: 100053 room 482, 1411 inner main street, Xicheng District, Beijing, Guanganmen

Co-patentee after: STATE GRID CORPORATION OF CHINA

Patentee after: Information communication branch company of State Grid Jibei Electric Power Co., Ltd.

Address before: 100053 room 482, 1411 inner main street, Xicheng District, Beijing, Guanganmen

Co-patentee before: State Grid Corporation of China

Patentee before: Information communication branch company of State Grid Jibei Electric Power Co., Ltd.

CP01 Change in the name or title of a patent holder