CN103532816A - Virtual network reliable mapping method capable of considering constraint of geographic position - Google Patents
Virtual network reliable mapping method capable of considering constraint of geographic position Download PDFInfo
- Publication number
- CN103532816A CN103532816A CN201310467413.6A CN201310467413A CN103532816A CN 103532816 A CN103532816 A CN 103532816A CN 201310467413 A CN201310467413 A CN 201310467413A CN 103532816 A CN103532816 A CN 103532816A
- Authority
- CN
- China
- Prior art keywords
- node
- cost
- virtual network
- mapping
- backup
- 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.)
- Pending
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a virtual network reliable mapping method capable of considering constraint of a geographic position. The virtual network reliable mapping method capable of considering the constraint of the geographic position comprises the following steps of backing up virtual nodes and adjacent links in a virtual network to become a reinforced virtual network, so as to ensure the survivability of the virtual nodes; under the condition of meeting the constraint of the geographic position, firstly mapping the virtual nodes and the adjacent links in the virtual network, secondly mapping the backup virtual nodes and the backup adjacent links, so as to finish the mapping from the whole virtual network to an infrastructure network. Therefore, according to the virtual network reliable mapping method capable of considering the constraint of the geographic position, which is disclosed by the invention, the share of a node resource can be realized, the cost of mapping is reduced, and the increasing trend of the current social network information capacity can be fitted.
Description
Technical field
The invention belongs to Internet communication technology field, more specifically say, relate to a kind of reliable mapping method of virtual network of considering geographical position constraint.
Background technology
Along with the fast development of Internet technology, the Internet has become the important infrastructure of modern society, and existing Internet architecture has played important impetus to the fast development of the Internet.Yet, along with emerging in an endless stream of the Internet new application, different application has also proposed different demands to bottom-layer network at aspects such as fail safe, service quality, extensibilities, existing Internet architecture is difficult to catch up with the growth requirement of these application, present to a certain extent rigid phenomenon, thereby cause some new applications to be difficult to be applied in the existing network architecture, as diversity service and IP multicast etc.The rigid problem facing for the current internet network architecture, cloud computing becomes a focus of current internet development, cloud computing is a kind of computation schema of dynamic telescopic virtualized resource that provides in the mode of service by Internet, data-centered, be a kind of data-intensive supercomputing, in many-sides such as data storage, data management, programming modes, there is the technology of self uniqueness.Related to numerous other technologies simultaneously, such as: load-balancing technique, parallel computing, virtual machine technique, system monitoring technology.Network virtualization technology is to propose under the overall background of cloud computing, and at present, network virtualization technology has been acknowledged as the effective means that solves the rigid problem in the Internet.
Network virtualization refers to the hardware and software resource consolidation of network, the technology that provides virtual network to connect to user.It is carried out abstract and unified programmable interface is provided public underlying basis facility by Intel Virtualization Technology, by a plurality of virtual network that is isolated from each other and there is different topology (Virtual Network, VN) be mapped in public infrastructure, for user provides differentiated service.Yet, apply this scheme, a difficult problem that first will solve is that the VN that how rationally and efficiently will build is mapped to existing infrastructure network (Substrate Network, SN) on, be virtual network mapping problems (virtual network mapping problem, VNMP).VNMP refers to a VN with dummy node and virtual link constraint is mapped to the process in SN.Wherein, dummy node is mapped on the physical node in SN, and virtual link is mapped in the physical pathway in SN, and meets dummy node and the constraint of virtual link to resource requirement in VN.
In prior art K-redundancy mapping algorithm, at a time only have at most in the situation of a dummy node inefficacy, increase K backup node.The main thought of this scheme is as follows: be first to strengthen original virtual network, for original virtual network increases K backup node, once certain dummy node lost efficacy, just the node of this inefficacy is moved on its corresponding backup node, and move the virtual link relevant to this failure node simultaneously, between the adjacent node of the dummy node that therefore, this K backup node should be corresponding with it, there is connection.Then mapping has increased the enhanced virtual network of backup node and backup link, in the process of mapping, first shine upon original virtual network, and then mapping backup node and backup link, in mapping backup link, have active link resource-sharing and backup link resource-sharing, and different backup nodes can be mapped to same physical node, exist physics node resource to share.K-redundancy mapping algorithm has increased backup node for each dummy node, although solved, backup node is difficult to be determined, and the problem such as during the corresponding link maps of failure node Route Selection is easy, but still do not consider the constraints in dummy node geographical position, and actual conditions are inconsistent.
Summary of the invention
The object of the invention is to overcome the deficiencies in the prior art, a kind of reliable mapping method of virtual network of considering geographical position constraint is provided, under based on dummy node geographical position constraints, consider that the virtual network of node survivability is mapped to infrastructure network.
For achieving the above object, the present invention is based on the reliable mapping method of virtual network of considering geographical position constraint, it is characterized in that, comprise the following steps:
(1.1), the dummy node V in virtual network
iand V
iin abutting connection with link, increase backup, V
irepresent i dummy node in virtual network, V
ibackup node be b
i, the network after backup is enhanced virtual network;
(1.2), meet under geographical position constraint, enhanced virtual network mapping to infrastructure network.
Wherein, by enhanced virtual network mapping, to the concrete grammar on infrastructure network, be:
(2.1), in judgement basis facility network, whether the geographical position of physical node is the scope that in virtual network, dummy node can shine upon;
With dummy node V
icoordinate (X, Y) centered by, coordinate (X, Y) is illustrated in the latitude and longitude coordinates in actual map, the definite value R of take draws circle as radius, the physical node in this circle scope is dummy node V
ithe physical node set that can shine upon, the distance value between dummy node and physical node is less than R;
(2.2), enhanced virtual network mapping is also calculated to mapping total cost to infrastructure network;
Meeting under the condition of step (2.1), first the dummy node V in virtual network
iand V
iin abutting connection with link, shine upon, then to the backup node b increasing
ishine upon in abutting connection with link with backup, complete enhanced virtual network mapping to the mapping on infrastructure network;
Mapping total cost cost computing formula is as follows:
cost＝cost
1+cost
2；
Wherein, cost
1for the cost that mapping virtual network needs, cost
2for shining upon the backup node increasing and backing up the cost needing in abutting connection with link;
cost
1＝cost
1node+cost
1link；
Wherein, cost
1nodeexpression is mapped to the dummy node in virtual network the cost needing in infrastructure network; Cost
1linkexpression will be mapped in abutting connection with link the cost needing in infrastructure network in virtual network;
cost
2＝cost
2node+cost
2link；
Wherein, cost
2nodeexpression is mapped to the backup node in virtual network the cost needing in infrastructure network; Cost
2linkexpression is mapped to the backup in virtual network the cost needing in infrastructure network in abutting connection with link.
By enhanced virtual network mapping, to the concrete grammar on infrastructure network, can also be:
(3.1) whether the geographical position that, judges dummy node in virtual network is the scope that in infrastructure network, physical node can shine upon;
With physical node S
jcoordinate (A, B) centered by, S
jrepresent j physical node, coordinate (A, B) is illustrated in the latitude and longitude coordinates in actual map, and the definite value R of take draws circle as radius, and the dummy node in this circle scope is physical node V
ithe dummy node set that can shine upon, the distance value between dummy node and physical node is less than R;
(3.2), enhanced virtual network mapping is also calculated to mapping total cost to infrastructure network;
Meeting under the condition of step (3.1), first the dummy node V in virtual network
iand V
iin abutting connection with link, shine upon, then by guided bone mapping method to the backup node b increasing
ishine upon in abutting connection with link with backup, complete enhanced virtual network mapping to the mapping on infrastructure network;
Physical node S
jthe set of shone upon dummy node be CMS
j={ v
0, v
1... vm}, now will be mapped to physical node S by the backup node of V0
jget on, at the backup node of V0, be mapped to physical node S
jbefore, S
jon the node capacity of other backup node of having existed be designated as S, and S can share; V
0backup node be mapped to S
jtime relative S increment be designated as C, mapping total cost cost, computing formula is as follows:
C1＝max(b-S,0)；
C2＝max(b-S-C,0)
Wherein, cost
afor V in virtual network
0backup node and backup in abutting connection with link, be mapped to the cost needing in infrastructure network, max
i(0, C1-C2) represent S
jshone upon dummy node set CMS
j={ v
0, v
1... v
min i dummy node to V
0backup node be mapped to S
jimpact, C1 represents to exist under node capacity S prerequisite, does not shine upon V
0backup node to S
jtime, mapping V
n(V
nrefer to CMS
j={ v
0, v
1... v
min V
1to V
min any one dummy node) backup node to S
jneed the node capacity increasing; C2 represents to exist under node capacity S prerequisite, mapping V
0backup node to S
jtime, mapping V
nbackup node to S
jtime the node capacity that need to increase; B represents dummy node V
nnode capacity;
Wherein, described guided bone mapping is by changing the computational methods guiding physical node S of cost
jshone upon dummy node set CMS
jin the backup node of each dummy node be mapped to physical node S as far as possible
jon.
Goal of the invention of the present invention is achieved in that
The present invention is based on the reliable mapping method of virtual network of considering geographical position constraint, by the dummy node in virtual network with become the virtual network of enhancement mode in abutting connection with link backup, guarantee like this survivability of dummy node, meeting under the condition of geographical position constraint, first by the dummy node in former virtual network with in abutting connection with link maps, again by backup dummy node and backup in abutting connection with link maps, complete whole virtual network to the mapping of infrastructure network, can realize like this sharing of node resource, reduce the cost of mapping, can adapt to the growing trend of society network information capacity.
Meanwhile, the present invention is based on and can adapt to the growing trend of society network information capacity and also there is following beneficial effect:
(1), by increasing backup to the dummy node in virtual network with in abutting connection with link, guaranteed, in the situation that any one dummy node lost efficacy (any time only has a node failure at the most) sometime, failure node to be moved to backup node;
(2), a physical node can shine upon a plurality of dummy nodes simultaneously, realized sharing of node resource;
(3), adopt the method for guided bone mapping, can change the computational methods of mapping cost, thereby reduce backup node mapping cost.
Accompanying drawing explanation
Fig. 1 is a kind of a kind of embodiment structure chart of considering the reliable mapping method of virtual network of geographical position constraint of the present invention.
Fig. 2 be virtual network and increase backup node and backup in abutting connection with the structure chart of the enhanced virtual network after link;
Fig. 3 be dummy node in virtual network can mapping physical node set schematic diagram;
Fig. 4 is the shone upon dummy node set schematic diagram of the physical node in physical network;
Embodiment
Below in conjunction with accompanying drawing, the specific embodiment of the present invention is described, so that those skilled in the art understands the present invention better.Requiring particular attention is that, in the following description, when perhaps the detailed description of known function and design can desalinate main contents of the present invention, these are described in here and will be left in the basket.
Embodiment
Fig. 1 is a kind of a kind of embodiment structure chart of considering the reliable mapping method of virtual network of geographical position constraint of the present invention.
In the present embodiment, as shown in Figure 1, V
0the coordinate figure on side represents dummy node V
0latitude and longitude coordinates, latitude and longitude coordinates is the dummy node V of (36.37,101.49)
0can mapping set be with (36.37,101.49) centered by, 10 is a border circular areas of radius, and it can mapping physical node set be the city of the radius of take centered by Xining (latitude and longitude coordinates in Xining is 36.37, the 101.49) border circular areas that is 10.In like manner, all the other dummy nodes also being had accordingly can mapping physical node set.
Infrastructure network is the map of China that has 55 nodes, and each node coordinate is the latitude and longitude coordinates in actual map.The existing virtual network VN that geographical position is had to requirement, and only have at most at any time in the situation of a dummy node inefficacy, consider the survivability of node, virtual network VN is mapped in the infrastructure network SN of expression Chinese practice map of 55 nodes.
Fig. 2 be virtual network and increase backup node and backup in abutting connection with the structure chart of the enhanced virtual network after link.
As shown in Figure 2, the requirement of the numeral dummy node on the node side of virtual network VN to physical node capacity, dummy node V
0the numeral on side is 10, represents that dummy node is 10 to the capacity requirement of physical node; The requirement of the numeral virtual link on virtual link side to physical link bandwidth, link link (V
0, V
1) numeral on side is 12, represents that virtual link is 12 to physical link bandwidth requirement; By K-redundant arithmetic, to the dummy node in virtual network with in abutting connection with link, increase backup, the node capacity after backup is identical with physical link bandwidth with dummy node capacity corresponding in virtual network with physical link bandwidth.
Fig. 3 be dummy node in virtual network can mapping physical node set schematic diagram.
As shown in Figure 3, with dummy node V
0coordinate (X, Y) centered by, coordinate (X, Y) is illustrated in the latitude and longitude coordinates in actual map, the definite value R of take draws circle as radius, as shown in the broken circle in Fig. 2, the physical node in this region is exactly dummy node V
0can mapping physical node set, this set is to determine according to this constraints of the geographical position coordinates of node.In like manner, other dummy nodes also have accordingly can mapping physical node set, each dummy node can between mapping physical node set, can there is overlapping region.Mapping total cost cost computing formula is as follows:
cost＝cost
1+cost
2；
Wherein, cost
1for the cost that mapping virtual network needs, cost
2for shining upon the backup node increasing and backing up the cost needing in abutting connection with link;
cost
1＝cost
1node+cost
1link；
Wherein, cost
1nodeexpression is mapped to the dummy node in virtual network the cost needing in infrastructure network; Cost
1linkexpression will be mapped in abutting connection with link the cost needing in infrastructure network in virtual network;
cost
2＝cost
2node+cost
2link；
Wherein, cost
2nodeexpression is mapped to the backup node in virtual network the cost needing in infrastructure network; Cost
2linkexpression is mapped to the backup in virtual network the cost needing in infrastructure network in abutting connection with link.
Fig. 4 is the shone upon dummy node set schematic diagram of the physical node in infrastructure network.
As shown in Figure 4, with physical node S
1coordinate (X, Y) centered by, coordinate (X, Y) is illustrated in the latitude and longitude coordinates in actual map, the definite value R of take draws circle as radius, as shown in the broken circle in Fig. 3, the dummy node in this region is physical node S in the past
1mapping, physical node S
1shone upon dummy node set CMS
1for { V
0, V
1, V
2, this set is to determine according to this constraints of the geographical position coordinates of node.In like manner, other physical nodes also have accordingly can shine upon dummy node set, between the shone upon dummy node set of each physical node, can have overlapping region.
Physical node S
1shone upon dummy node set CMS
1for { V
0, V
1, V
2, now will be by V
0backup node be mapped to physical node S
1get on, at V
0backup node be mapped to physical node S
1before, S
1on the node capacity of other backup node of having existed be designated as S, and S can share; V
0backup node be mapped to S
1time relative S increment be designated as C, mapping total cost cost, computing formula is as follows:
cost＝cost
a-max
1(0,C1-C2)-max
2(0,C1-C2)；
C1＝max(b-S,0)；
C2＝max(b-S-C,0)
Wherein, cost
afor V in virtual network
0backup node and backup in abutting connection with link, be mapped to the cost needing in infrastructure network, max
1(0, C1-C2) represent V
1to V
0backup node be mapped to S
1impact, max
2(0, C1-C2) represent V
2to V
0backup node be mapped to S
1impact, C1 represents to exist under node capacity S prerequisite, does not shine upon V
0backup node to S
1time, mapping V
1or V
2backup node to S
1need the node capacity increasing; C2 represents to exist under node capacity S prerequisite, mapping V
0backup node to S
1time, mapping V
1or V
2backup node to S
1need the node capacity increasing; B represents dummy node V
1or V
2node capacity;
Although above the illustrative embodiment of the present invention is described; so that those skilled in the art understand the present invention; but should be clear; the invention is not restricted to the scope of embodiment; to those skilled in the art; as long as various variations appended claim limit and definite the spirit and scope of the present invention in, these variations are apparent, all utilize innovation and creation that the present invention conceives all at the row of protection.
Claims (4)
1. the reliable mapping method of virtual network of considering geographical position constraint, is characterized in that, comprises the following steps:
(1.1), the dummy node V in virtual network
iand V
iin abutting connection with link, increase backup, V
irepresent i dummy node in virtual network, V
ibackup node be b
i, the network after backup is enhanced virtual network;
(1.2), meet under geographical position constraint, enhanced virtual network mapping to infrastructure network.
2. the reliable mapping method of virtual network of consideration according to claim 1 geographical position constraint, is characterized in that, the method for described step (1.2) is:
(2.1), in judgement basis facility network, whether the geographical position of physical node is the scope that in virtual network, dummy node can shine upon;
With dummy node V
icoordinate (X, Y) centered by, coordinate (X, Y) is illustrated in the latitude and longitude coordinates in actual map, the definite value R of take draws circle as radius, the physical node in this circle scope is dummy node V
ithe physical node set that can shine upon, the distance value between dummy node and physical node is less than R;
(2.2), enhanced virtual network mapping is also calculated to mapping total cost to infrastructure network;
Meeting under the condition of step (2.1), first the dummy node V in virtual network
iand V
iin abutting connection with link, shine upon, then to the backup node b increasing
ishine upon in abutting connection with link with backup, complete enhanced virtual network mapping to the mapping on infrastructure network;
Mapping total cost cost computing formula is as follows:
cost＝cost
1+cost
2；
Wherein, cost
1for the cost that mapping virtual network needs, cost
2for shining upon the backup node increasing and backing up the cost needing in abutting connection with link;
cost
1＝cost
1node+cost
1link；
Wherein, cost
1nodeexpression is mapped to the dummy node in virtual network the cost needing in infrastructure network; Cost
1linkexpression will be mapped in abutting connection with link the cost needing in infrastructure network in virtual network;
cost
2＝cost
2node+cost
2link；
Wherein, cost
2nodeexpression is mapped to the backup node in virtual network the cost needing in infrastructure network; Cost
2linkexpression is mapped to the backup in virtual network the cost needing in infrastructure network in abutting connection with link.
3. the reliable mapping method of virtual network of consideration according to claim 1 geographical position constraint, is characterized in that, the method for described step (1.2) can also be:
(3.1) whether the geographical position that, judges dummy node in virtual network is the scope that in infrastructure network, physical node can shine upon;
With physical node S
jcoordinate (A, B) centered by, S
jrepresent j physical node, coordinate (A, B) is illustrated in the latitude and longitude coordinates in actual map, and the definite value R of take draws circle as radius, and the dummy node in this circle scope is physical node V
ithe dummy node set that can shine upon, the distance value between dummy node and physical node is less than R;
(3.2), enhanced virtual network mapping is also calculated to mapping total cost to infrastructure network;
Meeting under the condition of step (3.1), first the dummy node V in virtual network
iand V
iin abutting connection with link, shine upon, then by guided bone mapping method to the backup node b increasing
ishine upon in abutting connection with link with backup, complete enhanced virtual network mapping to the mapping on infrastructure network;
Physical node S
jthe set of shone upon dummy node be CMS
j={ v
0, v
1... v
m, now will be by V
0backup node be mapped to physical node S
jget on, at V
0backup node be mapped to physical node S
jbefore, S
jon the node capacity of other backup node of having existed be designated as S, and S can share; V
0backup node be mapped to S
jtime relative S increment be designated as C, mapping total cost cost, computing formula is as follows:
C1＝max(b-S,0)；
C2＝max(b-S-C,0)
Wherein, cost
afor V in virtual network
0backup node and backup in abutting connection with link, be mapped to the cost needing in infrastructure network, max
i(0, C1-C2) represent S
jshone upon dummy node set CMS
j={ v
0, v
1... v
min i dummy node to V
0backup node be mapped to S
jimpact, C1 represents to exist under node capacity S prerequisite, does not shine upon V
0backup node to S
jtime, mapping V
n(V
nrefer to CMS
j={ v
0, v
1... v
min V
1to V
min any one dummy node) backup node to S
jneed the node capacity increasing; C2 represents to exist under node capacity S prerequisite, mapping V
0backup node to S
jtime, mapping V
nbackup node to S
jtime the node capacity that need to increase; B represents dummy node V
nnode capacity.
4. the reliable mapping method of virtual network of consideration according to claim 3 geographical position constraint, is characterized in that, described guided bone mapping is by changing the computational methods guiding physical node S of cost
jshone upon dummy node set CMS
jin the backup node of each dummy node be mapped to physical node S as far as possible
jon.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310467413.6A CN103532816A (en) | 2013-10-09 | 2013-10-09 | Virtual network reliable mapping method capable of considering constraint of geographic position |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310467413.6A CN103532816A (en) | 2013-10-09 | 2013-10-09 | Virtual network reliable mapping method capable of considering constraint of geographic position |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103532816A true CN103532816A (en) | 2014-01-22 |
Family
ID=49934510
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310467413.6A Pending CN103532816A (en) | 2013-10-09 | 2013-10-09 | Virtual network reliable mapping method capable of considering constraint of geographic position |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103532816A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105262669A (en) * | 2015-12-01 | 2016-01-20 | 电子科技大学 | Virtual network mapping method |
| CN105959141A (en) * | 2016-05-03 | 2016-09-21 | 北京邮电大学 | Virtual network topology construction method device |
| CN106100722A (en) * | 2016-05-28 | 2016-11-09 | 国网安徽省电力公司六安供电公司 | A kind of virtual network survivability mapping method that can distinguish maximum sharing capability |
| WO2017045364A1 (en) * | 2015-09-14 | 2017-03-23 | Huawei Technologies Co., Ltd. | Dedicated protection for virtual network embedding |
| CN109831379A (en) * | 2019-01-28 | 2019-05-31 | 重庆邮电大学 | The virtual network based on anchor point is anti-in a kind of elastic optical network ruins mapping method |
| CN112636961A (en) * | 2020-12-15 | 2021-04-09 | 国网河南省电力公司信息通信公司 | Virtual network resource allocation method based on reliability and distribution strategy under network slice |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2005099224A1 (en) * | 2004-03-12 | 2005-10-20 | Thomson Licensing | Automated remote site downloading on a geographic drive |
| CN101123613A (en) * | 2007-08-23 | 2008-02-13 | 张建中 | A coding method and device and system for multi-dimension address |
| CN102904794A (en) * | 2012-09-27 | 2013-01-30 | 北京邮电大学 | Method and device for mapping virtual network |
-
2013
- 2013-10-09 CN CN201310467413.6A patent/CN103532816A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2005099224A1 (en) * | 2004-03-12 | 2005-10-20 | Thomson Licensing | Automated remote site downloading on a geographic drive |
| CN101123613A (en) * | 2007-08-23 | 2008-02-13 | 张建中 | A coding method and device and system for multi-dimension address |
| CN102904794A (en) * | 2012-09-27 | 2013-01-30 | 北京邮电大学 | Method and device for mapping virtual network |
Non-Patent Citations (1)
| Title |
|---|
| GANG SUN ETC: "Adaptive Provisioning for Evolving Virtual Network Request in Cloud-based Datacenters", 《GLOBECOM 2012-COMMUNICATIONS QOS,RELIABILITY AND MODELLING SYMPOSIUM》 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017045364A1 (en) * | 2015-09-14 | 2017-03-23 | Huawei Technologies Co., Ltd. | Dedicated protection for virtual network embedding |
| 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 |
| CN105959141A (en) * | 2016-05-03 | 2016-09-21 | 北京邮电大学 | Virtual network topology construction method device |
| CN105959141B (en) * | 2016-05-03 | 2019-12-03 | 北京邮电大学 | A kind of virtual network topology construction method and device |
| CN106100722A (en) * | 2016-05-28 | 2016-11-09 | 国网安徽省电力公司六安供电公司 | A kind of virtual network survivability mapping method that can distinguish maximum sharing capability |
| CN106100722B (en) * | 2016-05-28 | 2019-03-01 | 国网安徽省电力公司六安供电公司 | A kind of virtual network survivability mapping method that can distinguish maximum sharing capability |
| CN109831379A (en) * | 2019-01-28 | 2019-05-31 | 重庆邮电大学 | The virtual network based on anchor point is anti-in a kind of elastic optical network ruins mapping method |
| CN109831379B (en) * | 2019-01-28 | 2021-02-09 | 重庆邮电大学 | Anchor point-based virtual network survivability mapping method in elastic optical network |
| CN112636961A (en) * | 2020-12-15 | 2021-04-09 | 国网河南省电力公司信息通信公司 | Virtual network resource allocation method based on reliability and distribution strategy under network slice |
| CN112636961B (en) * | 2020-12-15 | 2022-11-08 | 国网河南省电力公司信息通信公司 | Virtual network resource allocation method based on reliability and distribution strategy under network slice |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103532816A (en) | Virtual network reliable mapping method capable of considering constraint of geographic position | |
| US11270039B2 (en) | Road network generation | |
| Morreale et al. | Software defined networking: Design and deployment | |
| WO2013167085A2 (en) | Traffic network division method based on grid mapping generation and configuration server | |
| CN104104621B (en) | A kind of virtual network resource dynamic self-adapting adjusting method based on Nonlinear Dimension Reduction | |
| US20200004596A1 (en) | Attached accelerator based inference service | |
| CN101900565A (en) | Path determining method and device | |
| RU2015155788A (en) | METHOD AND SYSTEM FOR PROTECTING THE VIRTUAL NETWORK DISPLAY, AND ALSO A COMPUTER DATA CARRIER | |
| US11422863B2 (en) | Attached accelerator scaling | |
| CN103259872A (en) | Multi-source heterogeneous geographic information service platform based on open-type grid system | |
| CN106453618A (en) | Remote sensing image processing service cloud platform system based on G-Cloud cloud computing | |
| CN103812748A (en) | Mapping method of survivable virtual network | |
| CN106776455A (en) | A kind of method and device of many GPU communications of unit | |
| CN103150148A (en) | Task tree-based large scale remote-sensing image parallel embedding method | |
| Noor et al. | Cyber-physical application monitoring across multiple clouds | |
| US11960935B2 (en) | Fault-tolerant accelerator based inference service | |
| CN103746894A (en) | Batch virtual network mapping method based on geographic position constraint | |
| AU2013406198A1 (en) | Global grid building unfaulting sequence for complex fault-network topologies | |
| CN104882007A (en) | Traffic signal control system building method based on stream computing and control system | |
| US11494621B2 (en) | Attached accelerator selection and placement | |
| CN114553696A (en) | Method, apparatus and medium for network | |
| CN104331336A (en) | Multilayer nest load balancing method matched with high-performance computer structure | |
| CN102186204A (en) | Heterogeneous wireless sensor network and special self-recovery method thereof | |
| US8902759B2 (en) | TRILL shortest path first implementation | |
| CN107688441A (en) | The implementation method and device of a kind of Storage Virtualization |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| ASS | Succession or assignment of patent right |
Owner name: INSTITUTE OF ELECTRONIC AND INFORMATION ENGINEERIN Effective date: 20131218 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20131218 Address after: 611731 No. 2006, West Avenue, Chengdu, Sichuan Applicant after: University of Electronic Science and Technology of China Applicant after: Institute of Electronic and Information Engineering In Dongguan, UESTC Address before: 611731 No. 2006, West Avenue, Chengdu, Sichuan Applicant before: University of Electronic Science and Technology of China |
|
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20140122 |