CN109245940B - Method for discovering and detecting network equipment - Google Patents
Method for discovering and detecting network equipment Download PDFInfo
- Publication number
- CN109245940B CN109245940B CN201811196136.9A CN201811196136A CN109245940B CN 109245940 B CN109245940 B CN 109245940B CN 201811196136 A CN201811196136 A CN 201811196136A CN 109245940 B CN109245940 B CN 109245940B
- Authority
- CN
- China
- Prior art keywords
- neighbor
- master
- backup
- message
- detection
- 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
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/30—Decision processes by autonomous network management units using voting and bidding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/10—Active monitoring, e.g. heartbeat, ping or trace-route
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/02—Standardisation; Integration
- H04L41/0213—Standardised network management protocols, e.g. simple network management protocol [SNMP]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
- H04L41/0663—Performing the actions predefined by failover planning, e.g. switching to standby network elements
Abstract
The invention discloses a method for discovering and detecting network equipment, which comprises a server and a plurality of network equipment to be monitored in an area to be positioned, and also comprises the following steps: a: and (3) master and backup election: the number of network devices passing through the network device to other network devices and the priority of the network device are used for contesting for selecting the master and the backup; b: equipment detection: the master detects whether the network equipment can reach or not by sending a detection message and sends a detection result to the server; c: addition of new equipment: the new device receives the detection message and sends self information to the master, and the server synchronizes the information of the new device through the master; d: re-election of master: the network equipment judges whether the master and the backup work normally or not through the detection message, and if the master and the backup fail, the master and the backup are selected again; the invention solves the problems of long detection period, large calculation resource consumption and the like in the prior art, improves the detection efficiency of mass network equipment and reduces the resource consumption compared with the prior art.
Description
Technical Field
The invention relates to a method for discovering and detecting network equipment.
Background
With the development of economy, more and more network devices enter the daily life of people; the number of network equipment such as a college campus with the scale of 2 ten thousand students, wireless AC, AP, an exchanger and the like can reach thousands or even tens of thousands; when some equipment is broken down and damaged and is off-line, serious influence is caused on network communication; the detection of network equipment and the rapid positioning of off-line equipment are important work for guaranteeing data communication.
At present, two main technical schemes for detecting network equipment are available; one is to adopt internet control message protocol, ICMP; it is a sub-protocol of the TCP/IP protocol suite for passing control messages between IP hosts and routers; its main role in the network is: host detection, route maintenance, route selection and flow control; PING is a major application of ICMP for detecting connectivity of network devices, where a source host sends an ICMP request message to a destination host; the target host responds an ICMP response message to the source host after receiving the response message, and if the source host receives the response message within a certain time, the target host is considered to be reachable; otherwise, it is not reachable.
The other is based on a C/S architecture by adopting a Simple Network Management Protocol (SNMP); SNMP consists of three parts, namely a Network Management Station (NMS), an Agent (Agent) and a Management Information Base (MIB); the Agent and MIB are located on the managed computer and network equipment, such as host, router, switch, terminal server and workstation, it is a software responsible for collecting the network information of the resident equipment waiting for NMS polling; when NMS wants to obtain monitoring data, it sends get operation to Agent through SNMP protocol, and the Agent gets data through MIB base and sends it to NMS, if it is Agent actively sending information to NMS, it adopts trap operation, as shown in figure 1.
The two existing technical schemes for detecting the network equipment have the problems of long detection period, large calculation resource consumption and the like.
Disclosure of Invention
The present invention is directed to overcome the deficiencies of the prior art and to provide a method for discovering and detecting network devices.
The technical scheme adopted by the invention for solving the technical problems is as follows:
the technical scheme adopted by the invention for solving the technical problems is as follows: a method for discovering and detecting network equipment comprises a server and a plurality of network equipment to be monitored in an area to be positioned, and further comprises the following steps:
a: and (3) master and backup election: dividing the area to be monitored into several sub-areas ensures that each network device belongs to only one sub-area, the server is connected with each network device through the network, each network device sends election messages to the working physical port and updates the neighbor list of each network device, the election message comprises a distance and a priority, the distance represents the number of network devices from the network device to other network devices, the priority is obtained by each network device through calculation according to the CPU core number, the CPU frequency, the memory number, the memory size and the back plate bandwidth parameter, the minimum distance is selected as a master, the next minimum distance is a backup, the maximum priority is selected as the master when the distances are the same, the next maximum distance is selected as a backup, the minimum mac address is selected as the master when the priorities are the same, the next minimum distance is a backup, race selection is finished when no new device is added after a period of time, and the master informs the server of the data of the own neighbor list;
b: equipment detection: the master sends detection messages to all neighbors periodically according to the neighbor list, the neighbors enter into election inhibition after receiving the detection messages, the neighbor list of the master is not sent any more, meanwhile, a detection response message is sent to the master, the master sends a neighbor message list whether the neighbors can reach or not to a server according to whether the detection response message is received or not within a period of time, the server updates the neighbor list in the server according to the neighbor message list sent by the master, the server can inquire whether specific network equipment can reach or not by controlling the master to send the detection messages to the specific network equipment, the server sends the detection messages to the inaccessible network equipment by the master or through the master and updates the neighbor list in the server according to the returning condition;
c: addition of new equipment: after a new device is added, the new device receives a neighbor detection message of a master, sends a neighbor list of the new device to the master, and after the master receives the neighbor list, updates the neighbor list of the new device and sends information of newly added network devices to a server;
d: re-election: when the backup does not receive the detection message of the master within a period of time, the master is considered to be invalid, the backup becomes the master, when the backup receives the detection message of the master again, the master is considered to be recovered to normal, the backup is recovered to backup, when the network equipment does not receive the detection message within a period of time, the master and the backup are considered to be invalid, the competition inhibition is cancelled, and the master and the backup are again entered into competition.
In another preferred embodiment, in step a, the election message further includes a type field, an alive period and neighbor information, the type field indicates that the selectable types of the message include an election message and a maintenance message, the alive period indicates that the message stops being transmitted after passing through a plurality of neighbors, the neighbor information includes an affiliated area, a neighbor identifier, a neighbor IP and a neighbor priority, the affiliated area indicates a sub-area where the neighbor is located, the neighbor identifier indicates the uniqueness of the neighbor by using the mac address of the neighbor as the identifier, the neighbor IP indicates the IP address of the neighbor, and the neighbor priority indicates the priority size of the neighbor.
In another preferred embodiment, in step a, the neighbor list includes an area of interest, a neighbor identifier, a neighbor priority, whether the area of interest is a master, a neighbor IP, a survival time, and a distance to the neighbor, the area of interest represents a sub-area in which the neighbor is located, the neighbor identifier represents that the mac address of the neighbor is used as the identifier to represent the uniqueness of the neighbor, the neighbor priority represents the priority size of the neighbor, whether the mac address of the neighbor is a master or not, the neighbor IP represents the IP address of the neighbor, the survival time represents the time interval in which the neighbor sends the neighbor message, and the distance to the neighbor represents the number of network devices passed by the network device to the neighbor.
In another preferred embodiment, in step A, the priority is
Wherein α + β + γ ═ 1, α, β, γ ∈ (0, 1), a ≡ 255, and n is the core number of the network device CPU, and the CPU is a core number of the network device CPUiThe unit of the frequency of the ith CPU is MHz, m is the number of memory banks of the network equipment, memorryj is the size of the jth memory, the unit is GByte, bandwidth is the bandwidth of the network equipment complete machine backboard, the unit is Gbps, alpha, beta and gamma are weight ratios of the CPU, the memory and the backboard bandwidth respectively, and i, j, m, N belongs to N.
In another preferred embodiment, in step a, the priority may also be set manually.
In another preferred embodiment, in step B, the master preferentially sends a probe message to the backup.
In another preferred embodiment, in step B, if the master receives the probe response message of the neighbor within several sending cycles, indicating that the neighbor is reachable, the master sets the survival time in the neighbor list to 0, otherwise, the master sets the survival time in the neighbor list to timeout.
In another preferred embodiment, in step B, the neighbor message list includes the data of the belonging area, neighbor identification, neighbor IP, survival time and whether master in the neighbor list.
In another preferred embodiment, in step B, the neighbor list in the server includes data in the neighbor list advertised by the master and an online status indicating whether the neighbor is online, the online status is updated according to the time-to-live, if the time-to-live is 0, the online status is updated to be online, and if the time-to-live is timeout, the online status is updated to be failure.
In another preferred embodiment, in step C, when the master and backup in the sub-area where the new device is located are working normally, the new device does not become the master.
The invention has the beneficial effects that:
1. whether the network equipment in each subregion can be reached or not is detected by sending a detection message through the master of each subregion selected by competition, and a detection result is sent to the server, so that the server can quickly acquire the information whether the network equipment in each subregion can be reached or not, the detection efficiency of the mass network equipment is improved, and the resource consumption is reduced.
2. Each network device in the sub-area exchanges information through the election messages so as to update the neighbor list while master is carried out, the elected master sends data in the neighbor list to the server, and preliminary rapid detection of the network devices in the sub-area is carried out through the election messages, so that the detection efficiency is improved.
3. The states of all neighbors of all network equipment are stored through the neighbor list, whether all the neighbors can reach or not is conveniently recorded, and inaccessible neighbors can be preliminarily screened out through the neighbor list.
4. And the priority algorithm for freely giving weights to the CPU, the memory and the backboard bandwidth is adopted, so that the weights can be flexibly configured according to actual requirements.
5. The priority may also be manually set to meet specific requirements.
6. The master preferentially sends a detection message to the backup, preferentially detects whether the backup can be reached or not, can detect the backup in the first time when the backup has a problem, strives for time for subsequent maintenance of the backup, and can reselect the backup to ensure the overall stability.
7. The master sets the survival time in the neighbor list to be 0 or overtime according to whether the detection response message of the neighbor is received or not in a plurality of sending periods, and the server can know the state of the network equipment through the survival time of the network equipment.
8. The neighbor message list comprises the data of the region, the neighbor identification, the neighbor IP, the survival time and whether the master is included in the neighbor list, and the neighbor message list which is simpler than the neighbor list is used for reducing the resource consumption of the server synchronization neighbor state and improving the transmission efficiency.
9. And the neighbor list in the server sets the online state of the network equipment according to the survival time of the network equipment, and quickly and intuitively screens the failed network equipment.
10. When the master and the backup in the sub-area where the new equipment is located work normally, the new equipment cannot become the master so as to maintain the stability of the whole network.
The invention is further explained in detail with the accompanying drawings and the embodiments; but a network of the invention
The method of device discovery and detection is not limited to the embodiments.
Drawings
Fig. 1 is a schematic diagram of the operation of SNMP;
FIG. 2 is a network topology diagram of a preferred embodiment of the present invention;
FIG. 3 is a flow chart of a preferred embodiment of the present invention;
fig. 4 is a network topology diagram after a new device joins in accordance with a preferred embodiment of the present invention.
Detailed Description
In an embodiment, referring to fig. 2 to 4, a method for discovering and detecting a network device according to the present invention includes a server and a plurality of network devices to be monitored in an area to be located, and further includes the following steps:
a: and (3) master and backup election: the monitoring area is divided into area1 and area 2; the mac address and the IP address of the network device nodes of area1 and area2, the IP address of the server is shown in fig. 1; the server is interconnected with the two areas through a network; the parameters of the network device and the calculated priority are shown in table 1:
table 1 network device parameter table
Taking the election of area2 network device as an example, the election process is described below, and from the beginning, the neighbor list of each network device is only self, see tables 2 to 5
Table 2 neighbor list for node 21
TABLE 3 neighbor List for node 22
TABLE 4 neighbor List for node 23
TABLE 5 neighbor List for node 24
Each network device exchanges information of the neighbor list, and the first round of exchange refers to tables 6 to 9:
table 6 neighbor list of first round nodes 21
TABLE 7 neighbor List for first round nodes 22
Table 8 neighbor list of first round nodes 23
Table 9 neighbor list of first round nodes 24
See tables 10-13 for the second round of exchanges:
table 10 neighbor list of second round nodes 21
TABLE 11 neighbor List for second round nodes 22
TABLE 12 neighbor List for second round nodes 23
Table 13 neighbor list for second round nodes 24
Calculate the distance, see table 14:
distance of each node of table 14
| Node 21 | Node 22 | Node 23 | Node 24 | Distance between two adjacent plates | |
| Node 21 | 0 | 1 | 1 | 1 | 3 |
| Node 22 | 1 | 0 | 2 | 2 | 5 |
| Node 23 | 1 | 2 | 0 | 2 | 5 |
| Node 24 | 1 | 2 | 2 | 0 | 5 |
The minimum distance is a node 21, the node 21 is selected as a master, the distance between the node 22 and the node 23 which are the next smallest is equal to the distance between the node 24 and the node 22 which are the next smallest, the node with the next largest priority is selected as backup, the priority of the node 22 is the largest, the node 22 is selected as backup, in 2 election cycles, when a neighbor list has no new neighbors to join, namely the neighbors are not updated, the network enters a stable state, and the master and backup election is finished; the master advertises its neighbor list to the server as shown in table 15:
table 15 neighbor list data for master advertisements
| Belonging to area | Neighbor identification | Neighbor IP | Time to live | Whether master or not |
| area2 | 0000-0000-0000-0021 | 1.1.2.1 | 0 | 1 |
| area2 | 0000-0000-0000-0022 | 1.1.2.2 | 0 | 0 |
| area2 | 0000-0000-0000-0023 | 1.1.2.3 | 0 | 0 |
| area2 | 0000-0000-0000-0024 | 1.1.2.4 | 0 | 0 |
Neighbor list on the server see table 16:
TABLE 16 neighbor List on Server
B: equipment detection: after the master and the backup are selected, the master periodically sends a neighbor detection message to the local area equipment by a polling mechanism, the neighbor enters into election inhibition after receiving the detection message and does not send a neighbor list of the local machine any more, the area master node 21 periodically sends the neighbor detection message to all the neighbors according to the neighbor list, if receiving a neighbor detection response message in 3 sending periods, the state information of the neighbor in the neighbor list is refreshed, and the master preferentially sends the neighbor detection message to the backup node 22 equipment when sending the neighbor detection message.
After receiving the detection message, the neighbor immediately sends a detection response message, and if the master receives the detection response message of the neighbor in 3 sending periods, the master indicates that the neighbor can reach, and the survival time is set to be 0; otherwise, the time-to-live is set to timeout.
Assuming that the node 23 is offline, the master sends 3 neighbor detection messages to the node 23, and if no response is found, the master immediately sends the neighbor unreachable message to the server, that is, the survival time of the neighbor is set to be overtime, and the server receives the information of the are2 node 23 overtime sent by the regional master node 21, and updates the survival time and online status of the neighbor, as shown in table 17:
TABLE 17 neighbor List on Server after node failure
C: adding new equipment: referring to fig. 4, after the new device node 25 joins the area2, the new device receives the master, that is, the probe message of the node 21, and sends its own neighbor list to the node 21, because all the neighbors of the new device are election-suppressed at this time, the neighbor list is only self, the node 21 receives the neighbor list, updates its own neighbor list and sends information of the newly joined network device to the server, and in order to maintain the stability of the network, even if the priority of the new device is higher than that of the original master, the new device will not become the master.
D: re-election: the backup means that the node 22 does not receive the detection messages of the master and the node 21 in 2 neighbor detection periods, the node 21 is considered to be invalid, the node 22 becomes the master to execute the role of the master for a period of time, the node 22 receives the neighbor detection messages of the node 21 again and then returns to the backup, finally, both the node 21 and the node 21 are invalid, the network equipment does not receive the detection messages in 5 detection periods, the competitive election inhibition is cancelled, and the election is entered again.
The above embodiments are only used to further illustrate a method for discovering and detecting network devices according to the present invention, but the present invention is not limited to the embodiments, and any simple modification, equivalent change and modification made to the above embodiments according to the technical spirit of the present invention fall within the protection scope of the technical solution of the present invention.
Claims (10)
1. A method for discovering and detecting network equipment comprises a server and a plurality of network equipment to be monitored in an area to be positioned, and further comprises the following steps:
a: and (3) master and backup election: dividing the area to be monitored into several sub-areas ensures that each network device belongs to only one sub-area, the server is connected with each network device through the network, each network device sends election messages to the working physical port and updates the neighbor list of each network device, the election message comprises a distance and a priority, the distance represents the number of network devices from the network device to other network devices, the priority is obtained by each network device through calculation according to the CPU core number, the CPU frequency, the memory number, the memory size and the back plate bandwidth parameter, the minimum distance is selected as a master, the next minimum distance is a backup, the maximum priority is selected as the master when the distances are the same, the next maximum distance is selected as a backup, the minimum mac address is selected as the master when the priorities are the same, the next minimum distance is a backup, race selection is finished when no new device is added after a period of time, and the master informs the server of the data of the own neighbor list;
b: equipment detection: the master sends detection messages to all neighbors periodically according to the neighbor list, the neighbors enter into election inhibition after receiving the detection messages, the neighbor list of the master is not sent any more, meanwhile, a detection response message is sent to the master, the master sends a neighbor message list whether the neighbors can reach or not to a server according to whether the detection response message is received or not within a period of time, the server updates the neighbor list in the server according to the neighbor message list sent by the master, the server can inquire whether specific network equipment can reach or not by controlling the master to send the detection messages to the specific network equipment, the server sends the detection messages to the inaccessible network equipment by the master or through the master and updates the neighbor list in the server according to the returning condition;
c: addition of new equipment: after a new device is added, the new device receives a neighbor detection message of a master, sends a neighbor list of the new device to the master, and after the master receives the neighbor list, updates the neighbor list of the new device and sends information of newly added network devices to a server;
d: re-election: when the backup does not receive the detection message of the master within a period of time, the master is considered to be invalid, the backup becomes the master, when the backup receives the detection message of the master again, the master is considered to be recovered to normal, the backup is recovered to backup, when the network equipment does not receive the detection message within a period of time, the master and the backup are considered to be invalid, the competition inhibition is cancelled, and the master and the backup are again entered into competition.
2. The method of claim 1, wherein the method comprises: in the step A, the election message further comprises a type field, an survival period and neighbor information, the type field indicates that the selectable types of the message comprise an election message and a maintenance message, the survival period indicates that the message stops transmitting after passing through a plurality of neighbors, the neighbor information comprises an affiliated area, a neighbor identifier, a neighbor IP and a neighbor priority, the affiliated area indicates a sub-area where the neighbor is located, the neighbor identifier indicates that the uniqueness of the neighbor is represented by adopting a mac address of the neighbor as the identifier, the neighbor IP indicates the IP address of the neighbor, and the neighbor priority indicates the priority of the neighbor.
3. The method of claim 1, wherein the method comprises: in step a, the neighbor list includes an affiliated area, a neighbor identifier, a neighbor priority, whether the affiliated area is a master, a neighbor IP, a survival time, and a distance to the neighbor, where the affiliated area represents a sub-area where the neighbor is located, the neighbor identifier represents that the mac address of the neighbor is used as an identifier to represent neighbor uniqueness, the neighbor priority represents the priority of the neighbor, whether the master represents whether the neighbor is a master, the neighbor IP represents an IP address of the neighbor, the survival time represents a time interval for the neighbor to send an adjacent message, and the distance to the neighbor represents the number of network devices that the network device passes through to the neighbor.
4. The method of claim 1, wherein the method comprises: in step A, the
Wherein α + β + γ ═ 1, α, β, γ ∈ (0, 1), a ≡ 255, and n is the core number of the network device CPU, and the CPU is a core number of the network device CPUiThe unit of the frequency of the ith CPU is MHz, m is the number of memory banks in the network equipment, memoryjThe size of the jth memory is represented by GByte, bandwidth is the bandwidth of the backplane of the network equipment, Gbps, alpha, beta and gamma are weight ratios of the CPU, the memory and the backplane bandwidth respectively, and i, j, m, N belongs to N.
5. The method of claim 1, wherein the method comprises: in step a, the priority may also be set manually.
6. The method of claim 3, wherein the method comprises: in step B, the master preferentially sends a detection message to the backup.
7. The method of claim 3, wherein the method comprises: in step B, if the master receives the neighbor detection response message in a plurality of sending periods, the neighbor is accessible, the survival time in the neighbor list is set to be 0, otherwise, the survival time in the neighbor list is set to be overtime.
8. The method of claim 3, wherein the method comprises: in step B, the neighbor message list includes the belonged region in the neighbor list, the neighbor identifier, the neighbor IP, the survival time, and the data of whether the master exists.
9. The method of claim 7, wherein the method comprises: in step B, the neighbor list in the server includes data in the neighbor list advertised by the master and an online status indicating whether the neighbor is online, the online status is updated according to the time-to-live, if the time-to-live is 0, the updated online status is online, and if the time-to-live is overtime, the updated online status is a failure.
10. The method of claim 1, wherein the method comprises: in step C, when the master and backup in the sub-area where the new device is located are working normally, the new device does not become the master.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811196136.9A CN109245940B (en) | 2018-10-15 | 2018-10-15 | Method for discovering and detecting network equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811196136.9A CN109245940B (en) | 2018-10-15 | 2018-10-15 | Method for discovering and detecting network equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109245940A CN109245940A (en) | 2019-01-18 |
| CN109245940B true CN109245940B (en) | 2021-04-27 |
Family
ID=65053557
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811196136.9A Active CN109245940B (en) | 2018-10-15 | 2018-10-15 | Method for discovering and detecting network equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109245940B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110365794B (en) * | 2019-07-30 | 2021-09-14 | 四川虹魔方网络科技有限公司 | Message pushing method and system based on Internet television |
| CN113055252B (en) * | 2021-06-01 | 2021-09-07 | 深圳市科力锐科技有限公司 | Method, device, equipment and storage medium for detecting newly added service host |
| CN117792915A (en) * | 2022-09-22 | 2024-03-29 | 华为技术有限公司 | System, network topology method and electronic equipment thereof |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1725733A (en) * | 2005-06-10 | 2006-01-25 | 杭州华为三康技术有限公司 | Method of route backup in combination equipment and combination equipment |
| CN101610182A (en) * | 2009-06-26 | 2009-12-23 | 杭州华三通信技术有限公司 | Multi-primary apparatus conflict detection method and stack member apparatus in piling up |
| CN102202425A (en) * | 2011-06-24 | 2011-09-28 | 中国人民解放军国防科学技术大学 | Satellite cluster self-organization networking method based on master-slave heterogeneous data transmission module |
| CN102624929A (en) * | 2012-04-20 | 2012-08-01 | 武汉邮电科学研究院 | Wireless sensor network gateway redundancy method based on virtual gateway |
| CN105915426A (en) * | 2016-06-20 | 2016-08-31 | 普联技术有限公司 | Failure recovery method and device of ring network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9526038B2 (en) * | 2013-04-02 | 2016-12-20 | Apple Inc. | Circuit-switched fallback (CSFB) call setup utilizing multiple RF receive chains |
-
2018
- 2018-10-15 CN CN201811196136.9A patent/CN109245940B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1725733A (en) * | 2005-06-10 | 2006-01-25 | 杭州华为三康技术有限公司 | Method of route backup in combination equipment and combination equipment |
| CN101610182A (en) * | 2009-06-26 | 2009-12-23 | 杭州华三通信技术有限公司 | Multi-primary apparatus conflict detection method and stack member apparatus in piling up |
| CN102202425A (en) * | 2011-06-24 | 2011-09-28 | 中国人民解放军国防科学技术大学 | Satellite cluster self-organization networking method based on master-slave heterogeneous data transmission module |
| CN102624929A (en) * | 2012-04-20 | 2012-08-01 | 武汉邮电科学研究院 | Wireless sensor network gateway redundancy method based on virtual gateway |
| CN105915426A (en) * | 2016-06-20 | 2016-08-31 | 普联技术有限公司 | Failure recovery method and device of ring network |
Non-Patent Citations (1)
| Title |
|---|
| 一种改进的主从节点选举算法用于实现集群负载均衡;任乐乐 等;《中国计量学院学报》;20151023;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109245940A (en) | 2019-01-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10257265B2 (en) | Redundancy network protocol system | |
| CN107438016B (en) | Network management method, device, system and storage medium | |
| US10136415B2 (en) | System, security and network management using self-organizing communication orbits in distributed networks | |
| CN109245940B (en) | Method for discovering and detecting network equipment | |
| US9742639B1 (en) | Intelligent network resource discovery and monitoring | |
| CN108259215B (en) | Equipment management method and device | |
| CN103888369A (en) | Ethernet communication method and system and SDN exchanger | |
| CN108449210B (en) | Network routing fault monitoring system | |
| JP2006229967A (en) | High-speed multicast path switching | |
| CN107579860A (en) | Node electoral machinery and device | |
| JP5764820B2 (en) | Transmission system and transmission system control method | |
| CN107317707B (en) | SDN network topology management method based on point coverage set | |
| CN102195857A (en) | Network topology structure and node information gathering method | |
| CN103595626A (en) | Method for achieving dynamic path planning in ring network | |
| CN101009628A (en) | Update method and device for multicast list in the change of switching network topology | |
| Mirkovic et al. | A self-organizing approach to data forwarding in large-scale sensor networks | |
| CN107612772B (en) | Node state detection method and device of payment system | |
| US8908682B2 (en) | Switch discovery protocol for a distributed fabric system | |
| CN101404594B (en) | Hot backup performance test method and apparatus, communication equipment | |
| US20210377125A1 (en) | Network Topology Discovery Method, Device, and System | |
| US11589246B2 (en) | Method of managing distributed self-organizing network by surrounding base station information and base station using the same | |
| CN116827801B (en) | Network topology construction method, device, computer equipment and readable storage medium | |
| US20050086368A1 (en) | System and method for determining nearest neighbor information | |
| CN101657994B (en) | Discovery of disconnected components in a distributed communication network | |
| CN113055197B (en) | Network energy efficiency management method and device and computer readable storage medium |
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 |