WO2016145764A1 - 一种丢包控制方法及装置 - Google Patents

一种丢包控制方法及装置 Download PDF

Info

Publication number
WO2016145764A1
WO2016145764A1 PCT/CN2015/085952 CN2015085952W WO2016145764A1 WO 2016145764 A1 WO2016145764 A1 WO 2016145764A1 CN 2015085952 W CN2015085952 W CN 2015085952W WO 2016145764 A1 WO2016145764 A1 WO 2016145764A1
Authority
WO
WIPO (PCT)
Prior art keywords
packet
packet loss
threshold
data packet
continuous
Prior art date
Application number
PCT/CN2015/085952
Other languages
English (en)
French (fr)
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 WO2016145764A1 publication Critical patent/WO2016145764A1/zh

Links

Images

Definitions

  • This application relates to, but is not limited to, the field of mobile communications.
  • ROHC Robot Head Compression Protocol
  • IP Internet Protocol
  • LTE Long Term Evolution
  • the ROHC compression process includes two working state machines: a compression state machine and a decompression state machine.
  • the three compression states of the ROHC compression side are from low to high: IR, FO and SO.
  • the compression end starts to work at the lowest state IR and then gradually transitions to a high state.
  • the compression end has sufficient capacity to determine that the decompressed end has sufficient context information to decompress the compressed package, the compressed end will remain operating at the highest state SO.
  • the state of the compression end will be reduced to synchronize the context of the compression end and the decompression end, so that the compression efficiency of the ROHC is also greatly increased. reduce.
  • PDCP Packet Data Convergence Protocol
  • Discard is a packet loss function implemented by the PDCP layer to prevent data backlog.
  • the packet loss mechanism is roughly classified into two types. One is based on the tail drop mechanism. When congestion or buffer overflow occurs, simply discard the subsequent packets that are nowhere to be put; the other is a timer or timestamp-based discarding mechanism. This method can be set by setting the timer threshold. It plays a role in preventing buffer overflow and congestion in advance, and discards packets exceeding the threshold by scanning the cache backlog time in real time. These two mechanisms do not consider the impact of packet loss on ROHC compression efficiency. In the case of network congestion, continuous packet loss will inevitably occur. In this case, the key segment in the packet will inevitably appear.
  • This paper provides a packet loss control method and device, which can solve the problem of reducing ROHC compression efficiency under the condition that the number of consecutive packet loss is large.
  • a packet loss control method includes: parsing a received data packet, determining a type of a decision algorithm used by the data packet, determining a continuous packet loss threshold according to the determined type of the decision algorithm; and continuously counting the number of consecutive packet loss, if the statistics are If the number of lost packets is less than the continuous packet loss threshold, the current data packet is discarded. If the number of lost packets is not less than the continuous packet loss threshold, the current data packet is skipped.
  • parsing the received data packet determining a type of the decision algorithm used by the data packet, and determining a continuous packet loss threshold according to the determined type of the decision algorithm, including: filtering according to the type of the decision algorithm used by the data packet
  • the key segment of the ROHC state transition of the robust header compression protocol determines the consecutive packet loss threshold according to the hopping threshold of the filtered key segment.
  • parsing the received data packet determining a type of the decision algorithm used by the data packet, and determining a continuous packet loss threshold according to the determined type of the decision algorithm, including: determining whether the data packet uses a decision supporting the real-time transport protocol RTP service Algorithm type 1, if yes, the threshold value of the field with the smallest value among the hopping thresholds of the key fields IPID, TS, and SN is the continuous packet loss threshold. If not, the key segment IPID field is taken.
  • the hop threshold is the continuous packet loss threshold.
  • the number of consecutive lost packets is counted in real time. If the number of lost packets is less than the continuous packet loss threshold, the current data packet is discarded. If the number of lost packets is not less than the continuous packet loss threshold, the packet is skipped.
  • the current data packet includes: scanning all the remaining packets in the buffer from the head of the queue, and obtaining the packet buffering time according to the difference between the current time and the arrival time of the packet. If the packet buffering time exceeds the set threshold, the packet will be buffered. If the number of consecutive packet loss is equal to the continuous packet loss threshold, the current packet is skipped, and the number of consecutive packet loss is cleared. If the number of consecutive packet loss is less than the continuous packet loss, the number of consecutive packet loss is smaller than the continuous packet loss. If the threshold is exceeded, the current packet is discarded. If the packet buffering time does not exceed the threshold, the packet loss process ends.
  • the foregoing method further includes: after receiving the data packet, recording an arrival time of the data packet.
  • a packet loss control device includes: a determining module configured to: parse the received data packet, determine a type of decision algorithm used by the data packet, determine a continuous packet loss threshold according to the determined type of the decision algorithm; and a packet loss control module If the number of lost packets is less than the continuous packet loss threshold, the current packet is discarded. If the number of lost packets is not less than the continuous packet loss threshold, the packet is skipped. Over the current packet.
  • the determining module is configured to: according to the type of the decision algorithm used by the data packet, filter out a key segment that causes a robust head compression protocol ROHC state to be relocated, and determine according to the hopping threshold of the filtered key segment. Continuous packet loss threshold.
  • the determining module is configured to: determine whether the data packet uses the decision algorithm type 1 that supports the real-time transport protocol RTP service, and if yes, take the smallest value among the jump thresholds of the key segment IPID, TS, and SN.
  • the threshold of the field is the continuous packet loss threshold. If not, the threshold of the IPID field of the key segment is the continuous packet loss threshold.
  • the packet loss control module is configured to: scan all the remaining packets in the buffer from the head of the queue, and obtain the packet buffering time according to the difference between the current time and the arrival time of the packet, if the packet buffering time exceeds If the threshold is set, the number of consecutive lost packets is increased by one. If the number of consecutive lost packets is equal to the continuous packet loss threshold, the current packet is skipped, and the number of consecutive lost packets is cleared. If the number of packets is less than the continuous packet loss threshold, the current packet is discarded. If the packet buffering time does not exceed the threshold, the packet loss process ends.
  • the foregoing apparatus further includes: a recording module, configured to: after receiving the data packet, record an arrival time of the data packet.
  • a computer readable storage medium storing computer executable instructions for performing the method of any of the above.
  • the continuous packet loss threshold is determined according to the type of the decision algorithm used by the data packet, and the number of consecutive packet loss does not exceed the continuous packet loss threshold in the packet loss processing. Therefore, the problem that the number of consecutive packet loss is too large and the ROHC compression rate is lowered is avoided, and the stability of the ROHC compression ratio is ensured.
  • FIG. 1 is a flowchart of a packet loss control method according to Embodiment 1 of the present invention.
  • FIG. 2 is a flowchart of a packet loss control method according to Embodiment 2 of the present invention.
  • Fig. 3 is a block diagram showing the configuration of a packet loss control apparatus according to a third embodiment of the present invention.
  • the embodiment of the present invention provides a packet loss control method and apparatus, and the embodiments of the present invention are described in detail below with reference to the accompanying drawings.
  • FIG. 1 is a flowchart of a packet loss control method according to Embodiment 1 of the present invention. As shown in FIG. 1, the method includes the following steps:
  • Step 101 Parsing the received data packet, determining a profile (decision) algorithm type used by the data packet, and determining a continuous packet loss threshold according to the determined profile algorithm type;
  • the profile here refers to the service type supported by the ROHC.
  • the method for parsing the received data packet, determining the type of the profile algorithm used by the data packet, and determining the continuous packet loss threshold according to the determined profile algorithm type may include:
  • the key segment that causes the ROHC state to be moved back is filtered, and the continuous packet loss threshold is determined according to the hopping threshold of the filtered key segment.
  • the received data packet is parsed, the profile algorithm type used by the data packet is determined, and the continuous packet loss threshold is determined according to the determined profile algorithm type, and the following processing manner may also be adopted:
  • the threshold value of the field with the smallest value among the hopping thresholds of the key segment IPID, TS, and SN is the continuous packet loss threshold. If not, Then, the hop threshold of the key segment IPID field is the continuous packet loss threshold.
  • Profile1 is a decision algorithm type 1 that supports RTP (Real-time Transport Protocol) services, and is described in the RFC3095 protocol.
  • RTP Real-time Transport Protocol
  • Step 102 Real-time statistics on the number of consecutive lost packets, if the number of lost packets is less than the continuous packet loss If the threshold is exceeded, the current packet is discarded. If the number of lost packets is not less than the consecutive packet loss threshold, the current packet is skipped.
  • the data packet can be used as follows:
  • the packet buffering time is obtained during the process of recording the arrival time of the data packet after receiving the data packet.
  • the method for controlling packet loss provided by the embodiment of the present invention is described in the embodiment of the present invention by disclosing more technical details.
  • each field in the IP packet is classified according to the ROHC compression mode, and the key segment that causes the ROHC state to be moved back is filtered.
  • each domain in the packet header can be classified into five categories according to the change rule:
  • Domains can be derived, and the values of these fields can be derived from other fields in the header, such as the length field of the header. This field is never sent in header compression.
  • Static domains these domains will not change throughout the flow process, such as the protocol version domain in the lP header, which only needs to be sent once at the beginning.
  • Statically define fields are used to define flow attributes. They are used to distinguish between streams, such as the address field in the header. This field only needs to be sent once at the beginning.
  • protocol version field of the RTP header is 2, and such a domain does not need to be sent.
  • the change domain these domains will change during the transmission process, change within a certain range, or change according to certain rules. These domains require a certain compression algorithm.
  • the filtered key fields include: IPID, TS, and SN.
  • the other Profile key fields are IPID, and then each key segment hopping threshold needs to be determined.
  • the IPID hopping threshold is Q-IPID, TS.
  • the hop threshold is Q-TS
  • the SN hop threshold is Q-SN
  • the number of consecutive packet drops cannot exceed the set threshold K.
  • Step 201 The PDCP entity receives the data packet and records its arrival time.
  • Step 202 Parse the data packet, determine the type of the profile algorithm used, and determine the discarding threshold K. If the decision algorithm is Profile1, step 203 is performed. If the decision algorithm is not Profile1, step 204 is performed.
  • Step 205 Scan all the remaining packets in the buffer from the head of the queue, and take the difference according to the current time and the arrival time of the packet. If the packet buffering time exceeds the set threshold, go to step 206. If If the text cache time does not exceed the set threshold, the discarding process ends.
  • Step 206 Add one consecutive number of lost packets.
  • Step 207 Determine whether the number of consecutive lost packets reaches the threshold K. If the number of consecutive lost packets is equal to the threshold K, step 208 is performed. If the number of consecutive packet drops is less than the threshold K, step 209 is performed.
  • Step 208 Skip this message, and the number of consecutive packet drops is cleared, and step 205 is continued.
  • Step 209 Discard the message and proceed to step 205.
  • FIG. 3 is a block diagram of a packet loss control device according to Embodiment 3 of the present invention, as shown in FIG.
  • the device 40 includes the following components:
  • the determining module 41 is configured to: parse the received data packet, determine a profile algorithm type used by the data packet, and determine a continuous packet loss threshold according to the determined profile algorithm type;
  • the packet loss control module 42 is configured to: count the number of consecutive packet loss in real time, and if the number of lost packets is less than the continuous packet loss threshold, discard the current data packet, and if the number of lost packets is not less than the continuous packet loss threshold The limit value skips the current packet.
  • the determining module 41 is configured to: according to the profile algorithm type used by the data packet, filter out a key segment that causes a robust head compression protocol ROHC state to be relocated, and determine a continuous according to the hopping threshold of the filtered key segment. Packet loss threshold.
  • the determining module 41 is configured to: determine whether the data packet uses Profile1, and if yes, the threshold value of the field with the smallest value among the hopping thresholds of the key segment IPID, TS, and SN is the continuous packet loss threshold. The value, if no, takes the hop threshold of the key segment IPID field as the continuous packet loss threshold.
  • the packet loss control module 42 is configured to: start all the messages remaining in the scan buffer from the head of the queue, and obtain the message buffering time according to the difference between the current time and the arrival time of the packet, if the packet buffering time exceeds the setting If the threshold is set, the number of consecutive lost packets is increased by one. If the number of consecutive lost packets is equal to the continuous packet loss threshold, the current packet is skipped, and the number of consecutive lost packets is cleared. If the number is less than the continuous packet loss threshold, the current packet is discarded. If the packet buffering time does not exceed the threshold, the packet loss process ends.
  • the above device 40 may further include a recording module configured to record the arrival time of the data packet after receiving the data packet.
  • the PDCP packet loss mechanism controls the number of consecutive packet loss in the case of network congestion, so that the ROHC compressor state does not drop suddenly, and the ROHC compression efficiency is effectively ensured.
  • all or part of the steps of the above embodiments may also be implemented by using an integrated circuit. These steps may be separately fabricated into individual integrated circuit modules, or multiple modules or steps may be fabricated into a single integrated circuit module. achieve.
  • the devices/function modules/functional units in the above embodiments may be implemented by a general-purpose computing device, which may be centralized on a single computing device or distributed over a network of multiple computing devices.
  • the device/function module/functional unit in the above embodiment When the device/function module/functional unit in the above embodiment is implemented in the form of a software function module and sold or used as a stand-alone product, it can be stored in a computer readable storage medium.
  • the above mentioned computer readable storage medium may be a read only memory, a magnetic disk or an optical disk or the like.
  • the solution of the embodiment of the present invention determines the continuous packet loss threshold according to the type of the profile algorithm determined by the data packet, and ensures that the number of consecutive packet loss does not exceed the continuous packet loss threshold in the packet loss processing. Therefore, the problem that the number of consecutive packet loss is too large and the ROHC compression rate is lowered is avoided, and the stability of the ROHC compression ratio is ensured.

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本文公布一种丢包控制方法及装置，其中，数据包丢包控制方法包括：解析接收到的数据包，确定数据包使用的决策算法类型，根据确定出的决策算法类型确定连续丢包门限值；实时统计连续丢包数，如果统计出的丢包数目小于连续丢包门限值，则丢弃当前数据包，如果统计出的丢包数目不小于连续丢包门限值，则跳过当前数据包。

Description

一种丢包控制方法及装置 技术领域
本申请涉及但不限于移动通讯领域。
背景技术
ROHC(RobustHeader Compression Protocol，鲁棒性头压缩协议)是一种基于IP(Internet Protocol，因特网协议)的通用压缩技术，它可以应用于3G(The Third Generation，第3代)通信技术的任何一种标准，还可以应用在LTE(Long Term Evolution，长期演进)等技术上，主要工作在基站和用户终端之间。
ROHC压缩过程中包含两种工作状态机，分别为：压缩状态机和解压缩状态机。ROHC压缩端的三种压缩状态由低到高分别为：IR、FO和SO。压缩端开始工作在最低状态IR下，然后逐步向高状态转换。当压缩端有足够的能力确定解压端有足够的上下文信息用来解压压缩包时，压缩端将保持工作在最高状态SO。在一个流中，如果原始包头中有些域由于连续丢包，突然出现了较大的变化，会引起压缩端状态的下降，以同步压缩端和解压端的上下文，这样ROHC的压缩效率也随之大幅降低。
PDCP(Packet Data Convergence Protocol，分组数据汇聚协议)Discard(丢弃)是PDCP层为了防止数据积压而实现的丢包功能，丢包机制大致归为两种，一种是基于队尾丢弃的机制，即，当出现拥塞或缓存溢出时，简单的丢弃后续到来而无处可放的数据包；另一种是基于定时器或时间戳的丢弃机制，这种方法通过对定时器阈值的设定，可以起到提前预防缓存溢出和拥塞的作用，通过实时扫描缓存包积压时间，对超过阈值的包进行丢弃处理。这两种机制并没有考虑丢包对ROHC压缩效率的影响，在网络拥塞的情况下，不可避免的会出现连续丢包的情况，那么这种情况下势必会造成报文中的关键字段出现较大跳变，在ROHC压缩器的处理上，如果某些关键字段出现大的跳变，比如IPID(Internet Protocol Identification，因特网协议标识)，TS(Time Stamp，时间戳)，SN(Sequence Number，序列号)，则会导致压 缩器状态回退，发送初始报文，从而降低ROHC压缩效率。
发明内容
以下是对本文详细描述的主题的概述。本概述并非是为了限制权利要求的保护范围。
本文提供一种丢包控制方法及装置，可以解决目前在连续丢包数目较大的情况下，降低ROHC压缩效率的问题。
一种丢包控制方法，包括：解析接收到的数据包，确定数据包使用的决策算法类型，根据确定出的决策算法类型确定连续丢包门限值；实时统计连续丢包数，如果统计出的丢包数目小于连续丢包门限值，则丢弃当前数据包，如果统计出的丢包数目不小于连续丢包门限值，则跳过当前数据包。
可选地，解析接收到的数据包，确定数据包使用的决策算法类型，根据确定出的决策算法类型确定连续丢包门限值，包括：根据数据包使用的决策算法类型，过滤出会导致鲁棒性头压缩协议ROHC状态回迁的关键字段，根据过滤出的关键字段的跳变门限确定连续丢包门限值。
可选地，解析接收到的数据包，确定数据包使用的决策算法类型，根据确定出的决策算法类型确定连续丢包门限值，包括：判断数据包是否使用支持实时传输协议RTP业务的决策算法类型1，如果是，则取关键字段IPID、TS以及SN的跳变门限中取值最小的字段的门限值为连续丢包门限值，如果否，则取关键字段IPID字段的跳变门限值为连续丢包门限值。
可选地，实时统计连续丢包数，如果统计出的丢包数目小于连续丢包门限值，则丢弃当前数据包，如果统计出的丢包数目不小于连续丢包门限值，则跳过当前数据包，包括：从队列头开始扫描缓冲区中剩余的所有报文，根据当前时间和报文到达时间的差值得到报文缓存时间，如果报文缓存时间超过设定阈值，则将当前统计的连续丢包个数加一，如果连续丢包个数等于连续丢包门限值，则跳过当前报文，连续丢包个数清零，如果连续丢包个数小于连续丢包门限值，则丢弃当前报文；如果报文缓存时间未超过设定阈值，则丢包流程结束。
可选的，上述方法还包括：在接收到数据包后，记录数据包的到达时间。
一种丢包控制装置，包括：确定模块，设置为：解析接收到的数据包，确定数据包使用的决策算法类型，根据确定出的决策算法类型确定连续丢包门限值；丢包控制模块，设置为：实时统计连续丢包数，如果统计出的丢包数目小于连续丢包门限值，则丢弃当前数据包，如果统计出的丢包数目不小于连续丢包门限值，则跳过当前数据包。
可选地，上述确定模块是设置为：根据数据包使用的决策算法类型，过滤出会导致鲁棒性头压缩协议ROHC状态回迁的关键字段，根据过滤出的关键字段的跳变门限确定连续丢包门限值。
可选地，上述确定模块是设置为：判断数据包是否使用支持实时传输协议RTP业务的决策算法类型1，如果是，则取关键字段IPID、TS以及SN的跳变门限中取值最小的字段的门限值为连续丢包门限值，如果否，则取关键字段IPID字段的跳变门限值为连续丢包门限值。
可选地，上述丢包控制模块是设置为：从队列头开始扫描缓冲区中剩余的所有报文，根据当前时间和报文到达时间的差值得到报文缓存时间，如果报文缓存时间超过设定阈值，则将当前统计的连续丢包个数加一，如果连续丢包个数等于连续丢包门限值，则跳过当前报文，连续丢包个数清零，如果连续丢包个数小于连续丢包门限值，则丢弃当前报文；如果报文缓存时间未超过设定阈值，则结束丢包流程。
可选的，上述装置还包括：记录模块，设置为：在接收到数据包后，记录数据包的到达时间。
一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令用于执行上述任一项的方法。
本发明实施例的方案，通过根据数据包使用的决策算法类型，确定出的决策算法类型确定连续丢包门限值，确保在丢包处理中，连续丢包数目不超过连续丢包门限值，从而避免了连续丢包数目过大而导致ROHC压缩率降低的问题，确保了ROHC压缩率的稳定性。
在阅读并理解了附图和详细描述后，可以明白其他方面。
附图概述
图1是本发明实施例1提供的丢包控制方法的流程图；
图2是本发明实施例2提供的丢包控制方法的流程图；
图3是本发明实施例3的丢包控制装置的结构框图。
本发明的实施方式
为了解决相关技术在连续丢包数目较大的情况下，降低ROHC压缩效率的问题，本发明实施例提供了一种丢包控制方法及装置，以下结合附图对本发明的实施方式进行详细说明。
图1是本发明实施例1提供的丢包控制方法的流程图，如图1所示，该方法包括如下步骤：
步骤101：解析接收到的数据包，确定数据包使用的Profile(决策)算法类型，根据确定出的Profile算法类型确定连续丢包门限值；
其中，此处的Profile指ROHC对应支持的业务类型。其中，解析接收到的数据包，确定数据包使用的Profile算法类型，根据确定出的Profile算法类型确定连续丢包门限值，可以包括：
根据数据包使用的Profile算法类型，过滤出会导致ROHC状态回迁的关键字段，根据过滤出的关键字段的跳变门限确定连续丢包门限值。
此外，解析接收到的数据包，确定数据包使用的Profile算法类型，根据确定出的Profile算法类型确定连续丢包门限，还可以采用如下处理方式：
判断数据包是否使用Profile1(决策算法1)，如果是，则取关键字段IPID、TS以及SN的跳变门限中取值最小的字段的门限值为连续丢包门限值，如果否，则取关键字段IPID字段的跳变门限值为连续丢包门限值。
其中，Profile1为支持RTP(Real-time Transport Protocol，实时传输协议)业务的决策算法类型1，在RFC3095协议中有相关描述。
步骤102：实时统计连续丢包数，如果统计出的丢包数目小于连续丢包 门限值，则丢弃当前数据包，如果统计出的丢包数目不小于连续丢包门限值，则跳过当前数据包。
其中，实时统计连续丢包数，如果统计出的丢包数目小于连续丢包门限值，则丢弃当前数据包，如果统计出的丢包数目不小于连续丢包门限值，则跳过当前数据包，可以采用如下方式：
从队列头开始扫描缓冲区中剩余的所有报文，根据当前时间和报文到达时间的差值得到报文缓存时间，如果报文缓存时间超过设定阈值，则将当前统计的连续丢包个数加一，如果连续丢包个数等于连续丢包门限值，则跳过当前报文，连续丢包个数清零，如果连续丢包个数小于连续丢包门限值，则丢弃当前报文；如果报文缓存时间未超过设定阈值，则丢包流程结束，其中，报文达到时间为，在接收到数据包后，对数据包的到达时间进行记录的过程中获取到的。
实施例2
本发明实施例通过公开更多的技术细节，对本发明实施例提供的丢包控制方法进行说明。
首先对IP报文中的每个字段根据ROHC压缩方式进行类型分类，过滤出会导致ROHC状态回迁的关键字段，一般而言，包头中每个域按照变化规律可以分为五类：
可推导域，这些域的值可以由包头中的别的域推导出来，例如包头的长度域。这种域在包头压缩中从不发送。
静态域，这些域在整个流过程中是不会发生变化的，例如lP包头中协议版本域，这种域只需要在开始的时候发送一次。
静态定义域，这些域是用来定义流属性的，用来区别流的，例如包头中地址域，这种域也只需要在开始的时候发送一次。
静态己知域，这些域是大家所共知的，例如RTP包头的协议版本域为2，这种域不需要发送。
变化域，这些域在传输过程中是会发生变化的，在一定的范围内变化，或者按照一定的规律变化。这些域需要采取一定的压缩算法。
虽然，包头中还是有很多域在流过程中发生变化，但是这些域中有很多域的变化频率很低或是变化随机，在他们发生变化时，只要将他们重新传输，并更新解压端对应的上下文即可。但是包头中有3个域在流过程中不断发生规律性变化，它们分别是：IPv4中的IPID域，RTP的SN域和RTP的TS域。这三个域值一旦发生大的跳变，那么ROHC便会检测其存在随机性，会对状态进行回退，降低压缩效率。因此针对Profile1算法，过滤出的关键字段包括：IPID、TS以及SN，其它Profile关键字段为IPID，然后需要确定每个关键字段跳变门限，假定IPID跳变门限为Q-IPID，TS跳变门限为Q-TS，SN跳变门限为Q-SN，取三个门限值下限为K＝min{Q-IPID，Q-TS，Q-SN}，如果关键字段的跳变超过所设定门限值，ROHC实例会检测改字段为随机字段，进行状态回迁，降低ROHC压缩效率，因此需要保证PDCP Discard功能连续丢包个数不能超过门限值K，即实时统计连续丢包个数Q-NUM，如果Q-NUM达到丢弃门限K，那么跳过下一包，继续进行Discard处理。
需要说明的是，无论PDCP Discard丢包功能采用基于队尾丢弃的机制，抑或是基于定时器或时间戳的丢弃机制，连续丢包个数均不能超过所设定门限值K。
下面结合附图2对实施例提供的丢包控制方法作进一步的详细描述。包括如下步骤：
步骤201：PDCP实体接收数据包，记录其达到时间。
步骤202：解析数据包，判断其使用的Profile算法类型，确定丢弃门限值K。若决策算法为Profile1，则执行步骤203，若决策算法非Profile1，则执行步骤204。
步骤203：使用门限值K＝min{Q-IPID,Q-TS,Q-SN}，然后转入步骤205。
步骤204：使用门限值K＝Q-IPID，然后转入步骤205。
步骤205：从队头开始扫描缓冲区中剩余所有报文，根据当前时间和报文到达时间取差值，若报文缓存时间超过所设定阈值，转入步骤206。若报 文缓存时间不超过所设定阈值，则弃包流程结束。
步骤206：将连续丢包个数加一。
步骤207：判断连续丢包个数是否达到门限值K，若连续丢包个数等于门限值K，则执行步骤208。若连续丢包个数小于门限值K，则执行步骤209。
步骤208：跳过此报文，连续丢包个数清零，继续执行步骤205。
步骤209：丢弃此报文，继续执行步骤205。
实施例3
本实施例提供一种丢包控制装置，该装置可以设置于PDCP实体上，该装置拥有实现上述丢包控制方法，图3是本发明实施例3的丢包控制装置的结构框图，如图3所示，该装置40包括如下组成部分：
确定模块41，设置为：解析接收到的数据包，确定数据包使用的Profile算法类型，根据确定出的Profile算法类型确定连续丢包门限值；
丢包控制模块42，设置为：实时统计连续丢包数，如果统计出的丢包数目小于连续丢包门限值，则丢弃当前数据包，如果统计出的丢包数目不小于连续丢包门限值，则跳过当前数据包。
其中，上述确定模块41是设置为：根据数据包使用的Profile算法类型，过滤出会导致鲁棒性头压缩协议ROHC状态回迁的关键字段，根据过滤出的关键字段的跳变门限确定连续丢包门限值。
其中，上述确定模块41是设置为：判断数据包是否使用Profile1，如果是，则取关键字段IPID、TS以及SN的跳变门限中取值最小的字段的门限值为连续丢包门限值，如果否，则取关键字段IPID字段的跳变门限值为连续丢包门限值。
其中，上述丢包控制模块42是设置为：从队列头开始扫描缓冲区中剩余的所有报文，根据当前时间和报文到达时间的差值得到报文缓存时间，如果报文缓存时间超过设定阈值，则将当前统计的连续丢包个数加一，如果连续丢包个数等于连续丢包门限值，则跳过当前报文，连续丢包个数清零，如果连续丢包个数小于连续丢包门限值，则丢弃当前报文；如果报文缓存时间未超过设定阈值，则丢包流程结束。
上述装置40还可以包括记录模块，该记录模块设置为：在接收到数据包后，记录数据包的到达时间。
根据本发明实施例提供的方案，可以保证在网络拥塞发生的情况下，PDCP的丢包机制控制连续丢包数目，从而不会导致ROHC压缩器状态的骤降，有效的保证了ROHC压缩效率。
本领域普通技术人员可以理解上述实施例的全部或部分步骤可以使用计算机程序流程来实现，所述计算机程序可以存储于一计算机可读存储介质中，所述计算机程序在相应的硬件平台上(如系统、设备、装置、器件等)执行，在执行时，包括方法实施例的步骤之一或其组合。
可选地，上述实施例的全部或部分步骤也可以使用集成电路来实现，这些步骤可以被分别制作成一个个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。
上述实施例中的装置/功能模块/功能单元可以采用通用的计算装置来实现，它们可以集中在单个的计算装置上，也可以分布在多个计算装置所组成的网络上。
上述实施例中的装置/功能模块/功能单元以软件功能模块的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。上述提到的计算机可读取存储介质可以是只读存储器，磁盘或光盘等。
工业实用性
本发明实施例的方案，通过根据数据包使用的Profile算法类型，确定出的Profile算法类型确定连续丢包门限值，确保在丢包处理中，连续丢包数目不超过连续丢包门限值，从而避免了连续丢包数目过大而导致ROHC压缩率降低的问题，确保了ROHC压缩率的稳定性。

Claims (11)

  1. 一种丢包控制方法，包括：
    解析接收到的数据包，确定所述数据包使用的决策算法类型，根据确定出的决策算法类型确定连续丢包门限值；
    实时统计连续丢包数，如果统计出的丢包数目小于所述连续丢包门限值，则丢弃当前数据包，如果统计出的丢包数目不小于所述连续丢包门限值，则跳过当前数据包。
  2. 如权利要求1所述的方法，其中，所述解析接收到的数据包，确定所述数据包使用的决策算法类型，根据确定出的决策算法类型确定连续丢包门限值，包括：
    根据数据包使用的决策算法类型，过滤出会导致鲁棒性头压缩协议ROHC状态回迁的关键字段，根据过滤出的关键字段的跳变门限确定所述连续丢包门限值。
  3. 如权利要求1所述的方法，其中，所述解析接收到的数据包，确定所述数据包使用的决策算法类型，根据确定出的决策算法类型确定连续丢包门限值，包括：
    判断所述数据包是否使用支持实时传输协议RTP业务的决策算法类型1，如果是，则取关键字段因特网协议标识IPID、时间戳TS以及序列号SN的跳变门限中取值最小的字段的门限值为所述连续丢包门限值，如果否，则取关键字段因特网协议标识IPID字段的跳变门限值为所述连续丢包门限值。
  4. 如权利要求1所述的方法，其中，所述实时统计连续丢包数，如果统计出的丢包数目小于所述连续丢包门限值，则丢弃当前数据包，如果统计出的丢包数目不小于所述连续丢包门限值，则跳过当前数据包，包括：
    从队列头开始扫描缓冲区中剩余的所有报文，根据当前时间和报文到达时间的差值得到报文缓存时间，如果报文缓存时间超过设定阈值，则将当前统计的连续丢包个数加一，如果连续丢包个数等于所述连续丢包门限值，则跳过当前报文，连续丢包个数清零，如果连续丢包个数小于所述连续丢包门限值，则丢弃当前报文；
    如果报文缓存时间未超过所述设定阈值，则丢包流程结束。
  5. 如权利要求1～4任意一项所述的方法，所述方法还包括：
    在接收到数据包后，记录所述数据包的到达时间。
  6. 一种丢包控制装置，包括：
    确定模块，设置为：解析接收到的数据包，确定所述数据包使用的决策算法类型，根据确定出的决策算法类型确定连续丢包门限值；
    丢包控制模块，设置为：实时统计连续丢包数，如果统计出的丢包数目小于所述连续丢包门限值，则丢弃当前数据包，如果统计出的丢包数目不小于所述连续丢包门限值，则跳过当前数据包。
  7. 如权利要求6所述的装置，其中，所述确定模块是设置为：
    根据数据包使用的决策算法类型，过滤出会导致鲁棒性头压缩协议ROHC状态回迁的关键字段，根据过滤出的关键字段的跳变门限确定所述连续丢包门限值。
  8. 如权利要求6所述的装置，其中，所述确定模块是设置为：
    判断所述数据包是否使用支持实时传输协议RTP业务的决策算法类型1，如果是，则取关键字段因特网协议标识IPID、时间戳TS以及序列号SN的跳变门限中取值最小的字段的门限值为所述连续丢包门限值，如果否，则取关键字段因特网协议标识IPID字段的跳变门限值为所述连续丢包门限值。
  9. 如权利要求6所述的装置，其中，所述丢包控制模块是设置为：
    从队列头开始扫描缓冲区中剩余的所有报文，根据当前时间和报文到达时间的差值得到报文缓存时间，如果报文缓存时间超过设定阈值，则将当前统计的连续丢包个数加一，如果连续丢包个数等于所述连续丢包门限值，则跳过当前报文，连续丢包个数清零，如果连续丢包个数小于所述连续丢包门限值，则丢弃当前报文；
    如果报文缓存时间未超过所述设定阈值，则结束丢包流程。
  10. 如权利要求6～9任意一项所述的装置，所述装置还包括：
    记录模块，设置为：在接收到数据包后，记录所述数据包的到达时间。
  11. 一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令用于执行权利要求1-5任一项的方法。
PCT/CN2015/085952 2015-03-18 2015-08-03 一种丢包控制方法及装置 WO2016145764A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201510119077.5A CN106034088A (zh) 2015-03-18 2015-03-18 一种丢包控制方法及装置
CN201510119077.5 2015-03-18

Publications (1)

Publication Number Publication Date
WO2016145764A1 true WO2016145764A1 (zh) 2016-09-22

Family

ID=56918366

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/085952 WO2016145764A1 (zh) 2015-03-18 2015-08-03 一种丢包控制方法及装置

Country Status (2)

Country Link
CN (1) CN106034088A (zh)
WO (1) WO2016145764A1 (zh)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109981481A (zh) * 2019-01-16 2019-07-05 北京左江科技股份有限公司 一种多现场保护的设计方法
CN110636035A (zh) * 2018-06-25 2019-12-31 大唐移动通信设备有限公司 一种通信方法、装置及可读存储介质
CN110913421A (zh) * 2018-09-18 2020-03-24 大唐移动通信设备有限公司 一种语音包数量的确定方法及装置
CN113650569A (zh) * 2021-07-29 2021-11-16 广州文远知行科技有限公司 交通工具设备控制方法、装置、交通工具及存储介质
CN114866487A (zh) * 2022-03-08 2022-08-05 国网江苏省电力有限公司南京供电分公司 一种海量电网调度数据采集与存储系统

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110225532B (zh) * 2019-04-25 2023-01-17 维沃移动通信有限公司 一种数据接收方法及终端设备
CN110769077B (zh) * 2019-10-14 2021-12-31 新华三信息安全技术有限公司 一种报文处理方法、装置、网络设备及存储介质
CN111884866B (zh) * 2020-08-05 2022-10-28 中国工商银行股份有限公司 网络优化方法、网络优化系统、计算机系统和存储介质
CN114338554A (zh) * 2021-12-31 2022-04-12 锐捷网络股份有限公司 基于流的随机丢包方法及装置

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101941453A (zh) * 2010-08-27 2011-01-12 北京交通大学 列车自动控制方法
CN102113277A (zh) * 2008-08-07 2011-06-29 高通股份有限公司 在无线通信系统中用于基于定时器的丢弃的高效分组处理
CN102137439A (zh) * 2010-09-17 2011-07-27 上海华为技术有限公司 压缩控制方法、设备和系统

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102113277A (zh) * 2008-08-07 2011-06-29 高通股份有限公司 在无线通信系统中用于基于定时器的丢弃的高效分组处理
CN101941453A (zh) * 2010-08-27 2011-01-12 北京交通大学 列车自动控制方法
CN102137439A (zh) * 2010-09-17 2011-07-27 上海华为技术有限公司 压缩控制方法、设备和系统

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110636035A (zh) * 2018-06-25 2019-12-31 大唐移动通信设备有限公司 一种通信方法、装置及可读存储介质
CN110636035B (zh) * 2018-06-25 2020-11-20 大唐移动通信设备有限公司 一种通信方法、装置及可读存储介质
CN110913421A (zh) * 2018-09-18 2020-03-24 大唐移动通信设备有限公司 一种语音包数量的确定方法及装置
CN109981481A (zh) * 2019-01-16 2019-07-05 北京左江科技股份有限公司 一种多现场保护的设计方法
CN109981481B (zh) * 2019-01-16 2022-11-11 北京左江科技股份有限公司 一种多现场保护的设计方法
CN113650569A (zh) * 2021-07-29 2021-11-16 广州文远知行科技有限公司 交通工具设备控制方法、装置、交通工具及存储介质
CN113650569B (zh) * 2021-07-29 2022-10-11 广州文远知行科技有限公司 交通工具设备控制方法、装置、交通工具及存储介质
CN114866487A (zh) * 2022-03-08 2022-08-05 国网江苏省电力有限公司南京供电分公司 一种海量电网调度数据采集与存储系统
CN114866487B (zh) * 2022-03-08 2024-03-05 国网江苏省电力有限公司南京供电分公司 一种海量电网调度数据采集与存储系统

Also Published As

Publication number Publication date
CN106034088A (zh) 2016-10-19

Similar Documents

Publication Publication Date Title
WO2016145764A1 (zh) 一种丢包控制方法及装置
US20210006270A1 (en) Method and Device for Transmitting Data by Determining a Measure of Consecutive Packet Loss in a Network
JP3799285B2 (ja) 無線ｌａｎ基地局、無線端末およびプログラム
KR100651486B1 (ko) 네트워크를 통해 멀티미디어 컨텐츠를 전송하는 장치 및방법
JP5875725B2 (ja) コンテンツ再生情報推定装置及び方法及びプログラム
DK2169906T3 (da) Fremgangsmåde til komprimering af et headerfelt i en datapakke
EP4156645A1 (en) Message forwarding method and apparatus, and electronic device
JP2006211632A (ja) Ｃｒｃ検査範囲外エラーを検出する方法
JP2010011212A (ja) 送信装置、受信装置、及び方法、プログラム
JP2000228676A (ja) データ送信方法
US7283548B2 (en) Dynamic latency management for IP telephony
CN109862400B (zh) 一种流媒体传输方法、装置及其系统
KR102118678B1 (ko) 부호화된 비디오 스트림 전송 장치 및 방법
WO2022100581A1 (zh) Ipfix消息的处理方法、存储介质、网络交换芯片及asic芯片
CN107196879B (zh) Udp报文的处理方法、装置以及网络转发装置
US7986759B2 (en) Data output method, data output apparatus and communication system
WO2017140076A1 (zh) 一种数据传输方法及装置
KR101563779B1 (ko) 네트워크상에서 손실된 실시간 멀티미디어 데이터를 재생 한계 시간 이전에 재전송하는 종단 간 프로토콜
US20190158437A1 (en) Using signals extracted from a voip data stream to distinguish between network congestion and link losses
EP3223478A1 (en) Packet processing method and device, and storage medium
JP5806982B2 (ja) ユーザポーズ操作時間推定装置及び方法及びプログラム
KR100847168B1 (ko) Ｕｄｐ/ｒｔｐ를 사용하는 망에서의 지터 처리를 위한 패킷 순서 재배열 장치 및 방법
US20090052453A1 (en) Method and apparatus for improving the performance of voice over IP (VoIP) speech communications systems which use robust header compression (RoHC) techniques
CN111277512B (zh) 一种提升视频业务感知的方法及装置
US7639703B2 (en) Data output method using a jitter buffer, data output apparatus using a jitter buffer, communication system using a jitter buffer and computer program product

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

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

Country of ref document: EP

Kind code of ref document: A1