CN110535706B - Automatic cooperative scheduling method based on local area network - Google Patents
Automatic cooperative scheduling method based on local area network Download PDFInfo
- Publication number
- CN110535706B CN110535706B CN201910822143.3A CN201910822143A CN110535706B CN 110535706 B CN110535706 B CN 110535706B CN 201910822143 A CN201910822143 A CN 201910822143A CN 110535706 B CN110535706 B CN 110535706B
- Authority
- CN
- China
- Prior art keywords
- ring
- network
- computer
- computers
- virtual
- 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
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/42—Loop networks
- H04L12/422—Synchronisation for ring networks
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention relates to the technical field of task scheduling and discloses an automatic cooperative scheduling method based on a local area network. Forming one or more ring networks by computers in the local area network through IP, setting an intra-ring index by the computer in each ring network according to the IP, wherein the computer is provided with a synchronous clock, and a fixed TIME difference I _ TIME is formed between adjacent computers in the ring network; when a plurality of looped networks exist, numbering the looped networks of each looped network; computers with the same intra-ring index in ring networks with different numbers form a virtual sub-ring, the index of the virtual sub-ring is determined according to the ring network number, the computers of all nodes in the virtual sub-ring have sleep time, a wake-up notice sent by the nodes in the virtual sub-ring is monitored by the computer of the next node, and the computer of the next node does not receive the wake-up notice and then executes the current task. The scheme enables the computer in the local area network to realize the task formulation and execution under the condition of no scheduling system, and reduces the architecture of the system.
Description
Technical Field
The invention relates to the technical field of task scheduling, in particular to an automatic cooperative scheduling method based on a local area network.
Background
Under the condition that a computer in the local area network does not have a central server, only one machine executes the annular task at the same time in a self-coordinated scheduling mode, so that the same task can be prevented from being executed by a plurality of machines at the same time, and the resource waste is avoided; if the scene is a data updating scene, under the condition that a central server is not provided, a local area network only needs to go to the center to update data once, and then updates the data to other computers in a P2P mode, so that the bandwidth can be effectively reduced.
In the prior art, a scheduling system is needed to realize self-coordinated scheduling in a local area network. The scheduling system comprises a scheduling center and task nodes, and can realize that one task is formulated to a computer to be executed. However, in the prior art, the scheduling system is a set of dedicated system, and needs a special scheduling center and task nodes, and although the scheduling system has strong functions, the structure of the scheduling system is too large. In addition, more resources are needed to establish a scheduling system, and when one scheduling system is established, the scheduling system cannot be universally used in all local area network scenarios.
In the prior art, to implement multi-layer update, data in a center needs to be updated to an update node in a local area network and distributed to other nodes through the update node. Therefore, in the prior art, multi-layer updating needs a special updating node, and if the updating node is single, the reliability of the node directly influences the updating effect; if the number of the nodes is multiple, only one node cannot be guaranteed to update at the same time.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: aiming at the existing problems, an automatic cooperative scheduling method based on a local area network is provided.
The technical scheme adopted by the invention is as follows: an automatic cooperative scheduling method based on a local area network comprises the following steps:
forming one or more ring networks by computers in the local area network through IP, setting an intra-ring index by the computer in each ring network according to the IP, wherein the computer is provided with a synchronous clock, and a fixed TIME difference I _ TIME is formed between adjacent computers in the ring network;
when a plurality of looped networks exist, numbering the looped networks of each looped network; computers with the same intra-ring index in ring networks with different numbers form a virtual sub-ring, the index of the virtual sub-ring is determined according to the ring network number, the computers of all nodes in the virtual sub-ring have sleep time, a wake-up notice sent by the nodes in the virtual sub-ring is monitored by the computer of the next node, and the computer of the next node does not receive the wake-up notice and then executes the current task.
Further, the automatic cooperative scheduling method based on the local area network further includes the following process that when the computer in the virtual sub-ring where a certain computer in the ring network is located executes the current task, other computers in the virtual sub-ring do not execute the current task any more, and the scheduling start time of the next computer in the ring network jumps to the virtual sub-ring where the next computer in the ring network is located to perform circulation: the computers of all the nodes in the virtual subring have sleep time, the awakening notification sent by the nodes in the virtual subring is monitored by the computer of the next node in the virtual subring, when the computer of the next node in the virtual subring does not receive the awakening notification, the current task is executed, and so on.
Further, for a virtual subring where a certain computer in the ring network is located, when all computers in the virtual subring are awakened, no computer executes tasks, and then the virtual subring where the next computer in the ring network is located is awakened at the scheduling start time of the next computer in the ring network.
Further, if the scheduling start TIME of a computer in the ring network is T, the scheduling start TIME T _ NEXT of the NEXT computer in the ring network is T + I _ TIME.
Furthermore, a plurality of ring networks are formed by computers in one network segment.
Further, when a plurality of ring networks are formed by computers in one network segment, the method for calculating the ring network number R _ ID is as follows: dividing the IP tail number T _ IP by the number N of computers in the ring network to obtain an integral value, and adding 1 to the integral value to obtain a ring network number R _ ID; indexing in a ring: r _ INDEX ═ T _ IP- (R _ ID-1) × N; the INDEX V _ R _ INDEX of the virtual sub-ring is R _ ID.
Furthermore, the number of the computers in the ring network is determined by factoring the number of the computers in the local area network.
Furthermore, a plurality of ring networks are formed by computers in a plurality of network segments, and the computer of each ring network comes from the same network segment.
Further, when a plurality of ring networks are formed by computers in a plurality of network segments, the ring numbers comprise ring numbers S _ V _ R _ ID of different network segments and ring network numbers R _ ID in the same network segment; mapping the third bits of the IP of different network segments into different values, and formulating the ring numbers S _ V _ R _ ID of different network segments according to the mapping values; dividing the IP tail number T _ IP by the number N of computers in the ring network to obtain an integral value, and adding 1 to the integral value to obtain a ring network number R _ ID; indexing in a ring: r _ INDEX ═ T _ IP- (R _ ID-1) × N; the INDEX V _ R _ INDEX of the virtual sub-ring is S _ V _ R _ ID (R _ NUM/N _ NUM) + R _ ID, where R _ NUM is the total number of ring networks and N _ NUM is the number of network segments.
Further, the looped network comprises the following steps: the initial ring network has no computer, each computer joins the ring network by appointed multicast, after the new computer joins the ring network, all the computers are informed by broadcast to reset the clock, so that the adjacent computers have a fixed time difference.
Compared with the prior art, the beneficial effects of adopting the technical scheme are as follows: the technical scheme of the invention is based on the setting of the ring network in the local area network, a plurality of or one ring network is constructed, the ring network is numbered and the index in the ring network is set, and each computer needs to set a synchronous clock, so that the computer in the local area network can realize the task formulation and execution under the condition of no scheduling system, and the framework of the system is reduced; the scheduling method based on the scheme can be suitable for all local area network scenes because a scheduling system does not need to be configured; the technical scheme of the invention can execute the timing task aiming at the whole local area network; the calculation scheme of the invention does not need to set a synchronization node for a system needing timing synchronization update, any computer in the local area network can be used as the synchronization node, only one computer is needed to synchronize data with a central server at the same time, and then the data is synchronously updated to other machines in a mode of the local area network P2P.
Drawings
Fig. 1 is a schematic diagram of a basic architecture in an embodiment of an automatic cooperative scheduling method based on a local area network according to the present invention.
Fig. 2 is a schematic diagram of a ring network 1 with a multi-ring architecture in an embodiment of an automatic cooperative scheduling method based on a local area network according to the present invention.
Fig. 3 is a schematic diagram of a ring network 2 with a multi-ring architecture in an embodiment of the local area network-based automatic cooperative scheduling method of the present invention.
Fig. 4 is a schematic view of a virtual sub-ring of a multi-ring architecture with only one network segment in an embodiment of the automatic cooperative scheduling method based on a local area network of the present invention.
Fig. 5 is a schematic view of a virtual sub-ring of a multi-ring architecture with different network segments in an embodiment of the automatic co-scheduling method based on a local area network of the present invention.
Detailed Description
The invention is further described below with reference to the accompanying drawings.
Example 1: infrastructure comprising a ring network
As shown in fig. 1, computers in the local area network form a ring network through IP by joining the same multicast network, and in this embodiment, the computers form the ring network from 0 to 255. The IP tail number of the computer in the subnet is used as the ring INDEX (denoted as R _ INDEX) of the ring network. Each computer has a synchronous CLOCK (recorded as SYN _ CLOCK), the CLOCK of each computer is different according to the calculation of IP tail number, and the adjacent computers in the ring network have the same TIME difference (recorded as I _ TIME);
in the basic architecture in embodiment 1, it can be ensured that only one computer in a ring executes a ring task without a scheduling system. However, in this infrastructure, the minimum scheduling time is N, and when all the sub-network computers are working, the maximum scheduling time is 255 × N when the last computer based on the intra-ring index executes the task, and when the task with low time requirement is performed, this scheme can achieve the automatic cooperative scheduling mode.
Example 2: multi-ring framework (Small network)
In the basic architecture of embodiment 1, if there are too many nodes in the ring network, in the worst case, the task scheduling time is too long. Increasing the number of ring networks (the number of ring networks is recorded as R _ NUM), reducing the number of nodes in the ring networks can shorten the maximum scheduling time, but the increase of the number of rings can cause the situation that the same task is executed concurrently at the same moment to increase, the concurrent number is in direct proportion to the number of the ring networks, and the computers indexed in the same ring of different ring networks are combined into a virtual sub-ring in a virtual sub-ring mode to avoid the concurrency problem, and the internal setting of the ring networks is the same as the basic framework in the embodiment 1;
the virtual subring consists of the same R _ INDEX of different ring networks; the total lan has 255 machines at maximum, and 255 is factorized to be 3 × 5 × 17, and the number of exchanges 3, 5, 15, or 17 may be set. The increase in the number of ring networks necessarily leads to an increase in the number of nodes in the virtual subring. Small lans are typically optimized for 3, 5 sub-rings. The following takes five ring networks as an example:
ring 1(R _ ID (1))192.168.0.1-192.168.0.51, ring INDEX R _ INDEX (1-51);
ring 2(R _ ID (2))192.168.0.52-192.168.0.102, ring INDEX R _ INDEX (1-51);
ring 3(R _ ID (3))192.168.0.103-192.168.0.153, ring INDEX R _ INDEX (1-51);
looped network 4(R _ ID (4))192.168.0.154-192.168.0.204, intra-ring INDEX R _ INDEX (1-51);
looped network 5(R _ ID (5))192.168.0.205-192.168.0.255, intra-ring INDEX R _ INDEX (1-51);
as shown in fig. 2 and fig. 3, the ring network 1 and the ring network 2 are formed, and the ring networks 3-5 are similar to the ring network 1 and the ring network 2, and the drawings are not shown. In the ring network 1-ring network 5, the indexes in the ring are all R _ INDEX (1) to form a virtual subring, and by analogy, the indexes in the ring are all R _ INDEX (x) to form a virtual subring, x belongs to [1-51], and each virtual subring in the framework is provided with 5 computers.
The scheduling process of the virtual subring is as follows:
when the clock polls to a certain ring INDEX R _ INDEX in the ring, the same R _ INDEX (1) of different ring networks form a virtual sub-ring as shown in fig. 4.
The intra-ring INDEX (denoted as V _ R _ INDEX) of the virtual subring is determined by the ring number; v _ R _ INDEX ═ R _ ID;
each node in the virtual subring also has sleep time which is as short as possible but is longer than the network delay time of the local area network;
when any node in the virtual sub-ring automatically wakes up, the NEXT node in the virtual ring (denoted as V _ R _ INDEX _ NEXT) monitors whether V _ R _ INDEX has woken up or not by broadcasting a notification to all nodes in the ring. For example, in the virtual sub-ring of R _ INDEX (1), the node of ring network 3(R _ ID ═ 3) monitors the awake state of ring network 2(R _ ID ═ 2).
The virtual subring monitors a wakeup clock (recorded as V _ I _ TIME), the TIME length of V _ R _ INDEX _ NEXT passing through V _ I _ TIME is monitored to monitor whether a wakeup notice of V _ R _ INDEX is received, and if the wakeup notice is not received, the V _ R _ INDEX _ NEXT executes the current task; and so on.
After a certain computer node in the virtual sub-ring formed by the R _ INDEX (1) executes a task, when the scheduling time of the R _ INDEX (2) starts, jumping to the virtual sub-ring where the R _ INDEX (2) is located.
Example 3: multi-ring framework (ultra-large network)
The subnet mask is 255.255.0.0, and a plurality of network segments can also form a local area network. Directly through the way of IP tail number, a plurality of concurrent looped networks can appear at any time, and the calculation rule of the looped network number is consistent with the calculation rule of the looped network number of a network segment;
meanwhile, the third bit of the IP is mapped, the number (N _ NUM) of the network segments is defined, the number (marked as S _ V _ R _ ID) of the super-large ring is defined, and the problem can be solved in a multi-ring architecture mode, and only the number of nodes of the virtual sub-ring is increased compared with the ring network of a single network segment, such as: the two network segments of computers form a local area network: 192.168.2.x.192.168.3.x, the third bits of the two network segment IPs are mapped to 0,1, respectively, and the super large ring numbers S _ V _ R _ ID of the two different network segments are 0, respectively.
The numbering algorithm in the virtual ring is adjusted as follows: v _ R _ INDEX ═ S _ V _ R _ ID (R _ NUM/N _ NUM) + R _ ID (R _ ID is subnet ring number)
In the following, a multi-ring network architecture composed of 192.168.2.x and 192.168.3.x two network segment 510 computers is taken as an example, and the architecture in the ring network is general to the infrastructure in embodiment 1. 255 machines in each network segment are divided into 5 rings, 10(R _ NUM is 10) ring networks and 2 network segments (N _ NUM is 2), and assuming that the average scheduling TIME is set to be 10s (i.e. the fixed TIME difference I _ TIME between two adjacent computers in the same ring network), the virtual sub-ring monitors the wake-up TIME for 200ms (V _ I _ TIME);
appointing: 192.168.2.x. having an S _ V _ R _ ID of 0,192.168.3.x. having an S _ V _ R _ ID of 1.
When no new computer 10s is added to the ring network, 10 machines with R _ INDEX ═ 1 will be woken up (IP of 10 computers is 192.168.1.1, 192.168.1.52, … 192.168.1.205 … 192.168.2.1,192.168.2.52 … 192.168.2.205, as shown in fig. 5, different ring network computers in different network segments form a virtual sub-ring). If a machine with V _ R _ INDEX equal to 1(192.168.1.1) exists, the machine will execute the task at 10s of the clock, if a wake-up notification with V _ R _ INDEX equal to 1 is not received at 10s +200ms V _ R _ INDEX equal to 2(192.168.1.52), V _ R _ INDEX equal to 2 will execute the task, and so on, 192.168.2.205 may execute the task at 10s +9 x 200ms if no wake-up notification is received.
If there is no machine to execute at 10s +9 × 200ms, then at 20s (i.e. the scheduling start time of the next computer R _ INDEX ═ 2 in the ring network), the next virtual ring is called to execute the task, which is the virtual sub-ring where the INDEX R _ INDEX ═ 2 in the ring is located in this embodiment.
If in the worst case only 192.168.2.255 machines are started, then the wake-up time is 51 × 10s +9 × 200ms 511.8s when the wake-up performs auto-scheduling.
In the embodiments 1, 2 and 3, the ring network comprises the following steps:
(1) the initial ring network has no computer;
(2) each computer joins the ring network through the appointed multicast;
(3) after the new computer joins the ring network, all the computers are informed by broadcast to reset the clock, so that the adjacent computers have a fixed time difference.
And the computer can automatically exit or increase after the ring network is formed, and after the ring network is increased, all computers forming the ring network need to be informed by broadcasting to reset clocks, so that a fixed time difference exists between the adjacent computers, the computer exits without any operation, and the whole network is not influenced.
The invention is not limited to the foregoing embodiments. The invention extends to any novel feature or any novel combination of features disclosed in this specification and any novel method or process steps or any novel combination of features disclosed. Those skilled in the art to which the invention pertains will appreciate that insubstantial changes or modifications can be made without departing from the spirit of the invention as defined by the appended claims.
Claims (5)
1. An automatic cooperative scheduling method based on a local area network is characterized by comprising the following steps:
forming one or more ring networks by computers in the local area network through IP, setting an intra-ring index by the computer in each ring network according to the IP, wherein the computer is provided with a synchronous clock, and a fixed TIME difference I _ TIME is formed between adjacent computers in the ring network;
when a plurality of looped networks exist, numbering the looped networks of each looped network; computers with the same intra-ring index in ring networks with different numbers form a virtual sub-ring, the index of the virtual sub-ring is determined according to the ring network number, the computers of all nodes in the virtual sub-ring have sleep time, a wake-up notice sent by the nodes in the virtual sub-ring is monitored by the computer of the next node in the virtual sub-ring, and when the computer of the next node in the virtual sub-ring does not receive the wake-up notice, the current task is executed;
if the scheduling start TIME of a computer in the ring network is T, the scheduling start TIME T _ NEXT of the NEXT computer in the ring network is T + I _ TIME;
when the clock polls to a certain intra-ring index in the ring, the scheduling of the virtual sub-ring formed here is performed: when any node of the virtual subring is automatically awakened, all nodes in the ring are informed through broadcasting, whether the next node in the virtual subring is awakened or not is monitored by the next node in the virtual subring, and when the computer of the next node of the virtual subring does not receive the awakening notice, the current task is executed, and so on;
when a computer in a virtual subring in which a certain computer in the ring network is located executes a current task, other computers in the virtual subring do not execute the current task any more, and the scheduling starting time of the next computer in the ring network jumps to the virtual subring in which the next computer in the ring network is located for circulation;
and (3) for the virtual subring where a certain computer in the ring network is located, when all computers in the virtual subring are awakened and no computer executes tasks, awakening the virtual subring where the next computer in the ring network is located at the scheduling start time of the next computer in the ring network.
2. The local area network-based automatic cooperative scheduling method according to claim 1 wherein a plurality of ring networks are formed by computers in one network segment.
3. The local area network based automatic co-scheduling method of claim 2 wherein the number of computers in the ring network is determined by factoring the number of computers in the local area network.
4. The LAN-based automatic cooperative scheduling method of claim 3 wherein a plurality of ring networks are formed by computers in a plurality of network segments, and the computer of each ring network is from the same network segment.
5. The automatic cooperative scheduling method based on local area network as claimed in claim 1, wherein the ring network comprises the following processes: the initial ring network has no computer, each computer joins the ring network by appointed multicast, after the new computer joins the ring network, all the computers are informed by broadcast to reset the clock, so that the adjacent computers have a fixed time difference.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910822143.3A CN110535706B (en) | 2019-09-02 | 2019-09-02 | Automatic cooperative scheduling method based on local area network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910822143.3A CN110535706B (en) | 2019-09-02 | 2019-09-02 | Automatic cooperative scheduling method based on local area network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110535706A CN110535706A (en) | 2019-12-03 |
| CN110535706B true CN110535706B (en) | 2022-03-01 |
Family
ID=68666024
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910822143.3A Active CN110535706B (en) | 2019-09-02 | 2019-09-02 | Automatic cooperative scheduling method based on local area network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110535706B (en) |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5870387A (en) * | 1996-12-31 | 1999-02-09 | Hewlett-Packard Company | Method and apparatus for initializing a ring |
| CA2331860A1 (en) * | 1998-05-26 | 1999-12-02 | The Dow Chemical Company | Distributed computing environment using real-time scheduling logic and time deterministic architecture |
| CN101819540B (en) * | 2009-02-27 | 2013-03-20 | 国际商业机器公司 | Method and system for scheduling task in cluster |
| CN102215123B (en) * | 2011-06-07 | 2013-10-30 | 南京邮电大学 | Multi-ring-network-topology-structure-based large-scale trunking system |
| CN102394807B (en) * | 2011-08-23 | 2015-03-04 | 京北方信息技术股份有限公司 | System and method for decentralized scheduling of autonomous flow engine load balancing clusters |
| CN105721545B (en) * | 2016-01-20 | 2019-01-22 | 浪潮(北京)电子信息产业有限公司 | A kind of multi-level cluster management implementation method |
| CN108156064A (en) * | 2016-12-06 | 2018-06-12 | 佛山市顺德区顺达电脑厂有限公司 | Computer cluster system |
| CN106953708A (en) * | 2017-03-31 | 2017-07-14 | 山东超越数控电子有限公司 | A kind of clock synchronization system and its method of work based on industrial looped network |
| WO2020037580A1 (en) * | 2018-08-22 | 2020-02-27 | 袁振南 | Ring-shaped server cluster management method and device, and computer storage medium |
-
2019
- 2019-09-02 CN CN201910822143.3A patent/CN110535706B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN110535706A (en) | 2019-12-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105426439B (en) | Metadata processing method and device | |
| CN111190736A (en) | Low-intrusion distributed timing task scheduling system and method based on microservice | |
| CN112764407B (en) | Distributed control non-periodic communication method | |
| KR101752264B1 (en) | Method and device for anchor master selection | |
| CN109040184B (en) | Host node election method and server | |
| CN110933137A (en) | Data synchronization method, system, equipment and readable storage medium | |
| CN106302700B (en) | Distributed system consistent update method and system based on paxos algorithm | |
| US20150229587A1 (en) | Method and apparatus for selecting passive port of transparent clock node based on ptp | |
| CN110391940A (en) | Response method, device, system, equipment and the storage medium of address of service | |
| CN102023899B (en) | Multithreaded data synchronization method and device | |
| CN103475742B (en) | Method and system for determining master control node in cloud computing environment | |
| EP3749027A1 (en) | Anchor master am management method and node | |
| CN112911520B (en) | Method, device and storage medium for determining master node in ad hoc network | |
| CN110535706B (en) | Automatic cooperative scheduling method based on local area network | |
| CN116684024A (en) | FC-AE-1553 boundary clock port state configuration method and system | |
| CN113946535A (en) | Bus macro beat and cycle generating method | |
| CN114172792A (en) | Method and device for realizing sequence number generation method for ensuring high availability of service | |
| CN112152864A (en) | Cluster networking method based on user-defined rules | |
| EP2761457A2 (en) | Fault management traffic reduction in heterogeneous networks | |
| US11711297B2 (en) | Network protocol for battery powered devices within a wireless network | |
| US20230247520A1 (en) | Network protocol for battery powered devices within a wireless network | |
| CN115580542B (en) | Information exchange method and related device of multi-Ethernet switch | |
| CN115226139B (en) | Method and system for pushing and maintaining dual-redundancy high-reliability cluster head of wireless self-organizing network | |
| CN112306664B (en) | Service restarting method, system, equipment and medium | |
| CN115550371B (en) | Pod scheduling method and system based on Kubernetes and cloud platform |
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 | ||
| CP02 | Change in the address of a patent holder | ||
| CP02 | Change in the address of a patent holder |
Address after: No. 602-606, 6th Floor, Building B, No. 539 Jincheng Avenue, Chengdu High tech Zone, China (Sichuan) Pilot Free Trade Zone, Chengdu City, Sichuan Province, 610000 Patentee after: CHENGDU JISHENG TECHNOLOGY Co.,Ltd. Address before: 610000 No. 1, floor 9, unit 2, building 8, No. 1480, north section of Tianfu Avenue, high tech Zone, Chengdu, Sichuan Patentee before: CHENGDU JISHENG TECHNOLOGY Co.,Ltd. |