CN113839820A - Method and system for searching optimal network updating node during service updating - Google Patents
Method and system for searching optimal network updating node during service updating Download PDFInfo
- Publication number
- CN113839820A CN113839820A CN202111197607.XA CN202111197607A CN113839820A CN 113839820 A CN113839820 A CN 113839820A CN 202111197607 A CN202111197607 A CN 202111197607A CN 113839820 A CN113839820 A CN 113839820A
- Authority
- CN
- China
- Prior art keywords
- connection
- node
- network node
- pool
- network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
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/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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a method for searching an optimal network node during service updating, which comprises the following steps: step S1, an available node pool is created, all network nodes of service configuration are obtained, and all network nodes are stored in the available node pool; step S2, creating a standby connection node pool and an optimal connection node pool, and creating a concurrent connection task and a circular connection task; step S3, when the user updates the service, the concurrent connection task operation or the circular connection task operation is carried out, thereby obtaining the optimal network node; step 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 deploy multiple network update nodes, and players can go through the rounds of each update network node before updating to see which update node is available, and if so, then update the network. At this time, if the speed of the network node is slow, although the update can be performed, the update speed is slow, and the network is unstable, packet loss or abnormal data packets may occur, resulting in update failure. And those with faster nodes in the configured network nodes are not used. If the round training node encounters a plurality of nodes with unavailable front, the node with unavailable front is overtime after the time, and the round training node waits for a long time; this tends to result in very slow update rates.
Disclosure of Invention
In order to overcome the above problems, the present invention provides a method for searching an optimal network node during updating service, which improves the updating speed, and especially greatly improves the downloading updating speed in the case of weak network, in which at least one node is in good network.
The invention is realized by adopting the following scheme: a method for finding an optimal network node when updating services, the method comprising the steps of:
step S1, an available node pool is created, all network nodes of service configuration are obtained, and all network nodes are stored in the available node pool;
step S2, creating a standby connection node pool and an optimal connection node pool, and creating a concurrent connection task and a circular connection task;
step S3, when the user updates the service, the concurrent connection task operation or the circular connection task operation is carried out;
the concurrent connection task operates: acquiring N network nodes waiting for connection from an available node pool, opening N connection threads, and informing an updating function that connection is available when one of the connection threads is connected so as to acquire an optimal network node;
the loop connection task operates as follows: sequentially circulating all network nodes waiting for connection in the available node pool, and judging whether each network node is in the standby connection node pool, if so, skipping over and not operating, and if not, obtaining the optimal network node;
and step S4, performing network connection according to the obtained optimal network node information.
Further, the concurrent connection task operation further specifically includes: acquiring N network nodes waiting for connection from an available node pool, opening N connection threads, concurrently processing the N connection threads, setting infinite timeout time, and enabling each connection thread to run a connection function; when one of the connections is connected, informing that the updating function has available connection, asynchronously judging whether the network node is connected to the first connection, if so, adding the preferred connection node pool, otherwise, sequentially adding the standby connection node pool; when a network node connection is available, updating is tried, if the connection is found to be incapable of being updated, the next network node is acquired from the standby connection node pool in the joining sequence for trying until the network node capable of being connected and updated is acquired, namely the network node is selected as the optimal network node.
Further, the obtaining of the optimal network node in the operation of the cyclic connection task is further specifically: sequentially circulating all network nodes waiting for connection to set an overtime threshold value to perform a connection function; judging whether the network node is connected to the first connection, if so, adding the network node to a preferred connection node pool, otherwise, sequentially adding the network node to a standby connection node pool; when a network node connection is available, updating is tried, if the connection is found to be incapable of being updated, the next network node is acquired from the standby connection node pool in the joining sequence for trying until the network node capable of being connected and updated is acquired, namely the network node is selected as the optimal network node.
The invention provides a system for searching an optimal network node during updating service, which comprises a node pool creating module, a task executing module and a network connecting module, wherein the node pool creating module is used for creating a task pool;
the node pool creating module is used for creating an available node pool, acquiring all network nodes of service configuration, and storing all the network nodes into the available node pool;
the task creating module is used for creating a standby connection node pool and an optimal connection node pool, and creating a concurrent connection task and a cyclic connection task;
the task execution module performs concurrent connection task operation or circular connection task operation when the user updates the service;
the concurrent connection task operates: acquiring N network nodes waiting for connection from an available node pool, opening N connection threads, and informing an updating function that connection is available when one of the connection threads is connected so as to acquire an optimal network node;
the loop connection task operates as follows: sequentially circulating all network nodes waiting for connection in the available node pool, and judging whether each network node is in the standby connection node pool, if so, skipping over and not operating, and if not, 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 further specifically includes: acquiring N network nodes waiting for connection from an available node pool, opening N connection threads, concurrently processing the N connection threads, setting infinite timeout time, and enabling each connection thread to run a connection function; when one of the connections is connected, informing that the updating function has available connection, asynchronously judging whether the network node is connected to the first connection, if so, adding the preferred connection node pool, otherwise, sequentially adding the standby connection node pool; when a network node connection is available, updating is tried, if the connection is found to be incapable of being updated, the next network node is acquired from the standby connection node pool in the joining sequence for trying until the network node capable of being connected and updated is acquired, namely the network node is selected as the optimal network node.
Further, the obtaining of the optimal network node in the operation of the cyclic connection task is further specifically: sequentially circulating all network nodes waiting for connection to set an overtime threshold value to perform a connection function; judging whether the network node is connected to the first connection, if so, adding the network node to a preferred connection node pool, otherwise, sequentially adding the network node to a standby connection node pool; when a network node connection is available, updating is tried, if the connection is found to be incapable of being updated, the next network node is acquired from the standby connection node pool in the joining sequence for trying until the network node capable of being connected and updated is acquired, namely the network node is selected as the optimal network node.
The invention has the beneficial effects that: 1. the method is favorable for improving the updating speed, and particularly under the condition of weak network, the downloading updating speed can be greatly improved under the condition that at least one node is good in network. 2. The method is beneficial to planning the configuration personnel, so that the technical personnel do not need to be entangled in the sequence of the configuration network nodes, and the same version is uniformly configured and updated.
Drawings
FIG. 1 is a schematic flow diagram of the process of the present invention.
FIG. 2 is a schematic flow chart of a method according to an embodiment of the present invention.
Fig. 3 is a schematic diagram of the system 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 an optimal network node during service update, which includes the following steps:
step S1, an available node pool is created, all network nodes of service configuration are obtained, and all network nodes are stored in the available node pool;
step S2, creating a standby connection node pool and an optimal connection node pool, and creating a concurrent connection task and a circular connection task;
step S3, when the user updates the service, the concurrent connection task operation or the circular connection task operation is carried out;
the concurrent connection task operates: acquiring N network nodes waiting for connection from an available node pool, opening N connection threads, and informing an updating function that connection is available when one of the connection threads is connected so as to acquire an optimal network node;
the loop connection task operates as follows: sequentially circulating all network nodes waiting for connection in the available node pool, and judging whether each network node is in the standby connection node pool, if so, skipping over and not operating, and if not, obtaining the optimal network node;
and step S4, performing network connection according to the obtained optimal network node information.
The invention is further illustrated below with reference to a specific embodiment:
referring to fig. 2, a method for searching an optimal network node in updating service 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 concurrently transmitting n connection threads, n is the number of network nodes. When there is a connection, the preferred connection node pool or the backup connection node pool is added according to whether the first connection node pool is added. And (3) circularly connecting tasks: and circulating all the network nodes, judging whether each node is in the standby connection node pool, if so, skipping, and otherwise, adding the first connected network node into the preferred connection node pool or the standby connection node pool according to whether the first connected network node exists.
The method of the invention has the structure that:
updating function, concurrent connection task, cycle connection task and connection function;
the method mainly comprises the following steps:
a: updating functions
1) And creating a waiting available node pool, and putting n network nodes to be connected into the pool. And creating a concurrent connection task and a circular connection task.
2) The updating function adds the network node into the optimized connection node pool according to whether the first network node is connected, if yes, the network node is added into the standby connection node pool in sequence, otherwise, the network node is added into the standby connection node pool in sequence
3) When a connection is available, updating is tried, if the connection is found to be unable to update, the next network node is obtained from the standby connection node pool in the joining sequence for trying, and the current optimal connection node is selected.
B: concurrent join tasks
1) And (4) concurrently transmitting n threads, setting infinite timeout time, and operating a connection function by each thread.
2) When one of the connections is connected, informing the updating function that the connection is available, and asynchronously executing the step 2) of A.
C: circular connection task
1) And sequentially circulating all the nodes waiting for connection to set shorter timeout time to perform the connection function.
2) When the connection is found to be available, whether each network node is in the standby connection node pool or not is judged, skipping is carried out (namely the network node connected at the time and the network node in the standby connection node pool are the optimal network node), and otherwise, the step 2) of A is carried out.
D: connection function
1) And according to the network node information, network connection is tried.
Wherein the concurrent connection task operation further specifically comprises: acquiring N network nodes waiting for connection from an available node pool, opening N connection threads, concurrently processing the N connection threads, setting infinite timeout time, and enabling each connection thread to run a connection function; when one of the connections is connected, informing that the updating function has available connection, asynchronously judging whether the network node is connected to the first connection, if so, adding the preferred connection node pool, otherwise, sequentially adding the standby connection node pool; when a network node connection is available, updating is tried, if the connection is found to be incapable of being updated, the next network node is acquired from the standby connection node pool in the joining sequence for trying until the network node capable of being connected and updated is acquired, namely the network node is selected as the optimal network node.
The obtaining of the optimal network node in the operation of the cyclic connection task is further specifically as follows: sequentially circulating all network nodes waiting for connection to set an overtime threshold value to perform a connection function; judging whether the network node is connected to the first connection, if so, adding the network node to a preferred connection node pool, otherwise, sequentially adding the network node to a standby connection node pool; when a network node connection is available, updating is tried, if the connection is found to be incapable of being updated, the next network node is acquired from the standby connection node pool in the joining sequence for trying until the network node capable of being connected and updated is acquired, namely the network node is selected as the optimal network node.
Referring to fig. 3, the present invention provides a system for searching an optimal network node during updating service, where the system includes a node pool creation module, a task execution module, and a network connection module;
the node pool creating module is used for creating an available node pool, acquiring all network nodes of service configuration, and storing all the network nodes into the available node pool;
the task creating module is used for creating a standby connection node pool and an optimal connection node pool, and creating a concurrent connection task and a cyclic connection task;
the task execution module performs concurrent connection task operation or circular connection task operation when the user updates the service;
the concurrent connection task operates: acquiring N network nodes waiting for connection from an available node pool, opening N connection threads, and informing an updating function that connection is available when one of the connection threads is connected so as to acquire an optimal network node;
the loop connection task operates as follows: sequentially circulating all network nodes waiting for connection in the available node pool, and judging whether each network node is in the standby connection node pool, if so, skipping over and not operating, and if not, 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 includes: acquiring N network nodes waiting for connection from an available node pool, opening N connection threads, concurrently processing the N connection threads, setting infinite timeout time, and enabling each connection thread to run a connection function; when one of the connections is connected, informing that the updating function has available connection, asynchronously judging whether the network node is connected to the first connection, if so, adding the preferred connection node pool, otherwise, sequentially adding the standby connection node pool; when a network node connection is available, updating is tried, if the connection is found to be incapable of being updated, the next network node is acquired from the standby connection node pool in the joining sequence for trying until the network node capable of being connected and updated is acquired, namely the network node is selected as the optimal network node.
The obtaining of the optimal network node in the operation of the cyclic connection task is further specifically as follows: sequentially circulating all network nodes waiting for connection to set an overtime threshold value to perform a connection function; judging whether the network node is connected to the first connection, if so, adding the network node to a preferred connection node pool, otherwise, sequentially adding the network node to a standby connection node pool; when a network node connection is available, updating is tried, if the connection is found to be incapable of being updated, the next network node is acquired from the standby connection node pool in the joining sequence for trying until the network node capable of being connected and updated is acquired, namely the network node is selected as the optimal network node.
The application scenarios of the invention are as follows:
1. waiting for only 1 node from the available node pool is as follows:
Server1＝U1 172.65.226.2 6010；
during updating, the first node Server1 is connected to the normal running node.
2. Waiting for the available node pool to contain the remote node and the local node is as follows:
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:
whether the circular task or the concurrent task is connected firstly by the local node. Because the local node consumes the shortest time (Server1 is U1192.168.2.1 is the local node); then linking other concurrent threads and connecting. 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 obtained from the standby connection node pool according to the adding sequence for trying.
The above description is only a preferred embodiment of the present invention, and all equivalent changes and modifications made in accordance with the claims of the present invention should be covered by the present invention.
Claims (6)
1. A method for searching an optimal network node during service updating is characterized in that: the method comprises the following steps:
step S1, an available node pool is created, all network nodes of service configuration are obtained, and all network nodes are stored in the available node pool;
step S2, creating a standby connection node pool and an optimal connection node pool, and creating a concurrent connection task and a circular connection task;
step S3, when the user updates the service, the concurrent connection task operation or the circular connection task operation is carried out;
the concurrent connection task operates: acquiring N network nodes waiting for connection from an available node pool, opening N connection threads, and informing an updating function that connection is available when one of the connection threads is connected so as to acquire an optimal network node;
the loop connection task operates as follows: sequentially circulating all network nodes waiting for connection in the available node pool, and judging whether each network node is in the standby connection node pool, if so, skipping over and not operating, and if not, obtaining the optimal network node;
and step S4, performing network connection according to the obtained optimal network node information.
2. The method of claim 1, wherein the method comprises the following steps: the concurrent connection task operation further includes: acquiring N network nodes waiting for connection from an available node pool, opening N connection threads, concurrently processing the N connection threads, setting infinite timeout time, and enabling each connection thread to run a connection function; when one of the connections is connected, informing that the updating function has available connection, asynchronously judging whether the network node is connected to the first connection, if so, adding the preferred connection node pool, otherwise, sequentially adding the standby connection node pool; when a network node connection is available, updating is tried, if the connection is found to be incapable of being updated, the next network node is acquired from the standby connection node pool in the joining sequence for trying until the network node capable of being connected and updated is acquired, namely the network node is selected as the optimal network node.
3. The method of claim 1, wherein the method comprises the following steps: the obtaining of the optimal network node in the operation of the cyclic connection task is further specifically as follows: sequentially circulating all network nodes waiting for connection to set an overtime threshold value to perform a connection function; judging whether the network node is connected to the first connection, if so, adding the network node to a preferred connection node pool, otherwise, sequentially adding the network node to a standby connection node pool; when a network node connection is available, updating is tried, if the connection is found to be incapable of being updated, the next network node is acquired from the standby connection node pool in the joining sequence for trying until the network node capable of being connected and updated is acquired, namely the network node is selected as the optimal network node.
4. A system for finding an optimal network node when updating services, comprising: the system comprises a node pool creating module, a task executing module and a network connecting module;
the node pool creating module is used for creating an available node pool, acquiring all network nodes of service configuration, and storing all the network nodes into the available node pool;
the task creating module is used for creating a standby connection node pool and an optimal connection node pool, and creating a concurrent connection task and a cyclic connection task;
the task execution module performs concurrent connection task operation or circular connection task operation when the user updates the service;
the concurrent connection task operates: acquiring N network nodes waiting for connection from an available node pool, opening N connection threads, and informing an updating function that connection is available when one of the connection threads is connected so as to acquire an optimal network node;
the loop connection task operates as follows: sequentially circulating all network nodes waiting for connection in the available node pool, and judging whether each network node is in the standby connection node pool, if so, skipping over and not operating, and if not, 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.
5. The method of claim 4, wherein the method comprises the following steps: the concurrent connection task operation further includes: acquiring N network nodes waiting for connection from an available node pool, opening N connection threads, concurrently processing the N connection threads, setting infinite timeout time, and enabling each connection thread to run a connection function; when one of the connections is connected, informing that the updating function has available connection, asynchronously judging whether the network node is connected to the first connection, if so, adding the preferred connection node pool, otherwise, sequentially adding the standby connection node pool; when a network node connection is available, updating is tried, if the connection is found to be incapable of being updated, the next network node is acquired from the standby connection node pool in the joining sequence for trying until the network node capable of being connected and updated is acquired, namely the network node is selected as the optimal network node.
6. The method of claim 4, wherein the method comprises the following steps: the obtaining of the optimal network node in the operation of the cyclic connection task is further specifically as follows: sequentially circulating all network nodes waiting for connection to set an overtime threshold value to perform a connection function; judging whether the network node is connected to the first connection, if so, adding the network node to a preferred connection node pool, otherwise, sequentially adding the network node to a standby connection node pool; when a network node connection is available, updating is tried, if the connection is found to be incapable of being updated, the next network node is acquired from the standby connection node pool in the joining sequence for trying until the network node capable of being connected and updated is acquired, namely the network node is selected as the optimal network node.
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 true CN113839820A (en) | 2021-12-24 |
| CN113839820B 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 (9)
| 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 |
| US20150024764A1 (en) * | 2012-03-01 | 2015-01-22 | Continental Automotive Gmbh | Method For Mobile Radio Communication and Communication Device |
| 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 |
-
2021
- 2021-10-14 CN CN202111197607.XA patent/CN113839820B/en active Active
Patent Citations (9)
| 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 |
| US20150024764A1 (en) * | 2012-03-01 | 2015-01-22 | Continental Automotive Gmbh | Method For Mobile Radio Communication and Communication Device |
| 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 |
|---|---|
| CN113839820B (en) | 2023-08-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106302632B (en) | Downloading method of basic mirror image and management node | |
| EP3101842B1 (en) | Method, system and computer readable medium for network management automation | |
| US10924326B2 (en) | Method and system for clustered real-time correlation of trace data fragments describing distributed transaction executions | |
| CN116737130B (en) | Method, system, equipment and storage medium for compiling modal-oriented intermediate representation | |
| EP3974960A1 (en) | Method and system for automated testing of web service apis | |
| CN114130035A (en) | User matching method, device, equipment and storage medium | |
| CN108536541B (en) | Process engine object processing method and device | |
| CN108846085A (en) | A kind of ID generation method, device, electronic equipment and system | |
| CN113839820A (en) | Method and system for searching optimal network updating node during service updating | |
| CN114584629B (en) | Transaction message processing method and device | |
| CN110347413A (en) | Software configuration information update method and device | |
| CN114063606B (en) | PLC protocol fuzzy test method and device, electronic equipment and storage medium | |
| CN115729961A (en) | Data query method, device, equipment and computer readable storage medium | |
| US20180189080A1 (en) | System And Method For Reacquiring A Running Service After Restarting A Configurable Platform Instance | |
| US6550055B1 (en) | Method and apparatus for cheating an information report resulting from a diagnostic session | |
| CN114398286A (en) | Automatic testing method and device, electronic equipment and storage medium | |
| CN111831394B (en) | Method and device for deploying stateful pod by kubernetes | |
| CN114115911A (en) | System construction strategy generation method based on directed acyclic graph | |
| CN111385110B (en) | Network management method and device | |
| CN112306664B (en) | Service restarting method, system, equipment and medium | |
| Cui et al. | Qos-aware dependency management for component-based systems | |
| CN107306202B (en) | Network management method, server, client and system | |
| Nanz et al. | Topology-dependent abstractions of broadcast networks | |
| CN110597607B (en) | Execution method and device of asynchronous application program, storage medium and electronic equipment | |
| CN112564927B (en) | Self-adaptive resource multi-domain dynamic organization method |
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 |