Distributed park message transmission method, system and medium based on industry correlation

Abstract

The invention discloses a distributed park message transmission method, system and medium based on industrial relevance; it relates to the field of communication technology; the scheme improves the method on the basis of traditional message transmission, the message queue calculates the industrial relevance between the message sending node and the message receiving node through the message sending side in combination with the attribute of the message queue; when different sending nodes send message queues at the same time, the receiving message end arranges all message queues according to the industrial relevance, and receives the message queues according to the arrangement order; it realizes that the key message queues with high industrial relevance and high urgency are received first, and the non-urgent message queues with low industrial relevance are received last, so as to improve the accuracy and timeliness of message transmission.

Description

Technical Field

[0001] The present invention relates to the field of communication technology, and in particular to a distributed park message transmission method, system and medium based on industrial relevance. Background Art

[0002] Unlike traditional centralized industrial parks, the facilities and resources of distributed industrial parks are distributed in different geographical locations. They are production parks that distribute different functional modules such as manufacturing, assembly, and testing in multiple geographical locations. They can not only optimize resource allocation, reduce transportation costs, and improve production flexibility, but also support the seamless integration of remote office and local business, adapt to the flexibility needs of modern work, and better respond to market demand.

[0003] However, due to the cross-regional and multi-node characteristics of distributed industrial parks, message delays are very likely to occur during message transmission, and real-time performance is poor. There are also great challenges in data consistency and synchronization between different nodes. At the same time, data transmission between different nodes also has problems of collision and blockage. Summary of the invention

[0004] The technical problem to be solved by the present invention is: due to the cross-regional and multi-node characteristics of distributed industrial parks, message delays are prone to occur during message transmission, and the real-time performance is poor. There are also great challenges in data consistency and synchronization between different nodes; at the same time, data transmission between different nodes also has collisions and blockages, resulting in the problem of untimely reception of key messages; the purpose of the present invention is to provide a distributed park message transmission method, system and medium based on industrial relevance, and to improve the method on the basis of traditional message transmission. The message queue calculates the industrial relevance between the message sending node and the message receiving node through the message sending side combined with the attributes of the message queue; when different sending nodes send message queues at the same time, the receiving message end arranges all message queues in order according to the industrial relevance, and receives the message queues in the said arrangement order; priority is given to receiving key message queues with high industrial relevance and high urgency, and finally receiving non-urgent message queues with low industrial relevance, thereby improving the accuracy and timeliness of message transmission.

[0005] The present invention is achieved through the following technical solutions:

[0006] This solution provides a distributed park message transmission method based on industrial relevance, wherein the distributed park includes multiple nodes divided according to the industrial function chain; the method includes:

[0007] On the message sending side:

[0008] Obtain the message queue, the properties of the message queue and the message receiving node, and calculate the industry correlation between the message sending node and the message receiving node based on the properties of the message queue;

[0009] Inserting the industry relevance as a message tag into the message queue and sending it to the message receiving node;

[0010] On the message receiving side:

[0011] The total number of message queues n is obtained. When n=1, the message queues are directly received. When n>1, the message tags of each message queue are parsed, and all message queues are arranged in order according to the industry relevance, and then the message queues are received in the said arrangement order.

[0012] Working principle of this scheme: Due to the cross-regional and multi-node characteristics of distributed industrial parks, message delays are prone to occur during message transmission, and the real-time performance is poor. There are also great challenges in data consistency and synchronization between different nodes. At the same time, there are collisions and blockages in data transmission between different nodes, resulting in the problem of untimely reception of key messages. The purpose of the present invention is to improve the method of distributed park message transmission method, system and medium based on industrial relevance on the basis of traditional message transmission. The message queue calculates the industrial relevance between the message sending node and the message receiving node through the message sending side combined with the attributes of the message queue; when message queues are sent simultaneously at different sending nodes, the receiving message end arranges all message queues in order according to the industrial relevance, and receives the message queues in the said arrangement order; it realizes the priority reception of key message queues with high industrial relevance and high urgency, and finally receives non-urgent message queues with low industrial relevance, so as to improve the accuracy and timeliness of message transmission.

[0013] In this solution, the message queue contains only one type of message. The industrial functional chain may involve the transmission of multiple types of messages such as work order information, production progress, quality inspection results, material requirements, fault reports, and operation instructions. The importance and timeliness requirements of each type of message are different. Therefore, each message queue contains only one type of message to facilitate the on-demand delivery of messages of different importance and timeliness requirements.

[0014] Further optimization scheme also includes the following method:

[0015] On the message sending side:

[0016] Based on the attribute judgment of each message queue, if the current message queue is an alarm message or a command message, the current message queue is directly sent to the message receiving node;

[0017] On the message receiving side: when n>1, message queues without message tags are received first, and then the industry relevance of other message queues is analyzed.

[0018] A further optimization scheme is that the message sending node also performs the following process:

[0019] When multiple message queues are obtained at the same time, the priority of each message queue is determined, and the order of industrial relevance calculation is determined according to the priority determination result.

[0020] This solution sorts the message sending levels by priority at the message sending node, and calculates the industrial correlation between the message sending node and the message receiving node; it shortens the message receiving delay time, reduces the network pressure of the message receiving node, and ensures the stability of the network environment of the message receiving node; at the same time, when the message sending node collects multiple message queues at the same time, this solution will also make a priority judgment on each message queue, and determine the order of industrial correlation calculation based on the priority judgment result, give priority to the key message queues for industrial correlation, send them out in time, and improve the accuracy and timeliness of message transmission.

[0021] A further optimization scheme is that the message queue, the attribute information of the message queue and the message receiving node are obtained, and the industrial correlation between the message sending node and the message receiving node is calculated in combination with the attribute information of the message queue; including the method:

[0022] Get all the job items of the message receiving node and the message sending node: the total number of job items of the message receiving node is b, and the total number of job items of the message sending node is a;

[0023] Determine the job item i corresponding to the current message queue according to the attribute information of the message queue; establish a one-dimensional array S, where each column of the array S corresponds to each job item of the message receiving node, and the row of the array S corresponds to the job item corresponding to the current message queue; then the element S in the array S ij Represents the association frequency of job item i corresponding to the current message queue to the jth job item of the message receiving node; 0≤i≤a; 0≤j≤b;

[0024] ;

[0025] Among them, f ij represents the access frequency of the jth job item of the message receiving node to the current message queue; F represents the total access frequency of all job items of the message receiving node to the current message queue; L ij Indicates the number of nodes between the message sending node and the message receiving node;

[0026] Calculate the relative importance balance factor R of the message sending node i , and calculate the industrial chain balance factor F of the message sending node based on the correlation frequency ij ;

[0027] The relative importance of the message sending node is balanced by the factor R iThe industry chain balance factor F with the message sending node ij The product of is taken as the industrial correlation between job item i corresponding to the current message queue and the message receiving node.

[0028] A further optimization scheme is that the relative importance balance factor R of the message sending node i Calculated according to the following formula:

[0029] ;

[0030] Where Z represents the total number of nodes; d i Indicates the number of nodes that access the message sending node among all nodes.

[0031] A further optimization scheme is that the industrial chain balance factor F of the message sending node ij Calculated according to the following formula:

[0032] ; ; ; Wherein, k is the first empirical parameter; b is the second empirical parameter; N represents the total association frequency of operation item i to each operation item of the message receiving node; M represents the total association frequency of all operation items between the message receiving node and the message sending node.

[0033] A further optimization scheme is that the industry relevance is inserted into the message queue as a message tag and sent to the message receiving node, including the method:

[0034] Get the industry relevance of the message queue;

[0035] Performing normalization calculation on the industry relevance to obtain a message label;

[0036] After filling the message tag into the metadata of the message queue, the message queue is sent to the message receiving node.

[0037] A further optimization scheme is to parse out the message tags of each message queue and arrange all message queues in order according to industry relevance, including the following method:

[0038] Analyze the industry relevance of each message queue;

[0039] All message queues are arranged in order according to the degree of industry relevance: the greater the industry relevance, the higher the ranking position.

[0040] This solution also provides a distributed park message transmission system based on industrial relevance, which is used to implement the above-mentioned distributed park message transmission method based on industrial relevance; the distributed park includes multiple nodes divided according to the industrial function chain; the system includes:

[0041] The first acquisition module is used to obtain the message queue, the properties of the message queue and the message receiving node;

[0042] A calculation module, used to calculate the industry correlation between the message sending node and the message receiving node in combination with the attributes of the message queue; the message receiving node is also used to insert the industry correlation as a message tag into the message queue and send it to the message receiving node;

[0043] The second acquisition module is used to obtain the total number of message queues n.

[0044] The message receiving node is used to directly receive the message queue when n=1;

[0045] The message receiving node is also used to parse out the message tags of each message queue when n>1, and arrange all message queues in order according to the industry relevance, and then receive the message queues in the order.

[0046] The present solution also provides a computer-readable medium on which a computer program is stored. The computer program is executed by a processor to implement the above-mentioned distributed park message transmission method based on industrial correlation.

[0047] Compared with the prior art, the present invention has the following advantages and beneficial effects:

[0048] The present invention provides a distributed park message transmission method, system and medium based on industrial correlation. Due to the cross-regional and multi-node characteristics of distributed industrial parks, message delays are prone to occur during message transmission, and the real-time performance is poor. There are also great challenges in data consistency and synchronization between different nodes. At the same time, data transmission between different nodes also has the problem of collision and blockage, resulting in the untimely reception of key messages. BRIEF DESCRIPTION OF THE DRAWINGS

[0049] In order to more clearly illustrate the technical solutions of the exemplary embodiments of the present invention, the following briefly introduces the drawings required for use in the embodiments. It should be understood that the following drawings only illustrate certain embodiments of the present invention and should not be regarded as limiting the scope. For those of ordinary skill in the art, other relevant drawings can be obtained based on these drawings without creative work. In the drawings:

[0050] Figure 1 It is a flow chart of a distributed park message transmission method based on industrial relevance;

[0051] Figure 2 This is a schematic diagram of the distributed park message transmission system structure based on industrial correlation. DETAILED DESCRIPTION

[0052] In order to make the objectives, technical solutions and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with embodiments and drawings. The exemplary embodiments of the present invention and their description are only used to explain the present invention and are not intended to limit the present invention.

[0053] Due to the cross-regional and multi-node characteristics of distributed industrial parks, message delays are prone to occur during message transmission, and real-time performance is poor. There are also great challenges in data consistency and synchronization between different nodes. At the same time, data transmission between different nodes also has the problem of collision and blockage, resulting in untimely reception of key messages. In view of this, this solution provides the following embodiments to solve the above technical problems.

[0054] Embodiment 1: This embodiment provides a distributed park message transmission method based on industrial relevance, wherein the distributed park includes a plurality of nodes divided according to an industrial function chain; Figure 1 As shown, the method includes:

[0055] On the message sending side:

[0056] Step 1: Obtain the message queue, the attribute information of the message queue and the message receiving node, and calculate the industrial correlation between the message sending node and the message receiving node in combination with the attribute information of the message queue; this step specifically includes the following method:

[0057] The attribute information of the message queue in this solution includes the type of the message queue and the source of the message queue (ie, the job item that sends the message queue).

[0058] Get all the job items of the message receiving node and the message sending node: the total number of job items of the message receiving node is b, and the total number of job items of the message sending node is a;

[0059] Determine the job item i corresponding to the current message queue according to the attribute information of the message queue; establish a one-dimensional array S, where each column of the array S corresponds to each job item of the message receiving node, and the row of the array S corresponds to the job item corresponding to the current message queue; then the element s in the array S ij Represents the association frequency of job item i corresponding to the current message queue to the jth job item of the message receiving node; 0≤i≤a; 0≤j≤b;

[0060] ;

[0061] Among them, f ij represents the access frequency of the jth job item of the message receiving node to the current message queue; F represents the total access frequency of all job items of the message receiving node to the current message queue; L ij Indicates the number of nodes between the message sending node and the message receiving node;

[0062] Calculate the relative importance balance factor R of the message sending node i , and calculate the industrial chain balance factor F of the message sending node based on the correlation frequency ij :

[0063] The relative importance of the message sending node is balanced by the factor R i The industry chain balance factor F with the message sending node ij The product of is taken as the industrial correlation between job item i corresponding to the current message queue and the message receiving node.

[0064] The relative importance balance factor R of the message sending node i Calculated according to the following formula:

[0065] ;

[0066] Where Z represents the total number of nodes; d i Indicates the number of nodes that access the message sending node among all nodes.

[0067] The industrial chain balance factor F of the message sending node ij Calculated according to the following formula:

[0068] ; ;

[0069] ;

[0070] Wherein, k is the first empirical parameter; b is the second empirical parameter; N represents the total association frequency of operation item i to each operation item of the message receiving node; and M represents the total association frequency of all operation items between the message receiving node and the message sending node.

[0071] This embodiment determines the industrial correlation between the message receiving node and the message sending node based on the access relationship between different operation projects within the message receiving node and the message sending node park, which is more in line with the actual operation process of the industrial chain.

[0072] Step 2: insert the industry relevance as a message tag into the message queue and send it to the message receiving node; this step specifically includes the following method:

[0073] Get the industry relevance of the message queue;

[0074] Performing normalization calculation on the industry relevance to obtain a message label;

[0075] Fill the message tag into the metadata of the message queue and send it to the message receiving node.

[0076] On the message receiving side:

[0077] Step 3: Get the total number of message queues n. When n=1, directly receive the message queues; when n>1, parse the message tags of each message queue, and sort all message queues according to the industry relevance, and then receive the message queues according to the sorting order. This step specifically includes the following methods:

[0078] Analyze the industry relevance of each message queue;

[0079] All message queues are arranged in order according to the degree of industry relevance: the greater the industry relevance, the higher the ranking position.

[0080] Also includes methods:

[0081] On the message sending side:

[0082] Based on the attribute judgment of each message queue, if the current message queue is an alarm message or a command message, the current message queue is directly sent to the message receiving node;

[0083] On the message receiving side: when n>1, message queues without message tags are received first, and then the industry relevance of other message queues is analyzed.

[0084] The message sending node also performs the following process:

[0085] When multiple message queues are obtained at the same time, the priority of each message queue is determined, and the order of industrial relevance calculation is determined according to the priority determination result.

[0086] Through the above method, this embodiment achieves the effect of directly sending and receiving alarm messages or instruction messages, and delivers urgent tasks in a timely manner.

[0087] This embodiment sorts the message sending levels by priority, and calculates the industrial correlation between the message sending node and the message receiving node; shortens the message receiving delay time, reduces the network pressure of the message receiving node, and ensures the stability of the network environment of the message receiving node; at the same time, when the message sending node collects multiple message queues at the same time, this scheme will also make a priority judgment on each message queue, and determine the order of industrial correlation calculation according to the priority judgment result, give priority to the key message queues for industrial correlation, send them out in time, and improve the accuracy and timeliness of message transmission.

[0088] This solution makes methodological improvements based on traditional message transmission. The message queue calculates the industrial relevance between the message sending node and the message receiving node through the message sending side combined with the attributes of the message queue; when different sending nodes send message queues at the same time, the receiving message end arranges all message queues according to the industrial relevance, and receives the message queues according to the arrangement order; it implements priority reception of key message queues with high industrial relevance and high urgency, and finally receives non-urgent message queues with low industrial relevance, thereby improving the accuracy and timeliness of message transmission. In this embodiment, the message queue contains only one type of message, which may involve the transmission of multiple types of messages such as work order information, production progress, quality inspection results, material requirements, fault reports, and operating instructions between industrial function chains. The importance and timeliness requirements of each type of message are different, so each message queue contains only one type of message, so that messages with different importance and timeliness requirements can be delivered on demand.

[0089] Embodiment 2: This embodiment provides a distributed park message transmission system based on industrial relevance, which is used to implement the above-mentioned distributed park message transmission method based on industrial relevance; the distributed park includes multiple nodes divided according to the industrial function chain; Figure 2 As shown, the system comprises:

[0090] The first acquisition module is used to obtain the message queue, the properties of the message queue and the message receiving node;

[0091] A calculation module, used to calculate the industry correlation between the message sending node and the message receiving node in combination with the attributes of the message queue; the message receiving node is also used to insert the industry correlation as a message tag into the message queue and send it to the message receiving node;

[0092] The second acquisition module is used to obtain the total number of message queues n.

[0093] The message receiving node is used to directly receive the message queue when n=1;

[0094] The message receiving node is also used to parse out the message tags of each message queue when n>1, and arrange all message queues in order according to the industry relevance, and then receive the message queues in the order.

[0095] Embodiment 3: This embodiment provides a computer-readable medium on which a computer program is stored. The computer program is executed by a processor to implement the distributed park message transmission method based on industrial relevance as described in Embodiment 1; specifically, the following steps are performed:

[0096] Step 1: On the message sending side: obtain the message queue, the attributes of the message queue and the message receiving node, and calculate the industry correlation between the message sending node and the message receiving node based on the attributes of the message queue;

[0097] Step 2: insert the industry relevance as a message tag into the message queue and send it to the message receiving node;

[0098] Step three, on the message receiving side: obtain the total number of message queues n, when n=1, directly receive the message queues; when n>1, parse the message tags of each message queue, and arrange all message queues in order according to industry relevance, and then receive the message queues in the said arrangement order.

[0099] The specific implementation methods described above further illustrate the objectives, technical solutions and beneficial effects of the present invention in detail. It should be understood that the above description is only a specific implementation method of the present invention and is not intended to limit the scope of protection of the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention should be included in the scope of protection of the present invention.

Claims

1. A distributed park message transmission method based on industrial relevance, characterized in that: The distributed park includes a plurality of nodes divided according to an industrial function chain; the method includes: On the message sending side: Obtain the message queue, the properties of the message queue and the message receiving node, and calculate the industry correlation between the message sending node and the message receiving node based on the properties of the message queue; Inserting the industry relevance as a message tag into the message queue and sending it to the message receiving node; Based on the attribute judgment of each message queue, if the current message queue is an alarm message or a command message, the current message queue is directly sent to the message receiving node; On the message receiving side: when n>1, the message queues without message tags are received first, and then the industry relevance of other message queues is analyzed; The message sending node also performs the following process: When multiple message queues are obtained at the same time, the priority of each message queue is determined, and the order of industry relevance calculation is determined according to the priority determination result; On the message receiving side: The total number of message queues n is obtained. When n=1, the message queues are directly received. When n>1, the message tags of each message queue are parsed, and all message queues are sorted according to the industry relevance, and then the message queues are received according to the sorting order. The method of obtaining a message queue, the attributes of the message queue and the message receiving node, and calculating the industrial association between the message sending node and the message receiving node in combination with the attributes of the message queue includes: Get all the job items of the message receiving node and the message sending node: the total number of job items of the message receiving node is b, and the total number of job items of the message sending node is a; Determine the job item i corresponding to the current message queue according to the attribute information of the message queue; establish an array S, each column of the array S corresponds to each job item of the message receiving node, and the row of the array S corresponds to the job item corresponding to the current message queue; then the element S in the array S ij Represents the association frequency of job item i corresponding to the current message queue to the jth job item of the message receiving node; 0≤i≤a; 0≤j≤b; ； Among them, f ij represents the access frequency of the jth job item of the message receiving node to the current message queue; F represents the total access frequency of all job items of the message receiving node to the current message queue; L ij Indicates the number of nodes between the message sending node and the message receiving node; Calculate the relative importance balance factor R of the message sending node i , and calculate the industrial chain balance factor F of the message sending node based on the correlation frequency ij ; The relative importance of the message sending node is balanced by the factor R i The industry chain balance factor F with the message sending node ij The product of is taken as the industrial correlation between job item i corresponding to the current message queue and the message receiving node.

2. The distributed park message transmission method based on industrial relevance according to claim 1 is characterized in that: The relative importance balance factor R of the message sending node i Calculated according to the following formula: ； Where Z represents the total number of nodes; d i Indicates the number of nodes that access the message sending node among all nodes.

3. The distributed park message transmission method based on industrial relevance according to claim 1 is characterized in that: The industrial chain balance factor F of the message sending node ij Calculated according to the following formula: ； ； ； Wherein, k is the first empirical parameter; b is the second empirical parameter; N represents the total association frequency of operation item i to each operation item of the message receiving node; and M represents the total association frequency of all operation items between the message receiving node and the message sending node.

4. The distributed park message transmission method based on industrial relevance according to claim 3 is characterized in that: The method of inserting the industry relevance as a message tag into the message queue and sending it to the message receiving node includes: Get the industry relevance of the message queue; Normalizing and calculating the industry relevance to obtain a message label; Fill the message tag into the metadata of the message queue and send it to the message receiving node.

5. The distributed park message transmission method based on industrial relevance according to claim 1 is characterized in that: The method of parsing the message tags of each message queue and arranging all message queues in order according to industry relevance includes: Analyze the industry relevance of each message queue; All message queues are arranged in order according to the degree of industry relevance: the greater the industry relevance, the higher the ranking position.

6. A distributed park messaging system based on industry relevance, characterized in that: A distributed park message transmission method based on industrial relevance for implementing any one of claims 1 to 4; the distributed park comprises a plurality of nodes divided according to an industrial function chain; the system comprises: The first acquisition module is used to obtain the message queue, the properties of the message queue and the message receiving node; A calculation module, used to calculate the industry correlation between the message sending node and the message receiving node in combination with the attributes of the message queue; the message receiving node is also used to insert the industry correlation as a message tag into the message queue and send it to the message receiving node; The second acquisition module is used to obtain the total number of message queues n. The message receiving node is used to directly receive the message queue when n=1; The message receiving node is also used to parse out the message tags of each message queue when n>1, and arrange all message queues in order according to the industry relevance, and then receive the message queues in the order.

7. A computer readable medium having a computer program stored thereon, characterized in that: The computer program is executed by a processor to implement the distributed campus message transmission method based on industrial relevance as described in any one of claims 1 to 4.

Images