CN101286945A - Method and apparatus for processing of data fragmentation - Google Patents
Method and apparatus for processing of data fragmentation Download PDFInfo
- Publication number
- CN101286945A CN101286945A CNA2008101123037A CN200810112303A CN101286945A CN 101286945 A CN101286945 A CN 101286945A CN A2008101123037 A CNA2008101123037 A CN A2008101123037A CN 200810112303 A CN200810112303 A CN 200810112303A CN 101286945 A CN101286945 A CN 101286945A
- Authority
- CN
- China
- Prior art keywords
- data fragmentation
- message
- data
- node
- sequence number
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the invention relates to a data fragmentation processing method and a device thereof, wherein, the data fragmentation processing method comprises the steps of: caching data fragmentation received and generating a single message link node; judging whether the data fragmentation of the same message is received completely and accurately by the information of the single message link node, if so, message reassembling is carried out; otherwise, the data message is received continuingly or all data message is discarded. The data fragmentation processing method and device thereof judge whether the data fragmentation is received completely and accurately by the information of the single message link node so as to trigger the operation of message fragmentation reassembling, thereby better reducing the system cost of fragmentation reassembling judgment, promoting the judging efficiency of the fragmentation message and improving the performance of the system.
Description
Technical field
The embodiment of the invention relates to data communication technology field, relates in particular to a kind of data fragmentation processing method and device.
Background technology
Along with the development of data communication technology, can provide checking for the user, be easy to expand, and support that (Point to Point Protocol PPP) has obtained extensive use for peer-peer protocol with/asynchronous communication; MultiLink PPP agreement (MultiLink PPP, MP) be a kind ofly a plurality of ppp links can be bundled use, more a kind of link layer protocol of high bandwidth can be provided for the transfer of data of network layer, it has bandwidth, the load balancing of increasing, backs up and utilize burst to reduce effects such as time delay, in the network environment of reality, be a kind of link backup and the extension mechanism that is widely adopted.
Thereby in link load sharing, reduce bag transmission size and reduce under the situation such as propagation delay time, MP usually needs the data message of network layer transmission is encapsulated and burst, and with fragment message according to certain load sharing algorithm, poll sends on the ppp link of binding, at receiver side, need corresponding MP agreement with these burst assemblings, form primitive network layer message and pass to network layer; For example router one passes to router two with message, passes through from top to bottom: message sends to link layer from network; Carry out the encapsulation of link layer ppp protocol; Carrying out the MP burst sends; On router two, be the inverse process of said process, pass through successively: receive single fragment message on the single-link; Carry out the reorganization of fragment message, the on all four information in encapsulation back on formation and the router one; (Internet protocol) IP message after the reorganization passes to network layer, thereby realizes the network peer layer communication capacity of router one and router two.
But the message behind the above-mentioned burst carries out independent transmission respectively on link, because of factors such as physical medium transmission, in the time of can not guaranteeing to arrive router two, must be order arrival according to the burst distribution, therefore when arriving corresponding MP layer and carrying out the burst reorganization, need the problem that solves the burst incorrect order or lose.Regulation according to the MP agreement, beginning in the MP fragment message head form (Begin, B) the bit position is 1 o'clock, sign is first fragment message, finish (End, E) the bit position is 1 o'clock, and sign is last message of burst, and B bit and E bit are 0 o'clock, sign is a message in the middle of the burst, (the continuous message SEQ value of burst is also continuous for Sequence number, the ordinal relation of SEQ) value sign fragment message by sequence number; The Rule of judgment that all fragment messages receive is: B is designated 1 message and receives, supposes that its SEQ is B1; E is designated 1 message and receives, supposes that its SEQ is E1; All messages of continuous SEQ value from B1 to E1 are all received.
Consider the abnormal conditions of burst, agreement stipulates that all buffering bursts possess regular hour validity requirement, promptly after receiving this burst, in the certain hour, if can not recombinate, judges that then this message is unusual, and burst is carried out discard processing.
Existing processing mode to MP protocol fragment message is: adopt receiving that fragment message carries out the organizational form of doubly linked list buffering, after receiving fragment message, size according to SEQ, message is carried out the chain table buffering, chained list possesses the bidirectional research function, can inquire forward less than current burst SEQ fragment message, can inquire message backward greater than current burst SEQ; To the judgement that whether needs to recombinate, be when receiving fragment message at every turn, search for whether all continuous SEQ messages are all received forward and backward, and can find B to be designated 1 the burst literary composition of reporting for the first time forward, can find E to be designated that 1 branch run-out message realizes backward, if all fragment messages are all received, then start the action of reorganization.
In addition, when receiving burst, can start a burst overtime timer, if before timer expiry, burst can not be recombinated at every turn, and then this burst is dropped.
This shows, existing processing method have receive fragment message at every turn after, all need forward, two-way traversal fragment message chained list judges whether the characteristics that can recombinate backward, treatment effeciency is low; And all start overtime timer for each burst, in the router product of reality, need to start a large amount of timers, thereby reduce the performance of integral product.
Summary of the invention
The embodiment of the invention provides a kind of data fragmentation processing method and device, to realize the reducing overhead that the burst reorganization is judged, promotes the judging efficiency of fragment message, thereby improves systematic function.
The embodiment of the invention provides a kind of data fragmentation processing method, and this method comprises:
The data fragmentation that buffer memory receives, and generate single message chain node, wherein single message chain nodal information comprises head node sequence number, tail node sequence number, anticipatory data burst number and the current data fragmentation number of receiving, and described head node sequence number is less than described tail node sequence number;
It is complete and correct to judge by single message chain nodal information whether the data fragmentation of same message receives, if reception is complete and correct, then carries out the message reorganization; If reception is imperfect, then continue receiving data packets; Otherwise, abandon described data message.
The embodiment of the invention provides a kind of data processing equipment, and this device comprises:
Buffer unit, be used for the data fragmentation that buffer memory receives, and generating single message chain node, wherein single message chain nodal information comprises head node sequence number, tail node sequence number, anticipatory data burst number and the current data fragmentation number of receiving, and described head node sequence number is less than described tail node sequence number;
Processing unit, it is complete and correct to be used for judging by single message chain nodal information whether the data fragmentation of same message receives, if reception is complete and correct, then carries out the message reorganization; If reception is imperfect, then continue receiving data packets; Otherwise, abandon described data message.
Above-mentioned data fragmentation processing method and device, whether receive completely by single message chain nodal information judgment data burst, and then trigger the operation of reconstructed file burst, reduced the overhead that the burst reorganization is judged preferably, promote the judging efficiency of fragment message, thereby improved systematic function.
Below by drawings and Examples, the technical scheme of the embodiment of the invention is described in further detail.
Description of drawings
Fig. 1 is the flow chart of data fragmentation processing method embodiment one of the present invention;
Fig. 2 is the schematic diagram of metadata cache structure embodiment of the present invention;
Fig. 3 is the schematic diagram of the single message chain of the present invention node structure embodiment;
Fig. 4 is the schematic diagram of message buffering chain structure embodiment of the present invention;
Fig. 5 is the schematic diagram of burst handle data structures embodiment of the present invention;
Fig. 6 is the establishment of the single message chain of the present invention node and the schematic diagram of information updating embodiment one;
Fig. 7 is the establishment of the single message chain of the present invention node and the schematic diagram of information updating embodiment two;
Fig. 8 is the establishment of the single message chain of the present invention node and the schematic diagram of information updating embodiment three;
Fig. 9 is the establishment of the single message chain of the present invention node and the schematic diagram of information updating embodiment four;
Figure 10 is the flow chart of data fragmentation processing method embodiment two of the present invention;
Figure 11 is the structural representation of data fragmentation processing unit embodiment of the present invention.
Embodiment
Embodiment of the invention data fragmentation processing method comprises:
The data fragmentation that buffer memory receives, and generate single message chain node, wherein single message chain nodal information comprises head node sequence number, tail node sequence number, anticipatory data burst number and the current data fragmentation number of receiving, and above-mentioned head node sequence number is less than above-mentioned tail node sequence number;
It is complete and correct to judge by single message chain nodal information whether the data fragmentation of same message receives, if reception is complete and correct, then carries out the message reorganization; If reception is imperfect, then continue receiving data packets; Otherwise, abandon described data message.
As shown in Figure 1, be the flow chart of data fragmentation processing method embodiment one of the present invention, this method comprises:
The data fragmentation that step 101, buffer memory receive, and generate single message chain node;
The data fragmentation that adopts metadata cache structure buffer memory to receive, above-mentioned data fragmentation can be divided into a burst, middle burst and tail burst; Wherein, above-mentioned metadata cache structure comprises information such as node ID, as shown in Figure 2, is the schematic diagram of metadata cache structure embodiment of the present invention; Also comprise after the data fragmentation that buffer memory receives: the sequence number according to above-mentioned data fragmentation judges whether into data fragmentation under the corresponding message of current single message chain node, if upgrade current single message chain nodal information; Otherwise, generate single message chain node; Wherein, with the node ID is that benchmark adopts dichotomy to insert the data fragmentation that receives, generate single message chain node, as shown in Figure 3, schematic diagram for the single message chain of the present invention node structure embodiment, wherein single message chain nodal information comprises head node sequence number, tail node sequence number, anticipatory data burst number and the current data fragmentation number of receiving, above-mentioned head node sequence number is less than above-mentioned tail node sequence number, and the single message chain node in the present embodiment has following characteristics:
A: have and can only comprise a slice header information, suppose that its SEQ value is m;
B: have it can only comprise a branch run-out information, suppose that its SEQ value is n;
C: all other bursts are middle burst, and burst SEQ value x must satisfy: m＜x＜n;
D: any one fragment message all must and only can belong to a single message chain node, and Rule of judgment is: whether satisfy the C condition.
The insertion point locate mode that is articulated to buffer chain in fragment message storage is based on that the dichotomy mode of optimization locatees rapidly, more than one receive that the burst insertion point promptly recently inserts first judging point of node as dichotomy, follow-uply be greater than or less than insertion point SEQ value according to SEQ, at insertion point and message last-of-chain or insertion point and message begin chain, determine to insert judging point with dichotomy, recursion one by one, up to final definite insertion point, as shown in Figure 4, be the schematic diagram of message buffering chain structure embodiment of the present invention;
In addition, carry out the establishment and the information updating of single message chain node, divide three kinds of situations to be introduced below at the dissimilar utilizations burst handle data structures as shown in Figure 5 of data message:
(1) when data fragmentation is burst:
As shown in Figure 6, be the establishment of the single message chain of the present invention node and the schematic diagram of information updating embodiment one, as shown in the drawing, receive a fragment message, trigger to generate a single message chain node, and upgrade single message chain nodal information such as head node SEQ, current burst number and the current burst SEQ summation of receiving received;
As shown in Figure 7, be the establishment of the single message chain of the present invention node and the schematic diagram of information updating embodiment two, as shown in the drawing, receive a fragment message, the insertion point is 2, triggering is divided (from the beginning 2 places, fragment message insertion point) to single message chain node of current correspondence, generates a new single message chain node, and upgrades former and later two single message chain nodal informations such as head node SEQ, current burst number and the current burst SEQ summation of receiving received as shown in the figure respectively;
(2) when data fragmentation is middle burst:
As shown in Figure 8, be the establishment of the single message chain of the present invention node and the schematic diagram of information updating embodiment three, as shown in the drawing, under the situation of receiving two bursts (SEQ8, SEQ11), burst (SEQ10) in the middle of receiving, upgrade nodal information, the burst number adds one, and the current burst SEQ summation of receiving is 29;
(3) when data fragmentation is the tail burst:
As shown in Figure 9, be the establishment of the single message chain of the present invention node and the schematic diagram of information updating embodiment four, as shown in the drawing, receive the tail fragment message, the insertion point is 2, triggering generates a single message chain node after the insertion point, and upgrades single message chain nodal information such as head node SEQ, current burst number and the current burst SEQ summation of receiving received;
Judge by judging in single message chain node that anticipatory data burst number and the current data fragmentation number summation of receiving be whether identical whether the data fragmentation of same message receives complete, if it is identical, then the data fragmentation of same message receives complete, otherwise the data fragmentation of same message receives imperfect;
When data fragmentation receives when complete, need judge whether the current data fragmentation sequence number summation of receiving equals sequence number arithmetic progression sum; Wherein, above-mentioned sequence number arithmetic progression first term is the head node sequence number, and last item is the tail node sequence number, and item number is an anticipatory data burst number;
When data fragmentation receives when imperfect, continue receiving data packets;
When data fragmentation receives complete and the current data fragmentation sequence number summation of receiving when equaling sequence number arithmetic progression sum, carry out the message reorganization;
In addition, the data fragmentation that above-mentioned data processing method is not limited in the router technology is handled, in a lot of network equipments, all has burst processing in the procotol as multi-link protocol (MIP) agreement, for example IP fragmentation, ATM(Asynchronous Transfer Mode) cell cutting reorganization etc. all can adopt this method to handle.
Whether above-mentioned data fragmentation processing method receives completely by single message chain nodal information judgment data burst, and then trigger the operation of reconstructed file burst, has reduced the overhead that the burst reorganization is judged preferably, has promoted the judging efficiency of fragment message; Simultaneously,, parallelly adjust and upgrade single message chain statistical information, improved the efficient of analysis and judgment data burst preferably by the dichotomy of adopt optimizing; Thereby improved systematic function.
As shown in figure 10, be the flow chart of data fragmentation processing method embodiment two of the present invention, this method comprises:
Use the minimum message of SEQ to judge overtime method, when promptly the minimum message of SEQ is overtime, judge that just follow-up SEQ message timeout interval also starts regularly;
If overtime, then directly carry out message and discharge processing, up to finding follow-up also not overtime fragment message to carry out the timing timeout treatment; Also promptly abandon the node ID of this data fragmentation and current cache all data fragmentations, and start the overtime timing of message of node ID minimum in the current buffering area less than this data fragmentation node ID.Said method makes all messages only need start an overtime timer; If corresponding device is received first fragment message, then start the overtime timer of fragment message; When overtime timer is overtime, judge SEQ number of fragment message of this timer correspondence, do overtime release less than all fragment messages of this SEQ number and handle (according to consensus standard: the fragment message SEQ of every message from small to large, and continuously); According to buffering message chain, start the minimum overtime timing of message of SEQ value in the current buffering area then; Basic principle, in any moment, system has only an overtime timer to start;
When the time of the message of cache node sequence number minimum surpasses setting threshold, carry out subsequent treatment, because subsequent operation is not the emphasis of this part, do not describe in detail at this.
Present embodiment two is to realize on the basis of the foregoing description one, and present embodiment two combines with the foregoing description one, becomes a preferred embodiment of the present invention.
Above-mentioned data fragmentation processing method can reduce the processing complexity of timer greatly based on minimum SEQ burst timeout treatment mechanism, thereby improve systematic function.
As shown in figure 11, structural representation for data fragmentation processing unit embodiment of the present invention, this device comprises: buffer unit 1, be used for the data fragmentation that buffer memory receives, and generate single message chain node, wherein single message chain nodal information comprises head node sequence number, tail node sequence number, anticipatory data burst number and the current data fragmentation number of receiving, and described head node sequence number is less than described tail node sequence number; Processing unit 3, it is complete and correct to be used for judging by single message chain nodal information whether the data fragmentation of same message receives, if reception is complete and correct, then carries out the message reorganization; If reception is imperfect, then continue receiving data packets; Otherwise, abandon described data message.
In addition, said apparatus can also comprise: determining unit 2, the time that is used for the node ID minimal data burst of buffer memory when timer starts is when surpassing setting threshold, abandon the node ID of described data fragmentation and current cache all data fragmentations, and restart timer less than described data fragmentation node ID.
Further, above-mentioned buffer unit can comprise: cache module, be used to adopt the data fragmentation of metadata cache structure buffer memory reception, concrete grammar can for: the insertion point of an above data burst is first judging point, when the data fragmentation node ID that receives during greater than the insertion point sequence number, determine the insertion point in insertion point and message last-of-chain with dichotomy, when the data fragmentation node ID that receives during less than the insertion point sequence number, determine the insertion point in insertion point and message begin chain with dichotomy, and the like, until definite insertion point, and insert the data fragmentation of reception in this insertion point.Wherein, above-mentioned metadata cache structure comprises node ID.Generation module is used to generate single message chain node.Above-mentioned processing unit also can comprise: first judge module, be used for by judging whether anticipatory data burst number is identical with the current data fragmentation number of receiving, if identical, then the data fragmentation of same message receives complete, otherwise the data fragmentation of same message receives imperfect; Second judge module is used for whether equaling sequence number arithmetic progression sum by the node ID summation of judging the current data fragmentation of receiving, if equal, then the data fragmentation of same message receives correct; Otherwise it is incorrect that the data fragmentation of same message receives.
Above-mentioned data fragmentation processing unit carries out operations such as reconstructed file burst by processing unit, reduced the overhead that the burst reorganization is judged preferably, has promoted the judging efficiency of fragment message; Simultaneously, the dichotomy of above-mentioned generation module by adopt optimizing parallelly adjusted and upgraded single message chain statistical information, improved the efficient of analysis and judgment data burst preferably; In addition, above-mentioned judging unit can reduce the processing complexity of timer greatly based on minimum SEQ burst timeout treatment mechanism, simplifies the burst processing thereby reach, and promotes the burst treatment effeciency; Thereby improved systematic function.
It should be noted that at last: above embodiment only in order to technical scheme of the present invention to be described, is not intended to limit; Although with reference to previous embodiment the present invention is had been described in detail, those of ordinary skill in the art is to be understood that: it still can be made amendment to the technical scheme that aforementioned each embodiment put down in writing, and perhaps part technical characterictic wherein is equal to replacement; And these modifications or replacement do not make the essence of appropriate technical solution break away from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (10)
1, a kind of data fragmentation processing method is characterized in that comprising:
The data fragmentation that buffer memory receives, and generate single message chain node, wherein single message chain nodal information comprises head node sequence number, tail node sequence number, anticipatory data burst number and the current data fragmentation number of receiving, and described head node sequence number is less than described tail node sequence number;
It is complete and correct to judge by single message chain nodal information whether the data fragmentation of same message receives, if reception is complete and correct, then carries out the message reorganization; If reception is imperfect, then continue receiving data packets; Otherwise, abandon described data message.
2, data fragmentation processing method according to claim 1 is characterized in that the data fragmentation that described buffer memory receives also comprises afterwards:
Sequence number according to described data fragmentation judges whether into data fragmentation under the corresponding message of current single message chain node, if upgrade current single message chain nodal information; Otherwise, generate single message chain node.
3, data fragmentation processing method according to claim 1 and 2 is characterized in that the data fragmentation that described buffer memory receives comprises:
The data fragmentation that adopts metadata cache structure buffer memory to receive, more than the insertion point of a data burst be first judging point, when the data fragmentation node ID that receives during greater than the insertion point sequence number, determine the insertion point in insertion point and message last-of-chain with dichotomy, when the data fragmentation node ID that receives during less than the insertion point sequence number, determine the insertion point in insertion point and message begin chain with dichotomy, and the like, until definite insertion point, and insert the data fragmentation of reception in this insertion point.
4, data fragmentation processing method according to claim 3 is characterized in that describedly judging by single message chain nodal information whether the data fragmentation of same message receives complete comprising:
By judging whether anticipatory data burst number is identical with the current data fragmentation number of receiving, if identical, then the reception of the data fragmentation of same message is complete, otherwise the reception of the data fragmentation of same message is imperfect.
5, data fragmentation processing method according to claim 3 is characterized in that describedly judging by single message chain nodal information whether the data fragmentation of same message receives correctly and comprising:
Whether equal sequence number arithmetic progression sum by the node ID summation of judging the current data fragmentation of receiving, if equal, then the data fragmentation of same message receives correct; Otherwise the data fragmentation of same message receives incorrect; Wherein, described sequence number arithmetic progression first term is the head node sequence number, and last item is the tail node sequence number, and item number is an anticipatory data burst number.
6, data fragmentation processing method according to claim 1 is characterized in that also comprising:
When the time of the node ID minimal data burst of buffer memory surpasses setting threshold when timer starts, abandon the node ID of described data fragmentation and current cache all data fragmentations, and restart timer less than described data fragmentation node ID.
7, a kind of data fragmentation processing unit is characterized in that comprising:
Buffer unit, be used for the data fragmentation that buffer memory receives, and generating single message chain node, wherein single message chain nodal information comprises head node sequence number, tail node sequence number, anticipatory data burst number and the current data fragmentation number of receiving, and described head node sequence number is less than described tail node sequence number;
Processing unit, it is complete and correct to be used for judging by single message chain nodal information whether the data fragmentation of same message receives, if reception is complete and correct, then carries out the message reorganization; If reception is imperfect, then continue receiving data packets; Otherwise, abandon described data message.
8, data fragmentation processing unit according to claim 7 is characterized in that described buffer unit comprises:
Cache module, be used to adopt the data fragmentation of metadata cache structure buffer memory reception, more than the insertion point of a data burst be first judging point, when the data fragmentation node ID that receives during, determine the insertion point in insertion point and message last-of-chain with dichotomy, when the data fragmentation node ID that receives during less than the insertion point sequence number greater than the insertion point sequence number, determine the insertion point in insertion point and message begin chain with dichotomy, and the like, until definite insertion point, and insert the data fragmentation of reception in this insertion point;
Generation module is used to generate single message chain node.
9, according to claim 7 or 8 described data fragmentation processing unit, it is characterized in that described processing unit comprises:
First judge module is used for by judging whether anticipatory data burst number is identical with the current data fragmentation of receiving, if identical, then the reception of the data fragmentation of same message is complete, otherwise the reception of the data fragmentation of same message is imperfect;
Second judge module is used for whether equaling sequence number arithmetic progression sum by the node ID summation of judging the current data fragmentation of receiving, if equal, then the data fragmentation of same message receives correct; Otherwise it is incorrect that the data fragmentation of same message receives; Wherein, described sequence number arithmetic progression first term is the head node sequence number, and last item is the tail node sequence number, and item number is an anticipatory data burst number.
10, data fragmentation processing unit according to claim 9 is characterized in that also comprising:
Determining unit, the time that is used for the node ID minimal data burst of buffer memory when timer starts is when surpassing setting threshold, abandon the node ID of described data fragmentation and current cache all data fragmentations, and restart timer less than described data fragmentation node ID.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101123037A CN101286945B (en) | 2008-05-22 | 2008-05-22 | Method and apparatus for processing of data fragmentation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101123037A CN101286945B (en) | 2008-05-22 | 2008-05-22 | Method and apparatus for processing of data fragmentation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101286945A true CN101286945A (en) | 2008-10-15 |
| CN101286945B CN101286945B (en) | 2011-06-22 |
Family
ID=40058923
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008101123037A Expired - Fee Related CN101286945B (en) | 2008-05-22 | 2008-05-22 | Method and apparatus for processing of data fragmentation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101286945B (en) |
Cited By (24)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010075795A1 (en) * | 2008-12-31 | 2010-07-08 | 华为技术有限公司 | Method and device for fragment information processing |
| CN101932006A (en) * | 2009-06-19 | 2010-12-29 | 中兴通讯股份有限公司 | Method for sending, receiving and transmitting data packets and device therefor |
| CN102104544A (en) * | 2011-01-25 | 2011-06-22 | 无锡网芯科技有限公司 | Order preserving method for fragmented message flow in IP (Internet Protocol) tunnel of multi-nuclear processor with accelerated hardware |
| CN101656639B (en) * | 2009-08-27 | 2012-01-04 | 华为技术有限公司 | Empty identifying method, device and receiving equipment for MLPPP link |
| CN102404340A (en) * | 2011-12-16 | 2012-04-04 | 山东中创软件商用中间件股份有限公司 | Tcp (Terminal Control Protocol) recombination method and device |
| CN102571572A (en) * | 2011-12-28 | 2012-07-11 | 中国人民解放军国防科学技术大学 | Short message satellite communication-based data transmission method and device |
| CN103346935A (en) * | 2013-07-26 | 2013-10-09 | 迈普通信技术股份有限公司 | Segment message regrouping test method, device and system |
| CN103618678A (en) * | 2013-11-18 | 2014-03-05 | 北京星网锐捷网络技术有限公司 | Method, device and system for self-adaptation multiple-link aggregation |
| CN103945013A (en) * | 2013-01-17 | 2014-07-23 | 方正宽带网络服务股份有限公司 | Data transmission interface device and data transmission method |
| CN103944880A (en) * | 2014-03-13 | 2014-07-23 | 湖南强军科技有限公司 | ZigBee data transmission method |
| CN104125301A (en) * | 2014-08-12 | 2014-10-29 | 广州消息树网络科技有限公司 | Multi-line data transmission method |
| CN104639511A (en) * | 2013-11-13 | 2015-05-20 | 安凯(广州)微电子技术有限公司 | Method and device for saving internal memory |
| CN105376165A (en) * | 2015-10-15 | 2016-03-02 | 深圳市金证科技股份有限公司 | UDP multicast method, system, sending device, and receiving device |
| CN106331117A (en) * | 2016-08-26 | 2017-01-11 | 中国科学技术大学 | Data transmission method |
| CN106850143A (en) * | 2013-11-04 | 2017-06-13 | 上海数字电视国家工程研究中心有限公司 | The method for packing and method of calibration of packet |
| CN107169009A (en) * | 2017-03-31 | 2017-09-15 | 北京奇艺世纪科技有限公司 | A kind of data splitting method and device of distributed memory system |
| CN108075820A (en) * | 2016-11-18 | 2018-05-25 | 杭州优能通信系统有限公司 | A kind of method for improving broadcasting-satellite channel fragment data transmission reliability |
| CN108668320A (en) * | 2017-03-31 | 2018-10-16 | 维沃移动通信有限公司 | A kind of segmentation group packet method and receiving terminal |
| CN109039551A (en) * | 2018-08-22 | 2018-12-18 | 苏州凌犀物联网技术有限公司 | A kind of Lora message reassembly abnormality eliminating method, transmitting terminal and receiving end |
| CN109474547A (en) * | 2019-01-11 | 2019-03-15 | 广东省气象公共服务中心(广东气象影视宣传中心) | Boat-carrying gateway communication system, boat-carrying gateway communication method and electronic equipment |
| CN109889779A (en) * | 2019-01-31 | 2019-06-14 | 视联动力信息技术股份有限公司 | A kind for the treatment of method and apparatus of packet out-ordering |
| CN113259715A (en) * | 2021-05-07 | 2021-08-13 | 广州小鹏汽车科技有限公司 | Method and device for processing multi-channel video data, electronic equipment and medium |
| CN114069826A (en) * | 2021-10-30 | 2022-02-18 | 国网湖南省电力有限公司 | Method, system and medium for checking 5G communication security of spare power automatic switching device |
| CN116886652A (en) * | 2023-09-06 | 2023-10-13 | 深圳华云信息系统科技股份有限公司 | Method and device for reorganizing IP message fragments, electronic equipment and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101039170B (en) * | 2006-03-15 | 2011-08-03 | 华为技术有限公司 | Method for supporting packet retransmission division cascade |
-
2008
- 2008-05-22 CN CN2008101123037A patent/CN101286945B/en not_active Expired - Fee Related
Cited By (33)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010075795A1 (en) * | 2008-12-31 | 2010-07-08 | 华为技术有限公司 | Method and device for fragment information processing |
| CN101932006A (en) * | 2009-06-19 | 2010-12-29 | 中兴通讯股份有限公司 | Method for sending, receiving and transmitting data packets and device therefor |
| CN101656639B (en) * | 2009-08-27 | 2012-01-04 | 华为技术有限公司 | Empty identifying method, device and receiving equipment for MLPPP link |
| CN102104544A (en) * | 2011-01-25 | 2011-06-22 | 无锡网芯科技有限公司 | Order preserving method for fragmented message flow in IP (Internet Protocol) tunnel of multi-nuclear processor with accelerated hardware |
| CN102104544B (en) * | 2011-01-25 | 2012-06-20 | 无锡网芯科技有限公司 | Order preserving method for fragmented message flow in IP (Internet Protocol) tunnel of multi-nuclear processor with accelerated hardware |
| CN102404340B (en) * | 2011-12-16 | 2014-08-20 | 山东中创软件商用中间件股份有限公司 | Tcp (Terminal Control Protocol) recombination method and device |
| CN102404340A (en) * | 2011-12-16 | 2012-04-04 | 山东中创软件商用中间件股份有限公司 | Tcp (Terminal Control Protocol) recombination method and device |
| CN102571572A (en) * | 2011-12-28 | 2012-07-11 | 中国人民解放军国防科学技术大学 | Short message satellite communication-based data transmission method and device |
| CN103945013A (en) * | 2013-01-17 | 2014-07-23 | 方正宽带网络服务股份有限公司 | Data transmission interface device and data transmission method |
| CN103346935A (en) * | 2013-07-26 | 2013-10-09 | 迈普通信技术股份有限公司 | Segment message regrouping test method, device and system |
| CN103346935B (en) * | 2013-07-26 | 2016-03-16 | 迈普通信技术股份有限公司 | Method, the equipment and system of fragment message restructuring test |
| CN106850143A (en) * | 2013-11-04 | 2017-06-13 | 上海数字电视国家工程研究中心有限公司 | The method for packing and method of calibration of packet |
| CN104639511B (en) * | 2013-11-13 | 2018-08-03 | 安凯(广州)微电子技术有限公司 | A kind of implementation method and device for saving memory |
| CN104639511A (en) * | 2013-11-13 | 2015-05-20 | 安凯(广州)微电子技术有限公司 | Method and device for saving internal memory |
| CN103618678A (en) * | 2013-11-18 | 2014-03-05 | 北京星网锐捷网络技术有限公司 | Method, device and system for self-adaptation multiple-link aggregation |
| CN103944880A (en) * | 2014-03-13 | 2014-07-23 | 湖南强军科技有限公司 | ZigBee data transmission method |
| CN103944880B (en) * | 2014-03-13 | 2017-11-14 | 湖南强军科技有限公司 | A kind of method of ZigBee data transfers |
| CN104125301A (en) * | 2014-08-12 | 2014-10-29 | 广州消息树网络科技有限公司 | Multi-line data transmission method |
| CN105376165A (en) * | 2015-10-15 | 2016-03-02 | 深圳市金证科技股份有限公司 | UDP multicast method, system, sending device, and receiving device |
| CN106331117A (en) * | 2016-08-26 | 2017-01-11 | 中国科学技术大学 | Data transmission method |
| CN106331117B (en) * | 2016-08-26 | 2019-05-03 | 中国科学技术大学 | A kind of data transmission method |
| CN108075820A (en) * | 2016-11-18 | 2018-05-25 | 杭州优能通信系统有限公司 | A kind of method for improving broadcasting-satellite channel fragment data transmission reliability |
| CN107169009B (en) * | 2017-03-31 | 2020-03-27 | 北京奇艺世纪科技有限公司 | Data splitting method and device of distributed storage system |
| CN107169009A (en) * | 2017-03-31 | 2017-09-15 | 北京奇艺世纪科技有限公司 | A kind of data splitting method and device of distributed memory system |
| CN108668320A (en) * | 2017-03-31 | 2018-10-16 | 维沃移动通信有限公司 | A kind of segmentation group packet method and receiving terminal |
| CN109039551A (en) * | 2018-08-22 | 2018-12-18 | 苏州凌犀物联网技术有限公司 | A kind of Lora message reassembly abnormality eliminating method, transmitting terminal and receiving end |
| CN109474547A (en) * | 2019-01-11 | 2019-03-15 | 广东省气象公共服务中心(广东气象影视宣传中心) | Boat-carrying gateway communication system, boat-carrying gateway communication method and electronic equipment |
| CN109889779A (en) * | 2019-01-31 | 2019-06-14 | 视联动力信息技术股份有限公司 | A kind for the treatment of method and apparatus of packet out-ordering |
| CN109889779B (en) * | 2019-01-31 | 2021-04-23 | 视联动力信息技术股份有限公司 | Message out-of-order processing method and device |
| CN113259715A (en) * | 2021-05-07 | 2021-08-13 | 广州小鹏汽车科技有限公司 | Method and device for processing multi-channel video data, electronic equipment and medium |
| CN114069826A (en) * | 2021-10-30 | 2022-02-18 | 国网湖南省电力有限公司 | Method, system and medium for checking 5G communication security of spare power automatic switching device |
| CN116886652A (en) * | 2023-09-06 | 2023-10-13 | 深圳华云信息系统科技股份有限公司 | Method and device for reorganizing IP message fragments, electronic equipment and storage medium |
| CN116886652B (en) * | 2023-09-06 | 2023-11-07 | 深圳华云信息系统科技股份有限公司 | Method and device for reorganizing IP message fragments, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101286945B (en) | 2011-06-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101286945B (en) | Method and apparatus for processing of data fragmentation | |
| US6401136B1 (en) | Methods, systems and computer program products for synchronization of queue-to-queue communications | |
| CN101917472B (en) | Method, device and equipment for recombining multi-link messages | |
| CA2674655C (en) | Improved data transfer method, system and protocol | |
| CN101369877B (en) | Wireless transmission control protocol processing method and equipment | |
| CN103618678A (en) | Method, device and system for self-adaptation multiple-link aggregation | |
| CN101212401B (en) | Grid-oriented configurable data transmission method and system | |
| CN101867573A (en) | Data sending method, device and communication system | |
| US9356989B2 (en) | Learning values of transmission control protocol (TCP) options | |
| Hu et al. | TLB: Traffic-aware load balancing with adaptive granularity in data center networks | |
| CN114185582A (en) | Automobile software online upgrading system and method based on QUIC protocol | |
| CN114745273B (en) | TCP acceleration proxy method, device, satellite ground station and readable storage medium | |
| CN100479426C (en) | Method for sequential recombination of PPP multi-link protocol message | |
| CN102231711B (en) | Route control method for dynamically regulating congestion level of nodes based on Wiener prediction | |
| CN102487330B (en) | Method and device for sending operation, administration and maintenance messages | |
| CN108347788A (en) | The data concurrency transmission method of propagation delay is utilized based on Slotted-FAMA agreements | |
| CN113612698A (en) | Data packet sending method and device | |
| CN103595552B (en) | Analysis method and analysis system for cluster storage network parallel load | |
| US20020071430A1 (en) | Keyed authentication rollover for routers | |
| CN115442000A (en) | Transmission guarantee method suitable for low-bandwidth and easily-consumed ad hoc network | |
| CN101459613B (en) | Method and device for transmitting route updating packet | |
| Fang et al. | Design and implementation of embedded rudp | |
| CN101296173B (en) | Network packet conveying method | |
| CN100581114C (en) | Method and system for data collection from network nodes in telecommunication network | |
| EP4170980A1 (en) | Communication method and related apparatus |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20110622 Termination date: 20140522 |