CN106100964A - The method and apparatus that a kind of virtual network maps - Google Patents
The method and apparatus that a kind of virtual network maps Download PDFInfo
- Publication number
- CN106100964A CN106100964A CN201610716084.8A CN201610716084A CN106100964A CN 106100964 A CN106100964 A CN 106100964A CN 201610716084 A CN201610716084 A CN 201610716084A CN 106100964 A CN106100964 A CN 106100964A
- Authority
- CN
- China
- Prior art keywords
- virtual network
- virtual
- physical
- node
- network
- 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
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/46—Interconnection of networks
- H04L12/4641—Virtual LANs, VLANs, e.g. virtual private networks [VPN]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/46—Interconnection of networks
- H04L12/4641—Virtual LANs, VLANs, e.g. virtual private networks [VPN]
- H04L12/4675—Dynamic sharing of VLAN information amongst network nodes
- H04L12/4679—Arrangements for the registration or de-registration of VLAN attribute values, e.g. VLAN identifiers, port VLAN membership
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses the method and apparatus that a kind of virtual network maps, method includes: obtain multiple first virtual networks virtual network requests corresponding to physical network to be mapped in current time window；According to the first virtual network requests of at least one in virtual network requests, map all dummy nodes of at least one the first virtual network to physical node corresponding in physical network；The virtual network requests mapped according to dummy node at least one first virtual network requests, on all virtual links corresponding to the first virtual network that maps virtual node has mapped to physical link corresponding in physical network；After each virtual link having mapped at least one the first virtual network, obtain corresponding physical link, unappropriated virtual network identifier VLAN ID, VLAN ID is distributed to each virtual link.Present invention achieves method based on the VLAN ID multiplexing mapping under SDN environment.
Description
Technical field
The present invention relates to VLAN (Virtual Local Area Network, VLAN) technical field, more specifically
Relate to a kind of virtual network map method and apparatus.
Background technology
Network virtualization is a key technology of future computer network.It can be by the Resource Abstract in physical network
Out, when the tenant of virtual network is to virtual platform request Internet resources, network virtualization can be reflected by virtual network
Penetrate algorithm and carry out Resources allocation to meet the demand of tenants.SDN (Software Defined Network, software defined network)
Appearance provide the most promising mode of one to build network virtualization, the control function in network is integrated in center by it
Control plane in.
In virtual network, section isolation is the major issue building virtual network.Under the background of SDN, section isolation
Method can be largely classified into based on fluid space with based on fixed field.Packet under SDN environment can be divided into header part sum
According to part, wherein, header part describes the specific features of packet, and the space of each feature field in packet header composition is referred to as flowing sky
Between.The isolation method that fluid space carries out diversity correspondence difference virtual network is referred to as isolation based on fluid space.Use packet header
Divide certain field to be referred to as isolation based on fixed field as virtual network uniquely identified isolation method, user can be limited virtual
The use of net identifier field, as used MAC (Media Access Control, medium education) address as identifier
After, user will can not use the mac address range that identifier is corresponding.It is also a pass in network virtualization that virtual network maps
Key technology, the virtual network of tenant request can be mapped in physical network by efficiently.The most frequently used virtual network maps
Algorithm is two step reflection methods, and time window model is also usually utilized to process the virtual network requests of dynamically arrival.
The implementation method of most-often used section isolation is to utilize vlan technology, and it is isolation based on fixed field.By
Invention in VLAN field is contemplated to realize simply virtualizing, and therefore takies VLAN as identifier on the impact of user
Little.Meanwhile, computer network facility also makes this kind of scheme shadow to physical network provider to the extensive support of VLAN instantly
Ring minimum.In the specific implementation, when virtual network is mapped in physical network, each virtual network has in full physical network only
The VLAN ID of one.It means that the yardstick of VLAN ID is the whole network, each virtual network can be direct by VLAN ID
Determining, the VLAN ID shared by different virtual links in the most same virtual network is the same, is all this unique VLAN
ID, before virtual network arrives the life-span, other virtual network any is to all not using this VLAN ID.In VLAN tag
VLAN ID only has 12, it means that uses existing vlan technology to do virtual network isolation and will be limited in 4096.
Summary of the invention
The purpose of the embodiment of the present invention is the method and apparatus providing a kind of virtual network to map, can be at SDN environment
Under the diverse location of physical network is used VLAN ID, when not isolated virtual network by existing vlan technology, VLAN ID exists
The restriction of 4096.
For reaching above-mentioned purpose, the embodiment of the invention discloses a kind of method that virtual network maps, including:
Obtain multiple first virtual networks virtual network requests corresponding to physical network to be mapped in current time window, its
In, described virtual network requests includes: at least one dummy node of the first virtual network that described virtual network requests is corresponding
And the virtual link between dummy node；
According at least one first virtual network requests in described virtual network requests, map at least one first virtual
All dummy nodes of network are to physical node corresponding with the dummy node of described first virtual network in described physical network
On, wherein, at least one first virtual network requests described and at least one first virtual network one_to_one corresponding described；
The virtual network requests mapped according to dummy node at least one first virtual network requests described, maps
All virtual links corresponding to the first virtual network that dummy node has mapped, to virtual with described in described physical network
On the physical link that the first virtual network that node has mapped is corresponding；
After each virtual link having mapped at least one the first virtual network, obtain in described physical network with
Physical link corresponding to the first virtual network that described dummy node has mapped, unappropriated virtual network identifier VLAN
ID, distributes to each virtual link of at least one the first virtual network mapped by described VLAN ID.
It is also preferred that the left described according at least one first virtual network requests in described virtual network requests, map at least
All dummy nodes of one the first virtual network are to dummy node pair with described first virtual network in described physical network
On the physical node answered, including:
According to described virtual network requests, from big to small described virtual network requests is sorted according to request income, obtain
The first order result of intending virtual network request corresponding with sort order, according to the sort order of described first order result, really
The first virtual network requests corresponding in fixed at least one first virtual network requests described, wherein, described request income is every
The request resource of the dummy node of individual virtual network requests and the request resource sum of virtual link bandwidth；
According to the order of described first order result, by the first virtual network of request in described first virtual network requests
In all dummy nodes, be ranked up from big to small according to the demand resource of all dummy nodes, obtain and all virtual joints
Second order result of all dummy nodes in the first virtual network that the sort order of demand resource of point is corresponding；
According to the sort order of described second order result, map that at least one first virtual network sort owns
Dummy node, on physical node corresponding with the dummy node of described first virtual network in described physical network.
It is also preferred that the left at the described sort order according to described second order result, map at least one first virtual network
All dummy nodes of having sorted, to physics corresponding with the dummy node of described first virtual network in described physical network
Before on node, the method that described virtual network maps also includes:
According to the sort order of described second order result, search and described physical network exists physics node cpu resource
The physical node of the demand resource of first dummy node corresponding more than with the sort order of described second order result, and
According to preset formula, described physical node cpu resource is more than the thing of the demand resource of described first dummy node
In reason node, the maximum physical node of CPU surplus resources, be defined as the physics joint corresponding with described first dummy node
Point.
It is also preferred that the left described preset formula is:
WAR (n)=CorrmCPU(n)∑l∈L(n)(BW(l)+VLAN(l))
Wherein, described WAR is the CPU surplus resources of physical node in described physical network, and described Corr is for weighing physics
The parameter of node compactness, described n is arbitrary physical node in described physical network, described m be in described physical network by
The physical node number that the dummy node of same virtual network requests maps, described L (n) be in described physical network with described thing
Reason all physical links of being connected of node, described l is the physical link that described physical node is connected, described BW be with
The bandwidth that the physical link that described physical node is connected takies, described VLAN is be connected with described physical node
The VLAN ID number of bar physical link.
It is also preferred that the left at the described order according to described first order result, will described first virtual network requests be asked
The first virtual network in all dummy nodes, be ranked up from big to small according to the demand resource of all dummy nodes,
Second of all dummy nodes in first virtual network corresponding with the sort order of the demand resource of all dummy nodes
Sequentially after result, the method that described virtual network maps also includes:
The physics node cpu resource demand resource more than described first dummy node is there is not in described physical network
During physical node, and exceed preset remap thresholding time, refusal maps all void of having sorted of described first virtual network
Intend node, on physical node corresponding with the dummy node of described first virtual network in described physical network；
Not less than described preset remap thresholding time, wait all virtual joint that described first virtual network has sorted
The next time window of the first virtual network requests of some correspondence, extremely described current time window.
It is also preferred that the left the virtual net that at least one first virtual network requests described in described basis, dummy node has mapped
Network is asked, all virtual links corresponding to the first virtual network that maps virtual node has mapped, to described physical network
In on the physical link corresponding with the first virtual network that described dummy node has mapped, including:
Obtain the virtual network requests that at least one first virtual network requests described, dummy node has mapped, according to
The virtual network requests sequence that described dummy node has been mapped by request income from big to small, obtains corresponding with sort order
, the 3rd order result of the virtual network requests that dummy node has mapped, wherein, described request income is for each virtual net
The request resource of the dummy node of network request and the request resource sum of link bandwidth；
According to the sort order of described 3rd order result, the first virtual network pair that maps virtual node has mapped
All virtual links of answering, all to the first virtual network mapped with described dummy node in described physical network
On the physical link that virtual link is corresponding.
It is also preferred that the left at the described sort order according to described 3rd order result, maps virtual node has mapped
All virtual links corresponding to the first virtual network, to first mapped with described dummy node in described physical network
Before on the physical link that all virtual links of virtual network are corresponding, the method that described virtual network maps also includes:
By k shortest path first, search the shortest physical link of k bar between physical node in described physical network；
According to the described the shortest physical link of k bar, the band that there is physical link in the described the shortest physical link of k bar is wider than
Or the bandwidth of first virtual link corresponding equal to the sort order of described 3rd order result, and unappropriated VLAN
The physical link of ID, is defined as the physical link corresponding with described first virtual link, and wherein, described k is the nature more than 1
Number.
It is also preferred that the left at least one first virtual network requests described in described acquisition dummy node mapped virtual
Network request, according to request income from big to small described dummy node has been mapped virtual network requests sequence, obtain and
After 3rd order result of virtual network requests that sort order is corresponding, that dummy node has mapped, described virtual net
The method that network maps also includes:
When there is not the physical link corresponding with described first virtual link in described physical network and default exceeding
When remapping thresholding, all virtual links corresponding to refusal the first virtual network of having mapped of maps virtual node, to institute
State physics chain corresponding with all virtual links of the first virtual network that described dummy node has mapped in physical network
Lu Shang；
Not less than described preset remap thresholding time, wait the first virtual network that described dummy node has mapped
The first virtual network requests that all virtual links are corresponding, in the next time window of described current time window.
For reaching above-mentioned purpose, the embodiment of the invention also discloses the device that a kind of virtual network maps, including:
Virtual network requests acquisition module, in being used for obtaining current time window, multiple first virtual networks are to be mapped to physics
The virtual network requests that network is corresponding, wherein, described virtual network requests includes: the first void that described virtual network requests is corresponding
Intend the virtual link between at least one dummy node and the dummy node of network；
Dummy node mapping block, for asking according at least one first virtual network in described virtual network requests
Ask, map all dummy nodes of at least one the first virtual network in described physical network with described first virtual network
On the physical node that dummy node is corresponding, wherein, at least one first virtual network requests described with described at least one first
Virtual network one_to_one corresponding；
Virtual link mapping block, for having mapped according to dummy node at least one first virtual network requests described
The virtual network requests become, all virtual links corresponding to the first virtual network that maps virtual node has mapped, to institute
State on physical link corresponding with the first virtual network that described dummy node has mapped in physical network；
VLAN ID distributes module, is used for after each virtual link having mapped at least one the first virtual network,
Obtain physical link corresponding with the first virtual network that described dummy node has mapped in described physical network, vacant
Virtual network identifier VLAN ID, described VLAN ID is distributed to described at least one the first virtual network every that complete
Individual virtual link.
It is also preferred that the left described dummy node mapping block, including:
Virtual network requests sorting sub-module, for according to described virtual network requests, taking in from big to small according to request
Described virtual network requests is sorted, obtains the first order result of the virtual network requests corresponding with sort order, according to institute
State the sort order of the first order result, determine that the first virtual network at least one first virtual network requests described please
Asking, wherein, described request income is the request resource of dummy node and the asking of virtual link bandwidth of each virtual network requests
Seek resource sum；
Dummy node sorting sub-module, for the order according to described first order result, by described first virtual network
In request, all dummy nodes in the first virtual network of request, enter from big to small according to the demand resource of all dummy nodes
Row sequence, obtains all virtual joint in the first virtual network that the sort order of demand resource with all dummy nodes is corresponding
Second order result of point；
Dummy node mapping submodule, for the sort order according to described second order result, map at least one the
All dummy nodes that one virtual network has sorted, to dummy node with described first virtual network in described physical network
On corresponding physical node.
The present invention proposes the method and apparatus that a kind of virtual network maps, this invention be based on traditional two step reflection methods and
Time window model, in Same Physical network, by physical location and two fixed fields of VLAN ID as virtual network mark
Knowing, it is achieved section isolation technology, simply use mono-fixed field of VLAN and do section isolation in relatively conventional method, the present invention makes
The interference problem between different virtual network flow is preferably solved with two field isolation.In mapping process, by VLAN
ID is mapped on virtual link as a kind of link circuit resource, VLAN ID in conventional physical network is achieved multiplexing, and breaches
The restriction to VLAN ID number of the existing vlan technology.It addition, the method and apparatus that a kind of virtual network of the present invention maps can be
Network-based control function concentrates on control plane management, it is achieved multiplexing based on the VLAN ID under SDN environment.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
In having technology to describe, the required accompanying drawing used is briefly described, it should be apparent that, the accompanying drawing in describing below is only this
Some embodiments of invention, for those of ordinary skill in the art, on the premise of not paying creative work, it is also possible to
Other accompanying drawing is obtained according to these accompanying drawings.
Fig. 1 is the virtual network mapping principle figure of the network virtualization of the embodiment of the present invention；
Fig. 2 is the method flow diagram of a kind of virtual network mapping of the embodiment of the present invention；
Fig. 3 is the structured flowchart of the device of a kind of virtual network mapping of the embodiment of the present invention；
Fig. 4 is the dummy node mapping block figure of the device of a kind of virtual network mapping of the embodiment of the present invention；
Fig. 5 is the structured flowchart of the device of a kind of dummy node mapping of the embodiment of the present invention；
Fig. 6 is the virtual link mapping block figure of the device of a kind of virtual network mapping of the embodiment of the present invention；
Fig. 7 is the structured flowchart of the device of a kind of virtual link mapping of the embodiment of the present invention；
Fig. 8 is the result figure of a kind of virtual network mapping of the embodiment of the present invention.
Detailed description of the invention
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete
Describe, it is clear that described embodiment is only a part of embodiment of the present invention rather than whole embodiments wholely.Based on
Embodiment in the present invention, it is every other that those of ordinary skill in the art are obtained under not making creative work premise
Embodiment, broadly falls into the scope of protection of the invention.
The method and apparatus that a kind of virtual network disclosed in the embodiment of the present invention maps, is described in detail individually below.
For the ease of the understanding of the method and apparatus that a kind of virtual network providing the present invention maps, first introduce this
Bright embodiment based on schematic diagram.
As it is shown in figure 1, the virtual network mapping principle figure of the network virtualization that Fig. 1 is the embodiment of the present invention.Network virtual
Change is the key technology of computer network, it is achieved mode is the Physical Network to physical layer of the virtual network by maps virtual layer
Network, distributes physical network resource and uses to the tenant of virtual network.As shown in Figure 1, by mapping the in virtual level 101
One virtual network 1011 is mapped in the physical network of physical layer 102, and the second virtual network 1012 in virtual level 101 is mapped
In the physical network of physical layer 102.Particularly the dummy node 1013 of the first virtual network 1011 is mapped to Physical Network
On the physical node 1015 that network is corresponding with the dummy node 1013 of the first virtual network 1011, the void of the first virtual network 1011
Intend link 1014 to be mapped on the physical link 1016 that physical network is corresponding with the virtual link 1014 of the first virtual network 1011；
The dummy node 1013 of the second virtual network 1012 is mapped to physical network and the dummy node of the second virtual network 1012
On the physical node 1015 of 1013 correspondences, the virtual link 1014 of the second virtual network 1012 is mapped to physical network and second
On the physical link 1016 of virtual link 1014 correspondence of virtual network 1012.With VLAN ID as mark in vlan technology
Field, it is achieved section isolation.
In order to solve the restriction of VLAN ID number in existing vlan technology, the present embodiment has been invented a kind of virtual network and has been reflected
The method penetrated, as in figure 2 it is shown, the method flow diagram that a kind of virtual network that Fig. 2 is the embodiment of the present invention maps, including:
S201: in obtaining current time window, multiple first virtual networks virtual network corresponding to physical network to be mapped please
Asking, wherein, virtual network requests includes: at least one dummy node of the first virtual network that virtual network requests is corresponding and void
Intend the virtual link between node；
S202: according to the first virtual network requests of at least one in virtual network requests, maps at least one first void
Intend all dummy nodes of network on physical node corresponding with the dummy node of the first virtual network in physical network, its
In, at least one first virtual network requests and at least one first virtual network one_to_one corresponding；
S203: the virtual network requests mapped according to dummy node at least one first virtual network requests, reflects
Penetrate all virtual links corresponding to the first virtual network that dummy node mapped, in physical network with dummy node
On the physical link that the first virtual network of having mapped is corresponding；
S204: after each virtual link having mapped at least one the first virtual network, obtains in physical network
Physical link corresponding to the first virtual network of having mapped with dummy node, unappropriated virtual network identifier VLAN
ID, distributes to each virtual link of at least one the first virtual network mapped by VLAN ID.
In embodiments of the present invention, by obtaining multiple first virtual networks virtual net corresponding to physical network to be mapped
Network is asked, and uses two step mapping algorithms to map the dummy node of virtual network, then maps virtual link, to virtual link
After mapping completes, the physical link that this virtual link mapping pair is answered distributes untapped VLAN ID on physical link, passes through
The physical port of switch and two fields of VLAN ID realize the isolation of section, this also means that the difference of same virtual network
The VLAN ID that virtual link takies can be different, and relative in tradition vlan technology, a virtual network takies a VLAN
ID is before this virtual network arrives the life-span, and other virtual networks can not use this VLAN ID, and virtual network of the present invention maps
Method more abundant to the utilization of physical resource VLAN ID；It addition, what the virtual link of other different virtual networks took
VLAN ID can be identical, and relative in tradition vlan technology, VLAN ID only has 4096, and namely VLAN ID at most can only
Distributing to 4096 virtual networks, the method that virtual network of the present invention maps breaches VLAN ID and at most can only distribute to 4096
The restriction of individual virtual network, can distribute to more virtual network and use.
Additionally, compared to traditional in order to solve VLAN ID capacity constraint, the problem of many tenants scene, in prior art
Headed by Cisco four network vendors occurred propose virtual expansible LAN Internet engineering duty group grass
Case, and come from the Q-in-Q technology of standard IEEE 802.1ad, original VLAN ID number is extended to 4096* from 4096
4096, both schemes do not concentrate on control plane management network-based control function and are also not appropriate for being used in SDN ring
Under border.The method that a kind of virtual network of the present invention maps can concentrate on control plane management network-based control function, it is achieved
Multiplexing based on the VLAN ID under SDN environment.
In a kind of implementation of the embodiment of the present invention, according to the first virtual net of at least one in virtual network requests
Network is asked, and maps all dummy nodes of at least one the first virtual network to virtual with the first virtual network in physical network
On the physical node that node is corresponding, including:
According to virtual network requests, from big to small virtual network requests is sorted according to request income, obtain and sequence time
What ordered pair was answered intends the first order result of virtual network request, according to the sort order of the first order result, determine at least one the
The first virtual network requests corresponding in one virtual network requests, wherein, request income is the virtual of each virtual network requests
The request resource of node and the request resource sum of virtual link bandwidth；
Visible, from big to small virtual network requests is sorted according to request income, distribute physics in reality to virtual network
During Internet resources, take in most virtual networks to virtual network requests and preferentially distribute physical network resource, according to right
The order of virtual network requests sequence gives corresponding virtual network distribution physical network resource successively, it is achieved physical network resource
Optimal utilization.
According to the order of the first order result, by owning in the first virtual network of request in the first virtual network requests
Dummy node, is ranked up from big to small according to the demand resource of all dummy nodes, obtains and the demand of all dummy nodes
Second order result of all dummy nodes in the first virtual network that the sort order of resource is corresponding；
Concrete, in implementation process, according to the second order result, obtain in the first virtual network of the second order result
The first dummy node, the first dummy node is mapped in physical network on the physical node corresponding with the first dummy node.
According to the sort order of the second order result, map that at least one first virtual network sorted is all virtual
Node, on physical node corresponding with the dummy node of the first virtual network in physical network.
Visible, in the virtual network corresponding to virtual network requests sort order, all dummy nodes are according to all virtual joints
The demand resource of point is ranked up from big to small, the process of dummy node distribution physical network resource in reality is to virtual network
In, preferentially distribute the physical node of physical network to the dummy node that demand resource is most, sort according to virtual network requests
All dummy node sort orders in the virtual network that order is corresponding, map the thing of physical network to successively corresponding dummy node
Reason node, it is achieved the physical node optimum allocation of physical network.
In a kind of implementation of the embodiment of the present invention, at the sort order according to the second order result, map at least
All dummy nodes that one the first virtual network has sorted, to dummy node pair with the first virtual network in physical network
Before on the physical node answered, the method that virtual network maps also includes:
According to the sort order of the second order result, search in physical network and there is physics node cpu resource more than with the
The physical node of the demand resource of one first dummy node corresponding to sort order of two order results, and
According to preset formula, in the physical node of the demand resource that physical node cpu resource is more than the first dummy node,
The physical node that CPU surplus resources is maximum, is defined as the physical node corresponding with the first dummy node.
Visible, in implementation process, physical network is searched corresponding with the sort order of the second order result
During the physical node of the demand resource of the first dummy node, all dummy nodes are used in physical network and maps principle nearby
Time, calculate the residue of physical node in the physical network that dummy node to be mapped is corresponding by preset formula and provide
Source, it is achieved the optimum allocation of physical node.
In a kind of implementation of the embodiment of the present invention, preset formula is:
WAR (n)=CorrmCPU(n)∑l∈L(n)(BW(l)+VLAN(l))
Wherein, WAR is the CPU surplus resources of physical node in physical network, and Corr is to weigh physical node compactness
Parameter, n is arbitrary physical node in physical network, and m is to be reflected by the dummy node of same virtual network requests in physical network
The physical node number penetrated, L (n) is all physical links being connected with physical node in physical network, and l is physical node phase
The physical link connected, BW is the bandwidth that the physical link being connected with physical node takies, and VLAN is and physics
The VLAN ID number of the physical link that node is connected.
Visible, all dummy nodes are used in physical network nearby map principle time, dummy node can be made to map
More concentrate in physical network, improve the resource utilization of physical network.
In a kind of implementation of the embodiment of the present invention, at the sort order according to the first order result, by the first void
Intend all dummy nodes in the first virtual network of request in network request, according to the demand resource of all dummy nodes from greatly
Being ranked up to little, obtain in the first virtual network that the sort order of demand resource with all dummy nodes is corresponding is all
After second order result of dummy node, the method that virtual network maps also includes:
The physics node cpu resource physical node more than the demand resource of the first dummy node is there is not in physical network
Time, and exceed preset remap thresholding time, refusal map the first virtual network sorted all dummy nodes, to physics
On physical node corresponding with the dummy node of the first virtual network in network；
In actual implementation process, limit remap thresholding according to being embodied as requiring setting the number of times that remaps.
Not less than preset remap thresholding time, wait that all dummy nodes that the first virtual network has sorted are corresponding
First virtual network requests, next time window to current time window.
Visible, in dummy node mapping process, use time window model, currently treating in current time window has been reflected
When the dummy node penetrated does not finds corresponding physical node in physical network, time window model is handled it and is worked as exceeding
The virtual network requests remapping thresholding that front time window sets makes the selection that refusal maps, not less than when remapping thresholding
Waiting delivers in next time window by virtual network requests to be mapped, and time window model belongs to prior art, the most superfluous
State.
In a kind of implementation of the embodiment of the present invention, according to dummy node at least one first virtual network requests
The virtual network requests mapped, all virtual chain that the first virtual network that maps virtual node has mapped is corresponding
Road, on physical link corresponding to the first virtual network mapped with dummy node in physical network, including:
Obtain the virtual network requests that at least one first virtual network requests, dummy node has mapped, according to request
The virtual network requests sequence that dummy node has been mapped by income from big to small, obtains corresponding with sort order, virtual joint
3rd order result of the virtual network requests that point has mapped, wherein, request income is the virtual of each virtual network requests
The request resource of node and the request resource sum of link bandwidth；
According to the sort order of the 3rd order result, the first virtual network that maps virtual node has mapped is corresponding
All virtual links, corresponding to all virtual links of the first virtual network mapped with dummy node in physical network
Physical link on.
Visible, that dummy node at least one first virtual network requests has been mapped virtual network requests, according to
The request virtual network requests that mapped dummy node from big to small of income sorts, dummy node mapped first
All virtual links corresponding to virtual network, according to the maximum virtual link of the order preferential mapping request income of sequence, improve thing
The resource utilization of reason network.
In a kind of implementation of the embodiment of the present invention, at the sort order according to the 3rd order result, maps virtual
All virtual links corresponding to the first virtual network that node has mapped, map with dummy node in physical network
Before on the physical link that all virtual links of the first virtual network of becoming are corresponding, the method that virtual network maps also includes:
By k shortest path first, search the shortest physical link of k bar between physical node in described physical network；
According to the shortest physical link of k bar, k article the shortest physical link will exist the bandwidth of physical link more than or equal to the
The bandwidth of one first virtual link corresponding to sort order of three order results, and the physical link of unappropriated VLAN ID,
Being defined as the physical link corresponding with the first virtual link, wherein, k is the natural number more than 1.
K shortest path first belongs to prior art, and here is omitted.
In a kind of implementation of the present invention, obtain dummy node at least one first virtual network requests and mapped
The virtual network requests become, the virtual network requests sequence from big to small dummy node mapped according to request income,
To the virtual network requests corresponding with sort order, dummy node has mapped the 3rd order result after, virtual net
The method that network maps also includes:
When there is not the physical link corresponding with the first virtual link in physical network, and exceeding default replay shooting
In limited time, all virtual links corresponding to refusal maps virtual node has mapped the first virtual network, in physical network
On the physical link that all virtual links of the first virtual network mapped with dummy node are corresponding；
Not less than preset remap thresholding time, wait that the first virtual network of having mapped of dummy node is all virtual
The first virtual network requests that link is corresponding, in the next time window of current time window.
Visible, in virtual link mapping process, utilize time window model, the most to be mapped in current time window
When virtual link does not find corresponding physical link in physical network, time window model is handled it to when exceeding current
Between the virtual network requests remapping thresholding that arranges of window make the selection that refusal maps, waiting not less than when remapping thresholding
Being delivered to by virtual network requests to be mapped in next time window, time window model belongs to prior art, and here is omitted.
As it is shown on figure 3, the structured flowchart of the device of a kind of virtual network mapping that Fig. 3 is the embodiment of the present invention, including:
Virtual network requests acquisition module 301, in being used for obtaining current time window, multiple first virtual networks are to be mapped extremely
The virtual network requests that physical network is corresponding, wherein, virtual network requests includes: the first virtual net that virtual network requests is corresponding
Virtual link between at least one dummy node and the dummy node of network；
Dummy node mapping block 302, is used for according to the first virtual network requests of at least one in virtual network requests,
Map all dummy nodes of at least one the first virtual network to dummy node pair with the first virtual network in physical network
On the physical node answered, wherein, at least one first virtual network requests and at least one first virtual network one_to_one corresponding；
Virtual link mapping block 303, for having mapped according to dummy node at least one first virtual network requests
The virtual network requests become, all virtual links corresponding to the first virtual network that maps virtual node has mapped, to thing
Manage on the physical link that the first virtual network mapped with dummy node in network is corresponding；
VLAN ID distributes module 304, for mapped at least one the first virtual network each virtual link it
After, obtain physical link corresponding to the first virtual network mapped in physical network, unappropriated void with dummy node
Intend network identifier VLAN ID, VLAN ID is distributed to each virtual chain of at least one the first virtual network mapped
Road.
Visible, that the virtual network of the present invention maps device, is not limited by existing vlan technology VLAN ID number, can
The control function of virtual network is concentrated on control plane management, it is achieved that multiplexing based on the VLAN ID under SDN environment.
It should be noted that the device of the embodiment of the present invention is the device of the method applying above-mentioned virtual network to map, then
All embodiments of the method that above-mentioned virtual network maps all are applicable to this device, and all can reach same or analogous useful effect
Really.
As shown in Figure 4, Fig. 4 is the dummy node mapping block of device that a kind of virtual network of the embodiment of the present invention maps
Figure, including:
Virtual network requests sorting sub-module 401, for according to virtual network requests, the most right according to request income
Virtual network requests sorts, and obtains the first order result of the virtual network requests corresponding with sort order, according to the first order
The sort order of result, determines the first virtual network requests at least one first virtual network requests, wherein, request income
The request resource of dummy node and the request resource sum of virtual link bandwidth for each virtual network requests；
Dummy node sorting sub-module 402, for the order according to the first order result, by the first virtual network requests
All dummy nodes in first virtual network of request, arrange from big to small according to the demand resource of all dummy nodes
Sequence, obtains all dummy nodes in the first virtual network that the sort order of demand resource with all dummy nodes is corresponding
Second order result；
Dummy node mapping submodule 403, for according to second order result sort order, map at least one first
All dummy nodes that virtual network has sorted, to physics corresponding with the dummy node of the first virtual network in physical network
On node.
As it is shown in figure 5, the structured flowchart of the device of a kind of dummy node mapping that Fig. 5 is the embodiment of the present invention, including:
Physical node searches module 501, for the sort order according to the second order result, searches in physical network and exists
The demand resource of first dummy node that physical node cpu resource is corresponding more than with the sort order of the second order result
Physical node, and
Physical node determines module 502, for according to preset formula, by physical node cpu resource more than the first virtual joint
In the physical node of the demand resource of point, the maximum physical node of CPU surplus resources, be defined as and the first dummy node pair
The physical node answered.
In a kind of implementation of the embodiment of the present invention, physical node determines module 502, also includes that preset formula is:
WAR (n)=CorrmCPU(n)∑l∈L(n)(BW(l)+VLAN(l))
Wherein, WAR is the CPU surplus resources of physical node in physical network, and Corr is to weigh physical node compactness
Parameter, n is arbitrary physical node in physical network, and m is to be reflected by the dummy node of same virtual network requests in physical network
The physical node number penetrated, L (n) is all physical links being connected with physical node in physical network, and l is physical node phase
The physical link connected, BW is the bandwidth that the physical link being connected with physical node takies, and VLAN is and physics
The VLAN ID number of the physical link that node is connected.
In a kind of implementation of the embodiment of the present invention, the device that a kind of dummy node maps also includes:
Refusal maps virtual node module, empty more than first for there is not physics node cpu resource in physical network
When intending the physical node of demand resource of node, and exceed preset remap thresholding time, refusal maps the first virtual network row
All dummy nodes that sequence completes, on physical node corresponding with the dummy node of the first virtual network in physical network；
Current time window virtual network requests sending module, for not less than preset remap thresholding time, wait first
The first virtual network requests that all dummy nodes that virtual network has sorted are corresponding, next time to current time window
Window.
As shown in Figure 6, Fig. 6 is the virtual link mapping block of device that a kind of virtual network of the embodiment of the present invention maps
Figure, including:
The virtual network requests sorting sub-module 601 that dummy node has mapped, is used for obtaining at least one first virtual
The virtual network requests that in network request, dummy node has mapped, has mapped dummy node from big to small according to request income
The virtual network requests sequence become, obtains the of the virtual network requests corresponding with sort order, dummy node has mapped
Three order results, wherein, request income is the request resource of the dummy node of each virtual network requests and asking of link bandwidth
Seek resource sum；
Virtual link mapping submodule 602, for the sort order according to the 3rd order result, maps virtual node reflects
All virtual links corresponding to the first virtual network of shooting away, to first mapped with dummy node in physical network
On the physical link that all virtual links of virtual network are corresponding.
As it is shown in fig. 7, the structured flowchart of the device of a kind of virtual link mapping that Fig. 7 is the embodiment of the present invention, including:
The shortest physical link of k bar searches module 701, for by k shortest path first, searches physics joint in physical network
The shortest physical link of k bar between point；
Physical link determines module 702, for according to the shortest physical link of k bar, by existence in the shortest for k bar physical link
The bandwidth of first virtual link that the bandwidth of reason link is corresponding more than or equal to the sort order of the 3rd order result, and not
The physical link of the VLAN ID taken, is defined as the physical link corresponding with the first virtual link, and wherein, k is oneself more than 1
So number.
In a kind of implementation of the embodiment of the present invention, the device that a kind of virtual link of the embodiment of the present invention maps is also
Including:
, for there is not the physics chain corresponding with the first virtual link in physical network in refusal maps virtual link module
Lu Shi, and exceed preset remap thresholding time, refusal the first virtual network of having mapped of maps virtual node is corresponding
All virtual links, corresponding to all virtual links of the first virtual network mapped with dummy node in physical network
Physical link on；
Current time window virtual network requests sending module, for not less than preset remap thresholding time, wait virtual
The first virtual network requests that the first all virtual links of virtual network that node has mapped are corresponding, to current time window
In next time window.
As shown in Figure 8, Fig. 8 be the embodiment of the present invention a kind of virtual network map result figure.Figure illustrates use
Method the first virtual network that dummy node a, b, c, g are formed that virtual network of the present invention maps and dummy node c, d, e, f,
The second virtual network that g is formed is mapped to the result of physical network.In fig. 8, physical network has 5 physical node A, B, C,
D and E.In the first virtual network, virtual link a-b is mapped on physical link A-D, and distributes on physical link A-D
VLAN ID 2 gives virtual link a-b, and other re-map on the virtual link available physical link A-D on physical link A-D
VLAN ID 0,1, any one in 3-4095 be identified；Virtual link a-c is mapped on physical link A-B-E, and distributes
VLAN ID 5 on physical link A-B and the VLAN ID on physical link B-E 6 gives virtual link a-c, and other re-map thing
VLAN ID 0-4,6-4095 on virtual link available physical link A-B on reason link A-B are identified any one.?
In two virtual networks, virtual link d-e is mapped on physical link D-E, and distribute VLAN ID 11 on physical link D-E to
Virtual link d-e, other re-map the VLAN ID 0-10 on the virtual link available physical link D-E on physical link D-E,
12-4095 is identified any one；Virtual link e-f is mapped on physical link E-C, and distributes on physical link E-C
VLAN ID 13 gives virtual link e-f, and other re-map on the virtual link available physical link E-C on physical link E-C
VLAN ID 0-12,14-4095 are identified any one；Virtual link e-g is mapped on physical link B-E, and distributes physics
VLAN ID 14 on link B-E gives virtual link e-g.For the first virtual network and the second virtual network, all occupy thing
Reason link B-E, VLAN the ID 6 and VLAN ID14 on physical link B-E take the most, and other virtual links afterwards reflect
When being mapped on physical link B-E, any one in VLAN ID0-5,7-13, the 14-4095 on available physical link B-E is carried out
Mark.
Visible, the embodiment of the present invention achieves VLAN ID that the different virtual links of same virtual network take can not
With, the VLAN ID that the virtual link of other different virtual networks takies can be identical, the method that virtual network of the present invention maps
At most can only not distributed to 4096 virtual networks limited by VLAN ID, can realize distributing to more virtual network and use
Purpose.
It should be noted that in this article, the relational terms of such as first and second or the like is used merely to a reality
Body or operation separate with another entity or operating space, and deposit between not necessarily requiring or imply these entities or operating
Relation or order in any this reality.And, term " includes ", " comprising " or its any other variant are intended to
Comprising of nonexcludability, so that include that the process of a series of key element, method, article or equipment not only include that those are wanted
Element, but also include other key elements being not expressly set out, or also include for this process, method, article or equipment
Intrinsic key element.In the case of there is no more restriction, statement " including ... " key element limited, it is not excluded that
Including process, method, article or the equipment of key element there is also other identical element.
Each embodiment in this specification all uses relevant mode to describe, identical similar portion between each embodiment
Dividing and see mutually, what each embodiment stressed is the difference with other embodiments.Real especially for system
For executing example, owing to it is substantially similar to embodiment of the method, so describe is fairly simple, relevant part sees embodiment of the method
Part illustrate.
These are only presently preferred embodiments of the present invention, be not intended to limit protection scope of the present invention.All at this
Any modification, equivalent substitution and improvement etc. made within bright spirit and principle, are all contained in protection scope of the present invention.
Claims (10)
1. the method that a virtual network maps, it is characterised in that including:
Multiple first virtual networks virtual network requests corresponding to physical network to be mapped in acquisition current time window, wherein,
Described virtual network requests includes: at least one dummy node of the first virtual network that described virtual network requests is corresponding and void
Intend the virtual link between node；
According at least one first virtual network requests in described virtual network requests, map at least one first virtual network
All dummy nodes on physical node corresponding with the dummy node of described first virtual network in described physical network, its
In, at least one first virtual network requests described and at least one first virtual network one_to_one corresponding described；
The virtual network requests mapped according to dummy node at least one first virtual network requests described, maps virtual
All virtual links corresponding to the first virtual network that node has mapped, in described physical network with described dummy node
On the physical link that the first virtual network of having mapped is corresponding；
After each virtual link having mapped at least one the first virtual network, obtain in described physical network with described
Physical link corresponding to the first virtual network that dummy node has mapped, unappropriated virtual network identifier VLAN ID,
Described VLAN ID is distributed to each virtual link of at least one the first virtual network mapped.
2. the method that virtual network as claimed in claim 1 maps, it is characterised in that described according to described virtual network requests
In at least one first virtual network requests, map all dummy nodes of at least one the first virtual network to described physics
On physical node corresponding with the dummy node of described first virtual network in network, including:
According to described virtual network requests, from big to small described virtual network requests is sorted according to request income, obtain and row
What order ordered pair was answered intends the first order result of virtual network request, according to the sort order of described first order result, determines institute
Stating the first virtual network requests corresponding at least one first virtual network requests, wherein, described request income is each void
Intend request resource and the request resource sum of virtual link bandwidth of the dummy node of network request；
According to the order of described first order result, by the first virtual network of request in described first virtual network requests
All dummy nodes, are ranked up from big to small according to the demand resource of all dummy nodes, obtain and all dummy nodes
Second order result of all dummy nodes in the first virtual network that the sort order of demand resource is corresponding；
According to the sort order of described second order result, map that at least one first virtual network sorted is all virtual
Node, on physical node corresponding with the dummy node of described first virtual network in described physical network.
3. the method that virtual network as claimed in claim 2 maps, it is characterised in that described according to described second order knot
The sort order of fruit, maps all dummy nodes that at least one first virtual network sorted, in described physical network
Before on the physical node corresponding with the dummy node of described first virtual network, the method that described virtual network maps also is wrapped
Include:
According to the sort order of described second order result, search and described physical network exists physics node cpu resource be more than
The physical node of the demand resource of first dummy node corresponding with the sort order of described second order result, and
According to preset formula, described physical node cpu resource is saved more than the physics of the demand resource of described first dummy node
In point, the maximum physical node of CPU surplus resources, be defined as the physical node corresponding with described first dummy node.
4. the method that virtual network as claimed in claim 3 maps, it is characterised in that described preset formula is:
WAR (n)=CorrmCPU(n)∑l∈L(n)(BW(l)+VLAN(l))
Wherein, described WAR is the CPU surplus resources of physical node in described physical network, and described Corr is for weighing physical node
The parameter of compactness, described n is arbitrary physical node in described physical network, and described m is the most same in described physical network
The physical node number that the dummy node of virtual network requests maps, described L (n) is to save with described physics in described physical network
All physical links that point is connected, described l is the physical link that described physical node is connected, and described BW is with described
The bandwidth that the physical link that physical node is connected takies, described VLAN is the thing being connected with described physical node
The VLAN ID number of reason link.
5. the method that virtual network as claimed in claim 2 maps, at the described order according to described first order result, will
All dummy nodes in first virtual network of request in described first virtual network requests, according to the need of all dummy nodes
Ask resource to be ranked up from big to small, obtain the first virtual net that the sort order of demand resource with all dummy nodes is corresponding
After second order result of all dummy nodes in network, the method that described virtual network maps also includes:
The physics node cpu resource physics more than the demand resource of described first dummy node is there is not in described physical network
During node, and exceed preset remap thresholding time, refusal maps all virtual joint that sorted of described first virtual network
Point, on physical node corresponding with the dummy node of described first virtual network in described physical network；
Not less than described preset remap thresholding time, wait all dummy nodes pair that described first virtual network has sorted
The first virtual network requests of answering, next time window to described current time window.
6. the method that virtual network as claimed in claim 1 maps, it is characterised in that described in described basis at least one first
The virtual network requests that in virtual network requests, dummy node has mapped, it is first virtual that maps virtual node has mapped
All virtual links that network is corresponding, to the first virtual network mapped with described dummy node in described physical network
On corresponding physical link, including:
Obtain the virtual network requests that at least one first virtual network requests described, dummy node has mapped, according to request
The virtual network requests sequence that described dummy node has been mapped by income from big to small, obtains corresponding with sort order, void
Intending the 3rd order result of the virtual network requests that node has mapped, wherein, described request income please for each virtual network
The request resource of the dummy node asked and the request resource sum of link bandwidth；
According to the sort order of described 3rd order result, the first virtual network that maps virtual node has mapped is corresponding
All virtual links, all virtual to the first virtual network mapped with described dummy node in described physical network
On the physical link that link is corresponding.
7. the method that virtual network as claimed in claim 6 maps, it is characterised in that described according to described 3rd order knot
The sort order of fruit, all virtual links corresponding to the first virtual network that maps virtual node has mapped, to described thing
On physical link corresponding with all virtual links of the first virtual network that described dummy node has mapped in reason network
Before, the method that described virtual network maps also includes:
By k shortest path first, search the shortest physical link of k bar between physical node in described physical network；
According to the described the shortest physical link of k bar, the band that there is physical link in the described the shortest physical link of k bar is wider than or etc.
In the bandwidth of first virtual link corresponding to sort order of described 3rd order result, and unappropriated VLAN ID
Physical link, is defined as the physical link corresponding with described first virtual link, and wherein, described k is the natural number more than 1.
8. the method that virtual network as claimed in claim 6 maps, it is characterised in that described in described acquisition at least one the
The virtual network requests that in one virtual network requests, dummy node has mapped, according to request income from big to small to described virtual
The virtual network requests sequence that node has mapped, obtains the virtual net corresponding with sort order, dummy node has mapped
After 3rd order result of network request, the method that described virtual network maps also includes:
When there is not the physical link corresponding with described first virtual link in described physical network, and exceeding default replay
Shooting in limited time, all virtual links corresponding to the first virtual network that refusal maps virtual node has mapped, to described thing
On physical link corresponding with all virtual links of the first virtual network that described dummy node has mapped in reason network；
Not less than described preset remap thresholding time, wait that the first virtual network that described dummy node mapped owns
The first virtual network requests that virtual link is corresponding, in the next time window of described current time window.
9. the device that a virtual network maps, it is characterised in that including:
Virtual network requests acquisition module, in being used for obtaining current time window, multiple first virtual networks are to be mapped to physical network
Corresponding virtual network requests, wherein, described virtual network requests includes: the first virtual net that described virtual network requests is corresponding
Virtual link between at least one dummy node and the dummy node of network；
Dummy node mapping block, for according at least one first virtual network requests in described virtual network requests, reflects
Penetrate all dummy nodes of at least one the first virtual network to virtual with described first virtual network in described physical network
On the physical node that node is corresponding, wherein, at least one first virtual network requests described is with described at least one is first virtual
Network one_to_one corresponding；
Virtual link mapping block, for mapped according to dummy node at least one first virtual network requests described
Virtual network requests, all virtual links corresponding to the first virtual network that maps virtual node has mapped, to described thing
On physical link corresponding with the first virtual network that described dummy node has mapped in reason network；
VLAN ID distributes module, for after each virtual link having mapped at least one the first virtual network, obtains
Physical link corresponding with the first virtual network that described dummy node has mapped in described physical network, unappropriated void
Intend network identifier VLAN ID, described VLAN ID is distributed to each void of at least one the first virtual network mapped
Intend link.
10. the device that virtual network as claimed in claim 9 maps, it is characterised in that described dummy node mapping block, bag
Include:
Virtual network requests sorting sub-module, for according to described virtual network requests, according to request income from big to small to institute
State virtual network requests sequence, obtain the first order result of the virtual network requests corresponding with sort order, according to described the
The sort order of one order result, determines the first virtual network requests at least one first virtual network requests described, its
In, described request income is request resource and the request resource of virtual link bandwidth of the dummy node of each virtual network requests
Sum；
Dummy node sorting sub-module, for the order according to described first order result, by described first virtual network requests
All dummy nodes in first virtual network of middle request, arrange from big to small according to the demand resource of all dummy nodes
Sequence, obtains all dummy nodes in the first virtual network that the sort order of demand resource with all dummy nodes is corresponding
Second order result；
Dummy node mapping submodule, for the sort order according to described second order result, maps at least one first void
Intend network sorted all dummy nodes, to corresponding with the dummy node of described first virtual network in described physical network
Physical node on.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610716084.8A CN106100964B (en) | 2016-08-24 | 2016-08-24 | A kind of method and apparatus of virtual network mapping |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610716084.8A CN106100964B (en) | 2016-08-24 | 2016-08-24 | A kind of method and apparatus of virtual network mapping |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106100964A true CN106100964A (en) | 2016-11-09 |
| CN106100964B CN106100964B (en) | 2019-06-07 |
Family
ID=57225825
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610716084.8A Active CN106100964B (en) | 2016-08-24 | 2016-08-24 | A kind of method and apparatus of virtual network mapping |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106100964B (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106507490A (en) * | 2016-11-15 | 2017-03-15 | 重庆邮电大学 | A kind of time-frequency resource maps method based on wireless dummy network life cycle |
| CN106789289A (en) * | 2016-12-28 | 2017-05-31 | 中国移动通信集团江苏有限公司 | For the method and apparatus of virtual network mapping |
| CN107749807A (en) * | 2017-10-31 | 2018-03-02 | 江苏省未来网络创新研究院 | A kind of network function verification method and checking system towards NFV |
| CN107979545A (en) * | 2017-10-17 | 2018-05-01 | 南京邮电大学 | A kind of mapping method of virtual network based on nodal community |
| CN108400922A (en) * | 2017-02-07 | 2018-08-14 | 财团法人工业技术研究院 | virtual local area network configuration system and method and computer program product thereof |
| CN108667657A (en) * | 2018-04-28 | 2018-10-16 | 西安交通大学 | A kind of mapping method of virtual network based on local feature information towards SDN |
| WO2019072162A1 (en) * | 2017-10-12 | 2019-04-18 | 中兴通讯股份有限公司 | Virtual network mapping method, device and storage medium |
| CN110933728A (en) * | 2019-12-26 | 2020-03-27 | 北京智芯微电子科技有限公司 | Mapping method, device and storage medium of virtualized wireless sensor network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102664784A (en) * | 2012-04-19 | 2012-09-12 | 北京邮电大学 | Virtual network mapping method capable of realizing adaptive equalization of weight of node link pressure |
| CN103916266A (en) * | 2014-03-11 | 2014-07-09 | 湖州师范学院 | Efficient energy-saving virtual network mapping algorithm for node and link active dormancy |
| CN104901861A (en) * | 2015-06-04 | 2015-09-09 | 浙江工商大学 | Network topology pre-optimization-based virtual network mapping method capable of improving availability |
-
2016
- 2016-08-24 CN CN201610716084.8A patent/CN106100964B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102664784A (en) * | 2012-04-19 | 2012-09-12 | 北京邮电大学 | Virtual network mapping method capable of realizing adaptive equalization of weight of node link pressure |
| CN103916266A (en) * | 2014-03-11 | 2014-07-09 | 湖州师范学院 | Efficient energy-saving virtual network mapping algorithm for node and link active dormancy |
| CN104901861A (en) * | 2015-06-04 | 2015-09-09 | 浙江工商大学 | Network topology pre-optimization-based virtual network mapping method capable of improving availability |
Non-Patent Citations (1)
| Title |
|---|
| HUANG TAO ET AL: "A topology-cognitive algorithm framework for virtual network embedding problem", 《CHINA COMMUNICATIONS》 * |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106507490A (en) * | 2016-11-15 | 2017-03-15 | 重庆邮电大学 | A kind of time-frequency resource maps method based on wireless dummy network life cycle |
| CN106507490B (en) * | 2016-11-15 | 2019-08-16 | 重庆邮电大学 | A kind of time-frequency resource maps method based on wireless dummy network life cycle |
| CN106789289A (en) * | 2016-12-28 | 2017-05-31 | 中国移动通信集团江苏有限公司 | For the method and apparatus of virtual network mapping |
| CN106789289B (en) * | 2016-12-28 | 2020-01-21 | 中国移动通信集团江苏有限公司 | Method and apparatus for virtual network mapping |
| CN108400922A (en) * | 2017-02-07 | 2018-08-14 | 财团法人工业技术研究院 | virtual local area network configuration system and method and computer program product thereof |
| CN108400922B (en) * | 2017-02-07 | 2021-01-12 | 财团法人工业技术研究院 | Virtual local area network configuration system and method and computer readable storage medium thereof |
| WO2019072162A1 (en) * | 2017-10-12 | 2019-04-18 | 中兴通讯股份有限公司 | Virtual network mapping method, device and storage medium |
| CN109660376A (en) * | 2017-10-12 | 2019-04-19 | 中兴通讯股份有限公司 | A kind of mapping method of virtual network, equipment and storage medium |
| CN109660376B (en) * | 2017-10-12 | 2022-09-02 | 中兴通讯股份有限公司 | Virtual network mapping method, equipment and storage medium |
| CN107979545A (en) * | 2017-10-17 | 2018-05-01 | 南京邮电大学 | A kind of mapping method of virtual network based on nodal community |
| CN107979545B (en) * | 2017-10-17 | 2021-12-03 | 南京邮电大学 | Virtual network mapping method based on node attributes |
| CN107749807A (en) * | 2017-10-31 | 2018-03-02 | 江苏省未来网络创新研究院 | A kind of network function verification method and checking system towards NFV |
| CN107749807B (en) * | 2017-10-31 | 2020-07-28 | 江苏省未来网络创新研究院 | Network function verification method and verification system for NFV |
| CN108667657A (en) * | 2018-04-28 | 2018-10-16 | 西安交通大学 | A kind of mapping method of virtual network based on local feature information towards SDN |
| CN110933728A (en) * | 2019-12-26 | 2020-03-27 | 北京智芯微电子科技有限公司 | Mapping method, device and storage medium of virtualized wireless sensor network |
| CN110933728B (en) * | 2019-12-26 | 2021-09-24 | 北京智芯微电子科技有限公司 | Mapping method, device and storage medium of virtualized wireless sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106100964B (en) | 2019-06-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106100964A (en) | The method and apparatus that a kind of virtual network maps | |
| CN104468381B (en) | Implementation method for multi-field rule matching | |
| CN108566659B (en) | 5G network slice online mapping method based on reliability | |
| CN104246701B (en) | For the system and method based on source routing routing traffic between different infinite bandwidth subnets | |
| CN103023827B (en) | Data forwarding method for virtualized data centre and realization equipment of data forwarding method | |
| CN103929368B (en) | Load balance method and device for multiple service units | |
| CN103763135B (en) | PE equipment traffic scheduling method and device | |
| CN108809847A (en) | Realize the method, apparatus and network system of load balancing | |
| EP2912812A1 (en) | Traffic interconnection between virtual devices | |
| US9049149B2 (en) | Minimal data loss load balancing on link aggregation groups | |
| CN107547349A (en) | A kind of method and device of virtual machine (vm) migration | |
| CN104301417B (en) | A kind of load-balancing method and device | |
| CN107547391A (en) | A kind of message transmitting method and device | |
| WO2016175768A1 (en) | Map tables for hardware tables | |
| CN104243208A (en) | Port expansion and message processing method, device and network device | |
| CN104486402A (en) | Combined equalizing method based on large-scale website | |
| CN103346979A (en) | Flow distribution method and equipment in SPBM network | |
| CN105099953A (en) | Cloud data center virtual network isolation method and device | |
| CN108173782A (en) | The method, apparatus and storage medium of transmitting data stream in virtual private cloud | |
| CN105681198A (en) | Business chain processing method, device and system | |
| CN102098740A (en) | Link aggregation routing method and device | |
| CN108111410A (en) | Deadlock freedom routing in lossless multidimensional Cartesian Topology Structure with minimum number virtual buffering region | |
| CN105791402A (en) | Network virtualization realization method of cloud computing platform and corresponding plug-in and agent | |
| CN106533889A (en) | Method of BPE cross-port extension device to realize link aggregation in chip | |
| CN103414651B (en) | A kind of adjust method and the network equipment that equal-cost route equilibrium is shared |
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 |