CN102932479A - Virtual network mapping method for realizing topology awareness based on historical data - Google Patents
Virtual network mapping method for realizing topology awareness based on historical data Download PDFInfo
- Publication number
- CN102932479A CN102932479A CN2012104610178A CN201210461017A CN102932479A CN 102932479 A CN102932479 A CN 102932479A CN 2012104610178 A CN2012104610178 A CN 2012104610178A CN 201210461017 A CN201210461017 A CN 201210461017A CN 102932479 A CN102932479 A CN 102932479A
- Authority
- CN
- China
- Prior art keywords
- node
- physical
- matrix
- network
- mapping
- 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
Images
Abstract
The invention relates to a virtual network mapping method for realizing the topology awareness based on historical data. The method comprises the following operation steps: (1) according to a historical data set which is accumulated by a bottom layer physical network and is successfully mapped by a virtual network, calculating a dependency matrix M between nodes of the bottom layer physical network; (2) according to the size requirement of virtual nodes in the virtual network on central processing unit (CPU) resources, sorting all the virtual nodes of the virtual network from big to small; (3) according to the dependency matrix M, sequentially carrying out node mapping from the virtual nodes to the bottom layer physical nodes according to a certain sequence; and (4) after completing the node mapping, realizing mapping from a virtual link of the virtual network to a physical path of the bottom layer physical network according to a set link mapping method. The method disclosed by the invention realizes the scientific evaluation on the resource capacities of the bottom layer physical network and the optimization selection of the node mapping by sensing a topological structure of the virtual network, and improves the long-term average success rate of the virtual network mapping.
Description
Technical field
The present invention relates to a kind of method that realizes the virtual network mapping, belong to technical field of the computer network, particularly belong to the network virtualization technical field.
Background technology
Network virtualization refers to a shared physical network infrastructure from being divided in logic virtual network a plurality of mutual isolation, that have the heterogeneous networks topology.Virtual network generally comprises a plurality of dummy nodes and many virtual links, and each dummy node has different resource requirements with every virtual link, and such as the resource requirement of dummy node to central processing unit CPU, virtual link is to the demand of physical link bandwidth.Service provider SP is by renting the infrastructure section of bottom physical network, the access control power that provides on the bottom physical network infrastructure is provided, can need not carry out under the input prerequisite of the related physical network hardware, can rapid deployment be virtual network from procotol or the framework of customization, provide diversified service to the terminal use.
In the mapping process of bottom physical network, owing to need to satisfy simultaneously the resource requirement of node and link, the mapping problems of network virtualization is a NP-hard problem in virtual network.Present relative solution generally designs based on heuristic, but there are the following problems for present heuristic virtual network mapping scheme: (1) present resource standards of grading are that the CPU ability value with physical node multiply by this node adjacent link bandwidth sum as metric, yet this resource standards of grading are inaccurate, cause scheme might select the CPU ability strong and physical node that link is weak shines upon, so that virtual networking is mapped in the failure of link maps stage; (2) always use greedy algorithm to select the highest physical node of scoring to shine upon, and ignored the topology that virtual network is not namely considered in the position of shining upon good dummy node.Therefore, in the process of carrying out the virtual network mapping, how better bottom physical network resource ability to be estimated, how basis is shone upon complete dummy node and topological structure thereof, realizes that the optimization selection of next step node mapping is the technical barrier that the urgent need in present Computer Network Project field will solve.
Summary of the invention
In view of this, the objective of the invention is to invent a kind of method that realizes the virtual network mapping, the historical data set that a large amount of virtual network that can utilize bottom-layer network to accumulate is successfully shone upon, realization is to the scientific evaluation of bottom physical network resource ability, and can in conjunction with shining upon complete dummy node and topological structure thereof, realize that the optimization of next step node mapping is selected.
In order to achieve the above object, the present invention proposes and a kind ofly realize the mapping method of virtual network of topological perception based on historical data, described method comprises following operating procedure:
The dependence matrix M between the bottom physical network nodes is calculated in the historical data set of (1) successfully shining upon according to the virtual network of bottom physical network accumulation;
The virtual network of (2) shining upon for needs according to the demand size of dummy node in this virtual network to cpu resource, sorts to all dummy nodes of this virtual network from big to small;
(3) according to described dependence matrix M, according to the node mapping method of setting, the dummy node in the described virtual network is carried out dummy node to the node mapping of bottom physical node successively according to the order that has sequenced;
(4) node mapping complete after, the virtual link of realizing virtual network according to the link maps method of setting is the mapping between the physical pathway of layer physical network on earth.
The particular content of described step 1 is to comprise following operating procedure:
(11) all physical nodes of bottom physical network are numbered from 1, until numbering n, n is a natural number, equals the physical node number of bottom physical network;
(12) from the historical data set that the virtual network of bottom physical network accumulation is successfully shone upon, take out each map record; To each map record, all construct the empty matrix P of the capable n row of n, each element value of this matrix P is 0 value when initial; In this map record, if i bottom physical node successfully shone upon by dummy node in this map record at least, then allow the element a of the capable i row of the i of matrix P
IiValue is 1; In this map record, if a physical pathway between i bottom physical node and j the bottom physical node was successfully shone upon by a virtual link in this map record at least, then allow the element a of the capable j row of i of matrix P
IjElement a with the capable i row of j
JiAll value is the inverse of the jumping figure of this physical pathway, and wherein i and j are that i and j must be unequal more than or equal to 1, less than or equal to the natural number of n;
(13) all matrix P that construct in the step 12 are carried out matrix addition summation, obtain the capable n column matrix of a new n S;
(14) matrix S is carried out normalized, obtain the dependence matrix M between the bottom physical network nodes; The concrete mode of normalized is: for the element M of the capable i row of matrix M i
IiValue is
The average importance factors of i physical node of this element representation bottom physical network; Element M for the capable j row of matrix M i
IjValue is
The average degree of association factor between this i physical node of element representation bottom physical network and j the physical node; S in the above-mentioned formula
IiThe element of the capable i row of representing matrix S i, S
IjThe element of the capable j of representing matrix S i row, i and j all are that i and j must be unequal more than or equal to 1, less than or equal to the natural number of n.
The particular content of described step 3 is to comprise following operating procedure:
(31) take out the current top dummy node that does not also carry out node mapping that comes;
(32) if this dummy node does not have father node, then from described dependence matrix M, find the current cpu resource that can satisfy this dummy node to require and the average the highest bottom physical node of importance factors, this dummy node is mapped on this physical node; If this dummy node has e father node, then at first find out e the bottom physical node that the correspondence mappings relation is arranged with all father nodes of this dummy node; Then the bottom physical node that from described dependence matrix M, finds a current cpu resource that can satisfy this dummy node to require, and require this physical node to divide to be clipped to the connection product of the average degree of association factor of described e bottom physical node maximum, so this dummy node is mapped on this physical node; E be one more than or equal to 1 natural number; The father node of described dummy node refers to this dummy node adjacency and comes this dummy node dummy node before that when this dummy node carried out node mapping, the father node of this dummy node had been finished node mapping;
(33) get back to step 31, until all dummy nodes are finished mapping.
The link maps method of the setting described in the described step 4 refers to k shortest path k-shortest path method.
Beneficial effect of the present invention is: mapping method of virtual network of the present invention, the historical data of utilizing virtual network successfully to shine upon has realized the scientific evaluation to bottom physical network resource ability, and topological structure that can the perception virtual network, realize that the optimization of node mapping is selected; Mapping method of virtual network of the present invention has improved the long-term average success rate of virtual network mapping effectively, has brought more long-term average yield for bottom physical network infrastructure provider.
Description of drawings
Fig. 1 is the flow chart of the inventive method.
Fig. 2 is the schematic diagram of a virtual network.
Fig. 3 is the schematic diagram of a bottom physical network.
Fig. 4 is the schematic diagram that virtual network shown in Figure 2 is mapped to bottom physical network shown in Figure 3.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with accompanying drawing.
Referring to Fig. 1, to introduce and of the present inventionly a kind ofly realize the mapping method of virtual network of topological perception based on historical data, described method comprises following operating procedure:
The dependence matrix M between the bottom physical network nodes is calculated in the historical data set of (1) successfully shining upon according to the virtual network of bottom physical network accumulation;
The virtual network of (2) shining upon for needs according to the demand size of dummy node in this virtual network to cpu resource, sorts to all dummy nodes of this virtual network from big to small;
Referring to Fig. 2, virtual network shown in Figure 2 comprises 3 dummy nodes, be a, b, three dummy nodes of c, the cpu resource demand size of this dummy node of numeral in the square frame on node next door, the bandwidth resources demand size of this virtual link of numeral between the node on the virtual link, cpu resource demand such as a dummy node is 10 units, and the bandwidth resources demand of virtual link is 8 units between a dummy node and the b dummy node.According to the demand size of dummy node to cpu resource, from big to small a, b, three dummy nodes of c are sorted, ranking results is: a, c, b.
(3) according to described dependence matrix M, according to the node mapping method of setting, the dummy node in the described virtual network is carried out dummy node to the node mapping of bottom physical node successively according to the order that has sequenced;
(4) node mapping complete after, the virtual link of realizing virtual network according to the link maps method of setting is the mapping between the physical pathway of layer physical network on earth.
The particular content of described step 1 is to comprise following operating procedure:
(11) all physical nodes of bottom physical network are numbered from 1, until numbering n, n is a natural number, equals the physical node number of bottom physical network;
Referring to Fig. 3, a bottom physical network shown in Figure 3 comprises 6 physical nodes altogether, numbers successively.Node represents with circle among the figure, numeral in the circle is exactly the numbering of this physical node, the cpu resource ability of this physical node of numeral in the square frame on node next door, the bandwidth resources ability of this link of numeral between the node on the link, cpu resource ability such as No. 1 physical node is 40 units, and the bandwidth resources ability of physical link is 20 units between No. 1 physical node and No. 2 physical nodes.
(12) from the historical data set that the virtual network of bottom physical network accumulation is successfully shone upon, take out each map record; To each map record, all construct the empty matrix P of the capable n row of n, each element value of this matrix P is 0 value when initial; In this map record, if i bottom physical node successfully shone upon by dummy node in this map record at least, then allow the element a of the capable i row of the i of matrix P
IiValue is 1; In this map record, if a physical pathway between i bottom physical node and j the bottom physical node was successfully shone upon by a virtual link in this map record at least, then allow the element a of the capable j row of i of matrix P
IjElement a with the capable i row of j
JiAll value is the inverse of this physical pathway jumping figure, and wherein i and j are that i and j must be unequal more than or equal to 1, less than or equal to the natural number of n;
Such as, according to article one map record, we obtain the matrix P corresponding with bottom physical network shown in Figure 3
1As follows:
(13) all matrix P that construct in the step 12 are carried out matrix addition summation, obtain the capable n column matrix of a new n S;
Such as, we are total k bar map record always, and by step 12, we obtain altogether k matrix P
1, P
2..., P
k, it is as follows then this k matrix addition summation to be obtained matrix S:
(14) matrix S is carried out normalized, obtain the dependence matrix M between the bottom physical network nodes; The concrete mode of normalized is: for the element M of the capable i row of matrix M i
IiValue is
The average importance factors of i physical node of this element representation bottom physical network; Element M for the capable j row of matrix M i
IjValue is
The average degree of association factor between this i physical node of element representation bottom physical network and j the physical node; S in the above-mentioned formula
IiThe element of the capable i row of representing matrix S i, S
IjThe element of the capable j of representing matrix S i row, i and j all are that i and j must be unequal more than or equal to 1, less than or equal to the natural number of n.
The above-mentioned mode that matrix S is carried out normalized can be merged into shown in the following formula:
The particular content of described step 3 is to comprise following operating procedure:
(31) take out the current top dummy node that does not also carry out node mapping that comes;
(32) if this dummy node does not have father node, then from described dependence matrix M, find the current cpu resource that can satisfy this dummy node to require and the average the highest bottom physical node of importance factors, this dummy node is mapped on this physical node;
If this dummy node has e father node, then at first find out e the bottom physical node that the correspondence mappings relation is arranged with all father nodes of this dummy node; Then the bottom physical node that from described dependence matrix M, finds a current cpu resource that can satisfy this dummy node to require, and require this physical node to divide to be clipped to the connection product of the average degree of association factor of described e bottom physical node maximum, so this dummy node is mapped on this physical node; E be one more than or equal to 1 natural number;
Such as: it has e father node to a dummy node v, and the sequence number of the bottom physical node of this e father node institute correspondence mappings is:
Then the bottom physical node of this dummy node mapping is one and currently can satisfies its cpu resource requirement, and satisfies the physical node (its sequence number is t) of following formula:
In the following formula
The j of expression dependence matrix M capable the
Column element.
The father node of described dummy node refers to this dummy node adjacency and comes this dummy node dummy node before that when this dummy node carried out node mapping, the father node of this dummy node had been finished node mapping;
Referring to Fig. 2, virtual network corresponding shown in Figure 2, dummy node a does not have father node, and the father node of dummy node c is a, and the father node of dummy node b is a and c.In the process of node mapping, dummy node a shines upon at first, then is dummy node c, is dummy node b at last.
(33) get back to step 31, until all dummy nodes are finished mapping.
The link maps method of the setting described in the described step 4 refers to k shortest path k-shortest path method.
Referring to Fig. 4, Fig. 4 is the final result that virtual network shown in Figure 2 is mapped to bottom physical network shown in Figure 3, and specifically: dummy node a is mapped to physical node No. 6, and dummy node c is mapped to physical node No. 3, and dummy node b is mapped to physical node No. 1.
The inventor has carried out a large amount of emulation experiments to method proposed by the invention, in emulation experiment, and we have used topology generator GT-ITM software building physical network that has 100 nodes and have 500 limits.All be to link to each other with 0.5 probability between per two nodes.In physical network, the cpu resource ability of node and the bandwidth of link are all obeyed the even distribution of [50,100].The arrival rate of each virtual network mapping request is obeyed the Poisson distribution that arrives 5 virtual network mapping requests with per 100 chronomeres.Each virtual network comprises [10,20] individual dummy node, and the connection probability between per two dummy nodes is 0.5 equally.In each emulation experiment, we allow the bottom physical network accept 2500 virtual networks mapping requests, and with the arithmetic mean of ten simulation results as last the simulation experiment result.The results show method of the present invention is effectively, can improve the Mean mapping success rate of virtual network.
Claims (4)
1. realize the mapping method of virtual network of topological perception based on historical data for one kind, it is characterized in that: described method comprises following operating procedure:
The dependence matrix M between the bottom physical network nodes is calculated in the historical data set of (1) successfully shining upon according to the virtual network of bottom physical network accumulation;
The virtual network of (2) shining upon for needs according to the demand size of dummy node in this virtual network to the CPU cpu resource, sorts to all dummy nodes of this virtual network from big to small;
(3) according to described dependence matrix M, according to the node mapping method of setting, the dummy node in the described virtual network is carried out dummy node to the node mapping of bottom physical node successively according to the order that has sequenced;
(4) node mapping complete after, the virtual link of realizing virtual network according to the link maps method of setting is the mapping between the physical pathway of layer physical network on earth.
2. according to claim 1ly a kind ofly realize the mapping method of virtual network of topological perception based on historical data, it is characterized in that: the particular content of described step 1 is to comprise following operating procedure:
(11) all physical nodes of bottom physical network are numbered from 1, until numbering n, n is a natural number, equals the physical node number of bottom physical network;
(12) from the historical data set that the virtual network of bottom physical network accumulation is successfully shone upon, take out each map record; To each map record, all construct the empty matrix P of the capable n row of n, each element value of this matrix P is 0 value when initial; In this map record, if i bottom physical node successfully shone upon by dummy node in this map record at least, then allow the element a of the capable i row of the i of matrix P
IiValue is 1; In this map record, if a physical pathway between i bottom physical node and j the bottom physical node was successfully shone upon by a virtual link in this map record at least, then allow the element a of the capable j row of i of matrix P
IjElement a with the capable i row of j
JiAll value is the inverse of the jumping figure of this physical pathway, and wherein i and j are that i and j must be unequal more than or equal to 1, less than or equal to the natural number of n;
(13) all matrix P that construct in the step 12 are carried out matrix addition summation, obtain the capable n column matrix of a new n S;
(14) matrix S is carried out normalized, obtain the dependence matrix M between the bottom physical network nodes; The concrete mode of normalized is: for the element M of the capable i row of matrix M i
IiValue is
The average importance factors of i physical node of this element representation bottom physical network; Element M for the capable j row of matrix M i
IjValue is
The average degree of association factor between this i physical node of element representation bottom physical network and j the physical node; S in the above-mentioned formula
IiThe element of the capable i row of representing matrix S i, S
IjThe element of the capable j of representing matrix S i row, i and j all are that i and j must be unequal more than or equal to 1, less than or equal to the natural number of n.
3. according to claim 1ly a kind ofly realize the mapping method of virtual network of topological perception based on historical data, it is characterized in that: the particular content of described step 3 is to comprise following operating procedure:
(31) take out the current top dummy node that does not also carry out node mapping that comes;
(32) if this dummy node does not have father node, then from described dependence matrix M, find the current cpu resource that can satisfy this dummy node to require and the average the highest bottom physical node of importance factors, this dummy node is mapped on this physical node; If this dummy node has e father node, then at first find out e the bottom physical node that the correspondence mappings relation is arranged with all father nodes of this dummy node; Then the bottom physical node that from described dependence matrix M, finds a current cpu resource that can satisfy this dummy node to require, and require this physical node to divide to be clipped to the connection product of the average degree of association factor of described e bottom physical node maximum, so this dummy node is mapped on this physical node; E be one more than or equal to 1 natural number; The father node of described dummy node refers to this dummy node adjacency and comes this dummy node dummy node before that when this dummy node carried out node mapping, the father node of this dummy node had been finished node mapping;
(33) get back to step 31, until all dummy nodes are finished mapping.
4. according to claim 1ly a kind ofly realize the mapping method of virtual network of topological perception based on historical data, it is characterized in that: the link maps method of the setting described in the described step 4 refers to k shortest path k-shortest path method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210461017.8A CN102932479B (en) | 2012-11-16 | 2012-11-16 | Virtual network mapping method for realizing topology awareness based on historical data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210461017.8A CN102932479B (en) | 2012-11-16 | 2012-11-16 | Virtual network mapping method for realizing topology awareness based on historical data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102932479A true CN102932479A (en) | 2013-02-13 |
| CN102932479B CN102932479B (en) | 2015-01-07 |
Family
ID=47647175
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210461017.8A Expired - Fee Related CN102932479B (en) | 2012-11-16 | 2012-11-16 | Virtual network mapping method for realizing topology awareness based on historical data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102932479B (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103560967A (en) * | 2013-10-17 | 2014-02-05 | 电子科技大学 | Virtual data center mapping method sensing service requirement |
| CN103746894A (en) * | 2014-01-20 | 2014-04-23 | 电子科技大学 | Batch virtual network mapping method based on geographic position constraint |
| CN104320343A (en) * | 2014-10-28 | 2015-01-28 | 北京邮电大学 | Electric energy perception cross-domain virtual network mapping method and system |
| CN104363159A (en) * | 2014-07-02 | 2015-02-18 | 北京邮电大学 | Virtual open network building system and method based on software definition network |
| CN104869044A (en) * | 2015-06-19 | 2015-08-26 | 中国人民解放军信息工程大学 | Mapping method and mapping device for virtual network |
| CN105743763A (en) * | 2016-04-07 | 2016-07-06 | 北京邮电大学 | Virtual network mapping method based on learning and reasoning |
| CN107135135A (en) * | 2017-05-02 | 2017-09-05 | 北京邮电大学 | A kind of mapping method of virtual network and device sorted based on bottom layer node |
| CN108132827A (en) * | 2016-11-30 | 2018-06-08 | 华为技术有限公司 | A kind of network slice method for mapping resource, relevant device and system |
| CN108989126A (en) * | 2018-08-13 | 2018-12-11 | 北京邮电大学 | A kind of mapping method of virtual network |
| CN111182037A (en) * | 2019-12-13 | 2020-05-19 | 中国联合网络通信集团有限公司 | Mapping method and device of virtual network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080259956A1 (en) * | 2004-03-31 | 2008-10-23 | Lg Electronics Inc. | Data Processing Method for Network Layer |
| CN102546232A (en) * | 2011-11-03 | 2012-07-04 | 北京邮电大学 | Multi-topology mapping method of virtual network |
-
2012
- 2012-11-16 CN CN201210461017.8A patent/CN102932479B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080259956A1 (en) * | 2004-03-31 | 2008-10-23 | Lg Electronics Inc. | Data Processing Method for Network Layer |
| CN102546232A (en) * | 2011-11-03 | 2012-07-04 | 北京邮电大学 | Multi-topology mapping method of virtual network |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103560967A (en) * | 2013-10-17 | 2014-02-05 | 电子科技大学 | Virtual data center mapping method sensing service requirement |
| CN103746894B (en) * | 2014-01-20 | 2017-02-01 | 电子科技大学 | Batch virtual network mapping method based on geographic position constraint |
| CN103746894A (en) * | 2014-01-20 | 2014-04-23 | 电子科技大学 | Batch virtual network mapping method based on geographic position constraint |
| CN104363159A (en) * | 2014-07-02 | 2015-02-18 | 北京邮电大学 | Virtual open network building system and method based on software definition network |
| CN104363159B (en) * | 2014-07-02 | 2018-04-06 | 北京邮电大学 | A kind of opening virtual network constructing system and method based on software defined network |
| CN104320343A (en) * | 2014-10-28 | 2015-01-28 | 北京邮电大学 | Electric energy perception cross-domain virtual network mapping method and system |
| CN104869044A (en) * | 2015-06-19 | 2015-08-26 | 中国人民解放军信息工程大学 | Mapping method and mapping device for virtual network |
| CN104869044B (en) * | 2015-06-19 | 2019-01-29 | 中国人民解放军信息工程大学 | A kind of virtual net mapping method and device |
| CN105743763A (en) * | 2016-04-07 | 2016-07-06 | 北京邮电大学 | Virtual network mapping method based on learning and reasoning |
| CN105743763B (en) * | 2016-04-07 | 2019-04-16 | 北京邮电大学 | A kind of mapping method of virtual network based on study and reasoning |
| CN108132827A (en) * | 2016-11-30 | 2018-06-08 | 华为技术有限公司 | A kind of network slice method for mapping resource, relevant device and system |
| CN107135135A (en) * | 2017-05-02 | 2017-09-05 | 北京邮电大学 | A kind of mapping method of virtual network and device sorted based on bottom layer node |
| CN107135135B (en) * | 2017-05-02 | 2019-09-06 | 北京邮电大学 | A kind of mapping method of virtual network and device based on bottom layer node sequence |
| CN108989126A (en) * | 2018-08-13 | 2018-12-11 | 北京邮电大学 | A kind of mapping method of virtual network |
| CN111182037A (en) * | 2019-12-13 | 2020-05-19 | 中国联合网络通信集团有限公司 | Mapping method and device of virtual network |
| CN111182037B (en) * | 2019-12-13 | 2022-02-25 | 中国联合网络通信集团有限公司 | Mapping method and device of virtual network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102932479B (en) | 2015-01-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102932479B (en) | Virtual network mapping method for realizing topology awareness based on historical data | |
| Liao et al. | Density cluster based approach for controller placement problem in large-scale software defined networkings | |
| CN103457752A (en) | Virtual network mapping method | |
| CN104320324B (en) | A kind of mapping method of virtual network based on link interference | |
| CN103327082B (en) | A kind of colony evacuation optimal change method | |
| CN103701900B (en) | Data distribution method on basis of heterogeneous cluster | |
| CN102508935A (en) | On-chip network mapping method based on ant-colony chaos genetic algorithm | |
| CN105743763B (en) | A kind of mapping method of virtual network based on study and reasoning | |
| CN102780581B (en) | AFDX (Avionics Full Duplex Switched Ethernet) end-to-end delay bound claculation method based on random network calculus | |
| CN104104621B (en) | A kind of virtual network resource dynamic self-adapting adjusting method based on Nonlinear Dimension Reduction | |
| CN105205266B (en) | A kind of design method of the prestressed cable-strut structures initial configuration based on optimized algorithm | |
| CN103259744A (en) | Method for mapping mobile virtual network based on clustering | |
| CN103560967A (en) | Virtual data center mapping method sensing service requirement | |
| CN104216782A (en) | Dynamic resource management method for high-performance computing and cloud computing hybrid environment | |
| CN102710488A (en) | Method for realizing virtual network mapping | |
| CN105634974B (en) | Route determining methods and device in software defined network | |
| CN101976245A (en) | Sequencing method of node importance in network | |
| CN106162680A (en) | Dilatation parameter determination method and device | |
| CN109754168A (en) | Charging station site selecting method and device | |
| CN107276664A (en) | The empty net mapping method of mixing loaded based on thresholding formula | |
| CN109743215A (en) | A kind of ant group optimization mapping method of virtual network based on disaster prediction under multizone failure | |
| CN104506337A (en) | Virtual network mapping method and device based on regional fault prediction | |
| Hsu et al. | Virtual network mapping algorithm in the cloud infrastructure | |
| CN102065019A (en) | IP (Internet Protocol) core fast mapping method for network on chip based on region division | |
| CN106201706A (en) | A kind of population method for service selection and system |
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 |
Granted publication date: 20150107 Termination date: 20151116 |
|
| EXPY | Termination of patent right or utility model |