WO2018108127A1 - 信息发送方法、信息接收方法及pdcp实体、计算机存储介质 - Google Patents

信息发送方法、信息接收方法及pdcp实体、计算机存储介质 Download PDF

Info

Publication number
WO2018108127A1
WO2018108127A1 PCT/CN2017/116171 CN2017116171W WO2018108127A1 WO 2018108127 A1 WO2018108127 A1 WO 2018108127A1 CN 2017116171 W CN2017116171 W CN 2017116171W WO 2018108127 A1 WO2018108127 A1 WO 2018108127A1
Authority
WO
WIPO (PCT)
Prior art keywords
pdu
sequence number
entity
rlc
pdcp
Prior art date
Application number
PCT/CN2017/116171
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 中国移动通信有限公司研究院
Priority to US16/469,397 priority Critical patent/US11166188B2/en
Publication of WO2018108127A1 publication Critical patent/WO2018108127A1/zh

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/0252—Traffic management, e.g. flow control or congestion control per individual bearer or channel
    • H04W28/0263—Traffic management, e.g. flow control or congestion control per individual bearer or channel involving mapping traffic to individual bearers or channels, e.g. traffic flow template [TFT]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607—Details of the supervisory signal
    • H04L1/1642—Formats specially adapted for sequence numbers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/34—Flow control; Congestion control ensuring sequence integrity, e.g. using sequence numbers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W80/00—Wireless network protocols or protocol adaptations to wireless operation
    • H04W80/02—Data link layer protocols
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W80/00—Wireless network protocols or protocol adaptations to wireless operation
    • H04W80/08—Upper layer protocols

Definitions

  • the present application relates to information processing technologies in the field of communications, and in particular, to an information sending method, an information receiving method, and a Packet Data Convergence Protocol (PDCP) entity, and a computer storage medium.
  • PDCP Packet Data Convergence Protocol
  • 5G networks need to provide higher traffic, serve more terminals and support more connections.
  • new services such as enhanced mobile broadband technology, low latency and high reliability
  • a series of solutions such as dual connectivity, C/U separation, and C-RAN distributed network architecture are proposed.
  • a one-to-many mapping relationship between PDCP and RLC occurs in these schemes.
  • the previous ordering is performed by the RLC.
  • one bearer in the PDCP needs to be mapped with multiple RLC bearers, and only one of the RLC bearers is guaranteed to be delivered sequentially, and the mapping to the same PDCP bearer cannot be guaranteed.
  • the sequential delivery of multiple RLC bearers and thus there is no guarantee that the PDUs will be sorted quickly when they are received.
  • the main purpose of the present application is to provide an information sending method, an information receiving method, and a Packet Data Convergence Protocol (PDCP) entity and a computer memory.
  • PDCP Packet Data Convergence Protocol
  • the storage medium is intended to solve the above problems existing in the prior art.
  • the present application provides an information sending method, where the method includes:
  • the packet data convergence protocol PDCP entity determines an information transmission order of at least one RLC entity managed by itself, and determines a rearrangement sequence number corresponding to each RLC entity based on the information transmission order;
  • An information receiving method provided by the application includes:
  • a PDCP entity provided by the application where the PDCP entity includes:
  • a rearrangement sequence number generating unit configured to determine an information sending order of at least one RLC entity managed by itself, and determine a rearrangement sequence number corresponding to each RLC entity based on the information sending order;
  • An information processing unit configured to determine a data protocol unit PDU to be sent by each of the RLC entities, and add the rearrangement sequence number to the PDU;
  • mapping unit configured to map the PDU to a corresponding RLC entity.
  • a PDCP entity provided by the application where the PDCP entity includes:
  • An information receiving unit configured to receive at least one PDU sent by at least one RLC entity
  • a rearrangement sequence number extracting unit configured to extract a rearranged sequence number from each of the at least one PDU
  • the information processing unit is configured to determine, according to the rearrangement sequence number, an information transmission order of the RLC entity corresponding to each of the PDUs, to determine, according to the information transmission order, to sort the at least one PDU.
  • a PDCP entity as set forth in the present application includes: a processor and a memory configured to store a computer program executable on the processor,
  • processor is configured to perform the steps of the foregoing method when the computer program is run.
  • a computer storage medium is provided by the present application, the computer storage medium storing computer executable instructions that, when executed, implement the steps of the foregoing method.
  • the information sending method, the information receiving method, and the PDCP entity and the computer storage medium proposed by the present application add a reordering sequence number to the information sending sequence corresponding to the RLC entity to be mapped by the PDU when the PDCP entity sends the PDU.
  • the PDUs sent by different RLC entities can be distinguished by reordering the sequence numbers, so that the receiving end can sort the rearranged sequence numbers in addition to the SNs of the original PDUs, thereby reducing the sorting delay of the PDUs, thereby improving the processing efficiency of the receiving end.
  • FIG. 1 is a schematic flowchart of a method for sending information according to an embodiment of the present application
  • FIG. 2 is a schematic diagram 1 of a processing scenario according to an embodiment of the present application.
  • FIG. 3 is a schematic diagram 2 of a processing scenario according to an embodiment of the present application.
  • FIG. 4 is a schematic diagram 3 of a processing scenario according to an embodiment of the present application.
  • FIG. 5 is a schematic diagram 4 of a processing scenario according to an embodiment of the present application.
  • FIG. 6 is a schematic diagram 5 of a processing scenario according to an embodiment of the present application.
  • FIG. 7 is a schematic flowchart of a method for receiving information according to an embodiment of the present application.
  • FIG. 8 is a schematic diagram 6 of a connection processing scenario according to an embodiment of the present application.
  • FIG. 9 is a schematic structural diagram 1 of a PDCP structure according to an embodiment of the present application.
  • FIG. 10 is a schematic diagram 2 of a PDCP composition structure according to an embodiment of the present application.
  • An embodiment of the present application provides a method for sending information, as shown in FIG. 1 , including:
  • Step 101 The packet data convergence protocol PDCP entity determines an information transmission order of at least one RLC entity managed by itself, and determines a rearrangement sequence number corresponding to each RLC entity based on the information transmission order;
  • Step 102 Determine a data protocol unit PDU to be sent by each of the RLC entities, and add the rearrangement sequence number to the PDU.
  • Step 103 Map the PDU to a corresponding RLC entity.
  • connection function between the PDCP entity and the at least one RLC entity may be as shown in FIG. 2 and FIG. 3, and it can be seen that one PDCP entity can manage one or more RLC entities; in addition, the figure shows MAC entities and other functional entities are not described here.
  • One bearer in the PDCP needs to be mapped with multiple RLC bearers.
  • the PDCP entity function may include a routing function and a sorting function, and is responsible for multiple RLCs through the routing function. Data routing between entities, as well as sorting using RSN distribution. When routing data to different RLC entities, it needs to correspond to a unique RSN. The RSN cyclic sequence is used to confirm the order between PDCP PDUs that different RLC entities need to send through the RSN. The sorting function sorts the data received from different RLC entities through the RSN.
  • the PDCP entity can determine the information transmission order of different RLC entities based on multiple RLC entities managed by itself, for example, as shown in FIG.
  • Each RLC entity each RLC entity corresponds to one carrier, respectively bearer1 ⁇ 3; after determining the transmission order of three RLCs, determining the rearrangement sequence number of each RLC entity according to the sending order, the rearrangement sequence number It can be expressed as an RSN, as shown in the figure RSN #i ⁇ i + 2; where i can be an integer. That is, the order in which the three RLC entities are used to transmit the PDCP PDU is respectively distinguished by rearranging the sequence numbers.
  • the method before the determining the PDU to be sent by each of the RLC entities, the method further includes: the PDCP entity assigning a sequence number SN to at least one PDU to be sent.
  • Each of the PDUs may be assigned a sequence number of the RSN.
  • the PDN PDU group that is simultaneously sent to the same RLC uses the same RSN, and the RSN is numbered according to the sequence between the multiple PDCP PDU groups.
  • the embodiment further includes: adding the SN and the rearrangement sequence number to the PDU.
  • the location of adding the SN and the reordering sequence number in each PDU may be: adding a preset number of data bits before or after the data bit of the SN of the original PDU, and increasing the weight by a preset number of data bits. Sort the serial number.
  • the rearrangement sequence number is added to the information sending sequence corresponding to the RLC entity to be mapped by the PDU.
  • the PDUs sent by different RLC entities can be distinguished by reordering the sequence numbers, so that the receiving end can sort the rearranged sequence numbers in addition to the SNs of the original PDUs, thereby reducing the sorting delay of the PDUs, thereby improving the processing efficiency of the receiving end.
  • An embodiment of the present application provides a method for receiving information, as shown in FIG. 7, including:
  • Step 701 The PDCP entity receives at least one PDU sent by at least one RLC entity.
  • Step 702 Extract a reordered sequence number from each of the at least one PDU.
  • Step 703 Determine an information sending sequence of each RLC entity corresponding to the PDU based on the rearrangement sequence number, to determine, according to the information sending order, to sort the at least one PDU.
  • connection function between the PDCP entity and the at least one RLC entity may be as shown in FIG. 2 and FIG. 3, and it can be seen that one PDCP entity can manage one or more RLC entities; in addition, the figure shows MAC entities and other functional entities are not described here.
  • One bearer in the PDCP needs to be mapped with multiple RLC bearers.
  • the PDCP entity function provided in this embodiment may include a routing function, which is responsible for data routing with multiple RLC entities through routing functions, and RSN distribution for sorting. When routing data to different RLC entities, it needs to correspond to a unique RSN.
  • the RSN cyclic sequence is used to confirm the order between PDCP PDUs that different RLC entities need to send through the RSN.
  • the method further includes:
  • the PDCP entity extracts a sequence number SN from each of the received at least one PDU.
  • the embodiment further includes: sorting the at least one PDU based on the SN and the reordering sequence number.
  • the location of the SN and the reordering sequence number in each PDU may be that a preset number of data bits are added before or after the data bit of the SN of the original PDU, and the rearrangement is increased by a preset number of data bits. serial number.
  • Reordering which performs sorting of PDCP PDUs sent by multiple RLC entities. Ensure that the PDCP SN is processed in order, while maintaining HFN and COUNT values.
  • the original reordering function is optimized, and the sequence numbering function is responsible for PDCP SN.
  • the Routing function is responsible for the sequential maintenance of the PDCP RSN while sending PDCP PDUs to different RLC entities.
  • the RSN cycle is used sequentially.
  • An example diagram of the sending end routing function is shown in FIG. 5, and multiple PDCP PDUs sent to the same RLC entity at the same time use the same RSN.
  • the schematic diagram of reordering at the receiving end is shown in Figure 8.
  • the PDCP can sort these PDCP PDUs using the RSN.
  • the PDCP SNs that can be guaranteed by a single RLC are sequentially delivered, and the receiving end can sort the inter-RLC PDCP PDUs through the RSN, and through the RSN+SN two-stage mode, multiple PDCPs that have been internally sorted according to the RSN.
  • the PDUs are serially connected in sequence to complete the reordering of all PDCP PDUs, which simplifies the sorting process compared to the existing method of sorting only by PDCP SN.
  • the RLC cannot guarantee that the data submitted to the PDCP is in order.
  • the existing scheme is in the PDCP transmitted by multiple RLC entities.
  • the SN number span is too large. Since the COUNT value maintenance in the prior art only has one plus and minus one operations, there is a problem that the reordering window is not suitable and the COUNT value is calculated ambiguously.
  • the SN number with a large span can be converted into an RSN with a small span and easy to sort. By maintaining the order of the RSN, the easy maintenance of the COUNT value is guaranteed.
  • the RSN can also be considered as a further extension of the SN length, or a two-level PDCP SN.
  • the rearrangement sequence number is added to the information sending sequence corresponding to the RLC entity to be mapped by the PDU.
  • the PDUs sent by different RLC entities can be distinguished by reordering the sequence numbers, so that the receiving end can sort the rearranged sequence numbers in addition to the SNs of the original PDUs, thereby reducing the sorting delay of the PDUs, thereby improving the processing efficiency of the receiving end.
  • the embodiment of the present application provides a PDCP entity, as shown in FIG. 9, including:
  • the reordering sequence number generating unit 91 is configured to determine an information sending order of the at least one RLC entity managed by itself, and determine a reordering corresponding to each RLC entity based on the information sending order.
  • the information processing unit 92 is configured to determine a data protocol unit PDU to be sent by each of the RLC entities, and add the rearrangement sequence number to the PDU;
  • the mapping unit 93 is configured to map the PDU to a corresponding RLC entity.
  • connection function between the PDCP entity and the at least one RLC entity may be as shown in FIG. 2 and FIG. 3, and it can be seen that one PDCP entity can manage one or more RLC entities; in addition, the figure shows MAC entities and other functional entities are not described here.
  • One bearer in the PDCP needs to be mapped with multiple RLC bearers.
  • the PDCP entity function provided in this embodiment may include a routing function, which is responsible for data routing with multiple RLC entities through routing functions, and RSN distribution for sorting. When routing data to different RLC entities, it needs to correspond to a unique RSN.
  • the RSN cyclic sequence is used to confirm the order between PDCP PDUs that different RLC entities need to send through the RSN.
  • the PDCP entity can determine the information transmission order of different RLC entities based on multiple RLC entities managed by itself. For example, as shown in FIG. 6, three RLC entities are currently managed, and each RLC entity corresponds to one carrier, respectively. Bearer1 ⁇ 3; after determining the transmission order of the three RLCs, determining the reordering sequence number of each RLC entity according to the sending order, the reordering sequence number may be represented as an RSN, as shown in the figure RSN#i ⁇ i+2; where i can be an integer. That is, the order in which the three RLC entities are used to transmit the PDCP PDU is respectively distinguished by rearranging the sequence numbers.
  • the PDCP entity further includes:
  • the sequence number generating unit 94 is configured to assign a sequence number SN to at least one PDU to be transmitted.
  • the information processing unit 92 is configured to resort the SN and the The column number is added to the PDU.
  • the location of adding the SN and the reordering sequence number in each PDU may be: adding a preset number of data bits before or after the data bit of the SN of the original PDU, and increasing the weight by a preset number of data bits. Sort the serial number.
  • the rearrangement sequence number is added to the information sending sequence corresponding to the RLC entity to be mapped by the PDU.
  • the PDUs sent by different RLC entities can be distinguished by reordering the sequence numbers, so that the receiving end can sort the rearranged sequence numbers in addition to the SNs of the original PDUs, thereby reducing the sorting delay of the PDUs, thereby improving the processing efficiency of the receiving end.
  • the embodiment of the present application provides a PDCP entity, as shown in FIG. 10, including:
  • the information receiving unit 1001 is configured to receive at least one PDU sent by at least one RLC entity;
  • the rearrangement sequence number extracting unit 1002 is configured to extract a rearranged sequence number from each of the at least one PDU;
  • the information processing unit 1003 is configured to determine, according to the rearrangement sequence number, an information transmission order of an RLC entity corresponding to each of the PDUs, to determine, according to the information transmission order, to sort the at least one PDU.
  • connection function between the PDCP entity and the at least one RLC entity may be as shown in FIG. 2 and FIG. 3, and it can be seen that one PDCP entity can manage one or more RLC entities; in addition, the figure shows MAC entities and other functional entities are not described here.
  • One bearer in the PDCP needs to be mapped with multiple RLC bearers.
  • the PDCP entity function provided in this embodiment may include a routing function, which is responsible for data routing with multiple RLC entities through routing functions, and RSN distribution for sorting. When routing data to different RLC entities, it needs to correspond to a unique RSN. RSN cycle Used sequentially, the sequence between PDCP PDUs that different RLC entities need to send can be confirmed through the RSN.
  • the method further includes:
  • the PDCP entity extracts a sequence number SN from each of the received at least one PDU.
  • the PDCP entity further includes:
  • the sequence number extracting unit 1004 is configured to extract the sequence number SN from each of the received at least one PDU.
  • the location of the SN and the reordering sequence number in each PDU may be that a preset number of data bits are added before or after the data bit of the SN of the original PDU, and the rearrangement is increased by a preset number of data bits. serial number.
  • the information processing unit 1003 is configured to sort the at least one PDU based on the SN and the reordering sequence number.
  • the information processing unit 1003 performs PDCP PDUs sent by multiple RLC entities for sorting. Ensure that the PDCP SN is processed in order, while maintaining HFN and COUNT values.
  • the original reordering function is optimized.
  • the sequence numbering function is responsible for the sequential maintenance of the PDCP SN.
  • the Routing function is responsible for the PDCP PDUs being sent to different RLC entities and also for the sequential maintenance of the PDCP RSNs.
  • An example diagram of the sending end routing function is shown in FIG. 5, and multiple PDCP PDUs sent to the same RLC entity at the same time use the same RSN.
  • the schematic diagram of reordering at the receiving end is shown in Figure 8.
  • the PDCP can sort these PDCP PDUs using the RSN.
  • the PDCP SNs that can be guaranteed by a single RLC are sequentially delivered, and the receiving end can sort the inter-RLC PDCP PDUs through the RSN, and through the RSN+SN two-stage mode, multiple PDCPs that have been internally sorted according to the RSN.
  • the PDUs are serially connected in sequence to complete the reordering of all PDCP PDUs, compared to the existing PDCP SN only.
  • the sorting method simplifies the sorting process.
  • the RLC cannot guarantee that the data submitted to the PDCP is in order.
  • the existing scheme is in the PDCP transmitted by multiple RLC entities.
  • the SN number span is too large. Since the COUNT value maintenance in the prior art only has one plus and minus one operations, there is a problem that the reordering window is not suitable and the COUNT value is calculated ambiguously.
  • the SN number with a large span can be converted into an RSN with a small span and easy to sort. By maintaining the order of the RSN, the easy maintenance of the COUNT value is guaranteed.
  • the RSN can also be considered as a further extension of the SN length, or a two-level PDCP SN.
  • the rearrangement sequence number is added to the information sending sequence corresponding to the RLC entity to be mapped by the PDU.
  • the PDUs sent by different RLC entities can be distinguished by reordering the sequence numbers, so that the receiving end can sort the rearranged sequence numbers in addition to the SNs of the original PDUs, thereby reducing the sorting delay of the PDUs, thereby improving the processing efficiency of the receiving end.
  • the technical solution of the present application which is essential or contributes to the prior art, may be embodied in the form of a software product stored in a storage medium (such as ROM/RAM,
  • a storage medium such as ROM/RAM,
  • the disk, the optical disk includes a plurality of instructions for causing a terminal device (which may be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to perform the method described in the various embodiments of the present application.
  • Embodiments of the present application also provide a PDCP entity, including: a processor and a memory configured to store a computer program executable on the processor,
  • the processor is configured to perform the steps of the first embodiment or the second embodiment when the computer program is executed.
  • Embodiments of the present application also provide a computer storage medium storing computer executable instructions that, when executed, implement the steps of one or both of the foregoing embodiments.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Communication Control (AREA)

Abstract

本申请公开了一种信息发送方法、信息接收方法及PDCP实体、计算机存储介质，所述方法包括：分组数据汇聚协议PDCP实体确定自身管理的至少一个RLC实体的信息发送顺序，基于所述信息发送顺序确定每一个RLC实体对应的重排序列号；确定每一个所述RLC实体所要发送的数据协议单元PDU，将所述重排序列号添加至所述PDU；映射所述PDU至对应的RLC实体。

Description

信息发送方法、信息接收方法及PDCP实体、计算机存储介质
相关申请的交叉引用
本申请基于申请号为201611156021.8、申请日为2016年12月14日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此引入本申请作为参考。
技术领域
本申请涉及通信领域中的信息处理技术，尤其涉及一种信息发送方法、信息接收方法及分组数据汇聚协议(PDCP，Packet Data Convergence Protocol)实体、计算机存储介质。
背景技术
随着移动互联网和物联网的高速发展，5G网络需要提供更高流量，服务更多终端并支持更多连接。为了满足增强型移动宽带类业态、低时延高可靠等新业务的需求，提出了双连接、C/U分离、C-RAN分布式网络架构等一系列方案。在这些方案中会出现PDCP与RLC的一对多映射关系。这样就带来的新的挑战，以往排序是由RLC完成，现在PDCP中的一个承载需要与多个RLC承载相映射，仅仅在其中一个RLC承载中保证顺序递交，无法保证映射到同一个PDCP承载的多个RLC承载间的顺序递交，进而就无法保证在接收到PDU时快速的进行排序。
发明内容
本申请的主要目的在于提出一种信息发送方法、信息接收方法及分组数据汇聚协议(PDCP，Packet Data Convergence Protocol)实体、计算机存 储介质，旨在解决现有技术中存在的上述问题。
为实现上述目的，本申请提供的一种信息发送方法，所述方法包括：
分组数据汇聚协议PDCP实体确定自身管理的至少一个RLC实体的信息发送顺序，基于所述信息发送顺序确定每一个RLC实体对应的重排序列号；
确定每一个所述RLC实体所要发送的数据协议单元PDU，将所述重排序列号添加至所述PDU；
映射所述PDU至对应的RLC实体。
本申请提供的一种信息接收方法，所述方法包括：
PDCP实体接收到至少一个RLC实体发来的至少一个PDU；
从所述至少一个PDU中的每一个PDU中提取得到重排序列号；
基于所述重排序列号确定每一个所述PDU所对应的RLC实体的信息发送顺序，以至少基于所述信息发送顺序确定对所述至少一个PDU进行排序。
本申请提供的一种PDCP实体，所述PDCP实体包括：
重排序列号生成单元，配置为确定自身管理的至少一个RLC实体的信息发送顺序，基于所述信息发送顺序确定每一个RLC实体对应的重排序列号；
信息处理单元，配置为确定每一个所述RLC实体所要发送的数据协议单元PDU，将所述重排序列号添加至所述PDU；
映射单元，配置为映射所述PDU至对应的RLC实体。
本申请提供的一种PDCP实体，所述PDCP实体包括：
信息接收单元，配置为接收到至少一个RLC实体发来的至少一个PDU；
重排序列号提取单元，配置为从所述至少一个PDU中的每一个PDU中提取得到重排序列号；
信息处理单元，配置为基于所述重排序列号确定每一个所述PDU所对应的RLC实体的信息发送顺序，以至少基于所述信息发送顺序确定对所述至少一个PDU进行排序。
本申请提出的一种PDCP实体，包括：处理器和配置为存储能够在处理器上运行的计算机程序的存储器，
其中，所述处理器配置为运行所述计算机程序时，执行前述方法的步骤。
本申请提出的一种计算机存储介质，所述计算机存储介质存储有计算机可执行指令，所述计算机可执行指令被执行时实现前述方法的步骤。
本申请提出的一种信息发送方法、信息接收方法及PDCP实体、计算机存储介质，在PDCP实体发送PDU的时候，为PDU所要映射的RLC实体对应的信息发送顺序添加重排序列号。如此，就能够通过重排序列号区分不同RLC实体发送的PDU，使得接收端能够除了原PDU的SN之外通过重排序列号进行排序，减少了PDU的排序时延，从而提升接收端的处理效率。
附图说明
图1为本申请实施例信息发送方法流程示意图；
图2为本申请实施例处理场景示意图一；
图3为本申请实施例处理场景示意图二；
图4为本申请实施例处理场景示意图三；
图5为本申请实施例处理场景示意图四；
图6为本申请实施例处理场景示意图五；
图7为本申请实施例信息接收方法流程示意图；
图8为本申请实施例连接处理场景示意图六；
图9为本申请实施例PDCP组成结构示意图一；
图10为本申请实施例PDCP组成结构示意图二。
具体实施方式
下面结合附图和具体实施例对本申请作进一步详细说明。
实施例一、
本申请实施例提供了一种信息发送方法，如图1所示，包括：
步骤101：分组数据汇聚协议PDCP实体确定自身管理的至少一个RLC实体的信息发送顺序，基于所述信息发送顺序确定每一个RLC实体对应的重排序列号；
步骤102：确定每一个所述RLC实体所要发送的数据协议单元PDU，将所述重排序列号添加至所述PDU；
步骤103：映射所述PDU至对应的RLC实体。
这里，所述PDCP实体与至少一个RLC实体之间的连接功能可以如图2、图3所示，通过图中可以看出一个PDCP实体能够管理一个或多个RLC实体；另外，图中所示的MAC实体以及其他功能实体这里不进行赘述。PDCP与RLC的一对多映射关系。PDCP中的一个承载需要与多个RLC承载相映射。
关于PDCP实体中的功能可以参见图4，其中路由功能和排序功能做了增强，参见图5，本实施例提供的PDCP实体功能可以包括有路由功能和排序功能，通过路由功能负责与多个RLC实体之间的数据路由，以及排序使用的RSN分发。向不同RLC实体进行数据路由时，需要与唯一的RSN相对应。RSN循环顺序使用，通过RSN即可确认不同RLC实体需要发送的PDCP PDU间的顺序。排序功能通过RSN将从不同RLC实体接收到的数据进行排序。
也就是说，上述步骤101中PDCP实体能够基于自身管理的多个RLC实体确定不同RLC实体的信息发送顺序，比如，图6所示，当前管理了三 个RLC实体，每一个RLC实体均对应一个载波，分别为bearer1～3；确定了三个RLC时的发送顺序之后，根据发送顺序确定每一个RLC实体的重排序列号，所述重排序列号可以表示为RSN，如图中所示的RSN#i～i+2；其中，i可以为整数。也就是将这三个RLC实体用于发送PDCP PDU的顺序分别通过重排序列号进行区分。
在上述场景之上，所述确定每一个所述RLC实体所要发送的PDU之前，所述方法还包括：所述PDCP实体为所要发送的至少一个PDU分配序列号SN。
每一个PDU分配序列号RSN的方式可以为：同时发往同一个RLC的PDCP PDU组采用同一个RSN，并且RSN按照多个PDCP PDU组之间的先后顺序进行编号。
进一步地，本实施例还包括有：将SN以及所述重排序列号添加至所述PDU。其中，在每一个PDU中添加SN以及所述重排序列号的位置可以为，在原PDU的SN的数据位之前或之后增加预设数量的数据位，通过预设数量的数据位增加所述重排序列号。
可见，通过采用上述方案，就能够在PDCP实体发送PDU的时候，为PDU所要映射的RLC实体对应的信息发送顺序添加重排序列号。如此，就能够通过重排序列号区分不同RLC实体发送的PDU，使得接收端能够除了原PDU的SN之外通过重排序列号进行排序，减少了PDU的排序时延，从而提升接收端的处理效率。
实施例二、
本申请实施例提供了一种信息接收方法，如图7所示，包括：
步骤701：PDCP实体接收到至少一个RLC实体发来的至少一个PDU；
步骤702：从所述至少一个PDU中的每一个PDU中提取得到重排序列号；
步骤703：基于所述重排序列号确定每一个所述PDU所对应的RLC实体的信息发送顺序，以至少基于所述信息发送顺序确定对所述至少一个PDU进行排序。
这里，所述PDCP实体与至少一个RLC实体之间的连接功能可以如图2、图3所示，通过图中可以看出一个PDCP实体能够管理一个或多个RLC实体；另外，图中所示的MAC实体以及其他功能实体这里不进行赘述。PDCP与RLC的一对多映射关系。PDCP中的一个承载需要与多个RLC承载相映射。
参见图5，本实施例提供的PDCP实体功能可以包括有路由功能，通过路由功能负责与多个RLC实体之间的数据路由，以及排序使用的RSN分发。向不同RLC实体进行数据路由时，需要与唯一的RSN相对应。RSN循环顺序使用，通过RSN即可确认不同RLC实体需要发送的PDCP PDU间的顺序。
在上述场景之上，所述从所述至少一个PDU中的每一个PDU中提取得到重排序列号之前，所述方法还包括：
所述PDCP实体从接收到的所述至少一个PDU中的每一个PDU中提取得到序列号SN。
进一步地，本实施例还包括有：基于所述SN以及所述重排序列号，对所述至少一个PDU进行排序。
其中，在每一个PDU中SN以及所述重排序列号的位置可以为，在原PDU的SN的数据位之前或之后增加预设数量的数据位，通过预设数量的数据位增加所述重排序列号。
Reordering，进行多个RLC实体发送来的PDCP PDU进行排序。确保PDCP SN的按序处理，同时进行HFN和COUNT值的维护。
将原有的重排序功能做了优化，Sequence numbering功能负责PDCP SN 的顺序维护，Routing功能在向不同RLC实体发送PDCP PDU的同时也负责PDCP RSN的顺序维护，RSN循环顺序使用。发送端路由功能的示例图如图5所示，同一时间向同一RLC实体发送的多个PDCP PDU使用同一个RSN。接收端重排序的示意图如图8所示，PDCP可以使用RSN对这些PDCP PDU进行排序。在非重建立情况下，单个RLC可以保证的PDCP SN是顺序递交，而接收端通过RSN可以对RLC间PDCP PDU进行排序，通过RSN+SN两级方式，按照RSN将多段已经内部排序完成的PDCP PDU进行按序串接，就可以完成所有PDCP PDU的重排序，相比现有仅通过PDCP SN排序的方法简化了排序的流程。对于重建立情况下，RLC不能完全保证递交给PDCP的数据是按序的，尤其是AM情况下，会存在部分PDCP SN乱序的情况，现有的方案在经过多个RLC实体传输的PDCP在对应空口时延相差较大的情况下，SN号跨度过大，由于现有技术中COUNT值维护只有加一和减一的操作，会存在重排序窗口不合适和COUNT值计算歧义的问题。本方案通过增加RSN，可以将跨度较大的SN号转化为跨度较小便于排序的RSN，通过维护RSN的顺序，保证了COUNT值的易维护性。RSN也可以认为是将SN长度进一步的扩展，或者两级PDCP SN。
可见，通过采用上述方案，就能够在PDCP实体发送PDU的时候，为PDU所要映射的RLC实体对应的信息发送顺序添加重排序列号。如此，就能够通过重排序列号区分不同RLC实体发送的PDU，使得接收端能够除了原PDU的SN之外通过重排序列号进行排序，减少了PDU的排序时延，从而提升接收端的处理效率。
实施例三、
本申请实施例提供了一种PDCP实体，如图9所示，包括：
重排序列号生成单元91，配置为确定自身管理的至少一个RLC实体的信息发送顺序，基于所述信息发送顺序确定每一个RLC实体对应的重排序 列号；
信息处理单元92，配置为确定每一个所述RLC实体所要发送的数据协议单元PDU，将所述重排序列号添加至所述PDU；
映射单元93，配置为映射所述PDU至对应的RLC实体。
这里，所述PDCP实体与至少一个RLC实体之间的连接功能可以如图2、图3所示，通过图中可以看出一个PDCP实体能够管理一个或多个RLC实体；另外，图中所示的MAC实体以及其他功能实体这里不进行赘述。PDCP与RLC的一对多映射关系。PDCP中的一个承载需要与多个RLC承载相映射。
参见图5，本实施例提供的PDCP实体功能可以包括有路由功能，通过路由功能负责与多个RLC实体之间的数据路由，以及排序使用的RSN分发。向不同RLC实体进行数据路由时，需要与唯一的RSN相对应。RSN循环顺序使用，通过RSN即可确认不同RLC实体需要发送的PDCP PDU间的顺序。
也就是说，PDCP实体能够基于自身管理的多个RLC实体确定不同RLC实体的信息发送顺序，比如，图6所示，当前管理了三个RLC实体，每一个RLC实体均对应一个载波，分别为bearer1～3；确定了三个RLC时的发送顺序之后，根据发送顺序确定每一个RLC实体的重排序列号，所述重排序列号可以表示为RSN，如图中所示的RSN#i～i+2；其中，i可以为整数。也就是将这三个RLC实体用于发送PDCP PDU的顺序分别通过重排序列号进行区分。
在上述场景之上，所述PDCP实体还包括：
序列号生成单元94，配置为为所要发送的至少一个PDU分配序列号SN。
进一步地，所述信息处理单元92，配置为将所述SN以及所述重排序 列号添加至所述PDU。其中，在每一个PDU中添加SN以及所述重排序列号的位置可以为，在原PDU的SN的数据位之前或之后增加预设数量的数据位，通过预设数量的数据位增加所述重排序列号。
可见，通过采用上述方案，就能够在PDCP实体发送PDU的时候，为PDU所要映射的RLC实体对应的信息发送顺序添加重排序列号。如此，就能够通过重排序列号区分不同RLC实体发送的PDU，使得接收端能够除了原PDU的SN之外通过重排序列号进行排序，减少了PDU的排序时延，从而提升接收端的处理效率。
实施例四、
本申请实施例提供了一种PDCP实体，如图10所示，包括：
信息接收单元1001，配置为接收到至少一个RLC实体发来的至少一个PDU；
重排序列号提取单元1002，配置为从所述至少一个PDU中的每一个PDU中提取得到重排序列号；
信息处理单元1003，配置为基于所述重排序列号确定每一个所述PDU所对应的RLC实体的信息发送顺序，以至少基于所述信息发送顺序确定对所述至少一个PDU进行排序。
这里，所述PDCP实体与至少一个RLC实体之间的连接功能可以如图2、图3所示，通过图中可以看出一个PDCP实体能够管理一个或多个RLC实体；另外，图中所示的MAC实体以及其他功能实体这里不进行赘述。PDCP与RLC的一对多映射关系。PDCP中的一个承载需要与多个RLC承载相映射。
参见图5，本实施例提供的PDCP实体功能可以包括有路由功能，通过路由功能负责与多个RLC实体之间的数据路由，以及排序使用的RSN分发。向不同RLC实体进行数据路由时，需要与唯一的RSN相对应。RSN循环 顺序使用，通过RSN即可确认不同RLC实体需要发送的PDCP PDU间的顺序。
在上述场景之上，所述从所述至少一个PDU中的每一个PDU中提取得到重排序列号之前，所述方法还包括：
所述PDCP实体从接收到的所述至少一个PDU中的每一个PDU中提取得到序列号SN。
进一步地，所述PDCP实体还包括：
序列号提取单元1004，配置为从接收到的所述至少一个PDU中的每一个PDU中提取得到序列号SN。
其中，在每一个PDU中SN以及所述重排序列号的位置可以为，在原PDU的SN的数据位之前或之后增加预设数量的数据位，通过预设数量的数据位增加所述重排序列号。
所述信息处理单元1003，配置为基于所述SN以及所述重排序列号，对所述至少一个PDU进行排序。
所述信息处理单元1003进行多个RLC实体发送来的PDCP PDU进行排序。确保PDCP SN的按序处理，同时进行HFN和COUNT值的维护。
将原有的重排序功能做了优化，Sequence numbering功能负责PDCP SN的顺序维护，Routing功能在向不同RLC实体发送PDCP PDU的同时也负责PDCP RSN的顺序维护，RSN循环顺序使用。发送端路由功能的示例图如图5所示，同一时间向同一RLC实体发送的多个PDCP PDU使用同一个RSN。接收端重排序的示意图如图8所示，PDCP可以使用RSN对这些PDCP PDU进行排序。在非重建立情况下，单个RLC可以保证的PDCP SN是顺序递交，而接收端通过RSN可以对RLC间PDCP PDU进行排序，通过RSN+SN两级方式，按照RSN将多段已经内部排序完成的PDCP PDU进行按序串接，就可以完成所有PDCP PDU的重排序，相比现有仅通过PDCP SN 排序的方法简化了排序的流程。对于重建立情况下，RLC不能完全保证递交给PDCP的数据是按序的，尤其是AM情况下，会存在部分PDCP SN乱序的情况，现有的方案在经过多个RLC实体传输的PDCP在对应空口时延相差较大的情况下，SN号跨度过大，由于现有技术中COUNT值维护只有加一和减一的操作，会存在重排序窗口不合适和COUNT值计算歧义的问题。本方案通过增加RSN，可以将跨度较大的SN号转化为跨度较小便于排序的RSN，通过维护RSN的顺序，保证了COUNT值的易维护性。RSN也可以认为是将SN长度进一步的扩展，或者两级PDCP SN。
可见，通过采用上述方案，就能够在PDCP实体发送PDU的时候，为PDU所要映射的RLC实体对应的信息发送顺序添加重排序列号。如此，就能够通过重排序列号区分不同RLC实体发送的PDU，使得接收端能够除了原PDU的SN之外通过重排序列号进行排序，减少了PDU的排序时延，从而提升接收端的处理效率。
需要说明的是，在本文中，术语“包括”、“包含”或者其任何其他变体意在涵盖非排他性的包含，从而使得包括一系列要素的过程、方法、物品或者装置不仅包括那些要素，而且还包括没有明确列出的其他要素，或者是还包括为这种过程、方法、物品或者装置所固有的要素。在没有更多限制的情况下，由语句“包括一个……”限定的要素，并不排除在包括该要素的过程、方法、物品或者装置中还存在另外的相同要素。
上述本申请实施例序号仅仅为了描述，不代表实施例的优劣。
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到上述实施例方法可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件，但很多情况下前者是更佳的实施方式。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质(如ROM/RAM、 磁碟、光盘)中，包括若干指令用以使得一台终端设备(可以是手机，计算机，服务器，空调器，或者网络设备等)执行本申请各个实施例所述的方法。
以上仅为本申请的优选实施例，并非因此限制本申请的专利范围，凡是利用本申请说明书及附图内容所作的等效结构或等效流程变换，或直接或间接运用在其他相关的技术领域，均同理包括在本申请的专利保护范围内。
本申请的实施例还提供了一种PDCP实体，包括：处理器和配置为存储能够在处理器上运行的计算机程序的存储器，
其中，所述处理器配置为运行所述计算机程序时，执行前述实施例一或二的步骤。
本申请的实施例还提供了一种计算机存储介质，所述计算机存储介质存储有计算机可执行指令，所述计算机可执行指令被执行时实现前述实施例一或二的步骤。
以上所述，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本申请的保护范围之内。因此，本申请的保护范围应以所述权利要求的保护范围为准。

Claims (14)

  1. 一种信息发送方法，所述方法包括：
    分组数据汇聚协议PDCP实体确定自身管理的至少一个无线链路协议RLC实体的信息发送顺序，基于所述信息发送顺序确定每一个RLC实体对应的重排序列号；
    确定每一个所述RLC实体所要发送的数据协议单元PDU，将所述重排序列号添加至所述PDU；
    映射所述PDU至对应的RLC实体。
  2. 根据权利要求1所述的方法，其中，所述确定每一个所述RLC实体所要发送的PDU之前，所述方法还包括：
    所述PDCP实体为所要发送的至少一个PDU分配序列号SN。
  3. 根据权利要求2所述的方法，其中，所述确定每一个所述RLC实体所要发送的PDU之后，所述方法还包括：
    将所述SN以及所述重排序列号添加至所述PDU。
  4. 一种信息接收方法，所述方法包括：
    PDCP实体接收到至少一个RLC实体发来的至少一个PDU；
    从所述至少一个PDU中的每一个PDU中提取得到重排序列号；
    基于所述重排序列号确定每一个所述PDU所对应的RLC实体的信息发送顺序，以至少基于所述信息发送顺序确定对所述至少一个PDU进行排序。
  5. 根据权利要求4所述的方法，其中，所述方法还包括：
    所述PDCP实体从接收到的所述至少一个PDU中的每一个PDU中提取得到序列号SN。
  6. 根据权利要求5所述的方法，其中，所述至少基于所述信息发送顺序确定对所述至少一个PDU进行排序，所述方法还包括：
    基于所述SN、以及所述重排序列号所对应的RLC实体的信息发送顺序，对所述至少一个PDU进行排序。
  7. 一种PDCP实体，所述PDCP实体包括：
    重排序列号生成单元，配置为确定自身管理的至少一个RLC实体的信息发送顺序，基于所述信息发送顺序确定每一个RLC实体对应的重排序列号；
    信息处理单元，配置为确定每一个所述RLC实体所要发送的数据协议单元PDU，将所述重排序列号添加至所述PDU；
    映射单元，配置为映射所述PDU至对应的RLC实体。
  8. 根据权利要求7所述的PDCP实体，其中，所述PDCP实体还包括：
    序列号生成单元，配置为为所要发送的至少一个PDU分配序列号SN。
  9. 根据权利要求8所述的PDCP实体，其中，所述信息处理单元，配置为将所述SN以及所述重排序列号添加至所述PDU。
  10. 一种PDCP实体，所述PDCP实体包括：
    信息接收单元，配置为接收到至少一个RLC实体发来的至少一个PDU；
    重排序列号提取单元，配置为从所述至少一个PDU中的每一个PDU中提取得到重排序列号；
    信息处理单元，配置为基于所述重排序列号确定每一个所述PDU所对应的RLC实体的信息发送顺序，以至少基于所述信息发送顺序确定对所述至少一个PDU进行排序。
  11. 根据权利要求10所述的PDCP实体，其中，所述PDCP实体还包括：
    序列号提取单元，配置为从接收到的所述至少一个PDU中的每一个PDU中提取得到序列号SN。
  12. 根据权利要求11所述的PDCP实体，其中，所述信息处理单元， 配置为基于所述SN以及所述重排序列号，对所述至少一个PDU进行排序。
  13. 一种PDCP实体，包括：处理器和配置为存储能够在处理器上运行的计算机程序的存储器，
    其中，所述处理器配置为运行所述计算机程序时，执行权利要求1-6任一项所述方法的步骤。
  14. 一种计算机存储介质，所述计算机存储介质存储有计算机可执行指令，所述计算机可执行指令被执行时实现权利要求1-6任一项所述方法的步骤。
PCT/CN2017/116171 2016-12-14 2017-12-14 信息发送方法、信息接收方法及pdcp实体、计算机存储介质 WO2018108127A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US16/469,397 US11166188B2 (en) 2016-12-14 2017-12-14 Method for transmitting information, method for receiving information, PDCP entity, and computer storage medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201611156021.8A CN108234550B (zh) 2016-12-14 2016-12-14 一种信息发送方法、信息接收方法及pdcp实体
CN201611156021.8 2016-12-14

Publications (1)

Publication Number Publication Date
WO2018108127A1 true WO2018108127A1 (zh) 2018-06-21

Family

ID=62558039

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/116171 WO2018108127A1 (zh) 2016-12-14 2017-12-14 信息发送方法、信息接收方法及pdcp实体、计算机存储介质

Country Status (3)

Country Link
US (1) US11166188B2 (zh)
CN (1) CN108234550B (zh)
WO (1) WO2018108127A1 (zh)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110475287A (zh) * 2018-05-10 2019-11-19 华为技术有限公司 数据处理的方法及设备
TWI763131B (zh) * 2020-11-18 2022-05-01 瑞昱半導體股份有限公司 網路介面裝置、包含該網路介面裝置之電子裝置，及網路介面裝置的操作方法
CN114615219B (zh) * 2020-11-24 2024-03-08 瑞昱半导体股份有限公司 网络接口装置、电子装置以及网络接口装置的操作方法
WO2022178778A1 (zh) * 2021-02-25 2022-09-01 华为技术有限公司 一种数据传输方法及通信装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101030842A (zh) * 2006-03-03 2007-09-05 华为技术有限公司 移动通信系统中数据的重排方法及其装置
CN101374331A (zh) * 2007-08-20 2009-02-25 华为技术有限公司 配置无线链路控制层序列号的方法、系统和设备
CN102638328A (zh) * 2011-02-15 2012-08-15 电信科学技术研究院 一种数据传输的方法及装置
CN103141051A (zh) * 2010-10-01 2013-06-05 交互数字专利控股公司 用于启动从多个传输点的接收的mac和rlc架构和程序

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6725040B2 (en) * 2001-07-09 2004-04-20 Asustek Computer Inc. Lossless SRNS relocation procedure in a wireless communications system
KR100747464B1 (ko) * 2002-01-05 2007-08-09 엘지전자 주식회사 고속하향링크패킷접속（ｈｓｄｐａ）시스템을 위한타이머를 이용한 교착상황 회피방법
AU2005302888B2 (en) * 2004-11-09 2008-05-22 Samsung Electronics Co., Ltd. Method and apparatus for signaling control information of uplink packet data service in mobile communication system
CN101330492B (zh) * 2007-06-19 2012-08-01 上海贝尔股份有限公司 数据发送方法、数据接收方法和设备
CN101795494B (zh) * 2009-02-03 2012-10-10 中国移动通信集团公司 一种lte-a系统内的数据分流方法、装置及系统
US9723496B2 (en) * 2011-11-04 2017-08-01 Qualcomm Incorporated Method and apparatus for interference cancellation by a user equipment using blind detection
CN104935413B (zh) 2014-03-19 2019-12-27 夏普株式会社 分组数据汇聚协议pdcp实体及其执行的方法
US9628586B2 (en) * 2014-08-29 2017-04-18 Lg Electronics Inc. PDCP operation in a wireless communication system supporting dual connectivity

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101030842A (zh) * 2006-03-03 2007-09-05 华为技术有限公司 移动通信系统中数据的重排方法及其装置
CN101374331A (zh) * 2007-08-20 2009-02-25 华为技术有限公司 配置无线链路控制层序列号的方法、系统和设备
CN103141051A (zh) * 2010-10-01 2013-06-05 交互数字专利控股公司 用于启动从多个传输点的接收的mac和rlc架构和程序
CN102638328A (zh) * 2011-02-15 2012-08-15 电信科学技术研究院 一种数据传输的方法及装置

Also Published As

Publication number Publication date
CN108234550A (zh) 2018-06-29
US11166188B2 (en) 2021-11-02
CN108234550B (zh) 2020-06-12
US20200112870A1 (en) 2020-04-09

Similar Documents

Publication Publication Date Title
WO2018108127A1 (zh) 信息发送方法、信息接收方法及pdcp实体、计算机存储介质
US8036219B2 (en) Efficiency improvement for shared communications networks
US9973400B2 (en) Network flow information collection method and apparatus
WO2014101777A1 (zh) 流表匹配方法和装置以及交换机
CN106899500B (zh) 一种跨虚拟可扩展局域网的报文处理方法及装置
EP3863242A1 (en) Routing management method and apparatus
CN107404396B (zh) 一种数据传输方法和装置
EP2719221A2 (en) Method and system of transmitting and receiving fragmentable data units in a wireless communication environment
US20170295019A1 (en) Communication device and packet transmission/reception program
WO2012100671A1 (zh) 一种绑定物理网口的方法、网卡及通信系统
US8428060B2 (en) Determining the group address for an Ethernet-based multicast communication
US11444877B2 (en) Packet flow identification with reduced decode operations
CN102201996B (zh) 网络地址转换环境中报文转发的方法及设备
WO2019165855A1 (zh) 一种报文传输的方法及装置
WO2011157190A2 (zh) 数据接收处理方法及装置
US20070189245A1 (en) Wlan device and method for numbering frames with sequence numbers
US8488489B2 (en) Scalable packet-switch
KR102601348B1 (ko) 데이터 송신 방법, 송신 장치, 데이터 수신 방법 및 수신 장치
WO2016061987A1 (zh) 报文处理方法及装置
EP2862334A1 (en) Data compression in a communications network
CN1697445A (zh) 一种实现虚拟私有网络中数据传输的方法
WO2019015487A1 (zh) 一种数据重传处理方法、rlc实体和mac实体
CN107360594B (zh) 一种信息处理方法及装置
CN107800653A (zh) 报文压缩方法及装置
CN109462591B (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: 17880858

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205 DATED 01/10/2019)

122 Ep: pct application non-entry in european phase

Ref document number: 17880858

Country of ref document: EP

Kind code of ref document: A1