CN112970229B - Method and equipment for analyzing wireless network flow - Google Patents
Method and equipment for analyzing wireless network flow Download PDFInfo
- Publication number
- CN112970229B CN112970229B CN201880097291.7A CN201880097291A CN112970229B CN 112970229 B CN112970229 B CN 112970229B CN 201880097291 A CN201880097291 A CN 201880097291A CN 112970229 B CN112970229 B CN 112970229B
- Authority
- CN
- China
- Prior art keywords
- message
- wireless communication
- communication node
- packet
- information
- Prior art date
- Legal status (The legal status 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 status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/06—Generation of reports
- H04L43/062—Generation of reports related to network traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0876—Network utilisation, e.g. volume of load or congestion level
-
- 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/32—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
- H04L47/323—Discarding or blocking control packets, e.g. ACK packets
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
A method and apparatus for performing wireless network traffic analysis. In one embodiment, a method for performing wireless network traffic analysis by a first wireless communication node, comprises: transmitting a first message to a second wireless communication node, wherein the first message comprises first information of at least one first data packet to be discarded; receiving a second message from a second wireless communication node, wherein the second message includes second information of at least one dropped data packet; determining wireless network flow information according to the second message; wherein the at least one dropped packet in the second message comprises at least one packet in the at least one to-be-dropped first packet in the first message, and the wireless network traffic information comprises a total amount of data traffic on the second wireless communication node.
Description
Technical Field
The present disclosure relates generally to wireless communications, and more particularly, to a method and apparatus for performing wireless network traffic analysis for split bearers in dual connectivity.
Background
As global smartphone users continue to grow, mobile data usage and traffic will continue to grow. Deploying a heterogeneous network with small cells (HetNet) in a macro cell is an effective way to meet mobile data traffic demand. Furthermore, control plane/user plane splitting and Dual Connectivity (DC) are proposed to allow a wireless communication device with multiple transceivers to receive data packets from at least two wireless communication nodes, e.g. a macro (primary) eNodeB and a small cell (secondary) eNodeB, simultaneously. Data from the radio bearer of the wireless communication device arrives from higher layers to a Packet Data Convergence Protocol (PDCP) layer of the master eNodeB. The data of the radio bearer is then divided by the master eNodeB. In the split bearer architecture of DC, a portion of the data is then sent over a backhaul link (e.g., an Xn interface) to the secondary eNodeB and then further to the wireless communication device, while another portion of the data is connected to the wireless communication device through the primary eNodeB. The split bearer is then aggregated at a PDCP layer of the wireless communication device.
Disclosure of Invention
Exemplary embodiments disclosed herein are directed to solving the problems associated with one or more of the problems set forth in the prior art and providing additional features that will be readily understood by reference to the following detailed description when taken in conjunction with the accompanying drawings. In accordance with various embodiments, exemplary systems, methods, and computer program products are disclosed. It is to be understood, however, that these embodiments are given by way of illustration and not of limitation, and that various modifications to the disclosed embodiments will be apparent to those skilled in the art upon reading this disclosure and are also within the scope of the invention.
In a dual-connectivity split bearer architecture, when a PDCP entity of a first wireless communication node has successfully transmitted a PDCP Protocol Data Unit (PDU) to a wireless communication device through a first Radio Link Control (RLC) entity on the first wireless communication node, the PDCP entity on the first wireless communication node notifies a second RLC entity on a second wireless communication node to abort a scheduled transmission of the PDCP PDU therefrom to the wireless communication device. When such a notification from the PDCP entity on the first wireless communication node is received at the second RLC entity on the second wireless communication node, the PDCP PDUs may have already been sent to the wireless communication device and thus will not be discarded by the second wireless communication node. In this case, the PDCP entity of the first wireless communication node does not know the data packet actually discarded by the second wireless communication node. Currently, there is no standard protocol or solution available for wireless network traffic analysis for split bearers in dual connectivity. Therefore, there is a need to develop a method and apparatus that can accurately perform wireless network traffic analysis for split bearers in dual connectivity.
In one embodiment, a method for performing wireless network traffic analysis by a first wireless communication node, comprises: transmitting a first message to a second wireless communication node, wherein the first message comprises first information of at least one first data packet to be discarded; receiving a second message from a second wireless communication node, wherein the second message includes second information of at least one dropped data packet; determining wireless network flow information according to the second message; wherein the at least one dropped packet in the second message comprises at least one packet in the at least one to-be-dropped first packet in the first message, and the wireless network traffic information comprises a total amount of data traffic on the second wireless communication node.
In another embodiment, a method for performing wireless network traffic analysis by a first wireless communication node, comprises: receiving a first message from a second wireless communication node, wherein the first message comprises first information of at least one first data packet to be discarded; and transmitting a second message to the second wireless communication node, wherein the second message comprises second information of the at least one dropped data packet, wherein the second information is used for determining wireless network traffic information, wherein the at least one dropped data packet in the second message comprises at least one data packet in the at least one first data packet to be dropped in the first message, and the wireless network traffic information comprises a total amount of data traffic on the first wireless communication node.
In another embodiment, a computing device includes at least one processor configured to perform the method and a memory coupled to the processor.
However, in another embodiment, a non-transitory computer readable medium has stored thereon computer executable instructions for performing the method.
Drawings
Aspects of the disclosure are best understood from the following detailed description when read with the accompanying drawing figures. Note that the various features are not necessarily drawn to scale. In fact, the dimensions and geometries of the various features may be arbitrarily increased or decreased for clarity of discussion.
Fig. 1A illustrates an example wireless communication network in accordance with some embodiments of the present disclosure.
Fig. 1B illustrates a block diagram of an example wireless communication system, in accordance with some embodiments of the present disclosure.
Fig. 2 illustrates a method for performing wireless network traffic analysis in accordance with some embodiments of the present disclosure.
Fig. 3 illustrates a method for performing wireless network traffic analysis in accordance with some embodiments of the present disclosure.
Fig. 4 illustrates a method for performing wireless network traffic analysis in accordance with some embodiments of the present disclosure.
Fig. 5 illustrates a method for performing wireless network traffic analysis in accordance with some embodiments of the present disclosure.
Detailed Description
Various exemplary embodiments of the invention are described below with reference to the drawings to enable one of ordinary skill in the art to make and use the invention. It will be apparent to those skilled in the art upon reading this disclosure that various changes or modifications can be made to the examples described herein without departing from the scope of the invention. Accordingly, the present invention is not limited to the exemplary embodiments and applications described or illustrated herein. Additionally, the particular order or hierarchy of steps in the methods disclosed herein is merely exemplary of the methods. Based upon design preferences, the specific order or hierarchy of steps in the methods or processes disclosed may be rearranged while remaining within the scope of the present invention. Accordingly, one of ordinary skill in the art will understand that the methods and techniques disclosed herein present the various steps or actions in the exemplary order, and the invention is not limited to the specific order or hierarchy presented unless otherwise specifically indicated.
Embodiments of the present invention are described in detail with reference to the accompanying drawings. Although the same or similar components are shown in different drawings, the same or similar components may be denoted by the same or similar reference numerals. A detailed description of configurations or processes known in the art may be omitted in order to avoid obscuring the subject matter of the present invention. Further, in the embodiment of the present invention, terms are defined based on their functions, and the terms may be changed according to the intention, usage, and the like of a user or an operator. Therefore, the definition should be made based on the entire contents of the present specification.
Fig. 1A illustrates an example wireless communication network 100 in accordance with some embodiments of the present disclosure. In a wireless communication system, a network side communication node or Base Station (BS)102 may be a node B, an E-UTRA node B (also referred to as evolved node B, eNodeB or eNB), a gNodeB (also referred to as a gNB) in New Radio (NR) technologies, a pico station, a femto station, etc. The terminal-side communication device or User Equipment (UE)104 may be a telecommunication system, such as a mobile phone, a smart phone, a Personal Digital Assistant (PDA), a tablet, a laptop, or may be a short-range communication system such as a wearable device, a vehicle with a vehicle communication system, etc. In all embodiments of the present disclosure below, a network communication node and a terminal-side communication device are represented by BS102 and UE104, respectively, and are generally referred to herein as a "communication node" and a "communication device". Such communication nodes and communication devices may be capable of wireless and/or wired communication according to various embodiments of the present invention. Note that all the embodiments are only preferred examples, and are not intended to limit the present disclosure. Accordingly, it should be understood that the system may include any desired combination of the BS102 and the UE104 while remaining within the scope of the present disclosure.
Referring to fig. 1A, a wireless communication network 100 includes a first BS102-1, a second BS102-2, and a UE 104. In some embodiments, the UE104 forms direct communication (i.e., uplink) channels 103-1 and 103-2 with the first BS102-1 and the second BS102-2, respectively. In some embodiments, the UE104 also forms direct communication (i.e., downlink) channels 105-1 and 105-2 with the first BS102-1 and the second BS102-2, respectively. The direct communication channel between the UE104 and the BS102 may pass through an interface such as the Uu interface (which is also referred to as the E-UTRA air interface). In some embodiments, the UE104 includes multiple transceivers that enable the UE104 to support dual connectivity for receiving data from the first BS102-1 and the second BS102-2 simultaneously. The first BS102-1 and the second BS102-2 are connected to a Core Network (CN)108 through external interfaces 107 (e.g., I u interface, NG interface, and S1 interface), respectively, according to the types of the first BS102-1 and the second BS 102-2. For example, when the first BS102-1 is an eNB in an LTE system, the direct communication between the first BS102-1 and the CN 108 is achieved through an S1 interface; when the second BS102-1 is a gNB in an NR system, direct communication between the first BS102-1 and the CN 108 is accomplished over an NG interface. In some other embodiments, the first BS102-1 (eNB) is a primary node (MN) that is connected to the CN 108, and the second BS102-2 (gNB) is a Secondary Node (SN) that is not connected to the CN 108.
The direct communication channel 111 between the first BS102-1 (eNB) and the second BS102-2 (gNB) is over an X2 interface. In some embodiments, the second BS102-2 (gNB) is split into a Distributed Unit (DU) and a Central Unit (CU), with direct communication between them over the F1 interface. In some embodiments, the CU of the second BS102-2 may be further split into a Control Plane (CP) and a User Plane (UP), with direct communication between the two being over an E1 interface. In some embodiments, the X2 interface may support evolved universal terrestrial radio access new radio access dual connectivity (E-UTRA-NR DC or EN-DC), hereinafter referred to as the "EN-DC X2 interface".
In other embodiments, when first BS102-1 and second BS102-2 are both gnbs, direct communication between first BS102-1 and second BS102-2 is over an Xn interface. The first BS102-1 and the second BS102-2 are neighbor BSs. The first cell 110-1 is covered by the first BS102-1 and the second cell 110-2 is covered by the second BS 102-2. In some embodiments, the first cell 110-1 and the second cell 110-2 are neighboring cells.
Fig. 1B illustrates a block diagram of an example wireless communication system 150, in accordance with some embodiments of the present disclosure. System 150 may include components and elements configured to support known or conventional operating features that need not be described in detail herein. In some embodiments, as described above, the system 150 may be used for transmitting and receiving data symbols in a wireless communication environment, such as the wireless communication network 100 of fig. 1A.
The system 150 generally includes a first BS102-1, a second BS102-2, and a UE104, which for ease of discussion will be collectively referred to hereinafter as BS102 and UE 104. First BS102-1 and second BS102-2 each include a BS transceiver module 152, a BS antenna array 154, a BS memory module 156, a BS processor module 158, and a network interface 160. In the illustrated embodiment, each module of BS102 is coupled and interconnected with each other as needed via a data communication bus 180. The UE104 includes a UE transceiver module 162, a UE antenna 164, a UE memory module 166, a UE processor module 168, and an I/O interface 169. In the illustrated embodiment, each module of the UE104 is coupled and interconnected with each other as needed via a data communication bus 190. As described herein, the BS102 communicates with the UE104 via a communication channel 192, which may be any wireless channel or other medium known in the art suitable for data transmission.
As will be appreciated by one of ordinary skill in the art, the system 150 may also include any number of modules other than those shown in fig. 1B. Those of skill in the art will appreciate that the various illustrative blocks, modules, circuits, and processing logic described in connection with the embodiments disclosed herein may be implemented as hardware, computer readable software, firmware, or any practical combination thereof. To clearly illustrate this interchangeability and compatibility of hardware, firmware, and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware, firmware, or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans who may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as limiting the scope of the present invention.
The wireless transmission from the transmit antenna of the UE104 to the receive antenna of the BS102 is referred to as Uplink (UL) transmission, and the wireless transmission from the transmit antenna of the BS102 to the receive antenna of the UE104 is referred to as Downlink (DL) transmission. According to some embodiments, the UE transceiver 162 may be referred to herein as an "uplink" transceiver 162, which includes RF transmitter and receiver circuitry that are each coupled to a UE antenna 164. A duplex switch (not shown) may alternatively couple the uplink transmitter or receiver to the uplink antenna in a time-duplex manner. Similarly, BS transceiver 152 may be referred to herein as a "downlink" transceiver 152 that includes RF transmitter and receiver circuits that are each coupled to an antenna array 154, according to some embodiments. The downlink duplex switch may alternatively couple a downlink transmitter or receiver to the downlink antenna array 154 in a time-duplex manner. The operation of the two transceivers 152 and 162 are coordinated in time such that the uplink receiver is coupled to the uplink UE antenna 164 to receive transmissions over the wireless communication channel 192 while the downlink transmitter is coupled to the downlink antenna array 154. Preferably there is close synchronization timing with only minimal guard time between changes in the duplex direction. The UE transceiver 162 communicates with the BS102 through the UE antenna 164 via a wireless communication channel 192. BS transceiver 152 communicates with another BS (e.g., second BS 102-2) via wireless communication channel 196 through BS antenna 154 of the BS (e.g., first BS 102-1). The wireless communication channel 196 may be any wireless channel or other medium known in the art suitable for direct communication between BSs.
The UE transceiver 162 and the BS transceiver 152 are configured to communicate via a wireless data communication channel 192 and cooperate with a suitably configured RF antenna arrangement 154/164 that may support particular wireless communication protocols and modulation schemes. In some demonstrative embodiments, UE transceiver 162 and BS transceiver 152 are configured to support industry standards, such as Long Term Evolution (LTE) and the emerging 5G standards (e.g., NR). It should be understood, however, that the present invention is not necessarily limited in application to a particular standard and associated protocol. Rather, UE transceiver 162 and BS transceiver 152 may be configured to support alternative or additional wireless data communication protocols, including future standards or variations thereof.
The processor modules 158 and 168 may be implemented or realized with a general purpose processor, a content addressable memory, a digital signal processor, an application specific integrated circuit, a field programmable gate array, any suitable programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. In this manner, the processor module may be implemented as a microprocessor, controller, microcontroller, state machine, or the like. A processor module may also be implemented as a combination of computing devices, e.g., a combination of a digital signal processor and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a digital signal processor core, or any other such configuration.
Furthermore, the steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in firmware, in a software module executed by the processor modules 158 and 168, respectively, or in any practical combination thereof. Memory modules 156 and 166 may be implemented as RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. In this regard, the memory modules 156 and 166 may be coupled to the processor modules 158 and 168, respectively, such that the processor modules 158 and 168 may read information from and write information to the memory modules 156 and 166, respectively. The memory modules 156 and 166 may also be integrated into their respective processor modules 158 and 168. In some embodiments, the memory modules 156 and 166 may each include a cache memory for storing temporary variables or other intermediate information during execution of instructions to be executed by the processor modules 158 and 168, respectively. The memory modules 156 and 166 may also each include non-volatile memory for storing instructions for execution by the processor modules 158 and 168, respectively.
Referring again to fig. 1A, as described above, BS102 repeatedly broadcasts system information related to BS102 to one or more UEs 104 to allow UEs 104 to access the network within the cell (e.g., 110-1 of first BS102-1 and 110-2 of second BS 102-2) in which BS102 (and, in general, operates normally within the cell) is located. For example, a plurality of information such as downlink and uplink cell bandwidths, downlink and uplink configurations, cell information, configurations for random access, and the like may be included in the system information, which will be discussed in further detail below. In general, BS102 broadcasts a first signal carrying some primary system information (e.g., configuration of cell 101) via a PBCH (physical broadcast channel). For purposes of clarity of explanation, such a broadcasted first signal is referred to herein as a "first broadcast signal". Note that BS102 may then broadcast one or more signals carrying some other system information over respective channels, e.g., a Physical Downlink Shared Channel (PDSCH).
Referring again to fig. 1B, in some embodiments, the primary system information carried by the first broadcast signal may be transmitted in a symbol format by BS102 via communication channel 192 (e.g., PBCH). According to some embodiments, the original form of the primary system information may be presented as one or more digital bit sequences, and the one or more digital bit sequences may be processed through a number of steps (e.g., encoding, scrambling, modulating, mapping steps, etc.), all of which may be processed by the BS processor module 158 to become the first broadcast signal. Similarly, according to some embodiments, when the UE104 receives the first broadcast signal (in symbol format) using the UE transceiver 162, the UE processor module 168 may perform a number of steps (demapping, demodulation, decoding steps, etc.) to estimate the primary system information, e.g., bit position such as bits of the primary system information, number of bits, etc. The UE processor module 168 is also coupled to an I/O interface 169 that provides the UE104 with the ability to connect to other devices, such as computers. The I/O interface 169 is the communication path between these accessories and the UE processor module 168.
In some embodiments, the UE104 may operate in a hybrid/heterogeneous communication network in which the UE communicates with the BS102 and with other UEs, e.g., sidelink communications (not shown). As described in further detail below, the UE104 supports sidelink communications with other UEs and downlink/uplink communications between the BS102 and the UE 104. As described above, sidelink communications allow multiple UEs 104 within a sidelink communication group to establish direct communication links with each other or other UEs from different cells without requiring BS102 to relay data between the UEs.
Fig. 2 illustrates a method 200 for performing wireless network traffic analysis in accordance with some embodiments of the present disclosure. It should be understood that additional operations may be provided before, during, and after the method 200 of fig. 2, and that some operations may be omitted or reordered. The communication system in the illustrated embodiment includes a first BS102-1 and a second BS 102-2. In the illustrated embodiment, the UE104 (not shown) is in one of the at least one serving cell covered by the first BS102-1 and also in one of the at least one serving cell covered by the second BS102-2, i.e., the UE104 is connected with the first BS102-1 and the second BS 102-2. In the illustrated embodiment, a split bearer of the UE104 may be connected to the first BS102-1 and the second BS102-2, wherein a Packet Data Convergence Protocol (PDCP) entity is located only on the first BS 102-1. In some embodiments, a Radio Link Control (RLC) entity may be located on the second BS102-2, or may be located on the first BS102-1 and the second BS 102-2. It should be noted that any number of BSs 102 may be used and are within the scope of the present invention.
The method 200 begins at operation 202, where the first BS102-1 transmits a first message to the second BS102-2, in accordance with some embodiments. In some embodiments, the first message comprises information of at least one first data packet. In some embodiments, the at least one first data packet comprises at least one data packet successfully transmitted by the first BS102-1 to the UE104 over the Uu interface. In some embodiments, prior to operation 202, the PDCP entity of the first BS102-1 sends at least one data packet to the RLC entity of the second BS102-2, wherein the at least one data packet is to be sent by the second BS102-2 to the UE 104. In some embodiments, the first message from the first BS102-1 is to inform the second BS102-2 to drop the at least one first data packet and to avoid sending the at least one first data packet from the second BS102-2 to the UE104 again. In some embodiments, the at least one first data packet comprises at least one PDCP PDU.
In some embodiments, the first message comprises at least one pair of indices of at least one corresponding first packet. In some embodiments, each index of the at least one pair of indices includes a start index and an end index of the at least one corresponding first packet. In some embodiments, the first message is sent on a first UP protocol frame (e.g., a down link (dl) USER DATA frame).
In some embodiments, a first message is sent from a first BS102-1 to a second BS102-2 on a first interface on a User Plane (UP). In some embodiments, the first BS102-1 and the second BS102-2 may each be one of: eNB, gNB, wherein eNB is connected to 5G CN. In some embodiments, the first message is sent from the first unit of the first BS102-1 when the first BS102-1 is a gNB. In some embodiments, the first message is received by a second unit of the second BS102-1 when the second BS102-2 is a gNB. In some embodiments, the first unit is a Central Unit (CU) and the second unit is a Distributed Unit (DU). In some embodiments, the first interface on UP is one of the following according to the first BS102-1 and the second BS 102-2: Xn-U interface, F1-U interface and EN-DC X2-U interface.
The method 200 continues with operation 204 in which the first BS102-1 receives a second message from the second BS102-2, according to some embodiments. In some embodiments, the second message comprises information of at least one second data packet. In some embodiments, the at least one second data packet includes at least one data packet that is actually dropped by the second BS102-2 when performing transmission to the UE 104. In some embodiments, the at least one second data packet is determined by the second BS102-2 by comparing information of the at least one first data packet received in the first message from the first BS102-1 with information of the at least one data packet transmitted from the PDCP entity of the first BS102-1 to the RLC entity of the second BS 102-2. In some embodiments, when the second BS102-2 does not transmit at least one of the first data packets to the UE104, the second BS102-2 terminates transmitting at least one of the first data packets to the UE104, and the at least one second data packet includes the at least one first data packet. In some embodiments, the at least one second data packet does not include the at least one first data packet when at least one of the first data packets has been transmitted by the second BS102-2 to the UE 104.
In some embodiments, the second message is sent on a second UP protocol frame. In some embodiments, the second frame is one of: DL DATA DELIVERY STATUS frame, ASSISTANCE INFORMATION DATA frame. In some embodiments, the information of the at least one second data packet comprises at least one of: total amount of data (e.g., number of bits), at least one pair of corresponding indices, start and end times. In some embodiments, at least one pair of corresponding indices of the at least one second data packet is used to indicate a start index and an end index of the at least one second data packet.
In some embodiments, the second message is received by the first BS102-1 from the second BS102-2 over a first interface on the User Plane (UP). In some embodiments, the first BS102-1 and the second BS102-2 are one of: eNB and gNB. In some embodiments, the second message is received by the first unit of the first BS102-1 when the first BS102-1 is a gNB. In some embodiments, the second message is received from the first unit of the second BS102-1 when the second BS102-2 is a gNB. In some embodiments, the first unit is a Central Unit (CU) and the second unit is a Distributed Unit (DU). In some embodiments, the first interface on UP is one of the following according to the first BS102-1 and the second BS 102-2: Xn-U interface, F1-U interface and EN-DC X2-U interface.
In some embodiments, the second message is received by the first BS102-1 from the second BS102-2 over a second interface on the Control Plane (CP). In some embodiments, the first BS102-1 and the second BS102-2 are one of: eNB, gNB. In some embodiments, the second message is received by the first unit of the first BS102-1 when the first BS102-1 is a gNB. In some embodiments, the second message is received from a second unit of the second BS102-1 when the second BS102-2 is a gNB. In some embodiments, the first unit is a Central Unit (CU) and the second unit is a Distributed Unit (DU). In some embodiments, the second interface on the CP is one of the following according to the first BS102-1 and the second BS 102-2: Xn-C interface, F1-C interface and EN-DC X2-C interface.
The method 200 continues with operation 206 in which the first BS102-1 determines wireless network traffic information, according to some embodiments. In some embodiments, the wireless network traffic information includes a total amount of data traffic for the radio bearer on the second BS 102-2. In some embodiments, the total amount of data traffic for the radio bearer on the second BS102-2 is determined by subtracting the total amount of data of the at least one second data packet discarded by the second BS102-2 from the total amount of data in the at least one data packet sent by the PDCP entity of the first BS102-1 to the RLC entity of the second BS 102-2.
Fig. 3 illustrates a method 300 for performing wireless network traffic analysis in accordance with some embodiments of the present disclosure. It should be understood that additional operations may be provided before, during, and after the method 300 of fig. 3, and that some operations may be omitted or reordered. The communication system in the illustrated embodiment includes a first BS102-1 and a second BS 102-2. In the illustrated embodiment, the UE104 (not shown) is in one of the at least one serving cell covered by the first BS102-1 and also in one of the at least one serving cell covered by the second BS102-2, i.e., the UE104 is connected with the first BS102-1 and the second BS 102-2. In the illustrated embodiment, the split bearer of the UE104 is connected to the first BS102-1 and the second BS102-2, wherein the PDCP entity is located only on the first BS 102-1. In some embodiments, the two radio link control entities may be located on the second BS102-2, or may be located on the first BS102-1 and the second BS 102-2. It should be noted that any number of BSs 102 may be used and are within the scope of the present invention. In the illustrated embodiment, the second BS102-2 is a gNB that includes a first cell 102-2A and a second cell 102-2B. In some embodiments, the first unit 102-2A is a DU and the second unit 102-2B is a CU.
The method 300 begins at operation 302, where the first BS102-1 transmits a first message to the first unit 102-2A of the second BS102-2, in accordance with some embodiments. In some embodiments, the first message comprises information of at least one first data packet. In some embodiments, the at least one first data packet comprises at least one data packet successfully transmitted by the first BS102-1 to the UE104 over the Uu interface. In some embodiments, prior to operation 302, the PDCP entity of the first BS102-1 sends at least one data packet to the RLC entity of the second BS102-2, wherein the at least one data packet is to be sent by the second BS102-2 to the UE 104. In some embodiments, the first message from the first BS102-1 is to inform the second BS102-2 to drop the at least one first data packet and to avoid resending the at least one first data packet from the second BS102-2 to the UE 104. In some embodiments, the at least one first data packet comprises at least one PDCP PDU.
In some embodiments, the first message comprises at least one pair of indices of at least one corresponding first packet. In some embodiments, each of the at least one pair of indices includes a start index and an end index of the at least one corresponding first packet. In some embodiments, the first message is sent on a first UP protocol frame (e.g., a Down Link (DL) USER DATA frame).
In some embodiments, a first message is sent from a first BS102-1 to a second BS102-2 on a first interface on a User Plane (UP). In some embodiments, the first BS102-1 is one of: eNB, gNB, wherein eNB is connected to 5G CN. In some embodiments, the first message is sent from a second unit (not shown) of the first BS102-1 when the first BS102-1 is a gNB. In some embodiments, the second unit of the first BS102-1 is a CU. In some embodiments, the first interface on the UP is one of the following according to the first BS 102-1: Xn-U interface, EN-DC X2-U interface.
The method 300 continues with operation 304 in which the first unit 102-2A of the second BS102-2 transmits a second message to the second unit 102-2B of the second BS102-2, in accordance with some embodiments. In some embodiments, the second message is sent over an F1 interface between the first unit 102-2A and the second unit 102-2B of the second BS 102-2. In some embodiments, first unit 102-2A of second BS102-2 and second unit 102-2B of second BS102-2 are a DU and a CU, respectively. In some embodiments, the second message is a CP message, e.g., a SECONDARY RAT DATA USAGE REPORT message.
In some embodiments, the second message comprises information of at least one second data packet. In some embodiments, the at least one second data packet includes at least one data packet that is actually dropped by the second BS102-2 when performing transmission to the UE 104. In some embodiments, the at least one second data packet is determined by the first unit 102-2A of the second BS102-2 by comparing information of the at least one first data packet received in the first message from the first BS102-1 with information of the at least one data packet sent from the PDCP entity of the first BS102-1 to the RLC entity of the second BS 102-2. In some embodiments, when the second BS102-2 does not transmit at least one of the first data packets to the UE104, the second BS102-2 terminates transmitting at least one of the first data packets to the UE104, and the at least one second data packet includes the at least one first data packet. In some embodiments, the at least one second data packet does not include the at least one first data packet when at least one of the first data packets has been transmitted by the second BS102-2 to the UE 104.
In some embodiments, the information of the at least one second data packet comprises at least one of: a total amount of data (e.g., number of bits) in the at least one second packet, at least one pair of corresponding indices, and start and end times. In some embodiments, the at least one pair of corresponding indices of the at least one second data packet includes a start index and an end index for each of the at least one corresponding second data packet.
The method 300 continues with operation 306 where the first BS102-1 receives a third message from the second unit 102-2B of the second BS102-2, in accordance with some embodiments. In some embodiments, the third message includes information of at least one second packet in the second message received from the first unit 102-2A of the second BS 102-2. In some embodiments, the third message is also a CP message, for example a SECONDARY RAT DATA USAGE REPORT message. In some embodiments, the information of the at least one second data packet comprises at least one of: a total amount of data (e.g., number of bits) in the at least one second packet, at least one pair of corresponding indices, and start and end times. In some embodiments, the at least one pair of corresponding indices of the at least one second data packet includes a start index and an end index for each of the at least one corresponding second data packet.
In some embodiments, when first BS102-1 is a gNB, a second unit (not shown) of first BS102-1 receives a second message from second BS102-2 over a second interface on the Control Plane (CP). In some embodiments, the second unit of the first BS102-1 is a CU. In some embodiments, the second interface on the CP is one of the following according to the first BS102-1 and the second BS 102-2: Xn-C interface, EN-DC X2-C interface.
The method 300 continues with operation 308 in which the first BS102-1 determines wireless network traffic information, according to some embodiments. In some embodiments, the wireless network traffic information includes a total amount of bearer split data traffic at the second BS 102-2. In some embodiments, the total amount of bearer split data traffic at the second BS102-2 is determined by subtracting the total amount of data of the at least one second data packet discarded by the second BS102-2 from the total amount of data in the at least one data packet sent by the PDCP entity of the first BS102-1 to the RLC entity of the second BS 102-2.
Fig. 4 illustrates a method 400 for performing wireless network traffic analysis in accordance with some embodiments of the present disclosure. It should be understood that additional operations may be provided before, during, and after the method 400 of fig. 4, and that some operations may be omitted or reordered. The communication system in the illustrated embodiment includes a first BS102-1 and a second BS 102-2. In the illustrated embodiment, the UE104 (not shown) is in one of the at least one serving cell covered by the first BS102-1 and also in one of the at least one serving cell covered by the second BS102-2, i.e., the UE104 is connected with the first BS102-1 and the second BS 102-2. In the illustrated embodiment, a split bearer of the UE104 may be connected to the first BS102-1 and the second BS102-2, wherein a Packet Data Convergence Protocol (PDCP) entity is located only on the first BS 102-1. In some embodiments, a Radio Link Control (RLC) entity may be located on the second BS102-2, or may be located on the first BS102-1 and the second BS 102-2. It should be noted that any number of BSs 102 may be used and are within the scope of the present invention. In the illustrated embodiment, first BS102-1 is a gNB that includes a Distribution Unit (DU) (not shown) and a Control Unit (CU) 102-1B. CU 102-1B includes Control Plane (CP)102-1BA and User Plane (UP)102-1 BB. The second BS102-2 is one of: gNB, eNB, wherein eNB is connected to 5G CN.
The method 400 begins at operation 402, where in operation 402, the first unit 102-1B of the first BS102-1 on the UP 102-1BB sends a first message to the second BS102-2, according to some embodiments. In some embodiments, the first message comprises information of at least one first data packet. In some embodiments, the at least one first data packet comprises at least one data packet successfully transmitted by the first BS102-1 to the UE104 over the Uu interface. In some embodiments, prior to operation 402, the PDCP entity of the first BS102-1 sends at least one data packet to the RLC entity of the second BS102-2, wherein the at least one data packet is to be sent by the second BS102-2 to the UE 104. In some embodiments, the first message from the first BS102-1 is to inform the second BS102-2 to drop the at least one first data packet and to avoid sending the at least one first data packet from the second BS102-2 to the UE104 again. In some embodiments, the at least one first data packet comprises at least one PDCP PDU.
In some embodiments, the first message comprises at least one pair of indices of at least one corresponding first packet. In some embodiments, each index of the at least one pair of indices includes a start index and an end index of the at least one corresponding first packet. In some embodiments, the first message is sent on a first UP protocol frame (e.g., a down link (dl) USER DATA frame). In some embodiments, a first message is sent from a first BS102-1 to a second BS102-2 on a first interface on a User Plane (UP). In some embodiments, the first message is sent over an Xn-U interface.
The method 400 continues with operation 404 in which the first unit 102-1B of the first BS102-1 on the CP 102-1BA receives a second message from the second BS102-2, according to some embodiments. In some embodiments, the second message is sent over an Xn-C interface between the first unit of the first BS102-1 and the second BS102-2 on the CP 102-1 BA. In some embodiments, the second message is a CP message, e.g., a SECONDARY RAT DATA USAGE REPORT message.
In some embodiments, the second message comprises information of at least one second data packet. In some embodiments, the at least one second data packet includes at least one data packet that is actually dropped by the second BS102-2 when performing transmission to the UE 104. In some embodiments, the at least one second data packet is determined by the second BS102-2 by comparing information of the at least one first data packet received in the first message from the first BS102-1 with information of the at least one data packet transmitted from the PDCP entity of the first BS102-1 to the RLC entity of the second BS 102-2. In some embodiments, when the second BS102-2 does not transmit at least one of the first data packets to the UE104, the second BS102-2 terminates transmitting at least one of the first data packets to the UE104, and the at least one second data packet includes the at least one data packet. In some embodiments, the at least one second data packet does not include the at least one first data packet when at least one of the first data packets has been transmitted by the second BS102-2 to the UE 104.
In some embodiments, the information of the at least one second data packet comprises at least one of: total amount of data (e.g., number of bits), at least one pair of corresponding indices, start and end times. In some embodiments, at least one pair of corresponding indices of the at least one second data packet is used to indicate a start index and an end index of the at least one second data packet.
The method 400 continues with operation 406 where the first unit 102-1B of the first BS102-1 on the CP 102-1BA further receives a third message from the first unit 102-1B of the first BS102-1 on the UP 102-1BB, according to some embodiments. In some embodiments, the third message includes information of at least one data packet transmitted from the PCDP entity of the first BS102-1 to the RLC entity of the second BS 102-2. In some embodiments, the information of the at least one data packet transmitted from the PCDP entity of the first BS102-1 to the RLC entity of the second BS102-2 includes a total amount of data of the at least one data packet transmitted from the PCDP entity of the first BS102-1 to the RLC entity of the second BS 102-2.
The method 400 continues with operation 408 in which the first unit 102-1B of the first BS102-1 on the CP 102-1BA determines wireless network traffic information, according to some embodiments. In some embodiments, the wireless network traffic information includes a total amount of data traffic for the radio bearer on the second BS 102-2. In some embodiments, the total amount of data traffic for the radio bearer on the second BS102-2 is determined by subtracting the total amount of data of the at least one second data packet discarded by the second BS102-2 from the total amount of data in the at least one data packet sent by the PDCP entity of the first BS102-1 to the RLC entity of the second BS 102-2.
Fig. 5 illustrates a method 500 for performing wireless network traffic analysis in accordance with some embodiments of the present disclosure. It should be understood that additional operations may be provided before, during, and after the method 500 of fig. 5, and that some operations may be omitted or reordered. The communication system in the illustrated embodiment includes a first BS102-1 and a second BS 102-2. In the illustrated embodiment, the UE104 (not shown) is in one of the at least one serving cell covered by the first BS102-1 and also in one of the at least one serving cell covered by the second BS102-2, i.e., the UE104 is connected with the first BS102-1 and the second BS 102-2. In the illustrated embodiment, the split bearer of the UE104 is connected to the first BS102-1 and the second BS102-2, wherein the PDCP entity is located only on the first BS 102-1. In some embodiments, the two radio link control entities may be located on the second BS102-2, or may be located on the first BS102-1 and the second BS 102-2. It should be noted that any number of BSs 102 may be used and are within the scope of the present invention. In the illustrated embodiment, first BS102-1 is a gNB that includes a first cell (not shown) and a second cell 102-1B. The second unit 102-1B of the first BS102-1 includes a Control Plane (CP)102-1BA and a User Plane (UP)102-1 BB. Similarly, the second BS102-2 is also a gNB that includes a first cell 102-2A and a second cell 102-2B. The first unit 102-2A of the second BS102-2 is a Distributed Unit (DU), and the second unit 102-1B of the first BS102-1 and the second unit 102-2B of the second BS102-2 are each a Central Unit (CU).
In some embodiments, the information of the at least one first data packet comprises at least one pair of indices of the at least one corresponding first data packet. In some embodiments, each index of the at least one pair of indices includes a start index and an end index of the at least one corresponding first packet. In some embodiments, a first message is sent from a first BS102-1 to a second BS102-2 on a first interface on a User Plane (UP). In some embodiments, the first message is sent over an Xn-U interface. In some embodiments, the first message is sent in the form of an UP protocol frame, i.e., a DL USER DATA frame.
The method 500 continues with operation 504 where the first unit 102-2A of the second BS102-2 sends a second message to the second unit 102-2B of the second BS102-2 in accordance with some embodiments. In some embodiments, the second message is sent over an F1-C interface between the first unit and the second unit of the second BS 102-2. In some embodiments, the second message is a CP message, e.g., a SECONDARY RAT DATA USAGE REPORT message.
In some embodiments, the second message comprises information of at least one second data packet. In some embodiments, the at least one second data packet includes at least one data packet that is actually dropped by the second BS102-2 when performing transmission to the UE 104. In some embodiments, the at least one second data packet is determined by the first unit 102-2A of the second BS102-2 by comparing information of the at least one first data packet received in the first message from the first BS102-1 with information of the at least one data packet sent from the PDCP entity of the first BS102-1 to the RLC entity of the second BS 102-2. In some embodiments, when the second BS102-2 does not transmit at least one of the first data packets to the UE104, the second BS102-2 terminates transmitting at least one of the first data packets to the UE104, and the at least one second data packet includes the at least one first data packet. In some embodiments, the at least one second data packet does not include the at least one first data packet when at least one of the first data packets has been transmitted by the second BS102-2 to the UE 104.
In some embodiments, the information of the at least one second data packet comprises at least one of: total amount of data (e.g., number of bits) in the at least one second packet, at least one pair of corresponding indices, start and end times. In some embodiments, the at least one pair of corresponding indices of the at least one second data packet includes a start index and an end index for each of the at least one corresponding second data packet.
The method 500 continues with operation 510 where the second unit 102-1B of the first BS102-1 on the CP 102-1BA determines wireless network traffic information, according to some embodiments. In some embodiments, the wireless network traffic information includes a total amount of bearer split data traffic at the second BS 102-2. In some embodiments, the total amount of bearer split data traffic at the second BS102-2 is determined by subtracting the total amount of data of the at least one second data packet discarded by the second BS102-2 from the total amount of data in the at least one data packet sent by the PDCP entity of the first BS102-1 to the RLC entity of the second BS 102-2.
While various embodiments of the present invention have been described above, it should be understood that they have been presented by way of example only, and not limitation. Likewise, the various figures may depict example architectures or configurations provided to enable one of ordinary skill in the art to understand the example features and functionality of the present invention. However, those skilled in the art will appreciate that the invention is not limited to the example architectures or configurations shown, but may be implemented using a variety of alternative architectures and configurations. In addition, one or more features of one embodiment may be combined with one or more features of another embodiment described herein, as would be understood by one of ordinary skill in the art. Thus, the breadth and scope of the present disclosure should not be limited by any of the above-described exemplary embodiments.
It will also be understood that any reference herein to elements using a name such as "first," "second," etc., does not generally limit the number or order of those elements. Rather, these names may be used herein as a convenient means of distinguishing between two or more elements or instances of an element. Thus, reference to first and second elements does not imply that only two elements are used or that the first element must be somehow before the second element.
In addition, those of ordinary skill in the art would understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits and symbols that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.
Those of ordinary skill would further appreciate that any of the various illustrative logical blocks, modules, processors, devices, circuits, methods, and functions described in connection with the aspects disclosed herein may be implemented as electronic hardware (e.g., a digital implementation, an analog implementation, or a combination of the two, which may be designed using source code encoding or some other technique), with various forms of program or design code incorporating instructions (which may be referred to herein, for convenience, as "software" or a "software module"), or with combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware, firmware, or software, or combinations of such technologies, depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.
Furthermore, those of ordinary skill in the art will appreciate that the various illustrative logical blocks, modules, devices, components, and circuits described in this application may be implemented or performed with Integrated Circuits (ICs) including a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, or any combination thereof. The logic blocks, modules and circuits may further include antennas and/or transceivers to communicate with various components within the network or within the device. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other suitable configuration to perform the functions described herein.
If implemented in software, the functions may be stored as one or more instructions or code on a computer-readable medium. Thus, the steps of a method or algorithm disclosed herein may be implemented as software stored on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that can cause a computer program or code to be transmitted from one place to another. A storage media may be any available media that can be accessed by a computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store desired program code in the form of instructions or data structures and that can be accessed by a computer.
As used herein, the term "module" refers to software, firmware, hardware, and any combination of these elements for performing the functionality described herein. In addition, for purposes of discussion, the various modules are described as discrete modules; however, it will be apparent to those of ordinary skill in the art that two or more modules may be combined to form a single module that performs the associated functions according to embodiments of the present invention.
Additionally, memory or other storage and communication components may be employed in embodiments of the present invention. It will be appreciated that the above description for clarity has described embodiments of the invention with reference to different functional units and processors. However, it will be apparent that any suitable distribution of functionality between different functional units, processing logic elements or domains may be used without detracting from the invention. For example, functionality illustrated to be performed by separate processing logic elements or controllers may be performed by the same processing logic elements or controllers. Thus, references to specific functional units are only to references to suitable means for providing the described functionality rather than indicative of a strict logical or physical structure or organization.
Various modifications to the embodiments described in this disclosure will be readily apparent to those skilled in the art, and the generic principles defined in this application may be applied to other embodiments without departing from the scope of the disclosure. Thus, the disclosure is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the novel features and principles disclosed herein as set forth in the following claims.
Claims (23)
1. A method for performing wireless network traffic analysis by a first wireless communication node, comprising:
transmitting a first message to a second wireless communication node, wherein the first message comprises first information of at least one first data packet to be discarded;
receiving a second message from the second wireless communication node, wherein the second message comprises second information of at least one dropped data packet; and
determining wireless network flow information according to the second message;
wherein the at least one dropped packet in the second message comprises at least one packet in the first packet to be dropped in the first message, and the wireless network traffic information comprises a total amount of data traffic on the second wireless communication node.
2. The method of claim 1, wherein the first wireless communication node comprises a Packet Data Convergence Protocol (PDCP) entity.
3. The method of claim 1, wherein the first message is sent on a User Plane (UP).
4. The method according to claim 1, characterized in that said first message is sent from a central unit, CU, of said first wireless communication node.
5. The method of claim 1, wherein the first message is received by a Distributed Unit (DU) of the second wireless communication node.
6. The method of claim 1, wherein the second information of the at least one dropped packet in the second message comprises at least one of: a total number of packets, at least one pair of corresponding indices, and start and end times.
7. The method of claim 1, wherein the second message is sent on UP or control plane CP.
8. The method of claim 1, wherein the second message is sent by a DU or a CU of the second wireless communication node.
9. The method of claim 1, wherein the second message is received by a CU of the first wireless communication node.
10. The method of claim 1, further comprising:
receiving, by a CU of the first wireless communication node on a CP, a third message from the CU of the first wireless communication node on a UP, wherein the third message includes third information of at least one transmitted packet, wherein the at least one transmitted packet is transmitted from a PDCP entity of the first wireless communication node into an RLC entity of the second wireless communication node, and the third information includes a total amount of the at least one transmitted packet.
11. The method of claim 10, wherein the total amount of the data traffic on the second wireless communication node is determined by subtracting the total amount of the at least one dropped data packet in the second message from the total amount of the at least one transmitted data packet in the third information.
12. A method for performing wireless network traffic analysis by a first wireless communication node, comprising:
receiving a first message from a second wireless communication node, wherein the first message comprises first information of at least one first data packet to be discarded;
transmitting a second message to the second wireless communication node, wherein the second message comprises second information of at least one dropped packet, wherein the second information is used to determine wireless network traffic information, wherein the at least one dropped packet in the second message comprises at least one of the first packets to be dropped in the first message, and the wireless network traffic information comprises a total amount of data traffic on the first wireless communication node.
13. The method of claim 12, wherein the second wireless communication node comprises a Packet Data Convergence Protocol (PDCP) entity.
14. The method of claim 12, wherein the first message is received on a User Plane (UP).
15. The method according to claim 12, characterized in that said first message is received from a central unit, CU, of said second wireless communication node.
16. The method according to claim 12, characterized in that said first message is received by a distributed unit, DU, of said first wireless communication node.
17. The method of claim 12, wherein the second information of the at least one dropped packet comprises at least one of: a total number of packets, at least one pair of corresponding indices, and start and end times.
18. The method of claim 12, wherein the second message is sent on UP or control plane CP.
19. The method of claim 12, wherein the second message is sent via a DU or a CU of the first wireless communication node.
20. The method of claim 12, wherein the second message is sent to a CU of the second wireless communication node.
21. The method of claim 12, wherein the total amount of data traffic on the first wireless communication node is determined by subtracting a total amount of the at least one dropped packet in the second message from a total amount of the at least one transmitted packet received by a CU of the second wireless communication node on CP in a third message from the CU of the second wireless communication node on UP, wherein the at least one transmitted packet is received by a Radio Link Control (RLC) entity of the first wireless communication node from a PDCP entity of the second wireless communication node.
22. A computing device comprising at least one processor and a memory coupled with the processor, the at least one processor configured to perform the method of any of claims 1-21.
23. A non-transitory computer readable medium having stored thereon computer executable instructions for performing the method of any one of claims 1 to 21.
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/CN2018/105440 WO2020034290A1 (en) | 2018-09-13 | 2018-09-13 | Method and apparatus for performing wireless network traffic analysis |
Publications (2)
Publication Number | Publication Date |
---|---|
CN112970229A CN112970229A (en) | 2021-06-15 |
CN112970229B true CN112970229B (en) | 2021-11-30 |
Family
ID=69524927
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201880097291.7A Active CN112970229B (en) | 2018-09-13 | 2018-09-13 | Method and equipment for analyzing wireless network flow |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN112970229B (en) |
WO (1) | WO2020034290A1 (en) |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106664737A (en) * | 2014-08-06 | 2017-05-10 | 株式会社Ntt都科摩 | User equipment |
CN108029037A (en) * | 2015-12-07 | 2018-05-11 | 谷歌有限责任公司 | IP layers of dual link and carrier aggregation |
WO2018097599A1 (en) * | 2016-11-27 | 2018-05-31 | 엘지전자(주) | De-registration method in wireless communication system and device therefor |
-
2018
- 2018-09-13 WO PCT/CN2018/105440 patent/WO2020034290A1/en active Application Filing
- 2018-09-13 CN CN201880097291.7A patent/CN112970229B/en active Active
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106664737A (en) * | 2014-08-06 | 2017-05-10 | 株式会社Ntt都科摩 | User equipment |
CN108029037A (en) * | 2015-12-07 | 2018-05-11 | 谷歌有限责任公司 | IP layers of dual link and carrier aggregation |
WO2018097599A1 (en) * | 2016-11-27 | 2018-05-31 | 엘지전자(주) | De-registration method in wireless communication system and device therefor |
Non-Patent Citations (2)
Title |
---|
Discussion on LTE PDCP operation;OPPO;《R2-1801846,3GPP TSG-RAN2 Meeting #101》;20180302;第5.2,5.4.1.1节 * |
Further discussion on data retransmission indication;ZTE;《R3-180131,3GPP TSG RAN WG3 NR ADHOC》;20180126;第2节 * |
Also Published As
Publication number | Publication date |
---|---|
WO2020034290A1 (en) | 2020-02-20 |
CN112970229A (en) | 2021-06-15 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP3915301B1 (en) | Method and apparatus for reporting master cell group failure | |
CN115250513A (en) | Mobility management method and communication device | |
US20220014964A1 (en) | Method and apparatus for monitoring performance | |
US11991543B2 (en) | Method and apparatus for minimization of drive tests | |
CN112970229B (en) | Method and equipment for analyzing wireless network flow | |
US20210298105A1 (en) | Method and apparatus for frequency measurement and gap configuration | |
AU2019460048B2 (en) | Feedback channel allocation and transmission method and device | |
CN113170356B (en) | Method and apparatus for bearer traffic migration in a multi-connectivity system | |
WO2023245643A1 (en) | Systems and methods for device-to-device communications | |
US20210345446A1 (en) | Method and apparatus for removing user plan connections in multi-connectivity systems | |
WO2024077600A1 (en) | Systems and methods for device-to-device communications |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |