CN107659503B - Service protection method and system for resource-limited network - Google Patents
Service protection method and system for resource-limited network Download PDFInfo
- Publication number
- CN107659503B CN107659503B CN201610591435.7A CN201610591435A CN107659503B CN 107659503 B CN107659503 B CN 107659503B CN 201610591435 A CN201610591435 A CN 201610591435A CN 107659503 B CN107659503 B CN 107659503B
- Authority
- CN
- China
- Prior art keywords
- node
- routing table
- notification message
- address
- information
- 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.)
- Active
Links
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/54—Organization of routing tables
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a service protection method and a service protection system for a resource-limited network, and relates to the technical field of the Internet. The method comprises the following steps: a first node acquires a message that a second node routing table is full, wherein the second node is an upstream father node of the first node; the first node sends the routing table information of the first node to a third node, wherein the third node is an upstream father node which has the same network level with the second node and is not full of the routing table. Therefore, the problem of partial service failure caused by the full routing table of the intermediate node is solved.
Description
Technical Field
The invention relates to the technical field of internet, in particular to a method and a system for processing a fault of a load balancing path.
Background
The low-power consumption wireless personal area network 6Lowpan based on IPv6, based on the Internet of things IPv6 protocol of the next generation Internet standard, compresses and optimizes the traditional IPv6 message aiming at the low-power consumption environment of the Internet of things,
the 6LN (6Lowpan Node, Lowpan leaf Node) in the current 6Lowpan network will access through the directed loop-free topology built by 6LR (6Lowpan Router ) or 6LBR (6Lowpan Border Router, 6Lowpan Border Router), and the 6LR sensing Node carrying the sensor holds the route advertisement from the downstream Node. The sensor RAM capacity of each type of 6Lowpan sensing nodes is different, for example, the routing table capacity of the NanoStack 2.0CC2530 in a low-power-consumption lossy network routing protocol is only 40. When more prefixes are issued by downstream nodes, the 6LR of the intermediate node is prone to prefix overflow and prefix discard due to the full routing table, thereby causing partial service failure.
Disclosure of Invention
The invention aims to solve the technical problems that: how to relieve the problem of partial service failure caused by the full routing table of the intermediate node.
According to an aspect of the embodiments of the present invention, a method for protecting a service in a resource-constrained network is provided, which includes: a first node acquires a message that a second node routing table is full, wherein the second node is an upstream father node of the first node; the first node sends the routing table information of the first node to a third node, and the third node is an upstream father node which has the same network level with the second node and is not full of the routing table.
In some embodiments, further comprising: and the first node sends a first notification message to the second node under the condition that the third node is not found, wherein the first notification message comprises the IP address of the first node and overloaded first node routing table information, so that the second node performs service protection in a source routing mode according to the information carried in the first notification message.
In some embodiments, the performing, by the second node, traffic protection in a source routing manner includes: the second node sends a second notification message to the fourth node, wherein the second notification message comprises: the full identification information of the second node routing table, the overloaded first node routing table information, the IP address of the first node and the IP address of the second node are used for facilitating the fourth node to carry out service protection in a source routing mode according to the information carried in the second notification message; the fourth node is an upstream parent node of the second node.
In some embodiments, the performing, by the fourth node, service protection in a source routing manner according to the information carried in the second notification message includes: the fourth node stores the information carried by the second notification message; and when finding that the destination node belongs to the node in the routing table information of the overloaded first node, the fourth node sends a downlink message to the second node according to the information carried by the second notification message, wherein the header of the downlink message carries the IP address of the second node and the IP address of the first node.
In some embodiments, the second node deletes the IP address of the second node in the header of the downlink packet and forwards the downlink packet to the first node according to the IP address of the first node.
In some embodiments, the resource constrained network is a low power wireless personal area network 6Lowpan based on the IPv6 protocol.
According to an aspect of the embodiments of the present invention, a method for protecting a service in a resource-constrained network is provided, including: the second node receives a first notification message from the first node, the second node being an upstream parent of the first node, the first notification message including an IP address of the first node and overloaded first node routing table information. (ii) a And the second node performs service protection in a source routing mode according to the information carried in the first notification message.
In some embodiments, the performing, by the second node, traffic protection in a source routing manner includes: the second node sends a second notification message to the fourth node so that the fourth node performs service protection in a source routing mode according to information carried in the second notification message; the second notification message comprises full identification information of a second node routing table, overloaded first node routing table information, an IP address of the first node and an IP address of the second node; the fourth node is an upstream parent node of the second node.
In some embodiments, the performing, by the fourth node, service protection in a source routing manner according to the information carried in the second notification message includes: the fourth node stores the information carried by the second notification message; the fourth node stores the information carried by the second notification message; and when finding that the destination node belongs to the node in the routing table information of the overloaded first node, the fourth node sends a downlink message to the second node according to the information carried by the second notification message, wherein the header of the downlink message carries the IP address of the second node and the IP address of the first node.
In some embodiments, the second node deletes the IP address of the second node in the header of the downlink packet and forwards the downlink packet to the first node according to the IP address of the first node.
According to an aspect of the embodiments of the present invention, there is provided a traffic protection system for a resource-constrained network, which is characterized by including a first node and a second node, wherein the first node includes: the message acquisition module is used for acquiring a message that the second node routing table is full; and the information sending module is used for sending the routing table information of the first node to a third node, and the third node is an upstream father node which has the same network level with the second node and is not full of the routing table.
In some embodiments, the information sending module of the first node is further configured to send a first notification message to the second node when the third node is not found by the first node, where the first notification message includes an IP address of the first node and overloaded first node routing table information, so that the second node performs service protection in a source routing manner according to information carried in the first notification message.
In some embodiments, the second node comprises: a negotiation module, configured to send a second notification message to the fourth node, where the second notification message includes: the full identification information of the second node routing table, the overloaded first node routing table information, the IP address of the first node and the IP address of the second node are used for facilitating the fourth node to carry out service protection in a source routing mode according to the information carried in the second notification message; the fourth node is an upstream parent node of the second node.
In some embodiments, the system further comprises a fourth node comprising: the information storage module is used for storing the information carried by the second notification message; and the source routing module is used for sending a downlink message to the second node according to the information carried by the second notification message when the fourth node discovers that the destination node belongs to the node in the routing table information of the overloaded first node, wherein the header of the downlink message carries the IP address of the second node and the IP address of the first node.
In some embodiments, the second node further comprises: and the source routing module is used for deleting the IP address of the second node in the header of the downlink message and forwarding the downlink message to the first node according to the IP address of the first node.
In some embodiments, the resource constrained network is a low power wireless personal area network 6Lowpan based on the IPv6 protocol.
The service protection method for the resource-limited network can solve the problem of partial service failure caused by the full routing table of the intermediate node.
Other features of the present invention and advantages thereof will become apparent from the following detailed description of exemplary embodiments thereof, which proceeds with reference to the accompanying drawings.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a flowchart illustrating a service protection method for a resource-constrained network according to an embodiment of the present invention.
Fig. 2 is a schematic structural diagram of an embodiment of the service protection system for a resource-constrained network according to the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the invention, its application, or uses. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The limited storage capacity of the current low-power consumption 6Lowpan node easily saturates a routing table of a 6LR sensing node, and the following problems are caused: taking 6Lowpan as an example, as shown in fig. 1, after the 6Lowpan automatically generates a directed acyclic topology, the nodes can reach each other. The network level RANK value of each node indicates the hierarchical position of each node in the entire network. The RANK value may be comprehensively estimated according to the signal strength of the wireless link, the stability of the link, the number of hops from the node to 6LBR, the node type, the power supply condition of the node, the node performance, the type of the expected bearer service of the link, the importance of the node sensor, the bit error rates of the node and the neighbor, and other factors, so as to determine the position of the whole node in the network. Nodes with lower RANK values have better performance, more resources, more stable link quality, and shorter distance to 6 LBR. Thus, nodes with the same RANK value, meaning that the two nodes are at the same level throughout the network, are the same distance from the root node 6LBR level. When the child node is in signal connection with two nodes with different RANK values, only the node which is smaller than the RANK value of the child node but has a relatively smaller RANK value is preferably selected as a parent node to avoid a loop.
Assume that the RANK values of 6LRA, 6LRB, 6LRC, 6LRD are 144, 126, 18, 126, respectively, as determined by topology, and 6LRA prefers 6LRB to be the parent node from 6LRB and 6 LRD. In the prior art, after the network topology is formed, the 6LRA sends a routing table of the 6LRA to the upstream parent node 6LRB through a DAO (Data Access Object) message, the 6LRB stores the routing table and then continues to forward the DAO message to the upstream parent node 6LRC of the 6LRB, and the upstream parent node 6LRC continues to store the routing table and forwards the routing table to the upstream parent node up to 6 LBR. When the 6LRB routing table is full, if the 6LRA continues to send DAO messages to the 6LRB, B cannot save the routing table in the DAO messages, so the DAO messages and all subsequent DAO messages containing new routes are discarded by default, and the subsequent DAO messages are not forwarded to the upstream parent node 6LRC, resulting in unreachable traffic of the missing part of the route.
The following describes a fault handling method of a load balancing path according to an embodiment of the present invention with reference to fig. 1. Wherein the second node 6LRB is an upstream parent node of the first node 6LRA, the third node 6LRD is an upstream parent node of the same network level as the second node 6LRB and whose routing table is not full, and the fourth node 6LRC is an upstream parent node of the second node 6 LRB.
The fault processing method of the load balancing path in the embodiment comprises the following steps:
step S100, when the second node detects that the local routing table is full and triggers an overload request, the second node sends a routing table full message to a directly connected downstream first node, the first node acquires the routing table full message of the second node, and the second node is an upstream father node of the first node.
For example, the 6LRB detects that the local routing table is full and triggers an overload request, and the 6LRB sends a message that the routing table is full to the directly connected downstream first node 6LRA, and notifies the 6LRA to find an upstream parent node that has the same network level as the 6LRB and is not full of the routing table.
Step S102, the first node finds that the third node is an upstream father node which has the same network level with the second node and is not full of the routing table, and the first node sends the routing table information of the first node to the third node so as to inform the third node of storing the routing table information of the first node which cannot be stored by the second node due to the fact that the routing table is full.
For example, after the 6LRA obtains the message that the 6LRB routing table is full, the 6LRA finds that the 6LRD is the upstream parent node that is at the same network level as the 6LRB and the routing table is not full, and then the 6LRA sends the routing table information that should be sent to the 6LRB to the 6LRD, where the 6LRD is the upstream parent node that is at the same network level as the 6LRB and the routing table is not full.
By the above method, in case that the intermediate node 6LRB routing table is full, the downstream node 6LRA can find the upstream parent node 6LRD which is at the same network level as the 6LRB and the routing table is not full, and store part of the routing table of the 6LRA in the 6LRD, thereby alleviating the problem of partial service failure caused by the full 6LRB routing table.
The following describes a fault handling method for a load balancing path according to another embodiment of the present invention. On the basis of the above embodiment, the method for processing the fault of the load balancing path in this embodiment further includes the following steps:
step S104, the first node sends a first notification message to the second node under the condition that the third node is not found, and the second node is notified under the condition that the first node does not have an upstream father node which has the same network level as the second node and is not full of a routing table, so that the second node performs service protection in a source routing mode according to information carried in the first notification message. Wherein the first notification message includes an IP address of the first node and overloaded first node routing table information.
Step S106, after receiving the first notification message sent by the first node, the second node learns that there is no upstream parent node with the same network level as the second node and with a less full routing table in the first node. And then the second node sends a second notification message to the fourth node, and notifies the fourth node of the fact that the routing table of the second node is full, so that the fourth node stores the information carried in the second notification message and performs service protection by adopting a source routing mode. The second notification message includes: the second node routing table full identification information, the overloaded first node routing table information, the IP address of the first node and the IP address of the second node.
And step S108, the fourth node stores the information carried in the second notification message.
Step S110, when finding that the destination node belongs to a node in the routing table information of the overloaded first node, the fourth node sends a downlink packet to the second node according to information carried in the second notification message, where a header of the downlink packet carries an IP address of the second node and an IP address of the first node, so that the second node receives the downlink packet according to the IP address of the first node in the header, and forwards the packet to the first node in a source routing manner according to the IP address of the second node in the header.
Step S112, the second node deletes the IP address of the second node in the header of the downlink packet, and forwards the downlink packet to the first node according to the IP address of the first node.
Still taking fig. 1 as an example, in a case that the 6LRA does not find that there is a node of the same network level as the 6LRB, the 6LRA sends a notification message that the node of the same network level is not found to the 6LRB, and the notification message that the node of the same network level is not found includes the IP address of the 6LRA and the overloaded routing table information, so that the 6LRB performs traffic protection in a source routing manner according to the IP address of the 6LRA and the overloaded routing table information.
After receiving the notification message that the same network level node is not found, the 6LRB negotiates with the upstream parent node 6LRC, the negotiation content is that both sides support a route storage mode and a source route mode, and a ttl (time to live) value in the negotiation message is 1, which indicates that the negotiation message is transmitted without node crossing. After the negotiation is successful, the 6LRB forwards a message to the 6LRC, wherein the forwarded message comprises full identification information of a 6LRB routing table, overloaded 6LRA routing table information, an IP address of the 6LRA and an IP address of the 6LRB, so that the 6LRC performs service protection in a source routing mode according to information carried in the forwarded message.
The 6LRC stores information carried by the forwarded message. When sending the downlink message, the 6LRC sends the downlink message to the 6LRB according to the information carried by the forwarding message when finding that the destination node belongs to the node in the overloaded routing table information of the 6LRA, and the header of the downlink message carries the IP address of the 6LRB and the IP address of the 6 LRA.
After the 6LRB receives the downlink message, the IP address of the 6LRB at the outermost layer in the header of the downlink message is deleted, and the downlink message is forwarded to the 6LRA in a source routing mode according to the IP address of the 6LRA at the outer layer in the header of the downlink message.
In the embodiment of the method, under the condition that the intermediate node routing table is overloaded, the intermediate node can negotiate with an upstream father node, and both work in a mixed mode of storage routing and source routing, and the overloaded routing table is stored to the upstream father node of the intermediate node, so that the transmission of downlink messages is ensured, and the problem of partial service failure caused by the fullness of the intermediate node routing table is solved.
A service protection system for a resource-constrained network according to an embodiment of the present invention is described below with reference to fig. 2.
Fig. 2 is a schematic structural diagram of an embodiment of the service protection system for a resource-constrained network according to the present invention. As shown in fig. 2, the traffic protection system 20 for a resource-constrained network in this embodiment includes:
a first node 201 and a second node 202, wherein the second node 202 is an upstream parent node of the first node 201; the first node 201 includes:
a message obtaining module 2012, configured to obtain a message that the routing table of the second node 202 is full;
an information sending module 2014, configured to send the routing table information of the first node 301 to a third node, where the third node is an upstream parent node that is the same as the second node in network level and has a routing table that is not full.
Through the system, under the condition that the routing table of the intermediate node 202 is full, the downstream node first node can discover the fourth node of the upstream parent node which is at the same network level as the second node and the routing table is not full, and store the routing table of the first node in the fourth node, so that the problem of partial service failure caused by the full routing table of the second node is relieved.
In some embodiments, the information sending module 2014 is further configured to send, to the second node 202, a first notification message in the case that a third node is not found, where the first notification message includes an IP address of the first node 201 and overloaded routing table information of the first node 201, so that the second node 202 performs service protection in a source routing manner according to information carried in the first notification message.
In some embodiments, the second node 202 comprises:
a negotiation module 2022, configured to send a second notification message to the fourth node 204, where the second notification message includes: the full identification information of the routing table of the second node 202, the overloaded routing table information of the first node 201, the IP address of the first node 201, and the IP address of the second node 202, so that the fourth node 204 performs service protection in a source routing manner according to the information carried in the second notification message.
In some preferred embodiments, the system further comprises a fourth node, the fourth node 204 comprising:
a negotiation module 2042, configured to negotiate with the second node to use a hybrid working mode of the storage route and the source route;
the information storage module 2044 is used for storing the information carried by the second notification message;
the source routing module 2046 is configured to, when the fourth node discovers that the destination node belongs to a node in the routing table information of the overloaded first node, send a downlink packet to the second node according to information carried in the second notification message, where a header of the downlink packet carries an IP address of the second node and an IP address of the first node.
In some embodiments, the second node 202 further comprises:
the source routing module 2024 is configured to delete the IP address of the second node 202 in the header of the downlink packet, and forward the downlink packet to the first node 201 according to the IP address of the first node 201.
In some embodiments, the resource constrained network is a low power wireless personal area network 6Lowpan based on the IPv6 protocol.
In the above system embodiment, when the intermediate node routing table is overloaded, the intermediate node may negotiate with the upstream parent node, and both operate in a mixed manner of the storage route and the source route, and store the overloaded routing table to the upstream parent node of the intermediate node, thereby ensuring transmission of the downlink packet, and alleviating the problem of partial service failure caused by the fullness of the intermediate node routing table.
It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program instructing relevant hardware, where the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.
Claims (12)
1. A method for traffic protection in a resource-constrained network, comprising:
a first node acquires a message that a second node routing table is full, wherein the second node is an upstream father node of the first node;
the first node sends the routing table information of the first node to a third node, wherein the third node is an upstream father node which has the same network level with the second node and is not full of the routing table.
2. The method of claim 1, wherein the method further comprises:
and the first node sends a first notification message to the second node under the condition that the third node is not found, wherein the first notification message comprises the IP address of the first node and overloaded first node routing table information, so that the second node performs service protection in a source routing mode according to the information carried in the first notification message.
3. The method of claim 2, wherein the second node performing traffic protection by means of source routing comprises:
the second node sends a second notification message to a fourth node, wherein the second notification message comprises: the full identification information of the second node routing table, the overloaded first node routing table information, the IP address of the first node and the IP address of the second node are used for facilitating the fourth node to carry out service protection in a source routing mode according to the information carried in the second notification message; the fourth node is an upstream parent node of the second node.
4. The method of claim 3, wherein the fourth node performing service protection in a source routing manner according to the information carried in the second notification message comprises:
the fourth node stores the information carried by the second notification message;
and when finding that the destination node belongs to the node in the routing table information of the overloaded first node, the fourth node sends a downlink message to the second node according to the information carried by the second notification message, wherein the header of the downlink message carries the IP address of the second node and the IP address of the first node.
5. The method of claim 4, wherein the second node deletes the IP address of the second node in the header of the downlink packet and forwards the downlink packet to the first node according to the IP address of the first node.
6. The method of claim 1, wherein the resource constrained network is a low power wireless personal area network 6Lowpan based on IPv6 protocol.
7. A traffic protection system for a resource-constrained network, comprising a first node, a second node, the second node being an upstream parent node of the first node, wherein the first node comprises:
the message acquisition module is used for acquiring a message that the second node routing table is full;
and the information sending module is used for sending the routing table information of the first node to a third node, wherein the third node is an upstream father node which has the same network level with the second node and is not full of the routing table.
8. The system of claim 7, wherein the information sending module is further configured to:
and under the condition that the third node is not found by the first node, sending a first notification message to the second node, wherein the first notification message comprises the IP address of the first node and overloaded first node routing table information, so that the second node performs service protection in a source routing mode according to the information carried in the first notification message.
9. The system of claim 8, wherein the second node comprises:
a negotiation module, configured to send a second notification message to a fourth node, where the second notification message includes: the full identification information of the second node routing table, the overloaded first node routing table information, the IP address of the first node and the IP address of the second node are used for facilitating the fourth node to carry out service protection in a source routing mode according to the information carried in the second notification message; the fourth node is an upstream parent node of the second node.
10. The system of claim 9, wherein the system further comprises a fourth node comprising:
the information storage module is used for storing the information carried by the second notification message;
and the source routing module is used for sending a downlink message to the second node according to the information carried by the second notification message when the fourth node discovers that the destination node belongs to the node in the routing table information of the overloaded first node, wherein the header of the downlink message carries the IP address of the second node and the IP address of the first node.
11. The system of claim 10, wherein the second node further comprises:
and the source routing module is used for deleting the IP address of the second node in the header of the downlink message and forwarding the downlink message to the first node according to the IP address of the first node.
12. The system of claim 7 wherein the resource constrained network is a low power wireless personal area network 6Lowpan based on IPv6 protocol.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610591435.7A CN107659503B (en) | 2016-07-25 | 2016-07-25 | Service protection method and system for resource-limited network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610591435.7A CN107659503B (en) | 2016-07-25 | 2016-07-25 | Service protection method and system for resource-limited network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107659503A CN107659503A (en) | 2018-02-02 |
| CN107659503B true CN107659503B (en) | 2020-07-07 |
Family
ID=61127098
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610591435.7A Active CN107659503B (en) | 2016-07-25 | 2016-07-25 | Service protection method and system for resource-limited network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107659503B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20090049905A (en) * | 2007-11-14 | 2009-05-19 | 대구대학교 산학협력단 | Memory managing method of node for wireless sensor network |
| CN102045254A (en) * | 2010-11-30 | 2011-05-04 | 福建星网锐捷网络有限公司 | Extended processing method, device and network equipment of routing table |
| CN103560962A (en) * | 2013-11-04 | 2014-02-05 | 神州数码网络(北京)有限公司 | Method for automatically updating host routing table entries of Ethernet switch and switch |
| CN103560968A (en) * | 2013-10-30 | 2014-02-05 | 神州数码网络(北京)有限公司 | Switch hardware host routing table updating method and device and switch |
-
2016
- 2016-07-25 CN CN201610591435.7A patent/CN107659503B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20090049905A (en) * | 2007-11-14 | 2009-05-19 | 대구대학교 산학협력단 | Memory managing method of node for wireless sensor network |
| CN102045254A (en) * | 2010-11-30 | 2011-05-04 | 福建星网锐捷网络有限公司 | Extended processing method, device and network equipment of routing table |
| CN103560968A (en) * | 2013-10-30 | 2014-02-05 | 神州数码网络(北京)有限公司 | Switch hardware host routing table updating method and device and switch |
| CN103560962A (en) * | 2013-11-04 | 2014-02-05 | 神州数码网络(北京)有限公司 | Method for automatically updating host routing table entries of Ethernet switch and switch |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107659503A (en) | 2018-02-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8934496B2 (en) | Reactive and proactive routing protocol interoperation in low power and lossy networks | |
| US8817665B2 (en) | Alternate down paths for directed acyclic graph (DAG) routing | |
| US9325626B2 (en) | Method and apparatus to reduce cumulative effect of dynamic metric advertisement in smart grid/sensor networks | |
| US9232458B2 (en) | Proactive timer-based local repair path communication in reactive routing networks | |
| Nelson et al. | GSTAR: generalized storage-aware routing for mobilityfirst in the future mobile internet | |
| US7860025B2 (en) | Directed acyclic graph discovery and network prefix information distribution relative to a clusterhead in an ad hoc mobile network | |
| KR101376014B1 (en) | Method and device for multiple rendezvous points processing multicast services of mobile multicast source jointly | |
| US9088499B2 (en) | Routing generation for implementation of fiber channel over ethernet | |
| TW201818743A (en) | Routing method and wireless node for wireless mesh network | |
| US9300569B2 (en) | Compressing data packet routing information using bloom filters | |
| US10938707B2 (en) | Peer-to-peer optimization in existing tree-based topology based on generating locally-optimized tree using confined advertisements | |
| CN110752997B (en) | Named data network forwarding method for data packet active path finding | |
| EP3200404B1 (en) | Content-centric network on-demand distance vector route method | |
| CN105163349A (en) | IEEE802.11s-based multi-gateway wireless Mesh network realization method | |
| US20170093685A1 (en) | Generating service-optimized paths based on enhanced eigrp telemetry | |
| CN109617812B (en) | Greedy embedding-based RPL routing method and device and network topology | |
| CN110233709B (en) | RPL routing method and related device | |
| CN102355421A (en) | Method for handling LSP (Label Switched Path) network congestion, device and system | |
| Bhatia et al. | A cluster based minimum battery cost AODV routing using multipath route for ZigBee | |
| US10425485B2 (en) | Integrating information centric networking (ICN) over low power and lossy networks (LLNs) | |
| CN107659503B (en) | Service protection method and system for resource-limited network | |
| Gao et al. | Multi-path routing protocol with unavailable areas identification in wireless sensor networks | |
| CN117938813A (en) | Notification method, node and storage medium of forwarding table index | |
| Pansare | A Review of AODV Based Routing Protocols for Mobile Ad-hoc Network. | |
| Speakman et al. | An analysis of loop formation in OL-SRv2 in ad-hoc networks and limiting its negative impact |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |