CN115982074B - Docking station data processing method - Google Patents
Docking station data processing method Download PDFInfo
- Publication number
- CN115982074B CN115982074B CN202310264701.5A CN202310264701A CN115982074B CN 115982074 B CN115982074 B CN 115982074B CN 202310264701 A CN202310264701 A CN 202310264701A CN 115982074 B CN115982074 B CN 115982074B
- Authority
- CN
- China
- Prior art keywords
- data
- queue
- steps
- splicer
- received
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Communication Control (AREA)
Abstract
It is an object of the present invention to provide a docking station data processing method, which performs the steps of: step 1: when the data transmission interface of the docking station receives the data of the 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 of the queue according to the time sequence; step 2: the data stack part carries out cyclic interval transmission on the data of the queue, and the method comprises the following steps: step 2.1: according to the numbering sequence, acquiring the data of the queue at set intervals; step 2.2: and adding the obtained queue data into the data boundary to obtain a data bubble of the queue data, and sending the queue data to a receiver in the form of the data bubble. The invention ensures the safety of data by the data interval transmission mode, and simultaneously avoids the data distortion caused by interference in the data transmission mode by the mode of packaging data bubbles.
Description
Technical Field
The invention relates to the technical field of docking stations, in particular to a docking station data processing method.
Background
Docking stations (DocPiOg stdctios), also known as Port replicators (Port replicators), are external devices designed for portable mobile electronic devices (mainly notebook computers). By copying and expanding the ports 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 one-stop mode.
In the conventional use process, the docking station only plays a role in data transmission when the external equipment is connected with the computer. However, when many requirements for data security are high and interference requirements for data transmission are strict, it is difficult for the existing docking station to meet such use requirements.
Since the docking station generally has a plurality of data transmission interfaces, data interference may occur when a large number of parallel data transmission is performed. When one data transmission interface transmits data, interference is caused to the data transmitted by the adjacent data interfaces.
In addition, it is often difficult to intercept data transmitted in a docking station by other means, although the data transmission process of the docking station is short, although the two parties of the docking station are closely spaced. However, for some special application scenarios, such as long-distance transmission requiring high security, special additional means are required to ensure the security of data transmission, which often results in an increase of cost.
Disclosure of Invention
Therefore, the main purpose of the invention is to provide a data processing method of a docking station, which guarantees the safety of data by a data interval transmission mode, and meanwhile, avoids data distortion caused by interference in data transmission by a data bubble packaging mode.
In order to achieve the above 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 the 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 of the queue according to the time sequence;
step 2: the data stack part carries out cyclic interval transmission on the data of the queue, and the method comprises the following steps:
step 2.1: according to the numbering sequence, acquiring the data of the queue at set intervals;
step 2.2: adding the obtained queue data into a data boundary to obtain a data bubble of the queue data, and sending the queue data to a receiver in the form of the data bubble; the data boundary is a data package composed of invalid data.
And circularly executing the steps 2.1 to 2.2 until the data of the queue are all transmitted.
Further, the docking station at least comprises two data transmission interfaces connected with external equipment and two data transmission interfaces connected with the fixed terminal.
Further, the process of acquiring the data of the queue at the set intervals in the step 2.1 includes: and generating an interval value according to the time of each data and the inherent parameters of the data transmission interface aiming at the data received by each data transmission interface, and acquiring the data of the queue according to the generated double 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 comprises the following steps:
the method comprises the steps of carrying out a first treatment on the surface of the Wherein (1)>
For interval value, +.>
For the time of each data item,
is an intrinsic parameter of the data transmission interface.
Further, the method for adding the obtained queue data to the data boundary in the step 2.2 to obtain the data bubble of the queue data includes: generating a plurality of nonsensical data blocks; nonsensical data blocks are inserted into the beginning and ending portions of the queue data.
Further, the method for generating the nonsensical data block includes: setting a binary code sequence meeting a recursion rule, recursing the binary code sequence for a plurality of times to obtain a recursion result, and taking the recursion result as a nonsensical data block.
Further, after receiving the data bubble, the receiver first filters the data bubble to filter out nonsensical data blocks in the data bubble.
Further, the method for filtering the received data bubbles by the receiver comprises the following steps: and carrying out recursion rule detection on the received data, discarding the received data if the received data meets the recursion rule, and retaining the received data if the received data does not meet the recursion rule.
Further, after receiving the data, the receiving party further performs data splicing on the data, and performs data restoration, including: the received data is subjected to data restoration through a data splicer; the process of the data splice by the data splice device comprises the following steps: inputting data of T bit length from the end part of P data splicers of T length for outputting from the beginning part of the P data splicers of T length in O bit length, wherein
The method comprises the steps of carrying out a first treatment on the surface of the Reading the O-bit length data from the position indicated by the mark based on the mark whose movement range is limited within the data splicer of the start portion and which indicates the start point of the O-bit length data to be read before; wherein inputting data of a T bit length from an end portion of the P data splicers of length T comprises: and inputting a new data with the length of T bits into the data splicer of the ending part in each splicing period, and sequentially advancing the existing data in the P data splicers with the length of T by one data splicer towards the starting part.
Further, the reading the O-bit length data from the position indicated by the mark includes: triggering the reading of the O-bit length data of the beginning part of the data splicer with the length of T under the splicing period of the valid data contained in the beginning part data splicer; the starting part data splicer comprises effective data which are counted by a starting part cache effective data counter; the reading of the O-bit length data from the location indicated by the mark includes: and when the valid data contained in the beginning part data splicer is the same as the valid data count value contained in the P data splicer with the length of T and is D, taking only the data of the front D bits in the read O-bit length data as the 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 are 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 in data transmission in the docking station is avoided by way of invalid data encapsulation.
Drawings
Other features, objects and advantages of the present invention will become more apparent upon reading of the detailed description of non-limiting embodiments, made with reference to the accompanying drawings in which:
fig. 1 is a flowchart of a method for processing docking station data 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.
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 the 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 of the queue according to the time sequence;
the way of the queue ensures that the first incoming data is sent out first, and the sequence before and after the data is sent out simultaneously is not changed. After the receiving party receives the data, the receiving party can splice the sequence received simultaneously and the data received subsequently according to the sequence of the queue although the received data is transmitted according to intervals.
Step 2: the data stack part carries out cyclic interval transmission on the data of the queue, and the method comprises the following steps:
step 2.1: according to the numbering sequence, acquiring the data of the queue at set intervals;
step 2.2: adding the obtained queue data into a data boundary to obtain a data bubble of the queue data, and sending the queue data to a receiver in the form of the data bubble; the data boundary is a data package composed of invalid data.
And circularly executing the steps 2.1 to 2.2 until the data of the queue are all transmitted.
The data are sent out in an interval mode, and a certain interval exists between each sent data and the subsequent data, namely the data are not sent out in a completely continuous mode, so that the safety of the data can be ensured to a certain extent even if the data are illegally acquired.
Specifically, the docking station at least comprises two data transmission interfaces connected with external equipment and two data transmission interfaces connected with the fixed terminal.
The data interference possibility exists in the docking station of the multi-data transmission interface, and the data interference possibility of the docking station of the wireless connection is larger. However, the docking station of the single data transmission interface has no phenomenon of mutual interference between data.
Specifically, the process of acquiring the data of the queue at the set intervals in the step 2.1 includes: and generating an interval value according to the time of each data and the inherent parameters of the data transmission interface aiming at the data received by each data transmission interface, and acquiring the data of the queue according to the generated double functions.
The generation rule of the interval value follows a certain algorithm. After the receiving party receives the data, as each time the received data is discontinuous data with a certain interval, the receiving party needs to wait until the receiving of the whole queue data is completed and restore the data. Through preset algorithm rules, the receiver can complete possible data recovery.
Specifically, the method for generating the interval value according to the time of each data and the intrinsic parameters of the data transmission interface comprises the following steps:
the method comprises the steps of carrying out a first treatment on the surface of the Wherein (1)>
For interval value, +.>
For the time of each data item,
inherent to the data transmission interfaceParameters.
The algorithm setting rule can be determined according to the actual requirement, but in practice, the setting of the interval value needs to be closely related to the inherent parameter of the data transmission interface, because if the receiving party needs to restore the data after receiving the data, the data needs to be executed quickly and efficiently, otherwise, the delay of the data is high.
In this case, the restoration rule needs to be as simple as possible and other additional parameters are avoided, but if the selected rule is very simple, the data is easily broken after being stolen. Therefore, a balance can be found in high efficiency and security by selecting a parameter that may change with data transmission and adding an inherent parameter that does not change.
Specifically, the method for adding the acquired queue data to the data boundary in the step 2.2 to obtain the data bubble of the queue data includes: generating a plurality of nonsensical data blocks; nonsensical 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 recursion rule, recursing the binary code sequence for a plurality of times to obtain a recursion result, and taking the recursion result as a nonsensical data block.
Specifically, after receiving the data bubble, the receiver first filters the data bubble to filter out nonsensical data blocks in the data bubble.
Essentially, the generated bubbles are encapsulated by nonsensical data blocks. The likelihood of interference between data is significantly reduced because the nonsensical data blocks are generated following recursive rules.
Specifically, the method for filtering the received data bubbles by the receiver comprises the following steps: and carrying out recursion rule detection on the received data, discarding the received data if the received data meets the recursion rule, and retaining the received data if the received data does not meet the recursion rule.
Specifically, after receiving the data, the receiving party further performs data splicing on the data, and performs data restoration, including: the received data is subjected to data restoration through a data splicer; the process of the data splice by the data splice device comprises the following steps: inputting data of T bit length from the end part of P data splicers of T length for outputting from the beginning part of the P data splicers of T length in O bit length, wherein
The method comprises the steps of carrying out a first treatment on the surface of the Reading the O-bit length data from the position indicated by the mark based on the mark whose movement range is limited within the data splicer of the start portion and which indicates the start point of the O-bit length data to be read before; wherein inputting data of a T bit length from an end portion of the P data splicers of length T comprises: and inputting a new data with the length of T bits into the data splicer of the ending part in each splicing period, and sequentially advancing the existing data in the P data splicers with the length of T by one data splicer towards the starting part.
In the present invention, the data splicer may be a data register, i.e. for temporarily storing operands, results and information used in the processor calculation process. The data register is used for temporarily storing an instruction or a data word read out from 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 the arithmetic unit of the single accumulator structure, the data register can also be used as an operand register.
Specifically, the reading the O-bit length data from the position indicated by the mark includes: triggering the reading of the O-bit length data of the beginning part of the data splicer with the length of T under the splicing period of the valid data contained in the beginning part data splicer; the starting part data splicer comprises effective data which are counted by a starting part cache effective data counter; the reading of the O-bit length data from the location indicated by the mark includes: and when the valid data contained in the beginning part data splicer is the same as the valid data count value contained in the P data splicer with the length of T and is D, taking only the data of the front D bits in the read O-bit length data as the 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 characteristics 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 evident that the word "comprising" does not exclude other elements or steps, and that the singular does not exclude a plurality. A plurality of units or means recited in the apparatus claims can also be implemented by means of one unit or means in software or hardware. The terms first, second, etc. are used to denote a name, but not any particular order.
Claims (4)
1. A method of docking station data processing, the method performing the steps of:
step 1: when the data transmission interface of the docking station receives the data of the 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 of the queue according to the time sequence;
step 2: the data stack part carries out cyclic interval transmission on the data of the queue, and the method comprises the following steps:
step 2.1: according to the numbering sequence, acquiring the data of the queue at set intervals;
step 2.2: adding the obtained queue data into a data boundary to obtain a data packet of the queue data, and sending the queue data to a receiver in the form of the data packet; the data boundary is a data package formed by invalid data;
circularly executing the steps 2.1 to 2.2 until the data of the queue are transmitted;
the method for adding the obtained queue data to the data boundary in the step 2.2 to obtain the data packet of the queue data comprises the following steps: generating a plurality of nonsensical data blocks; inserting nonsensical data blocks into a beginning portion and an ending portion of the queue data; the method for generating the nonsensical data block comprises the following steps: setting a binary code sequence meeting a recursion rule, recursing the binary code sequence for a plurality of times to obtain a recursion result, and taking the recursion result as a nonsensical data block; after receiving the data packet, the receiver firstly filters the data packet to filter meaningless data blocks in the data packet;
the method for filtering the received data packet by the receiver comprises the following steps: performing recursion rule detection on the received data, discarding the received data if the received data meets the recursion rule, and reserving the received data if the received data does not meet the recursion rule;
after receiving the data, the receiver further performs data splicing on the data and performs data restoration, and the method comprises the following steps: the received data is subjected to data restoration through a data splicer; the process of the data splice by the data splice device comprises the following steps: inputting data of T bit length from the end part of P data splicers of T length for outputting from the beginning part of the P data splicers of T length in O bit length, wherein
The method comprises the steps of carrying out a first treatment on the surface of the Reading the O-bit length data from the position indicated by the mark based on the mark whose movement range is limited within the data splicer of the start portion and which indicates the start point of the O-bit length data to be read before; wherein inputting data of a T bit length from an end portion of the P data splicers of length T comprises: inputting new data with T bit length into the data splicer of the ending part in each splicing period, and enabling the existing data in the P data splicers with the length of T to sequentially move forward one data splicer towards the starting part;
the reading the data of the length of the O bit from the position shown by the mark comprises the following steps: triggering the reading of the O-bit length data of the beginning part of the data splicer with the length of T under the splicing period of the valid data contained in the beginning part data splicer; the starting part data splicer comprises effective data which are counted by a starting part cache effective data counter; the reading of the O-bit length data from the location indicated by the mark includes: and when the valid data contained in the beginning part data splicer is the same as the valid data count value contained in the P data splicer with the length of T and is D, taking only the data of the front D bits in the read O-bit length data as the valid data.
2. The method of claim 1, wherein the docking station includes at least two data transmission interfaces for connecting to external devices and two data transmission interfaces for connecting to fixed terminals.
3. The method as set forth in claim 2, wherein the process of acquiring the data of the queue at the set intervals in step 2.1 includes: and generating an interval value according to the time of each data and the inherent parameters of the data transmission interface aiming at the data received by each data transmission interface, and acquiring the data of the queue according to the generated double functions.
4. A method as claimed in claim 3, wherein the method of generating the interval value from the time of each data and the intrinsic parameters of the data transmission interface comprises:
the method comprises the steps of carrying out a first treatment on the surface of the Wherein (1)>
As the value of the interval(s),
for the time of each data +.>
Is an intrinsic parameter of the data transmission interface.
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 CN115982074A (en) | 2023-04-18 |
| CN115982074B true 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 (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016101725A1 (en) * | 2014-12-26 | 2016-06-30 | 中国科学院自动化研究所 | Method and device for determining finite state machine spliceability and splicing rules |
| 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 |
Family Cites Families (7)
| 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 |
| CN103793354B (en) * | 2006-06-02 | 2019-06-04 | 旺宏电子股份有限公司 | In the method and device of more pins transmission data of multi-mode bus |
| CN101227688A (en) * | 2007-11-21 | 2008-07-23 | 中兴通讯股份有限公司 | Method for transmitting data through USB interface on mobile phone |
| CN105808238B (en) * | 2016-02-26 | 2019-03-22 | 四川效率源信息安全技术股份有限公司 | A kind of safe Dock and its application method |
| CN107070782A (en) * | 2017-05-02 | 2017-08-18 | 山东浪潮通软信息科技有限公司 | A kind of Interface integration method, server and the system expansible based on message queue |
| CN113905357B (en) * | 2021-12-09 | 2022-03-25 | 深圳软牛科技有限公司 | 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 (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016101725A1 (en) * | 2014-12-26 | 2016-06-30 | 中国科学院自动化研究所 | Method and device for determining finite state machine spliceability and splicing rules |
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115982074A (en) | 2023-04-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112685777A (en) | Information desensitization method, apparatus, computer device and medium | |
| CN111259409A (en) | Information encryption method and device, electronic equipment and storage medium | |
| CN115982074B (en) | Docking station data processing method | |
| US20080075102A1 (en) | Interface | |
| CN111368322B (en) | File decryption method and device, electronic equipment and storage medium | |
| CN114327996A (en) | Data storage method and device, storage medium and electronic equipment | |
| CN107223322A (en) | The method, apparatus and system of signature verification | |
| US9203607B2 (en) | Keyless challenge and response system | |
| CN115333753A (en) | Internet protocol address generation method and device, storage medium and electronic equipment | |
| CN112035379B (en) | Method and device for using storage space, storage medium and electronic device | |
| CN111722940B (en) | Message transmission method, terminal equipment and transmission system based on asynchronous serial port | |
| CN112769786B (en) | Data transmission method and device based on oblivious transmission rule and computer equipment | |
| CN111698208B (en) | Method, apparatus and storage medium for encoding multi-tunnel adaptive data stream | |
| CN109802824B (en) | Shift processing method and device, computer storage medium and terminal | |
| KR20220040309A (en) | Homomorphic encryption device and operating method thereof | |
| CN114510216A (en) | Method, device and equipment for storing data | |
| CN110852083A (en) | Method and device for generating short message template | |
| CN114301600B (en) | Method, device and medium for improving HTTP message signature security | |
| CN111444242B (en) | Method for checking data equivalence, electronic device and computer storage medium | |
| CN107562442B (en) | Method and device for reading data | |
| CN116955020A (en) | Aircraft data forwarding method, control system, equipment and storage medium | |
| CN106850779A (en) | The synchronous method and sychronisation of a kind of data | |
| CN106649427B (en) | Information identification method and device | |
| CN110046508A (en) | Service code code value processing method, device and equipment | |
| CN115563646A (en) | Data processing method and device, electronic 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 |