WO2016101453A1 - Procédé et dispositif de compression d'horodateur - Google Patents

Procédé et dispositif de compression d'horodateur Download PDF

Info

Publication number
WO2016101453A1
WO2016101453A1 PCT/CN2015/077115 CN2015077115W WO2016101453A1 WO 2016101453 A1 WO2016101453 A1 WO 2016101453A1 CN 2015077115 W CN2015077115 W CN 2015077115W WO 2016101453 A1 WO2016101453 A1 WO 2016101453A1
Authority
WO
WIPO (PCT)
Prior art keywords
difference
data packet
stride
current
equal
Prior art date
Application number
PCT/CN2015/077115
Other languages
English (en)
Chinese (zh)
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
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2016101453A1 publication Critical patent/WO2016101453A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information

Definitions

  • This paper relates to Robust Header Compression (ROHC) technology, especially a method and device for compressing time stamps.
  • ROHC Robust Header Compression
  • ROHC technology is a general-purpose compression technology based on IP. It is mainly used in the air interface of wireless transmission to improve the resource utilization of the air interface.
  • the ROHC technology can compress the Voice over Internet Protocol (VoIP) header to a minimum of one byte, and the bandwidth utilization rate is generally over 90%.
  • VoIP Voice over Internet Protocol
  • the ROHC technology is mainly implemented by the following rules: many fields in the data packet header (especially the continuous packet header) of the same stream are unchanged, or many domains are not randomly changed, but are regularly changed.
  • Timestamp in the RTP protocol (TS, Time) when compressing packets of the Internet Protocol (IP)/User Datagram Protocol (UDP)/Real-time Transport Protocol (RTP) type
  • IP Internet Protocol
  • UDP User Datagram Protocol
  • RTP Real-time Transport Protocol
  • the Stamp field is a very important field to be compressed.
  • a compressed RTP timestamp (Scaled RTP Timestamp) method is currently provided in the RFC3095 protocol. The idea of this method is that the TS values of two consecutive RTP packet headers are usually not arbitrarily increased, but each time a value is added, that is, a timestamp multiple (TS_STRIDE, Timestamp stride).
  • the sampling frequency of speech is usually 8 kilohertz (kHz), and one frame of data contains 20 milliseconds (ms) of speech data.
  • a voice frame is transmitted in an RTP data packet.
  • a frame is often sent into several RTP packets.
  • the TTP values of the RTP packet headers belonging to the same frame are the same.
  • Embodiments of the present invention provide a method and apparatus for compressing a timestamp, which can improve compression efficiency.
  • a method for compressing a timestamp comprising: compressing, by a compression end, a first difference between a timestamp TS of an Nth data packet and an N-1th data packet;
  • the compression end determines that the calculated first difference is 0, or determines that the calculated first difference is not 0, and determines that the calculated first difference is equal to the current timestamp multiple TS_STRIDE, and the Nth
  • the compressed time stamp TS_SCALED of the data packet is sent to the decompressed end in the Nth data packet;
  • N is a positive integer greater than or equal to 2.
  • the method further includes: updating The current TS_STRIDE, the TS of the Nth data packet and the updated current TS_STRIDE are included in the Nth data packet and sent to the decompression end.
  • the method further includes:
  • the compression end calculates a second difference between the N-1th data packet and the TS of the N-2th data packet;
  • the compression end determines that the first difference value is not equal to the second difference value, and the TS_SCA LED of the Nth data packet is included in the Nth data packet and sent to the decompression end.
  • the method further includes:
  • the compression end updates the current TS_STRIDE, and the TS of the Nth data packet and the updated current TS_STRIDE are included in the Nth data packet and sent to the decompression end.
  • a device for compressing time stamps comprising:
  • a calculation module configured to calculate a first difference between the timestamp TS of the Nth data packet and the N-1th data packet
  • the determining module is configured to determine that the calculated first difference is 0; or, determine that the calculated first difference is not 0, and determine that the calculated first difference is equal to the current timestamp multiple TS_STRIDE,
  • the compressed time stamp TS_SCALED of the Nth data packet is included in the Nth data packet and sent to the decompression end;
  • N is a positive integer greater than or equal to 2.
  • the determining module is further configured to:
  • the determining module is further configured to:
  • the TS_SCALED of the Nth data packet is included in the Nth data packet and sent to the decompression terminal.
  • the determining module is further configured to:
  • the embodiment of the invention further provides a computer readable storage medium storing program instructions, which can be implemented when the program instructions are executed.
  • the compression end calculates the Nth data packet and the N-1th a first difference between the time stamps TS of the data packet; the compression end determines that the calculated first difference value is 0; or, determines that the calculated first difference value is not 0, and determines the calculated first A difference is equal to the current TS_STRIDE, and the TS_SCALED of the Nth packet is included in the Nth data packet and sent to the decompression terminal; wherein N is a positive integer greater than or equal to 2.
  • the compressed end has a first difference of 0; or, when the first difference is not 0, and the first difference is equal to the current TS_STRIDE, the compressed TS of the Nth packet is obtained. It is included in the Nth packet and sent to the decompression end, which improves the compression efficiency.
  • FIG. 1 is a flowchart of a method for compressing a timestamp according to an embodiment of the present invention
  • FIG. 2 is a schematic structural diagram of a device for compressing a time stamp according to Embodiment 2 of the present invention.
  • this embodiment provides a method for compressing a timestamp, including:
  • Step 100 The compression end calculates a first difference between the Nth data packet and the TS of the N-1th data packet.
  • N is a positive integer greater than or equal to 2.
  • the data packet may be a data packet containing an RTP header.
  • Step 101 The compression end determines that the calculated first difference value is 0. Alternatively, it is determined that the calculated first difference value is not 0, and it is determined that the calculated first difference value is equal to the current TS_STRIDE, and the Nth The TS_SCALED (compressed timestamp) of each packet is sent to the decompressed end in the Nth packet.
  • TS_SCALED compressed timestamp
  • the compression end determines that the calculated first difference is not 0, and determines that the calculated first difference is not equal to the current TS_STRIDE, and N is 2, the current TS_STRIDE is updated, and the Nth is The TS of the packet and the updated TS_STRIDE are included in the Nth The data packet is sent to the decompression end.
  • the step further includes: the compression end calculates a second difference between the N-1th data packet and the TS of the N-2th data packet; and the compression end determines the first difference value and The second difference is not equal, and the TS_SCALED of the Nth packet is included in the Nth data packet and sent to the decompression terminal.
  • the compression end determines that the first difference is not 0, and determines that the first difference is not equal to the current TS_STRIDE, and determines that the first difference is not an integer multiple of the current TS_STRIDE; or determines the first difference and the first
  • the compression end updates the current TS_STRIDE, and the TS of the Nth data packet and the updated current TS_STRIDE are included in the Nth data packet and sent to the decompression end.
  • the TS_SCALED of the Nth packet is included in the Nth data packet and sent to the compressed end.
  • the decompression end improves compression efficiency. For example, in a video service, since the TS frames of the data packets belonging to the same frame are the same, the TS value calculated by the decompression end according to the formula (2) is correct, and the data is not required to be used every time. The TS of the packet is sent to the decompression terminal, thereby improving the compression efficiency.
  • the compression end sends the TS of the first RTP data packet together with the TS_STRIDE (the TS equal to the first RTP data packet) to the decompression end when transmitting the first RTP data packet.
  • TS_OFFSET can be calculated by using TS to TS_STRIDE.
  • the compression end calculates the TS_SCALED of the Nth RTP data packet according to the TS and TS_STRIDE of the Nth RTP data packet, and calculates the Nth RTP data packet by using the formula (1).
  • the TS_SCALED is sent to the decompressor as the timestamp of the Nth RTP packet to save the code stream.
  • N is a positive integer greater than or equal to 2.
  • TS_SCALED is a compressed TS.
  • the TS_SCALED of the Nth RTP packet is obtained by rounding the ratio between the TS of the Nth RTP packet and the TS_STRIDE.
  • the decompressing end After receiving the Nth RTP data packet, the decompressing end calculates the TS value of the Nth RTP data packet according to formula (2).
  • TS_OFFSET is the offset value of TS.
  • the second packet, the compressed end receives the second RTP data packet, and calculates the difference between the second RTP data packet and the TS of the first RTP data packet is 160, which is equal to the current TS_STRIDE value, and considers the TS_STRIDE value.
  • the TS_SCALED value of the second RTP packet is equal to 2;
  • the third package is the same as the second package
  • the compressed end receives the fourth RTP data packet, and the difference between the TS of the fourth RTP data packet and the third RTP data packet is 320, which is twice the current TS_STRIDE, and the calculation is performed.
  • the difference between the three RTP packets and the TS of the second RTP packet is 160, the two differences are not equal, and the current TS_STRIDE is considered to have not changed, and the TS_SCALED value of the fourth RTP packet is equal to 5;
  • the fifth packet the compression side calculates the difference between the fifth RTP data packet and the TS of the fourth RTP data packet is 160, which is equal to the current TS_STRIDE, and considers that the current TS_STRIDE is unchanged, and the fifth RTP data packet is The TS_SCALED value is equal to 6;
  • the sixth packet, the compression end calculates the sixth RTP data packet and the TS of the fifth RTP data packet
  • the difference is 320, which is twice the current TS_STRIDE.
  • the difference between the TS of the fifth RTP packet and the fourth RTP packet is 160, and the two differences are not equal.
  • the TS_STRIDE value is considered not to occur.
  • Change, the TS_SCALED value of the sixth RTP packet is equal to 8;
  • the compression end calculates the difference between the seventh RTP packet and the TS of the sixth RTP packet, which is 320, which is twice the current TS_STRIDE, and calculates the sixth RTP packet and the fifth.
  • the TS difference of the RTP packets is also 320. It is considered that the TS_STRIDE value has changed, the TS_STRIDE value is updated to 320, and the TS_SCALED value of the TS of the seventh RTP packet is equal to 10.
  • the probability that the number of consecutive packet drops (greater than 1) is the same is small. That is, the first time N (N is greater than 1) packet is lost, after receiving a few packets, and then N packets in succession, this probability is small.
  • the TS_STRIDE value update method proposed by the embodiment of the present invention can correctly recognize that the TS_STRIDE value changes due to packet loss, and does not update the TS_STRIDE value.
  • TS_STRIDE value that is an integral multiple of the TS difference, but it does change.
  • the normal voice packet transmission interval is 20ms
  • the quiet packet delivery interval is 160ms, which is 8 times that of the normal packet. Therefore, the TS interval of the silent period is 8 times that of the normal time.
  • the TS_STRIDE value is updated, which ensures that the TS_STRIDE value is quickly updated to the actual TS_STRIDE value.
  • each video frame is divided into five RTP packets, and the TS values of the five RTP packets are the same.
  • the TS value of each frame changes as follows: 3000 ⁇ 1, 3000 ⁇ 2, 3000 ⁇ 3, 3000 ⁇ 4.
  • the difference between the TS of the sixth RTP packet and the fifth RTP packet is calculated as 3000, and since the difference is equal to the current TS_STRIDE, the TS_SCLALED value of the sixth RTP packet is 2;
  • the seventh to tenth packets the difference between the current RTP data packet and the TS of the previous RTP data packet is 0, the current TS_STRIDE remains unchanged, and the seventh RTP data packet is to the tenth RTP data packet.
  • the TS_SCALED value is 2;
  • the difference between the TS of the eleventh RTP packet and the tenth RTP packet is calculated as 3000, since the difference is equal to the current TS_STRIDE, the TS_SCLALED value of the eleventh RTP packet Is 3;
  • the terminal Assume that the packet loss rate is 1%, and one packet is lost each time.
  • the terminal generates a voice packet every 20 ms, and the TS value of each voice packet is incremented by the TS_STRIDE value.
  • the terminal sends a total of 3000 (10 ⁇ 60 ⁇ 5) packets, and the lost is 30 (3000 ⁇ 1%).
  • the voice packet type is UO0, and the packet length is 1 byte.
  • the voice packet type is UOR2+EXT3
  • the packet length is 13 bytes.
  • the TS_STRIDE value will jump 60 (10 ⁇ 2) within 10 minutes. Each time the packet is lost, the TS_STRIDE value will double twice. When the packet is not lost, the TS_STRIDE value will be Change back) times.
  • the embodiment provides an apparatus for compressing a timestamp, including a computing module 10 and a determining module 11, wherein:
  • the calculating module 10 is configured to calculate a first difference between the Nth data packet and the timestamp TS of the N-1th data packet;
  • the determining module 11 is configured to determine that the calculated first difference is 0; or, determine that the calculated first difference is not 0, and determine that the calculated first difference is equal to the current TS_STRIDE,
  • the TS_SCALED of the N data packets is included in the Nth data packet and sent to the decompression terminal;
  • N is a positive integer greater than or equal to 2.
  • the determining module 11 is further configured to:
  • the determining module 11 is further configured to:
  • the determining module 11 is further configured to:
  • the compressed end has a first difference of 0; or, when the first difference is not 0, and the first difference is equal to the current TS_STRIDE, the compressed TS of the Nth packet is obtained. It is included in the Nth packet and sent to the decompression end, which improves the compression efficiency.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention concerne un procédé et un dispositif de compression d'un horodateur. Le procédé comprend les étapes suivantes : une extrémité de compression calcule une première valeur de différence entre des horodateurs (TS) d'un Nème paquet de données et une N-1ème paquet de données ; l'extrémité de compression détermine que la première valeur de différence calculée est zéro ou détermine que la première valeur de différence calculée n'est pas zéro, et détermine que la première valeur de différence calculée est égale à un intervalle d'horodateur actuel (TS_STRIDE), et contient l'horodateur compressé (TS_SCALED) du Nème paquet de données dans Nème paquet de données, et les transmet à une extrémité de décompression, dans lequel N est un nombre entier positif supérieur ou égal à deux.
PCT/CN2015/077115 2014-12-22 2015-04-21 Procédé et dispositif de compression d'horodateur WO2016101453A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410810637.7A CN105791228B (zh) 2014-12-22 2014-12-22 一种压缩时间戳的方法和装置
CN201410810637.7 2014-12-22

Publications (1)

Publication Number Publication Date
WO2016101453A1 true WO2016101453A1 (fr) 2016-06-30

Family

ID=56149062

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/077115 WO2016101453A1 (fr) 2014-12-22 2015-04-21 Procédé et dispositif de compression d'horodateur

Country Status (2)

Country Link
CN (1) CN105791228B (fr)
WO (1) WO2016101453A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020119718A1 (fr) * 2018-12-14 2020-06-18 华为技术有限公司 Procédé et dispositif de décompression de paquets de données
CN118055165A (zh) * 2024-04-16 2024-05-17 上海移芯通信科技股份有限公司 时间戳信息处理方法、装置、计算机设备及存储介质

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108737349B (zh) * 2017-04-24 2020-08-28 大唐移动通信设备有限公司 一种语音数据包的处理方法及装置
CN109219078B (zh) * 2017-07-04 2020-07-28 大唐移动通信设备有限公司 语音丢包处理方法及装置
CN108021650A (zh) * 2017-11-30 2018-05-11 冶金自动化研究设计院 一种时序数据的高效存储和读取系统
CN111181569B (zh) * 2019-12-31 2021-06-15 山东信通电子股份有限公司 一种时序数据的压缩方法、装置以及设备

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101271720A (zh) * 2008-04-22 2008-09-24 中兴通讯股份有限公司 一种手机流媒体音视频的同步方法
CN101674315A (zh) * 2009-10-20 2010-03-17 中兴通讯股份有限公司 一种时间戳压缩、解压缩的方法及装置
CN101711043A (zh) * 2009-12-02 2010-05-19 中兴通讯股份有限公司 一种鲁棒性头压缩中销毁压缩上下文的方法和装置
CN102752669A (zh) * 2011-04-19 2012-10-24 中国电信股份有限公司 多通道实时流媒体文件的传送处理方法与系统、接收装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101271720A (zh) * 2008-04-22 2008-09-24 中兴通讯股份有限公司 一种手机流媒体音视频的同步方法
CN101674315A (zh) * 2009-10-20 2010-03-17 中兴通讯股份有限公司 一种时间戳压缩、解压缩的方法及装置
CN101711043A (zh) * 2009-12-02 2010-05-19 中兴通讯股份有限公司 一种鲁棒性头压缩中销毁压缩上下文的方法和装置
CN102752669A (zh) * 2011-04-19 2012-10-24 中国电信股份有限公司 多通道实时流媒体文件的传送处理方法与系统、接收装置

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020119718A1 (fr) * 2018-12-14 2020-06-18 华为技术有限公司 Procédé et dispositif de décompression de paquets de données
CN118055165A (zh) * 2024-04-16 2024-05-17 上海移芯通信科技股份有限公司 时间戳信息处理方法、装置、计算机设备及存储介质

Also Published As

Publication number Publication date
CN105791228A (zh) 2016-07-20
CN105791228B (zh) 2019-12-03

Similar Documents

Publication Publication Date Title
WO2016101453A1 (fr) Procédé et dispositif de compression d'horodateur
US9055034B2 (en) Backward looking robust header compression receiver
CN101331738B (zh) 用于改进稳健标头压缩效率的系统和方法
US20100278196A1 (en) Method and apparatus for enhancing RoHC performance when encountering silence suppression
US9392082B2 (en) Communication interface and method for robust header compression of data flows
EP2642788A1 (fr) Procédé et dispositif destinés à améliorer la robustesse d'un message de mise à jour de contexte dans une compression d'en-tête robuste
US9264333B1 (en) Checksum trailer in timing protocols
US20020191691A1 (en) Payload header suppression including removal of fields that vary in known patterns
JP2003008644A (ja) パケット送受信装置及びパケット伝送方法
US7613185B2 (en) Packet header compression for lossy channels
CN109219078B (zh) 语音丢包处理方法及装置
CN107534589A (zh) 去抖动缓冲器更新
JP2002124989A (ja) データパケット転送方法および装置
Tömösközi et al. Performance evaluation and comparison of RObust Header Compression (ROHC) ROHCv1 and ROHCv2 for multimedia delivery
CN104320810B (zh) 一种头压缩方法、装置及解压缩方法、装置
WO2016147791A1 (fr) Dispositif de communication, système de calcul de bande disponible, procédé et programme de calcul de bande disponible
WO2017118273A1 (fr) Procédé et dispositif permettant de transmettre et de recevoir des informations d'estampille temporelle
WO2015101152A1 (fr) Procédé pour extraire des données utiles de transmission d'un codage de transfert en blocs http à base de dfa
Tömösközi et al. Performance evaluation of network header compression schemes for UDP, RTP and TCP
CN114979094B (zh) 一种基于rtp的数据传输方法、装置、设备和介质
CN108737349B (zh) 一种语音数据包的处理方法及装置
Tömösközi et al. Performance evaluation and implementation of IP and robust header compression schemes for TCP and UDP traffic in the wireless context
US8644314B2 (en) Protocol and method of VIA field compression in session initiation protocol signaling for 3G wireless networks
CN102761393A (zh) 数据报文处理方法及装置
CN116155876A (zh) 数据处理方法及装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15871529

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15871529

Country of ref document: EP

Kind code of ref document: A1