CN103746894B - Batch virtual network mapping method based on geographic position constraint - Google Patents
Batch virtual network mapping method based on geographic position constraint Download PDFInfo
- Publication number
- CN103746894B CN103746894B CN201410026410.3A CN201410026410A CN103746894B CN 103746894 B CN103746894 B CN 103746894B CN 201410026410 A CN201410026410 A CN 201410026410A CN 103746894 B CN103746894 B CN 103746894B
- Authority
- CN
- China
- Prior art keywords
- node
- virtual network
- mapping
- virtual
- physical
- 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.)
- Expired - Fee Related
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a batch virtual network mapping method based on geographic position constraint. The method comprises the steps of sequentially performing virtual network mapping on simultaneously arrived more than one virtual network request, when a virtual node is mapped, determining a mappable physical node set of the virtual node according to the geographic position coordinates of the virtual node, and preferably selecting a physical node mapped by a virtual network before the mapping from the mappable physical node set for mapping; after the virtual network request arrived at the current time is mapped, performing inversion according to the mapped physical node topology to generate a new virtual network and further generate an enhanced virtual network of the new virtual network, and mapping backup nodes and backup links. The geographic position constraint conditions are introduced when the virtual node is mapped, so that actual network distribution is better met, and in addition, the new virtual network is generated by inversion for backup, so that the sharing degree of backup resources is improved, and accordingly, the network resources are saved.
Description
Technical field
The invention belongs to Internet communication technology field, more specifically, be related to a kind of based on geographic location constraint
Batch mapping method of virtual network.
Background technology
With the appearance of increasing the Internet new application, existing Internet architecture is difficult to meet these differences should
With the requirement to Internet architecture, internet development is made to present Ossified phenomenon.Network virtualization technology is a kind of solution interconnection
The effective means of the rigid problem of net.Network virtualization technology carries out abstract to the public underlying basis network facilities and provides unification
Programmable interface, multiple virtual networks (virtual network, vn) being isolated from each other and having different topology are mapped to
On public infrastructure network (substrate network, sn), provide the user differentiated service.
Fig. 1 is virtual network mapping schematic diagram.As shown in figure 1, virtual network mapping includes mapping and the void of dummy node
Intend the mapping of link.Because different virtual networks may map on same physical network, in order to increase receptance,
The selection of mapping method is very important.Even if knowing all of virtual network requests in advance, but due to dummy node and void
The requirement of plan link pair resource, geographical position are to the constraint of dummy node and the complexity of mapping so that virtual network maps
Become extremely difficult.The suggestion of most methods is first to remove maps virtual node in advance using greedy algorithm, then concentrates and carries out
Virtual link maps.But even if the mapping of all of dummy node completes, the mapping of virtual link is also considerably complicated.And in advance
Carry out dummy node mapping and do not consider that itself and the relation of virtual link mapping often limit solution, cannot get one relatively
Good mapping result.So, the virtual network mapping algorithm using at present, when maps virtual node, also map simultaneously
Virtual link.
When carrying out virtual network mapping in addition it is also necessary to concern maps cost minimization and node survivability problem.It is mapped to
This minimum refers to the cost minimization produced by virtual network mapping scheme finally giving.Node survivability problem refers to virtual
After the completion of network mapping, if physical node in physical network lost efficacy, how by the dummy node mapping thereon and its link
Migrate to other effective physical nodes and physical link.
A lot of mapping method of virtual networks are all to consider node survivability problem when mapping at present.Generally a certain
It is considered to the feelings that at a time at most only one of which dummy nodes lost efficacy when moment only one of which virtual network needs to map
Under condition, it is that former virtual network increases k backup node, generally backup node and former dummy node correspond, to protect
Card in the case of having dummy node to lose efficacy (because the mapping of most only one of which node was lost efficacy) can recover Successful migration, abbreviation k-
Redundancy mapping scheme.The main thought of the program is as follows: strengthens original virtual network first, is the increase of original virtual network
K backup node and corresponding backup link.Fig. 2 is enhanced virtual network diagram.As shown in Fig. 2 v0 to v3 represents empty
Intend node, the numerical value being indicated thereon is node resource demand, the line between dummy node is virtual link, is indicated thereon
Numerical value be link resource needs.In this enhanced virtual network, each dummy node is provided with backup node, i.e. k=4,
Its corresponding node resource demand is consistent with ancestor node with link resource needs.During mapping, map original first
Virtual network, then re-maps backup node and backup link it is therefore apparent that backup node and ancestor node can not map to together
One physical node.Due to only considering the situation that most only one of which dummy node of a certain moment lost efficacy, therefore different backup section
Point can map to same physical node, and backup link can also be with active link resource-sharing.
This scheme mainly has two shortcomings: first, in this scheme when carrying out virtual network mapping, reach simultaneously
Virtual network only one of which, this only considered one of practical situation, also has another situation to be exactly: even if carry out quiet
When the mapping of state virtual network, at a time it has been likely to multiple virtual networks and has reached simultaneously, then in this case,
The resource-sharing of each intra-virtual-network not only will be considered, it is also contemplated that the resource between the multiple virtual networks simultaneously reaching
Shared situation；Second, the mapping of dummy node does not account for the constraint in geographical position, as long as the capacity meeting dummy node will
Ask and corresponding virtual link capacity requirement, dummy node just may map on any physical node in physical network,
This and practical situation do not correspond.
Content of the invention
It is an object of the invention to overcoming the deficiencies in the prior art, provide a kind of batch based on geographic location constraint virtual
Network mapping method, while considering geographic location constraint, generates new virtual network raising Spare Capacity Sharing by reverse
Degree, saves Internet resources.
For achieving the above object, the batch mapping method of virtual network based on geographic location constraint for the present invention, including
Following steps:
S1: in each virtual network requests reaching, with the geographical position coordinates of dummy node as the center of circle, according to default
Mapping radius determine the mapped physical node set of each dummy node；
S2: map each virtual network successively, during maps virtual node, can map in physical node at it, prioritizing selection
Before in this mapping, the physical node of virtual network mapping is mapped；
S3: new virtual network is reversely generated according to the physical node topology of mapping, reflects in its dummy node and step s2
The physical node penetrated corresponds to, node resource demand by with the node resource demand of former dummy node that mapped on this physical node
Sum, the link resource needs of the link resource needs of the virtual link former virtual link by being carried in corresponding physical pathway
Sum；
S4: the enhanced virtual network of the new virtual network obtaining in generation step s3, and by backup node and backup chain
Road is mapped.
Further, in step s2 during maps virtual network, when multiple mapping scheme occurs, minimum from totle drilling cost
Mapping scheme.
Further, when mapping backup node in step s4, with corresponding to dummy node in the new virtual network that it backs up
Physical node geographical position coordinates be the center of circle, determine that it can map physical node set according to default mapping radius.
Further, when mapping backup node and backup link in step s4, when multiple mapping scheme occurs, from total
The mapping scheme of cost minimization.
The batch mapping method of virtual network based on geographic location constraint for the present invention, virtual to more than one reaching simultaneously
Network request carries out virtual network mapping successively, and in maps virtual node, being determined with the geographical position coordinates of dummy node should
The mapped physical node set of dummy node, and can be mapped in physical node set in this mapping of prioritizing selection it at it
The physical node of front virtual network mapping is mapped；After the virtual network requests mapping that this reaches finishes, according to
The physical node topology of mapping is reversely generated new virtual network, regenerates the enhanced virtual network of new virtual network,
And backup node and backup link are mapped.
The method have the advantages that
(1) introduce geographic location constraint condition when, dummy node being mapped, more meet real network distribution；
(2), batch processing is carried out to virtual network requests, when dummy node maps prioritizing selection this mapping in before
The physical node of virtual network mapping, makes shared physical node between each virtual network increase, reduces the newly virtual of reversely generation
Dummy node in network, thus reducing backup node number, improves Spare Capacity Sharing degree, thus saving Internet resources.
Brief description
Fig. 1 is virtual network mapping schematic diagram；
Fig. 2 is enhanced virtual network diagram；
Fig. 3 is virtual network and physical network exemplary plot；
Fig. 4 is to the figure of virtual network Mapping Examples shown in Fig. 3 using the present invention；
Fig. 5 is the new virtual network exemplary plot that mapping shown in Fig. 4 reversely generates；
Fig. 6 is the enhanced virtual network example figure of new virtual network shown in Fig. 5.
Specific embodiment
Below in conjunction with the accompanying drawings the specific embodiment of the present invention is described, so that those skilled in the art is preferably
Understand the present invention.Requiring particular attention is that, in the following description, when known function and design detailed description perhaps
Can desalinate the present invention main contents when, these descriptions will be ignored here.
Embodiment
The batch mapping method of virtual network based on geographic location constraint for the present invention, it implements step and includes:
S101: in each virtual network requests reaching, with the geographical position coordinates of dummy node as the center of circle, according to pre-
If mapping radius determine the mapped physical node set of each dummy node.
Fig. 3 is virtual network and physical network exemplary plot.As shown in figure 3, the virtual network simultaneously reaching in the present embodiment
Vn has 3, respectively vn0, vn1, vn2, and each virtual network has 3 dummy nodes；10 physics sections are had in physical network sn
Point is it is herein assumed that the mapping that has enough node resources to meet dummy node of 10 physical nodes.With in virtual network vn0
Dummy node v00 as a example, its geographical position coordinates be (x, y) it is assumed that default mapping radius be r, then as shown in figure 3,
In physical network sn, with (x, y) as the center of circle, radius is that the physical node collection in the range of r is combined into { s0, s1 }, then virtual
The mapped physical node collection of node v01 is combined into { s0, s1 }.Other dummy nodes be also adopted by same method obtain its corresponding can
Mapping physical node set.
S102: map each virtual network successively, during maps virtual node, can map in physical node set at it, excellent
Before first selecting in this mapping, the physical node of virtual network mapping is mapped.
In the present embodiment, successively virtual network mapping is carried out to vn0, vn1, vn2.Fig. 4 is to shown in Fig. 3 using the present invention
Virtual network Mapping Examples figure.As shown in figure 4, when virtual network vn0 is mapped, not yet depositing in this virtual network reaching
In the virtual network of mapping, therefore can directly be mapped according to the mapped physical node set of its each dummy node.
It is assumed that now its mapping relations is: v00 → s0, v01 → s4, v02 → s2.
Next virtual network vn1 is mapped it is assumed that now the mapped physical node collection of dummy node v10 is combined into
{ s0, s3, s4 }, the mapped physical node collection of dummy node v11 is combined into { s6, s7 }, the mapped physics section of dummy node v12
Point set is combined into { s2, s3, s5 }.The physical node of now virtual network vn0 mapping has s0, s2, s4.Before prioritizing selection
The physical node of virtual network mapping is mapped, then dummy node v10 selects physical node s0 or s4 to be mapped, empty
Intending node v12 selects physical node s3 to be mapped, and dummy node v11 can map and not include mapping in physical node set
In physical node, physical node s6 or s7 is therefore selected to be mapped.It can be seen that there are multiple mapping schemes in dummy node, naturally its
Virtual link there is also multiple mapping schemes.In actual applications, a mapping scheme can be therefrom selected to carry out as needed
Mapping.The mode commonly used at present is the mapping scheme minimum from totle drilling cost, i.e. dummy node mapping cost and corresponding virtual
The cost sum of link maps cost is minimum.Suppose in the present embodiment to finally give the dummy node mapping side of three virtual networks
Case is: v00 → s0, v01 → s4, v02 → s2；V10 → s4, v11 → s6, v12 → s2；V20 → s9, v21 → s7, v22 → s6.
Its virtual link mapping scheme be can get using general mapping method, and here omits description.
S103: new virtual network, its dummy node and step s102 are reversely generated according to the physical node topology of mapping
The physical node of middle mapping corresponds to, node resource demand by with the node resource of former dummy node that mapped on this physical node
Demand sum, the link circuit resource of the link resource needs of the virtual link former virtual link by being carried in corresponding physical pathway
Demand sum.
According to the dummy node mapping scheme in step s102, the physical node of mapping include s0, s2, s4, s6,
S7, s9, should include 6 dummy nodes in the new virtual network therefore reversely generating.Fig. 5 is that shown in Fig. 4, mapping reversely generates
New virtual network exemplary plot.Table 1 is dummy node shown in Fig. 5 and virtual section in physical node and former virtual network requests
The corresponding relation of point.
| New dummy node | v0 | v1 | v2 | v3 | v4 | v5 |
| Physical node | s0 | s4 | s2 | s6 | s9 | s7 |
| Former dummy node | v00 | v01、v10 | v02、v12 | v11、v22 | v20 | v21 |
Table 1
, its node resource demand is the node resource demand of former dummy node v01 and v10 taking new dummy node v1 as a example
Sum, the node resource demand of same new dummy node v2 is the node resource demand sum of former dummy node v02 and v12.
Due to two virtual chains in two former virtual network requests being carried on physical pathway s2-s4 between physical node s2 and s4
Road, that is, its bottom physical link of v01-v02, v10-v12(there may be difference), then in new virtual network, virtual link
The link resource needs of v1-v2 are the link resource needs sum of virtual link v01-v02 and v10-v12.
S104: the enhanced virtual network of the new virtual network obtaining in generation step s103, and by backup node and standby
Part link is mapped.
According to Fig. 5, in new virtual network, the quantity of dummy node is less than dummy node in original three virtual networks
Sum, therefore backup is carried out using new virtual network and can improve resource sharing degree, also simplify simultaneously backup mapping
Process.
Fig. 6 is the enhanced virtual network example figure of new virtual network shown in Fig. 5.As shown in fig. 6, to every in the present embodiment
Individual new dummy node all configures a backup node, and increases corresponding backup link.With general k- redundancy mapping method one
Sample, the backup node of the present invention may map to a physical node, and backup link can with active link resource-sharing,
And between backup link and backup link, there is also resource-sharing, so allowed for originally individually there is also between virtual network
Node resource is shared and link circuit resource is shared, and saves mapping cost such that it is able to maximized.
When mapping to backup node it is also possible to introduce geographic location constraint condition, that is, with its back up newly virtual
The geographical position coordinates of the physical node corresponding to dummy node in network are the center of circle, determine that it can according to default mapping radius
Mapping physical node set., its geographical position coordinates is that the geographical position of physical node s0 is sat taking backup node v0 in Fig. 6 as a example
Mark.When backup node and backup link have multiple mapping scheme, a mapping scheme can be therefrom selected to enter as needed
Row mapping, the mode commonly used at present is the mapping scheme minimum from totle drilling cost.
In actual applications, the virtual network requests quantity simultaneously reaching may be larger, and geographical position might not collect
In, the new virtual network reversely generating therefore in step s103 may be made up of multiple virtual networks, then in step s104
Carry out enhancing to each virtual network respectively to re-map.
Although to the present invention, illustrative specific embodiment is described above, in order to the technology of the art
Personnel understand the present invention, the common skill it should be apparent that the invention is not restricted to the scope of specific embodiment, to the art
For art personnel, as long as various change is in the spirit and scope of the present invention of appended claim restriction and determination, these
Change is it will be apparent that all utilize the innovation and creation of present inventive concept all in the row of protection.
Claims (4)
1. a kind of batch mapping method of virtual network based on geographic location constraint is it is characterised in that comprise the following steps:
S1: in each virtual network requests reaching, with the geographical position coordinates of dummy node as the center of circle, reflected according to default
Penetrate the mapped physical node set that radius determines each dummy node；
S2: map each virtual network successively, during maps virtual node, can map in physical node at it, prioritizing selection this
Before in mapping, the physical node of virtual network mapping is mapped；
S3: new virtual network, its dummy node and mapping in step s2 are reversely generated according to the physical node topology of mapping
Physical node corresponds to, node resource demand by with the node resource demand of former dummy node that mapped on this physical node it
With the link resource needs of, virtual link by the link resource needs of former virtual link that carried in corresponding physical pathway it
With；
S4: the enhanced virtual network of the new virtual network obtaining in generation step s3, and backup node and backup link are entered
Row mapping.
2. batch mapping method of virtual network according to claim 1 is it is characterised in that maps virtual in described step s2
During network, when multiple mapping scheme occurs, from the mapping scheme that totle drilling cost is minimum.
3. batch mapping method of virtual network according to claim 1 is it is characterised in that map backup in described step s4
During node, with the new virtual network that it backs up the geographical position coordinates of the physical node corresponding to dummy node as the center of circle, root
Determine that it can map physical node set according to default mapping radius.
4. batch mapping method of virtual network according to claim 1 is it is characterised in that map backup in described step s4
When node and backup link, when multiple mapping scheme occurs, from the mapping scheme that totle drilling cost is minimum.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410026410.3A CN103746894B (en) | 2014-01-20 | 2014-01-20 | Batch virtual network mapping method based on geographic position constraint |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410026410.3A CN103746894B (en) | 2014-01-20 | 2014-01-20 | Batch virtual network mapping method based on geographic position constraint |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103746894A CN103746894A (en) | 2014-04-23 |
| CN103746894B true CN103746894B (en) | 2017-02-01 |
Family
ID=50503885
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410026410.3A Expired - Fee Related CN103746894B (en) | 2014-01-20 | 2014-01-20 | Batch virtual network mapping method based on geographic position constraint |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103746894B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10313195B2 (en) * | 2015-09-14 | 2019-06-04 | Huawei Technologies Co., Ltd. | Dedicated protection for virtual network embedding |
| CN105262669A (en) * | 2015-12-01 | 2016-01-20 | 电子科技大学 | Virtual network mapping method |
| CN106209415A (en) * | 2016-06-21 | 2016-12-07 | 北京邮电大学 | A kind of mapping method of virtual network and system |
| CN108809699B (en) * | 2018-05-22 | 2021-04-09 | 哈尔滨工业大学 | Method for realizing large-scale virtual network node repeated mapping |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102932479A (en) * | 2012-11-16 | 2013-02-13 | 北京邮电大学 | Virtual network mapping method for realizing topology awareness based on historical data |
| CN103259744A (en) * | 2013-03-26 | 2013-08-21 | 北京航空航天大学 | Method for mapping mobile virtual network based on clustering |
| US8584146B1 (en) * | 2012-05-11 | 2013-11-12 | Hobnob, Inc. | Communications driver management |
| CN103475504A (en) * | 2013-08-23 | 2013-12-25 | 北京邮电大学 | Virtual network remapping method based on topology awareness |
-
2014
- 2014-01-20 CN CN201410026410.3A patent/CN103746894B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8584146B1 (en) * | 2012-05-11 | 2013-11-12 | Hobnob, Inc. | Communications driver management |
| CN102932479A (en) * | 2012-11-16 | 2013-02-13 | 北京邮电大学 | Virtual network mapping method for realizing topology awareness based on historical data |
| CN103259744A (en) * | 2013-03-26 | 2013-08-21 | 北京航空航天大学 | Method for mapping mobile virtual network based on clustering |
| CN103475504A (en) * | 2013-08-23 | 2013-12-25 | 北京邮电大学 | Virtual network remapping method based on topology awareness |
Non-Patent Citations (2)
| Title |
|---|
| Virtual Network Embedding For Evolving Networks;Zhiping Cai, Fang Liu, Nong Xiao, Qiang Liu, Zhiying Wang;《IEEE数据库》;20101010;正文第1-5页 * |
| Virtual Network Embedding with Coordinated Node and Link Mapping;N. M. Mosharaf Kabir Chowdhury,Muntasir Raihan Rahman,Raouf Bout;《IEEE数据库》;20090425;正文第783-791页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103746894A (en) | 2014-04-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107888425B (en) | network slice deployment method and device for mobile communication system | |
| Song et al. | Optimal locally repairable linear codes | |
| CN103746894B (en) | Batch virtual network mapping method based on geographic position constraint | |
| CN105681153B (en) | A kind of mapping method of virtual network and device | |
| CN108370255A (en) | Polar code continuously eliminates memory management and paths ordering in list-decoding device | |
| CN109104464A (en) | A kind of distributed data update method towards collaboration storage under edge calculations environment | |
| CN103888360A (en) | Method for integrating covering method to obtain service node in SDN based on greedy algorithm | |
| CN107101645A (en) | A kind of paths planning method and path planning apparatus | |
| CN104144135A (en) | Resource distribution method and survivability resource distribution method used for multicast virtual network | |
| CN103812748A (en) | Mapping method of survivable virtual network | |
| CN110519090A (en) | A kind of accelerator card distribution method, system and the associated component of FPGA cloud platform | |
| CN109861925A (en) | Data transmission method, relevant apparatus and network | |
| CN104917659A (en) | Virtual network connection property-based virtual network mapping method | |
| CN106850424A (en) | A kind of system of selection, the apparatus and system in IP layers of path | |
| CN102420797B (en) | Topology mapping method and system | |
| Miao et al. | Multicast virtual network mapping for supporting multiple description coding-based video applications | |
| CN103618690A (en) | Spray-wait routing protocol improvement method in delay tolerant network | |
| CN110011858A (en) | It is a kind of that mapping method is optimized based on load balancing and the switch reconfigured | |
| CN103595610B (en) | A kind of the anti-of non-deterministic source demand multicast virtual network ruins mapping method | |
| CN103532816A (en) | Virtual network reliable mapping method capable of considering constraint of geographic position | |
| Zhu et al. | Rethinking routing information in mobile social networks: location-based or social-based? | |
| CN104270299A (en) | Method and system for virtual network mapping | |
| CN107040466B (en) | Multi-domain cooperative data transmission path selection method based on layered architecture of Internet of things | |
| CN103001886A (en) | ECT (Equal Cost Tree) smooth moving method and device | |
| CN103826282A (en) | Set partitioning multi-hop routing method based on dump energy |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170201 Termination date: 20200120 |