CN101072241A - Method and device for improving shortest path bridge reliability - Google Patents
Method and device for improving shortest path bridge reliability Download PDFInfo
- Publication number
- CN101072241A CN101072241A CNA2006100783543A CN200610078354A CN101072241A CN 101072241 A CN101072241 A CN 101072241A CN A2006100783543 A CNA2006100783543 A CN A2006100783543A CN 200610078354 A CN200610078354 A CN 200610078354A CN 101072241 A CN101072241 A CN 101072241A
- Authority
- CN
- China
- Prior art keywords
- path
- shortest path
- backup
- paths
- shortest
- 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
- 238000000034 method Methods 0.000 title claims description 41
- 230000008569 process Effects 0.000 claims description 21
- 238000012545 processing Methods 0.000 claims description 10
- 238000012216 screening Methods 0.000 claims description 3
- 230000000717 retained effect Effects 0.000 claims description 2
- 230000005540 biological transmission Effects 0.000 abstract description 6
- 230000004907 flux Effects 0.000 abstract 1
- 238000004364 calculation method Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 2
- 238000002955 isolation Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 230000002457 bidirectional effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/22—Alternate routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention includes main steps: first, based on intermediate system to intermediate system (IS-IS) protocol to calculate other routes corresponding to shortest route between two determined end nodes; then, selecting one route from the said other routes as backup route for the shortest route. Thus, when fault of the shortest route or fault from nodes occurs, the invention can switch the shortest route to the backup route rapidly so as to reduce influence on flux by fault. The invention guarantees reliability of network transmission, and raises network performance.
Description
Technical Field
The invention relates to the technical field of network communication, in particular to a path backup processing technology.
Background
The two-layer bridge is the most commonly used device in the local area networking, and has the advantages of simple configuration and plug and play. The characteristic of adding VLAN (virtual local area network) in the traditional bridge device can enhance the isolation and forwarding efficiency of data and limit the broadcast domain although bringing some configuration workload.
In order to avoid the occurrence of loops in the two-layer bridge, the solution is to select a root node by using STP (Spanning tree protocol) to form a forwarding tree, so as to ensure that each node in the domain can communicate with each other through the forwarding tree. In the STP protocol, it is possible to ensure that no loop exists in the forwarding tree by the STP protocol in a stable state since a path that may form a loop is already blocked.
When the network topology changes, the spanning tree needs to be recalculated according to the STP, resulting in slow convergence time. For this purpose, an improved STP protocol, RSTP (Rapid Spanning tree protocol) may be used to speed up Spanning tree convergence time. When STP is used in different VLAN fields, MSTP (Multiple Spanning Tree Protocol) is established to increase the link utilization and enhance the traffic transfer isolation between VLANs.
The STP/RSTP/MSTP protocol selects a root node by using rules defined by the STP/RSTP/MSTP protocol within a certain forwarding bridge range, blocks a channel which possibly forms a loop and forms a forwarding tree based on the root node. Obviously, this process provided by the STP/RSTP/MSTP protocol makes forwarding paths between non-root nodes less than optimal.
In order to solve the problem that a forwarding path between non-root nodes is not an optimal path, an implementation scheme based on an IGP (interior gateway protocol) routing protocol is currently adopted.
In the processing scheme for implementing the shortest path bridge based on the IGP routing protocol, since the IS-IS (Intermediate System to Intermediate System) IS a routing protocol developed based on the link layer and can be applied to the two-layer bridge network relatively conveniently, it IS proposed to calculate the optimal forwarding path by extending the IS-IS protocol and using the topology information of the two-layer bridge network.
That IS, an IGP routing protocol IS run in the two-layer bridge network, and the IS-IS used as the shortest path protocol to determine the shortest path between nodes through the two-layer link information calculation in the bridge network.
The shortest path bridge IS calculated based on the IS-IS link protocol and IS realized by adopting topology information of a two-layer network, namely the shortest path IS calculated in the bridge network through the two-layer link information. In the implementation, it IS necessary to distinguish the two-layer network IS-IS instance from the IP layer IS-IS instance, and it may be distinguished by different multicast addresses or special IS-IS Area addresses. At present, a corresponding message forwarding mechanism IS provided based on the IS-IS shortest path, and the problem of forwarding loops IS solved.
However, no fast recovery handling mechanism when the shortest path fails or the working node fails is considered in the above implementation. Therefore, if a fault occurs, the path needs to be recalculated by the IS-IS protocol by using the topology information of the two-layer network, which leads to slow aggregation time, and will have a large influence on the flow and reduce the network transmission performance.
Disclosure of Invention
The invention aims to provide a method and a device for improving the reliability of a shortest path bridge, so as to provide a corresponding path backup function for the shortest path bridge acquired based on an IGP protocol and further improve the reliability of network transmission.
The purpose of the invention is realized by the following technical scheme:
the invention provides a method for improving the reliability of a shortest path bridge, which comprises the following steps:
A. calculating and determining other paths existing between two end nodes corresponding to the shortest path between the nodes based on an IS-IS protocol from the intermediate system to the intermediate system;
B. and selecting at least one backup path as the shortest path from the other paths.
The method further comprises the following steps:
C. in the process of calculating the shortest path based on the IS-IS protocol, the step A IS executed;
or,
D. after the process of calculating the shortest path based on the IS-IS protocol IS finished, when a predetermined condition IS met, the step a IS executed.
The step C comprises the following steps:
and in the process of calculating the shortest path based on the IS-IS protocol, retaining the non-shortest path record information, and determining other paths between the two end nodes according to the retained non-shortest path record information.
The predetermined conditions include: and determining condition information according to the occupation condition of CPU and/or memory resources in the system.
The step B comprises the following steps:
and removing paths containing nodes or links in the shortest path in the other paths, and determining at least one backup path corresponding to the shortest path in the rest paths.
The method further comprises the following steps:
and saving the shortest path information of the node in the nodes at the two ends in the shortest path through forwarding table information or a separate table entry.
In step B, the process of determining at least one backup path includes:
and B1, selecting the corresponding backup path by adopting a preset backup path selection strategy which can ensure the symmetry of the backup path.
The step B1 includes:
in the process of selecting the backup path, when two paths with the same cost appear, the path where the node with the small node number is located is selected as the backup path according to the size of the node number configured in advance.
The method further comprises the following steps:
when the shortest path has a fault, switching to a backup path corresponding to the shortest path.
The invention also provides a device for improving the reliability of the shortest path bridge, which comprises a selectable path determining unit and a backup path determining unit arranged in the network equipment, wherein:
the optional path determining unit IS used for calculating and determining other paths existing between two end nodes corresponding to the shortest path between the nodes based on the IS-IS protocol;
and the backup path determining unit is used for selecting at least one backup path as the shortest path from the other paths.
The backup path determining unit includes:
a path screening unit, configured to remove paths including nodes or links in the shortest path from the other paths to obtain screened remaining paths;
and the backup path selection unit is used for selecting at least one backup path corresponding to the determined shortest path from the rest paths.
The backup path determining unit comprises a backup path symmetry control unit for controlling the selection of the corresponding backup path by adopting a preset backup path selection strategy capable of ensuring the symmetry of the backup path.
The backup path symmetry control unit is specifically configured to, when two paths with the same cost appear, select a path where a node with a small number is located as a backup path of the shortest path according to the size of a preconfigured node number.
The device further comprises:
and the path protection processing unit is used for switching to a backup path corresponding to the shortest path when the shortest path fails.
The technical scheme provided by the invention can be seen that in the process of topology information based on a two-layer bridge network, the shortest path IS calculated by utilizing an IS-IS protocol, and one or more backup paths are reserved for the shortest path, so that when the shortest path fails or nodes fail, the shortest path can be quickly switched to the backup paths, thereby reducing the influence of the failure on the flow, effectively ensuring the reliability of network transmission and improving the network performance.
Drawings
FIG. 1 is a schematic diagram of a specific implementation process of the method of the present invention;
FIG. 2 is a schematic diagram of a network topology requiring selection of a backup path;
fig. 3 is a schematic diagram of a specific implementation structure of the device according to the present invention.
Detailed Description
The core of the invention IS that when IS-IS IS used as the shortest path calculation protocol, the corresponding backup path can be determined for the shortest path, thereby realizing the corresponding path backup function.
Specifically, the specific implementation process of the present invention includes:
(1) firstly, in the process of calculating the shortest path based on the IS-IS protocol or after the processing of calculating the shortest path based on the IS-IS protocol IS finished, calculating and determining that other paths which can be used as backup paths exist between two end nodes corresponding to the shortest path between the nodes based on the IS-IS protocol;
(2) then, selecting at least one backup path as the shortest path from the other paths, specifically including:
a judgment condition for selecting a backup path is required according to whether a node or a link exists on the shortest path, namely, paths including nodes or links in the shortest path in the other paths are removed, and at least one backup path corresponding to the shortest path is determined in the rest paths;
in addition, in the invention, a preset backup path selection strategy capable of ensuring the symmetry of the backup path is required to be adopted to select the corresponding backup path; for example, when an equivalent path exists in the backup path determining process, the size of the node number may be used as an enhanced judgment condition for backup path selection, that is, a path where a node with a small number is located may be selected as a backup path of a shortest path according to the size of the node number included in each of the selectable paths, so as to ensure symmetry of the backup path; of course, other strategies for selecting backup paths may be employed to ensure symmetry of the backup paths.
(3) After the backup path of the shortest path is determined, when the shortest path can not transmit information due to the reasons of failure and the like, transmitting the information through the backup path corresponding to the shortest path; in addition, the backup path can also be used in other aspects such as load sharing to improve network performance.
For the purpose of promoting a further understanding of the invention, reference will now be made in detail to specific embodiments thereof, which are illustrated in the accompanying drawings.
As shown in fig. 1, the calculation processing procedure of the shortest path backup path in the routing bridge provided by the present invention, that IS, implementing the backup path routing processing in the two-layer bridge network by using the IS-IS protocol specifically includes:
step 11: when the shortest path IS calculated based on the IS-IS protocol, a backup path corresponding to the shortest path IS determined at the same time;
of course, it is also possible to start executing step 12 under other conditions, such as after the shortest path calculation is finished or when a predetermined condition is met; that is, the backup path calculation process may be started at the same time as the shortest path is calculated, or may be started separately.
Step 12: calculating the shortest path according to an SPF (shortest path first) algorithm, and reserving non-shortest path record information in the calculation process, thereby obtaining other paths between two end points of the shortest path as optional backup paths of the shortest path;
step 13: judging whether a path containing a node or a link of the shortest path exists in the optional backup paths, if so, executing a step 14, otherwise, executing a step 15;
step 14: excluding the corresponding optional backup paths, i.e. removing the paths including the nodes or links with the shortest path from the optional backup paths, obtaining the remaining optional backup paths, and continuing to execute the step 15;
step 15: selecting backup paths from the selectable backup paths, wherein in the process, whether equivalent paths exist in the non-shortest paths or not needs to be judged, if yes, step 16 is executed, and if not, step 17 is executed;
step 16: selecting a non-shortest path where a node with a small node number is located as a backup path, and executing step 17 to ensure the symmetry of the path, wherein the symmetry refers to the consistency of bidirectional paths between nodes at two ends;
and step 17: and setting the backup path selected and determined in the routing table as the backup path of the shortest path.
After the processing, the backup path of the shortest path can be determined, so that the reliability and the transmission efficiency of the information transmitted through the shortest path can be ensured.
Referring to fig. 2, the processing procedure for selecting a backup path by using the IS-IS protocol to implement path backup specifically includes:
in fig. 2, it is assumed that the node numbers are a < B < C < d. < K in this order, the number marked on each path in the graph indicates a path cost, and a small cost indicates a path priority.
Firstly, according to topology information of a two-layer network, calculating by using an IS-IS protocol to obtain a shortest path between nodes A and D as A-B-C-D;
then, in order to obtain a backup path between nodes a and D, the shortest path may be calculated and the backup path may be calculated according to a predetermined rule, or after the shortest path is calculated, a backup path calculation program may be started according to the CPU or the memory resource occupation condition.
Referring to fig. 2, a backup path between nodes a and D may be selected from three paths, i.e., a path a-H-I-D, a path a-B-F-D, and a path a-J-K-D, and a specific selection process needs to be implemented according to a rule for determining the backup path through calculation, which specifically includes:
for the path a-B-F-D, because it includes the shortest path node B and a part of the shortest path a-B, at this time, if this path is selected as the backup path, when the node B or the link a-B fails, the corresponding backup path cannot achieve the purpose of shortest path backup, so this path is excluded;
for the paths a-H-I-D and the paths a-J-K-D, exactly the same path cost IS 10, and in order to ensure that the paths between the node a and the node D have symmetry, at this time, the IS-IS routing judgment criterion needs to be enhanced, and for example, when the path cost IS the same, the size of the node number can be used as a routing basis, that IS, the node numbers of the nodes H and I are smaller than the node numbers of the node J and the node K, so that the path a-H-I-D IS finally selected as a backup path of the shortest path between the node a and the node D.
It should be noted that, in the present invention, for a node in the two-layer bridge network, the following information needs to be stored in the topology information of the node: in the shortest paths based on each other node, whether the node is on the shortest path is stored, that is, the shortest path information where the node is located is stored on other nodes except nodes at two ends of each shortest path, so as to judge whether the optional path includes the node or link of the shortest path; referring to fig. 2 as an example, nodes B and C are both on the shortest path with nodes a and D as the root, and this information needs to be stored in nodes B and C, respectively, as a judgment condition for selecting a backup path. In the actual implementation process, it can be specifically obtained whether the node is on the shortest path according to the forwarding table information, so that the shortest path information where the node is located can be specifically stored on other nodes except the nodes at two ends of each shortest path through the forwarding table information or a separate entry
The present invention also provides a device for improving the reliability of a shortest path bridge, the specific implementation of the device is shown in fig. 3, the device mainly includes a selectable path determining unit and a backup path determining unit, which are arranged in a network node device, wherein:
(1) optional path determination unit
The method comprises the steps of calculating and determining other paths existing between two end nodes corresponding to the shortest path between the nodes based on an IS-IS protocol;
(2) backup path determination unit
The backup path determining unit is configured to select at least one backup path as the shortest path from the other paths, and the backup path determining unit specifically includes:
a path screening unit, configured to remove paths including nodes or links in the shortest path from the other paths to obtain screened remaining paths;
a backup path selection unit, configured to select at least one backup path corresponding to the determined shortest path from the remaining paths;
the backup path determining unit further includes a backup path symmetry control unit, configured to control selection of a corresponding backup path by using a preset backup path selection policy that can guarantee symmetry of the backup path, where the backup path symmetry control unit may be specifically configured to, when a multi-hop equivalent path exists, select a path where a node with a small number is located as a backup path of the shortest path according to the number of nodes included in each of the selectable paths.
The device provided by the invention can further comprise:
and the path protection processing unit is used for switching the information to a backup path corresponding to the shortest path for transmission when the shortest path can not transmit the information.
In summary, with the implementation scheme provided by the present invention, in the two-layer bridge network, based on topology information of the two-layer bridge network, one or more backup paths may be reserved while calculating the shortest path by using the IS-IS protocol, and when the shortest path or a node fails, the shortest path may be quickly switched to the backup path, thereby reducing the influence on the traffic.
The above description is only for the preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are included in the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (14)
1. A method for improving shortest path bridge reliability, comprising:
A. calculating and determining other paths existing between two end nodes corresponding to the shortest path between the nodes based on an IS-IS protocol from the intermediate system to the intermediate system;
B. and selecting at least one backup path as the shortest path from the other paths.
2. The method of claim 1, further comprising:
C. in the process of calculating the shortest path based on the IS-IS protocol, the step A IS executed;
or,
D. after the process of calculating the shortest path based on the IS-IS protocol IS finished, when a predetermined condition IS met, the step a IS executed.
3. The method of claim 2, wherein step C comprises:
and in the process of calculating the shortest path based on the IS-IS protocol, retaining the non-shortest path record information, and determining other paths between the two end nodes according to the retained non-shortest path record information.
4. The method of claim 2, wherein the predetermined condition comprises: and determining condition information according to the occupation condition of CPU and/or memory resources in the system.
5. The method of claim 1, wherein step B comprises:
and removing paths containing nodes or links in the shortest path in the other paths, and determining at least one backup path corresponding to the shortest path in the rest paths.
6. The method of claim 5, further comprising:
and saving the shortest path information of the node in the nodes at the two ends in the shortest path through forwarding table information or a separate table entry.
7. The method according to any one of claims 1 to 6, wherein in step B, the process of determining at least one backup path comprises:
and B1, selecting the corresponding backup path by adopting a preset backup path selection strategy which can ensure the symmetry of the backup path.
8. The method according to claim 7, wherein said step B1 comprises:
in the process of selecting the backup path, when two paths with the same cost appear, the path where the node with the small node number is located is selected as the backup path according to the size of the node number configured in advance.
9. The method of claim 7, further comprising:
when the shortest path has a fault, switching to a backup path corresponding to the shortest path.
10. An apparatus for improving shortest path bridge reliability, comprising a selectable path determining unit and a backup path determining unit arranged in a network device, wherein:
the optional path determining unit IS used for calculating and determining other paths existing between two end nodes corresponding to the shortest path between the nodes based on the IS-IS protocol;
and the backup path determining unit is used for selecting at least one backup path as the shortest path from the other paths.
11. The apparatus as claimed in claim 10, wherein the backup path determining unit comprises:
a path screening unit, configured to remove paths including nodes or links in the shortest path from the other paths to obtain screened remaining paths;
and the backup path selection unit is used for selecting at least one backup path corresponding to the determined shortest path from the rest paths.
12. The apparatus according to claim 10, wherein the backup path determining unit comprises a backup path symmetry control unit, configured to control selection of the corresponding backup path by using a preset backup path selection policy that can ensure symmetry of the backup path.
13. The apparatus according to claim 12, wherein the backup path symmetry control unit is specifically configured to, when two paths with the same cost occur, select, as the backup path of the shortest path, a path where a node with a small number is located according to a preconfigured node number.
14. The apparatus of any one of claims 10 to 13, further comprising:
and the path protection processing unit is used for switching to a backup path corresponding to the shortest path when the shortest path fails.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006100783543A CN101072241B (en) | 2006-05-11 | 2006-05-11 | Method and device for improving shortest path bridge reliability |
| PCT/CN2007/000363 WO2007131402A1 (en) | 2006-05-11 | 2007-02-02 | A method and device for improving reliability of the shortest route bridge |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2006100783543A CN101072241B (en) | 2006-05-11 | 2006-05-11 | Method and device for improving shortest path bridge reliability |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101072241A true CN101072241A (en) | 2007-11-14 |
| CN101072241B CN101072241B (en) | 2011-04-20 |
Family
ID=38693524
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2006100783543A Expired - Fee Related CN101072241B (en) | 2006-05-11 | 2006-05-11 | Method and device for improving shortest path bridge reliability |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN101072241B (en) |
| WO (1) | WO2007131402A1 (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101814997A (en) * | 2010-03-26 | 2010-08-25 | 电子科技大学 | Method for reinforcing multicasting survivability |
| CN103763224A (en) * | 2014-01-23 | 2014-04-30 | 华为技术有限公司 | Data processing method and device |
| CN104253757A (en) * | 2014-09-04 | 2014-12-31 | 杭州华三通信技术有限公司 | Method and equipment for accessing network through multi-RB (route bridge) polymerization |
| CN104283778A (en) * | 2013-07-10 | 2015-01-14 | 杭州华三通信技术有限公司 | Flow protection method and device for shortest path bridging network |
| CN105933252A (en) * | 2016-04-01 | 2016-09-07 | 浪潮电子信息产业股份有限公司 | Switch communication method and system and switch |
| CN108631857A (en) * | 2018-03-29 | 2018-10-09 | 西安空间无线电技术研究所 | A kind of control method for automatically switching and system of communication satellite coverage backup ring |
| CN108833271A (en) * | 2018-05-28 | 2018-11-16 | 全球能源互联网研究院有限公司 | A kind of power grid wide-area control service communication routing resource and server |
| CN108932565A (en) * | 2018-07-05 | 2018-12-04 | 烽火通信科技股份有限公司 | A kind of method for searching and system based on network management |
| CN110138636A (en) * | 2019-04-30 | 2019-08-16 | 浙江亿邦通信科技有限公司 | Dynamic linear guard method and device |
| CN110535763A (en) * | 2019-07-10 | 2019-12-03 | 中移（杭州）信息技术有限公司 | A kind of route backup method, apparatus, server and readable storage medium storing program for executing |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103188096A (en) * | 2011-12-29 | 2013-07-03 | 中兴通讯股份有限公司 | Method and device for protecting path in TRILL network |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3997844B2 (en) * | 2002-06-12 | 2007-10-24 | 日本電気株式会社 | Route calculation method, route calculation program, and route calculation device |
| CN100442758C (en) * | 2003-02-07 | 2008-12-10 | 日本电信电话株式会社 | Multicast transfer route setting method, and multicast label switching method for implementing former method |
| CN1738286B (en) * | 2004-08-18 | 2011-06-22 | 华为技术有限公司 | Method for realizing heavy route in IP network |
| CN1645834A (en) * | 2005-02-02 | 2005-07-27 | 周旭扬 | Method and device for loop discovery, space reuse and protection conversion in MAC bridge connecting network |
-
2006
- 2006-05-11 CN CN2006100783543A patent/CN101072241B/en not_active Expired - Fee Related
-
2007
- 2007-02-02 WO PCT/CN2007/000363 patent/WO2007131402A1/en active Application Filing
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101814997A (en) * | 2010-03-26 | 2010-08-25 | 电子科技大学 | Method for reinforcing multicasting survivability |
| CN104283778A (en) * | 2013-07-10 | 2015-01-14 | 杭州华三通信技术有限公司 | Flow protection method and device for shortest path bridging network |
| CN104283778B (en) * | 2013-07-10 | 2017-11-14 | 新华三技术有限公司 | Flow rate protecting method and equipment in shortest path bridge network |
| CN103763224A (en) * | 2014-01-23 | 2014-04-30 | 华为技术有限公司 | Data processing method and device |
| CN103763224B (en) * | 2014-01-23 | 2017-04-12 | 华为技术有限公司 | Data processing method and device |
| CN104253757A (en) * | 2014-09-04 | 2014-12-31 | 杭州华三通信技术有限公司 | Method and equipment for accessing network through multi-RB (route bridge) polymerization |
| CN104253757B (en) * | 2014-09-04 | 2018-04-06 | 新华三技术有限公司 | A kind of method and apparatus for polymerizeing access network by more RB |
| CN105933252A (en) * | 2016-04-01 | 2016-09-07 | 浪潮电子信息产业股份有限公司 | Switch communication method and system and switch |
| CN108631857A (en) * | 2018-03-29 | 2018-10-09 | 西安空间无线电技术研究所 | A kind of control method for automatically switching and system of communication satellite coverage backup ring |
| CN108833271A (en) * | 2018-05-28 | 2018-11-16 | 全球能源互联网研究院有限公司 | A kind of power grid wide-area control service communication routing resource and server |
| CN108833271B (en) * | 2018-05-28 | 2021-02-09 | 全球能源互联网研究院有限公司 | Power grid wide area control service communication path selection method and server |
| CN108932565A (en) * | 2018-07-05 | 2018-12-04 | 烽火通信科技股份有限公司 | A kind of method for searching and system based on network management |
| WO2020007373A1 (en) * | 2018-07-05 | 2020-01-09 | 烽火通信科技股份有限公司 | Path finding method and system based on network management |
| CN110138636A (en) * | 2019-04-30 | 2019-08-16 | 浙江亿邦通信科技有限公司 | Dynamic linear guard method and device |
| CN110535763A (en) * | 2019-07-10 | 2019-12-03 | 中移（杭州）信息技术有限公司 | A kind of route backup method, apparatus, server and readable storage medium storing program for executing |
| CN110535763B (en) * | 2019-07-10 | 2021-12-14 | 中移（杭州）信息技术有限公司 | Route backup method, device, server and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2007131402A1 (en) | 2007-11-22 |
| CN101072241B (en) | 2011-04-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101072241B (en) | Method and device for improving shortest path bridge reliability | |
| US12101218B2 (en) | Transmit specific traffic along blocked link | |
| US7558878B2 (en) | Optimal sync for rapid spanning tree protocol | |
| US8711863B2 (en) | Virtual links in a routed ethernet mesh network | |
| US9665530B2 (en) | Method and system for implementing elastic network interface and interconnection | |
| EP2436154B1 (en) | Transient loop prevention in a hybrid layer-2 network | |
| US20100226260A1 (en) | Spanning tree ring protocol | |
| JP2013510459A (en) | Separate path computation algorithm | |
| EP2736198B1 (en) | Message processing method and system | |
| EP2911354A1 (en) | Method, device and system for bidirectional flow on same path in aggregation group | |
| US20110280159A1 (en) | Multi-card network device appearing as single entity in spanning tree network | |
| US20150163133A1 (en) | Load sharing of mpls pseudo-wires | |
| CN104796339B (en) | Quick flood process method and device | |
| CN112822106A (en) | Segment routing service processing method, device, source node and storage medium | |
| AU2020201904A1 (en) | Packet transmission method and apparatus | |
| Lei et al. | Multipath routing in SDN-based data center networks | |
| WO2015032260A1 (en) | Route updating method and routing device | |
| WO2024140374A1 (en) | Information processing method, device, and storage medium | |
| US20150036508A1 (en) | Method and Apparatus For Gateway Selection In Multilevel SPB Network | |
| CN102480411A (en) | Reservation method and system for protected bandwidth resources | |
| CN104247346A (en) | Pseudowire extended group messaging in a packet switched network | |
| CN104426778A (en) | Routing updating method and routing equipment | |
| JP4467500B2 (en) | Network relay device | |
| KR100917299B1 (en) | Method for eliminating loop supporting linkage with link aggregation in spanning tree | |
| CN100499550C (en) | Method and system for transmitting VLAN registering information in shortest routing bridge |
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: 20110420 Termination date: 20150511 |
|
| EXPY | Termination of patent right or utility model |