CN115982074A - Docking station data processing method - Google Patents
Docking station data processing method Download PDFInfo
- Publication number
- CN115982074A CN115982074A CN202310264701.5A CN202310264701A CN115982074A CN 115982074 A CN115982074 A CN 115982074A CN 202310264701 A CN202310264701 A CN 202310264701A CN 115982074 A CN115982074 A CN 115982074A
- Authority
- CN
- China
- Prior art keywords
- data
- queue
- received
- docking station
- bubble
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Abstract
The invention aims to provide a docking station data processing method, which executes the following steps: step 1: when the data transmission interface of the docking station receives the data of a sender, the received data is firstly put into a data stack part integrated in the docking station; the data stack part stores the received data in a queue mode, and numbers the data in the queue according to the time sequence; step 2: the data stack part transmits the data of the queue at the cycle interval, and comprises the following steps: step 2.1: acquiring data of the queue at set intervals according to the numbering sequence; step 2.2: and adding the acquired queue data into a data boundary to obtain a data bubble of the queue data, and sending the queue data to a receiving party in the form of the data bubble. The invention ensures the safety of data by a data interval sending mode, and simultaneously avoids data distortion caused by interference during data transmission by a data bubble packaging mode.
Description
Technical Field
The invention relates to the technical field of docking stations, in particular to a docking station data processing method.
Background
A docking station (docpod stdtio), also called a Port replicator (Port replicator), is an external device designed for portable mobile electronic devices (mainly notebook computers). By copying and expanding the port of the notebook computer, the notebook computer can be conveniently connected with a plurality of accessories or external devices (such as a power adapter, a network cable, a mouse, an external keyboard, a printer and an external display) in a one-stop mode.
In the conventional use process, the docking station only plays a role of data transmission when the external device is connected with the computer. However, when the requirements for data security are high and the requirements for interference of data transmission are strict, the conventional docking station cannot meet the use requirements.
Since the docking station generally has a plurality of data transmission interfaces, data interference sometimes occurs when a large amount of data is transmitted in parallel. When one data transmission interface transmits data, interference is caused to the data transmitted by the adjacent data interface.
In addition, although the distance between the two connected parties of the docking station is strong, the data transmission process of the docking station is short, and it is difficult to intercept the data transmitted in the docking station by other means. However, for some special application scenarios, for example, when long-distance transmission with high security is required, special extra means are required to ensure the security of data transmission, which often results in cost increase.
Disclosure of Invention
In view of the above, the main objective of the present invention is to provide a docking station data processing method, which guarantees data security by means of data interval transmission, and simultaneously avoids data distortion caused by interference during data transmission by means of encapsulating data bubbles.
In order to achieve the purpose, the technical scheme of the invention is realized as follows:
a docking station data processing method, the method performing the steps of:
step 1: when the data transmission interface of the docking station receives the data of a sender, the received data is firstly put into a data stack part integrated in the docking station; the data stack part stores the received data in a queue mode, and numbers the data in the queue according to the time sequence;
step 2: the data stack part transmits the data of the queue at cyclic intervals, and comprises the following steps:
step 2.1: acquiring data of the queue at set intervals according to the numbering sequence;
step 2.2: adding the acquired queue data into a data boundary to obtain a data bubble of the queue data, and sending the queue data to a receiving party in the form of the data bubble; the data boundary is a data encapsulation packet formed by invalid data.
And circularly executing the step 2.1 to the step 2.2 until the data of the queue are completely transmitted.
Furthermore, the docking station at least comprises two data transmission interfaces for connecting external devices and two data transmission interfaces for connecting fixed terminals.
Further, the process of acquiring the data of the queue at the set interval in step 2.1 includes: and aiming at the data received by each data transmission interface, generating an interval value according to the time of each data and the inherent parameters of the data transmission interface, and acquiring the data of the queue according to the generated concurrent functions.
Further, the method for generating the interval value according to the time of each data and the intrinsic parameters of the data transmission interface includes:
(ii) a Wherein +>
Is an interval value, is based on the sum of the values of the sum and the sum of the values of the sum>
For the time of each data, ->
Are intrinsic parameters of the data transmission interface.
Further, the method for adding the acquired queue data to the data boundary in step 2.2 to obtain the data bubble of the queue data includes: generating a plurality of meaningless data blocks; meaningless blocks of data are inserted into the beginning and ending portions of the queue data.
Further, the method for generating the meaningless data block comprises the following steps: setting a binary code sequence meeting a specific recursion rule, performing multiple recursions on the binary code sequence to obtain a recursion result, and taking the recursion result as a meaningless data block.
Further, after receiving the data bubble, the receiver first filters the data bubble to filter out meaningless data blocks in the data bubble.
Further, the method for the receiver to filter the received data bubbles includes: and carrying out recursion rule detection on the received data, if the received data meets the recursion rule, discarding the received data, and if the received data does not meet the recursion rule, retaining the received data.
Further, after receiving the data, the receiving side performs data splicing on the data, and performs data restoration, including: the received data passes through a data splicer to be subjected to data restoration; the process of data splicing by the data splicer comprises the following steps: inputting T-bit length data from the end parts of P data splicers with the length of T for outputting from the start parts of the P data splicers with the length of O bits, wherein
(ii) a Reading the O-bit length data from the position indicated by the mark based on the mark whose moving range is limited to the data splicer of the start part and indicating the start point of the O-bit length data to be read before; wherein, inputting the data with the length of T bits from the end parts of the P data splicers with the length of T comprises the following steps: inputting a new T-bit length data into the data splicer at the ending part in each splicing period, and sequentially advancing the existing data in the P data splicers to the starting part by one data splicer。
Further, the data of the length of the O bit from the position indicated by the reading mark includes: triggering the reading of the O-bit length data at the starting parts of the P data splicers under the splicing period containing valid data in the starting part data splicers; the start part data splicer comprises effective data which is counted by a start part cache effective data counter; the O-bit length data from the position indicated by the read mark includes: and when the valid data contained in the start part data splicer and the valid data count values contained in the P data splicers are the same and are D, only the data of the front D bits in the read O-bit length data is taken as valid data.
By adopting the technical scheme, the invention has the following beneficial effects: according to the invention, the data transmitted by the docking station is transmitted at intervals, so that the safety of the data in the transmission process is improved; in another aspect, inter-data interference that may occur with data transmission in a docking station is avoided by way of invalid data encapsulation.
Drawings
Other features, objects and advantages of the invention will become more apparent upon reading of the detailed description of non-limiting embodiments made with reference to the following drawings:
fig. 1 is a schematic flowchart of a docking station data processing method according to an embodiment of the present invention.
Detailed Description
The method of the present invention will be described in further detail with reference to the accompanying drawings and embodiments of the invention.
Example 1
As shown in fig. 1, a docking station data processing method performs the steps of:
step 1: when the data transmission interface of the docking station receives the data of a sender, the received data is firstly put into a data stack part integrated in the docking station; the data stack part stores the received data in a queue mode, and numbers the data in the queue according to the time sequence;
the queue mode will ensure that the first entered data is sent first, without changing the sequence of sending data simultaneously. After the receiving side receives the data, although the received data is transmitted according to the interval, the receiving side may splice the simultaneously received sequence and the subsequently received data according to the queue sequence.
Step 2: the data stack part transmits the data of the queue at cyclic intervals, and comprises the following steps:
step 2.1: acquiring data of the queue at set intervals according to the numbering sequence;
step 2.2: adding the acquired queue data into a data boundary to obtain a data bubble of the queue data, and sending the queue data to a receiving party in the form of the data bubble; the data boundary is a data encapsulation packet formed by invalid data.
And circularly executing the step 2.1 to the step 2.2 until the data of the queue are completely transmitted.
Data are sent out in an interval mode, a certain interval exists between each sent data and subsequent data, namely the data are not sent out in a completely continuous mode, and therefore even if the data are illegally obtained, the safety of the data can be guaranteed to a certain extent.
Specifically, the docking station at least comprises two data transmission interfaces for connecting external equipment and two data transmission interfaces for connecting fixed terminals.
There is a potential for data interference with the docking station of the multiple data transmission interface, and the potential for data interference with the wirelessly connected docking station is greater. But the docking station of the single data transmission interface does not have the phenomenon of mutual interference among data.
Specifically, the process of acquiring the data of the queue at the set interval in step 2.1 includes: and aiming at the data received by each data transmission interface, generating an interval value according to the time of each data and the inherent parameters of the data transmission interface, and acquiring the data of the queue according to the generated concurrent functions.
The rule of generation of the interval value follows a certain algorithm. After the receiving side receives the data, since the data received each time is discontinuous data with a certain interval, the data needs to be restored after the whole queue data is received. The receiver can complete the data recovery through the preset algorithm rule.
Specifically, the method for generating the interval value according to the time of each data and the intrinsic parameters of the data transmission interface includes:
(ii) a Wherein +>
Is an interval value, is based on the sum of the values of the sum and the sum of the values of the sum>
For each data time>
Are intrinsic parameters of the data transmission interface.
The algorithm setting rule can be determined by itself according to actual requirements, but in practice, the setting of the interval value needs to be closely related to the intrinsic parameters of the data transmission interface, because if the receiver receives the data, if the data is to be restored, the execution needs to be performed quickly and efficiently, otherwise, the delay of the data is high.
In this case, it is necessary to restore the rule as simple as possible and avoid other additional parameters, but if the rule is chosen very simple, the data is easily stolen and then cracked. Therefore, selecting a parameter that may change with data transmission, such as time, and adding a parameter that does not change, such as intrinsic parameters, can find a balance in efficiency and security.
Specifically, the method for adding the acquired queue data to the data boundary in step 2.2 to obtain the data bubble of the queue data includes: generating a plurality of meaningless data blocks; meaningless data blocks are inserted into the beginning and ending portions of the queue data.
Specifically, the method for generating the meaningless data block includes: setting a binary code sequence meeting a specific recursion rule, performing multiple recursions on the binary code sequence to obtain a recursion result, and taking the recursion result as a meaningless data block.
Specifically, after receiving the data bubble, the receiver first filters the data bubble to filter out meaningless data blocks in the data bubble.
In essence, the generated data bubble is encapsulated by the meaningless data block. The likelihood of interference between data is significantly reduced as meaningless blocks of data are generated following certain recursion rules.
Specifically, the method for the receiver to filter the received data bubble includes: and carrying out recursion rule detection on the received data, if the received data meets the recursion rule, discarding the received data, and if the received data does not meet the recursion rule, retaining the received data.
Specifically, after receiving the data, the receiving side further performs data splicing on the data, and performs data restoration, including: the received data passes through a data splicer to be subjected to data restoration; the process of data splicing by the data splicer comprises the following steps: inputting T-bit length data from the end parts of P data splicers with the length of T for outputting from the start parts of the P data splicers with the length of O bits, wherein
(ii) a Reading the O-bit length data from the position indicated by the mark based on the mark whose moving range is limited to the data splicer of the start part and indicating the start point of the O-bit length data to be read before; wherein, inputting the data with the length of T bits from the end parts of the P data splicers with the length of T comprises the following steps: inputting a new T-bit length data into the data splicer at the ending part in each splicing period, and sequentially advancing the existing data in the P data splicers by one data splicer towards the starting part.
In the present invention, the data splicer may be a data register, that is, a register for temporarily storing operands, results, and information used in the calculation process of the processor. The data register is used for temporarily storing an instruction or a data word read by the main memory; conversely, when an instruction or a data word is stored into main memory, it is also temporarily stored in the data register. In an operator of single accumulator architecture, the data register may also double as an operand register.
Specifically, the O-bit length data from the position indicated by the read mark includes: triggering the reading of the O-bit length data at the starting parts of the P data splicers under the splicing period containing valid data in the starting part data splicers; the start part data splicer comprises effective data, and the effective data is counted by a start part cache effective data counter; the O-bit length data from the position indicated by the read mark includes: and when the valid data contained in the start part data splicer and the valid data count values contained in the P data splicers are the same and are D, only the data of the front D bits in the read O-bit length data is taken as valid data.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference sign in a claim should not be construed as limiting the claim concerned. Furthermore, it is obvious that the word "comprising" does not exclude other elements or steps, and the singular does not exclude the plural. A plurality of units or means recited in the apparatus claims may also be implemented by one unit or means in software or hardware. The terms first, second, etc. are used to denote names, but not to denote any particular order.
Claims (10)
1. Docking station data processing method, characterized in that the method performs the steps of:
step 1: when a docking station data transmission interface receives data of a sender, the received data is firstly put into a data stack part integrated in the docking station; the data stack part stores the received data in a queue mode, and numbers the data in the queue according to the time sequence;
and 2, step: the data stack part transmits the data of the queue at the cycle interval, and comprises the following steps:
step 2.1: acquiring data of the queue at set intervals according to the numbering sequence;
step 2.2: adding the acquired queue data into a data boundary to obtain a data bubble of the queue data, and sending the queue data to a receiving party in the form of the data bubble; the data boundary is a data encapsulation packet formed by invalid data;
and circularly executing the step 2.1 to the step 2.2 until the data of the queue are completely transmitted.
2. The method of claim 1, wherein the docking station comprises at least two data transmission interfaces for connecting external devices and two data transmission interfaces for connecting fixed terminals.
3. The method of claim 2, wherein the step 2.1 of obtaining data of the queue at set intervals comprises: and aiming at the data received by each data transmission interface, generating an interval value according to the time of each data and the inherent parameters of the data transmission interface, and acquiring the data of the queue according to the generated concurrent functions.
4. The method of claim 3, wherein the generating the interval value according to the time of each data and the intrinsic parameters of the data transmission interface comprises:
(ii) a Wherein it is present>
In interval values>
For the time of each data, ->
Are intrinsic parameters of the data transmission interface.
5. The method of claim 1, wherein the step 2.2 of adding the acquired queue data to the data boundary to obtain the data bubble of the queue data comprises: generating a plurality of meaningless data blocks; meaningless blocks of data are inserted into the beginning and ending portions of the queue data.
6. The method of claim 5, wherein the meaningless data block is generated by a method comprising: setting a binary code sequence meeting a specific recursion rule, performing multiple recursions on the binary code sequence to obtain a recursion result, and taking the recursion result as a meaningless data block.
7. The method of claim 6, wherein the receiver, upon receiving the data bubble, first filters the data bubble to filter out meaningless data blocks in the data bubble.
8. The method of claim 1, wherein the method for the receiver to filter the received data bubbles comprises: and carrying out recursion rule detection on the received data, if the received data meets the recursion rule, discarding the received data, and if the received data does not meet the recursion rule, retaining the received data.
9. The method of claim 8, wherein the receiving side, upon receiving the data, will also data splice the dataAnd performing data reduction, including: the received data passes through a data splicer to be subjected to data restoration; the process of data splicing by the data splicer comprises the following steps: inputting T-bit length data from the end parts of P data splicers with the length of T for outputting from the start parts of the P data splicers with the length of O bits, wherein
(ii) a Reading the O-bit length data from the position indicated by the mark based on the mark whose moving range is limited to the data splicer of the start part and indicating the start point of the O-bit length data to be read before; wherein, inputting the data with the length of T bits from the end parts of the P data splicers with the length of T comprises the following steps: inputting a new T-bit length data into the data splicer at the ending part in each splicing period, and sequentially advancing the existing data in the P data splicers by one data splicer towards the starting part.
10. The method of claim 9, wherein reading the data of the O-bit length from the position indicated by the mark comprises: triggering the reading of the O-bit length data at the starting parts of the P data splicers under the splicing period containing valid data in the starting part data splicers; the start part data splicer comprises effective data which is counted by a start part cache effective data counter; the data of the length of the O bit from the position shown by the reading mark comprises: and when the valid data contained in the start part data splicer and the valid data count values contained in the P data splicers are the same and are D, only the data of the front D bits in the read O-bit length data is taken as valid data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310264701.5A CN115982074B (en) | 2023-03-20 | 2023-03-20 | Docking station data processing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310264701.5A CN115982074B (en) | 2023-03-20 | 2023-03-20 | Docking station data processing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115982074A true CN115982074A (en) | 2023-04-18 |
| CN115982074B CN115982074B (en) | 2023-07-04 |
Family
ID=85958185
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310264701.5A Active CN115982074B (en) | 2023-03-20 | 2023-03-20 | Docking station data processing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115982074B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH09312664A (en) * | 1996-05-24 | 1997-12-02 | Matsushita Electric Works Ltd | Multi-port repeater |
| US6094700A (en) * | 1998-03-13 | 2000-07-25 | Compaq Computer Corporation | Serial bus system for sending multiple frames of unique data |
| CN101227688A (en) * | 2007-11-21 | 2008-07-23 | 中兴通讯股份有限公司 | Method for transmitting data through USB interface on mobile phone |
| CN103793354A (en) * | 2006-06-02 | 2014-05-14 | 旺宏电子股份有限公司 | Method and apparatus for communicating data over multiple pins of multi-mode bus |
| WO2016101725A1 (en) * | 2014-12-26 | 2016-06-30 | 中国科学院自动化研究所 | Method and device for determining finite state machine spliceability and splicing rules |
| CN105808238A (en) * | 2016-02-26 | 2016-07-27 | 四川效率源信息安全技术股份有限公司 | Secure Dock and application method based on the secure Dock |
| CN107070782A (en) * | 2017-05-02 | 2017-08-18 | 山东浪潮通软信息科技有限公司 | A kind of Interface integration method, server and the system expansible based on message queue |
| CN111580991A (en) * | 2020-05-09 | 2020-08-25 | 莱芜职业技术学院 | Computer data processing method and system |
| CN112948084A (en) * | 2021-03-03 | 2021-06-11 | 上海御微半导体技术有限公司 | Task scheduling method and system |
| CN113905357A (en) * | 2021-12-09 | 2022-01-07 | 深圳软牛科技有限公司 | Data migration method, device, equipment and storage medium based on WiFi direct connection |
-
2023
- 2023-03-20 CN CN202310264701.5A patent/CN115982074B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH09312664A (en) * | 1996-05-24 | 1997-12-02 | Matsushita Electric Works Ltd | Multi-port repeater |
| US6094700A (en) * | 1998-03-13 | 2000-07-25 | Compaq Computer Corporation | Serial bus system for sending multiple frames of unique data |
| CN103793354A (en) * | 2006-06-02 | 2014-05-14 | 旺宏电子股份有限公司 | Method and apparatus for communicating data over multiple pins of multi-mode bus |
| CN101227688A (en) * | 2007-11-21 | 2008-07-23 | 中兴通讯股份有限公司 | Method for transmitting data through USB interface on mobile phone |
| WO2016101725A1 (en) * | 2014-12-26 | 2016-06-30 | 中国科学院自动化研究所 | Method and device for determining finite state machine spliceability and splicing rules |
| CN105808238A (en) * | 2016-02-26 | 2016-07-27 | 四川效率源信息安全技术股份有限公司 | Secure Dock and application method based on the secure Dock |
| CN107070782A (en) * | 2017-05-02 | 2017-08-18 | 山东浪潮通软信息科技有限公司 | A kind of Interface integration method, server and the system expansible based on message queue |
| CN111580991A (en) * | 2020-05-09 | 2020-08-25 | 莱芜职业技术学院 | Computer data processing method and system |
| CN112948084A (en) * | 2021-03-03 | 2021-06-11 | 上海御微半导体技术有限公司 | Task scheduling method and system |
| CN113905357A (en) * | 2021-12-09 | 2022-01-07 | 深圳软牛科技有限公司 | Data migration method, device, equipment and storage medium based on WiFi direct connection |
Non-Patent Citations (1)
| Title |
|---|
| 施文;刘志学;刘林;: "汽车零部件物流越库配送系统的多重响应优化", 汽车工程, no. 03 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115982074B (en) | 2023-07-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP1320027B1 (en) | Elliptic curve cryptosystem apparatus, method and program | |
| CN102163268B (en) | The term of execution verifying software code the method and apparatus of integrality | |
| CN112347508A (en) | Block chain data sharing encryption and decryption method and system | |
| CN114124502B (en) | Message transmission method, device, equipment and medium | |
| CN112685777A (en) | Information desensitization method, apparatus, computer device and medium | |
| CN111984985A (en) | HDL source code encryption method based on FPGA hardware system | |
| CN111176685A (en) | Upgrading method and device | |
| CN111368322B (en) | File decryption method and device, electronic equipment and storage medium | |
| CN115982074B (en) | Docking station data processing method | |
| CN116861470A (en) | Encryption and decryption method, encryption and decryption device, computer readable storage medium and server | |
| CN107223322A (en) | The method, apparatus and system of signature verification | |
| CN116208420A (en) | Monitoring information safety transmission method, system, equipment and storage medium | |
| EP3975471A1 (en) | Homomorphic encryption device and operating method thereof | |
| CN112035379B (en) | Method and device for using storage space, storage medium and electronic device | |
| CN111698208B (en) | Method, apparatus and storage medium for encoding multi-tunnel adaptive data stream | |
| CN114401081A (en) | Data encryption transmission method, application and system | |
| CN109802824B (en) | Shift processing method and device, computer storage medium and terminal | |
| CN113378025A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN111722940A (en) | Message transmission method, terminal equipment and transmission system based on asynchronous serial port | |
| CN111444535A (en) | Method, apparatus, and computer storage medium for generating aggregated data tags | |
| CN110852083A (en) | Method and device for generating short message template | |
| CN116384352B (en) | Data set generation method, device, equipment and medium | |
| CN111400717B (en) | Data reading method and related device | |
| CN107562442B (en) | Method and device for reading data | |
| CN116955020A (en) | Aircraft data forwarding method, control system, equipment and storage medium |
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 |