CN103259744A - Method for mapping mobile virtual network based on clustering - Google Patents
Method for mapping mobile virtual network based on clustering Download PDFInfo
- Publication number
- CN103259744A CN103259744A CN2013100995388A CN201310099538A CN103259744A CN 103259744 A CN103259744 A CN 103259744A CN 2013100995388 A CN2013100995388 A CN 2013100995388A CN 201310099538 A CN201310099538 A CN 201310099538A CN 103259744 A CN103259744 A CN 103259744A
- Authority
- CN
- China
- Prior art keywords
- node
- mapping
- virtual network
- bunch
- clustering
- 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
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a method for mapping a mobile virtual network based on clustering. The method for mapping the mobile virtual network based on the clustering aims to improve the mapping success rate from a virtual network to a mobile physical network and virtual network revenue and to reduce mapping overhead. The method for mapping the mobile virtual network based on the clustering takes the physical network clustering as a basis and solves the problems that nodes and links in the process of virtual network mapping and in the process of resource allocation are poor in coordination, and algorithm performance is poor when virtual network topology is sparse in a mobile network environment. The method for mapping the mobile virtual network based on the clustering comprises the following steps: according to the displacement law of the nodes, predicting stability of the links among the nodes, clustering the physical network accordingly, and dividing the virtual network mapping into an inter-cluster mapping mode and an inside-cluster mapping mode. According to the method for mapping the mobile virtual network based on the clustering, due to the fact that a clustering method based on node prediction and the inter-cluster and the inside-cluster mapping modes based on the clustering are introduced, the virtual network mapping can achieve efficient and high success rate of request for the virtual network in the mobile network environment as well.
Description
Technical field
The present invention relates to virtual network mapping field, particularly relate to a kind of mobile environment virtual network mapping method based on sub-clustering.
Background technology
Virtual network is one of main thought of inherent shortcoming such as solve that internet scalability is poor, manageability difference and service quality guarantee complexity too, the method can be carried out the experiment of new network structure on the basis that does not change the current network architecture, and with the live network flow as experimental data, for design and the test of new network architecture provides important environmental level.And the virtual network mapping problems is one of key link that makes up virtual network.
In recent years, in order to solve the virtual network mapping problems, the researcher launches research from many aspects, and obtained achievement mainly contains:
(1) towards the virtual network mapping algorithm of load balancing
Being two kinds of virtual network mapping algorithms of target with the bottom-layer network load balancing,---do not have the virtual network mapping algorithm of reshuffling and have the virtual network mapping algorithm of reshuffling---has better effects aspect the raising bottom-layer network resource utilization, but these two kinds of algorithms are not all considered bottom-layer network and virtual network resource constraint in the virtual network mapping process, though and the virtual network to having shone upon that proposes in the literary composition dashes the algorithm balancing layer offered load to a certain extent of mapping, can cause serious problems such as virtual network service interruption.
(2) based on the virtual network mapping algorithm of traffic constraints
Though taken into full account the traffic demand of virtual network, this algorithm has been ignored the dummy node resource constraint in mapping process, and this algorithm only is applicable to that topological structure is backbone-star-like virtual network request.
(3) division of bottom-layer network support path and the virtual network mapping algorithm that moves
Answer at bottom-layer network under the prerequisite of support path division and migrate attribute, node and link circuit resource constraint in the virtual network mapping problems have been considered simultaneously, the virtual network mapping algorithm of the online virtual network request of support of factors such as the diversity of virtual network topology demand and virtual network access control is of value to raising virtual network request receptance and bottom-layer network resource utilization, but because this algorithm was not considered the mapping of virtual link in the dummy node mapping stage, therefore may cause the bigger problem of virtual link mapping cost, also there is bigger room for improvement in its aspect of performance.
(4) the virtual network mapping algorithm of cooperative nodes and link maps
Consider the locational requirement of dummy node, under the situation of bottom-layer network support path division, shining upon resource overhead with the reduction virtual network is target, virtual network mapping problems form is turned to the mixed integer programming problem, the virtual network mapping algorithm of 2 kinds of cooperative nodes and link maps: certainty virtual network mapping (D-ViNE) algorithm and at random virtual network shine upon (R-ViNE) algorithm.This node link is worked in coordination with mapping algorithm, reduced the resource overhead of each virtual network mapping to a certain extent, provide the space for accepting more virtual network request, divided this characteristic but this algorithm exceedingly relies on the bottom-layer network support path, ignored its negative effect that brings.When bottom-layer network support path when division, this algorithm performance is relatively poor.
(5) the virtual network mapping algorithm that detects based on the subgraph isomorphism
This basic idea is at same stage mapping dummy node and link, after dummy node is successfully shone upon, and the virtual link that just adopts the shortest path first mapping to link to each other with this node.This algorithm is the improvement of classons isomorphism of graph algorithm VF algorithm, is that with VF algorithm difference this algorithm need check the resource constraint of node and link in mapping step, and allows a link and a paths to mate.Because this algorithm is at same stage mapping dummy node and link, therefore it can effectively avoid virtual link to be mapped to long path problems in the bottom-layer network, thereby reduced the bottom-layer network resource overhead of virtual network mapping, improve the bottom-layer network level of resources utilization, but this algorithm essence is a kind of back-track algorithm, computing cost is bigger, and this algorithm can not be handled the virtual network request that dummy node has locational requirement.
(6) towards the virtual network mapping algorithm of QoS
A kind of QoS(packet loss rate, time delay etc. of having) the virtual network mapping algorithm QoSMap of Bao Zhanging.This basic idea is as much as possible a virtual link to be mapped on the bottom link, and by using for reference the design philosophy of RON, utilize a jumping transistroute node to provide high-quality reserve routed path for virtual link, improve service quality and the reliability of virtual network.This algorithm can be handled the virtual network request that has high-level QoS demand, but because mode is recalled in the employing of the mapping process of its dummy node and virtual link carries out, computing cost is big.In addition, when inadequate or virtual network is larger when the bottom-layer network resource, adopt this algorithm to be difficult to the feasible mapping scheme that acquisition can be satisfied virtual network mapping resource requirement.
(7) distributed virtual network mapping algorithm
Though this algorithm can effectively be avoided centralized virtual network mapping algorithm Single Point of Faliure problem, can tackle the bottom-layer network local fault fast, but when bottom-layer network was larger, information synchronization and interactive communication expense were big between agent node, and aspect of performance can't be compared with centralized algorithm.
(8) the virtual network mapping algorithm of dynamic self-adapting
In order to utilize the bottom-layer network bandwidth resources efficiently, improve overall system performance to greatest extent, in this dynamic self-adapting virtual network framework (DaVinci) framework, the traffic conditions of each virtual network of bottom link monitoring, and according to local messages such as the congestion level of the virtual link of its carrying and performance index, periodically be that virtual link distributes the bottom bandwidth resources of sharing again.This architecture combined virtual router, seal dress and inoperative keeps dispatching technique, performance requirement according to virtual network service, can distribute the bottom-layer network bandwidth resources for virtual network in dynamic self-adapting ground, thereby improved bottom-layer network bandwidth resources utilization ratio, but it is not considered mapping and the resource allocation problem of dummy node, and owing to periodically the bandwidth resource allocation of all virtual networks is adjusted, the stability of system is a problem that merits attention.
(9) the virtual network mapping algorithm of topological perception
Use for reference Google PageRank thought, bottom (or virtual) node resource measure NodeRank based on the topological perception of Markov random walk (Random Walk) model, the resource capability that the NodeRank value of node not only can reflect present node (for example, computing capability and bandwidth ability), but also can reflect its resource capability of node on every side.The NodeRank value constructing virtual network mapping scheme of all utilizing node based on two kinds of virtual network mapping algorithm: RW-MaxMatch and the RW-BFS of the node resource measure of this topological perception, not only help the mapping of dummy node, and help the mapping of virtual link, be mapped to power thereby virtual network can be improved effectively, but this algorithm still can not be handled the virtual network request that dummy node has locational requirement at present.
At present, the research work of virtual network mapping mainly concentrates on the virtual network node studied in the fixed network environment and the mapping method of link, specially at the virtual network mapping research of mobile radio network environment also seldom.But along with popularizing of wireless network, the effect of wireless network in daily life and work is more and more important.Hold circuit network from MANET late to holding, traditional routing mode of setting up route before node sends data deepens continuously at the research work of mobile radio network environment to the transition process of the novel routing mode that store-carries-transmit.Therefore, the research work of the virtual network mapping method in the mobile environment has very important significance.
Summary of the invention
The present invention is mapped as target to realize the mobile environment virtual network, based on the physical network sub-clustering, solves mobile virtual network node and link maps problem.Specifically comprise:
1. carry out the Markov modeling according to each node motion rule, and according to the stability of link between this model evaluation node, accordingly physical network nodes is carried out sub-clustering.
2. use for reference NodeRank thought, and consider node location information, take all factors into consideration node computational resource, connect information, the priority of Computational Physics network node and virtual network node and ordering such as link bandwidth resource.Based on this, adopt greedy algorithm thought by bunch in mapping and bunch between the mapping dual mode realize the mapping of node and link.
Compared with prior art, innovation part of the present invention is: the physical network in the virtual network mapping problems is expanded to mobile wireless network from fixed network, the physical network sub-clustering is combined with the virtual network mapping, consider that on the NodeRank basis geographical location information carries out the virtual network mapping, effectively shield the influence that mapping produces to virtual network of bottom-layer network change in topology.Be embodied in:
1. at mobile network's characteristics, set up random walk model by the movement law at random to its node, and connect and disconnect in time probability distribution according to link between the historical information of node (as velocity magnitude and direction, once meet node etc.) the prediction node, distribute according to this and judge that node that characteristics of motion is close, the link retention time is long is divided into one group.And carry out clustering architecture and bunch member's maintenance.
2. consider the computational resource, bandwidth resources of physical node, the information such as duration that are connected with adjacent node, node is carried out prioritization.Adopt greedy algorithm, according to the scale of virtual network and to the requirement of resource, determine bunch in mapping between mapping still bunch.
Description of drawings
Fig. 1 is based on the mobile virtual network mapping method architecture of sub-clustering
Fig. 2 node relative motion situation
Fig. 3 node state machine
Embodiment
Consult Fig. 1 and Fig. 2, carry out the link stability assessment and accordingly physical network is carried out the sub-clustering processing according to the node motion rule, virtual network and physical network nodes are carried out the priority judgement, in carrying out bunch according to greedy algorithm thought and virtual network scale mapping and bunch between mapping, mainly comprise three phases in actual the enforcement.
1, link stability assessment
Thereby in order to simplify the essence that complicated network environment concentrates one's energy to study a question, during the link stability problem, the researcher supposes usually under considering mobile network environment:
(1) the wireless signal coverage of node is that radius is the circle of R.
(2) and if only if two nodes are all in the other side's signal cover the time, and link is communicated with between two nodes.
(3) simultaneously, in order to simplify the process of mathematical derivation, the researcher supposes that usually the signal cover of all nodes in the network is suitable.
Mathematical derivation result based on this can be applicable to more generally network environment through simple expansion.In addition, in order to catch the moving characteristic at random of node under the mobile network environment, the researcher has proposed random walk model.This model is widely adopted in recent years.The random walk model hypothesis:
(1) moving process at random of node is made up of some traveling time sections, and it is λ that the length of traveling time section is average
-1Exponential distribution;
(2) in the traveling time section, speed and the direction of node motion remain unchanged;
(3) speed of node is obeyed (0, v
Max) on even distribution;
(4) moving direction of node is obeyed the even distribution on (0,2 π).
Under mobile network environment, the link stability problem can general description be between node: suppose between two nodes at initial time t
0Distance be d
0, link is at (t between the calculating node
0, t
0+ t) continue the probability that is communicated with in the time period, be expressed as
Its estimation can be by T
k(t) and F (d
0, t) iteration realizes, wherein y
iBe by F (d
0, the t) y in the expression formula
iDefinition, T
k(t) and F (d
0, t) expression formula is as follows:
Wherein, T
k(t) be state-transition matrix, the predicted time section that expression is t for a given length, suppose that t is made up of (namely k+1 common traveling time section, relative velocity vector between node has taken place k time altogether and has changed in t), k 〉=1, n=┌ R/ ε ┐, R represents node radio communication radius, ε represents infinitesimal increment;
T
k(t) estimation can realize that wherein p (φ) occurs in the φ probability of second for the change of relative velocity between node by following formula; During k=0, T
0(t)=[1-F
φ(t)] T (t), F
φ(t)=Prob{ φ≤t}=1-e
-2 λ T, φ is that relative velocity changes the moment of taking place for the first time
I(d
0)＝{x
0,x
1,…,x
n}
Wherein, F (d
0, the t) distribution function of relative distance between common traveling time section postjunction of expression, namely initial distance is d between node
0Situation under, elapsed time length is behind t mobile at random, the relative distance between node is less than the probability of d, I (d
0) the expression initial state vector.
F wherein
d(d
0, t) can pass through F
d(d
0, d t) obtains, and the latter is illustrated in that initial distance is d between node
0Situation under, elapsed time length is that the relative distance between node is less than the probability of d behind t mobile at random, formula is as follows:
F
d(d
0,d,t)＝U(d-d
0)Φ
1(d
0,d,t)+U(d
0-d)Φ
2(d
0,d,t)
Wherein U (.) is standard gait function, and
F wherein
v() expression relative velocity distribution function,
Angle for relative velocity and x axle
F wherein
v() expression relative velocity distribution function, V represents relative velocity, θ obeys the even distribution on (0,2 π)
In order to calculate T
k(t) expression formula needs definition basic status transfer matrix
A wherein
Ij(t) be illustrated in the common traveling time section, from state S
iTransfer to S
jProbability, its expression formula is as follows:
2, cluster-dividing method
Under mobile network environment, target based on the sub-clustering algorithm of link stability is: select one group of node to become a bunch node in all nodes, this selection should guarantee that other node in the network constitutes (α with one bunch node at least, t) relation guarantees that namely this node remains the probability of connection greater than a certain threshold values α given in advance to the path between a bunch node in preset time in the t.
According to the probability theory multiplicative principle, can obtain the computational methods of path stability under the mobile network environment.If the path between node A and the node B is made up of n bar link.Make P (t) in time t, remain the probability of connection for this path, then
Wherein, A
k(d
k, t) be the stability of k bar link, d
kBe two nodes that the constitute k bar link distance at initial time.
In the process that clustering architecture forms, node all meet (α, t) condition around select in the node node of ID maximum to become bunch node of oneself.Simultaneously, in order to guarantee the convergence of algorithm in static network, algorithm is set D
MaxThe upper limit as the clustering architecture radius.Wherein, select node ID to determine the main cause of standard to be as bunch head, with other standard (as degree of connection, be node neighbours numbers) compare, node ID is not subjected to the network topology dynamic effects, thereby can as much as possible guarantee bunch status of a node, and then safeguard the stability of clustering architecture.
Sub-clustering algorithm based on link stability is made of three phases: in the Max inundation stage, Min inundation stage and a bunch member gather the stage.Max inundation stage and Min inundation stage, each was by D
MaxThe information exchange of taking turns in the jumping scope is formed.Wherein the Max inundation stage is elected a bunch node; The Min inundation stage is selected message in the announcement of all bunches head.At last, gather in the stage a bunch member, all nodes are judged affiliated bunch, thereby are gathered to a bunch node by analyzing the information of preceding two stages collection.
Consult Fig. 3, algorithm is that any node A defines four class states:
(1) loyal bunch member condition: if (α t) in Guan Xi all neighbouring nodes, has only bunch of head's node, then node A subordinate and this bunch head, and be in loyal state satisfying with node A.
(2) disloyalty bunch member condition: if (α t) in Guan Xi all neighbouring nodes, has a plurality of bunches of head's nodes, then node A subordinate and one of them bunch head, but be in the disloyalty state satisfying with node A.
(3) healthy bunch head's state: if node A is bunch head's node, and have at least a node to be loyal bunch member among its bunch member, then node A is in health status.
(4) dying bunch of head's state: if node A be bunch head's node, and its all bunches member all is in the disloyalty state, and then node A leader's bunch is redundancy bunch, and node A is in moribund condition.
In the maintenance process of clustering architecture, node is by heartbeat mechanism and neighbours' sharing information, grasp all and its satisfy (α, the t) information of Guan Xi neighbouring node and link, thereby build the localized network topology in this locality.According to the information of grasping, node periodically updates the state of oneself, and carries out corresponding actions according to the variation of state, thus Dynamic Maintenance and optimization clustering architecture.
In the process of state transition, being in bunch node of member status can only be to healthy bunch head's state transitions, namely for a bunch member, only under no selectable situation, just oneself can be promoted as a bunch head, thereby control following bunch of head's of mobile network environment number as far as possible.Because in mobile network's network of clustering architecture, the upper strata is reduced to operation to the network of being made up of bunch head to the operation of the whole network, so the number of controlling bunch head in the network is conducive to promote the overall performance of network.
Simultaneously, being in bunch node of head status can only be by dying bunch of head's state to a bunch member ground bit transition.As a transition state, dying bunch of head provides buffer time for redundant bunch member's disengaging, thereby prevents bunch head degradation and a large amount of bunches of members causing break away from the situation of network configuration suddenly, is conducive to guarantee the integrality of network.
3, shine upon based on the virtual network of clustering architecture
On the basis that the physical network sub-clustering is finished, when the virtual network request arrived, leader cluster node was simulated mapping according to bunch member's resource and link condition.Complete successfully the leader cluster node of simulation mapping at first, accept this virtual network request, and by other leader cluster nodes of message informing to prevent repeating mapping.If simulation mapping failure, so virtual network is divided into two essentially identical subnets of number of nodes, proceeds mapping, require to carry out subnet simultaneously and cut apart mapping afterwards, each bunch can only be accepted the request of subnet mapping at most, namely bunch between the mapping of virtual network.If still unsuccessful, so request is joined in the virtual network request queue of each bunch head, wait for and having shone upon after the virtual network cancellation, shine upon again.
The key step of algorithm is divided into 5, and is as follows:
Step 1 is as VNR(VN Request) when arriving, leader cluster node is at time period [t
0, t
0+ t
1] in, according to the demand of VNR bunch in simulate mapping.If success is then accepted this VNR, and notified other leader cluster nodes, enter step 2; If failure, mapping method between then starting bunch is at time period [t
0+ t
1, t
0+ t
1+ t
2] (t
0, t
1, t
2All greater than 0) in, VNR is cut apart, judge whether the subnet after cutting apart can successfully shine upon, perhaps receive that in this stage other leader cluster nodes are cut apart the message of shining upon VNR after, judge whether and can successfully shine upon; If become enough successfully mappings, repeating step 1 so; If still failure then is put into VNR virtual network request queue end, wait for that other have distributed virtual network to discharge resource and have shone upon again.
Step 2 leader cluster node calculates the NodeRank value of VNR node and carries out descending with this, forms VNodeProcessOrder.Then, leader cluster node travels through all bunches member, seeks the NodeRank value of node greater than bunch member of dummy node, forms available physical node listing PotentialNodeList, and descending sort.Traversal VNodeProcessOrder arranges dummy node sequence number i=0(i＜VNodeProcessOrder.size ()), enter step 3.
Step 3 leader cluster node is searched the maximum node of NodeRank value in available physical node listing PotentialNodeList, and dummy node i is mapped on this node, upgrade the physical network surplus resources of preserving in PotentialNodeList and bunch first node.If VNodeProcessOrder.size ()〉0, then enter step 2; Otherwise, enter step 4.
Step 5 judges whether VLinkProcessOrder is empty, if then VNR shines upon successfully; Otherwise turn to step 4.
Claims (6)
1. virtual network mapping method based on sub-clustering may further comprise the steps:
(1) under the situation that physical node moves at random, according to the characteristics of motion of Markov chain model prediction node, link is communicated with probability between computing node, and the more big explanation link stability of probable value is more good;
(2) carry out the physical network sub-clustering according to link stability situation between node, comprise clustering architecture formation and clustering architecture and safeguard two stages;
(3) on physical network sub-clustering basis, by bunch in mapping and bunch between the mapping dual mode carry out the mapping of dummy node and virtual link in the virtual network; If mapping failure in bunch is then carried out subnet to virtual network and divided, and subnet is shone upon at different bunches, namely bunch between mapping.
2. method according to claim 1, in the step (1), link is communicated with probability
Calculating be to pass through T
k(t) and F (d
0, t) iterative computation obtains, wherein y
iBe by F (d
0, the t) y in the expression formula
iDefinition, T
k(t) and F (d
0, t) expression formula is as follows:
Wherein, T
k(t) be state-transition matrix, the predicted time section that expression is t for a given length, suppose that t is made up of k+1 common traveling time section, namely, relative velocity vector between node has taken place k time altogether and has changed k 〉=1, n=┌ R/ ε ┐ in t, R represents node radio communication radius, and ε represents infinitesimal increment;
T
k(t) estimation can realize that wherein p (φ) occurs in the φ probability of second for the change of relative velocity between node by following formula; During k=0, T
0(t)=[1-F
φ(t)] T (t), F
φ(t)=Prob{ φ≤t}=1-e
-2 λ T, φ is that relative velocity changes the moment of taking place for the first time
I(d
0)＝{x
0,x
1,…,x
n}
Wherein, F (d
0, the t) distribution function of relative distance between common traveling time section postjunction of expression, namely initial distance is d between node
0Situation under, elapsed time length is behind t mobile at random, the relative distance between node is less than the probability of d, I (d
0) the expression initial state vector.
3. method according to claim 2, F
d(d
0, t) can pass through F
d(d
0, d t) obtains, and the latter is illustrated in that initial distance is d between node
0Situation under, elapsed time length is that the relative distance between node is less than the probability of d behind t mobile at random, formula is as follows:
F
d(d
0,d,t)＝U(d-d
0)Φ
1(d
0,d,t)+U(d
0-d)Φ
2(d
0,d,t)
Wherein U (.) is standard gait function, and
F wherein
v() expression relative velocity distribution function,
Angle for relative velocity and x axle
F wherein
v() expression relative velocity distribution function, V represents relative velocity, θ obeys the even distribution on (0,2 π).
4. method according to claim 3, in the process that clustering architecture forms, node all meet (α, t) condition around select the node of ID maximum to become an own bunch node in the node, in order to guarantee the convergence of algorithm in static network, algorithm setting D
MaxThe upper limit as the clustering architecture radius; Sub-clustering based on link stability is made of three phases: in the Max inundation stage, Min inundation stage and a bunch member gather the stage; Max inundation stage and Min inundation stage, each was by D
MaxThe information exchange of taking turns in the jumping scope is formed; Wherein the Max inundation stage is elected a bunch node; The Min inundation stage is selected message in the announcement of all bunches head, at last, gather in the stage a bunch member, and all nodes are judged affiliated bunch, thereby gathered to a bunch node by analyzing the information of preceding two stages collection.
5. method according to claim 4, on the basis that the physical network sub-clustering is finished, in the mapping process of virtual network is divided into bunch mapping process and bunch between mapping process; When the virtual network request arrived, leader cluster node was at first time period [t
0, t
0+ t
1] in attempt bunch in mapping, if failure, then at second time period [t
0+ t
1, t
0+ t
1+ t
2] in attempt bunch between mapping; If still failure then joins request queue with this virtual network request, wait for after having finished the mapping request discharges resource and attempting again; If shine upon successfully, then finish this mapping process.
6. method according to claim 5 in the mapping process, is at first carried out subnet to virtual network and is cut apart between bunch, and the virtual subnet after will cutting apart is distributed to different leader cluster nodes respectively, mapping process in be converted into bunch this moment.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2013100995388A CN103259744A (en) | 2013-03-26 | 2013-03-26 | Method for mapping mobile virtual network based on clustering |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2013100995388A CN103259744A (en) | 2013-03-26 | 2013-03-26 | Method for mapping mobile virtual network based on clustering |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103259744A true CN103259744A (en) | 2013-08-21 |
Family
ID=48963451
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2013100995388A Pending CN103259744A (en) | 2013-03-26 | 2013-03-26 | Method for mapping mobile virtual network based on clustering |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103259744A (en) |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103746894A (en) * | 2014-01-20 | 2014-04-23 | 电子科技大学 | Batch virtual network mapping method based on geographic position constraint |
| CN103873485A (en) * | 2014-04-03 | 2014-06-18 | 重庆邮电大学 | Cluster MAC protocol implementation method based on link duration time in vehicle-mounted self-organizing network |
| CN104065553A (en) * | 2014-06-30 | 2014-09-24 | 华为技术有限公司 | Virtual network migration method and related equipment |
| CN104516687A (en) * | 2014-12-22 | 2015-04-15 | 中国科学院信息工程研究所 | Windows remote mapping method for Linux block device |
| CN105207804A (en) * | 2015-08-18 | 2015-12-30 | 昆明理工大学 | Real-time evaluation method for service path stability |
| CN106572026A (en) * | 2016-10-28 | 2017-04-19 | 上海斐讯数据通信技术有限公司 | SDN-based load balancing method, device and system |
| CN106792919A (en) * | 2016-12-23 | 2017-05-31 | 西安电子科技大学 | Resource allocation methods based on equivalent capacity in wireless dummy net |
| CN110233763A (en) * | 2019-07-19 | 2019-09-13 | 重庆大学 | A kind of virtual network embedded mobile GIS based on Timing Difference study |
| CN111132079A (en) * | 2018-10-31 | 2020-05-08 | ***通信集团四川有限公司 | Method, device, equipment and medium for determining self-organizing network connection probability |
| CN111698703A (en) * | 2020-05-25 | 2020-09-22 | 国网河北省电力有限公司石家庄供电分公司 | Network reliability optimization method based on service priority and load balance |
| CN112019372A (en) * | 2020-06-23 | 2020-12-01 | 北京农业信息技术研究中心 | Vegetable wireless monitoring network topology virtualization control method and device |
| CN113163411A (en) * | 2021-05-14 | 2021-07-23 | 北京邮电大学 | Satellite network clustering method and device, electronic equipment and storage medium |
| CN114398430A (en) * | 2022-03-25 | 2022-04-26 | 清华大学深圳国际研究生院 | Complex network link prediction method based on multi-target mixed integer programming model |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010066430A1 (en) * | 2008-12-10 | 2010-06-17 | Nec Europe Ltd. | A method for operating at least one virtual network on a substrate network and a virtual network environment |
| CN102223281A (en) * | 2011-06-24 | 2011-10-19 | 清华大学 | Method for remapping resource demand dynamic change based on virtual network |
| CN102427420A (en) * | 2011-12-06 | 2012-04-25 | 北京航空航天大学 | Virtual network mapping method and device based on graph pattern matching |
-
2013
- 2013-03-26 CN CN2013100995388A patent/CN103259744A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010066430A1 (en) * | 2008-12-10 | 2010-06-17 | Nec Europe Ltd. | A method for operating at least one virtual network on a substrate network and a virtual network environment |
| CN102223281A (en) * | 2011-06-24 | 2011-10-19 | 清华大学 | Method for remapping resource demand dynamic change based on virtual network |
| CN102427420A (en) * | 2011-12-06 | 2012-04-25 | 北京航空航天大学 | Virtual network mapping method and device based on graph pattern matching |
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
| CN103873485A (en) * | 2014-04-03 | 2014-06-18 | 重庆邮电大学 | Cluster MAC protocol implementation method based on link duration time in vehicle-mounted self-organizing network |
| CN103873485B (en) * | 2014-04-03 | 2017-03-08 | 重庆邮电大学 | Cluster MAC protocol implementation method based on the link persistent period in vehicular ad hoc network |
| CN104065553A (en) * | 2014-06-30 | 2014-09-24 | 华为技术有限公司 | Virtual network migration method and related equipment |
| CN104516687A (en) * | 2014-12-22 | 2015-04-15 | 中国科学院信息工程研究所 | Windows remote mapping method for Linux block device |
| CN105207804A (en) * | 2015-08-18 | 2015-12-30 | 昆明理工大学 | Real-time evaluation method for service path stability |
| CN105207804B (en) * | 2015-08-18 | 2018-08-10 | 昆明理工大学 | A kind of real-time estimating method for service path stability |
| CN106572026A (en) * | 2016-10-28 | 2017-04-19 | 上海斐讯数据通信技术有限公司 | SDN-based load balancing method, device and system |
| CN106572026B (en) * | 2016-10-28 | 2020-04-10 | 上海斐讯数据通信技术有限公司 | SDN-based load balancing method, device and system |
| CN106792919A (en) * | 2016-12-23 | 2017-05-31 | 西安电子科技大学 | Resource allocation methods based on equivalent capacity in wireless dummy net |
| CN106792919B (en) * | 2016-12-23 | 2019-12-24 | 西安电子科技大学 | Equivalent capacity-based resource allocation method in wireless virtual network |
| CN111132079A (en) * | 2018-10-31 | 2020-05-08 | ***通信集团四川有限公司 | Method, device, equipment and medium for determining self-organizing network connection probability |
| CN110233763A (en) * | 2019-07-19 | 2019-09-13 | 重庆大学 | A kind of virtual network embedded mobile GIS based on Timing Difference study |
| CN110233763B (en) * | 2019-07-19 | 2021-06-18 | 重庆大学 | Virtual network embedding algorithm based on time sequence difference learning |
| CN111698703A (en) * | 2020-05-25 | 2020-09-22 | 国网河北省电力有限公司石家庄供电分公司 | Network reliability optimization method based on service priority and load balance |
| CN111698703B (en) * | 2020-05-25 | 2024-02-20 | 国网河北省电力有限公司石家庄供电分公司 | Network reliability optimization method based on service priority and load balancing |
| CN112019372A (en) * | 2020-06-23 | 2020-12-01 | 北京农业信息技术研究中心 | Vegetable wireless monitoring network topology virtualization control method and device |
| CN112019372B (en) * | 2020-06-23 | 2023-03-31 | 北京农业信息技术研究中心 | Vegetable wireless monitoring network topology virtualization control method and device |
| CN113163411A (en) * | 2021-05-14 | 2021-07-23 | 北京邮电大学 | Satellite network clustering method and device, electronic equipment and storage medium |
| CN113163411B (en) * | 2021-05-14 | 2022-06-17 | 北京邮电大学 | Satellite network clustering method and device, electronic equipment and storage medium |
| CN114398430A (en) * | 2022-03-25 | 2022-04-26 | 清华大学深圳国际研究生院 | Complex network link prediction method based on multi-target mixed integer programming model |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103259744A (en) | Method for mapping mobile virtual network based on clustering | |
| Stojmenovic | Fog computing: A cloud to the ground support for smart things and machine-to-machine networks | |
| Zhang et al. | A novel multicast routing method with minimum transmission for WSN of cloud computing service | |
| CN110247793B (en) | Application program deployment method in mobile edge cloud | |
| CN102149158B (en) | Method for fusing sensor grid data based on grid clustering | |
| Zhao et al. | A novel prediction-based temporal graph routing algorithm for software-defined vehicular networks | |
| CN103001875A (en) | Quantum cryptography network dynamic routing method | |
| CN105208616A (en) | Road topology based adaptive multi-copy routing method in vehicular ad hoc network | |
| CN102685255A (en) | Distributed opportunistic network community division method | |
| Chandrashekar et al. | Providing full connectivity in large ad-hoc networks by dynamic placement of aerial platforms | |
| CN105515987A (en) | SDN framework based virtual optical network oriented mapping method | |
| Lo et al. | Traffic‐aware routing protocol with cooperative coverage‐oriented information collection method for VANET | |
| CN104378229A (en) | Link prediction method for opportunity network | |
| CN101854695A (en) | Method for determining routing of wireless sensor network based on energy and delay ant colony optimization | |
| CN102065446B (en) | Topology control system and method orienting group mobile environment | |
| Xiong et al. | Energy-saving data aggregation for multi-UAV system | |
| CN105050095A (en) | Topology construction method for heterogeneous wireless sensor networks based on energy prediction | |
| Dash | Approximation algorithm for data gathering from mobile sensors | |
| Pasha et al. | Bug2 algorithm-based data fusion using mobile element for IoT-enabled wireless sensor networks | |
| CN102843301A (en) | Routing method for mobile delay tolerant network based on contact predication | |
| Al-Hamid et al. | Vehicular intelligence: Towards vehicular network digital-twin | |
| Maglaras et al. | Layered backpressure scheduling for delay reduction in ad hoc networks | |
| Saad et al. | Mdp-based vehicular network connectivity model for vcc management | |
| Liu et al. | A Position Sensitive Clustering Algorithm for VANET. | |
| Susan Shiny et al. | E2IA-HWSN: Energy Efficient Dual Intelligent Agents based Data Gathering and Emergency Event Delivery in Heterogeneous WSN Enabled IoT |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20130821 |