WO2018107925A1 - Procédé et appareil de traitement de flus de données et support de stockage informatique - Google Patents

Procédé et appareil de traitement de flus de données et support de stockage informatique Download PDF

Info

Publication number
WO2018107925A1
WO2018107925A1 PCT/CN2017/109993 CN2017109993W WO2018107925A1 WO 2018107925 A1 WO2018107925 A1 WO 2018107925A1 CN 2017109993 W CN2017109993 W CN 2017109993W WO 2018107925 A1 WO2018107925 A1 WO 2018107925A1
Authority
WO
WIPO (PCT)
Prior art keywords
data stream
node
data
level information
data packet
Prior art date
Application number
PCT/CN2017/109993
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 WO2018107925A1 publication Critical patent/WO2018107925A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
    • 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/18—Automatic repetition systems, e.g. Van Duuren systems
    • 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

Definitions

  • the present invention relates to the field of communications technologies, and in particular, to a data stream processing method and apparatus, and a computer storage medium.
  • the data flows with the same Quality of Service (QoS) requirements are aggregated into bearers, and the access network (AN, Access Network and the core network (CN, Core Network) handle QoS by bearer.
  • the access network includes an evolved base station (eNB) and a user equipment (UE, User Equipment).
  • eNB evolved base station
  • UE User Equipment
  • FIG. 1 the network side bearer on the S1 interface between the eNB and the core network and the radio bearer on the air interface between the eNB and the UE are 1:1.
  • the QoS policy is controlled by the core network.
  • the base station can only passively accept or reject the QoS parameters.
  • the base station cannot adjust the QoS parameters according to the actual wireless load, and the core network cannot know the current actual wireless load, so it is difficult to make a reasonable one. QoS decision making.
  • the fifth generation (5G, 5Generation) new technology research currently under development is aimed at improving the performance of 1000 times of network throughput, 100 times of device connection, and 10 times of low latency compared to 4G. This requires the 5G system to have a new and better QoS mechanism to a certain extent.
  • the 5G system will adopt a unified technology architecture to support enhanced mobile broadband (eMBB), massive machine type communication (mMTC), and high reliability and low latency communication (URLLC, Ultra Reliable and Low Latency). Communication) and other services.
  • eMBB enhanced mobile broadband
  • mMTC massive machine type communication
  • URLLC Ultra Reliable and Low Latency
  • Communication Communication
  • the core network, base station and UE will all undergo major evolution.
  • FIG. 2 similar to the X2 interface between eNBs in a 4G system, in a 5G system, there may also be a direct interface between 5G base stations, which is referred to herein as an Xn interface.
  • the interface between the 5G base station and the 5G core network is referred to herein as an NG interface.
  • the access network's QoS processing will still be carried out under the concept of bearer.
  • the core network will adopt a new mechanism for the processing of QoS, and currently tends to adopt the feeling of flow.
  • Multiple streams (hereinafter referred to as data streams) in the core network can be mapped to a single bearer in the access network.
  • some data packets may be critical. Once lost, there may be a big impact. For example, some key data packets are dependent on multiple data packets. If the key data packets are lost, more Even if the packets are received, they cannot be parsed normally and can only be discarded passively.
  • the 5G system puts forward higher requirements for QoS. Therefore, how to improve the service quality of the data stream must be solved in the 5G system.
  • an embodiment of the present invention provides a data stream processing method and apparatus, and a computer storage medium.
  • the invention discloses a data stream processing method, which comprises:
  • the first node receives the data stream, and determines key level information of each data packet in the data stream;
  • the first node determines that the second node does not receive the data packet before the timer expires, the first node retransmits the data packet to the second node.
  • a receiving unit configured to receive a data stream
  • a determining unit configured to determine key level information of each data packet in the data stream
  • a setting unit configured to set a corresponding discarding timer for each of the data packets according to the key level information of each of the data packets
  • Activating unit configured to: when the data packet is sent to the second node, start a discarding timer corresponding to the data packet;
  • a retransmission unit configured to: if the first node determines that the second node does not receive the data packet before the timer expires, the first node resends the data packet to the Said second node.
  • the embodiment of the invention further provides a computer storage medium storing a computer program configured to execute the processing method of the data stream.
  • the first node receives the data stream, and determines key level information of each data packet in the data stream; the first node is used as the data according to the key level information of each data packet. Setting a corresponding discard timer; when the first node sends the data packet to the second node, starting a discard timer corresponding to the data packet; if the timer expires, the first The node determines that the second node does not receive the data packet, and the first node retransmits the data packet to the second node, and the data packet retransmission may be performed multiple times until After the timer expires, the packet will be discarded.
  • a corresponding discarding timer is set for each data packet according to the key level information of each data packet in the data stream, so as to ensure that the data packet with a higher critical level can be received by the receiving end to the maximum extent. Further improving the service quality of the data stream and improving the user's service Experience.
  • Figure 1 is a schematic diagram of a 4G system
  • FIG. 2 is a schematic diagram of a 5G system
  • FIG. 3 is a schematic flowchart 1 of a method for processing a data stream according to an embodiment of the present invention
  • FIG. 4 is a second schematic flowchart of a method for processing a data stream according to an embodiment of the present invention.
  • FIG. 5 is a schematic flowchart 3 of a method for processing a data stream according to an embodiment of the present invention.
  • FIG. 6 is a schematic flowchart 4 of a method for processing a data stream according to an embodiment of the present invention.
  • FIG. 7 is a schematic flowchart 5 of a method for processing a data stream according to an embodiment of the present invention.
  • FIG. 8 is a schematic structural diagram of a data stream processing apparatus according to an embodiment of the present invention.
  • the first node receives the data stream generated by the second node or the local node, and respectively sets a corresponding discarding timer according to the key level information of each data packet in the data stream. The longer the longer the critical packet's drop timer is set, the more critical the packet will be discarded.
  • FIG. 3 is a schematic flowchart of a method for processing a data stream according to an embodiment of the present invention. As shown in FIG. 3, the method for processing the data stream includes the following steps:
  • Step 301 The first node receives the data stream, and determines key level information of each data packet in the data stream.
  • the first node receives the data stream, including:
  • the first node receives the data stream sent by the third node.
  • the first node receives the data stream generated by the local node.
  • the determining the level information of each data packet in the data stream includes: extracting key level information from each data packet in the data stream.
  • the key level information is represented by a predetermined number of bits.
  • 0 means a normal data packet
  • 1 means a key data packet
  • 00 means a normal data packet
  • 01, 10, and 11 indicate Critical data packets, and the criticality is increased in turn, that is, 11 is the highest critical level.
  • the determining the key level information of each data packet in the data stream includes: acquiring key level information of the data stream, and using the key level information of the data stream as the data stream Key level information for each packet in .
  • the first node receives a plurality of data streams generated by the second node or the local node, acquires key level information of each data stream, and sets corresponding data packets in each data stream according to key level information of each data stream. Discard the timer. For example, the longer the discard timer for packets belonging to a higher-priority data stream is set, to ensure that packets in the higher-level data stream are less discarded.
  • the obtaining key level information of the data stream includes:
  • the first node Before the first node receives the data stream, the first node acquires a mapping relationship between the data flow identifier and the key level information from the third node or the local node;
  • the first node determines the key level information corresponding to the received data stream according to the mapping relationship between the data stream identifier and the key level information.
  • the key level information of the data stream is obtained by the first node from the second node in advance, for example, the first node First receiving a control plane message from the second node (including a mapping relationship between the data flow identifier and the key level information) and saving the subsequent, when the first node receives the data stream from the second node, according to the data stream identifier from the saved The corresponding key level information is found in the information; or, when the first node receives the plurality of data streams generated by the node, the key level information of the data stream is generated and saved by the first node in advance.
  • Step 302 The first node sets a corresponding drop timer for each data packet according to the key level information of each data packet.
  • the key level information includes: a common level and a key level; wherein the length of the discard timer of the common level is less than the duration of the discard timer of the key level.
  • the key level includes a plurality of key sub-levels, wherein a discard timer having a lower key sub-level is smaller than a discard timer having a higher key sub-level.
  • the corresponding discard timer is set according to the key level information of each data packet in the data stream, or the corresponding discard timer is set for each data packet in each data stream according to the key level information of each data stream.
  • PDCP Packet Data Convergence Protocol
  • the key level information of the data packet and the key level information of the data flow may exist at the same time, or may exist independently, that is, only the key level information of the data packet exists or only the key level information of the data flow exists.
  • the discarding timer of each data packet is set based on two factors of the key level information of the data stream and the key level information of the data packet.
  • Step 303 When the first node sends the data packet to the second node, start a discard timer corresponding to the data packet.
  • Step 304 If the timer expires, the first node determines the second section If the data packet is not received, the first node retransmits the data packet to the second node.
  • the first node determines that the second node does not receive the data packet before the timer expires, the first node resends the data packet to the The second node, wherein the first node retransmits the data packet to the second node multiple times, and discards the data packet after the timer expires. In this way, it is ensured that the data packets with higher critical levels can be received by the receiving end to the greatest extent, which further improves the service quality of the data stream and improves the user experience.
  • a data stream processing method includes:
  • Step 1 The base station receives a data stream from the core network, and each data packet in the data stream is marked with key level information.
  • 00 is a normal data packet
  • 01, 10, and 11 are key data packets, and the critical degree is increased sequentially, that is, 11 is the highest key level.
  • Step 2 The PDCP entity of the base station sets different discard timers according to the key level information of the data packet when processing each data packet. For example, setting the discard timer of the key data packet with the highest critical level is the longest, which will be the key. The lowest level of normal packets has the shortest drop timer setting to ensure that packets with higher critical levels are not discarded.
  • Step 3 The base station sends a data packet to the UE, and sets a corresponding discarding timer according to the key level information for each sent data packet. Before the discarding timer expires, the UE does not acknowledge the received data packet, and the base station will The retransmission is performed to the UE, and the retransmission may be performed multiple times until the discard timer expires, and the corresponding packet is discarded.
  • Step 4 The UE receives the data packet, and the higher the key level, the more secure the data packet can be. Roger that.
  • a data stream processing method includes:
  • Step 1 The PDCP entity of the UE receives the data stream from the upper layer application of the UE, and each data packet in the data stream is marked with information of whether it is a key data packet.
  • one bit is used to represent key level information in the packet header, 0 is a normal packet, and 1 is a key packet.
  • Step 2 The PDCP entity of the UE sets different drop timers according to whether the data packet is a critical data packet when processing each data packet, for example, setting a discard timer of the critical data packet to be long enough to ensure that the critical data packet is not as high as possible. Will be discarded.
  • Step 3 The UE sends a data packet to the base station, and sets a corresponding discarding timer for each sent data packet. Before the discarding timer expires, the UE does not acknowledge the received data packet, and the UE retransmits the data packet to the base station. The retransmission may occur multiple times until the discard timer expires and the corresponding packet will be discarded.
  • Step 4 The base station receives the data stream, and the key data packets therein can be ensured to be received to the greatest extent.
  • a data stream processing method includes:
  • Step 1 The base station receives multiple data streams from the core network. For each data stream, the base station obtains key level information of the data stream according to the data flow identifier.
  • the base station has previously received the data flow key level information corresponding to each data flow identifier from the core network.
  • Step 2 The PDCP entity of the base station sets different discarding timers according to the key level information of the data stream to which the data packet belongs when processing each data packet, for example, setting a discard timer of a data packet belonging to a data stream with a higher critical level. The longer it is, the more packets in the data stream that are at the critical level are not discarded.
  • Step 3 The base station sends a data packet to the UE, and sets a corresponding discarding timer according to the key level of the data stream to which each sent data packet is sent. Before the discarding timer expires, the UE does not acknowledge the received data packet. The base station will resend to the UE, and the retransmission may be performed multiple times. After the drop timer expires, the corresponding data packet will be discarded.
  • Step 4 The UE receives the data packet, wherein the data packet in the data stream with higher key level can be ensured to be received.
  • a data stream processing method includes:
  • Step 1 The PDCP entity of the UE receives multiple data streams from the upper layer application of the UE. For each data stream, the UE obtains whether the data stream is a key data stream according to the data flow identifier.
  • the UE has previously stored information about whether the data stream corresponding to each data stream identifier is a key data stream.
  • Step 2 The PDCP entity of the UE sets different discarding timers according to whether the data packet belongs to the key data stream when processing each data packet, for example, setting the discard timer of the data packet belonging to the critical data stream long enough to ensure the data. The package will not be discarded as much as possible.
  • Step 3 The UE sends a data packet to the base station, and sets a corresponding discarding timer for each sent data packet. Before the drop timer expires, the UE does not acknowledge the received data packet, and the UE performs heavy weight on the base station. Sending, resending may occur multiple times, until the discard timer expires, the corresponding packet will be discarded.
  • Step 4 The base station receives the data stream, and the data packets in the key data stream can be ensured to be received to the greatest extent.
  • FIG. 8 is a schematic structural diagram of a data stream processing apparatus according to an embodiment of the present invention. As shown in FIG. 8, the apparatus includes:
  • the receiving unit 81 is configured to receive the data stream
  • a determining unit 82 configured to determine key level information of each data packet in the data stream
  • the setting unit 83 is configured to set a corresponding discarding timer for each of the data packets according to the key level information of the respective data packets;
  • the initiating unit 84 is configured to: when the data packet is sent to the second node, start a discarding timer corresponding to the data packet;
  • the retransmission unit 85 is configured to: if the first node determines that the second node does not receive the data packet before the timer expires, the first node resends the data packet to The second node.
  • the retransmission unit 85 is further configured to: retransmit the data packet to the second node multiple times, and discard the data packet after the timer expires.
  • the receiving unit 81 is further configured to: receive the data stream sent by the third node; or receive the data stream generated by the local node.
  • the determining unit 82 includes: an extracting subunit 821 configured to extract key level information from each data packet in the data stream.
  • the key level information is represented by a predetermined number of bits in a header of each data packet in the data stream.
  • the determining unit 82 includes: an obtaining subunit 822, configured to acquire key level information of the data stream, and use key level information of the data stream as a key of each data packet in the data stream. Level information.
  • the obtaining sub-unit 822 is further configured to: before receiving the data stream, obtain a mapping relationship between the data flow identifier and the key level information from the third node or the local node; when receiving the data During the flow, the key level information corresponding to the received data stream is determined according to the mapping relationship between the data flow identifier and the key level information.
  • the key level information includes: a common level and a key level; wherein the length of the discard timer of the common level is less than the duration of the discard timer of the key level.
  • the key level includes a plurality of key sub-levels, wherein the duration of the drop timer with a lower key sub-level is smaller than the duration of the discard timer with a higher key sub-level.
  • each unit in the processing unit of the data stream may be implemented by a central processing unit (CPU, Central Processing Unit) or a microprocessor (MPU, Micro) located in the processing unit of the data stream.
  • CPU Central Processing Unit
  • MPU Microprocessor
  • Processor Unit or digital signal processor (DSP, Digital Signal Processor), or Field Programmable Gate Array (FPGA).
  • DSP Digital Signal Processor
  • FPGA Field Programmable Gate Array
  • embodiments of the present invention can be provided as a method, system, or computer program product. Accordingly, the present invention can take the form of a hardware embodiment, a software embodiment, or a combination of software and hardware. Moreover, the invention can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage and optical storage, etc.) including computer usable program code.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded into a computer or other programmable data processing device Having a series of operational steps performed on a computer or other programmable device to produce computer-implemented processing such that instructions executed on a computer or other programmable device are provided for implementing one or more processes in a flowchart and/or Or block diagram the steps of a function specified in a box or multiple boxes.
  • an embodiment of the present invention further provides a computer storage medium, wherein a computer program is configured, and the computer program is configured to execute a data stream processing method according to an embodiment of the present invention.
  • the first node receives the data stream, and determines key level information of each data packet in the data stream; the first node is configured to use the key level information of each data packet as the each data packet.
  • Setting a corresponding discard timer when the first node sends the data packet to the second node, starting a discard timer corresponding to the data packet; if the timer is before the timer expires, the first node Determining that the second node does not receive the data packet, the first node resends the data packet to the second node, and the data packet retransmission may be performed multiple times until the After the timer expires, the packet will be discarded.
  • a corresponding discarding timer is set for each data packet according to the key level information of each data packet in the data stream, so as to ensure that the data packet with a higher critical level can be received by the receiving end to the maximum extent.
  • the service quality of the data stream is further improved, and the user experience is improved.

Landscapes

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

Abstract

Des modes de réalisation de la présente invention concernent un procédé et un appareil de traitement de flux de données et un support de stockage informatique. Le procédé comprend les étapes suivantes : un premier nœud reçoit un flux de données et détermine des informations de qualité de clé de chaque paquet de données dans le flux de données ; le premier nœud définit un temporisateur de rejet correspondant pour chaque paquet de données en fonction des informations de qualité de clé de chaque paquet de données ; lorsque le premier nœud envoie le paquet de données à un second nœud, le premier nœud démarre le temporisateur de rejet correspondant au paquet de données ; et si le premier nœud détermine que le second nœud ne reçoit pas le paquet de données avant l'expiration du temporisateur, le premier nœud retransmet le paquet de données au second nœud.
PCT/CN2017/109993 2016-12-13 2017-11-08 Procédé et appareil de traitement de flus de données et support de stockage informatique WO2018107925A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201611145977.8 2016-12-13
CN201611145977.8A CN108616925B (zh) 2016-12-13 2016-12-13 一种数据流的处理方法及装置

Publications (1)

Publication Number Publication Date
WO2018107925A1 true WO2018107925A1 (fr) 2018-06-21

Family

ID=62557878

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/109993 WO2018107925A1 (fr) 2016-12-13 2017-11-08 Procédé et appareil de traitement de flus de données et support de stockage informatique

Country Status (2)

Country Link
CN (1) CN108616925B (fr)
WO (1) WO2018107925A1 (fr)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113132065A (zh) * 2019-12-30 2021-07-16 西安诺瓦星云科技股份有限公司 数据通信方法、装置及系统、存储介质和视频处理设备
CN113467979A (zh) * 2020-03-30 2021-10-01 华为技术有限公司 一种数据递交方法及装置
CN115996420A (zh) * 2021-10-19 2023-04-21 维沃移动通信有限公司 数据处理方法、装置及终端
WO2023130453A1 (fr) * 2022-01-10 2023-07-13 Mediatek Singapore Pte. Ltd. Procédés et appareil de classification de paquets pour trafic xr
CN115208521B (zh) * 2022-08-22 2023-07-04 北京钢铁侠科技有限公司 一种会话层客户端与服务端通讯保障及工作流管控方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1354930A (zh) * 1999-04-06 2002-06-19 艾利森电话股份有限公司 半可靠重传协议的分组丢弃通告
US20030053468A1 (en) * 1998-10-30 2003-03-20 Feng Deng Method and apparatus for exiting a deadlock condition
CN102208970A (zh) * 2005-10-21 2011-10-05 美商内数位科技公司 用于可靠混合arq处理的重发管理的方法和设备
CN102612095A (zh) * 2012-03-05 2012-07-25 电信科学技术研究院 一种ip数据包的传输方法和设备

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101513033B1 (ko) * 2007-09-18 2015-04-17 엘지전자 주식회사 다중 계층 구조에서 ＱｏＳ를 보장하기 위한 방법
CN103167553A (zh) * 2011-12-13 2013-06-19 华为技术有限公司 用于无线通信的方法和装置以及基站
CN103814582B (zh) * 2013-11-05 2017-06-20 华为技术有限公司 视频业务数据传输方法和数据发送装置
CN106067847B (zh) * 2016-05-25 2019-10-22 腾讯科技（深圳）有限公司 一种语音数据传输方法及装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030053468A1 (en) * 1998-10-30 2003-03-20 Feng Deng Method and apparatus for exiting a deadlock condition
CN1354930A (zh) * 1999-04-06 2002-06-19 艾利森电话股份有限公司 半可靠重传协议的分组丢弃通告
CN102208970A (zh) * 2005-10-21 2011-10-05 美商内数位科技公司 用于可靠混合arq处理的重发管理的方法和设备
CN102612095A (zh) * 2012-03-05 2012-07-25 电信科学技术研究院 一种ip数据包的传输方法和设备

Also Published As

Publication number Publication date
CN108616925A (zh) 2018-10-02
CN108616925B (zh) 2023-03-21

Similar Documents

Publication Publication Date Title
US11658722B2 (en) Method and apparatus for managing user plane operation in wireless communication system
WO2018107925A1 (fr) Procédé et appareil de traitement de flus de données et support de stockage informatique
JP7123920B2 (ja) 切り替え方法及び装置
US11395365B2 (en) Method and system for handling PDCP operation in wireless communication system
CN110999523A (zh) 重新连接与无线接入网节点的无线资源控制连接的方法和用户设备
WO2015139557A1 (fr) Entité de protocole de convergence de données par paquets (pdcp), et procédé d'exécution correspondant
US8379855B2 (en) Ciphering in a packet-switched telecommunications system
TW202037198A (zh) 協定資料單元會話建立程序期間資源不足處理方法及其使用者設備
US20190312938A1 (en) Data Transmission Method And Apparatus
EP3791685A1 (fr) Procédés de gestion de configuration de mise à jour de zone de notification de réseau d'accès radio (ran) périodique suite à un rejet
CN110739993A (zh) 使用多个载波来发送和接收数据的方法和设备
US20160249232A1 (en) User equipment and method
US20160021567A1 (en) Method and system for parallelizing packet processing in wireless communication
JP2017508364A5 (fr)
TW201918093A (zh) 切換方法、存取網設備和終端設備
WO2018036492A1 (fr) Procédé et appareil de traitement de congestion
WO2017049647A1 (fr) Procédé d'envoi de données, procédé de réception de données et dispositif approprié
KR20140062499A (ko) 데이터 전송 방법, 오프로드 포인트 장치, 사용자 단말 및 시스템
WO2017008266A1 (fr) Procédé et appareil de traitement de données permettant une agrégation lte et de réseau local sans fil, et système de communication
TWI721333B (zh) 在無線通訊系統中建立承載的方法和裝置
WO2017000760A2 (fr) Procédé de configuration des fonctions d'un réseau sans fil, nœud de réseau sans fil et dispositif de réseau central
TWI797414B (zh) 用於行動性增強之方法及其使用者設備
US9820331B1 (en) UE-context release in response to failure of air interface communication
WO2015161791A1 (fr) Procédé de traitement de paquet de données de couche rlc, et entité rlc
EP4207655A1 (fr) Procédé et appareil de communication

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

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

Country of ref document: EP

Kind code of ref document: A1