CN1937631B - User datagram protocol message processing method and device - Google Patents

User datagram protocol message processing method and device Download PDF

Info

Publication number
CN1937631B
CN1937631B CN 200610150597 CN200610150597A CN1937631B CN 1937631 B CN1937631 B CN 1937631B CN 200610150597 CN200610150597 CN 200610150597 CN 200610150597 A CN200610150597 A CN 200610150597A CN 1937631 B CN1937631 B CN 1937631B
Authority
CN
Grant status
Grant
Patent type
Prior art keywords
gt
lt
mo
mi
mtd
Prior art date
Application number
CN 200610150597
Other languages
Chinese (zh)
Other versions
CN1937631A (en )
Inventor
李玉天
赵钢
Original Assignee
杭州华三通信技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Grant date

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056Systems characterized by the type of code used
    • H04L1/0061Error detection codes
    • HELECTRICITY
    • H03BASIC ELECTRONIC CIRCUITRY
    • H03MCODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0072Error control for data other than payload data, e.g. control data

Abstract

The invention discloses a user datagram protocol message processing method, comprising: adding redundancy check block and check identification code in a to-be-sent message; and after determining the current message is lost, a receiving end correct errors according to data part and/or redundancy check block of a message related with the lost message and recovers the data part of the lost message. In addition, it discloses a user datagram protocol message packing and unpacking method and transmitting and receiving device. And it improves message data transmission reliability, thus improving audio-video quality.

Description

用户数据报协议报文的处理方法及装置 Method and apparatus for processing user datagram protocol packets

技术领域 FIELD

[0001] 本发明涉及网络报文传输技术领域,尤其指一种用户数据报协议报文的处理方法 [0001] The present invention relates to a method for processing a network packet transmission technology field, particularly to a User Datagram Protocol packets

及装置。 And devices.

背景技术 Background technique

[0002] 作为TCP/IP (Transmission Control Protocol/Internet Protocol,传输控制协议/互联网协议)网络传输层协议族中的一员,UDP (User Datagram Protocol,用户数据报协议)主要用于支持那些需要在计算机之间传输数据的网络应用。 [0002] As TCP / IP (Transmission Control Protocol / Internet Protocol, Transmission Control Protocol / Internet Protocol) network transport layer protocol family of one, UDP (User Datagram Protocol, User Datagram Protocol) is mainly used to support those in need transmitting data between the network computer application. 与TCP不同,UDP协议并不提供数据传送的保证机制,如果从发送端到接收端的传输过程中出现报文的丢失,协议本身并不能做出任何检测或提示。 Unlike TCP, UDP protocol does not provide a guarantee mechanism for data transfer, if the loss occurs during transmission from the sender to the receiver of the packet, the protocol itself does not make any detection or prompt.

[0003] 由于UDP排除了信息可靠传递机制,将安全和排序等功能移交给上层应用来完成,极大降低了执行时间,使速度得到提高。 [0003] Because UDP eliminates the reliable information delivery mechanism, the transfer of security and sorting functions to the upper application to complete, greatly reducing execution time, so speed is improved. 因此在通过网络传输音视频数据流时,为了保证通讯的实时性,通常采用UDP封装数据。 Therefore, when audio and video data transmitted over the network streams, in order to guarantee real-time communication, usually UDP encapsulation data. 由此也带来了负面效应,即牺牲了一定的可靠性。 This also had a negative effect, that the expense of some reliability.

[0004] 图1为网络传输中数据丢包及乱序示意图。 [0004] FIG. 1 is a network transmission and packet loss disorder FIG. 如图所示,当音视频数据流通过网络传输时出现UDP丢包、乱序时,接收端将在等待一定时间后,若还未收到数据包,则作为报文丢失处理。 As shown, when the UDP packet loss occurs stream audio and video data transmitted through the network, out of order, the receiving end after a certain waiting time, if not yet received data packet, a packet loss process. 由此往往造成音频流的断续、模糊,视频流的失真、不清晰甚至马赛克,影响了所传输音频和视频的质量。 Thus often resulting in intermittent audio stream, blur, distortion of the video stream, not clear even mosaics, affecting the quality of the audio and video.

发明内容 SUMMARY

[0005] 本发明的目的是提供一种用户数据报协议报文的处理方法及装置,以解决现有技术中网络丢包、乱序对用户数据报协议音视频流质量造成影响的问题。 [0005] The object of the present invention is to provide a processing method and apparatus of a User Datagram Protocol packets to the network packet loss to solve the prior art problems disorder affecting the quality of audio and video streams a user datagram protocol.

[0006] 为达到上述目的,本发明提出一种用户数据报协议报文的处理方法,包括: [0006] To achieve the above object, the present invention provides a method for processing a user datagram protocol packets, comprising:

[0007] A、在待发送的报文中添加冗余校验块,所述冗余校验块存储所述待发送报文之前多个报文的数据部分的冗余运算的结果;步骤A具体包括: [0007] A, is added in the message to be sent redundancy check block, said redundant memory block check result to be the redundant data portion of the plurality of operation before sending the message packet; Step A including:

[0008] 在待发送的报文中,将报文的数据部分分为η个等长的数据块,同时根据预设的长度或报文的剩余可用长度添加冗余校验块,使所述冗余校验块与所述数据块的长度相等,并存储所述待发送报文之前η个报文中对应数据块的冗余运算的结果;所述冗余运算包括: [0008] In the packet to be sent, the packet data portion is divided into η equal length blocks of data, while adding redundancy check block according to a preset length or the remaining usable length of the packet, the CRC block length equal to the data block, and storing the message to be sent to redundancy calculation η th packet before a corresponding data block; the redundancy operation comprises:

[0009] 利用当前报文及之前η个报文的数据块及冗余校验块构造如下矩阵: [0009] Before using the current packet and a packet η data blocks and redundancy blocks check matrix is ​​constructed as follows:

Al, I Al, I · An, I An+ 1,1 Al, 2 Al, 2 · · Al, I Al, I · An, I An + 1,1 Al, 2 Al, 2 · ·

[0010] [0010]

[0012] 运用异或算法获取结果: [0012] using XOR algorithm to obtain the result:

[0014] B、接收端判断当前报文发生丢失后,根据与丢失报文相关联的多个报文的数据部分和/或冗余校验块进行纠错运算,恢复丢失报文的数据部分;步骤B具体包括: [0014] B, the receiving end determines after the current packet is lost, error correction operation performed in accordance with the data portion of the plurality of packets associated with the packet loss and / or parity redundancy block, the data portion to restore lost packets ; step B comprises:

[0015] 判断当前报文发生丢失后,根据丢失报文之前η-1个和之后η个报文的冗余校验块及对应数据块进行纠错运算,恢复丢失报文的数据部分;所述纠错运算包括: [0015] η is determined after the occurrence of a packet loss, η-1 and before losing a packet according to a packet block and the corresponding redundancy check data block error correction operation, to recover the data portion of the packet loss; the said error correction operation comprising:

[0016] 利用所述丢失报文及之前η-1个和之后η个报文的数据块及冗余校验块构造如下矩阵: [0016] The use of packet loss and η-1 before and after an [eta] of a packet data block and a block redundancy check matrix is ​​constructed as follows:

[0017] [0017]

[0018] 其中,Bi,j,i = 1、2、· ·2η,」= 1、2、· · η+1,为第i个报文的第j个块,每个报文的最后一个块为冗余校验块,且如果By为空,则By = 0 ; [0018] wherein, Bi, j, i = 1,2, · · 2η, "= 1,2, · · η + 1, the i-th packet in the j-th block, each of the last packet block is a block redundancy check, and if By is empty, then By = 0;

[0019] 运用异或算法获取结果: [0019] using XOR algorithm to obtain the result:

[0020] [0021] [0022] [0020] [0021] [0022]

[0023] [0023]

[0024] [0024]

Βη,ι = Bn+l,2㊉ Bn+2,3㊉· . Θβ2η,η+1 , Bn,2 = Βη.ι;ιθ Βη+ι^θ ..㊉B2n-I,η+1, Bnj3 = Bn-W Bn-U㊉· ·㊉B2n_2'n+1 , Βη, ι = Bn + l, 2㊉ Bn + 2,3㊉ · Θβ2η, η + 1, Bn, 2 = Βη.ι;. Ιθ Βη + ι ^ θ ..㊉B2n-I, η + 1, Bnj3 = Bn- W Bn-U㊉ · ㊉B2n_2'n + 1,

Bn,n = Βΐ5ΐΘ B2,2@ Bn, n = Βΐ5ΐΘ B2,2 @

ΦΒη+Ι,η+1 ΦΒη + Ι, η + 1

[0025] 步骤A之前还包括: Prior to step A [0025] further comprises:

[0026] 根据最大传输单元的长度限制,通过检测待发送报文的长度获取报文的剩余可用长度。 [0026] The maximum transmission unit length limitation, by detecting the length of the message to be transmitted acquires the remaining usable length of the packet.

[0027] 步骤A中还包括: [0027] Step A further comprises:

[0028] 在待发送的报文中添加校验识别码,用于识别所述冗余校验块,并对报文的原始序列进行标识。 [0028] Add to packets to be transmitted check identification code for identifying the redundancy check block, and the original packet sequence identifier.

[0029] 步骤B中所述用户数据报协议报文接收端根据所述校验识别码获取报文的原始序列信息,以判断当前报文是否发生丢失。 The [0029] Step B, User Datagram Protocol packet reception end identifier acquired in accordance with the check of the original packet sequence information to determine whether the current packet loss occurs.

[0030] 步骤A具体包括: [0030] Step A comprises:

[0031] 在待发送的报文中,根据预设的长度或报文的剩余可用长度添加m个冗余校验块,分别对之前m个报文的数据部分进行冗余备份;所述冗余校验块与所述数据部分的长 [0031] In the packet to be transmitted, adding the m blocks according to a predetermined redundancy check remaining available length, or packets, respectively, before the data portion of a packet to the m redundant; the redundant It long block and the parity data portion

度相等。 Equal degree.

[0032] 步骤B具体包括:[0033] 判断当前报文发生丢失后,根据丢失报文之后第i个报文的第i个冗余校验块,直接恢复丢失报文的数据部分;其中,i = 1、2、· · m。 [0032] Step B comprises: [0033] After determining the current packet loss occurs, after the packet loss according to the i-th packet in the i-th redundancy check block, the data part of the direct recovery of lost packets; wherein, i = 1,2, · · m.

[0034] 本发明还提出一种用户数据报协议报文的封装方法,包括: [0034] The present invention also provides a method of packaging a User Datagram Protocol packets, comprising:

[0035] 在待发送的报文中添加冗余校验块后封装并发送报文,所述冗余校验块存储所述待发送报文之前多个报文的数据部分的冗余运算结果; [0035] Add to packets to be sent after the CRC block encapsulating and transmitting packets, the CRC block storing the plurality of packets to be transmitted before the packet data portion of the redundant computation result ;

[0036] 所述封装方法具体包括: [0036] The packaging method comprises:

[0037] 在待发送的报文中,将报文的数据部分分为η个等长的数据块,同时根据预设的长度或报文的剩余可用长度添加冗余校验块,使所述冗余校验块与所述数据块的长度相等,并存储所述待发送报文之前η个报文中对应数据块的冗余运算的结果;所述冗余运算包括: [0037] In the packet to be sent, the packet data portion is divided into η equal length blocks of data, while adding redundancy check block according to a preset length or the remaining usable length of the packet, the CRC block length equal to the data block, and storing the message to be sent to redundancy calculation η th packet before a corresponding data block; the redundancy operation comprises:

[0038] 利用当前报文及之前η个报文的数据块及冗余校验块构造如下矩阵: [0038] Before using the current packet and a packet η data blocks and redundancy blocks check matrix is ​​constructed as follows:

所述封装方法之前还包括: Prior to the packaging method further comprises:

根据最大传输单元的长度限制,通过检测待发送报文的长度获取报文的剩余可用 The maximum transmission unit length limitation, by detecting the length of the message to be sent acquired remaining available packets

所述封装方法还包括: The packaging method further comprises:

在待发送的报文中添加校验识别码,用于识别所述冗余校验块,并对报文的原始序列进行标识。 Added packet to be transmitted check identification code for identifying the redundancy check block, and the original packet sequence identifier.

[0047] 所述封装方法具体包括: [0047] The packaging method comprises:

[0048] 在待发送的报文中,根据预设的长度或报文的剩余可用长度添加m个冗余校验块,分别对之前m个报文的数据部分进行冗余备份;所述冗余校验块与所述数据部分的长 [0048] In the packet to be transmitted, adding the m blocks according to a predetermined redundancy check remaining available length, or packets, respectively, before the data portion of a packet to the m redundant; the redundant It long block and the parity data portion

度相等。 Equal degree.

[0049] 本发明还提出一种用户数据报协议报文的解封装方法,包括: [0049] The present invention also provides a method for decapsulating User Datagram Protocol packets, comprising:

[0050] 报文接收端判断当前报文发生丢失后,根据与丢失报文相关联的多个报文的数据部分和/或冗余校验块进行纠错运算,恢复丢失报文的数据部分; After [0050] receiving end determines whether the current message packet is lost, error correction operation performed in accordance with the data portion of the plurality of packets associated with the packet loss and / or parity redundancy block, the data portion to restore lost packets ;

[0051 ] 所述解封装方法具体包括: [0051] The decapsulation method comprises:

[0052] 判断当前报文发生丢失后,根据丢失报文之前n-1个和之后η个报文的冗余校验块及对应数据块进行纠错运算,恢复丢失报文的数据部分;所述纠错运算包括: [0052] After determining the current message is lost, a [eta] of the packet block and the corresponding redundancy check data block before the packet loss according to the n-1 and the error correction operation after recovering data partially lost packets; the said error correction operation comprising:

[0053] 利用所述丢失报文及之前n-1个和之后η个报文的数据块及冗余校验块构造如下矩阵:[0054] [0053] The use of the n-1 and loss η after a block of data packets and redundancy packets before the check block is configured and the following matrix: [0054]

[0055] 其中,Biij,i = 1、2、· ·2η,」= 1、2、· · η+l,为第i个报文的第j个块,每个报 [0055] wherein, Biij, i = 1,2, · · 2η, "= 1,2, · · η + l, the i-th packet is the j-th block, each packet

文的最后一个块为冗余校验块,且如果Bi,为空,则Bi, ,· = 0; A text block is the last redundancy check block, and if Bi, is empty, Bi,, · = 0;

运用异或算法获取结果: Using XOR algorithm to obtain the result:

Bn,l = Bn+1,2㊉ Βη+2,3© . · ®B2n,n+l, Bn,2 = Βη.1;ΐθ Bn+1,3®> ..㊉B2n^lvfl , Bn,3 = Bn-W Bn_u㊉..㊉B2n_2,n+1, . Bn, l = Bn + 1,2㊉ Βη + 2,3 © · ®B2n, n + l, Bn, 2 = Βη.1; ΐθ Bn + 1,3®> ..㊉B2n ^ lvfl, Bn, 3 = Bn-W Bn_u㊉..㊉B2n_2, n + 1,

[0056] [0056]

[0057] [0057]

[0058] [0058]

[0059] [0059]

[0060] ...... [0060] ......

[0061] [0061]

[0062] 所述判断当前报文发生丢失具体包括: [0062] The determination of the current packet loss occurs comprises:

[0063] 报文接收端根据接收的报文中的校验识别码获取报文的原始序列信息,以判断当前报文是否发生丢失。 [0063] The packet receiving end packets received check the identification code to obtain the original packet sequence information in accordance with, to determine whether the current packet loss occurs.

[0064] 所述解封装方法具体包括: [0064] The decapsulation method comprises:

[0065] 判断当前报文发生丢失后,根据丢失报文之后第i个报文的第i个冗余校验块,直接恢复丢失报文的数据部分;其中i = 1、2 · ·πι,πι为报文中对之前报文数据块进行冗余备份的冗余校验块的数目。 [0065] After determining the current message is lost, according to the packet loss after the i-th packet CRC i-th block, the data part of the direct recovery of lost packets; wherein i = 1,2 · · πι, πι the number of packets before the packet data block redundancy check block of redundancy.

[0066] 本发明提出一种用户数据报协议报文的发送装置,包括报文发送模块,还包括报文封装模块; [0066] The present invention provides an apparatus for transmitting a user datagram protocol packets, including packet sending module, further comprising a packet encapsulation module;

[0067] 所述报文封装模块在报文中添加冗余校验块,并在封装完成后由所述报文发送模块向接收端发送报文;所述冗余校验块通过对所述待发送报文之前至少一个报文的数据部分进行冗余运算获得; [0067] The packet is encapsulated in the packet module adds redundancy check block, after the package is completed and the receiving end sends the packet to the packet transmitting module; the block by the redundancy check data to be transmitted before the message portion of the at least one packet of a redundant calculation is obtained;

[0068] 所述报文封装模块添加冗余校验块具体包括: [0068] The packet encapsulation module adds redundancy check block comprises:

[0069] 将报文的数据部分分为η个等长的数据块,同时根据预设的长度或报文的剩余可用长度添加冗余校验块,使所述冗余校验块与所述数据块的长度相等;对所述待发送报文之前η个报文的对应数据块进行冗余运算后将结果存储于所述冗余校验块;或 [0069] The data portion of the message is divided into η equal length blocks of data, while adding redundancy check block according to a preset length or the remaining usable length of the packet, the parity redundancy block and the equal to the length of the data block; [eta] data block corresponding to a packet to be transmitted prior to the redundant packet after the operation result stored in said CRC block; or

[0070] 在待发送的报文中,根据预设的长度或报文的剩余可用长度添加m个冗余校验块,所述冗余校验块与数据部分的长度相等;对所述待发送报文之前m个报文的数据部分分别进行冗余备份后将结果存储于所述冗余校验块; [0070] In the packet to be sent, CRC adding the m blocks according to a preset length or the remaining usable length of the packet, the parity redundancy block is equal to the length of the data portion; said to be the m packets will back up data portions are stored in the result of the redundancy block redundancy check before sending the message;

[0071] 所述对待发送报文之前η个报文的对应数据块进行冗余运算包括: [0071] The treated η corresponding to a packet data block before sending the message redundancy operation comprising:

[0072] 利用所述待发送报文及之前η个报文的数据块及冗余校验块构造如下矩阵: [0072] using the data blocks and parity redundancy block and the packet to be transmitted before a message η matrix is ​​constructed as follows:

[0074] 其中,Ai,」,i = 1、2、· ·η+1,]_ = 1、2、· · η+1,为第i个报文的第j个块,每个报文的最后一个块为冗余校验块,且如果Ay为空,则Ay = 0 ; [0074] wherein, Ai, ', i = 1,2, · · η + 1,] _ = 1,2, · · η + 1, the i-th packet in the j-th block, each packet the last block is block redundancy check, and if Ay is empty, Ay = 0;

[0075] 运用异或算法获取结果: [0075] using XOR algorithm to obtain the result:

[0076] An+1,n+1 = A1J㊉ A2,2@ . . θAn,η。 [0076] An + 1, n + 1 = A1J㊉ A2,2 @.. ΘAn, η.

[0077] 还包括报文长度检测模块; [0077] further includes a packet length detector module;

[0078] 所述报文长度检测模块对所述待发送的报文长度进行检测,并根据检测结果及最大传输单元的长度限制得到所述报文的剩余可用长度。 [0078] The packet length detector module packet length to be transmitted is detected, and to obtain the remaining usable length of the packet and the length of the detection result of the maximum transmission unit limit.

[0079] 所述报文封装模块进一步在待发送的报文中添加校验识别码,用于识别所述冗余校验块,并对报文的原始序列进行标识。 [0079] The packet encapsulation module is further added to the packet to be transmitted check identification code for identifying the redundancy check block, and the original packet sequence identifier.

[0080] 本发明还提出一种用户数据报协议报文的接收装置,包括报文接收模块,还包括报文序列检测模块及报文解析模块; [0080] The present invention also provides an apparatus for receiving a user datagram protocol packets, including packet receiving module further comprises a packet sequence detector module and the message parsing module;

[0081] 所述报文序列检测模块,用于对所述报文接收模块接收的报文进行序列检测,以判断报文是否发生丢失; [0081] The packet sequence detector module for detecting a sequence of packets received by the packet receiving module, to determine whether the packet is lost;

[0082] 所述报文解析模块,根据与丢失报文相关联的多个报文的数据部分和/或冗余校验块进行纠错运算,恢复丢失报文的数据部分; [0082] The packet parsing module, for error correction operation based on the data packets associated with the lost portion of the plurality of packets with packets and / or parity redundancy block to recover the data portion of the packet loss;

[0083] 所述报文解析模块进行纠错运算具体包括: [0083] The packet parsing module performs an error correction operation comprises:

[0084] 根据丢失报文之前η-1个和之后η个报文的冗余校验块及对应数据块进行纠错运算,恢复丢失报文的数据部分;或 [0084] η according to η-1 after a previous packet loss and a packet block and the corresponding redundancy check data block error correction operation, to recover the data portion of the packet loss; or

[0085] 根据丢失报文之后第i个报文的第i个冗余校验块,直接恢复丢失报文的数据部分;其中i = 1、2 · · m,m为报文中对之前报文数据块进行冗余备份的冗余校验块的数目; [0085] The packet loss after the i-th packet in the i-th redundancy check block, the data part of the direct recovery of lost packets; wherein i = 1,2 · · m, m is the message packets prior to text data blocks for the number of redundant backup redundancy check block;

[0086] 所述根据丢失报文之前η-1个和之后η个报文的冗余校验块及对应数据块进行纠错运算包括: [0086] According to the packet before the missing one η-1 and [eta] After a packet block and the corresponding redundancy check data block error correction operation comprising:

[0087] 利用所述丢失报文及之前η-1个和之后η个报文的数据块及冗余校验块构造如下 [0087] [eta] a use of the lost packets before and after the packet number and η-1 data blocks and redundancy check block is configured as follows

矩阵: matrix:

[0088] [0088]

[0089]其中,B [0089] wherein, B

,为第i个报文的第j个块,每个报 For the i-th packet in the j-th block, each packet

文的最后一个块为冗余校验块,且如果Bi,为空,则Bi, ,· = 0; A text block is the last redundancy check block, and if Bi, is empty, Bi,, · = 0;

[0090] 运用异或算法获取结果: [0090] using XOR algorithm to obtain the result:

[0091] BiU = Βη+1,2Θ Bn+2,3㊉·· [0091] BiU = Βη + 1,2Θ Bn + ·· 2,3㊉

[0092] Βη,2 = Bn_lsl㊉ Bn+1,3㊉· · 取·°2η·1,η+1, [0092] Βη, 2 = Bn + Bn_lsl㊉ taken 1,3㊉ · · ° 2η · 1, η + 1,

[0093] Bn,3 = :^幻㊉ B1^2㊉· · 吸D2n-2,n+l, [0093] Bn, 3 =: ^ B1 ^ 2㊉ phantom ㊉ · withdrawing D2n-2, n + l,

[0094] ...... [0094] ......

Β„,η = Β1;1Θ B2,2㊉·.㊉Bn+1,n+1 。 Β ", η = Β1; 1Θ B2,2㊉ .㊉Bn · + 1, n + 1.

[0096] 所述报文序列检测模块根据报文中的校验识别码获取报文的原始序列信息,以判断报文是否发生丢失。 [0096] The sequence detector module according to the packet sequence information of the original message check identification code acquired packet to determine whether the packet is lost.

[0097] 与现有技术相比,本发明具有以下优点: [0097] Compared with the prior art, the present invention has the following advantages:

[0098] 本发明在不增加网络传输报文数量的情况下,通过在每个用户数据报协议报文中添加一个冗余校验块,当网络传输出现丢包、乱序及误码时,可通过本发明的处理方法及装置恢复出丢失报文中的数据,提高了用户数据报协议报文的数据传输可靠性,从而提高了音视频质量,弥补了网络传输问题对用户数据报协议音视频质量的影响。 [0098] In the present invention, without increasing the number of packets of the network transmission packet by adding redundancy check block in each of a User Datagram Protocol packets, packet loss occurs when a network transmission, and error disorder, can be recovered by the processing method and apparatus according to the present invention, the loss of data packets, improves the reliability of data transmission user datagram protocol packets, thereby improving the quality of audio and video, to compensate for network transmission issues sound user datagram protocol affect the video quality.

附图说明 BRIEF DESCRIPTION

[0099] 图1为网络传输中数据丢包及乱序示意图; [0099] FIG. 1 is a network transmission and packet loss schematic disorder;

[0100] 图2为本发明用户数据报协议报文的处理方法流程图; [0100] FIG. 2 is a processing method of a User Datagram Protocol packets flowchart invention;

[0101] 图3为现有技术中的一种用户数据报协议报文格式; [0101] FIG. 3 is a prior art A user datagram protocol packet format;

[0102] 图4为本发明报文处理方法第一实施例中的用户数据报协议报文格式; Examples of User Datagram Protocol Packet Format [0102] FIG. 4 is a message packet processing method of a first embodiment of the invention;

[0103] 图5为本发明报文处理方法第二实施例中的用户数据报协议报文格式; [0103] FIG. 5 of the present invention as hereinbefore packet processing method of the second embodiment of the user datagram protocol packet format;

[0104] 图6为本发明报文处理方法第三实施例中的用户数据报协议报文格式; Examples of User Datagram Protocol Packet Format [0104] FIG. 6 is a message packet processing method of the third embodiment of the invention;

[0105] 图7为本发明用户数据报协议报文的封装方法流程图; [0105] FIG. 7 encapsulation method User Datagram Protocol packets flowchart of the present invention;

[0106] 图8为本发明用户数据报协议报文的解封装方法流程图; [0106] FIG. 8 is a method for decapsulating User Datagram Protocol packets flowchart invention;

[0107] 图9为本发明用户数据报协议报文的发送装置图; [0107] FIG 9 User Datagram Protocol transmitting apparatus of the present invention, packets;

[0108] 图10为本发明用户数据报协议报文的接收装置图。 [0108] FIG. 10 is the receiving apparatus of FIG user datagram protocol packets invention.

具体实施方式 detailed description

[0109] 下面以具体实施例结合附图对本发明进一步加以阐述。 [0109] The following specific examples further elaborate the present invention in conjunction with the accompanying drawings.

[0110] 本发明一种UDP报文的处理方法,如图2所示,包括以下步骤: [0110] The processing method of the present invention, the UDP packet shown in Figure 2, comprising the steps of:

[0111] S201、在待发送的报文中添加冗余校验块及校验识别码;其中,冗余校验块存储有待发送报文之前至少一个报文中数据部分的冗余运算的结果,校验识别码用于接收端识别所述冗余校验块,并对报文的原始序列进行标识; [0111] S201, a check block and to add redundancy check identifier in a message to be transmitted; wherein the redundancy check block redundancy operation results to be stored at least one portion of the data packet before sending the packet , the original sequence for checking the identification code identifying the end of receiving redundancy check block, and identifies the packet;

[0112] S202、接收端接收到报文后,根据报文中的校验识别码判断当前报文是否发生丢失,若是则转步骤S203 ;网络传输中可能会出现UDP报文的丢包、乱序及误码,接收端接收到报文后,根据其中的校验识别码获取报文的原始序列信息,当出现丢包或误码时可直接判断该报文丢失;而出现乱序时,可等待一定的时间,如果仍接收不到报文则判断该报文丢失;[0113] S203、根据与丢失报文相关联的至少一个报文的数据部分和/或冗余校验块进行纠错运算,恢复丢失报文的数据部分;其中,纠错运算的算法应视步骤S201中的冗余运算而定,以下具体实施例中将有具体描述。 [0112] S202, the receiving end receives the packets, according to the packet identification code of the check determines whether the current packet is lost, if go to Step S203; UDP packet loss may occur in the transmission network, chaos sequence and error, the receiving end receives the packets, according to the check identifier which acquires the original packet sequence information, when the packet loss or error can be determined directly packet loss; disorder occurs when, may wait for a certain time, if the packet is still not received the packet loss is determined; [0113] S203, correction performed in accordance with at least one packet of the packet loss associated data portion and / or redundant check block wrong operation, the data portion recover lost packets; wherein the error correction algorithm should be considered redundant arithmetic operation in step S201 may be, the following specific embodiments will be described with specific embodiments.

[0114] 本发明UDP报文的处理方法适用于封装格式较为固定的音视频数据流。 [0114] UDP packet processing method of the present invention is applied to a relatively fixed encapsulation format audio and video data streams. 在实施过程中,可以根据稳定的纠错能力需求预先设置冗余校验块的长度;也可以随着纠错能力需求的改变,而根据UDP报文的剩余可用长度调节所添加冗余校验块的长度。 In the process embodiment, may be preset according to the length of the CRC block error correction capability stable demand; error correction capability may change as demand, and the redundancy check added according to the remaining available length adjusting UDP packets length of the block. 下面以三个具体实施例对上述UDP报文的处理方法进行具体描述。 In the following three embodiments will be specifically described with particular embodiments of the above-described processing method UDP packets.

[0115] 第一实施例以现有技术中较为常见的采用TS (Transport Stream,传输流)流的UDP报文作为冗余纠错的对象。 [0115] In the first embodiment of the prior art more common UDP packets using TS (Transport Stream, Transport Stream) stream as an object of error correction redundancy. 具体实现如下: Specific achieve the following:

[0116] (1)、根据TS流的UDP报文长度固定,对数据进行分块,同时利用报文的剩余可用长度添加冗余校验块; [0116] (1), according to the UDP packet length is fixed TS stream, the data block, while utilizing the remaining usable length of packets adding redundant check block;

[0117] TS流由固定大小的TS包所组成,每个TS包长度为188字节。 [0117] TS stream from the TS packets of fixed size, each TS packet length is 188 bytes. 由于以太网允许的最大IP包长度为1500字节,因此封装在每个UDP报文中的TS包有且仅有7个,总长度为1316字节,加上20字节的IP头和8字节的UDP头,因此UDP报文的总长度为1344字节,具体格式如图3所示。 Since the maximum allowed IP Ethernet packet length is 1500 bytes, so each encapsulated in UDP packets and only the TS packets 7, a total length of 1316 bytes, plus 20 bytes of IP header and 8 byte UDP header, the total length of the UDP packets of 1344 bytes, the specific format shown in FIG. 同时可得知,该报文有156个字节的剩余可用长度。 At the same time we can know the remaining usable length of the packet has 156 bytes.

[0118] 根据剩余156个字节的长度,将报文中的7个TS包分为10块,其中前9块长度为132字节,最后一个块为128字节(1316 = 132X9+128);同时在每个报文的最后添加长度为4字节的校验识别码和132字节的冗余校验块,此时该报文的总长度为1480字节,仍然没有超出以太网默认的1500字节MTU (MaximumTransmission Unit,最大传输单元)限制, 添加冗余校验块后的报文格式如图4所示。 [0118] The length of the remaining 156 bytes, the packet is divided into seven 10 TS packets, of which the first 9 bytes in length 132, the last block is 128 bytes (1316 = 132X9 + 128) ; while the final length of each packet is added to 4-byte identification code and a checksum byte CRC block 132, at this time the total length of the packet is 1480 bytes, Ethernet still within the default 1500 byte MTU (MaximumTransmission unit, MTU) limits, after adding redundancy check block packet format shown in FIG.

[0119] 其中,4字节的校验识别码可以使用0χ4747χχχχ格式(TS流的数据块识别码是0x47),16进制的XXXX是识别UDP报文序列的0-65535循环累加计数器,以保证接收端不需要IP、UDP等字段的序列信息,独立依靠校验识别码,就可以获取出报文的原始序列信息, 从而判断出当前是否发生丢包、乱序。 [0119] wherein the 4-byte parity identification code may be used 0χ4747χχχχ format (TS stream data block identification code is 0x47), 16 hexadecimal XXXX 0-65535 loop is to identify up-counter UDP packet sequence to ensure does not require sequence information receiving terminal IP, UDP, etc. the field, relying on independent verification PIN, can obtain the original sequence of information packets, to determine the loss, this disorder occurs.

[0120] (2)、构造冗余运算矩阵进行冗余运算,并将冗余运算结果存储于冗余校验块中; [0120] (2), a redundant configuration redundant operation matrix calculation, and the calculation result is stored in the redundant block CRC;

[0121] 以20个连续的UDP报文为例,每个数据包共有11个块,其中前10个为数据块,最后一个块为冗余校验块,构成如下的矩阵A : [0121] In 20 consecutive UDP packet as an example, each data packet has 11 blocks, of which the first 10 data blocks, the last block is block redundancy check to form the following matrix A:

[0125] [0125]

[0126] [0126]

[0127] ...... [0127] ......

[0128] [0128]

[0129] 由上可知,每个冗余校验块的产生都需要之前10个连续的报文中的部分数据块, 也即,每个冗余校验块的数据都与之前10个连续的报文中的部分数据发生关联。 [0129] From the above, part of the data blocks prior to generating each CRC block requires 10 consecutive packets, i.e., data of each block are CRC 10 contiguous with the previous associated portion of the data packets occur.

[0130] (3)、接收端判断报文发生丢失后,根据特定报文进行纠错运算,恢复丢失报文的数据部分。 After [0130] (3), the receiving end determines the packet loss occurs, performs an error correction operation based on a specific message, a data portion to restore lost packets.

[0131] 由前述可知,接收端可根据报文中的校验识别码获取报文的原始序列信息,进一步判断是否发生丢包、乱序。 [0131] From the foregoing, the receiving end according to the original sequence of information packets check the identification code of the acquired packet, determining whether further packet loss, disorder occurs. 当网络传输出现丢包、乱序时,接收端在等待一定时间后,若还未收到数据包,则作为报文丢失处理。 When the transmission network packet loss, out of order, the receiving end after a certain waiting time, if not yet received data packet, a packet loss process. 此时便需要按照以下方法进行纠错运算。 At this point we need to be error correction operation according to the following method.

[0132] 首先以丢失报文之前9个和之后10个连续报文与丢失报文共同构成一个矩阵B : [0132] First, with 9 and after 10 consecutive lost packets and packet constitute a packet loss before the matrix B:

[0133] [0133]

[0134] 其中,BiJi = 1、2· ·20,j = 1、2 · · 11)表示第i个UDP报文中的第j个块), 这里假设丢失的报文为第10个。 [0134] wherein, BiJi = 1,2 · · 20, j = 1,2 · · 11) represents the j-th block of the i-th UDP packet), the packet loss is assumed here for the first 10.

[0135] 则丢失报文的数据部分可由以下公式得到: [0135] the packet loss data portion obtained by the following formula:

[0136] [0136]

[0137] [0137]

[0138] ...... [0138] ......

[0139] [0139]

[0140] 如果以上的数据块中不存在数据,即数据块为空,则在运算中自动补零,根据按位异或的运算原理,不会影响到运算的结果。 [0140] If the above data does not exist in the data block, i.e., the data block is empty, then zero-padded In operation, in accordance with the principles of the bitwise XOR does not affect the result of the operation.

[0141] 进一步由计算可得,上述第一实施例中,如果要实现本发明的处理方法,则连续的20个报文中可以允许丢失一个报文,则丢包率即为(1/20) X 100% = 5%。 [0141] is further obtained by the calculation, the above-described first embodiment, if the processing method of the present invention to be achieved, the successive packets 20 may allow the loss of a packet, the packet loss rate is the (1/20 ) X 100% = 5%. 本发明中,UDP报文中封装的TS包块数可以不固定,比如在上述第一实施例中,每个报文封装了7个TS包, 而如果需要进一步提高纠错能力,则可以减少每个报文中封装的TS包的个数,用来增加冗余校验块的长度,从而减少进行恢复时所需要的报文的个数。 In the present invention, the number of TS packets in the UDP encapsulating mass may not be fixed, for example, in the above-described first embodiment, each packet encapsulation seven TS packets, and if necessary to further improve the error correction capability may be reduced the number of TS packets each encapsulated packet, for increasing the length of the CRC block, thereby reducing the number of packets required to recover the time. [0142] 以封装有6个TS块的UDP报文为例描述本发明UDP报文的处理方法第二实施例。 [0142] In the package there are six blocks UDP TS packet processing method described in Example UDP packets a second embodiment of the present invention.

[0143] 首先,根据UDP报文的剩余可用长度,对报文数据部分进行分块,同时添加冗余校验块; [0143] First, according to the remaining usable length of the UDP packet, the packet data portion is divided into blocks, while adding redundancy check block;

[0144] UDP报文数据长度为:188X6 = 1128 (字节) [0144] UDP data packet length is: 188X6 = 1128 (bytes)

[0145] 报文剩余可用长度为:1500-(188 X 6+28+4) = 340 (字节) [0145] packet length of the remaining available: 1500- (188 X 6 + 28 + 4) = 340 (bytes)

[0146] 根据剩余340字节的可用长度,可将数据部分分为4块,并同时添加长度为1128/4 =282字节的冗余校验块及4字节的校验识别码。 [0146] The length of the remaining 340 bytes are available, data may be divided into four portions, and simultaneously added length is 1128/4 = 282 byte blocks, and 4-byte CRC checksum identification code. 添加冗余校验块及校验识别码后的UDP 报文格式如图5所示。 Adding redundancy check block after the identification code and verification UDP packet format as shown in FIG.

[0147] 之后按类似上述第一实施例的步骤(2)、(3)构造封装矩阵及解封装矩阵。 Step (2), (3) a matrix encapsulation and decapsulation structure matrix. After [0147] In a similar embodiment of the above-described first embodiment 与第一实施例相比,UDP报文中的数据块由10块变为4块,由相同的异或算法可得,恢复丢失报文时所需要的报文个数则由19个变为7个,即连续的8个数据包中可以允许丢一个包,允许的丢包率为12. 5%,从而进一步提高了纠错能力。 Compared with the first embodiment, UDP packets from the data block 10 becomes 4, can be obtained from the same or a different algorithm, restore the number of packets lost when required by packet becomes 19 7, i.e., eight consecutive lost packets can allow a packet to allow the packet loss rate is 12.5%, thereby further improving the error correction capability. 由于构造矩阵的算法与第一实施例相同, 因此本实施例于此不加以赘述。 Since the algorithm same as the first embodiment of the matrix structure, the present embodiment therefore not be further described herein.

[0148] 除了TS流的UDP报文外,本发明也同样适用于存在UDP报文特定空闲区域的其他格式数据的承载。 [0148] A TS stream of UDP packets, the present invention is equally applicable to other formats carrying UDP data packets present in a specific free area. 第三实施例中UDP报文则以G. 729的20ms语音RTP (Real-time Transport Protocol,实时传输协议)打包,报文大小始终是60字节。 The third embodiment UDP packets places G. 20ms of speech RTP 729 (Real-time Transport Protocol, Real-time Transport Protocol) package, packet size is always 60 bytes. 其中包括语音净荷20字节、RTP 头12字节、UDP头8字节及IP头20字节,远小于1500字节限制,存在大量的空闲区域,可以存放冗余校验块,以实现前后报文之间的相互冗余。 Including voice payload of 20 bytes, 12 bytes of the RTP header, UDP header and IP header 20 bytes 8 bytes, far less than the 1500 byte limit, there is a lot of free area can be stored redundancy check block, in order to achieve mutual redundancy between the front and rear paper reported.

[0149] 此时,不需要进行上述两个实施例的分块、异或运算,直接重复原始数据即可。 [0149] In this case, unnecessary for the two sub-blocks, an exclusive OR operation of the embodiment, the original data can be a direct repeat. 本实施例以每个报文对之前2个报文进行冗余备份为例,图6为进行冗余校验后的UDP报文格式,如图所示,每个报文除自身的20字节净荷外,还附带了前面两个报文共48字节的净荷。 In this embodiment, prior to each packet of two redundant packets, for example, FIG. 6 is a redundancy check performed after the UDP packet format as shown, each of the packets except the word itself 20 outer segment payload, but also with the first two packets of 48 bytes payload.

[0150] 以下是由10个连续的报文构成的矩阵: [0150] The following is composed of 10 consecutive packets constituting the matrix:

[0151] [0151]

[0152] 其中,每一列代表了一个UDP报文,数字N表示该报文存储有第N个报文中的净荷,例如第8个报文中,除了本身的净荷外,还冗余了第7个和第6个报文的净荷。 [0152] wherein each column represents a UDP packet, the packet number N indicates the N-th stored message payload, for example, the first eight packets, in addition to the payload itself, but also the redundancy the 7th and 6th message payload. 因此,这种冗余校验方法允许每三个连续的数据包中,丢两个包,即网络允许的丢包率为66. 7%。 Thus, this redundancy method allow each of three consecutive data packet, two lost packets, i.e. the network packet loss rate permitted 66.7%. 需要说明的是,按上述方法添加的冗余校验块需要占用大量长度的字节,因此该种冗余校验方法只适用于数据部分较小而剩余可用长度较大的UDP报文。 Incidentally, the check block redundancy is added as described above require significant byte length, so this kind of redundancy method is only applicable to a small portion of the remaining available data length larger UDP packets.

[0153] 本发明一种UDP报文的封装方法,如图7所示,包括以下步骤: [0153] A UDP packet according to the present invention, the packaging method shown in Figure 7, comprising the steps of:

[0154] S701、在待发送的报文中添加冗余校验块及校验识别码;对于封装格式及纠错能力的需求较为固定的UDP报文,可以预先设置冗余校验块的长度进行添加;而在不同封装格式或纠错能力需求不同的UDP报文中应用本发明的封装方法时,则可以通过检测报文的长度,根据报文的MTU限制获取报文的剩余可用长度,进一步进行冗余校验块的添加; [0154] S701, a check block and to add redundancy check identifier in a message to be sent; relatively fixed demand encapsulation format and error correction capability of UDP packets may be pre-set length CRC block add; when the packaging method of the present invention in different encapsulation or different error correction capability of UDP packets needs of the application, can be detected by the length of the packet, the remaining usable length of the packet acquired MTU packets according to limits, further adding redundancy check block;

[0155] S702、对待发送报文之前至少一个报文中数据部分进行冗余运算,并将结果存储于冗余校验块。 [0155] S702, the message to be sent before the at least a portion of the data packet redundancy calculation, and the result is stored in the CRC block.

[0156] 其中,上述添加冗余校验块的方式及冗余运算的具体算法可以视报文的剩余可用长度而不同。 [0156] wherein said adding redundancy check block redundancy operation mode and the specific algorithm may be used depending on the length of the remaining packets varies. 如果报文的剩余长度较小,可以根据预设的长度或报文的剩余可用长度对报文的数据部分进行分块后添加冗余校验块,并使冗余校验块的长度与数据块的长度相等, 而此时冗余运算可以采用典型的异或算法;如果报文中存在大量的空闲区域,就不需要进行数据部分的分块,也不需要进行异或运算,只需直接对之前的报文数据部分进行重复备份。 Adding redundancy check block if the remaining length of the packet is small, the data block may be part of the message according to a preset length or the remaining usable length of the packet, and the length of data redundancy check block equal to the length of the block, at which point the redundancy calculation may typically exclusive-oR algorithm; if a large amount of vacant area exists in the message, there is no need for the data portion of the block does not need to XOR, simply direct data portion of the packet is repeated before backup.

[0157] 本发明一种UDP报文的解封装方法,如图8所示,包括以下步骤: [0157] A UDP packet according to the present invention decapsulation method, shown in Figure 8, comprising the steps of:

[0158] S801、判断当前报文是否发生丢失;其中,接收端可以通过报文中的IP、UDP等字段的序列信息判断是否发生丢包或乱序;而在添加有校验识别码的UDP报文中,接收端可以独立依靠校验识别码获取报文的原始序列,进一步判断当前报文是否发生丢失; [0158] S801, determines whether or not the current packet is lost; wherein, the receiving end through the IP packets, the sequence information to determine whether the fields of the UDP packet loss occurs or scrambled; and supplemented with the UDP checksum identification code packet, the receiving end may rely on independent check the identification code to obtain the original packet sequence, is further determined whether the current packet is lost;

[0159] S802、根据与丢失报文相关联的至少一个报文的数据部分和/或冗余校验块进行纠错运算,恢复丢失报文的数据部分;其中,具体纠错运算的算法应视UDP报文中冗余校验块的封装方式而定,如果接收到报文中的冗余校验块是通过分块及异或运算获取,则纠错恢复也应该联合丢失报文之前和之后若干个报文的冗余校验块及对应数据块进行异或运算;而如果报文中的冗余校验块是通过对其它报文的直接复制而获得,则纠错恢复也只需从丢失报文之后存储有冗余信息的报文中的冗余校验块直接恢复。 [0159] S802, in accordance with the packet loss associated with the at least a portion of the message data and / or parity redundancy block error correction operation, to recover data partially lost packets; wherein the method, specific error correction operation should be prior to encapsulation in UDP packets depending redundancy check block may be, if the received packet CRC block is obtained by the block and the exclusive-oR operation, then the correction should recover lost packets and joint after a number of packets of the block and the corresponding redundancy check data block XOR operation; and if the packet CRC block is obtained by direct copying and for other packets available, the recovery is only correction after packet loss from the packet is stored in the redundancy information block CRC recovered directly.

[0160] 本发明一种UDP报文的发送装置,如图9所示,包括报文长度检测模块91、报文封装模块92及报文发送模块93。 [0160] present invention provides a UDP packet transmission apparatus, as shown in FIG 9, comprising a packet length detector module 91, packet encapsulation module 92 and the message sending module 93.

[0161] 报文长度检测模块91对待发送的报文长度进行检测,并根据检测结果及MTU限制长度得到报文的剩余可用长度。 [0161] packet length detector module 91 treats the packet length of the transmission is detected, and limits the length of the detection result obtained and the remaining usable length of MTU packets.

[0162] 报文封装模块92根据报文的剩余可用长度在待发送的报文中添加冗余校验块及校验识别码;并在对待发送报文之前至少一个报文的数据部分进行冗余运算后将结果存储于冗余校验块。 [0162] packet encapsulation module 92 adds redundancy check and a check block according to the remaining usable length of the identification code in the message packet to be sent; and data to be transmitted before packets at least part of a packet to a redundant after I CRC calculation result is stored in the block. 此外,报文封装模块92还可以通过预先设置冗余校验块的长度进行添加。 Further, the packet encapsulation module 92 may also be added by a preset length CRC block. 具体的添加方式可视剩余可用长度而定,如果报文的剩余长度较小,可以根据预设的长度或报文的剩余可用长度对报文的数据部分进行分块后添加冗余校验块,并使冗余校验块的长度与数据块的长度相等,而此时冗余运算可以采用典型的异或算法;如果报文中存在大量的空闲区域,就不需要进行数据部分的分块,也不需要进行异或运算,只需直接对之前的报文数据部分进行重复备份后将结果存储于冗余校验块。 Specifically, after adding redundancy check block addition of the remaining available visualized on the length, if the remaining length of the packet is small, the data block may be part of the message according to a preset length or the remaining usable length of the packet , and the length of the data block redundancy check block are equal, at which point the redundancy calculation may typically exclusive-oR algorithm; if a large amount of vacant area exists in the message, there is no need for segmentation data portion no need XOR, only directly before packet based upon the results of duplicate backup redundancy check stored in the block.

[0163] 经报文封装模块92对报文封装完成后,由报文发送模块93向接收端发送。 [0163] After the message packet encapsulation module packaging is finished, sending the packets sent by the 92 pairs of module 93 to the receiving end.

[0164] 本发明一种UDP报文的接收装置,如图10所示,包括:报文接收模块101、报文序列检测模块102及报文解析模块103。 [0164] A UDP packet according to the present invention, the receiving means 10, comprising: a message receiving module 101, packet sequence detector module 102 and the message parsing module 103.

[0165] 报文接收模块101接收UDP报文后,由报文序列检测模块102对接收到的报文进行序列检测,以判断报文是否发生丢失。 [0165] message receiving module 101, after receiving a UDP packet received by the packet sequence detector 102 abutting packet sequence detection module to determine whether the packet is lost. 具体的判断方法,报文序列检测模块102可以通过报文中的IP、UDP字段,获取报文的序列信息以判断是否发生丢包或乱序;也可以独立根据报文中添加的校验识别码分辨报文的原始序列,进而判断当前报文是否发生丢失。 The specific determination method, packet detecting module 102 can sequence packets IP, UDP field, obtaining the packet sequence information to determine whether or scrambled packet loss occurs; may be identified according to independent check packet added code to distinguish the original message sequence, and then determines whether or not the current packet is lost.

[0166] 报文序列检测模块102判断当前报文发生丢失后,报文解析模块103根据与丢失报文相关联的至少一个报文的数据部分和/或冗余校验块进行纠错运算,恢复丢失报文的数据部分。 [0166] sequence of packets after the current detection module 102 determines the occurrence of packet loss, packet parsing module 103 performs an error correction operation according to packet loss associated with the at least a portion of the data packet and / or block redundancy check, recover lost data portion of the packet. 具体纠错运算的算法应视UDP报文中冗余校验块的封装方式而定,如果接收到 Specific error correction operation algorithm should be considered in the UDP packet encapsulation redundancy check block may be, if the received

16报文中的冗余校验块通过分块及异或运算添加,则纠错恢复也应该联合丢失报文之前和之后若干个报文的冗余校验块及对应数据块进行异或运算;而如果报文中的冗余校验块是通过对其它报文的直接复制而获得,则纠错恢复也只需从丢失报文之后存储有冗余信息的报文中的冗余校验块直接恢复。 16 in the packet CRC block by block and the exclusive OR operation is added, then the correction should restore lost joint XOR packets before and after a plurality of packets of the block and the corresponding redundancy check data block ; If the packet CRC block is copied directly to other packets obtained by, the correction to restore redundancy check packet also needs to store redundant information from the packet loss after block direct recovery.

[0167] 以上公开的仅为本发明的几个具体实施例,但是,本发明并非局限于此,任何本领域的技术人员能思之的变化都应落入本发明的保护范围。 Only a few [0167] above disclosed specific embodiments of the present invention, however, the present invention is not limited thereto, anyone skilled in the art can think of variations shall fall within the scope of the present invention.

Claims (18)

  1. 一种用户数据报协议报文的处理方法,其特征在于,包括:A、在待发送的报文中添加冗余校验块,所述冗余校验块存储所述待发送报文之前多个报文的数据部分的冗余运算的结果;步骤A具体包括:在待发送的报文中,将报文的数据部分分为n个等长的数据块,同时根据预设的长度或报文的剩余可用长度添加冗余校验块,使所述冗余校验块与所述数据块的长度相等,并存储所述待发送报文之前n个报文中对应数据块的冗余运算的结果;所述冗余运算包括:利用当前报文及之前n个报文的数据块及冗余校验块构造如下矩阵: <mrow> <mfenced open='[' close=']'> <mtable> <mtr> <mtd> <msub> <mi>A</mi> <mn>1,1</mn> </msub> </mtd> <mtd> <msub> <mi>A</mi> <mn>2,1</mn> </msub> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <msub> <mi>A</mi> <mrow> <mi>n</mi> <mo>,</mo> <mn>1</mn> </mrow> </msub> </mtd> <mtd> <msub> <mi>A</mi> <mrow> <mi>n</mi> <m A method for processing a user datagram protocol packets, characterized by comprising: A, add redundancy check block in the message to be sent, said plurality of redundant packets to be sent prior to storing the check block results redundant operation a portion of the data packet; step a specifically comprises: in a message to be sent, the message data portion is divided into n data blocks of equal length, or at the same time according to a preset length packets Add the remaining usable length of the packet CRC block, so that the length of the data block and the parity redundancy block is equal to, and storing said data block to be redundant operation corresponding to the n packets before sending packets results; the redundancy operation comprising: using the current packet and the previous packet of n data blocks and redundancy blocks check matrix is ​​constructed as follows: <mrow> <mfenced open = '[' close = ']'> < mtable> <mtr> <mtd> <msub> <mi> A </ mi> <mn> 1,1 </ mn> </ msub> </ mtd> <mtd> <msub> <mi> A </ mi > <mn> 2,1 </ mn> </ msub> </ mtd> <mtd> <mo>. </ mo> </ mtd> <mtd> <msub> <mi> A </ mi> <mrow > <mi> n </ mi> <mo>, </ mo> <mn> 1 </ mn> </ mrow> </ msub> </ mtd> <mtd> <msub> <mi> A </ mi > <mrow> <mi> n </ mi> <m o>+</mo> <mn>1,1</mn> </mrow> </msub> </mtd> </mtr> <mtr> <mtd> <msub> <mi>A</mi> <mn>1,2</mn> </msub> </mtd> <mtd> <msub> <mi>A</mi> <mn>2,2</mn> </msub> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> </mtr> <mtr> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> </mtr> <mtr> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <msub> <mi>A</mi> <mrow> <mi>n</mi> <mo>,</mo> <mi>n</mi> </mrow> </msub> </mtd> <mtd> <msub> <mi>A</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> <mo>,</mo> <mi>n</mi> </mrow> </msub> </mtd> </mtr> <mtr> <mtd> <msub> <mi>A</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <msub> <mi>A</mi> <mrow> <mi>n</mi> <mo>,</mo> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </mtd> <mtd> <msub> <mi>A</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> <mo>,</mo o> + </ mo> <mn> 1,1 </ mn> </ mrow> </ msub> </ mtd> </ mtr> <mtr> <mtd> <msub> <mi> A </ mi> <mn> 1,2 </ mn> </ msub> </ mtd> <mtd> <msub> <mi> A </ mi> <mn> 2,2 </ mn> </ msub> </ mtd> <mtd> <mo>. </ mo> </ mtd> <mtd> <mo>. </ mo> </ mtd> <mtd> <mo>. </ mo> </ mtd> </ mtr> < mtr> <mtd> <mo>. </ mo> </ mtd> <mtd> <mo>. </ mo> </ mtd> <mtd> <mo>. </ mo> </ mtd> <mtd> <mo>. </ mo> </ mtd> <mtd> <mo>. </ mo> </ mtd> </ mtr> <mtr> <mtd> <mo>. </ mo> </ mtd> < mtd> <mo>. </ mo> </ mtd> <mtd> <mo>. </ mo> </ mtd> <mtd> <msub> <mi> A </ mi> <mrow> <mi> n </ mi> <mo>, </ mo> <mi> n </ mi> </ mrow> </ msub> </ mtd> <mtd> <msub> <mi> A </ mi> <mrow> < mi> n </ mi> <mo> + </ mo> <mn> 1 </ mn> <mo>, </ mo> <mi> n </ mi> </ mrow> </ msub> </ mtd > </ mtr> <mtr> <mtd> <msub> <mi> A </ mi> <mrow> <mn> 1 </ mn> <mo>, </ mo> <mi> n </ mi> < mo> + </ mo> <mn> 1 </ mn> </ mrow> </ msub> </ mtd> <mtd> <mo>. </ mo> </ mtd> <mtd> <mo>. < / mo> </ mtd> <mtd> <msub> <mi> A </ mi> <mrow> <mi> n </ mi> <mo>, </ mo> <mi> n </ mi> <mo > + </ mo> <mn> 1 </ mn> </ mrow> </ msub> </ mtd> <mtd> <msub> <mi> A </ mi> <mrow> <mi> n </ mi > <mo> + </ mo> <mn> 1 </ mn> <mo>, </ mo > <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </mtd> </mtr> </mtable> </mfenced> <mo>,</mo> </mrow>其中,Ai,j,i=1、2、··n+1,j=1、2、··n+1,为第i个报文的第j个块,每个报文的最后一个块为冗余校验块,且如果Ai,j为空,则Ai,j=0;运用异或算法获取结果: <mrow> <msub> <mi>A</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> <mo>,</mo> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>=</mo> <msub> <mi>A</mi> <mn>1,1</mn> </msub> <mo>&CirclePlus;</mo> <msub> <mi>A</mi> <mn>2,2</mn> </msub> <mo>&CirclePlus;</mo> <mo>.</mo> <mo>.</mo> <mo>&CirclePlus;</mo> <msub> <mi>A</mi> <mrow> <mi>n</mi> <mo>,</mo> <mi>n</mi> </mrow> </msub> <mo>;</mo> </mrow>B、接收端判断当前报文发生丢失后,根据与丢失报文相关联的多个报文的数据部分和/或冗余校验块进行纠错运算,恢复丢失报文的数据部分;步骤B具体包括:判断当前报文发生丢失后,根据丢失报文之前n‑1个和 > <Mi> n </ mi> <mo> + </ mo> <mn> 1 </ mn> </ mrow> </ msub> </ mtd> </ mtr> </ mtable> </ mfenced> < mo>, </ mo> </ mrow> where, Ai, j, i = 1,2, ·· n + 1, j = 1,2, ·· n + 1, the i-th packet is the j block, the last block of each packet redundancy check block, and if Ai, j is empty, then Ai, j = 0; XOR algorithm acquisition using results: <mrow> <msub> <mi> a </ mi> <mrow> <mi> n </ mi> <mo> + </ mo> <mn> 1 </ mn> <mo>, </ mo> <mi> n </ mi> <mo> + </ mo> <mn> 1 </ mn> </ mrow> </ msub> <mo> = </ mo> <msub> <mi> A </ mi> <mn> 1,1 </ mn> </ msub> <mo> & CirclePlus; </ mo> <msub> <mi> A </ mi> <mn> 2,2 </ mn> </ msub> <mo> & CirclePlus; </ mo> <mo> . </ mo> <mo> </ mo> <mo> & CirclePlus;. </ mo> <msub> <mi> A </ mi> <mrow> <mi> n </ mi> <mo>, </ mo> <mi> n </ mi> </ mrow> </ msub> <mo>; the </ mo> </ mrow> B, the receiving end determines whether the current packet is lost, according to packet loss associated with the data portion of the plurality of packets and / or parity redundancy block error correction operation, to recover data partially lost packets; step B comprises: determining the current packet loss occurs before the packet loss according to the n-1 with 后n个报文的冗余校验块及对应数据块进行纠错运算,恢复丢失报文的数据部分;所述纠错运算包括:利用所述丢失报文及之前n‑1个和之后n个报文的数据块及冗余校验块构造如下矩阵: <mrow> <mfenced open='[' close=']'> <mtable> <mtr> <mtd> <msub> <mi>B</mi> <mn>1,1</mn> </msub> </mtd> <mtd> <msub> <mi>B</mi> <mn>2,1</mn> </msub> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>-</mo> <mn>1,1</mn> </mrow> </msub> </mtd> <mtd> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>,</mo> <mn>1</mn> </mrow> </msub> </mtd> <mtd> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1,1</mn> </mrow> </msub> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <msub> <mi>B</mi> <mrow> <mn>2</mn> <mi>n</mi> <mo>,</mo> <mn>1</mn> </mrow> </msub> </mtd> </mtr> <mtr> <mtd> <msub> <mi>B</mi> <mn>1,2</mn> </msub> </mtd> <mtd> <msub> <mi>B</mi> <mn>2,2</mn> </msub> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> After the n packet block and the corresponding redundancy check data block error correction operation, to recover the data portion of the packet loss; the error correction operation comprising: using the packet loss before and after the n-1 and n data block and a CRC block configuration packets following matrix: <mrow> <mfenced open = '[' close = ']'> <mtable> <mtr> <mtd> <msub> <mi> B </ mi> <mn> 1,1 </ mn> </ msub> </ mtd> <mtd> <msub> <mi> B </ mi> <mn> 2,1 </ mn> </ msub> </ . mtd> <mtd> <mo> </ mo> </ mtd> <mtd> <msub> <mi> B </ mi> <mrow> <mi> n </ mi> <mo> - </ mo> <mn> 1,1 </ mn> </ mrow> </ msub> </ mtd> <mtd> <msub> <mi> B </ mi> <mrow> <mi> n </ mi> <mo> , </ mo> <mn> 1 </ mn> </ mrow> </ msub> </ mtd> <mtd> <msub> <mi> B </ mi> <mrow> <mi> n </ mi> <mo> + </ mo> <mn> 1,1 </ mn> </ mrow> </ msub> </ mtd> <mtd> <mo>. </ mo> </ mtd> <mtd> <mo >. </ mo> </ mtd> <mtd> <msub> <mi> B </ mi> <mrow> <mn> 2 </ mn> <mi> n </ mi> <mo>, </ mo > <mn> 1 </ mn> </ mrow> </ msub> </ mtd> </ mtr> <mtr> <mtd> <msub> <mi> B </ mi> <mn> 1,2 </ mn> </ msub> </ mtd> <mtd> <msub> <mi> B </ mi> <mn> 2,2 </ mn> </ msub> </ mtd> <mtd> <mo>. < / mo> </ mtd> <mtd> <mo>. </ mo> </ mtd> <mtd> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>,</mo> <mn>2</mn> </mrow> </msub> </mtd> <mtd> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1,2</mn> </mrow> </msub> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> </mtr> <mtr> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>,</mo> <mi>n</mi> <mo>-</mo> <mn>1</mn> </mrow> </msub> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1,3</mn> </mrow> </msub> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> </mtr> <mtr> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>,</mo> <mi>n</mi> </mrow> </msub> </mtd> <mtd> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>,</mo> <mi>n</mi> </mrow> </msub> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <msub> <mi>B</m <Mtd> <msub> <mi> B </ mi> <mrow> <mi> n </ mi> <mo>, </ mo> <mn> 2 </ mn> </ mrow> </ msub> < / mtd> <mtd> <msub> <mi> B </ mi> <mrow> <mi> n </ mi> <mo> + </ mo> <mn> 1,2 </ mn> </ mrow> </ msub> </ mtd> <mtd> <mo>. </ mo> </ mtd> <mtd> <mo>. </ mo> </ mtd> <mtd> <mo>. </ mo> < / mtd> </ mtr> <mtr> <mtd> <mo>. </ mo> </ mtd> <mtd> <mo>. </ mo> </ mtd> <mtd> <mo>. </ mo > </ mtd> <mtd> <msub> <mi> B </ mi> <mrow> <mi> n </ mi> <mo> - </ mo> <mn> 1 </ mn> <mo>, </ mo> <mi> n </ mi> <mo> -. </ mo> <mn> 1 </ mn> </ mrow> </ msub> </ mtd> <mtd> <mo> </ mo > </ mtd> <mtd> <msub> <mi> B </ mi> <mrow> <mi> n </ mi> <mo> + </ mo> <mn> 1,3 </ mn> </ mrow> </ msub> </ mtd> <mtd> <mo>. </ mo> </ mtd> <mtd> <mo>. </ mo> </ mtd> <mtd> <mo>. </ mo > </ mtd> </ mtr> <mtr> <mtd> <mo>. </ mo> </ mtd> <mtd> <mo>. </ mo> </ mtd> <mtd> <mo>. < / mo> </ mtd> <mtd> <msub> <mi> B </ mi> <mrow> <mi> n </ mi> <mo> - </ mo> <mn> 1 </ mn> <mo >, </ mo> <mi> n </ mi> </ mrow> </ msub> </ mtd> <mtd> <msub> <mi> B </ mi> <mrow> <mi> n </ mi > <mo>, </ mo> <mi> n </ mi> </ mrow> </ msub> </ mtd> <mtd> <mo>. </ mo> </ mtd> <mtd> <mo> . </ mo> </ mtd> <mtd> <msub> <mi> B </ m i> <mrow> <mn>2</mn> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>,</mo> <mi>n</mi> </mrow> </msub> </mtd> <mtd> <mo>.</mo> </mtd> </mtr> <mtr> <mtd> <msub> <mi>B</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>,</mo> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </mtd> <mtd> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>,</mo> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </mtd> <mtd> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> <mo>,</mo> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </mtd> <mtd> <mo>.</mo> </mtd> <mtd> <msub> <mi>B</mi> <mrow> <mn>2</mn> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>,</mo> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </mtd> <mtd> <msub> <mi>B</mi> <mrow> <mn>2</mn> <mi>n</mi> <mo>,</mo> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> </mtd> </mtr> </mtable> </mfenced> <mo>,</mo> </mrow>其 i> <mrow> <mn> 2 </ mn> <mi> n </ mi> <mo> - </ mo> <mn> 1 </ mn> <mo>, </ mo> <mi> n < / mi> </ mrow> </ msub> </ mtd> <mtd> <mo>. </ mo> </ mtd> </ mtr> <mtr> <mtd> <msub> <mi> B </ mi > <mrow> <mn> 1 </ mn> <mo>, </ mo> <mi> n </ mi> <mo> + </ mo> <mn> 1 </ mn> </ mrow> </ msub> </ mtd> <mtd> <mo>. </ mo> </ mtd> <mtd> <mo>. </ mo> </ mtd> <mtd> <msub> <mi> B </ mi> <mrow> <mi> n </ mi> <mo> - </ mo> <mn> 1 </ mn> <mo>, </ mo> <mi> n </ mi> <mo> + </ mo > <mn> 1 </ mn> </ mrow> </ msub> </ mtd> <mtd> <msub> <mi> B </ mi> <mrow> <mi> n </ mi> <mo>, </ mo> <mi> n </ mi> <mo> + </ mo> <mn> 1 </ mn> </ mrow> </ msub> </ mtd> <mtd> <msub> <mi> B </ mi> <mrow> <mi> n </ mi> <mo> + </ mo> <mn> 1 </ mn> <mo>, </ mo> <mi> n </ mi> <mo> + </ mo> <mn> 1 </ mn> </ mrow> </ msub> </ mtd> <mtd> <mo>. </ mo> </ mtd> <mtd> <msub> <mi> B </ mi> <mrow> <mn> 2 </ mn> <mi> n </ mi> <mo> - </ mo> <mn> 1 </ mn> <mo>, </ mo> <mi> n </ mi> <mo> + </ mo> <mn> 1 </ mn> </ mrow> </ msub> </ mtd> <mtd> <msub> <mi> B </ mi> <mrow> <mn> 2 </ mn> <mi> n </ mi> <mo>, </ mo> <mi> n </ mi> <mo> + </ mo> <mn> 1 </ mn> </ mrow> </ msub> </ mtd> </ mtr> </ mtable> </ mfenced> <mo>, </ mo> </ mrow> which ,Bi,j,i=1、2、··2n,j=1、2、··n+1,为第i个报文的第j个块,每个报文的最后一个块为冗余校验块,且如果Bi,j为空,则Bi,j=0;运用异或算法获取结果: <mrow> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>,</mo> <mn>1</mn> </mrow> </msub> <mo>=</mo> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1,2</mn> </mrow> </msub> <mo>&CirclePlus;</mo> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>2,3</mn> </mrow> </msub> <mo>&CirclePlus;</mo> <mo>.</mo> <mo>.</mo> <mo>&CirclePlus;</mo> <msub> <mi>B</mi> <mrow> <mn>2</mn> <mi>n</mi> <mo>,</mo> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> </mrow> <mrow> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>,</mo> <mn>2</mn> </mrow> </msub> <mo>=</mo> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>-</mo> <mn>1,1</mn> </mrow> </msub> <mo>&CirclePlus;</mo> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1,3</mn> </mrow> </msub> <mo>&CirclePlus;</mo> <mo>.</mo> <mo>.</mo> <mo>&CirclePlus;</ , Bi, j, i = 1,2, ·· 2n, j = 1,2, ·· n + 1, the i-th packet in the j-th block, the last block of each packet is redundant check block, and if Bi, j is empty, Bi, j = 0; XOR algorithm acquisition using results: <mrow> <msub> <mi> B </ mi> <mrow> <mi> n </ mi > <mo>, </ mo> <mn> 1 </ mn> </ mrow> </ msub> <mo> = </ mo> <msub> <mi> B </ mi> <mrow> <mi> n </ mi> <mo> + </ mo> <mn> 1,2 </ mn> </ mrow> </ msub> <mo> & CirclePlus; </ mo> <msub> <mi> B </ mi > <mrow> <mi> n </ mi> <mo> + </ mo> <mn> 2,3 </ mn> </ mrow> </ msub> <mo> & CirclePlus; </ mo> <mo> . </ mo> <mo> </ mo> <mo> & CirclePlus;. </ mo> <msub> <mi> B </ mi> <mrow> <mn> 2 </ mn> <mi> n </ mi> <mo>, </ mo> <mi> n </ mi> <mo> + </ mo> <mn> 1 </ mn> </ mrow> </ msub> <mo>, </ mo> </ mrow> <mrow> <msub> <mi> B </ mi> <mrow> <mi> n </ mi> <mo>, </ mo> <mn> 2 </ mn> </ mrow> < / msub> <mo> = </ mo> <msub> <mi> B </ mi> <mrow> <mi> n </ mi> <mo> - </ mo> <mn> 1,1 </ mn > </ mrow> </ msub> <mo> & CirclePlus; </ mo> <msub> <mi> B </ mi> <mrow> <mi> n </ mi> <mo> + </ mo> <mn > 1,3 </ mn> </ mrow> </ msub> <mo> & CirclePlus;.. </ mo> <mo> </ mo> <mo> </ mo> <mo> & CirclePlus; </ mo> <msub> <mi>B</mi> <mrow> <mn>2</mn> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>,</mo> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> </mrow> <mrow> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>,</mo> <mn>3</mn> </mrow> </msub> <mo>=</mo> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>-</mo> <mn>2,1</mn> </mrow> </msub> <mo>&CirclePlus;</mo> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>-</mo> <mn>1,2</mn> </mrow> </msub> <mo>&CirclePlus;</mo> <mo>.</mo> <mo>.</mo> <mo>&CirclePlus;</mo> <msub> <mi>B</mi> <mrow> <mn>2</mn> <mi>n</mi> <mo>-</mo> <mn>2</mn> <mo>,</mo> <mi>n</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> </mrow>…… <mrow> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>,</mo> <mi>n</mi> </mrow> </msub> <mo>=</mo> <msub> <mi>B</mi> <mn>1,1</mn> </msub> <mo>&CirclePlus;</mo> <msub> <mi>B</mi> <mn>2,2</mn> </msub> <mo>&CirclePlus;</mo> <mo>.</mo> <mo>.</mo> <mo>&CirclePlus;</mo> <msub> <mi>B</mi> <mrow> <mi>n</mi> <mo>+</mo> <mn>1</mn> <mo>,</mo> <mi>n</mi> <mo>+</mo> <mn>1</mn> </ mo> <msub> <mi> B </ mi> <mrow> <mn> 2 </ mn> <mi> n </ mi> <mo> - </ mo> <mn> 1 </ mn> <mo >, </ mo> <mi> n </ mi> <mo> + </ mo> <mn> 1 </ mn> </ mrow> </ msub> <mo>, </ mo> </ mrow> <mrow> <msub> <mi> B </ mi> <mrow> <mi> n </ mi> <mo>, </ mo> <mn> 3 </ mn> </ mrow> </ msub> < mo> = </ mo> <msub> <mi> B </ mi> <mrow> <mi> n </ mi> <mo> - </ mo> <mn> 2,1 </ mn> </ mrow > </ msub> <mo> & CirclePlus; </ mo> <msub> <mi> B </ mi> <mrow> <mi> n </ mi> <mo> - </ mo> <mn> 1,2 </ mn> </ mrow> </ msub> <mo> & CirclePlus; </ mo> <mo> </ mo> <mo> </ mo> <mo> & CirclePlus;.. </ mo> <msub> < mi> B </ mi> <mrow> <mn> 2 </ mn> <mi> n </ mi> <mo> - </ mo> <mn> 2 </ mn> <mo>, </ mo> <mi> n </ mi> <mo> + </ mo> <mn> 1 </ mn> </ mrow> </ msub> <mo>, </ mo> </ mrow> ...... <mrow> < msub> <mi> B </ mi> <mrow> <mi> n </ mi> <mo>, </ mo> <mi> n </ mi> </ mrow> </ msub> <mo> = < / mo> <msub> <mi> B </ mi> <mn> 1,1 </ mn> </ msub> <mo> & CirclePlus; </ mo> <msub> <mi> B </ mi> <mn > 2,2 </ mn> </ msub> <mo> & CirclePlus;.. </ mo> <mo> </ mo> <mo> </ mo> <mo> & CirclePlus; </ mo> <msub> < mi> B </ mi> <mrow> <mi> n </ mi> <mo> + </ mo> <mn> 1 </ mn> <mo>, </ mo> <mi> n </ mi> <mo> + </ mo> <mn> 1 </ mn> </ mrow> </msub> <mo>.</mo> </mrow> mrow> </ msub> <mo>. </ mo> </ mrow>
  2. 2.如权利要求1所述用户数据报协议报文的处理方法,其特征在于,步骤A之前还包括:根据最大传输单元的长度限制,通过检测待发送报文的长度获取报文的剩余可用长度。 2. The process of claim 1 User Datagram Protocol packets claim, wherein prior to step A further comprises: according to a length limited by the maximum transmission unit, to be transmitted by detecting the packet length of the packets acquired remaining available length.
  3. 3.如权利要求1所述用户数据报协议报文的处理方法,其特征在于,步骤A中还包括: 在待发送的报文中添加校验识别码,用于识别所述冗余校验块,并对报文的原始序列进行标识。 3. The process of claim 1 User Datagram Protocol packets claim, wherein step A further comprises: adding the check identifier in a message to be transmitted, for identifying the redundancy check block, and the original packet sequence identifier.
  4. 4.如权利要求3所述用户数据报协议报文的处理方法,其特征在于,步骤B中所述用户数据报协议报文接收端根据所述校验识别码获取报文的原始序列信息,以判断当前报文是否发生丢失。 4. The process of claim 3 User Datagram Protocol packets claim, wherein the step B User Datagram Protocol packet reception end identifier information according to the check packets acquired original sequence, in order to determine whether a packet is lost.
  5. 5.如权利要求1所述用户数据报协议报文的处理方法,其特征在于,步骤A具体包括: 在待发送的报文中,根据预设的长度或报文的剩余可用长度添加m个冗余校验块,分别对之前m个报文的数据部分进行冗余备份;所述冗余校验块与所述数据部分的长度相寸。 5. The process of claim 1 User Datagram Protocol packets claim, wherein step A comprises: in a message to be sent, according to a preset adding the m remaining available length packets or CRC block, respectively, prior to the m data packets redundant part; said CRC block length of the data portion with inch.
  6. 6.如权利要求5所述用户数据报协议报文的处理方法,其特征在于,步骤B具体包括: 判断当前报文发生丢失后,根据丢失报文之后第i个报文的第i个冗余校验块,直接恢复丢失报文的数据部分;其中 6. The processing method of the User Datagram Protocol packets claim, wherein step B comprises: determining the current packet loss occurs, after the packet loss according to the i-th packet in the i-th redundant check block, the data part of the direct recovery of lost packets; wherein
  7. 7. 一种用户数据报协议报文的封装方法,其特征在于,包括:在待发送的报文中添加冗余校验块后封装并发送报文,所述冗余校验块存储所述待发送报文之前多个报文的数据部分的冗余运算结果; 所述封装方法具体包括:在待发送的报文中,将报文的数据部分分为η个等长的数据块,同时根据预设的长度或报文的剩余可用长度添加冗余校验块,使所述冗余校验块与所述数据块的长度相等,并存储所述待发送报文之前η个报文中对应数据块的冗余运算的结果;所述冗余运算包括: 利用当前报文及之前η个报文的数据块及冗余校验块构造如下矩阵: 7. A method of packaging a User Datagram Protocol packets, wherein, comprising: after adding redundancy check blocks encapsulated in packets to be sent and sends the message, the redundancy check of said memory block a plurality of redundant calculation result to be transmitted before the packet data portion of the message; the packaging method comprises: in a message to be sent, the packet data portion is divided into η equal length data blocks, at the same time adding redundancy check block according to a preset length or the remaining usable length of the packet, so that the length of the data block and the parity redundancy block is equal, and stores the message before sending a packet to be η results redundant data block corresponding to operations; said redundancy operation comprising: using the current packet and the previous packet η a data block and a block redundancy check matrix is ​​constructed as follows: 其中,Ay,i = 1、2、· ·η+1,]_ = 1、2、· · η+1,为第i个报文的第j个块,每个报文的最后一个块为冗余校验块,且如果Ay为空,则Ay = O ; 运用异或算法获取结果: Αη+Ι,η+l = AU@ A2,2㊉..㊉An,n。 Wherein, Ay, i = 1,2, · · η + 1,] _ = 1,2, · · η + 1, the i-th block of the j-th packet, the last block of each packet CRC block, and if Ay is empty, Ay = O; or algorithm to obtain the exclusive use of the results: Αη + Ι, η + l = AU @ A2,2㊉..㊉An, n.
  8. 8.如权利要求7所述用户数据报协议报文的封装方法,其特征在于,所述封装方法之前还包括:根据最大传输单元的长度限制,通过检测待发送报文的长度获取报文的剩余可用长3度。 8. The packaging method of a User Datagram Protocol packets to claim 7, wherein, before the encapsulation method further comprising: according to a length limited by the maximum transmission unit, to be transmitted by detecting the packet length of the packet acquired 3 of the remaining usable length.
  9. 9.如权利要求7所述用户数据报协议报文的封装方法,其特征在于,所述封装方法还包括:在待发送的报文中添加校验识别码,用于识别所述冗余校验块,并对报文的原始序列进行标识。 9. The method of claim 7 package User Datagram Protocol packets claim, wherein the package further comprising: adding the check identifier in the message to be transmitted, for identifying the Redundancy inspection block, and the original packet sequence identifier.
  10. 10.如权利要求7所述用户数据报协议报文的封装方法,其特征在于,所述封装方法具体包括:在待发送的报文中,根据预设的长度或报文的剩余可用长度添加m个冗余校验块,分别对之前m个报文的数据部分进行冗余备份;所述冗余校验块与所述数据部分的长度相寸。 10. The method of claim 7 package User Datagram Protocol packets claim, characterized in that the packaging method comprises: in a message to be sent, according to a preset adding remaining available length packets or m redundant parity block, each prior to the m data packets redundant part; said CRC block length of the data portion with inch.
  11. 11. 一种用户数据报协议报文的解封装方法,其特征在于,包括:报文接收端判断当前报文发生丢失后,根据与丢失报文相关联的多个报文的数据部分和/或冗余校验块进行纠错运算,恢复丢失报文的数据部分; 所述解封装方法具体包括:判断当前报文发生丢失后,根据丢失报文之前n-1个和之后η个报文的冗余校验块及对应数据块进行纠错运算,恢复丢失报文的数据部分;所述纠错运算包括:利用所述丢失报文及之前n-1个和之后η个报文的数据块及冗余校验块构造如下矩阵 11. A method of decapsulation User Datagram Protocol packets, wherein, comprising: a packet reception end determines after the current packet is lost, the data portion of the plurality of packets associated with the packet loss and / CRC or block error correction operation, to recover the data portion of the packet loss; decapsulating said method comprises: determining when the current packet loss occurs before the packet loss according to the n-1 and a packet after the η the block and the corresponding redundancy check data block error correction operation, to recover the data portion of the packet loss; the error correction operation comprising: using the packet loss before and after the n-1 and a packet data η block and block redundancy check matrix is ​​constructed as follows 其中,B^,i = 1、2、· ·2η,」= 1、2、· · n+1,为第i个报文的第j个块,每个报文的最后一个块为冗余校验块,且如果By为空,则By = 0 ; 运用异或算法获取结果: Wherein, B ^, i = 1,2, · · 2η, "= 1,2, · · n + 1, the i-th packet in the j-th block, the last block of each packet is redundant check block, and if the empty By then By = 0; or algorithm to obtain the exclusive use of the results: .
  12. 12.如权利要求11所述用户数据报协议报文的解封装方法,其特征在于,所述判断当前报文发生丢失具体包括:报文接收端根据接收的报文中的校验识别码获取报文的原始序列信息,以判断当前报文是否发生丢失。 12. The method of claim 11 decapsulates User Datagram Protocol packets claim, wherein said determining the current packet loss occurs comprises: packet receiving end according to the check identifier of the received packet acquisition the original sequence information packet to determine whether the current packet is lost.
  13. 13.如权利要求11所述用户数据报协议报文的解封装方法,其特征在于,所述解封装方法具体包括:判断当前报文发生丢失后,根据丢失报文之后第i个报文的第i个冗余校验块,直接恢复丢失报文的数据部分;其中i = 1、2 · ·πι,πι为报文中对之前报文数据块进行冗余备份的冗余校验块的数目。 13. The method of decapsulating User Datagram Protocol packets according to claim 11, wherein said decapsulating method comprises: determining when the current packet loss occurs, after the packet loss according to the i-th packet the i-th redundancy check block, the data part of the direct recovery of lost packets; wherein i = 1,2 · · πι, πι redundant backup redundancy check block prior to the message data packets in blocks number.
  14. 14. 一种用户数据报协议报文的发送装置,包括报文发送模块,其特征在于,还包括报文封装模块;所述报文封装模块在报文中添加冗余校验块,并在封装完成后由所述报文发送模块向接收端发送报文;所述冗余校验块通过对所述待发送报文之前多个报文的数据部分进行冗余运算获得;所述报文封装模块添加冗余校验块具体包括:将报文的数据部分分为η个等长的数据块,同时根据预设的长度或报文的剩余可用长度添加冗余校验块,使所述冗余校验块与所述数据块的长度相等;对所述待发送报文之前η个报文的对应数据块进行冗余运算后将结果存储于所述冗余校验块;或在待发送的报文中,根据预设的长度或报文的剩余可用长度添加m个冗余校验块,所述冗余校验块与数据部分的长度相等;对所述待发送报文之前m个报文的数据部分分别进行冗余备份后 14. An apparatus for transmitting a user datagram protocol packets, including packet sending module, wherein the module further comprises packet encapsulation; the packet encapsulation module add redundancy check block in the packet, and after the completion of the package sent by the message sending module to a receiving end packets; redundant redundancy check calculation block obtained by the data portion of the plurality of packets to be transmitted before the message; the message adding redundancy check block encapsulation module comprises: a data portion of the packet is divided into η equal length blocks of data, while adding redundancy check block according to a preset length or the remaining usable length of the packet, the CRC block length equal to the data block; [eta] data block corresponding to a packet to be transmitted prior to the redundant packet after the operation result stored in said CRC block; or be packets, add the m blocks according to a predetermined redundancy check remaining available length, or packet, is equal to the length of the data block and the CRC portion; prior to the message m to be sent after a part of the data packets respectively redundancy 将结果存储于所述冗余校验块;所述对待发送报文之前η个报文的对应数据块进行冗余运算包括: 利用所述待发送报文及之前η个报文的数据块及冗余校验块构造如下矩阵: The results are stored in the CRC block; treat the data block corresponding to η packets before sending a packet redundancy operation comprising: using the data block and the packet to be transmitted before a message and η block redundancy check matrix is ​​constructed as follows: 其中,Ay,i = 1、2、· ·η+1,]_ = 1、2、· · η+l,为第i个报文的第j个块,每个报文的最后一个块为冗余校验块,且如果Ay为空,则Ay = O ;运用异或算法获取结果: Wherein, Ay, i = 1,2, · · η + 1,] _ = 1,2, · · η + l, j is the i-th block of packets, the last block of each packet CRC block, and if Ay is empty, Ay = O; or algorithm to obtain the exclusive use of the results:
  15. 15.如权利要求14所述用户数据报协议报文的发送装置,其特征在于,还包括报文长度检测模块;所述报文长度检测模块对所述待发送的报文长度进行检测,并根据检测结果及最大传输单元的长度限制得到所述报文的剩余可用长度。 14 15. The User Datagram Protocol packet transmission apparatus as claimed in claim, characterized by further comprising a packet length detector module; the packet length detector module packet length to be transmitted is detected, and to give the remaining usable length of the packet and the length of the detection result of the maximum transmission unit limit.
  16. 16.如权利要求14所述用户数据报协议报文的发送装置,其特征在于,所述报文封装模块进一步在待发送的报文中添加校验识别码,用于识别所述冗余校验块,并对报文的原始序列进行标识。 14 16. The User Datagram Protocol packet transmission apparatus as claimed in claim, wherein the packet encapsulation module identification code parity is further added in the message to be transmitted, for identifying the Redundancy inspection block, and the original packet sequence identifier.
  17. 17. 一种用户数据报协议报文的接收装置,包括报文接收模块,其特征在于,还包括报文序列检测模块及报文解析模块;所述报文序列检测模块,用于对所述报文接收模块接收的报文进行序列检测,以判断报文是否发生丢失;所述报文解析模块,根据与丢失报文相关联的多个报文的数据部分和/或冗余校验块进行纠错运算,恢复丢失报文的数据部分;所述报文解析模块进行纠错运算具体包括:根据丢失报文之前n-1个和之后η个报文的冗余校验块及对应数据块进行纠错运算, 恢复丢失报文的数据部分;或根据丢失报文之后第i个报文的第i个冗余校验块,直接恢复丢失报文的数据部分;其中i = 1、2 · · m,m为报文中对之前报文数据块进行冗余备份的冗余校验块的数目;所述根据丢失报文之前n-1个和之后η个报文的冗余校验块及对应数据块进行纠错运算包括 17. A receiving apparatus User Datagram Protocol packets, including packet receiving module, characterized by further comprising a packet sequence detector module and message parsing module; the packet sequence detector module for the message receiving module receives the packet sequence is detected, to judge whether the packet is lost; the message parsing module, and a plurality of packets according to packet loss associated data portion and / or redundant check block error correction operation for recovering data partially lost packet; packet parsing module for the correction operation comprises: η a block redundancy check packet and corresponding data packet according to the previous loss and after the n-1 block error correction operation, to recover data partially lost packet; packet loss after, or in accordance with the i-th packet in the i-th redundancy check block, the data part of the direct recovery of lost packets; wherein i = 1,2 · · m, m is the number of packets before the packet data block redundancy backup redundancy check block; said η a packet according to previous redundancy check packet loss and after the n-1 data block and the corresponding block error correction operation comprising 利用所述丢失报文及之前n-1个和之后η个报文的数据块及冗余校验块构造如下矩阵: And using the packet loss before and after the n-1 th η packet data block and a block redundancy check matrix is ​​constructed as follows: 其中,Biij, i = 1、2、· ·2η,j= 1、2、· · η+1,为第i个报文的第j个块,每个报文的最后一个块为冗余校验块,且如果By为空,则By = O ; 运用异或算法获取结果: Wherein, Biij, i = 1,2, · · 2η, j = 1,2, · · η + 1, the i-th packet in the j-th block, the last block of each packet Redundancy inspection block, and if the empty By then By = O; or algorithm to obtain the exclusive use of the results:
  18. 18.如权利要求17所述用户数据报协议报文的接收装置,其特征在于,所述报文序列检测模块根据报文中的校验识别码获取报文的原始序列信息,以判断报文是否发生丢失。 18. The receiving apparatus 17 of the user datagram protocol packets claim, wherein said sequence detector module obtains the packet sequence information of the original packet based on the packet identification code of the check, to determine whether the packet whether the loss occurred.
CN 200610150597 2006-10-24 2006-10-24 User datagram protocol message processing method and device CN1937631B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 200610150597 CN1937631B (en) 2006-10-24 2006-10-24 User datagram protocol message processing method and device

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
CN 200610150597 CN1937631B (en) 2006-10-24 2006-10-24 User datagram protocol message processing method and device
US12300965 US8127207B2 (en) 2006-10-24 2007-05-10 Method for processing packets, an apparatus for transmitting packets, and an apparatus for receiving packets
PCT/CN2007/070009 WO2008049341A1 (en) 2006-10-24 2007-05-10 Message processing method, message transmitting device and message receiving device

Publications (2)

Publication Number Publication Date
CN1937631A true CN1937631A (en) 2007-03-28
CN1937631B true CN1937631B (en) 2010-12-08

Family

ID=37954891

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 200610150597 CN1937631B (en) 2006-10-24 2006-10-24 User datagram protocol message processing method and device

Country Status (3)

Country Link
US (1) US8127207B2 (en)
CN (1) CN1937631B (en)
WO (1) WO2008049341A1 (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100061287A1 (en) * 2008-09-10 2010-03-11 Samsung Electronics Co., Ltd. Efficient coding schemes for retransmissions in multicast transmission
CN101494661B (en) * 2008-12-29 2012-07-04 深圳市同洲电子股份有限公司 Method and apparatus for reading data of protocol stack of transmission control protocol/internet protocol
CN101547144B (en) * 2008-12-29 2011-11-23 华为技术有限公司 Method and device for improving data transmission quality
CN101783772B (en) * 2010-03-23 2012-06-27 华为技术有限公司 Method, device and system for encapsulating and de-encapsulating messages

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6081907A (en) 1997-06-09 2000-06-27 Microsoft Corporation Data delivery system and method for delivering data and redundant information over a unidirectional network
US6243846B1 (en) 1997-12-12 2001-06-05 3Com Corporation Forward error correction system for packet based data and real time media, using cross-wise parity calculation
CN1399445A (en) 2001-07-25 2003-02-26 华为技术有限公司 Redundant transmission method of data message package of IP fax gateway user

Family Cites Families (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2576776B2 (en) 1993-11-10 1997-01-29 日本電気株式会社 Packet transmission method, packet transmission device
WO1997038549A1 (en) * 1996-04-05 1997-10-16 Universität Karlsruhe (Th) Method and apparatus for forward error correction of transmitted digital signals in networks
US6145109A (en) 1997-12-12 2000-11-07 3Com Corporation Forward error correction system for packet based real time media
WO1999030462A3 (en) 1997-12-12 1999-09-02 3Com Corp A forward error correction system for packet based real-time media
US5870412A (en) 1997-12-12 1999-02-09 3Com Corporation Forward error correction system for packet based real time media
US6151636A (en) 1997-12-12 2000-11-21 3Com Corporation Data and media communication through a lossy channel using signal conversion
US6170075B1 (en) 1997-12-18 2001-01-02 3Com Corporation Data and real-time media communication over a lossy network
US6771674B1 (en) 1998-12-28 2004-08-03 3Com Corporation Method and system for forward error correction based on parallel streams
US6996097B1 (en) * 1999-05-21 2006-02-07 Microsoft Corporation Receiver-driven layered error correction multicast over heterogeneous packet networks
US6785261B1 (en) 1999-05-28 2004-08-31 3Com Corporation Method and system for forward error correction with different frame sizes
US6732314B1 (en) 2000-05-26 2004-05-04 3Com Corporation Method and apparatus for L2TP forward error correction
CN100433614C (en) 2003-11-26 2008-11-12 上海贝尔阿尔卡特股份有限公司 A data packet recovery method
JP4349114B2 (en) * 2003-12-10 2009-10-21 ソニー株式会社 Transmitting apparatus and method, receiving apparatus and method, recording medium, and program
WO2006038054A1 (en) * 2004-10-06 2006-04-13 Nokia Corporation Packet transmission using error correction of data packets
JP5425397B2 (en) * 2004-12-02 2014-02-26 トムソン ライセンシングThomson Licensing Apparatus and method for adaptive forward error correction
US7610544B2 (en) * 2005-05-18 2009-10-27 Telegent Systems, Inc. Erasure generation in a forward-error-correcting communication system
JP4513725B2 (en) * 2005-11-09 2010-07-28 ソニー株式会社 Packet transmitting apparatus, a communication system and a program
EP2067318A4 (en) * 2006-07-25 2012-03-07 Thomson Licensing Recovery from burst packet loss in internet protocol based wireless networks using staggercasting and cross-packet forward error correction

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6081907A (en) 1997-06-09 2000-06-27 Microsoft Corporation Data delivery system and method for delivering data and redundant information over a unidirectional network
US6243846B1 (en) 1997-12-12 2001-06-05 3Com Corporation Forward error correction system for packet based data and real time media, using cross-wise parity calculation
CN1399445A (en) 2001-07-25 2003-02-26 华为技术有限公司 Redundant transmission method of data message package of IP fax gateway user

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Procedures for real-time Group 3 facsimile communicationoverIP networks.ITU-T Recommendation T.38.2004,15-16,32-36.
刘辉,刘玉贵,张权利.实时IP传真纠错协议UDPTL的应用.现代电信科技 8.2002,(8),15-19.

Also Published As

Publication number Publication date Type
WO2008049341A1 (en) 2008-05-02 application
US20090271685A1 (en) 2009-10-29 application
US8127207B2 (en) 2012-02-28 grant
CN1937631A (en) 2007-03-28 application

Similar Documents

Publication Publication Date Title
Casner et al. Compressing IP/UDP/RTP headers for low-speed serial links
US7032224B2 (en) Method for the secure and timely delivery of large messages over a distributed communication network
US7660245B1 (en) FEC architecture for streaming services including symbol-based operations and packet tagging
US7106742B1 (en) Method and system for link fabric error detection and message flow control
US20060077890A1 (en) Efficient source blocking algorithm for FEC for MBMS streaming
US20070204196A1 (en) Streaming and buffering using variable fec overhead and protection periods
US20080117911A1 (en) System and method for a software-based TCP/IP offload engine for digital media renderers
US20080304483A1 (en) System and method for achieving accelerated throughput
US20120099593A1 (en) Universal file delivery methods for providing unequal error protection and bundled file delivery services
US7151754B1 (en) Complete user datagram protocol (CUDP) for wireless multimedia packet networks using improved packet level forward error correction (FEC) coding
US20060221953A1 (en) Method and apparatus for blind checksum and correction for network transmissions
US20030169738A1 (en) System and method for protecting header information using dedicated CRC
US20040098655A1 (en) Rolling CRC scheme for improved error detection
JP2005136546A (en) Transmission apparatus and method, recording medium, and program
US7295555B2 (en) System and method for identifying upper layer protocol message boundaries
US7215683B2 (en) Method and apparatus for protecting against packet losses in packet-oriented data transmission
JPH11225161A (en) Data processing method and its device
Larzon et al. Efficient use of wireless bandwidth for multimedia applications
US20090138574A1 (en) Information processing and transportation architecture for data storage
US20080192774A1 (en) Method and system for aggregating multiple small packets in wireless communication
JP2007515113A (en) Operation method in a network in which a plurality of stations communicate over a shared medium
JP2002084239A (en) Media information distribution system and media information distribution method
US20080198781A1 (en) System and method for a software-based TCP/IP offload engine for implementing efficient digital media streaming over Internet protocol networks
US7080308B2 (en) Method and apparatus to perform error control
CN101119319A (en) Method, transmitting/receiving device and system against lost packet in data transmission process

Legal Events

Date Code Title Description
C06 Publication
C10 Request of examination as to substance
C14 Granted
ASS Succession or assignment of patent right

Owner name: ZHEJIANG UNIVIEW TECHNOLOGY CO., LTD.

Free format text: FORMER OWNER: HUASAN COMMUNICATION TECHNOLOGY CO., LTD.

Effective date: 20120221

C41 Transfer of the right of patent application or the patent right