CN102355464B - Construction method of survivable Overlay network - Google Patents
Construction method of survivable Overlay network Download PDFInfo
- Publication number
- CN102355464B CN102355464B CN2011103050297A CN201110305029A CN102355464B CN 102355464 B CN102355464 B CN 102355464B CN 2011103050297 A CN2011103050297 A CN 2011103050297A CN 201110305029 A CN201110305029 A CN 201110305029A CN 102355464 B CN102355464 B CN 102355464B
- Authority
- CN
- China
- Prior art keywords
- path
- paths
- link
- overlay network
- business
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a construction method of a survivable Overlay network, which selects a plurality of paths meeting business needs for each node pair with path selection algorithm based on an overlapped punished thought, and classifies the paths into working paths and protective paths. Nodes and links in the working paths and the protective paths establish survivable Overlay level virtual topology for each node pair. Because the overlapped punishment thought is adopted, the working paths and the protective paths have great difference, so that the difference of paths in the Overlay network can be ensured, and the replacement success rate of the protective paths can be ensured after the network fails to work. Consequently, good mapping relationship is realized in networks on a business level and a bottom level with higher requirement on the reliability through the Overlay network, and the different paths provided in the Overlay network can ensure that when the network fails to work, the business can be quickly reversed into the transmission path meeting the quality of service (QoS) of the business, so that the survivability of the network is improved.
Description
Technical field
The present invention is mainly in order to improve the survivability of IP network, builds a kind of Overlay network that can provide survivability to guarantee by the routing algorithm with overlapping punishment thought, thus the enhanced IP survivability.
Background technology
Along with the development of communication network technology, various new business continue to bring out, and the demand of Internet Transmission has been proposed huge challenge.Traditional IP network of doing one's best can't guarantee the needed service of new type of service, thereby causes the QoS of business to be met, and the problem that rate can not be collected according to business occurs.And after breaking down, can't provide the Survivability Strategy of differentiated service in network.Existing network is when guaranteeing the QoS of survice demand, to reduce network survivability as cost.
Existing IP network itself does not have the survivability ability, and the service of service-oriented can not be provided, and the survivability mechanism of service-oriented more can not be provided, and the physical structure in IP network and physical topology can not at will be changed.In order to change this defective of IP network, need to build the Overlay network with different survival abilities on IP network infrastructure, make this Overlay network can strengthen the survivability of bottom-layer network, satisfy the request of different business.
Summary of the invention
Given this, main purpose of the present invention is to provide a kind of Overlay network establishing method with survivability of service-oriented, by QoS of survice come for each source-purpose between calculate many different transmission paths at the IP layer, consist of virtual topology, so just can build the Overlay network with different survival abilities on IP network infrastructure, satisfy the demand of different business.Can be with the path (primary path) of the best performance main transmission path as business in this Overlay network, other paths are as Protection path.If primary path goes wrong, system can start global protecting mechanism, switches the business to smoothly in the Protection path that satisfies business demand and transmits, thereby can strengthen survivability.
Overlay network establishing method with survivability of the present invention, comprised the steps: before the virtual link of structure Overlay layer, at first utilize in the topological structure of IP layer the Dijkstra shortest path first calculate source-purpose between optimal path, its mapping is become a virtual link; Then, punish for the link that appears on optimal path, recycle dijkstra's algorithm after completing and remove to continue to calculate sub-optimal path, if new-found path is not identical with the path of finding previously, continue the constructing virtual link and the link that occurs is punished, if identical with certain paths that finds previously, only link punished, and can not put it in the diverse path group; Then seek at last the Protection path that satisfies condition, until found the Protection path that specifies number, perhaps the penalty value in path is greater than certain value of making an appointment.So far, by above process can calculate this source-purpose between mulitpath, can consist of an Overlay network by the link in these paths and node, this Overlay network just can provide this source-purpose between communication guarantee.According to this thought just can all source-purposes between set up the Overlay network, guarantee the survivability of whole Network transmission.When if the link multiplicity of selected Protection path and original optimal path is higher; when original optimal path goes wrong; the probability that replacement path goes wrong also will improve greatly; thereby be unfavorable for switching of business, " detouring " path selection mechanism based on overlapping penalty of mentioning in the present invention can well be avoided this problem.
Preferably, the present invention also comprises the steps: to determine Link State, determines the time delay cost size on each link, start node and the destination node in the definite path that will look for, determine penalty factor size and payment method, and the path number that initialization is found at present is 0.
Preferably, wherein also comprise the steps: to utilize dijkstra's algorithm to calculate and prolong the most in short-term cost path in given topological diagram, and record shortest path length, in order to calculate the penalty factor of link.
Preferably, when calculating path, according to different qos parameters as metric.
Preferably, at first operation layer determines the qos parameter requirement of business according to the type of business, then correspondingly take out virtual topological structure.
Preferably, described qos parameter requires to be high delay requirement or low packet loss ratio requirement.
The present invention specifically also comprises:
The below concentrates this Path selection and is described:
Model description: G=(V, E), wherein V represents set of node, E represents link set.All there is the time delay cost of a broad sense corresponding with it for every in network link (i, j).Article one, source-purpose between the path, consist of { (i by a series of links
s, i
1), (i
1, i
2) ... (i
d-1, i
d).Time delay on this paths is exactly the algebraical sum of the time delay on all links.
Definition 1 path of rationally detouring: a non-original path, if it not only has some other attributes such as acceptable time delay, and there is larger difference on link, the path of reasonably detouring of the original path of just being known as with selected original path.
The s-that defines 2 paths is similar: if the ratio of the number of links that certain can detour path k and original path the are shared number of links total with it is s, just claim that this path of detouring is similar to original path s-.
The d-that defines 3 time delays is similar: if the ratio of the overall delay of the overall delay of certain the path k that can detour and original path is d, just claim that this path of detouring is similar to original path d-.
K bar Rational Path for selecting to satisfy above definition, need to satisfy following constraints:
s.t
Wherein symbolic interpretation is as follows:
d
ij: the cost (can be time delay, bandwidth, packet loss etc.) of expression from node i to link node j;
K: the new path number that produces of expression;
L: the path number that expression has identified;
d
max: the maximum cost upper limit that the expression business can bear;
D: the higher limit of cost ratio between the diverse path that expression is found and shortest path;
d
s: the cost of expression shortest path;
S: the upper limit of the ratio of total link number in the link that the K bar diverse path that expression is found and shortest path are shared and the shortest K paths;
N
k: the link number that comprises in the K bar diverse path that expression is found.
In above-mentioned constraints, last conditional shows, for source point, Duos one from the limit number that it flows out than the limit number that flows into it, and for terminal point, just in time opposite.For the point of all the other non-source points and terminal point in the non-directed graph of having the right, flow out and the limit number that flows into is identical from their.
For finding the solution the Path Selection that satisfies above-mentioned constraints, it is a very loaded down with trivial details and complicated process.Adopting a kind of heuristic---overlapping penalty solves this problem.The specific implementation step is as follows:
Step1: program begins, and determines Link State, determines the time delay cost size on each link, and start node and the destination node in the definite path that will look for determine penalty factor size and payment method, and the path number that initialization is found at present are 0;
Step2: utilize dijkstra's algorithm to calculate and prolong the most in short-term cost path in given topological diagram, and record shortest path length, for after calculate the penalty factor of link;
Step3: calculate the time delay cost of link, judge that whether it surpasses the allowed maximum delay value delay_Value of business, if surpass, forwards Step8 to, otherwise forwards Step4 to;
Step4: pre-define punitive measures for the link in current path;
Specifically: the broad sense time delay cost of upgrading all k paths with following replicative function:
Use following form for overlapping penalty:
The meaning of penalty is that the number of times that appears in Rational Path when a link is more, and the possibility that this link is used again is just less.The size of overlapping punishment parameter has determined repeating the strength of punishment of link.Wherein parameter declaration is as follows:
Gd: expression broad sense cost;
P
k: the K paths that expression has been identified;
f(P
1, P
2... P
k): the overlapping penalty that the expression link cost upgrades;
δ: represent overlapping punishment parameter;
d
s: the expression starting point is to the minimum cost of terminating point;
β: the current number of times that has been used of expression link e.
Step5: judge whether current path is not identical with all paths of finding before this, if not, get back to Step2, otherwise forward Step6 to;
Step6: the diverse path array is put in new-found path, and the path counter that will find at present adds 1;
Step7: whether the path counter value that judgement is found at present reaches the value that requires in advance, if reach, forwards Step8 to, otherwise forwards Step2 to;
Step8: quit a program, the path that output is found at present and corresponding broad sense time delay cost.
The diverse path selection algorithm that the present invention uses based on overlapping punishment thought is that each node is to setting up operating path and many corresponding Protection paths in the IP physical network; avoided the multiplicity between operating path and Protection path; consist of the Overlay network by the link in these paths and node; path switching when implementing network and break down by this Overlay network; the situation of having avoided operating path and Protection path to lose efficacy simultaneously, thus business can be improved to the survivability demand.
Description of drawings
The network architecture that Fig. 1 sets up for using this method;
Fig. 2 is the Overlay layer virtual topology that IP based network is constructed the high business of real-time;
Fig. 3 is the multipath selection algorithm flow chart based on overlapping punishment thought;
Fig. 4 is the application example based on the multi-path algorithm of overlapping punishment thought;
Fig. 5 is that node 1 is to the survivability Overlay network topology construction process of node 7;
Fig. 6 is the virtual topology structure at the Overlay layer that finally produces 5 from node 3 to node;
Fig. 7 is the network topology structure schematic diagram that uses in emulation experiment.
Embodiment
For making purpose of the present invention, technical scheme and advantage clearer, below in conjunction with the drawings and specific embodiments, the present invention is elaborated further.
Fig. 1 is for using the network architecture that in the present invention, institute's extracting method is set up, this Overlay network topology not only can provide certain survivability attribute, also make the Overlay layer to have the ability of differentiated service, having overcome traditional IP can't provide shortcoming towards specific transactions.According to shown in Figure 1, at first operation layer determines the parameters such as QoS (time delay, the packet loss etc.) demand of business according to the type of business; Then correspondingly take out virtual topological structure, make the Overlay network of structure have good survivability, every kind of Overlay has different survivability quality, as recovery rate, recovery time and resource utilization etc., to satisfy the QoS demand of different business.
Fig. 2 is the Overlay layer virtual topology that IP based network is constructed the high business of real-time, algorithm that the present invention carries is applicable to the business that file transfer etc. is had relatively high expectations to packet loss, when the Routing Algorithm that adopts other builds Overlay, can support different service request.As shown in Figure 2; in order to support the demand of the higher business of delay requirement to survivability; build in the process of the Overlay with survivability ability at abstract virtual topology; with virtual topology be created as ring topology (this ring topology can regard as by source-purpose between two incoherent paths consist of); when certain in network link or node break down; just can start the wrap protection based on ring; can switch the business to fast on reverse ring (another paths), satisfy business to the requirement of time delay.
Fig. 3 is the multipath selection algorithm flow chart based on overlapping punishment thought, and its concrete handling process is as follows:
Step1: program begins, and determines Link State, determines the time delay cost size on each link, and definite start node and the destination node that will look for the path determine penalty factor size and payment method, and the path number that initialization is found at present is 0;
Step2: utilize dijkstra's algorithm to calculate and prolong the most in short-term cost path in given topological diagram, and record shortest path length, for after calculate the penalty factor of link;
Step3: calculate the time delay cost of link, judge that whether it surpasses the allowed maximum delay value delay_Value of business, if surpass, forwards step 8 to, otherwise forwards step 4 to;
Step4: pre-define punitive measures for the link in current path;
Specifically: the broad sense time delay cost of upgrading all k paths with following replicative function:
Use following form for overlapping penalty:
The meaning of penalty is that the number of times that appears in Rational Path when a link is more, and the possibility that this link is used again is just less.The size of overlapping punishment parameter has determined repeating the strength of punishment of link.
Step5: judge whether current path is not identical with all paths of finding before this, if not, get back to Step2, otherwise forward Step6 to;
Step6: the diverse path array is put in new-found path, and the path counter that will find at present adds 1;
Step7: whether the path counter value that judgement is found at present reaches the value that requires in advance, if reach, forwards step 8 to, otherwise forwards Step2 to;
Step8: quit a program, the path that output is found at present and corresponding broad sense time delay cost.
Fig. 4 is the application example based on the multi-path algorithm of overlapping punishment thought, and the present invention verifies the algorithm of carrying with this network model.Shown in parameter list 1 during this network model initialization.
Table 1 is based on the initiation parameter table of the multi-path algorithm of overlapping punishment thought
| Parameter name | Symbol | Initial value | |
| Start node | source | 1 | |
| | terminal | 7 | |
| The link number that needs | path_num | 3 | |
| The penalty factor size | δ | 2.0 | |
| The business maximum delay value | delay_Value | 15.0 |
Fig. 5 is the survivability Overlay network topology construction process that in network topology shown in Figure 4, node 1 arrives node 7.The specific implementation process is: in the Overlay virtual topology configuration process that generates after node 7 routing first at node 1, at first obtaining shortest path by the Dijkstra shortest-path rout ing algorithms is＜1,2,7〉and, the shortest path value is 5.0+4.0=9.0; Then the time delay of link 1-2 and 2-7 is punished, this moment, their time delay cost became respectively 5.0 * (1+2.0/9.0) ≈ 6.1 and 4.0 * (1+2.0/9.0) ≈ 4.9.Owing to being much to seek predefined two paths, therefore continue circulation.The virtual topology structure of so far Overlay layer generation is as shown in Fig. 5 (a).The shortest path that finds for the second time is＜Isosorbide-5-Nitrae, 5,7 〉, the shortest path value is 2.0+3.0+5.0=10.0, this time delay value does not surpass business maximum delay value 15.0.Because does not repeat in it and the path of finding for the first time, so put it in the diverse path array, afterwards for wherein link 1-4,4-5 and 5-7 punish, their time delay cost becomes respectively 2.0 * (1+2.0/9.0) ≈ 2.4,3.0 * (1+2.0/9.0) ≈ 3.7 and 5.0 * (1+2.0/9.0) ≈ 6.1.This moment from node 1 to node 7 through the virtual topology structure of Overlay layer of generation routing for the second time after as shown in Fig. 5 (b), owing to only finding two paths, still do not satisfy pre-conditioned, so again enter circulation; The path of finding for the third time is＜1,3,6,2,7 〉, the shortest path value is 3.0+2.0+1.0+4.9=10.9, this time delay value does not surpass business maximum delay value 15.0; Because it does not still repeat with the path of front twice, so put it in the diverse path array, still path is wherein punished afterwards.Reached predefined requirement owing to having found 3 IP layer paths this moment, therefore withdraws from circulation.Just consisted of from node 1 to node the virtual topology structure of the final Overlay layer that produces 7 by above 3 paths that calculate, as shown in Fig. 5 (c).As construct the virtual topology configuration process 7 from node 1 to node, can produce corresponding virtual topology for other node in network to only needing to revise corresponding initial condition.
Fig. 6 is under identical initial condition, and in the node 3 virtual topology structure to structure between node 5, three paths of wherein selecting at the IP layer are respectively＜3 based on the diverse path selection algorithm in the present invention, Isosorbide-5-Nitrae, 5 〉,＜3,6,2,7,5〉and＜3,6,2,4,5.
Fig. 7 is in order to verify reasonability of the present invention, the topology diagram that adopts in emulation.This topological diagram comprises 10 nodes, and its initial condition is as shown in table 2:
Initial parameter in table 2 emulation experiment topology diagram
| Parameter name | Symbol | Initial value | |
| Start node | source | 1 | |
| | terminal | 10 | |
| The link number that needs | path_num | 10 | |
| The penalty factor size | δ | 2.0 | |
| The business maximum delay value | delay_Value | 200 | |
| The largest random value in the path delay of time | ran_max | 20 |
Mainly follow following thinking in simulation process: 1) IP layer physical link state carried out initialization, determine the start node in required path, the path number of destination node and required searching; 2) chain-circuit time delay is carried out randomization, make it obey random evenly distribution; 3) according to the present invention, routing algorithm is found the solution qualified diverse path; 4) for the diverse path calculating path similarity that finds and the query time of replacement path; 5) according to similarity of paths and path query time, in identical topological structure, the performance of algorithm and K shortest path first in comparative analysis the present invention.
For carry out mentioning in the present invention based on the path selection mechanism of overlapping penalty and the comparison of K shortest path algorithm, defined these two concepts of similarity of paths and path searching time.
(1) similarity of paths
Definition: similarity of paths refers to the diverse path that satisfies condition for all, the link number summation that they repeat each other.
The initial path similarity is 0, each link begins from optimal path, and it and each link in the path found are thereafter compared, and if the same similarity adds 1, otherwise continue relatively, until each link in all paths of finding is all traveled through.
(2) query time of replacement path
Definition: the path query time refers to for article one link in optimal path, if it breaks down, begins to find the needed number of times of searching of effective replacement path from the second path.Use the same method afterwards and calculate other links in optimal path, the number of times of searching of all links in optimal path is averaged.
Describe according to similarity of paths and the definition of path query time, as can be known similarity of paths embodied source-purpose between the similarity degree of all diverse paths, this is worth, and more the difference between the bright diverse path of novel is larger, the duplicate paths number is fewer, thereby after optimal path breaks down, this fault is less for the possibility of other Path generation impacts, finds the reliability of alternative route higher; Otherwise, find the reliability of replacement path lower.And the path query time has embodied after optimal path breaks down, and other paths substitute its validity.The less explanation of this value finds that the speed of alternative route is fast and cost that alternative route that find spends is also lower, and validity is higher; Otherwise, find the cost of alternative route time length and cost high.Based on above analysis, the present invention mainly comes the evaluation path choice algorithm with these two indexs, thereby can learn the constructed performance with survivability Overlay network.
Table 3 and table 4 are respectively in operation the present invention routing algorithm and K shortest path first each 10 times, and 100 times, similarity of paths and the comparative result of path query time in the time of 1000 times.By test result as can be known in the present invention routing algorithm in the superiority that has aspect similarity of paths with respect to the K shortest path first, because after having used overlapping penalty, make the weights of the link that has used be punished, therefore selected probability reduces greatly in the process of path computing next time, therefore similarity of paths is just smaller comparatively speaking, is conducive to satisfy business demand.At path query aspect the time, with respect to the K shortest path first, what emphasize due to algorithm of the present invention is to calculate the Performance Ratio rationally path of (being that performance is in close proximity to primary path), therefore in the Rational Path query script, also embody certain superiority, namely in the shorter time, the corresponding Rational Path that just can search.Interstitial content is increased to 20 from 10 in bottom IP network topology, and link circuit condition is when more complicated, and the superiority of similarity of paths and query time is more obvious.
Two kinds of algorithms of table 3 operation each 10 times, 100 times, similarity of paths comparative result in the time of 1000 times.
Two kinds of algorithms of table 4 operation each 10 times, 100 times, query time comparative result in path in the time of 1000 times.
Claims (6)
1. the Overlay network establishing method with survivability, is characterized in that, comprises the steps:
1) utilize in the topological structure of IP layer the Dijkstra shortest path first calculate source-purpose between optimal path, its mapping is become a virtual link;
2) punish for the link that appears on optimal path;
3) utilize dijkstra's algorithm to remove to continue to calculate sub-optimal path, if new-found path is not identical with the path of finding previously, continue the constructing virtual link and the link that occurs is punished, if identical with certain paths that finds previously, only link is punished, and can not put it in the diverse path group;
4) then seek the Protection path that satisfies condition, until found the Protection path that specifies number, perhaps the penalty value in path is greater than certain value of making an appointment;
5) by above process can calculate this source-purpose between mulitpath, can consist of an Overlay network by the link in these paths and node;
6) when breaking down in network; many the Protection paths that the node of finding fault only need to be in the Overlay network that builds finds between the node of the described discovery fault of inquiry and destination node in advance are until select the Protection path that can satisfy business demand.
2. Overlay network establishing method according to claim 1, it is characterized in that, also comprise the steps: to determine Link State in described step 1), determine the time delay cost size on each link, the start node in the definite path that will look for and destination node, determine penalty factor size and payment method, and the path number that initialization is found at present is 0.
3. Overlay network establishing method according to claim 2, is characterized in that, utilizes dijkstra's algorithm to calculate and prolong the most in short-term cost path in given topological diagram, and record shortest path length, is used for calculating the penalty factor of link.
4. Overlay network establishing method according to claim 1, is characterized in that, when calculating path, according to different qos parameters as metric.
5. Overlay network establishing method according to claim 1, is characterized in that, at first operation layer determines the qos parameter requirement of business according to the type of business, then correspondingly take out virtual topological structure.
6. Overlay network establishing method according to claim 5, is characterized in that, described qos parameter requires to be high delay requirement or low packet loss ratio requirement.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011103050297A CN102355464B (en) | 2011-10-10 | 2011-10-10 | Construction method of survivable Overlay network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011103050297A CN102355464B (en) | 2011-10-10 | 2011-10-10 | Construction method of survivable Overlay network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102355464A CN102355464A (en) | 2012-02-15 |
| CN102355464B true CN102355464B (en) | 2013-11-06 |
Family
ID=45578959
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011103050297A Expired - Fee Related CN102355464B (en) | 2011-10-10 | 2011-10-10 | Construction method of survivable Overlay network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102355464B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104579775B (en) * | 2015-01-05 | 2017-12-01 | 国家电网公司 | A kind of power telecom network optical fiber and optical transmission device resource allocation method and equipment |
| CN105207850B (en) * | 2015-09-29 | 2018-07-27 | 国网冀北电力有限公司信息通信分公司 | A kind of network connectivty test method and system |
| CN107329839A (en) * | 2017-06-05 | 2017-11-07 | 芯海科技（深圳）股份有限公司 | A kind of method that linker quickly carries out Overlay |
| CN109547876A (en) * | 2018-12-29 | 2019-03-29 | 重庆邮电大学 | A kind of adaptive guard rank method under elastic optical network twin failure |
| CN110519165B (en) * | 2019-08-23 | 2021-09-07 | 南京邮电大学 | Unicast protection method based on segmented nodes |
| CN117715154A (en) * | 2022-09-06 | 2024-03-15 | 维沃移动通信有限公司 | Network selection method and device and terminal |
| CN115514657B (en) * | 2022-11-15 | 2023-03-24 | 阿里云计算有限公司 | Network modeling method, network problem analysis method and related equipment |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101409648A (en) * | 2008-11-13 | 2009-04-15 | 电子科技大学 | Method for locating node fault and link fault of Overlay network |
| CN101515886A (en) * | 2008-11-07 | 2009-08-26 | 西安交通大学 | Multi-domain optical network survivability method based on identification of reliable service |
| CN101651620A (en) * | 2009-07-03 | 2010-02-17 | 中科华核电技术研究院有限公司 | Method for reconstructing Overlay multicast tree, multicast tree node and multicast tree system |
| CN101873271A (en) * | 2010-06-29 | 2010-10-27 | 西安交通大学 | Business-driven cross-layer survivability method in multilayer network |
| CN102026051A (en) * | 2010-12-13 | 2011-04-20 | 西安交通大学 | Layered virtual topology-based cross-granularity layer survivability method |
-
2011
- 2011-10-10 CN CN2011103050297A patent/CN102355464B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101515886A (en) * | 2008-11-07 | 2009-08-26 | 西安交通大学 | Multi-domain optical network survivability method based on identification of reliable service |
| CN101409648A (en) * | 2008-11-13 | 2009-04-15 | 电子科技大学 | Method for locating node fault and link fault of Overlay network |
| CN101651620A (en) * | 2009-07-03 | 2010-02-17 | 中科华核电技术研究院有限公司 | Method for reconstructing Overlay multicast tree, multicast tree node and multicast tree system |
| CN101873271A (en) * | 2010-06-29 | 2010-10-27 | 西安交通大学 | Business-driven cross-layer survivability method in multilayer network |
| CN102026051A (en) * | 2010-12-13 | 2011-04-20 | 西安交通大学 | Layered virtual topology-based cross-granularity layer survivability method |
Non-Patent Citations (3)
| Title |
|---|
| 刘荣慧.《基于Overlay网络的QoS问题研究》.《中国优秀硕士学位论文全文数据库（电子期刊）》.2009,全文. * |
| 武照东.《基于Overlay网络的多层网络生存性研究》.《中国优秀硕士学位论文全文数据库(电子期刊)》.2009,全文. * |
| 赵季红，马文涛，王力，唐睿.《具有生存性的Overlay网络构建方法》.《计算机应用研究，Application Research of Computers》.2012,第29卷(第10期),全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102355464A (en) | 2012-02-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102355464B (en) | Construction method of survivable Overlay network | |
| US8897141B2 (en) | Network system and routing method | |
| CN104104718B (en) | User autonomous routing customization system based on software-defined network | |
| TWI521924B (en) | Automated traffic engineering for multi-protocol label switching (mpls) with link utilization as feedback into the tie-breaking mechanism | |
| TWI493926B (en) | Automated traffic engineering for fat tree networks | |
| CN103098420B (en) | Traffic engineered as the automation of the 802.1AQ breaking the feedback in mechanism to draw based on use link utilization | |
| CN101483610B (en) | Route updating method for link state routing protocol | |
| CN103348639B (en) | Routing resource and Control Server | |
| CN101562568B (en) | Method and device for generating alternate routes of coverage network | |
| CN103139069B (en) | Based on the communication network method for routing of many metric parameter of analytic hierarchy process (AHP) | |
| CN113347102B (en) | SDN link surviving method, storage medium and system based on Q-learning | |
| CN102546440B (en) | Routing and wavelength assignment method and system | |
| Naderi et al. | Evaluation MCDM multi-disjoint paths selection algorithms using fuzzy-copeland ranking method | |
| CN107360612A (en) | A kind of data transmission method of the wireless sensor network based on ant colony multipath | |
| CN101753462B (en) | Method and device for realizing multi-next-hop routes | |
| CN110661704B (en) | Calculation method of forwarding path and SDN controller | |
| CN103532861B (en) | In territory based on spanning tree, Dynamic Multi-Pathing generates method | |
| Oommen et al. | Routing Bandwidth-Guaranteed paths in MPLS traffic engineering: A multiple race track learning approach | |
| CN102394768B (en) | A kind of tunnel path re-optimization method and device | |
| WO2012137501A1 (en) | Control server, network control method, and program | |
| WO2012103852A2 (en) | Method and device for wavelength-division multiplexing network planning | |
| CN101385285A (en) | Method for iterative routing with the aid of a path-dependent routing metric | |
| JP5427964B1 (en) | Path recovery control device and path recovery control program | |
| CN103763191B (en) | Intra-domain multipath generating method based on spanning tree | |
| CN105306367A (en) | A method of communicating information over a network and a system for communicating information over a network |
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: 20131106 Termination date: 20161010 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |