WO2015192452A1 - Procédé de compression d'en-tête, procédé de décompression et dispositif - Google Patents

Procédé de compression d'en-tête, procédé de décompression et dispositif Download PDF

Info

Publication number
WO2015192452A1
WO2015192452A1 PCT/CN2014/084315 CN2014084315W WO2015192452A1 WO 2015192452 A1 WO2015192452 A1 WO 2015192452A1 CN 2014084315 W CN2014084315 W CN 2014084315W WO 2015192452 A1 WO2015192452 A1 WO 2015192452A1
Authority
WO
WIPO (PCT)
Prior art keywords
index
list item
compressed
list
compression
Prior art date
Application number
PCT/CN2014/084315
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 WO2015192452A1 publication Critical patent/WO2015192452A1/fr

Links

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

  • the present invention relates to the field of communications technologies, and in particular, to a header compression method, a decompression method, and an apparatus.
  • Background Art Due to limitations of physical conditions, a wireless link in a mobile communication system has a lower transmission rate and a higher bit error rate than a wired link.
  • Robust Header Compress (ROHC) technology has been introduced.
  • the core of ROHC is to transparently compress and decompress the information in the packet header between directly connected nodes by using information redundancy between packets of the traffic flow.
  • the ROHC technology is described by the Internet Engineering Task Force (IETF) RFC 3095 document, but the compression and decompression of the IP header is not defined in this document, so in June 2004, the ROHC working group had to be IP alone in RFC 3843.
  • the header compression decompression defines a framework, and in February 2007 the IETF revised the ROHC documentation, which is RFC 4815.
  • the Profile 0 identifies the IP packet flow using the uncompressed method.
  • the Profile 1 identifies the Real-time Transport Protocol (RTP).
  • the User Data Protocol User Data Protocol, UDP for short).
  • IP Internet Protocol
  • Profile 2 identifies the UDP/IP packet flow
  • Profile 3 identifies the ESP/IP (IP Encapsulated Security Payload ESP) packet flow.
  • the Profile 4 identifier compresses the IP packet stream.
  • CSRC Contributing Source
  • the basic principle of list compression is that the compressor allocates a unique index for each list item, maintains a translation table with all list items, and uses the list item index to identify each list item.
  • the list item index and the corresponding list item are simultaneously sent in the compressed list.
  • the compressor determines that the decompressor has obtained the mapping relationship between the index and the list item, the compressor can separately send the list index in the compressed package to represent Corresponding list items achieve the purpose of reducing the amount of data for compression.
  • RTP list compression is more complicated. In a real RTP packet stream compression transmission, there are thousands of list entries to be processed, so it takes a lot of memory space to maintain the correspondence between list items and indexes.
  • the embodiments of the present invention provide a method for compressing a header, a method and a device for decompressing, to solve at least the problem that the compression memory of the header is large, the compression speed is slow, and the compression efficiency is low.
  • the present invention provides a method for compressing a header, including: determining, if a corresponding index is configured for a list item to be compressed, whether there is an available idle index; in the case where there is no idle index, And selecting an index whose frequency is lower than the preset threshold from the index that has been configured for the list item, and replacing the list item corresponding to the index with the list item to be compressed, so that the list item to be compressed is replaced by The index is compressed.
  • the method further includes: determining whether a corresponding index needs to be configured for the list item to be compressed before determining whether there is an available idle index.
  • the determining whether to configure the corresponding index for the list item to be compressed includes: determining whether the list item to be compressed has been recorded in a translation table; wherein the translation table is used to record a list item Corresponding relationship with the index; in the case that the list item to be compressed has been recorded in the translation table, it is determined that the corresponding index is not required to be configured for the list item to be compressed; If the list item is not recorded in the translation table, it is determined that the corresponding index needs to be configured for the list item to be compressed.
  • the determining whether there is an available idle index includes: determining whether there is an idle index in the translation table that does not specify a corresponding list item.
  • the selecting, from the index configured for the list item, the index whose usage frequency is lower than the preset threshold includes: determining, in the process of compressing the list, the total number of uses of all indexes and the number of times of using each index separately; If the ratio of the number of individual uses to the total number of uses is lower than the preset threshold, determining that the frequency of use of the index corresponding to the number of individual uses is lower than the preset threshold.
  • the present invention further provides a method for decompressing a header, including: determining whether a received index is configured to be sequentially configured to a different list item; and the same index is sequentially configured to a different list item.
  • the present invention further provides a header compression apparatus, including: a compression determining unit, configured to determine whether there is an available idle index in a case where a corresponding index needs to be configured for a list item to be compressed; a unit, configured to: when the compression determining unit determines that there is no idle index, select an index whose usage frequency is lower than a preset threshold from an index that has been configured with the list item, and replace the list item corresponding to the index with the Compressing the list item to be compressed, so that the list item to be compressed is compressed by using the replaced index.
  • the compression determining unit is further configured to determine whether a corresponding index needs to be configured for the list item to be compressed before determining whether there is an available idle index.
  • the replacing unit is configured to: determine, in the process of compressing the list, the total number of uses of all indexes and the number of times of using each index separately; if the ratio of the single use times to the total usage times is low Determining, by the preset threshold, that the frequency of use of the index corresponding to the number of times of use is lower than a preset threshold, and replacing the list item corresponding to the index with the list item to be compressed, so that the list item to be compressed is The compression is performed using the replaced index.
  • the present invention provides a header decompression apparatus, including: a decompression determining unit, configured to determine whether a same index is sequentially configured to a different list item in a received compressed packet; and the decompression unit is configured to be in the When the decompression determining unit determines that the same index is sequentially configured to different list items, the compressed package is decompressed with the correspondence between the last configured list item and the index.
  • the header compression method, the decompression method, and the device provided by the embodiment of the present invention can select a usage frequency lower than a preset from an index that has been configured for a list item, if an index needs to be configured for the list item but no idle index exists.
  • FIG. 1 is a flow chart of a method for compressing a header according to an embodiment of the present invention
  • FIG. 2 is a flowchart of a method for decompressing a header according to an embodiment of the present invention
  • FIG. 4 is a detailed flowchart of a step in FIG. 3;
  • FIG. 1 is a flow chart of a method for compressing a header according to an embodiment of the present invention
  • FIG. 2 is a flowchart of a method for decompressing a header according to an embodiment of the present invention
  • FIG. 4 is a detailed flowchart of a step in FIG. 3
  • FIG. 5 is a schematic structural diagram of a header compression device according to an embodiment of the present invention. It is a schematic structural diagram of the meter decompression device provided by the embodiment of the present invention. DETAILED DESCRIPTION OF THE INVENTION The present invention will be described in detail below with reference to the accompanying drawings. It is understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
  • an embodiment of the present invention provides a method for compressing a header, including: S11. If a corresponding index needs to be configured for a list item to be compressed, determining whether there is an available idle index;
  • S12 in the case that there is no idle index, select an index whose frequency is lower than a preset threshold from the index that has been configured for the list item, and replace the list item corresponding to the index with the list item to be compressed,
  • the list item to be compressed is compressed by using the replaced index.
  • the header compression method provided by the embodiment of the present invention can select an index whose frequency is lower than a preset threshold from an index that has been configured for a list item, if an index needs to be configured for the list item but no idle index exists.
  • the list item corresponding to the index whose usage frequency is lower than the preset threshold is replaced with the list item to be compressed, so that the list item to be compressed is compressed by using the replaced index.
  • the reuse of the index can significantly reduce the memory space usage of the compression end, shortening the time taken for searching the translation table, thereby effectively improving the compression efficiency.
  • the header of each data packet may also be compressed and sent to the decompression end.
  • the method of the header compression can be used for the compression of the RTP data packet, and can also be used for other types of data packets that support the method of the header compression. The embodiment of the present invention does not limit this.
  • the correspondence between the list item and the index may be established first, and then the simple index is used to represent the more complicated list item data, so as to reduce the compression of the data amount.
  • the mapping relationship between the list item and the index may be established by using various methods, such as maintaining a mapping relationship table, or by using a certain mapping relationship function, etc., which is not limited by the embodiment of the present invention. .
  • the following describes the header compression method provided by the present invention in detail by taking the maintenance mapping table in the RTP packet compression process as an example.
  • a correspondence table between a list item and an index is maintained at the compression end, which is called a translation table.
  • the step S11 may further include determining whether a corresponding index needs to be configured for the list item to be compressed, which may be specifically implemented by the following steps: Determining whether a list item to be compressed in the data packet has been recorded in the translation table, wherein the translation table is configured to record a correspondence between the list item and the index; and the list item to be compressed is already in the If there is a record in the translation table, it is determined that the corresponding index is not configured for the list item to be compressed; if the list item to be compressed has no record in the translation table, it is determined that the The compressed list item is configured with the corresponding index.
  • the translation table has a limited capacity, and the number of packets sent is huge, so it is very possible to translate all the indexes in the table when the index items need to be configured for the list items to be compressed.
  • the corresponding list item has been configured. Therefore, in the case that the corresponding index is to be configured for the list item to be compressed, it is also required to determine whether there is an available idle index. Whether there is an idle index in the translation table that does not specify a corresponding list item. If there is such an idle index, the idle index may be configured to the list item to be compressed. For example, the list item may be written into an item in the translation table corresponding to the idle index.
  • the embodiment of the present invention further provides an index reusing mechanism, which removes the index that is not used for a long time or the index of the recently used frequency that is too low, and the original list item. And configure the index to the new list item to be compressed.
  • an index reusing mechanism which removes the index that is not used for a long time or the index of the recently used frequency that is too low, and the original list item. And configure the index to the new list item to be compressed.
  • selecting an index that uses the frequency lower than the preset threshold from the index that has been configured for the list item may specifically include: determining, in the process of compressing the list, respectively The total number of uses of all indexes and the number of times of use of each index; if the ratio of the number of individual uses to the total number of uses is lower than the preset threshold, determining that the index corresponding to the number of times of use is used less frequently The preset threshold.
  • an embodiment of the present invention further provides a method for decompressing a header. As shown in FIG. 2, the method includes:
  • the compressed package is decompressed by the correspondence between the last configured list item and the index.
  • the method for decompressing the header provided by the embodiment of the present invention can determine whether the same index is configured to be configured to different list items in the received compressed package, and in the case that the same index is sequentially configured to different list items, The compressed package can be decompressed by the correspondence between the last configured list item and the index, so that the use of the index can significantly reduce the use of the memory space on the decompression end, shortening the time taken for searching the translation table, thereby effectively improving the efficiency of the compression. .
  • a mapping table between the list item and the index may also be maintained on the decompression end, which is also called a translation table.
  • a data packet is sent, if the data packet includes only the index and there is no corresponding list item, it indicates that the list item has appeared before, and the corresponding record is already in the translation table, so The correspondence in the table is decompressed. If the data packet includes not only the index but also the list item corresponding to the index, it can be checked whether the index has been recorded in the translation table, and if so, the index and the list item sent this time are reused for the index.
  • the header compression method and the decompression method provided by the present invention will be described in detail below by way of specific embodiments. As shown in FIG. 3, the header compression method and the decompression method provided by the present invention include the following steps:
  • the compression end sets a storage list of the index of the list entry of the moderate size (for example, between 20 and 50); after receiving the data packet, analyzing whether the list item to be compressed in the data packet needs to be compressed by the profilel type, If yes, analyze whether the number of lists in the RTP domain is 0. If not, perform list compression. S302.
  • the list item to be sent is sequentially read. If the list item already exists in the translation table, it is not necessary to create a new mapping item in the translation table to configure an index for the list item, and use the translation table. The corresponding index compresses the list item; otherwise, S303 is performed.
  • the sequence number may be The index is configured to the latest list item to be compressed.
  • the list items in the subsequent data packets are compressed using the correspondence in the translation table in the subsequent compression process.
  • searching for a list entry stored in the compression end to find an index corresponding to the list item that has not been used for a long time (for example, the frequency of use is less than 1/3), and replacing the list item corresponding to the index with the latest list item to be compressed. ;
  • the decompression end decompresses according to the corresponding relationship in the translation table. If the data packet includes not only the index but also the list item corresponding to the index, it is checked whether the index has been recorded in the translation table; if yes, execute S308, if no, execute S309.
  • step S305 searching for a list item that has not been used for a long time can be performed as follows:
  • 5401 defines a global variable, which is used to mark the total number of times of all index indexes in the compression of the list item of the packet stream, and defines a single variable for each list item index, and respectively marks the number of times each index is used alone.
  • the traversal list sequentially acquires the number of times of using the index corresponding to each list item, and if the ratio of the number of used times to the total number of used times is lower than the preset threshold, determining the If the frequency of use of the index corresponding to the number of times of use is lower than the preset threshold, the eligible condition may be reused.
  • an embodiment of the present invention further provides a header compression apparatus, including: a compression determining unit 50, configured to configure a corresponding index for the list item to be compressed, Determining whether there is an available idle index; the replacing unit 52 is configured to, when the compression determining unit determines that there is no idle index, select an index whose usage frequency is lower than a preset threshold from an index that has been configured with the list item And replacing the list item corresponding to the index with the list item to be compressed, so that the list item to be compressed is compressed by using the replaced index.
  • a header compression apparatus including: a compression determining unit 50, configured to configure a corresponding index for the list item to be compressed, Determining whether there is an available idle index; the replacing unit 52 is configured to, when the compression determining unit determines that there is no idle index, select an index whose usage frequency is lower than a preset threshold from an index that has been configured with the list item And replacing the list item corresponding to the index with the list item to be compressed, so that the list item to be compressed is
  • the compression determining unit 50 can determine whether a corresponding index needs to be configured for the list item to be compressed, and if the index needs to be configured but there is no idle index, the replacement unit 52 can Selecting an index whose frequency is lower than the preset threshold from the index that has been configured with the list item, and replacing the list item corresponding to the index whose usage frequency is lower than the preset threshold with the list item to be compressed, so that the The list item to be compressed is compressed using the replaced index.
  • the reuse of the index can significantly reduce the memory space usage of the compression end, shortening the time taken for searching the translation table, thereby effectively improving the compression efficiency.
  • the compression determining unit 50 is further configured to determine whether it is necessary to configure a corresponding index for the list item to be compressed before determining whether there is an available idle index.
  • the compression determining unit 50 including a list item determining module, is configured to: determine whether the list item to be compressed has been recorded in a translation table; wherein the translation table is used to record a list item and an index Corresponding relationship; in the case that the list item to be compressed has been recorded in the translation table, it is determined that the corresponding index is not required to be configured for the list item to be compressed; In the case that there is no record in the translation table, it is determined that the corresponding index needs to be configured for the list item to be compressed.
  • the compression determining unit 50 further includes an index determining module, configured to determine, if the corresponding index is configured for the list item to be compressed, whether there is an idle index of the unspecified corresponding list item in the translation table.
  • the replacing unit 52 is configured to: determine, in the process of compressing the list, the total number of uses of all indexes and the number of times of using each index separately; if the ratio of the number of individual uses to the total number of uses is lower than a preset threshold, determining that the frequency of use of the index corresponding to the number of times of use is lower than a preset threshold, and replacing the list item corresponding to the index with the list item to be compressed, so that the list item to be compressed is utilized The replaced index is compressed.
  • the embodiment of the present invention further provides a header decompression apparatus, including: a decompression determining unit 60, configured to determine whether the same index exists in the received compressed packet and is configured to different list items in sequence. ;
  • the decompression unit 62 is configured to decompress the compressed package with the correspondence between the last configured list item and the index, in a case where the decompression determining unit determines that the same index is sequentially configured to different list items.
  • the decompression determining unit 60 can determine whether the same index in the received compressed packet is configured to be different to the list item, and the same index is sequentially configured to different list items.
  • the decompressing unit 62 can decompress the compressed package by using the mapping relationship between the last configured list item and the index, so that the use of the index can significantly reduce the memory space usage of the decompressing end, thereby shortening the time taken for searching the translation table. Effectively improve the efficiency of understanding pressure.
  • a correspondence table between list items and indexes can also be maintained, which is also called a translation table.
  • the data packet includes not only the index but also the list item corresponding to the index, it can be checked whether the index has been recorded in the translation table, and if so, the index and the list item sent this time are reused for the index.
  • the corresponding relationship between the newly transmitted index and the list item should be replaced with the corresponding relationship already recorded in the translation table, and the subsequent data packet is decompressed with the new corresponding relationship until a new index and list item are added. Send it together and update the new index correspondence.
  • a header compression method, a decompression method, and an apparatus provided by an embodiment of the present invention have the following beneficial effects:
  • the reuse of an index can significantly reduce the memory space usage of the compression end, and shorten the cost of searching for a translation table.

Abstract

La présente invention se rapporte au domaine technique des communications. L'invention concerne un procédé de compression d'en-tête, un procédé de décompression et un dispositif, destinés à résoudre les problèmes, rencontrés dans l'état antérieur de la technique, de la forte consommation de mémoire par la compression des en-tête, la faible vitesse de compression et le faible rendement de compression; le procédé de compression d'en-tête comportant les étapes consistant à: configurer un index correspondant pour un élément de liste à compresser en déterminant s'il existe d'éventuels index au repos; et si ce n'est pas le cas, sélectionner, parmi les index configurés pour les éléments de liste, un index dont la fréquence d'utilisation est inférieure à un seuil prédéfini, et remplacer l'élément de liste correspondant à l'index par l'élément de liste à compresser, de telle façon que l'élément de liste à compresser soit compressé en utilisant l'index remplacé.
PCT/CN2014/084315 2014-06-17 2014-08-13 Procédé de compression d'en-tête, procédé de décompression et dispositif WO2015192452A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410270492.6A CN105208596A (zh) 2014-06-17 2014-06-17 一种表头压缩方法、解压方法及装置
CN201410270492.6 2014-06-17

Publications (1)

Publication Number Publication Date
WO2015192452A1 true WO2015192452A1 (fr) 2015-12-23

Family

ID=54934746

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/084315 WO2015192452A1 (fr) 2014-06-17 2014-08-13 Procédé de compression d'en-tête, procédé de décompression et dispositif

Country Status (2)

Country Link
CN (1) CN105208596A (fr)
WO (1) WO2015192452A1 (fr)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109257772A (zh) * 2017-07-13 2019-01-22 普天信息技术有限公司 一种rtp数据的发送、接收方法及用户设备

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102156727A (zh) * 2011-04-01 2011-08-17 华中科技大学 一种采用双指纹哈希校验的重复数据删除方法
CN102508784A (zh) * 2011-11-02 2012-06-20 杭州海康威视数字技术股份有限公司 视频监控设备中闪存卡的数据存储方法及其系统
CN102683149A (zh) * 2011-02-16 2012-09-19 株式会社岛津制作所 质量分析数据处理方法和质量分析数据处理系统
CN103260187A (zh) * 2012-02-20 2013-08-21 华为技术有限公司 内容编码预同步的方法、设备及系统

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5778427A (en) * 1995-07-07 1998-07-07 Sun Microsystems, Inc. Method and apparatus for selecting a way of a multi-way associative cache by storing waylets in a translation structure
CN100589441C (zh) * 2006-10-13 2010-02-10 中兴通讯股份有限公司 一种应用于端到端链路传输中ip报头压缩的方法
CN101984621B (zh) * 2010-10-25 2014-09-10 中兴通讯股份有限公司 鲁棒性头压缩中一种提高列表压缩效率的方法及装置
CN102024047B (zh) * 2010-12-14 2013-05-29 青岛普加智能信息有限公司 数据检索方法及装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102683149A (zh) * 2011-02-16 2012-09-19 株式会社岛津制作所 质量分析数据处理方法和质量分析数据处理系统
CN102156727A (zh) * 2011-04-01 2011-08-17 华中科技大学 一种采用双指纹哈希校验的重复数据删除方法
CN102508784A (zh) * 2011-11-02 2012-06-20 杭州海康威视数字技术股份有限公司 视频监控设备中闪存卡的数据存储方法及其系统
CN103260187A (zh) * 2012-02-20 2013-08-21 华为技术有限公司 内容编码预同步的方法、设备及系统

Also Published As

Publication number Publication date
CN105208596A (zh) 2015-12-30

Similar Documents

Publication Publication Date Title
CN103825869A (zh) 以太网报文头的压缩及解压缩方法、压缩及解压缩设备
CN102882879B (zh) 一种适用于卫星信道的ip数据压缩传输方法
JP4317403B2 (ja) ヘッダ圧縮装置及びヘッダ圧縮方法
US9900259B2 (en) Data transmission method and related apparatus to compress data to be transmitted on a network
EP2472813B1 (fr) Procédé et dispositif de compression et de décompression de paquets à protocole de datagramme
CN102118792B (zh) 一种传输数据包的方法及装置
US20170078916A1 (en) Data processing method and apparatus
CN100433841C (zh) 用于因特网协议第6版移动子协议MIPv6的鲁棒性头标压缩／解压方法
US9392082B2 (en) Communication interface and method for robust header compression of data flows
US8418037B2 (en) Method and device for decoding by using window-based least significant bits in robust header compression
US20200187052A1 (en) Systems and methods for segmentation and reassembly of data frames in 802.11 wireless local area networks
WO2012051883A1 (fr) Procédé et dispositif de réutilisation de contexte en compression d'en-têtes robuste
US10171634B2 (en) State transition method and apparatus based on ROHC, and storage medium
CN102694730B (zh) 一种并行处理的方法及装置
WO2015192452A1 (fr) Procédé de compression d'en-tête, procédé de décompression et dispositif
JP2005124077A (ja) 無線ｌａｎシステム、その通信制御方法、送信局および受信局
CN112335203B (zh) 处理局域网诊断数据
WO2015101152A1 (fr) Procédé pour extraire des données utiles de transmission d'un codage de transfert en blocs http à base de dfa
EP2190163B1 (fr) Procédé de réparation d'un décodage de bits de poids faible windows dans une compression d'entête robuste
CN103428181A (zh) 一种应用于IP over DVB的UDP报文传输优化方法
WO2013102336A1 (fr) Procédé et dispositif pour la configuration d'un canal rohc
Woo et al. Performance analysis of robust header compression over mobile wimax
WO2017118273A1 (fr) Procédé et dispositif permettant de transmettre et de recevoir des informations d'estampille temporelle
CN103746930B (zh) 一种窄带串行链路tcp报文头部压缩的改进方法
JP2016174287A (ja) Ｔｃｐ制御装置、ｔｃｐ制御装置の制御方法およびｔｃｐ制御装置のプログラム

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: 14895124

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: 14895124

Country of ref document: EP

Kind code of ref document: A1