CN113839820B - Method and system for searching optimal network updating node during updating service - Google Patents
Method and system for searching optimal network updating node during updating service Download PDFInfo
- Publication number
- CN113839820B CN113839820B CN202111197607.XA CN202111197607A CN113839820B CN 113839820 B CN113839820 B CN 113839820B CN 202111197607 A CN202111197607 A CN 202111197607A CN 113839820 B CN113839820 B CN 113839820B
- Authority
- CN
- China
- Prior art keywords
- connection
- node
- network node
- network
- pool
- 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
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/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
- H04L41/0813—Configuration setting characterised by the conditions triggering a change of settings
- H04L41/082—Configuration setting characterised by the conditions triggering a change of settings the condition being updates or upgrades of network functionality
-
- 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/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
- H04L41/0823—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention provides a method for searching an optimal network node during updating service, which comprises the following steps: step S1, creating an available node pool, obtaining all network nodes of service configuration, and storing all network nodes into the available node pool; s2, creating a standby connection node pool and a preferred connection node pool, and creating concurrent connection tasks and circulating connection tasks; s3, performing concurrent connection task operation or circular connection task operation when the user updates the service, so as to obtain an optimal network node; s4, performing network connection according to the obtained optimal network node information; the invention greatly improves the downloading and updating speed.
Description
Technical Field
The invention relates to the technical field of computer communication, in particular to a method and a system for searching an optimal network updating node during updating service.
Background
Some existing corporate update services typically configure a plurality of network update nodes, with players turning around each update network node before updating to see which update nodes are available, and if so, then updating next. If the network node is slow, the update can be performed, but the update speed is slow, and the network is unstable, the packet is lost or abnormal data packets are generated, so that the update fails. Whereas the faster of the configured network nodes is not used. If the training node encounters a plurality of unavailable nodes in front, waiting for a time to be the unavailable node times out time, and waiting for a longer time; this makes it easy to create very slow updates.
Disclosure of Invention
In order to overcome the above problems, an object of the present invention is to provide a method for searching for an optimal network node during service update, so as to increase the update speed, especially in the case of weak networks, where at least one node is good, and greatly increase the download update speed.
The invention is realized by adopting the following scheme: a method of finding an optimal network node when updating a service, the method comprising the steps of:
step S1, creating an available node pool, obtaining all network nodes of service configuration, and storing all network nodes into the available node pool;
s2, creating a standby connection node pool and a preferred connection node pool, and creating concurrent connection tasks and circulating connection tasks;
s3, performing concurrent connection task operation or circular connection task operation when the user updates the service;
the concurrent connection task operation: obtaining N network nodes waiting for connection from an available node pool, opening up N connection threads, and informing an updating function that the connection is available when one of the connection is on, so as to obtain an optimal network node;
the loop connection task operation: sequentially cycling all network nodes waiting for connection in the available node pool, judging whether each network node is in the standby connection node pool, if so, skipping and not operating, otherwise, obtaining the optimal network node;
and S4, performing network connection according to the obtained optimal network node information.
Further, the concurrent connection task operation is further specifically: acquiring N network nodes waiting for connection from an available node pool, opening up N connection threads, processing the N connection threads concurrently, setting infinite timeout time, and running a connection function by each connection thread; when one of the connections is informed that the update function has connection available, asynchronously judging whether the network node is connected to the first connection, if so, adding the network node into a preferred connection node pool, otherwise, sequentially adding the network node into a standby connection node pool; when a network node connection is available, an update is attempted, and if it is found that the connection cannot be updated, the next network node is acquired from the standby connection node pool in the order of addition, and an attempt is made until a network node capable of connection update is acquired, i.e. the network node is selected as the optimal network node.
Further, the obtaining the optimal network node in the operation of the loop connection task is further specifically: sequentially circulating all network nodes waiting for connection to set a timeout threshold value and performing a connection function; judging whether the network node is connected with the first connection, if so, adding a preferred connection node pool, otherwise, sequentially adding a standby connection node pool; when a network node connection is available, an update is attempted, and if it is found that the connection cannot be updated, the next network node is acquired from the standby connection node pool in the order of addition, and an attempt is made until a network node capable of connection update is acquired, i.e. the network node is selected as the optimal network node.
The invention provides a system for searching optimal network nodes during updating service, which comprises a node pool creation module, a task execution module and a network connection module;
the node pool creation module is used for creating an available node pool, obtaining all network nodes of service configuration, and storing all network nodes into the available node pool;
the creation task module is used for creating a standby connection node pool and a preferred connection node pool, and creating concurrent connection tasks and circulating connection tasks;
the task execution module is used for carrying out concurrent connection task operation or cyclic connection task operation when a user updates service;
the concurrent connection task operation: obtaining N network nodes waiting for connection from an available node pool, opening up N connection threads, and informing an updating function that the connection is available when one of the connection is on, so as to obtain an optimal network node;
the loop connection task operation: sequentially cycling all network nodes waiting for connection in the available node pool, judging whether each network node is in the standby connection node pool, if so, skipping and not operating, otherwise, obtaining the optimal network node;
and the network connection module is used for carrying out network connection according to the obtained optimal network node information.
Further, the concurrent connection task operation is further specifically: acquiring N network nodes waiting for connection from an available node pool, opening up N connection threads, processing the N connection threads concurrently, setting infinite timeout time, and running a connection function by each connection thread; when one of the connections is informed that the update function has connection available, asynchronously judging whether the network node is connected to the first connection, if so, adding the network node into a preferred connection node pool, otherwise, sequentially adding the network node into a standby connection node pool; when a network node connection is available, an update is attempted, and if it is found that the connection cannot be updated, the next network node is acquired from the standby connection node pool in the order of addition, and an attempt is made until a network node capable of connection update is acquired, i.e. the network node is selected as the optimal network node.
Further, the obtaining the optimal network node in the operation of the loop connection task is further specifically: sequentially circulating all network nodes waiting for connection to set a timeout threshold value and performing a connection function; judging whether the network node is connected with the first connection, if so, adding a preferred connection node pool, otherwise, sequentially adding a standby connection node pool; when a network node connection is available, an update is attempted, and if it is found that the connection cannot be updated, the next network node is acquired from the standby connection node pool in the order of addition, and an attempt is made until a network node capable of connection update is acquired, i.e. the network node is selected as the optimal network node.
The invention has the beneficial effects that: 1. the method is beneficial to improving the updating speed, especially in the case of weak networks, and the downloading updating speed is greatly improved in the case that at least one node is good in network. 2. The configuration personnel are planned, so that technicians do not need to be entangled in the order of configuring the network nodes, and the same version is uniformly configured for updating.
Drawings
FIG. 1 is a schematic flow chart of the method of the present invention.
FIG. 2 is a flow chart of a method according to an embodiment of the invention.
Fig. 3 is a schematic diagram of the system principle of the present invention.
Detailed Description
The invention is further described below with reference to the accompanying drawings.
Referring to fig. 1, the present invention provides a method for searching for an optimal network node during service update, the method comprising the following steps:
step S1, creating an available node pool, obtaining all network nodes of service configuration, and storing all network nodes into the available node pool;
s2, creating a standby connection node pool and a preferred connection node pool, and creating concurrent connection tasks and circulating connection tasks;
s3, performing concurrent connection task operation or circular connection task operation when the user updates the service;
the concurrent connection task operation: obtaining N network nodes waiting for connection from an available node pool, opening up N connection threads, and informing an updating function that the connection is available when one of the connection is on, so as to obtain an optimal network node;
the loop connection task operation: sequentially cycling all network nodes waiting for connection in the available node pool, judging whether each network node is in the standby connection node pool, if so, skipping and not operating, otherwise, obtaining the optimal network node;
and S4, performing network connection according to the obtained optimal network node information.
The invention is further described with reference to the following specific examples:
referring to fig. 2, a method for searching an optimal network node during service updating according to the present invention obtains all configured network nodes. The method is divided into 2 tasks: concurrent connection tasks and cyclic connection tasks; concurrent connection tasks: by concurrency of n connection threads, n is the number of network nodes. When there is a connection, the preferred connection node pool or the standby connection node pool is added according to whether the first connection node pool or the standby connection node pool is added. And (3) circularly connecting tasks: and circulating all the network nodes, judging whether each node is in a standby connection node pool, if so, skipping, otherwise, adding the first connected network node into a preferred connection node pool or a standby connection node pool according to whether the first connected network node exists.
The method structure of the invention is as follows:
updating function, concurrent connection task, cyclic connection task and connection function;
the method mainly comprises the following steps:
a: update function
1) Creating a waiting available node pool, and putting all n network nodes to be connected into the pool. And creating concurrent connection tasks and cyclic connection tasks.
2) The updating function adds the network node into the preferred connection node pool according to whether the first network node is connected or not, if yes, the network node is added into the standby connection node pool, otherwise, the network node is added into the standby connection node pool in sequence
3) When a connection is available, an update is attempted, and if the connection is found to be unable to be updated, the next network node is acquired from the standby connection node pool in the order of addition for the attempt, and the current optimal connection node is selected.
B: concurrent connection tasks
1) And n threads are concurrent, infinite timeout time is set, and each thread runs a connection function.
2) When one of the connections is on, informing the update function that a connection is available, step 2) of a is performed asynchronously.
C: circulation connection task
1) And sequentially cycling all waiting connection nodes to set shorter timeout time and perform the connection function.
2) When the connection is found to be available, judging whether each network node is in the standby connection node pool, if so, skipping (namely, the network node on the connection and in the standby connection node pool are the optimal network nodes), otherwise, executing the step A2).
D: connection function
1) Based on the network node information, a network connection is attempted.
The concurrent connection task operation is further specifically: acquiring N network nodes waiting for connection from an available node pool, opening up N connection threads, processing the N connection threads concurrently, setting infinite timeout time, and running a connection function by each connection thread; when one of the connections is informed that the update function has connection available, asynchronously judging whether the network node is connected to the first connection, if so, adding the network node into a preferred connection node pool, otherwise, sequentially adding the network node into a standby connection node pool; when a network node connection is available, an update is attempted, and if it is found that the connection cannot be updated, the next network node is acquired from the standby connection node pool in the order of addition, and an attempt is made until a network node capable of connection update is acquired, i.e. the network node is selected as the optimal network node.
The obtaining the optimal network node in the cyclic connection task operation further specifically includes: sequentially circulating all network nodes waiting for connection to set a timeout threshold value and performing a connection function; judging whether the network node is connected with the first connection, if so, adding a preferred connection node pool, otherwise, sequentially adding a standby connection node pool; when a network node connection is available, an update is attempted, and if it is found that the connection cannot be updated, the next network node is acquired from the standby connection node pool in the order of addition, and an attempt is made until a network node capable of connection update is acquired, i.e. the network node is selected as the optimal network node.
Referring to fig. 3, the present invention provides a system for searching for an optimal network node during service update, where the system includes a node pool creation module, a task execution module, and a network connection module;
the node pool creation module is used for creating an available node pool, obtaining all network nodes of service configuration, and storing all network nodes into the available node pool;
the creation task module is used for creating a standby connection node pool and a preferred connection node pool, and creating concurrent connection tasks and circulating connection tasks;
the task execution module is used for carrying out concurrent connection task operation or cyclic connection task operation when a user updates service;
the concurrent connection task operation: obtaining N network nodes waiting for connection from an available node pool, opening up N connection threads, and informing an updating function that the connection is available when one of the connection is on, so as to obtain an optimal network node;
the loop connection task operation: sequentially cycling all network nodes waiting for connection in the available node pool, judging whether each network node is in the standby connection node pool, if so, skipping and not operating, otherwise, obtaining the optimal network node;
and the network connection module is used for carrying out network connection according to the obtained optimal network node information.
The concurrent connection task operation further specifically includes: acquiring N network nodes waiting for connection from an available node pool, opening up N connection threads, processing the N connection threads concurrently, setting infinite timeout time, and running a connection function by each connection thread; when one of the connections is informed that the update function has connection available, asynchronously judging whether the network node is connected to the first connection, if so, adding the network node into a preferred connection node pool, otherwise, sequentially adding the network node into a standby connection node pool; when a network node connection is available, an update is attempted, and if it is found that the connection cannot be updated, the next network node is acquired from the standby connection node pool in the order of addition, and an attempt is made until a network node capable of connection update is acquired, i.e. the network node is selected as the optimal network node.
The obtaining the optimal network node in the cyclic connection task operation further specifically includes: sequentially circulating all network nodes waiting for connection to set a timeout threshold value and performing a connection function; judging whether the network node is connected with the first connection, if so, adding a preferred connection node pool, otherwise, sequentially adding a standby connection node pool; when a network node connection is available, an update is attempted, and if it is found that the connection cannot be updated, the next network node is acquired from the standby connection node pool in the order of addition, and an attempt is made until a network node capable of connection update is acquired, i.e. the network node is selected as the optimal network node.
The application scene of the invention is as follows:
1. only 1 node of the pool of waiting available nodes is as follows:
Server1＝U1 172.65.226.2 6010；
when updating, the first run is connected to the node Server1.
2. When the pool of waiting available nodes contains a remote node and a local node, such as:
Server1＝U1 192.168.2.1 9530；
Server2＝U2 172.65.226.3 6010；
Server3＝U3 172.65.226.4 6007；
Server4＝U4 172.65.226.5 6009；
Server5＝U5 172.65.226.6 6008；
when updating, the method comprises the following steps:
whether a loop task or a concurrent task, the local node is connected first. Because the local node consumes the least time (server1=u1.192.168.2.1 is the local node); then the links of other concurrent threads are connected again. Therefore, a preferred connection node pool and a standby connection node pool are set, connection updating operation is carried out, and when the standby connection node pool is selected for updating, the next network node is acquired from the standby connection node pool according to the joining sequence for trying.
The foregoing description is only of the preferred embodiments of the invention, and all changes and modifications that come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein.
Claims (2)
1. A method for searching for an optimal network node when updating a service, characterized by: the method comprises the following steps:
step S1, creating an available node pool, obtaining all network nodes of service configuration, and storing all network nodes into the available node pool;
s2, creating a standby connection node pool and a preferred connection node pool, and creating concurrent connection tasks and circulating connection tasks;
s3, performing concurrent connection task operation or circular connection task operation when the user updates the service;
the concurrent connection task operation: obtaining N network nodes waiting for connection from an available node pool, opening up N connection threads, and informing an updating function that the connection is available when one of the connection is on, so as to obtain an optimal network node;
the loop connection task operation: sequentially cycling all network nodes waiting for connection in the available node pool, judging whether each network node is in the standby connection node pool, if so, skipping and not operating, otherwise, obtaining the optimal network node;
the concurrent connection task operation further specifically includes: acquiring N network nodes waiting for connection from an available node pool, opening up N connection threads, processing the N connection threads concurrently, setting infinite timeout time, and running a connection function by each connection thread; when one of the connections is informed that the update function has connection available, asynchronously judging whether the network node is connected to the first connection, if so, adding the network node into a preferred connection node pool, otherwise, sequentially adding the network node into a standby connection node pool; when a network node connection is available, attempting to update, if the connection is found to be unable to update, acquiring a next network node from the standby connection node pool according to the joining sequence, and attempting until a network node capable of updating the connection is acquired, namely selecting the network node as an optimal network node;
the obtaining the optimal network node in the cyclic connection task operation further specifically includes: sequentially circulating all network nodes waiting for connection to set a timeout threshold value and performing a connection function; judging whether the network node is connected with the first connection, if so, adding a preferred connection node pool, otherwise, sequentially adding a standby connection node pool; when a network node connection is available, attempting to update, if the connection is found to be unable to update, acquiring a next network node from the standby connection node pool according to the joining sequence, and attempting until a network node capable of updating the connection is acquired, namely selecting the network node as an optimal network node;
and S4, performing network connection according to the obtained optimal network node information.
2. A system for searching for an optimal network node when updating a service, characterized by: the system comprises a node pool creation module, a task execution module and a network connection module;
the node pool creation module is used for creating an available node pool, obtaining all network nodes of service configuration, and storing all network nodes into the available node pool;
the creation task module is used for creating a standby connection node pool and a preferred connection node pool, and creating concurrent connection tasks and circulating connection tasks;
the task execution module is used for carrying out concurrent connection task operation or cyclic connection task operation when a user updates service;
the concurrent connection task operation: obtaining N network nodes waiting for connection from an available node pool, opening up N connection threads, and informing an updating function that the connection is available when one of the connection is on, so as to obtain an optimal network node;
the loop connection task operation: sequentially cycling all network nodes waiting for connection in the available node pool, judging whether each network node is in the standby connection node pool, if so, skipping and not operating, otherwise, obtaining the optimal network node;
the concurrent connection task operation further specifically includes: acquiring N network nodes waiting for connection from an available node pool, opening up N connection threads, processing the N connection threads concurrently, setting infinite timeout time, and running a connection function by each connection thread; when one of the connections is informed that the update function has connection available, asynchronously judging whether the network node is connected to the first connection, if so, adding the network node into a preferred connection node pool, otherwise, sequentially adding the network node into a standby connection node pool; when a network node connection is available, attempting to update, if the connection is found to be unable to update, acquiring a next network node from the standby connection node pool according to the joining sequence, and attempting until a network node capable of updating the connection is acquired, namely selecting the network node as an optimal network node;
the obtaining the optimal network node in the cyclic connection task operation further specifically includes: sequentially circulating all network nodes waiting for connection to set a timeout threshold value and performing a connection function; judging whether the network node is connected with the first connection, if so, adding a preferred connection node pool, otherwise, sequentially adding a standby connection node pool; when a network node connection is available, an update is attempted, and if it is found that the connection cannot be updated, the next network node is acquired from the standby connection node pool in the order of addition, and an attempt is made until a network node capable of connection update is acquired, i.e. the network node is selected as the optimal network
Connecting nodes;
and the network connection module is used for carrying out network connection according to the obtained optimal network node information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111197607.XA CN113839820B (en) | 2021-10-14 | 2021-10-14 | Method and system for searching optimal network updating node during updating service |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111197607.XA CN113839820B (en) | 2021-10-14 | 2021-10-14 | Method and system for searching optimal network updating node during updating service |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113839820A CN113839820A (en) | 2021-12-24 |
| CN113839820B true CN113839820B (en) | 2023-08-11 |
Family
ID=78968820
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111197607.XA Active CN113839820B (en) | 2021-10-14 | 2021-10-14 | Method and system for searching optimal network updating node during updating service |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113839820B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101019440A (en) * | 2004-09-16 | 2007-08-15 | 艾利森电话股份有限公司 | Routing based on transmission utilization |
| CN101399851A (en) * | 2008-10-30 | 2009-04-01 | 北京邮电大学 | Multi-source scheduling method for nodes in wireless peer-to-peer network |
| CN102035697A (en) * | 2010-12-31 | 2011-04-27 | 中国电子科技集团公司第十五研究所 | Concurrent connections performance testing system and method for file system |
| CN103491649A (en) * | 2013-10-10 | 2014-01-01 | 成都达信通通讯设备有限公司 | Method for achieving WIFI synchronizing APN network multichannel concurrent Internet surfing and automatically giving preference to WIFI networking |
| CN107241386A (en) * | 2017-05-05 | 2017-10-10 | 中广热点云科技有限公司 | A kind of network node screening technique and system |
| CN107835520A (en) * | 2017-09-26 | 2018-03-23 | 平安科技（深圳）有限公司 | Wifi hotspot connection method, device and storage medium |
| CN110784549A (en) * | 2019-11-01 | 2020-02-11 | 深圳市网心科技有限公司 | Network node selection method and device, first network node and storage medium |
| CN112491719A (en) * | 2020-10-26 | 2021-03-12 | 网宿科技股份有限公司 | Network node selection method, equipment and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE102012203231A1 (en) * | 2012-03-01 | 2013-09-05 | Continental Automotive Gmbh | Method for mobile radio communication and communication device |
-
2021
- 2021-10-14 CN CN202111197607.XA patent/CN113839820B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101019440A (en) * | 2004-09-16 | 2007-08-15 | 艾利森电话股份有限公司 | Routing based on transmission utilization |
| CN101399851A (en) * | 2008-10-30 | 2009-04-01 | 北京邮电大学 | Multi-source scheduling method for nodes in wireless peer-to-peer network |
| CN102035697A (en) * | 2010-12-31 | 2011-04-27 | 中国电子科技集团公司第十五研究所 | Concurrent connections performance testing system and method for file system |
| CN103491649A (en) * | 2013-10-10 | 2014-01-01 | 成都达信通通讯设备有限公司 | Method for achieving WIFI synchronizing APN network multichannel concurrent Internet surfing and automatically giving preference to WIFI networking |
| CN107241386A (en) * | 2017-05-05 | 2017-10-10 | 中广热点云科技有限公司 | A kind of network node screening technique and system |
| CN107835520A (en) * | 2017-09-26 | 2018-03-23 | 平安科技（深圳）有限公司 | Wifi hotspot connection method, device and storage medium |
| CN110784549A (en) * | 2019-11-01 | 2020-02-11 | 深圳市网心科技有限公司 | Network node selection method and device, first network node and storage medium |
| CN112491719A (en) * | 2020-10-26 | 2021-03-12 | 网宿科技股份有限公司 | Network node selection method, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113839820A (en) | 2021-12-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1495580B1 (en) | Policy based system management | |
| US20040230670A1 (en) | Method and system for representing, configuring and deploying distributed applications | |
| KR20110040934A (en) | Intelligent mobile device management client | |
| US6738781B1 (en) | Generic command interface for multiple executable routines having character-based command tree | |
| EP1763775A1 (en) | Device management method for device management system | |
| EP3101842B1 (en) | Method, system and computer readable medium for network management automation | |
| US20170180910A1 (en) | Loop Avoidance in Middle-Node-to-Middle-Node Registration in M2M Networks | |
| EP3974960A1 (en) | Method and system for automated testing of web service apis | |
| CN113839820B (en) | Method and system for searching optimal network updating node during updating service | |
| CN108536541B (en) | Process engine object processing method and device | |
| US20050152288A1 (en) | Apparatus and method providing unified network management | |
| WO1999034557A1 (en) | Method and system for software version management in a network management system | |
| US8190723B2 (en) | Method and system for automatically determining commands for a network element | |
| CN115729961A (en) | Data query method, device, equipment and computer readable storage medium | |
| WO2017001916A1 (en) | System and method for reacquiring a running service after restarting a configurable platform instance | |
| CN111385110B (en) | Network management method and device | |
| CN114780800A (en) | Multilink routing management method and device | |
| CN114791985A (en) | Domain name matching method and device and prefix tree updating method and device | |
| CN111191103B (en) | Method, device and storage medium for identifying and analyzing enterprise subject information from internet | |
| CN114063606A (en) | PLC protocol fuzzy test method and device, electronic equipment and storage medium | |
| Nanz et al. | Topology-dependent abstractions of broadcast networks | |
| CN112650573B (en) | Task scheduling method and device | |
| WO2018168343A1 (en) | Software radio equipment and method of using wireless communication software program | |
| Margolin et al. | RDMA-based Library for Collective Operations in MPI | |
| CN116055569B (en) | Method, system, computer device and storage medium for custom switching time zone |
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 |