CN110324351A - The system and method for information interconnection in a kind of network collaborative design - Google Patents

The system and method for information interconnection in a kind of network collaborative design Download PDF

Info

Publication number
CN110324351A
CN110324351A CN201910618628.0A CN201910618628A CN110324351A CN 110324351 A CN110324351 A CN 110324351A CN 201910618628 A CN201910618628 A CN 201910618628A CN 110324351 A CN110324351 A CN 110324351A
Authority
CN
China
Prior art keywords
data
node
module
information
character
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
Application number
CN201910618628.0A
Other languages
Chinese (zh)
Other versions
CN110324351B (en
Inventor
王维龙
杨开益
潘钟强
郭文水
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xiamen Number Twin Technology Co Ltd
Xiamen Rong Extension Iot Technology Co Ltd
Original Assignee
Xiamen Number Twin Technology Co Ltd
Xiamen Rong Extension Iot Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xiamen Number Twin Technology Co Ltd, Xiamen Rong Extension Iot Technology Co Ltd filed Critical Xiamen Number Twin Technology Co Ltd
Priority to CN201910618628.0A priority Critical patent/CN110324351B/en
Publication of CN110324351A publication Critical patent/CN110324351A/en
Application granted granted Critical
Publication of CN110324351B publication Critical patent/CN110324351B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2228Indexing structures
    • G06F16/2255Hash tables
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/25Integrating or interfacing systems involving database management systems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/602Providing cryptographic facilities or services
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00Network architectures or network communication protocols for network security
    • H04L63/04Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
    • H04L63/0428Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00Network architectures or network communication protocols for network security
    • H04L63/08Network architectures or network communication protocols for network security for authentication of entities
    • H04L63/083Network architectures or network communication protocols for network security for authentication of entities using passwords
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00Network architectures or network communication protocols for network security
    • H04L63/08Network architectures or network communication protocols for network security for authentication of entities
    • H04L63/0876Network architectures or network communication protocols for network security for authentication of entities based on the identity of the terminal or configuration, e.g. MAC address, hardware or software configuration or device fingerprint
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00Network architectures or network communication protocols for network security
    • H04L63/12Applying verification of the received information
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/02Protocols based on web technology, e.g. hypertext transfer protocol [HTTP]
    • H04L67/025Protocols based on web technology, e.g. hypertext transfer protocol [HTTP] for remote control or remote monitoring of applications
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/51Discovery or management thereof, e.g. service location protocol [SLP] or web services
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/04Protocols for data compression, e.g. ROHC
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/08Protocols for interworking; Protocol conversion
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00Energy efficient computing, e.g. low power processors, power management or thermal management

Abstract

It include entitlement management module, node administration module, monitoring management module, basic information module, OPC-UA communication module, data processing module and service management module in the system the present invention relates to the system and method that information in a kind of network collaborative design interconnects;The entitlement management module, node administration module, monitoring management module, basic information module, OPC-UA communication module, data processing module and service management module are disposed on the application server, and database server is further equipped in the system for bearing system data.The present invention passes through optimization tradition ESB, design visible service flow, using data encryption and compression, message queue of the building based on optimization, avoid data obfuscation, improve working efficiency, optimize information data transmission bandwidth throughput and energy consumption, it realizes that business datum interconnects between industrial application software, and provides one kind safe and efficient, stable information interconnected method for network collaborative design.

Description

The system and method for information interconnection in a kind of network collaborative design
Technical field
The present invention relates to information in industry internet and intelligence manufacture field more particularly to a kind of network collaborative design to interconnect System and method.
Background technique
Network collaborative design is based on " internet+" thinking, is quick to realize manufacturing industry innovation and development and transition and upgrade The core content that manufacture, intelligence manufacture, cloud manufacture.However industrial application software used by manufacturing enterprise is mostly not at this stage It is provided with manufacturer, the complicated multiplicity of interface protocol, data format are also different, cause the information data between industrial application software It is difficult to interconnect, the phenomenon that generally existing " information island ".Therefore, how to make information data between industrial application software more It safely and efficiently interconnects the problem of being urgent need to resolve.
During investigative technique solution, usually make from interface protocol, data format, the degree of coupling and operation flow For point of penetration, to solve the above problems.At this stage, it generallys use in the industry and secondary development or tradition is carried out to industrial application software ESB access way, one side secondary development are disposed using separate server, and development difficulty is lower, but its development cost is high, maintenance Difficulty is big, and on the other hand tradition ESB access way can reduce development cost, reduce maintenance difficulties, realize loose coupling, but it is easily It is low to lead to the problem of low data obfuscation, safety, information congestion and data-handling efficiency.
Summary of the invention
To solve the above-mentioned problems, the system and method that information interconnects in a kind of network collaborative design of the present invention.
Concrete scheme is as follows:
The system of information interconnection in a kind of network collaborative design, comprising: entitlement management module, node administration module, monitoring Management module, basic information module, OPC-UA communication module, data processing module and service management module;
The request and user that the entitlement management module is used to interconnect information authenticate;
The node administration module is used to safeguard the corresponding relationship between industrial application software and information interlink node;It is described Corresponding relationship includes node unique identification, nodename, node public key and the node private key with node public key pairing;
The monitoring management module be used for in information interconnection data and behavior be monitored, and to information interconnection process In operation recorded;
The basic information module is for recording system operation information, system service information and system version description letter Breath;
The OPC-UA communication module is used to handle the information interconnection request based on OPC-UA agreement;
The data processing module includes data check unit, Date Conversion Unit, data mapping unit, data encryption With compression unit, data routing units and data transmission unit;
The data check unit is used to carry out legitimacy and completeness check to source data;
The Date Conversion Unit is used to source data format being converted to target data format;
The data mapping unit is for safeguarding corresponding relationship between source data structure and target data structure;
The data encryption is with compression unit for data to be encrypted and compressed;
The request that the data routing units are used to interconnect information carries out route distribution;
The data transmission unit is carried out data transmission by the way of based on message-oriented middleware, and is constructed based on optimization Message queue and data buffer zone;
The service management module includes visible process design cell and customized flow rules unit, by making by oneself Adopted flow rules unit set information interconnection services process, by the setting of visible process design cell for showing the letter of setting Cease the visualization interface of interconnection services process.
Further, the specific steps that the data encryption and compression unit encrypt data and compress include:
S110: sender node obtains public key corresponding to the unique identification of node;
S120: sender node encrypts its unique identification according to the public key of acquisition, obtains sender node only One mark ciphertext;
S130: unique identification ciphertext is sent to receiving terminal node by sender node;
S140: receiving terminal node according to received from sender node unique identification ciphertext and with the public key of sender node The unique identification ciphertext is decrypted in corresponding private key, obtains original text;
S150: receiving terminal node is according to the unique identification of the original text of acquisition and the sender node for being stored in receiving terminal node It is matched, such as successful match, then successful match information is sent to sender node, into S160, otherwise terminated;
S160: sender node carries out data encryption to transmission data according to public key, generates ciphertext;
S170: the ciphertext of generation is compressed;
S180: the ciphertext compressed is sent to receiving terminal node by sender node;
S190: ciphertext unzips it and decryption oprerations receiving terminal node based on the received, obtains original text.
Further, the compression process of step S170 specifically:
S171: initialization ltsh chain table sets number of characters i=1, and character sum is s in ciphertext;
S172: the cryptographic Hash of continuous three characters since i-th of character in ciphertext is calculated using hash function;
S173: judging the cryptographic Hash that whether there is i-th of character in ltsh chain table, if it is present setting matching length n =1, into S174, otherwise, into S177;
S174: judge with the presence or absence of the cryptographic Hash of two continuation characters since i-th of character in ltsh chain table, if deposited Matching length n=n+1 is then being enabled, into S175, otherwise, into S176;
S175: judge with the presence or absence of the cryptographic Hash of three continuation characters since i-th of character in ltsh chain table, if deposited Matching length n=n+1 is then being enabled, into S176, otherwise, is being directly entered S176;
S176: character identical with the cryptographic Hash of i-th of character in the initial position and ciphertext of i-th of character is calculated The distance between initial position indicates the character by distance and matching length building index, into S178;
S177: i-th of character of output;
S178: it will store since the cryptographic Hash of n character continuous i-th of character into ltsh chain table;
S179: judging whether i < s is true, if set up, enables i=i+1, returns to S172, otherwise export compression result.
Further, the message queue based on optimization includes emergency message queue and priority message queue;
The emergency message queue, using first in first out, for storing the emergency message of highest priority;
The priority message queue, according to priority sequence from high in the end stores non-emergent common message, by preferential Grade goes out team.
Further, the message queue scheduling strategy the following steps are included:
S210: judging with the presence or absence of emergency message in current emergency message queue, if it is present S220 is entered step, Otherwise, S230 is entered step;
S220: the emergency message in push emergency message queue, emergency message go out team, return step S210;
S230: judge with the presence or absence of priority message in current priority message queue, if it is present entering step S240, otherwise, return step S210;
S240: the priority message in push priority message queue, message go out team, return step S210.
Further, the detailed process of the data transmission are as follows:
S310: initiation parameter, if data initial total energy E=1000nj, maximum number of iterations H=20;
S320: data transmission probability distribution function is established;
If node x sends data transfer request in time T, then node x selected probability distribution PxCalculation formula:
Wherein: a is the constraint threshold value of probability distribution;
S330: energy consumption constraint control parameter μ is calculated:
μ=ρ s (1-Px)Tm
Wherein: ρ is the average time that x node is selected in the unit time, and s is the transmission rate of x node, PxFor x generation The probability of data transmission, TmFor the average value of node x transmitting continuous time;
S340: network energy consumption N is calculated:
Wherein: exIt consumes energy for the communication of node x, εxFor the dump energy of node x, wherein exBy between cluster between cluster head Multihop routing carries out actual measurement, εx=E-ex
S340: interative computation;
It modifies transmission rate s=s+ (s*0.1), step S320 to step S340 is repeated, until algorithm reaches greatest iteration Number H determines the smallest network energy consumption N, and energy consumption constraint control parameter μ corresponding to the smallest network energy consumption N is set as most Excellent energy consumption constrains control parameter μ, the constraint condition which is transmitted as data.
Further, the visible process design cell include table input/output module, XML input/output module, Json input/output module, file directory transmission/reception module send class operation input/output module and Java extension journey Sequence module.
Further, the customized flow rules unit uses OpenSymphony Quartz Scheduling Framework.
Further, the entitlement management module, node administration module, monitoring management module, basic information module, OPC- UA communication module, data processing module and service management module are disposed on the application server, and number is further equipped in system Bearing system data is used for according to library server.
A kind of method of information interconnection in network collaborative design, comprising the following steps:
Step 1: receiving information interconnection request, judge whether information interlink node is authorized, step is entered if having authorized Rapid 2, otherwise, enter step 7;
Step 2: carrying out the route distribution of information interconnection request;
Step 3: request source data is interconnected according to information;
Step 4: data check is carried out to source data;
Step 5: data conversion is carried out to the data after data check;
Step 6: the data after data conversion are encrypted and compressed;
Step 7: according to data access interface agreement, organizing returned data.
The present invention use technical solution as above, and have the utility model has the advantages that
1. realizing that the operation flow visualization of information interconnection in network collaborative design is simplified by customized flow rules The step of process design, can be avoided data obfuscation, improve working efficiency;
2., so that data transmission is safer, reducing the occupancy to bandwidth by data encryption and compression;
3. constructing the message queue based on optimization, optimization bandwidth throughput and transmission energy consumption, successively processing business process, has Effect ground solves information congestion, improves data-handling efficiency.
Detailed description of the invention
Fig. 1 show the structural schematic diagram of the embodiment of the present invention.
Fig. 2 show the structural schematic diagram of the embodiment interior joint management module.
Fig. 3 show the structural schematic diagram of basic information module in the embodiment.
Fig. 4 show data encryption algorithm flow chart in the embodiment.
Fig. 5 show data compression algorithm flow chart in the embodiment.
Fig. 6 show the message queue structural schematic diagram in the embodiment based on optimization.
Fig. 7 show the scheduling strategy flow chart of the message queue in the embodiment based on optimization.
Fig. 8 show data transmission energy consumption optimization method flow chart in the embodiment.
Fig. 9 show the structural schematic diagram of visible process design cell in the embodiment.
Figure 10 show the interconnection flow chart of the information in the embodiment.
Specific embodiment
To further illustrate that embodiment, the present invention are provided with attached drawing.These attached drawings be the invention discloses a part of content, It can cooperate the associated description of specification mainly to illustrate embodiment to explain the operation principles of embodiment.Cooperation reference These contents, those of ordinary skill in the art will be understood that other possible embodiments and advantages of the present invention.
Now in conjunction with the drawings and specific embodiments, the present invention is further described.
The embodiment of the present invention is using RT-IICP information interconnection platform as prototype, detailed description of the present invention embodiment.
RT-IICP information interconnection platform is dispatched single engine by job task and is triggered transactional using SOA design concept Exchange event, the automatic conversion of realization source data type to purpose data type, and the whole prison in exchange life cycle is provided Control service and log services.
As shown in Figure 1, the system for present embodiments providing information interconnection in a kind of network collaborative design, comprising: authorization pipe Manage module 100, node administration module 200, monitoring management module 300, basic information module 400, OPC-UA communication module 500, Data processing module 600 and service management module 700.
The entitlement management module 100, node administration module 200, monitoring management module 300, basic information module 400, OPC-UA communication module 500, data processing module 600 and service management module 700 are disposed on the application server, described System is further equipped with database server for bearing system data.
The function of each module is illustrated below:
1, the request and user that the entitlement management module 100 is used to interconnect information authenticate.
2, refering to what is shown in Fig. 2, the node administration module 200 for safeguard industrial application software and information interlink node it Between corresponding relationship, it specifically further includes that node is unique in the information interlink node that the corresponding relationship, which is one-to-one relationship, Mark 201, nodename 202, node public key (Pb) 203 and the node private key (Pv) matched with node public key (Pb) 203 204。
3, the monitoring management module 300 be used for in information interconnection data and behavior be monitored, and it is mutual to information Operation during connection is recorded, and is provided and is checked function.
4, refering to what is shown in Fig. 3, the basic information module 400 is for recording system operation information 401, system service information 402 and system version description information 403.
5, the OPC-UA communication module 500 is used to handle the information interconnection request based on OPC-UA agreement.
6, the data processing module 600 includes data check unit, Date Conversion Unit, data mapping unit, data Encryption and compression unit, data routing units and data transmission unit.
(1) the data check unit is used to carry out legitimacy and completeness check to the source data of extraction.
(2) conversion of the Date Conversion Unit for source data format to target data format.
(3) data mapping unit is for safeguarding corresponding relationship between source data structure and target data structure.
(4) data encryption is with compression unit for data to be encrypted and compressed.
With reference to shown in Fig. 4 and Fig. 5, the data encryption and the specific implementation step of compression unit in this embodiment are as follows:
Step 1, sender node Send obtain the correspondence public key in node administration module 200 according to node unique identification Pb;
Step 2, sender node Send encrypt its node unique identification according to public key Pb, obtain sender node The node unique identification ciphertext Ct of Send;
Ciphertext Ct is transmitted through the network to receiving terminal node Receive by step 3, sender node Send;
Step 4, receiving terminal node Receive are according to the ciphertext Ct of acquisition and with the private key Pb of sender node Send to close Literary Ct is decrypted, and obtains original text Ot;
Step 5, receiving terminal node Receive are according to the section of the original text Ot of acquisition and the sender node Send being locally stored Point unique identification is matched, if successful match, successful match information is sent to sender node Send, continues step 6 The operation, conversely, algorithm terminates;
Step 6, sender node Send carry out data encryption to the data that needs transmit according to public key Pb, generate ciphertext Dt, the data encryption, which uses, is based on safe and efficient DEA symmetric encipherment algorithm;
Step 7 carries out squeeze operation to ciphertext data Dt described in step 6, in the embodiment specifically includes the following steps:
Step 701, initialization ltsh chain table, set number of characters i=1, and character sum is s in ciphertext;
Step 702, the cryptographic Hash that continuous three characters since i-th of character in ciphertext are calculated with hash function;
Step 703 judges the cryptographic Hash that whether there is i-th of character in ltsh chain table, if it is present setting matching length N=1 is spent, 704 is entered step, otherwise, enters step 707;
Step 704 judges with the presence or absence of the cryptographic Hash of two continuation characters since i-th of character in ltsh chain table, such as Fruit exists, then enables matching length n=n+1, enter step 705, otherwise, enter step 706;
Step 705 judges with the presence or absence of the cryptographic Hash of three continuation characters since i-th of character in ltsh chain table, such as Fruit exists, then enables matching length n=n+1, enter step 706, otherwise, be directly entered step 706;
Word identical with the cryptographic Hash of i-th of character in step 706, the initial position for calculating i-th of character and ciphertext The distance between initial position of symbol indicates the character by distance and matching length building index, enters step 708;
I-th step 707, output of character;
Step 708 will be stored since the cryptographic Hash of n character continuous i-th of character into ltsh chain table;
Step 709 judges whether i < s is true, if set up, enables i=i+1, return step 702, otherwise output compression As a result.
Step 8, sender node Send send the ciphertext Dt to receiving terminal node Receive that compression is completed;
Step 9, receiving terminal node Receive is decrypted according to the ciphertext Dt of acquisition and decompression operations, obtains original text Odt。
(5) request that the data routing units are used to interconnect information carries out route distribution.
(6) data transmission unit is carried out data transmission by the way of based on message-oriented middleware, and is constructed based on excellent The message queue of change and data buffer zone.
Refering to what is shown in Fig. 6, the message queue based on optimization, specifically further includes having emergency message queue and priority to disappear Cease queue.
The emergency message queue, using first in first out, for storing the emergency message of highest priority;
The priority message queue, according to priority sequence from high in the end stores non-emergent common message, by preferential Grade goes out team;
Refering to what is shown in Fig. 7, further, the scheduling strategy of the message queue based on optimization specifically includes following step It is rapid:
Step 1 judges then to continue behaviour described in step 2 if it exists with the presence or absence of emergency message in current emergency message queue Make, conversely, 3 operations that go to step;
Emergency message in step 2, push emergency message queue, emergency message go out team, continue to operate described in step 1;
Step 3 judges then to continue step 4 institute if it exists with the presence or absence of priority message in current priority message queue Operation is stated, conversely, 1 operation that gos to step;
Priority message in step 4, push priority message queue, message go out team, continue to operate described in step 1;
Refering to what is shown in Fig. 8, the preferred embodiment as the present embodiment, the data transmission, are transmitted using data and are consumed energy Optimization method, which comprises the following steps:
Step 1, initiation parameter, if data initial total energy E=1000nj, maximum number of iterations H=20;
Step 2 establishes data transmission probability distribution function;
If node x sends data transfer request in time T time, then node x selected probability distribution PxAre as follows:
In formula: a is the constraint threshold value of probability distribution;
Step 3 calculates energy consumption constraint control parameter μ, and calculation formula is as follows:
μ=ρ s (1-Px)Tm
In formula: ρ is the average time that x node is selected in the unit time, and s is the transmission rate of x node, PxFor x generation The probability of data transmission, TmFor the average value of node x transmitting continuous time;
Step 4 calculates network energy consumption N, and calculation formula is as follows:
In formula: exIt communicates and consumes energy for node x, εxFor the dump energy of node x, wherein exBy more between cluster head between cluster It jumps routing and carries out actual measurement, εx=E-ex
Step 5, interative computation;
It modifies transmission rate s=s+ (s*0.1), repeats step 2 to operation described in step 4, change until algorithm reaches maximum Generation number H determines the smallest network energy consumption N, and energy consumption constraint control parameter μ corresponding to the smallest network energy consumption N is set as Optimal energy consumption constrains control parameter μ, the constraint condition which is transmitted as data, to reduce Data energy consumption required when transmitting.
7, the service management module 700 includes visible process design cell and customized flow rules unit.Pass through Visual interface design information interconnection services process and customized flow rules simplify business Process Design step, adapt to manufacture enterprise The quick variation of information interconnection services in industry.
As shown in connection with fig. 9, the visible process design cell specifically further includes table input/output module 601, XML Input/output module 602, Json input/output module 603, file directory transmission/reception module 604, transmission class operation are defeated Enter/output module 605 and Java extender module 606, it is convenient to the visualization of information interconnection services process design to provide Service.
The customized flow rules unit provides user's custom information interconnection services dispatch service, the scheduling Service, which uses, possesses powerful scheduling feature, flexible Application mode and high-available distributed and clustering capability OpenSymphony Quartz Scheduling Framework.
As prioritization scheme of the invention, the entitlement management module 100, node administration module 200, monitoring management module 300, basic information module 400, OPC-UA communication module 500, data processing module 600 and service management module 700 use Distributed data base, server cluster and load-balancing technique deployment, to support that information is mutual between manufacturing enterprise's industrial application software The frequent interaction of connection and high concurrent access.
Refering to what is shown in Fig. 10, it is the flow chart of information interconnected method used by system in the present embodiment, specifically include Following steps:
Step 1, system authorization management module receive information interconnection request, judge whether information interlink node is authorized, Continue operation described in step 2 if having authorized, conversely, going to step 7.
Step 2, information interconnection request route distribution, the route distribution is routed single by the data in data processing module Member is realized.
Step 3 interconnects request source data according to information.
Step 4 carries out data check processing to the source data described in step 3, at the data check at reason data The data check unit managed in module is realized.
Step 5 carries out data conversion treatment to step 4 treated source data, and the data conversion treatment is by data Date Conversion Unit in processing module is realized.
Step 6, to step 5 treated data carry out encryption and squeeze operation.
Step 7, according to data access interface agreement, organize returned data.
Although specifically showing and describing the present invention in conjunction with preferred embodiment, those skilled in the art should be bright It is white, it is not departing from the spirit and scope of the present invention defined by the appended claims, it in the form and details can be right The present invention makes a variety of changes, and is protection scope of the present invention.

Claims (10)

1. the system that information interconnects in a kind of network collaborative design characterized by comprising entitlement management module, node administration Module, monitoring management module, basic information module, OPC-UA communication module, data processing module and service management module;
The request and user that the entitlement management module is used to interconnect information authenticate;
The node administration module is used to safeguard the corresponding relationship between industrial application software and information interlink node;The correspondence Relationship includes node unique identification, nodename, node public key and the node private key with node public key pairing;
The monitoring management module be used for in information interconnection data and behavior be monitored, and in information interconnection process Operation is recorded;
The basic information module is for recording system operation information, system service information and system version description information;
The OPC-UA communication module is used to handle the information interconnection request based on OPC-UA agreement;
The data processing module includes data check unit, Date Conversion Unit, data mapping unit, data encryption and pressure Contracting unit, data routing units and data transmission unit;
The data check unit is used to carry out legitimacy and completeness check to source data;
The Date Conversion Unit is used to source data format being converted to target data format;
The data mapping unit is for safeguarding corresponding relationship between source data structure and target data structure;
The data encryption is with compression unit for data to be encrypted and compressed;
The request that the data routing units are used to interconnect information carries out route distribution;
The data transmission unit is carried out data transmission by the way of based on message-oriented middleware, and constructs the message based on optimization Queue and data buffer zone;
The service management module includes visible process design cell and customized flow rules unit, passes through customized stream Journey rules unit set information interconnection services process, the information by the setting of visible process design cell for showing setting are mutual Join the visualization interface of operation flow.
2. system according to claim 1, it is characterised in that: the data encryption and compression unit encrypt data Specific steps with compression include:
S110: sender node obtains public key corresponding to the unique identification of node;
S120: sender node encrypts its unique identification according to the public key of acquisition, obtains unique mark of sender node Know ciphertext;
S130: unique identification ciphertext is sent to receiving terminal node by sender node;
S140: receiving terminal node is according to unique identification ciphertext received from sender node and corresponding with the public key of sender node Private key the unique identification ciphertext is decrypted, obtain original text;
S150: receiving terminal node is carried out according to the original text of acquisition and the unique identification for the sender node for being stored in receiving terminal node Successful match information is then sent to sender node, into S160, otherwise terminated by matching, such as successful match;
S160: sender node carries out data encryption to transmission data according to public key, generates ciphertext;
S170: the ciphertext of generation is compressed;
S180: the ciphertext compressed is sent to receiving terminal node by sender node;
S190: ciphertext unzips it and decryption oprerations receiving terminal node based on the received, obtains original text.
3. system according to claim 2, it is characterised in that: the compression process of step S170 specifically:
S171: initialization ltsh chain table sets number of characters i=1, and character sum is s in ciphertext;
S172: the cryptographic Hash of continuous three characters since i-th of character in ciphertext is calculated using hash function;
S173: judging the cryptographic Hash that whether there is i-th of character in ltsh chain table, if it is present setting matching length n=1, Into S174, otherwise, into S177;
S174: judging with the presence or absence of the cryptographic Hash of two continuation characters since i-th of character in ltsh chain table, if it does, Matching length n=n+1 is then enabled, into S175, otherwise, into S176;
S175: judging with the presence or absence of the cryptographic Hash of three continuation characters since i-th of character in ltsh chain table, if it does, Matching length n=n+1 is then enabled, into S176, otherwise, is directly entered S176;
S176: the starting of character identical with the cryptographic Hash of i-th of character in the initial position and ciphertext of i-th of character is calculated The distance between position indicates the character by distance and matching length building index, into S178;
S177: i-th of character of output;
S178: it will store since the cryptographic Hash of n character continuous i-th of character into ltsh chain table;
S179: judging whether i < s is true, if set up, enables i=i+1, returns to S172, otherwise export compression result.
4. system according to claim 1, it is characterised in that: the message queue based on optimization include emergency message queue and Priority message queue;
The emergency message queue, using first in first out, for storing the emergency message of highest priority;
The priority message queue, according to priority sequence from high in the end stores non-emergent common message, according to priority goes out Team.
5. system according to claim 4, it is characterised in that: the scheduling strategy of the message queue the following steps are included:
S210: judging with the presence or absence of emergency message in current emergency message queue, if it is present S220 is entered step, otherwise, Enter step S230;
S220: the emergency message in push emergency message queue, emergency message go out team, return step S210;
S230: judging with the presence or absence of priority message in current priority message queue, if it is present S240 is entered step, Otherwise, return step S210;
S240: the priority message in push priority message queue, message go out team, return step S210.
6. system according to claim 1, it is characterised in that: the detailed process of the data transmission are as follows:
S310: initiation parameter, if data initial total energy E=1000nj, maximum number of iterations H=20;
S320: data transmission probability distribution function is established;
If node x sends data transfer request in time T, then node x selected probability distribution PxCalculation formula:
Wherein: a is the constraint threshold value of probability distribution;
S330: energy consumption constraint control parameter μ is calculated:
μ=ρ s (1-Px)Tm
Wherein: ρ is the average time that x node is selected in the unit time, and s is the transmission rate of x node, PxData occur for x to pass Defeated probability, TmFor the average value of node x transmitting continuous time;
S340: network energy consumption N is calculated:
Wherein: exIt consumes energy for the communication of node x, εxFor the dump energy of node x, wherein exPass through the multi-hop between cluster between cluster head Routing carries out actual measurement, εx=E-ex
S340: interative computation;
It modifies transmission rate s=s+ (s*0.1), step S320 to step S340 is repeated, until algorithm reaches maximum number of iterations H determines the smallest network energy consumption N, and energy consumption constraint control parameter μ corresponding to the smallest network energy consumption N is set as optimal consumption Control parameter μ can be constrained, the constraint condition which is transmitted as data.
7. system according to claim 1, it is characterised in that: the visible process design cell include table input/it is defeated Module, XML input/output module, Json input/output module, file directory transmission/reception module, transmission class operation are defeated out Enter/output module and Java extender module.
8. system according to claim 1, it is characterised in that: the customized flow rules unit uses OpenSymphony Quartz Scheduling Framework.
9. system according to claim 1, it is characterised in that: the entitlement management module, node administration module, monitoring pipe Reason module, basic information module, OPC-UA communication module, data processing module and service management module are deployed in using clothes It is engaged on device, database server is further equipped in system for bearing system data.
10. a kind of method that information interconnects in network collaborative design, which comprises the following steps:
Step 1: information interconnection request is received, judges whether information interlink node is authorized, and 2 are entered step if having authorized, Otherwise, 7 are entered step;
Step 2: carrying out the route distribution of information interconnection request;
Step 3: request source data is interconnected according to information;
Step 4: data check is carried out to source data;
Step 5: data conversion is carried out to the data after data check;
Step 6: the data after data conversion are encrypted and compressed;
Step 7: according to data access interface agreement, organizing returned data.
CN201910618628.0A 2019-07-10 2019-07-10 System and method for information interconnection in network collaborative manufacturing Active CN110324351B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910618628.0A CN110324351B (en) 2019-07-10 2019-07-10 System and method for information interconnection in network collaborative manufacturing

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910618628.0A CN110324351B (en) 2019-07-10 2019-07-10 System and method for information interconnection in network collaborative manufacturing

Publications (2)

Publication Number Publication Date
CN110324351A true CN110324351A (en) 2019-10-11
CN110324351B CN110324351B (en) 2021-06-15

Family

ID=68121708

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910618628.0A Active CN110324351B (en) 2019-07-10 2019-07-10 System and method for information interconnection in network collaborative manufacturing

Country Status (1)

Country Link
CN (1) CN110324351B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112073399A (en) * 2020-08-28 2020-12-11 华迪计算机集团有限公司 Data exchange system based on bidirectional message queue
CN113055336A (en) * 2019-12-26 2021-06-29 东软集团(上海)有限公司 Safe message routing method, safe message reminding method and safe information system
CN113706276A (en) * 2021-11-01 2021-11-26 南京麦豆健康管理有限公司 Order data synchronization and data transmission system and method
CN113726746A (en) * 2021-08-10 2021-11-30 北京网藤科技有限公司 Industrial control safety management platform and control method thereof
CN113810489A (en) * 2021-09-14 2021-12-17 广东三水合肥工业大学研究院 Industrial internet control system and method

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103228022A (en) * 2013-01-21 2013-07-31 南京邮电大学 Probability type wireless sensor network routing method based on energy harvesting
CN104618997A (en) * 2015-01-28 2015-05-13 西安电子科技大学 Data aggregation method based on non-uniform grids
CN106357426A (en) * 2016-08-26 2017-01-25 东北大学 Large-scale distribution intelligent data collection system and method based on industrial cloud
CN106413000A (en) * 2016-09-23 2017-02-15 东南大学 Energy efficiency data flow transmission method based on packet sequence at arbitrary cut-off moment
CN106411528A (en) * 2016-10-17 2017-02-15 重庆邮电大学 Lightweight authentication key negotiation method based on implicit certificate
CN108199897A (en) * 2018-01-17 2018-06-22 重庆邮电大学 A kind of OPC UA multiserver polymerizations for supporting cache management
CN108833269A (en) * 2018-06-26 2018-11-16 中国兵器装备集团自动化研究所 A kind of intelligent things gateway towards industry spot
CN108829043A (en) * 2018-09-12 2018-11-16 珠海格力智能装备有限公司 The processing method and processing device of distributed CNC system
EP3182235B1 (en) * 2015-12-18 2019-03-27 Siemens Aktiengesellschaft Method and industrial control for calling a function of a control program by means of an opc ua call
CN109768885A (en) * 2018-12-28 2019-05-17 厦门中控生物识别信息技术有限公司 A kind of support multi-protocols distribution high concurrent communication service end equipment and communication means

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103228022A (en) * 2013-01-21 2013-07-31 南京邮电大学 Probability type wireless sensor network routing method based on energy harvesting
CN104618997A (en) * 2015-01-28 2015-05-13 西安电子科技大学 Data aggregation method based on non-uniform grids
EP3182235B1 (en) * 2015-12-18 2019-03-27 Siemens Aktiengesellschaft Method and industrial control for calling a function of a control program by means of an opc ua call
CN106357426A (en) * 2016-08-26 2017-01-25 东北大学 Large-scale distribution intelligent data collection system and method based on industrial cloud
CN106413000A (en) * 2016-09-23 2017-02-15 东南大学 Energy efficiency data flow transmission method based on packet sequence at arbitrary cut-off moment
CN106411528A (en) * 2016-10-17 2017-02-15 重庆邮电大学 Lightweight authentication key negotiation method based on implicit certificate
CN108199897A (en) * 2018-01-17 2018-06-22 重庆邮电大学 A kind of OPC UA multiserver polymerizations for supporting cache management
CN108833269A (en) * 2018-06-26 2018-11-16 中国兵器装备集团自动化研究所 A kind of intelligent things gateway towards industry spot
CN108829043A (en) * 2018-09-12 2018-11-16 珠海格力智能装备有限公司 The processing method and processing device of distributed CNC system
CN109768885A (en) * 2018-12-28 2019-05-17 厦门中控生物识别信息技术有限公司 A kind of support multi-protocols distribution high concurrent communication service end equipment and communication means

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
刘鑫 张延园 林奕: "基于多队列缓冲池的紧急消息推送方法", 《计算机与现代化》 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113055336A (en) * 2019-12-26 2021-06-29 东软集团(上海)有限公司 Safe message routing method, safe message reminding method and safe information system
CN112073399A (en) * 2020-08-28 2020-12-11 华迪计算机集团有限公司 Data exchange system based on bidirectional message queue
CN113726746A (en) * 2021-08-10 2021-11-30 北京网藤科技有限公司 Industrial control safety management platform and control method thereof
CN113810489A (en) * 2021-09-14 2021-12-17 广东三水合肥工业大学研究院 Industrial internet control system and method
CN113706276A (en) * 2021-11-01 2021-11-26 南京麦豆健康管理有限公司 Order data synchronization and data transmission system and method
CN113706276B (en) * 2021-11-01 2022-02-22 南京麦豆健康管理有限公司 Order data synchronization and data transmission system and method

Also Published As

Publication number Publication date
CN110324351B (en) 2021-06-15

Similar Documents

Publication Publication Date Title
CN110324351A (en) The system and method for information interconnection in a kind of network collaborative design
CN102394745B (en) Quality of service realization method applied to quantum key distribution network
CN104579964B (en) A kind of quantum cryptography networks dynamic routing architecture system
CN109995510A (en) A kind of quantum key relay services method
CN109995515A (en) A kind of quantum key trunking method
CN105959921A (en) Network controller, node equipment and grid network system with network controller and node equipment
CN114615094B (en) Storage method and device based on Internet of things and security chip
CN108377188A (en) A kind of quantum cryptography system for extraordinary emergent self-organized network communication
CN101422012A (en) A method for identifying a task authorization
CN109617867B (en) Intelligent gateway system for controlling household equipment
CN111342952B (en) Safe and efficient quantum key service method and system
CN109606151B (en) Automatic charging method and system based on cloud optimization scheduling
CN108803509A (en) A kind of polymorphic type CPU compatibilities industrial controller system
Crosara et al. A stochastic model for age-of-information efficiency in ARQ systems with energy harvesting
CN106973040A (en) A kind of smart mobile phone secret short message security system and secret short message transmission method
CN101202965B (en) Method for transmitting safe point-to-point short message facing to connectionless
CN109862526A (en) Document transmission method, device, computer equipment and storage medium
CN109257274A (en) The switching node device of quantum secret communication network system and communications network system including the device
CN101635717B (en) Processing method and processing system of novel component-based network protocol
CN115865334A (en) Quantum key distribution method and device and electronic equipment
CN114362939B (en) Dynamic route forwarding method, storage device and intelligent terminal based on trusted relay quantum secret communication network
CN105704651B (en) A kind of wireless Ad Hoc agency incidentally network soap message transmission method
CN114401085B (en) Network architecture and key storage method of quantum secret communication network
CN113438255B (en) Multi-level Internet of things operation method and system and readable storage medium
CN105119805B (en) A kind of instant communication data transmission method and instant communication data Transmission system

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