Method for performing l4s-based coexistence technology, and electronic device for performing method

Abstract

The present disclosure relates to a 5G or 6G communication system for supporting a data transmission rate higher than that of a 4G communication system such as LTE. A method by which a terminal performs low latency low loss scalable throughput (L4S)-based coexistence technology, according to one embodiment of the present disclosure, may comprise: identifying whether an L4S flow and non-L4S flow coexistence situation has occurred; performing base coupling factor configuration for L4S-based coexistence technology; determining whether to perform the L4S-based coexistence technology on the basis of the throughput related to the L4S flow and the throughput related to the non-L4S flow; and performing the L4S-based coexistence technology on the basis of the determination result and the base coupling factor.

Description

Method for performing L4S-based coexistence technology and electronic device for performing the method

[0001] The embodiments disclosed in this document relate to a method for performing L4S (Low latency Low loss Scalable Throughput) based coexistence technology in a wireless communication system and an electronic device for performing the method.

[0002] Looking back at the evolution of wireless communication through successive generations, technologies have been developed primarily for human-oriented services, such as voice, multimedia, and data. Following the commercialization of 5G (5th-generation) communication systems, connected devices, which have been increasing explosively, are expected to be connected to communication networks. Examples of networked objects include vehicles, robots, drones, home appliances, displays, smart sensors installed in various infrastructures, construction machinery, and factory equipment. Mobile devices are expected to evolve into various form factors, such as augmented reality glasses, virtual reality headsets, and holographic devices. In the 6G (6th-generation) era, efforts are underway to develop improved 6G communication systems to connect hundreds of billions of devices and objects to provide diverse services. For this reason, 6G communication systems are being referred to as "beyond 5G" systems.

[0003] In the 6G communication system predicted to be realized around 2030, the maximum transmission speed is tera (i.e., 1,000 gigabit) bps, and the wireless latency is 100 microseconds (μsec). In other words, compared to the 5G communication system, the transmission speed in the 6G communication system is 50 times faster, and the wireless latency is reduced to one-tenth.

[0004] To achieve such high data transmission speeds and ultra-low latency, 6G communication systems are being considered for implementation in the terahertz band (e.g., the 95 GHz to 3 terahertz (3 THz) band). In the terahertz band, due to more severe path loss and atmospheric absorption compared to the millimeter wave (mmWave) band introduced in 5G, the importance of technology capable of guaranteeing signal reach, or coverage, is expected to increase. As key technologies to ensure coverage, radio frequency (RF) devices, antennas, new waveforms that offer better coverage than orthogonal frequency division multiplexing (OFDM), beamforming, and multi-antenna transmission technologies such as massive multiple-input and multiple-output (massive MIMO), full-dimensional MIMO (FD-MIMO), array antennas, and large-scale antennas must be developed. In addition, new technologies such as metamaterial-based lenses and antennas, high-dimensional spatial multiplexing technology using orbital angular momentum (OAM), and reconfigurable intelligent surface (RIS) are being discussed to improve coverage of terahertz band signals.

[0005] In addition, to improve frequency efficiency and system network, development is underway in 6G communication systems for full duplex technology, in which uplink and downlink simultaneously utilize the same frequency resources at the same time; network technology that integrates satellites and HAPS (high-altitude platform stations); network structure innovation technology that supports mobile base stations and enables network operation optimization and automation; dynamic spectrum sharing technology through collision avoidance based on spectrum usage prediction; AI-based communication technology that utilizes AI (artificial intelligence) from the design stage and internalizes end-to-end AI support functions to realize system optimization; and next-generation distributed computing technology that realizes services of complexity exceeding the limits of terminal computing capabilities by utilizing ultra-high performance communication and computing resources (mobile edge computing (MEC), cloud, etc.). In addition, attempts are continuing to further strengthen connectivity between devices, further optimize networks, promote the softwareization of network entities, and increase the openness of wireless communication through the design of new protocols to be used in 6G communication systems, the implementation of hardware-based security environments, the development of mechanisms for the safe utilization of data, and the development of technologies regarding privacy maintenance methods.

[0006] Due to the research and development of such 6G communication systems, it is expected that a new dimension of hyper-connected experience will become possible through the hyper-connectivity of 6G communication systems, which encompasses not only connections between objects but also connections between people and objects. Specifically, it is projected that 6G communication systems will enable the provision of services such as truly immersive extended reality (truly immersive XR), high-fidelity mobile holograms, and digital replicas. Furthermore, services such as remote surgery, industrial automation, and emergency response, which are provided through 6G communication systems with enhanced security and reliability, will be applied in various fields including industry, healthcare, automotive, and home appliances.

[0007] Recently, 3GPP Rel 18 discussed and added operations to support L4S in 5G networks, but currently, the number of base stations capable of supporting this among 5G operators is limited. Therefore, a method is devised to enable L4S operations to be performed at terminals and to efficiently perform L4S operations at base stations.

[0008] The present disclosure may be implemented in various ways, including methods, systems, devices, or computer programs stored on computer-readable storage media.

[0009] A method for a terminal to perform L4S (Low latency Low loss Scalable throughput)-based coexistence technology according to one embodiment of the present disclosure may include a step of identifying whether a situation of L4S flow and non-L4S flow coexistence has occurred. The method may include a step of setting a base coupling factor for L4S-based coexistence technology. The method may include a step of determining whether to perform L4S-based coexistence technology based on throughput regarding L4S flow and throughput regarding non-L4S flow. The method may include a step of performing L4S-based coexistence technology based on the determination result and the base coupling factor.

[0010] A method for a base station to perform L4S-based coexistence technology according to one embodiment of the present disclosure may include a step of identifying whether a situation in which L4S flow and non-L4S flow coexistence occurs. The method may include a step of receiving information regarding a type of congestion control algorithm for performing L4S-based coexistence technology from an Application Function (AF). The method may perform a step of setting a base coupling factor based on the information regarding the type of congestion control algorithm. The method may include a step of performing L4S-based coexistence technology based on the base coupling factor.

[0011] A terminal performing an L4S-based coexistence technique according to one embodiment of the present disclosure may include a memory storing a plurality of instructions and at least one processor executing a plurality of instructions stored in the memory. The terminal can identify whether an L4S flow and non-L4S flow coexistence situation has occurred by executing a plurality of instructions individually or collectively by at least one processor. The terminal can perform a base coupling factor setting for an L4S-based coexistence technique by executing a plurality of instructions individually or collectively by at least one processor. The terminal can determine whether to perform an L4S-based coexistence technique based on throughput regarding an L4S flow and throughput regarding a non-L4S flow by executing a plurality of instructions individually or collectively by at least one processor. The terminal can perform an L4S-based coexistence technique based on a determination result and a base coupling factor by executing a plurality of instructions individually or collectively by at least one processor.

[0012] Figure 1 is a diagram illustrating L4S-based coexistence technology.

[0013] Figure 2 is a diagram illustrating Active Queue Management (AQM), an example of L4S-based coexistence technology.

[0014] FIG. 3 is a diagram illustrating an L4S-based coexistence technology in a terminal according to one embodiment of the present disclosure.

[0015] FIG. 4 is a flowchart illustrating an L4S-based coexistence technology in a terminal according to one embodiment of the present disclosure.

[0016] FIG. 5 is a diagram illustrating a method for setting a base coupling factor for an L4S-based coexistence technology according to one embodiment of the present disclosure.

[0017] FIG. 6 is a diagram illustrating the reason why real-time information regarding the RTT ratio according to one embodiment of the present disclosure should be considered.

[0018] FIG. 7 is a diagram illustrating a method for considering real-time information regarding the RTT ratio according to one embodiment of the present disclosure.

[0019] FIG. 8 is a flowchart illustrating a method for considering real-time information regarding the RTT ratio according to one embodiment of the present disclosure.

[0020] FIG. 9 is a flowchart specifically illustrating a method for considering real-time information regarding the RTT ratio according to one embodiment of the present disclosure.

[0021] FIG. 10 is a diagram illustrating a method for determining whether to perform coexistence technology based on flow throughput according to one embodiment of the present disclosure.

[0022] FIG. 11 is a flowchart illustrating a method for determining whether to perform coexistence technology based on flow throughput according to one embodiment of the present disclosure.

[0023] FIG. 12 is a flowchart illustrating an L4S-based coexistence technology in a base station according to one embodiment of the present disclosure.

[0024] FIG. 13a is a diagram illustrating a method for setting a base coupling factor in a PCF to perform L4S-based coexistence technology at a base station when L4S is supported in a RAN according to one embodiment of the present disclosure.

[0025] FIG. 13b is a diagram illustrating a method for setting a base coupling factor in an SMF to perform L4S-based coexistence technology at a base station when L4S is supported in a RAN according to one embodiment of the present disclosure.

[0026] FIG. 13c is a diagram illustrating a method for setting a base coupling factor in a RAN to perform L4S-based coexistence technology at a base station when L4S is supported in a RAN according to one embodiment of the present disclosure.

[0027] FIG. 14a is a diagram illustrating a method for setting a base coupling factor in a PCF to perform L4S-based coexistence technology at a base station when L4S is supported in a UPF according to one embodiment of the present disclosure.

[0028] FIG. 14b is a diagram illustrating a method for setting a base coupling factor in an SMF to perform L4S-based coexistence technology at a base station when L4S is supported in a UPF according to one embodiment of the present disclosure.

[0029] FIG. 14c is a diagram illustrating a method for setting a base coupling factor in a UPF to perform L4S-based coexistence technology at a base station when the UPF supports L4S according to one embodiment of the present disclosure.

[0030] FIG. 15a is a diagram illustrating a method for determining whether to perform coexistence technology in a PCF and a coupling factor update method to perform L4S-based coexistence technology in a base station when L4S is supported in a RAN according to one embodiment of the present disclosure.

[0031] FIG. 15b is a diagram illustrating a method for determining whether to perform coexistence technology in an SMF and a coupling factor update method to perform L4S-based coexistence technology in a base station when L4S is supported in a RAN according to one embodiment of the present disclosure.

[0032] FIG. 15c is a diagram illustrating a method for determining whether to perform coexistence technology in a RAN and a coupling factor update method to perform L4S-based coexistence technology in a base station when L4S is supported in a RAN according to one embodiment of the present disclosure.

[0033] FIG. 16a is a diagram illustrating a method for determining whether to perform coexistence technology in a PCF and a coupling factor update method to perform L4S-based coexistence technology in a base station when L4S is supported in a UPF according to one embodiment of the present disclosure.

[0034] FIG. 16b is a diagram illustrating a method for determining whether to perform coexistence technology in an SMF and a coupling factor update method to perform L4S-based coexistence technology in a base station when L4S is supported in a UPF according to one embodiment of the present disclosure.

[0035] FIG. 16c is a diagram illustrating a method for determining whether to perform coexistence technology in a UPF and a coupling factor update method to perform L4S-based coexistence technology in a base station when L4S is supported in a UPF according to one embodiment of the present disclosure.

[0036] FIG. 17a is a diagram illustrating a method for setting a base coupling factor in a PCF using a message from a UE to perform L4S-based coexistence technology at a base station when L4S is supported in a RAN according to one embodiment of the present disclosure.

[0037] FIG. 17b is a diagram illustrating a method for setting a base coupling factor in an SMF using a message from a UE to perform L4S-based coexistence technology at a base station when L4S is supported in a RAN according to one embodiment of the present disclosure.

[0038] FIG. 17c is a diagram illustrating a method for setting a base coupling factor in a RAN using a message from a UE to perform L4S-based coexistence technology at a base station when L4S is supported in a RAN according to one embodiment of the present disclosure.

[0039] FIG. 18a is a diagram illustrating a method for setting a base coupling factor in a PCF using a message from a UE to perform L4S-based coexistence technology at a base station when L4S is supported in a UPF according to one embodiment of the present disclosure.

[0040] FIG. 18b is a diagram illustrating a method for setting a base coupling factor in an SMF using a message from a UE to perform L4S-based coexistence technology at a base station when L4S is supported in a UPF according to one embodiment of the present disclosure.

[0041] FIG. 18c is a diagram illustrating a method for setting a base coupling factor in a UPF using a message from a UE to perform L4S-based coexistence technology at a base station when the UPF supports L4S according to one embodiment of the present disclosure.

[0042] FIG. 19 is a block diagram of a terminal or user equipment according to one embodiment of the present disclosure.

[0043] FIG. 20 is a schematic block diagram of a base station according to one embodiment of the present disclosure.

[0044] Hereinafter, embodiments of the present disclosure will be described in detail with reference to the attached drawings.

[0045] While various details have been described for the purpose of facilitating understanding in describing the embodiments, it will be understood that some aspects of the present disclosure may be practiced without including all such details. Furthermore, various modifications and alternatives are possible regarding the details presented herein, and all of these should be considered to be included within the scope of the present disclosure. Meanwhile, descriptions of technical content that are widely known in the art and may unnecessarily obscure the understanding of the present disclosure may be appropriately omitted, and such omitted descriptions should also be understood to be included within the scope of the present disclosure.

[0046] For the same reason, some components in the attached drawings have been exaggerated, omitted, or schematically depicted. Additionally, the size of each component does not entirely reflect its actual size. Identical or corresponding components in each drawing have been assigned the same or different reference numbers.

[0047] The advantages and features of the present disclosure, and the methods for achieving them, will become clear through the embodiments described below in conjunction with the accompanying drawings. However, the present disclosure is not limited to the embodiments presented below and may be implemented in various forms. Other features, aspects, and advantages disclosed in the present disclosure will become more clear through the following description of the present disclosure. The following embodiments are merely illustrative to aid in understanding the present disclosure and should not be interpreted in any way as limiting the scope or spirit of the present disclosure. Rather, the present disclosure includes all modifications, changes, and alternatives made within the spirit and scope of the present disclosure as defined by the appended claims and their equivalents. Identical or similar components throughout the disclosure are assigned identical or similar reference numerals. Furthermore, terms described below are defined with consideration of their function in the present disclosure and may be used differently depending on the user, operator, or convention. Accordingly, the definitions of terms should be interpreted based on the content of the entire present disclosure.

[0048] In the present disclosure, it will be understood that each block of the process flow diagrams and combinations of the flow diagrams may be performed based on computer program instructions. Since these computer program instructions may be optionally loaded into at least one processor of a general-purpose computer, a computer for special purposes, or other programmable data processing equipment, the instructions performed through any one or any combination of at least one processor of the computer or other programmable data processing equipment create means for performing the functions described in the flow diagram block(s). Since these computer program instructions may also be stored in computer-available or computer-readable memory that can be directed toward the computer or other programmable data processing equipment to implement the functions in a specific manner, the instructions stored in computer-available or computer-readable memory may also produce a manufactured item containing means of instruction for performing the functions described in the flow diagram block(s). Since computer program instructions can be loaded onto a computer or other programmable data processing equipment, instructions that perform a series of operation steps on the computer or other programmable data processing equipment to create a process executed by the computer can also provide steps for executing the functions described in the flowchart block(s).

[0049] Additionally, each block may represent a module, segment, or part of code containing one or more executable instructions for executing a specified logical function(s). It should also be noted that in some alternative execution examples, the functions mentioned in the blocks may occur out of order. For example, two blocks (or functions) described in succession may actually be executed substantially simultaneously, or the blocks may sometimes be executed in reverse order according to the corresponding function.

[0050] As used in the embodiments of the present disclosure, the term “part / module” refers to a software or hardware component such as a field programmable gate array (FPGA) or an application-specific integrated circuit (ASIC), and the “part / module” performs certain roles. However, the term including “part / module” is not limited to software or hardware. The “part / module” may be configured to reside in an addressable storage medium or may be configured to run one or more processors. Accordingly, by example, the “part / module” includes components such as software components, object-oriented software components, class components, and task components, as well as processes, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuits, data, databases, data structures, tables, arrays, and variables. The functions provided within the components and 'parts / modules' may be combined into a smaller number of components and 'parts / modules' or further separated into additional components and 'parts / modules'. In addition, the components and 'parts / modules' may be implemented to utilize one or more CPUs (central processing units) within the device or secure multimedia card. Furthermore, in the embodiments, the 'parts / modules' may include one or more processors.

[0051] The entirety of one or more computer programs may be stored in a single memory device, or one or more computer programs may be divided into different parts and stored across multiple memory devices.

[0052] Additionally, any / any function or operation described in this disclosure may be processed by a single processor or a combination of processors. The single processor or combination of processors may be a circuitry that performs processing, and may include an application processor (AP, e.g., a central processing unit (CPU)), a communication processor (CP, e.g., a modem), a graphics processing unit (GPU), a neural network processing unit (NPU) (e.g., an artificial intelligence (AI) chip), a Wi-Fi chip, a Bluetooth® chip, a global positioning system (GPS) chip, a near-field communication (NFC) chip, a connectivity chip, a sensor controller, a touch controller, a fingerprint sensor controller, a display driver integrated circuit (IC), an audio codec (CODEC) chip, a universal serial bus (USB) controller, a camera controller, an image processing IC, a microprocessor, a microcontroller, a digital signal processor, an FPGA, an ASIC, a microprocessor unit (MPU), a system-on-chip (SoC), an IC, or similar circuitry. The single processor or combination of processors described above can control the overall operation of an electronic device by executing instructions, such as an operating system, that can be stored in memory. Additionally, the processor or combination of processors can execute other processes or programs residing in memory (e.g., processes related to the present disclosure).

[0053] Additionally, it should be noted that various embodiments in the claims and description of the present disclosure may be implemented in the form of hardware, software, or a combination of hardware and software.

[0054] Such software may be stored on a non-transitory computer-readable storage medium. A non-transitory computer-readable storage medium stores one or more computer programs (software modules), said one or more computer programs include computer-executable instructions that operate an electronic device to perform a method according to the present disclosure when executed individually or collectively by one or more processors of an electronic device. Alternatively, said software may be a computer program (or product) that includes instructions that operate an electronic device to perform a method according to the present disclosure when executed individually or collectively by one or more processors of an electronic device.

[0055] The software may be stored in a transient or non-transient storage device, for example, in the form of read-only memory (ROM) (whether or not it is erasable or rewritable), or random access memory (RAM), memory chips, devices, or integrated circuits (ICs). Additionally, the software may be stored in the form of an optically or magnetically readable medium, for example, a compact disc (CD), a digital multifunction disc (DVD), a magnetic disc, or a magnetic tape. It should be understood that the storage device and the storage medium are examples of non-transient machine-readable storage media suitable for storing programs for implementing various embodiments of the present disclosure. Accordingly, various embodiments of the present disclosure may provide a program comprising code for implementing an apparatus or method according to any one of the claims of the present disclosure, and a non-transient machine-readable storage medium storing such program.

[0056] In the following disclosure, determining the priority between A and B may be referred to in various ways, such as selecting the one with the higher priority according to a predetermined priority rule and performing the corresponding action, or omitting or dropping the action for the one with the lower priority.

[0057] Hereinafter, 'A or B' as described in the present disclosure may be understood as 'A and / or B', which may be understood as including 'A', or 'B', or 'A and B'.

[0058] Additionally, 'at least one of A, B, and C' described in the present disclosure may be understood to include 'A', or 'B', or 'C', or 'any combination of A, B, and C'.

[0059] Additionally, 'at least one of A, B, or C' described in the present disclosure may be understood to include 'A', or 'B', or 'C', or 'any combination of A, B, and C'.

[0060] Additionally, 'A / B' as described in the present disclosure may be understood as 'A and / or B', which may be understood as including 'A', or 'B', or 'A and B'.

[0061] Additionally, 'A, B' described in the present disclosure may be understood as 'A and / or B', which may be understood as including 'A', or 'B', or 'A and B'.

[0062] Additionally, 'A and B' described in the present disclosure may be understood as 'A and / or B', which may be understood as including 'A', or 'B', or 'A and B'.

[0063] Furthermore, the phrase "when conditions A and B are satisfied" as described in the present disclosure is not necessarily limited to cases where both conditions A and B are satisfied, but may be understood to include cases where either condition A or condition B is satisfied individually, cases where both conditions A and B are satisfied, or cases where one or more additional conditions are satisfied together.

[0064] Furthermore, throughout this disclosure, ordinal terms (and similar modifiers) such as 'first', 'second', 'third', etc. are used solely for the purpose of distinguishing various instances, occurrences, configurations, messages, stages, elements, or aspects of elements, operations, or information, as described below. Unless clearly required otherwise by the context, the use of such ordinal terms does not require that the elements, operations, or information distinguished by such terms be structurally different, numerically distinct, or substantially different. For example, 'first signal' and 'second signal' may represent instances of the same signal transmitted at different times, signals containing the same core information even with some variations, or signals having different content or characteristics depending on the specific context. Similarly, 'first value' and 'second value' may represent the same size measured or applied in different situations, or they may represent different sizes. Such interpretation must be determined based on the specific technical context, function, and relationship described in the relevant parts of the disclosure and claims.

[0065] Furthermore, although terms such as "first," "second," etc., as used in this disclosure are used for various elements such as information, objects, actions, and sequences, they are not intended to limit such elements to a specific order. These terms may be understood merely as distinguishing one element from another. For example, a first element may be referred to as a second element, and likewise, a second element may be referred to as a first element.

[0066] Additionally, the terms 'first' and 'second' described in this disclosure may be understood to refer to identical or different elements. For example, if an element is information, the first information and the second information may both be information, and depending on the case, they may be the same information or different information.

[0067] Furthermore, expressions such as "if" and "in case that" as described in the present disclosure or claims may be interpreted, depending on the context, as meaning "when or upon," "in response to," "based on," or "according to," and these expressions may be used interchangeably. In addition, other expressions having substantially the same meaning may be used as substitutes for these expressions, provided that they do not impair the technical features of the present disclosure. Furthermore, if a method step (e.g., a step of transmitting a signal) is performed in relation to such terms (e.g., "in case that" or similar expressions) in accordance with the disclosure of the present specification, this may be interpreted as the method step being performed in response to a prior determination that a specific element has a specific state (e.g., bit length exceeding X).

[0068] For example, physical layer signaling may be referred to as L1 (Layer 1) signaling and may include downlink control information (DCI). Additionally, upper layer signaling may include at least one of a medium access control (MAC) control message, a radio resource control (RRC) signaling message, a non-access stratum (NAS) signaling message, or an application layer message. The RRC signaling message may be referred to as L3 (Layer 3) signaling. However, upper layer signaling is not limited to the above examples.

[0069] Additionally, the term "not perform" as used in this disclosure or claims may be understood, depending on the context, to mean to omit or skip the corresponding step. Such a term may be replaced with other terms having the same or substantially similar meaning.

[0070] Additionally, the phrase “transmitting a message containing A and B” as described in the present disclosure may be interpreted to include not only (i) cases where A and B are transmitted as a single message, but also (ii) cases where A and B are transmitted individually through multiple messages (e.g., transmitting a first message containing A and a second message containing B). This interpretation may also apply to cases where messages containing two or more items, such as A, B, and C, are transmitted together or individually.

[0071] In addition, 'transmitting a message containing A and transmitting a message containing B' can also be interpreted as transmitting a single message containing A and B.

[0072] In the embodiments described in this disclosure, terms or components included in the disclosure may be expressed in the singular or plural form according to the specific embodiments presented. However, the singular or plural expression is selected to suit the context presented for convenience of explanation, and the disclosure is not limited to singular or plural components; even if a component is expressed in the plural form, it may be composed in the singular form, and even if a component is expressed in the singular form, it may be composed in the plural form.

[0073] The drawings or flowcharts described in this disclosure illustrate exemplary methods that may be implemented according to the principles of this disclosure, and various modifications may be made to the methods illustrated in the flowcharts of this disclosure. For example, although illustrated as a series of steps, the various steps of each drawing or flowchart may overlap, occur in parallel, occur in a different order, or occur multiple times. In other examples, any step may be omitted or replaced with another step.

[0074] Additionally, the process of the flowchart can be performed by an electronic device, and one or more steps of the flowchart can be implemented by one or more processors that execute instructions to perform specific functions.

[0075] The methods and apparatus proposed in the embodiments of the present disclosure may be disclosed together with drawings including flowcharts to illustrate exemplary methods that may be implemented according to the principles of the present disclosure. Such flowcharts may include different branches and / or sub-branches. It should be understood that the principles of the present disclosure are not limited to combinations of all branches and sub-branches disclosed in the embodiments, and may consist of at least one individual branch or individual sub-branch, in particular only a single branch or a single sub-branch.

[0076] The methods and devices proposed in the embodiments of the present disclosure below are not limited to each embodiment and may be utilized as a combination of all or part of the embodiments proposed in the disclosure. Accordingly, the embodiments of the present disclosure may be applied with some modifications within the scope that does not deviate significantly from the scope of the present disclosure, at the judgment of a person skilled in the art.

[0077] In this case, any wording mentioned in different embodiments may be used interchangeably, combined, or substituted if the concepts correspond. For example, regarding the same or corresponding concepts, even if the expression 'A' is used in one embodiment and the expression 'B' is used in another embodiment, they may be understood by interchangeably, substituted, or combined.

[0078] Terms used in the following description to identify connection nodes, terms referring to network entities, terms referring to messages, terms referring to interfaces between network entities, terms referring to various identification information, etc., are examples provided for the convenience of explanation. Accordingly, the present disclosure is not limited to the terms described below, and other terms referring to objects having equivalent technical meanings may be used. Furthermore, where appropriate, such terms may be replaced with terms defined in similar technical specifications of standardization organizations such as 3GPP (3rd generation partnership project) Technical Specifications (TS) or ETSI (European Telecommunications Standards Institute).

[0079] Hereinafter, the base station is an entity that performs resource allocation of the terminal and may be at least one of gNode B, eNode B, Node B, BS (base station), wireless access unit, base station controller, or a node on the network.

[0080] In addition, the base station of the present disclosure may include a structure split into a central unit (CU) and a distributed unit (DU). In such a structure, the CU is responsible for the upper layer of the control and user plane, and the DU is responsible for the processing of wireless resources in the lower layer. The embodiments of the present disclosure can be equally applied to a 5G base station structure in which functions are split into the CU and DU as described above.

[0081] The terminal may include at least one of user equipment (UE), mobile station (MS), cellular phone, smartphone, computer, tablet, wearable device, Internet of Things (IoT) device, or other device / system capable of performing communication functions.

[0082] In the present disclosure, a downlink (DL) refers to a wireless transmission path of a signal transmitted by a base station to a terminal, and an uplink (UL) refers to a wireless transmission path of a signal transmitted by a terminal to a base station.

[0083] In addition, while a 5th generation mobile communication system (5G, new radio, NR) and a 6th generation mobile communication system (6G) may be described below as examples, embodiments of the present disclosure may also be applied to other communication systems having similar technical backgrounds or channel types. For example, new advanced mobile communication systems developed after 5G and 6G may be included therein. Furthermore, the present disclosure may be applied to other communication systems (e.g., Wi-Fi systems) with some modifications made in the judgment of a person with skilled technical knowledge, without significantly departing from the scope of the present disclosure.

[0084] In the following description, the terms "physical channel" and "signal" may be used interchangeably with "data" or "control signal." For example, PDSCH (physical downlink shared channel) is a term referring to a physical channel through which data is transmitted, but PDSCH may also be used to refer to data. That is, in this disclosure, the expression "transmits a physical channel" may be interpreted as equivalent to the expression "transmits data or a signal through a physical channel."

[0085] In describing the present disclosure below, the term "upper layer signaling" may be a signaling corresponding to at least one or a combination of at least one of MIB (master information block), SIB (system information block), SIB M (M=1, 2, …), RRC, MAC CE, NAS (non-access stratum) signaling, or application layer messages. The RRC signaling may also be referred to as L3 signaling (layer 3 signaling).

[0086] Additionally, L1 signaling may be a signaling method corresponding to at least one or a combination of at least one of the following: a physical layer channel or signaling of a PDCCH (physical downlink control channel), a DCI, a UE-specific DCI, a group common DCI, a common DCI, a scheduling DCI (e.g., a DCI used for the purpose of scheduling downlink or uplink data), a non-scheduling DCI (e.g., a DCI not used for the purpose of scheduling downlink or uplink data), a PUCCH (physical uplink control channel), or an UCI (uplink control information). The above L1 signaling may also be referred to as physical layer signaling.

[0087] Hereinafter, the expression in the present disclosure or claims that information can be configured from a base station may mean that, depending on the context, a terminal receives said information from a base station through physical layer signaling or upper layer signaling, and such expression may be replaced with other terms having the same or substantially similar meaning.

[0088] In the present disclosure, a cell may represent an area covered by a single base station in wireless communication. Cells may be classified according to size into mega cells, macro cells, micro cells, pico cells, etc., but this is merely an example and the types of cells are not limited to those described above.

[0089] In the present disclosure, L4S (Low latency Low loss Scalable throughput) may refer to a traffic management mechanism aimed at ultra-low latency, low packet loss, and scalable throughput. It may refer to a mechanism provided for applications requiring mutual communication between a user and a server, or for services where ultra-low latency communication plays an important role, such as AR and XR.

[0090] In the present disclosure, a flow may refer to a logical stream of data packets transmitted between a specific source and a specific destination over a network. In one embodiment, L4S flows and non-L4S flows may coexist.

[0091] In the present disclosure, a coupling factor is a concept that measures the interaction or interdependence between two systems, components, or variables, and may include a coupling factor for the throughput relationship between L4S flow and non-L4S flow.

[0092] In the present disclosure, the base coupling factor may refer to a base coupling factor set as the relationship between the throughput of L4S flow and non-L4S flow is unclear in order to perform L4S-based coexistence technology.

[0093] In the present disclosure, throughput may refer to a performance indicator that measures the speed of data transmitted through a flow in a communication system. In the present disclosure, throughput may refer to the amount of data successfully transmitted per unit time.

[0094] In the present disclosure, RTT (round trip time) may refer to the total time taken for a sender in a communication system to transmit data to a receiver and for a response regarding said data to be returned to the sender from the receiver. In one embodiment, RTT may refer to the sum of transmission delay, reception delay, transmission path delay, and processing delay.

[0095] In the present disclosure, a congestion control algorithm may refer to an algorithm designed to manage and mitigate congestion that may occur during data transmission in network communication. In one embodiment, the stability and efficiency of the network can be maintained by using a congestion control algorithm to monitor the status of the transmitting side and the network and adjusting the transmission speed.

[0096] In this disclosure, Active Queue Management (AQM) refers to a technology that controls queues of routers or switches to manage congestion and reduce latency in a network. This disclosure describes existing congestion control technologies as examples.

[0097] In the present disclosure, Quality of Experience (QoE) may refer to a concept that measures the overall satisfaction experienced by a user when using a service, application, or product. The QoE in the present disclosure may include QoE for L4S flows and non-L4S flows.

[0098] In the present disclosure, a RAN (Radio Access Network) may refer to a wireless access network and an entity responsible for data transmission between a terminal and a core network.

[0099] In the present disclosure, a PCF (Policy Control Function) may refer to an entity that performs network policy and quality of service management in a network.

[0100] In the present disclosure, SMF (Session Management Function) may refer to an entity responsible for session management in a network.

[0101] In the present disclosure, a User Plane Function (UPF) may refer to an entity that performs a core role in a data path for transmitting user data in a network.

[0102] The operating principle of the present disclosure will be explained in detail below with reference to the attached drawings.

[0103] Figure 1 is a diagram illustrating L4S-based coexistence technology.

[0104] Referring to Figure 1, this is a diagram illustrating the operation of a conventional ECN-based L4S. ECN (Explicit Congestion Notification) refers to a technology that notifies the congestion status in a network via a signal without packet loss.

[0105] L4S (Low latency, Low loss, Scalable throughput) technology refers to a traffic management mechanism that aims for ultra-low latency, low packet loss, and scalable throughput, and can quickly detect congestion by utilizing ECN. For ECN-based L4S operation, an agreement can be reached between an L4S-enabled transmitter (110) and an L4S-enabled receiver (130) that L4S operation is possible. For ECN-based L4S operation, multiple AQM (Active Queue Management) Nodes (120) may be included.

[0106] An L4S-enabled transmitter (110) can transmit a data packet to an AQM node (120) with ECT (1) set in the header. ECT (1) may mean an indicator indicating an ECN-enabled transport.

[0107] An AQM node (120) can set a CE (congestion experienced) flag with a probability of p based on the degree of congestion for a data packet received from an L4S-enabled transmitter (110). When congestion occurs, the AQM node (120) can indicate congestion using the ECN field of the IP header without dropping the corresponding data packet. In one embodiment, the AQM node (120) can detect the congestion state based on the length of the queue. If the length of the queue exceeds a threshold value, the AQM node (120) can transmit a congestion signal by setting a CE flag with a probability of p instead of dropping the packet.

[0108] When the L4S-enabled receiver (130) receives a packet with an ECN set from the AQM node (120), it identifies it and can send the ECN feedback to the L4S-enabled transmitter (110) by including the ECN feedback in the TCP ACK header.

[0109] The L4S-enabled transmitter (110) can calculate the CE ratio based on the received ECN feedback and adjust the transmission speed by applying a congestion control algorithm. The L4S-enabled transmitter (110) can adjust the transmission speed using a congestion control algorithm used in an L4S environment. For a specific AQM operation method, refer to FIG. 2 below.

[0110] Figure 2 is a diagram illustrating Active Queue Management (AQM), an example of L4S-based coexistence technology.

[0111] Referring to Figure 2, we examine the operation method of PI2 AQM, which performs congestion control based on the length of the queue or the occupancy rate of the queue to manage network congestion and reduce latency.

[0112] In PI2 AQM, the AQM node can identify whether a queue delay (210) has occurred based on the length of the queue. The AQM node can identify whether a queue delay (210) has occurred by periodically monitoring the length of the queue.

[0113] If a queue delay (210) occurs, the AQM node can calculate the ECN mark probability (220). The congestion signal (p) can be calculated using the waiting time delay (q) as shown in the following equation (1).

[0114] ... mathematical formula (1)

[0115] In mathematical formula (1) and is a constant for calculating congestion signals.

[0116] The AQM node can mark the packet header or drop the packet using the calculated ECN mark probability. A higher p indicates more congestion, which means a higher probability of marking or dropping.

[0117] The AQM node can mark the packet header with ECT (1) or ECT (0) based on the calculated ECN mark probability. The transmitter can recognize this as a congestion signal and adjust the transmission speed as the ECN field value is set. If the congestion situation becomes severe, the AQM node may drop some packets.

[0118] In one embodiment, the AQM node may mark L4S flows as ECT (1) or CE based on the ECN mark probability, and mark non-L4S flows as ECT (0) or drop.

[0119] In one embodiment, the AQM node can calculate a coupling factor for the throughput relationship between flows using the marking probability for L4S flows and the drop / mark probability for non-L4S flows. The AQM node can calculate the coupling factor using various congestion control algorithms. Examples of congestion control algorithms include, but are not limited to, TCP (Transmission Control Protocol) Reno, TCP Cubic, BBR (Bottleneck Bandwidth and RTT), DCTCP (Data Center TCP), and LEDBAT (Low Extra Delay Background Transport).

[0120] TCP Reno is an algorithm that detects congestion based on delayed or lost acknowledgments (Acks) and reduces the congestion window. TCP Cubic is an improved algorithm that adjusts the window non-linearly when congestion occurs, enabling operation even at high bandwidths. BBR is an algorithm that determines the optimal transmission speed by measuring RTT and bandwidth. DCTCP is an algorithm that detects congestion based on ECN and reduces the transmission window according to the congestion ratio. LEDBAT is an algorithm that determines congestion based on delay signals and adjusts the transmission speed.

[0121] For example, if the AQM node uses the DCTCP-cubic congestion control algorithm, the coupling factor can be calculated using the following mathematical formula (2).

[0122] ... mathematical formula (2)

[0123] Since AQM performs congestion control at intermediate nodes, it cannot utilize flow-specific status information and uses a fixed coupling factor. For example, it cannot reflect flow-specific status information such as RTT, throughput, traffic patterns, and bit rates. Due to the fixed use of coupling factors, there is a limitation in that it cannot reflect the current flow situation.

[0124] In the following, a method for performing L4S-based coexistence technology at a terminal to reflect status information by flow and a method for performing L4S-based coexistence technology at a base station using information received from an AF are disclosed.

[0125] FIG. 3 is a diagram illustrating an L4S-based coexistence technology in a terminal according to one embodiment of the present disclosure.

[0126] Referring to FIG. 3, the terminal (100) can operate to reduce the queue delay that occurs when L4S flows and non-L4S flows coexist, by performing an L4S-based coexistence technique and updating the coupling factor to maintain fair throughput between flows. Hereinafter, in the present disclosure, the terminal (100) may be used in combination with an electronic device.

[0127] In a service requiring low latency, among the propagation delay, interface delay, and queue delay occurring due to packet transmission, the present disclosure describes a method for reducing the queue delay that occurs as data accumulates in a buffer.

[0128] In the present disclosure, as L4S flows and non-L4S flows coexist on a single bearer, unfair resource allocation between flows may become a problem. Accordingly, the following describes a method for performing an L4S coexistence technique at a terminal by utilizing context information held by the terminal, such as flow-specific status information, to reduce queue delay when L4S flows and non-L4S flows coexist on a single bearer.

[0129] A terminal (100) may include a CP (control plane) that performs a control role in network communication, an AP (application plane) that performs a data processing role, a TCP (transmission control protocol) in the transport layer for transmission and reception, an IP (internet protocol) in the network layer, and a TCP socket which is an interface connecting the application layer and the transport layer. In one embodiment, the TCP socket, the TCP layer, and the IP layer may be included in the network modem of the AP. However, the terminal may include more components than the components shown in FIG. 3 and may be composed of fewer components.

[0130] In one embodiment of the present disclosure, the terminal (100) can identify whether a coexistence situation of L4S flows and non-L4S flows has occurred. For example, if L4S flows and non-L4S flows coexist within a single bearer as a separate dedicated bearer is not allocated for non-L4S flows or L4S flows, the terminal (100) can identify that a coexistence situation of L4S flows and non-L4S flows has occurred.

[0131] In one embodiment of the present disclosure, PI2 AQM may be applied to a terminal (100) for the coexistence of L4S flows and non-L4S flows. The CP of the terminal calculates whether a queue delay has occurred and calculates the queue delay, and the IP calculates an ECN mark probability based on the calculated queue delay to perform a mark or drop for L4S flows and non-L4S flows. L4S coexistence technology may be performed by appropriately adjusting the coupling factor using flow information within the terminal (100). However, FIG. 3 is merely an example, and operations for performing L4S coexistence technology may be performed in other components within the terminal.

[0132] In one embodiment, the CP can calculate the queue delay (305) by utilizing the RLC transmit queue length (bs) and the MAC L2 / L1 throughput (R). The CP (310) can calculate the queue delay (305) using the following mathematical formula (3).

[0133] ... mathematical formula (3)

[0134] The RLC transmit queue length refers to the total amount of data packets waiting to be transmitted at the RLC layer and can be calculated in bytes. MAC L2 / L1 throughput refers to the amount of data processed at the MAC (L2) and L1 layers. Accordingly, the queue delay represents the amount of data packets waiting to be transmitted at the RLC layer relative to the amount of data that can be processed at the MAC L2 / L1 layers.

[0135] In one embodiment, the CP can transmit the calculated queue delay value to the IP. The AP can perform base coupling factor settings (310) according to the application used by the terminal (100). In one embodiment, the AP can set the base coupling factor (310) when a new application is activated.

[0136] In one embodiment, the AP can set a base coupling factor (310) by considering the congestion control algorithm used by the application and application-specific priority information. In one embodiment, the AP can set the base coupling factor (310) based on historical information regarding the RTT ratio of L4S flow and non-L4S flow. For a specific method of setting the base coupling factor, refer to FIG. 5.

[0137] In one embodiment, the AP may transmit a base coupling factor to the IP. The IP may perform L4S-based coexistence techniques based on the transmitted base coupling factor. The IP may calculate a mark probability (325) based on the transmitted queue delay and perform L4S-based coexistence techniques (330). In one embodiment, the IP may perform CE marking on L4S flows, mark non-L4S flows, or perform packet dropping.

[0138] In one embodiment, the terminal (100) may determine whether to apply coexistence technology (315) based on the throughput for L4S flows and the throughput for non-L4S flows. The terminal (100) may determine to apply L4S-based coexistence technology (315) if the sum of the throughput for L4S flows and the throughput for non-L4S flows is greater than or equal to the available throughput of the terminal, and the ratio of the throughput for non-L4S flows to the throughput for all flows is greater than or equal to a preset threshold ratio.

[0139] In one embodiment, the AP can obtain information regarding the throughput for L4S flows and the throughput for non-L4S flows from each application. The AP can transmit the information regarding the throughput for L4S flows and the throughput for non-L4S flows to the IP. The IP can determine whether to apply coexistence technology based on the received information (315). For specific methods below, refer to FIG. 10 and FIG. 11.

[0140] In one embodiment, the terminal (100) can update the coupling factor (320) based on real-time information regarding the RTT ratio of L4S flows and non-L4S flows. Information regarding the RTT for L4S flows and RTT information regarding non-L4S flows can be obtained from a TCP socket. The terminal (100) can perform the coupling factor update (320) when the difference between the RTT for L4S flows and the RTT for non-L4S flows increases.

[0141] In one embodiment, the terminal (100) can update the coupling factor (320) when the RTT ratio of L4S flow and non-L4S flow is less than a preset first threshold value or exceeds a second threshold value.

[0142] In one embodiment, the IP can receive RTT information for an L4S flow and RTT information for a non-L4S flow from a TCP socket and update the coupling factor (320). For a detailed description below, refer to FIGS. 7 to 9.

[0143] The terminal (100) can perform L4S-based coexistence technology based on a base coupling factor or an updated coupling factor. The terminal (100) can calculate a mark probability p (325), which is the probability of marking a packet of an L4S flow. In one embodiment, the mark probability (325) can be calculated based on a queue delay (305) received from a CP at the IP layer. In one embodiment, the IP layer can calculate the mark probability by detecting congestion based on the queue delay of the CP. Refer to the description of FIGS. 1 and FIGS. 2 for the method of calculating the mark probability.

[0144] The terminal (100) can perform L4S-based coexistence technology (330) based on the calculated mark probability. In one embodiment, L4S-based coexistence technology (330) can be performed at the IP layer to perform marking or dropping.

[0145] In one embodiment, the terminal (100) may mark a CE (congestion experienced) mark on an L4S flow with a probability of p. The CE mark is intended to indicate that the packet has experienced congestion in the network and may be added to the header of the packet. In one embodiment, the terminal (100) may mark the packet header of the L4S flow with a CE mark or ECT (1) with a probability of p.

[0146] In one embodiment, for a non-L4S flow, the terminal (100) With the probability of, the packet may be dropped or the packet header may be marked. The terminal (100) may mark the packet header of a non-L4S flow with ECT(0) with the probability above. The terminal (100) may drop the packet of a non-L4S flow with the probability above.

[0147] The terminal (100) can continuously update the coupling factor by reflecting real-time RTT information of L4S flows and non-L4S flows. As the coupling factor is updated, the terminal (100) can adjust parameters for performing L4S-based coexistence technology. The terminal (100) can improve QoE by adjusting parameters for performing L4S-based coexistence technology based on real-time RTT information as well as flow-specific status information. For example, the terminal (100) can perform L4S-based coexistence technology by reflecting flow-specific status information such as throughput, traffic patterns, and bit rates.

[0148] FIG. 4 is a flowchart illustrating an L4S-based coexistence technology in a terminal according to one embodiment of the present disclosure.

[0149] Referring to Fig. 4, L4S-based coexistence technology can be performed at the terminal based on a coupling factor calculated using flow-specific status information. Below, a method for performing L4S-based coexistence technology for the uplink at the terminal according to the application's congestion control algorithm type, flow-specific throughput, and RTT value is described.

[0150] In step S410, the terminal (100) can identify whether a situation in which L4S flow and non-L4S flow coexist has occurred.

[0151] The terminal (100) can identify that a situation in which L4S flows and non-L4S flows coexist has occurred when the base station does not allocate a dedicated bearer for L4S flows. For example, as the base station does not allocate a dedicated bearer for L4S flows, L4S flows and non-L4S flows may coexist on a single bearer.

[0152] If the base station does not support L4S, the terminal (100) can identify that a situation in which L4S flow and non-L4S flow coexist has occurred. For example, if the base station does not support L4S, L4S flow and non-L4S flow may coexist in the default bearer.

[0153] The terminal (100) can perform an L4S-based coexistence technique to prevent resources from being unfairly allocated when L4S flows and non-L4S flows coexist in a single bearer and share a single queue. Below, the operation of the L4S-based coexistence technique is examined in detail.

[0154] In step S420, the terminal (100) may perform a base coupling factor setting for L4S-based coexistence technology. The coupling factor may refer to the relationship between the throughput of an L4S flow and the throughput of a non-L4S flow. The base coupling factor may refer to a basic coupling factor set as the throughput relationship between the two flow channels is not precisely known in order to perform L4S-based coexistence technology.

[0155] The terminal (100) can set a base coupling factor based on the type of congestion control algorithm of an application, application-specific priority information, and historical information regarding the RTT ratio of L4S flow and non-L4S flow to perform L4S-based coexistence technology. Application-specific priority information may refer to priority information for L4S flow and non-L4S flow.

[0156] In one embodiment, the terminal (100) can set a base coupling factor based on a congestion control algorithm. The terminal (100) can set a base coupling factor using a congestion control algorithm for each application. The terminal (100) can use a base coupling factor that has been pre-calculated according to a combination of congestion control algorithms. The terminal (100) can use a base coupling factor that has been pre-calculated when a congestion control algorithm used for L4S flows and non-L4S flows is set.

[0157] In one embodiment, if there is no historical information regarding the RTT ratio of L4S flow and non-L4S flow, the terminal (100) may set a base coupling factor by assuming that the two RTTs are the same. In one embodiment, if there is historical information regarding the RTT ratio of L4S flow and non-L4S flow, the terminal (100) may set a base coupling factor by reflecting this information. For example, if there is historical information that the RTT ratio is 2, the terminal (100) may set a base coupling factor by multiplying the coupling factor calculated through a congestion control algorithm by 2. For a detailed explanation below, refer to FIG. 5.

[0158] In one embodiment, the terminal (100) may set a base coupling factor based on the priority of the flow or the priority of the application. As the terminal-specific L4S application has a higher priority than the non-L4S application, the terminal (100) may set the throughput of the L4S flow to be greater than the throughput of the non-L4S flow. The terminal (100) may set a base coupling factor by reflecting the throughput per flow. For a detailed description below, refer to FIG. 5.

[0159] In step S430, the terminal (100) may determine whether to perform L4S-based coexistence technology based on the throughput for L4S flows and the throughput for non-L4S flows. The terminal (100) may determine whether to perform L4S-based coexistence technology using the throughput for each flow and the terminal available throughput.

[0160] A terminal (100) may decide to perform L4S-based coexistence technology when the sum of the throughput for L4S flows and the throughput for non-L4S flows is greater than or equal to the available throughput of the terminal, and the throughput for non-L4S flows relative to the throughput for all flows is greater than or equal to a preset threshold ratio.

[0161] In one embodiment, the terminal (100) may not perform L4S-based coexistence technology if the sum of the throughput for L4S flows and the throughput for non-L4S flows is less than the available throughput of the terminal. For example, if the bandwidth used by the coexisting flows is smaller than the available bandwidth of the terminal, a queue delay may not occur. If a queue delay does not occur, the terminal (100) may not perform L4S-based coexistence technology because congestion resulting from the coexistence of L4S flows and non-L4S flows does not occur.

[0162] In one embodiment, the terminal (100) may not perform L4S-based coexistence technology when the ratio of the throughput of a non-L4S flow to the throughput of the total flow is smaller than a preset threshold ratio. For example, if the resources used by the non-L4S flow are sufficiently small, it is advantageous not to drop the packets, so the terminal may not perform L4S-based coexistence technology. In one embodiment, the terminal (100) may not perform drop and marking on the packets of the non-L4S flow when the resources used by the non-L4S flow are sufficiently small.

[0163] For specific operations below, refer to FIGS. 10 and FIGS. 11.

[0164] In step S440, the terminal (100) can obtain a coupling factor that reflects real-time information regarding the RTT ratio of L4S flow and non-L4S flow based on the determination result and the base coupling factor. The RTT information is a factor that can change over time as the sum of various delays, such as transmission delay, reception delay, transmission path delay, and processing delay.

[0165] In one embodiment, the terminal (100) can obtain real-time information regarding the RTT ratio of L4S flows and non-L4S flows based on a preset period or threshold value. Refer to FIGS. 7 and FIGS. 8 below for a method of obtaining real-time information regarding the RTT ratio.

[0166] In one embodiment, the terminal (100) can obtain a coupling factor by considering the application's confusion control algorithm type, flow-specific priority information, and real-time RTT information.

[0167] For example, if applications use DCTCP and Cubic confusion control algorithms, respectively, the default coupling factor is It has a value of . In this case, if there is no history information or priority information for RTT, the base coupling factor becomes 1.19. The terminal (100) based on real-time RTT information If the value is 0.8, the coupling factor value It can be obtained as.

[0168] For example, if an application uses the BBRv2 and Cubic confusion control algorithms, respectively, the default coupling factor is It has a value of . In this case, if n times higher throughput is guaranteed for L4S applications, the base coupling factor is It has a value. The terminal (100) is based on real-time RTT information. If the value is 1.1, the coupling factor value It can be obtained as.

[0169] In step S450, the terminal (100) can perform L4S-based coexistence technology based on the acquired coupling factor. The terminal (100) can perform L4S-based coexistence technology based on the acquired coupling factor by deciding to perform L4S-based coexistence technology.

[0170] If the terminal (100) decides to perform L4S-based coexistence technology in step S430, it can perform L4S-based coexistence technology based on the coupling factor obtained in step S440.

[0171] In one embodiment, the terminal (100) can calculate a mark probability p to perform L4S-based coexistence technology. In one embodiment, the terminal (100) can calculate the mark probability by detecting congestion based on queue delay. The terminal (100) can perform a CE (congestion experienced) mark on an L4S flow with a probability of p. In one embodiment, the terminal (100) can mark the packet header of an L4S flow with a CE mark or ECT (1) with a probability of p.

[0172] The terminal (100) uses a coupling factor for non-L4S flow With the probability of, a packet may be dropped or marked. The terminal (100) may mark the header of a non-L4S flow with ECT(0) with the probability above. The terminal (100) may drop a packet of a non-L4S flow with the probability above.

[0173] In one embodiment, the terminal (100) can update the coupling factor based on real-time information per flow. The terminal (100) can perform the above L4S-based coexistence technology using the updated coupling factor. Hereinafter, the method of updating the coupling factor and performing the L4S-based coexistence technology accordingly refers to FIGS. 7 to 9.

[0174] FIG. 5 is a diagram illustrating a method for setting a base coupling factor for an L4S-based coexistence technology according to one embodiment of the present disclosure.

[0175] Referring to FIG. 5, the terminal (100) may use the RTT ratio values ​​of L4S flow and non-L4S flow and a congestion control algorithm for the application or flow to set the base coupling factor.

[0176] In step S510, the terminal (100) can identify whether there is historical information regarding the RTT ratio of L4S flows and non-L4S flows.

[0177] In one embodiment, the terminal (100) can identify whether there is historical information regarding the RTT ratio of L4S flows and non-L4S flows based on the usage history information of past applications, etc.

[0178] If historical information regarding the RTT ratio of L4S flows and non-L4S flows exists, in step S520, the terminal (100) can perform base coupling factor settings based on the congestion control algorithm and the historical information regarding the RTT ratio.

[0179] In one embodiment, the terminal (100) can set a base coupling factor based on a congestion control algorithm. The terminal (100) can set a base coupling factor using a congestion control algorithm for each application. The terminal (100) can use a base coupling factor that has been pre-calculated according to a combination of congestion control algorithms. The terminal (100) can use a base coupling factor that has been pre-calculated when a congestion control algorithm used for L4S flows and non-L4S flows is set.

[0180] In one embodiment, the terminal (100) can set a base coupling factor based on historical information regarding the RTT ratio of L4S flow and non-L4S flow. For example, if there is historical information that the RTT ratio is 2, the terminal (100) can set a base coupling factor by multiplying the coupling factor calculated through a congestion control algorithm by 2.

[0181] When applications use DCTCP and Cubic confusion control algorithms, respectively, the default coupling factor is It has a value. The terminal (100) based on historical information regarding the RTT rate When the value obtained is, the terminal (100) has a base coupling factor It can be set to.

[0182] If there is no historical information regarding the RTT ratios of L4S flows and non-L4S flows, in step S530, the terminal (100) can perform base coupling factor settings based on a congestion control algorithm and a default RTT ratio.

[0183] When applications use BBRv2 and Cubic confusion control algorithms, respectively, the default coupling factor is It has a value. If the terminal (100) does not have history information regarding the RTT rate, The default RTT rate of can be used. The terminal (100) has a base coupling factor It can be set to.

[0184] In one embodiment, the terminal (100) can set a base coupling factor using priority information regarding a flow. As a new application is added, the base coupling factor can be set based on priority information of the application or the corresponding flow.

[0185] The terminal (100) can guarantee throughput n times higher than non-L4S applications for terminal-specific L4S applications. For example, for terminal-specific XR services, it can provide throughput 1.5 times higher than general services.

[0186] When applications use DCTCP and Cubic confusion control algorithms, respectively, the default coupling factor is It has a value. The terminal (100) based on historical information regarding the RTT rate When obtaining a value and guaranteeing n times higher throughput to the L4S application, the terminal (100) has a base coupling factor It can be set to.

[0187] The terminal (100) can perform L4S-based coexistence technology based on the base coupling factor set as above.

[0188] FIG. 6 is a diagram illustrating the reason why real-time information regarding the RTT ratio according to one embodiment of the present disclosure should be considered.

[0189] Referring to FIG. 6, throughput graphs for L4S flow and non-L4S flow are shown for cases where RTT information is not reflected (610) and cases where it is reflected (620). RTT is a factor that can change over time as the sum of various delays such as transmission delay, reception delay, transmission path delay, and processing delay.

[0190] In the case of the existing AQM, coexistence technology was performed at intermediate nodes, but it failed to detect real-time RTT information for each flow and executed the technology by assuming that the RTT values ​​were identical. Consequently, as the coupling factor was fixed and marking and packet dropping were performed, a problem arose where the transmission rate control for each flow failed to reflect real-time information.

[0191] Looking at the throughput graph (610) that does not reflect RTT information, it can be seen that there is a large gap in throughput between L4S flows and non-L4S flows. This is because processing is performed by assuming that the RTT for L4S flows and non-L4S flows are the same, without reflecting RTT information that changes over time, which causes a problem with throughput fairness. This problem can affect the terminal QoE for specific applications.

[0192] Looking at the throughput graph (610) reflecting RTT information, it can be seen that the gap in throughput between L4S flows and non-L4S flows is kept relatively small. This means that by reflecting real-time RTT information, the coupling factor is appropriately updated to perform marking or dropping for L4S flows and non-L4S flows, and the transmission speed is properly controlled.

[0193] Since the terminal can check RTT information in real time, it can perform L4S-based coexistence technology by updating the coupling factor when there is a significant change in the RTT between L4S flows and non-L4S flows at regular intervals. By reflecting real-time RTT changes, the terminal can adjust the transmission speeds of L4S flows and non-L4S flows to control the difference in throughput between the two flows. The specific method for updating the coupling factor is described below.

[0194] FIG. 7 is a diagram illustrating a method for considering real-time information regarding the RTT ratio according to one embodiment of the present disclosure.

[0195] Referring to FIG. 7, the terminal (100) can update the coupling factor using real-time information regarding the RTT of L4S flow and non-L4S flow, and perform L4S-based coexistence technology based thereon.

[0196] A TCP socket can obtain information regarding the RTT of an L4S flow and the RTT of a non-L4S flow. The TCP socket can transmit information regarding the RTT to the IP layer (710) according to a certain standard. For example, at a preset period, the TCP socket can transmit information regarding the RTT of an L4S flow and information regarding the RTT of a non-L4S flow to the IP layer (710). If the RTT value of an L4S flow or the RTT value of a non-L4S flow exceeds a preset threshold, the TCP socket can transmit information regarding the RTT of an L4S flow and information regarding the RTT of a non-L4S flow to the IP layer (710).

[0197] The IP layer can perform a coupling factor update (720) based on information (710) regarding the RTT received from the TCP socket. In one embodiment, the IP layer has a ratio between the RTT of the L4S flow and the RTT of the non-L4S flow, You can determine whether to perform a coupling factor update (720) by comparing it with a pre-set threshold value.

[0198] for example, If the RTT value of the non-L4S flow is smaller than the RTT value of the L4S flow compared to the RTT value of the L4S flow, the terminal (100) can perform a coupling factor update (720). If the RTT value of the non-L4S flow is larger than the RTT value of the L4S flow, which may cause a problem with throughput fairness, the terminal (100) can perform a coupling factor update (720).

[0199] For example, if applications use DCTCP and Cubic confusion control algorithms, respectively, the default coupling factor is The terminal (100) has a value of . If the value is 0.7, which is less than the first threshold value, the coupling factor value It can be updated to.

[0200] For example, if an application uses the BBRv2 and Cubic confusion control algorithms, respectively, the default coupling factor is The terminal (100) has a value of . If the value exceeds the second threshold value of 1.3, the coupling factor value It can be updated to.

[0201] The IP layer can calculate the mark probability (730) for performing L4S-based coexistence technology. In one embodiment, the IP layer can calculate the mark probability by detecting congestion based on queue delay. Refer to the description of FIGS. 1 and FIGS. 2 for the method of calculating the mark probability.

[0202] The IP layer can perform L4S-based coexistence operations (740) based on the calculated mark probability and the updated coupling factor. The IP layer can perform a CE (congestion experienced) mark on an L4S flow with a probability of p. In one embodiment, the IP layer can mark the packet header of an L4S flow with a CE mark or ECT (1) with a probability of p.

[0203] In one embodiment, for non-L4S flows, the IP layer Packets can be dropped or marked with the probability of the above. The IP layer can mark the header of a non-L4S flow with ECT(0) with the above probability. The IP layer can drop packets of a non-L4S flow with the above probability.

[0204] The terminal (100) can appropriately adjust the transmission speed through the L4S flow and non-L4S flow by updating the coupling factor by reflecting real-time RTT information of the L4S flow and non-L4S flow. The terminal (100) can maintain a balance of throughput between the L4S flow and non-L4S flow by adjusting the transmission speed.

[0205] FIG. 8 is a flowchart illustrating a method for considering real-time information regarding the RTT ratio according to one embodiment of the present disclosure.

[0206] Referring to FIG. 8, the terminal (100) can update the coupling factor for performing L4S-based coexistence technology based on real-time information per flow. The terminal (100) can improve the QoE for L4S flow and non-L4S flow by reflecting real-time information per flow.

[0207] In step S810, the terminal (100) can obtain real-time information regarding the RTT ratio of L4S flows and non-L4S flows. The terminal (100) can obtain real-time information regarding the RTT ratio of L4S flows and non-L4S flows based on a preset period or a preset threshold value.

[0208] The TCP socket of the terminal (100) can obtain real-time RTT information for L4S flows and non-L4S flows. The TCP socket can transmit information regarding RTT to the IP layer according to a certain standard.

[0209] For example, at preset intervals, a TCP socket can transmit information regarding the RTT of the L4S and the RTT of the non-L4S to the IP layer. If the RTT value of the L4S or the RTT value of the non-L4S exceeds a preset threshold, the TCP socket can transmit information regarding the RTT of the L4S and the RTT of the non-L4S to the IP layer.

[0210] In step S820, the terminal (100) can perform a coupling factor update for L4S-based coexistence technology based on real-time information regarding the RTT rate. The terminal (100) can perform a coupling factor update by comparing real-time information regarding the RTT rate with a preset threshold value.

[0211] The terminal (100) is the ratio between the RTT of the L4S flow and the RTT of the non-L4S flow, A coupling factor update can be performed by comparing , with a preset threshold value. In one embodiment, the terminal If it is less than the first threshold value set or exceeds the second threshold value, a coupling factor update can be performed.

[0212] for example, If the value is less than the first threshold value set (e.g., 0.8), the RTT value of the non-L4S flow is smaller than the RTT value of the L4S flow, which may cause a problem with throughput fairness, so the terminal (100) can perform a coupling factor update. If the RTT value of the non-L4S flow is larger than the RTT value of the L4S flow, the terminal (100) can perform a coupling factor update.

[0213] The terminal (100) can update the coupling factor value by considering the application's confusion control algorithm type, flow-specific priority information, and real-time RTT information.

[0214] For example, if applications use DCTCP and Cubic confusion control algorithms, respectively, the default coupling factor is The terminal (100) has a value of . If the value is 0.7, which is less than the first threshold value, the coupling factor value It can be updated to.

[0215] For example, if an application uses the BBRv2 and Cubic confusion control algorithms, respectively, the default coupling factor is The terminal (100) has a value of . If the value exceeds the second threshold value of 1.3, the coupling factor value It can be updated to.

[0216] In step S830, the terminal (100) can perform L4S-based coexistence technology based on a coupling factor. The terminal (100) can maintain throughput processes between L4S flows and non-L4S flows by performing L4S-based coexistence technology reflecting the updated coupling factor.

[0217] The terminal (100) can perform a CE (congestion experienced) mark on an L4S flow with a probability of p. In one embodiment, the terminal (100) can mark the packet header of an L4S flow with a CE mark or ECT (1) with a probability of p.

[0218] The terminal (100) uses an updated coupling factor for non-L4S flow. With the probability of, a packet may be dropped or marked. The terminal (100) may mark the header of a non-L4S flow with ECT(0) with the probability above. The terminal (100) may drop a packet of a non-L4S flow with the probability above.

[0219] The terminal (100) can appropriately adjust the transmission speed through the L4S flow and non-L4S flow by updating the coupling factor by reflecting real-time RTT information of the L4S flow and non-L4S flow. The terminal (100) can maintain a balance of throughput between the L4S flow and non-L4S flow by adjusting the transmission speed.

[0220] FIG. 9 is a flowchart specifically illustrating a method for considering real-time information regarding the RTT ratio according to one embodiment of the present disclosure.

[0221] Referring to FIG. 9, the terminal (100) can update the coupling factor for performing L4S-based coexistence technology based on real-time information per flow. For the sake of brevity in the specification, content overlapping with FIG. 4 and FIG. 8 is omitted.

[0222] In step S910, the terminal (100) can identify whether a coexistence situation has occurred between the L4S flow and the non-L4S flow.

[0223] If the base station has not allocated a dedicated bearer for the L4S flow, the terminal (100) can identify that a situation in which L4S flow and non-L4S flow coexist has occurred. If the base station does not support L4S, the terminal (100) can identify that a situation in which L4S flow and non-L4S flow coexist has occurred.

[0224] The terminal (100) can perform L4S-based coexistence technology to prevent resources from being unfairly allocated when L4S flows and non-L4S flows coexist in a single bearer and share a single queue.

[0225] In step S920, the terminal (100) can set a flow congestion control algorithm and a throughput priority-based base coupling factor.

[0226] The terminal (100) can set a base coupling factor based on the type of congestion control algorithm of an application, application-specific priority information, and historical information regarding the RTT ratio of L4S flow and non-L4S flow to perform L4S-based coexistence technology. Application-specific priority information may refer to priority information for L4S flow and non-L4S flow.

[0227] In one embodiment, if there is no historical information regarding the RTT ratio of L4S flow and non-L4S flow, the terminal (100) may set a base coupling factor by assuming that the two RTTs are the same. In one embodiment, if there is historical information regarding the RTT ratio of L4S flow and non-L4S flow, the terminal (100) may set a base coupling factor by reflecting this information.

[0228] In one embodiment, the terminal (100) may set a base coupling factor based on the priority of the flow or the priority of the application. As the terminal-specific L4S application has a higher priority than the non-L4S application, the terminal (100) may set the throughput of the L4S flow to be greater than the throughput of the non-L4S flow.

[0229] In step S930, the terminal (100) can perform L4S flow and non-L4S flow coexistence technology operations. If the terminal (100) decides to perform L4S-based coexistence technology, it can perform L4S-based coexistence technology based on a base coupling factor.

[0230] In one embodiment, the terminal (100) can calculate a mark probability p to perform L4S-based coexistence technology. In one embodiment, the terminal (100) can calculate the mark probability by detecting congestion based on queue delay. The terminal (100) can perform a CE (congestion experienced) mark on an L4S flow with a probability of p. In one embodiment, the terminal (100) can mark the packet header of an L4S flow with a CE mark or ECT (1) with a probability of p.

[0231] The terminal (100) uses a base coupling factor for non-L4S flow With the probability of, a packet may be dropped or marked. The terminal (100) may mark the header of a non-L4S flow with ECT(0) with the probability above. The terminal (100) may drop a packet of a non-L4S flow with the probability above.

[0232] In step S940, the terminal (100) can monitor filtered RTT information per TCP socket. The TCP socket of the terminal (100) can obtain real-time RTT information for L4S flows and non-L4S flows. The TCP socket can transmit information regarding RTT to the IP layer according to certain criteria.

[0233] For example, at preset intervals, a TCP socket can transmit information regarding the RTT of the L4S and the RTT of the non-L4S to the IP layer. If the RTT value of the L4S or the RTT value of the non-L4S exceeds a preset threshold, the TCP socket can transmit information regarding the RTT of the L4S and the RTT of the non-L4S to the IP layer.

[0234] In step S950, the terminal (100) can compare the RTT ratio of L4S flow and non-L4S flow with a preset threshold value.

[0235] The terminal (100) is the ratio between the RTT of the L4S flow and the RTT of the non-L4S flow, A coupling factor update can be performed by comparing , with a preset threshold value. In one embodiment, the terminal If it is less than the first threshold value set or exceeds the second threshold value, a coupling factor update can be performed.

[0236] If the comparison result shows that there is a large difference between the RTT of the L4S flow and the RTT of the non-L4S flow, the terminal (100) can perform an RTT-based coupling factor update in step S960.

[0237] The terminal (100) can update the coupling factor value by considering the application's confusion control algorithm type, flow-specific priority information, and real-time RTT information.

[0238] For example, if applications use DCTCP and Cubic confusion control algorithms, respectively, the default coupling factor is The terminal (100) has a value of . If the value is 0.7, which is less than the first threshold value, the coupling factor value It can be updated to.

[0239] For example, if an application uses the BBRv2 and Cubic confusion control algorithms, respectively, the default coupling factor is The terminal (100) has a value of . If the value exceeds the second threshold value of 1.3, the coupling factor value It can be updated to.

[0240] The terminal (100) can recalculate the marking probability for L4S flows, and the marking or drop probability for non-L4S flows, based on the updated coupling factor. The terminal (100) can perform L4S-based coexistence technology based on the recalculated probabilities.

[0241] If, as a result of the comparison, there is no significant difference between the RTT of the L4S flow and the RTT of the non-L4S flow, the terminal (100) can return to step S940 and monitor the filtered RTT information per TCP socket.

[0242] FIG. 10 is a diagram illustrating a method for determining whether to perform coexistence technology based on flow throughput according to one embodiment of the present disclosure.

[0243] Referring to FIG. 10, the terminal (100) can determine whether to perform L4S-based coexistence technology by using information regarding the throughput of L4S flows and the throughput of non-L4S flows.

[0244] Applications can obtain throughput information for flows corresponding to each application. L4S-based applications can obtain information regarding throughput for L4S flows, and non-L4S-based applications can obtain information regarding throughput for non-L4S flows.

[0245] Applications can transmit information regarding the throughput of a flow to the IP layer (1010) according to a set standard. For example, at a set period, the application can transmit information regarding the throughput of an L4S flow and information regarding the throughput of a non-L4S flow to the IP layer (1010). If the throughput of an L4S flow or the throughput of a non-L4S flow exceeds a set threshold, the application can transmit information regarding the throughput of an L4S flow and information regarding the throughput of a non-L4S flow to the IP layer (1010).

[0246] The IP layer can determine whether to perform coexistence technology (1020) based on information (1010) regarding throughput received from the application. In one embodiment, the IP layer may determine to perform L4S-based coexistence technology if the sum of the throughput for L4S flows and the throughput for non-L4S flows is greater than or equal to the available throughput of the terminal, and the ratio of the throughput for non-L4S flows to the throughput for all flows is greater than or equal to a preset threshold ratio.

[0247] In one embodiment, the IP layer may not perform L4S-based coexistence technology if the sum of the throughput for L4S flows and the throughput for non-L4S flows is less than the available throughput of the terminal. For example, if the bandwidth used by coexisting flows is smaller than the bandwidth available to the terminal, queue delay may not occur. Since no queue delay occurs, the IP layer may not perform L4S-based coexistence technology because congestion resulting from the coexistence of L4S flows and non-L4S flows does not occur.

[0248] In one embodiment, the IP layer may not perform L4S-based coexistence techniques if the ratio of the throughput of non-L4S flows to the throughput of total flows is smaller than a preset threshold ratio. For example, if the resources used by non-L4S flows are sufficiently small, it is advantageous not to drop the corresponding packets, so the IP layer may not perform L4S-based coexistence techniques. In one embodiment, if the resources used by non-L4S flows are sufficiently small, the IP layer may not perform both dropping and marking for the packets of non-L4S flows.

[0249] The IP layer can calculate the mark probability (1030) for performing L4S-based coexistence technology. In one embodiment, the IP layer can calculate the mark probability by detecting congestion based on queue delay. Refer to the description of FIGS. 1 and FIGS. 2 for the method of calculating the mark probability.

[0250] The IP layer can perform L4S-based coexistence operations (1040) based on the base coupling factor or the updated coupling factor. The IP layer can perform a CE (congestion experienced) mark on the L4S flow with a probability of p. In one embodiment, the IP layer can mark the packet header of the L4S flow with a CE mark or ECT (1) with a probability of p.

[0251] In one embodiment, for non-L4S flows, the IP layer Packets can be dropped or marked with the probability of the above. The IP layer can mark the header of a non-L4S flow with ECT(0) with the above probability. The IP layer can drop packets of a non-L4S flow with the above probability.

[0252] The terminal (100) can determine whether it is necessary to perform L4S coexistence technology based on the flow throughput. Since performing L4S coexistence technology to drop packets of non-L4S flows or to control the transmission speed of flows when the terminal's available throughput is sufficient may result in packet loss or a reduction in transmission speed, it is necessary to perform L4S coexistence technology by considering the flow throughput.

[0253] FIG. 11 is a flowchart illustrating a method for determining whether to perform coexistence technology based on flow throughput according to one embodiment of the present disclosure.

[0254] Referring to FIG. 11, the terminal (100) can determine whether to perform coexistence technology based on flow throughput. The terminal (100) can compare the total flow throughput with the available throughput of the terminal and determine whether to perform coexistence technology based on the throughput of non-L4S flows among the total flow throughput. Hereinafter, for the sake of brevity in the specification, content overlapping with FIG. 4, FIG. 9 and FIG. 10 is omitted.

[0255] In step S1110, the terminal (100) can identify whether a coexistence situation between L4S flow and non-L4S flow has occurred.

[0256] If the base station has not allocated a dedicated bearer for the L4S flow, the terminal (100) can identify that a situation in which L4S flow and non-L4S flow coexist has occurred. If the base station does not support L4S, the terminal (100) can identify that a situation in which L4S flow and non-L4S flow coexist has occurred.

[0257] The terminal (100) can perform L4S-based coexistence technology to prevent resources from being unfairly allocated when L4S flows and non-L4S flows coexist in a single bearer and share a single queue.

[0258] In step S1120, the terminal (100) can set the base coupling factor based on the flow congestion control algorithm and throughput priority.

[0259] The terminal (100) can set a base coupling factor based on the type of congestion control algorithm of an application, application-specific priority information, and historical information regarding the RTT ratio of L4S flow and non-L4S flow to perform L4S-based coexistence technology. Application-specific priority information may refer to priority information for L4S flow and non-L4S flow.

[0260] In one embodiment, if there is no historical information regarding the RTT ratio of L4S flow and non-L4S flow, the terminal (100) may set a base coupling factor by assuming that the two RTTs are the same. In one embodiment, if there is historical information regarding the RTT ratio of L4S flow and non-L4S flow, the terminal (100) may set a base coupling factor by reflecting this information.

[0261] In one embodiment, the terminal (100) may set a base coupling factor based on the priority of the flow or the priority of the application. As the terminal-specific L4S application has a higher priority than the non-L4S application, the terminal (100) may set the throughput of the L4S flow to be greater than the throughput of the non-L4S flow.

[0262] In step S1130, the terminal (100) can monitor the throughput per flow. The terminal (100) can monitor the throughput of L4S flows and the throughput of non-L4S flows.

[0263] Applications within the terminal (100) can transmit information regarding the throughput of a flow to the IP layer according to a certain standard. For example, at a preset period, the application can transmit information regarding the throughput of an L4S flow and information regarding the throughput of a non-L4S flow to the IP layer. If the throughput of an L4S flow or the throughput of a non-L4S flow exceeds a preset threshold, the application can transmit information regarding the throughput of an L4S flow and information regarding the throughput of a non-L4S flow to the IP layer.

[0264] In step S1140, the terminal (100) compares the total flow throughput with the terminal available throughput and can determine whether to perform coexistence technology based on the ratio of throughput for non-L4S flows to the total flow throughput.

[0265] The terminal (100) can determine whether to perform coexistence technology based on information regarding throughput per flow. In one embodiment, the terminal (100) can determine to perform L4S-based coexistence technology if the sum of the throughput for L4S flows and the throughput for non-L4S flows is greater than or equal to the available throughput of the terminal, and the ratio of the throughput for non-L4S flows to the throughput for all flows is greater than or equal to a preset threshold ratio.

[0266] In one embodiment, the terminal (100) may not perform L4S-based coexistence technology if the sum of the throughput for L4S flows and the throughput for non-L4S flows is less than the available throughput of the terminal. For example, if the bandwidth used by the coexisting flows is smaller than the available bandwidth of the terminal, a queue delay may not occur. If a queue delay does not occur, the terminal (100) may not perform L4S-based coexistence technology because congestion due to the coexistence of L4S flows and non-L4S flows does not occur.

[0267] In one embodiment, the terminal (100) may not perform L4S-based coexistence technology when the ratio of the throughput of a non-L4S flow to the throughput of the total flow is smaller than a preset threshold ratio. For example, if the resources used by the non-L4S flow are sufficiently small, it is advantageous not to drop the packets, so the terminal may not perform L4S-based coexistence technology. In one embodiment, if the resources used by the non-L4S flow are sufficiently small, the terminal (100) may not perform both dropping and marking on the packets of the non-L4S flow.

[0268] If the terminal (100) decides to perform a coexistence technique according to step S1140, the terminal (100) can perform a coexistence technique operation in step S1150.

[0269] In one embodiment, the terminal (100) can calculate a mark probability p to perform L4S-based coexistence technology. In one embodiment, the terminal (100) can calculate the mark probability by detecting congestion based on queue delay. The terminal (100) can perform a CE (congestion experienced) mark on an L4S flow with a probability of p. In one embodiment, the terminal (100) can mark the packet header of an L4S flow with a CE mark or ECT (1) with a probability of p.

[0270] The terminal (100) uses a base coupling factor for non-L4S flow With the probability of, a packet may be dropped or marked. The terminal (100) may mark the header of a non-L4S flow with ECT(0) with the probability above. The terminal (100) may drop a packet of a non-L4S flow with the probability above.

[0271] If the terminal (100) decides not to perform the coexistence technique according to step S1140, the terminal (100) may not perform the coexistence technique operation in step S1160. The terminal (100) that does not perform the coexistence technique may return to step S1130 to monitor the throughput per flow.

[0272] In step S1170, the terminal (100) can monitor filtered RTT information per TCP socket. The TCP socket of the terminal (100) can obtain real-time RTT information for L4S flows and non-L4S flows. The TCP socket can transmit information regarding RTT to the IP layer according to certain criteria.

[0273] For example, at preset intervals, a TCP socket can transmit information regarding the RTT of the L4S and the RTT of the non-L4S to the IP layer. If the RTT value of the L4S or the RTT value of the non-L4S exceeds a preset threshold, the TCP socket can transmit information regarding the RTT of the L4S and the RTT of the non-L4S to the IP layer.

[0274] In step S1180, the terminal (100) can compare the RTT ratio of L4S flow and non-L4S flow with a preset threshold value.

[0275] The terminal (100) is the ratio between the RTT of the L4S flow and the RTT of the non-L4S flow, A coupling factor update can be performed by comparing , with a preset threshold value. In one embodiment, the terminal If it is less than the first threshold value set or exceeds the second threshold value, a coupling factor update can be performed.

[0276] If, as a result of comparison, a large difference occurs between the RTT of the L4S flow and the RTT of the non-L4S flow, the terminal (100) can perform an RTT-based coupling factor update in step S1190. The terminal (100) can update the coupling factor value by considering the application's confusion control algorithm type, flow-specific priority information, and real-time RTT information.

[0277] If, as a result of the comparison, there is no significant difference between the RTT of the L4S flow and the RTT of the non-L4S flow, the terminal (100) can return to step S1130 to monitor the throughput per flow.

[0278] FIG. 12 is a flowchart illustrating an L4S-based coexistence technology in a base station according to one embodiment of the present disclosure.

[0279] Referring to FIG. 12, a method for performing L4S-based coexistence technology at a base station is disclosed when a base station (200) supports L4S and an L4S flow and a non-L4S flow coexist in a single bearer.

[0280] As the base station (200) supports L4S, the base station (200) can perform L4S-based coexistence technology. It can operate by supporting L4S in the RAN or UPF, and FIG. 12 describes both cases. Since the base station (200) cannot acquire flow-specific status information on its own, it can perform L4S-based coexistence technology based on information received from the AF (Application Function). Below, a method for performing L4S-based coexistence technology for uplink / downlink at the base station according to the type of application congestion control algorithm and the flow-specific throughput and RTT values ​​is described.

[0281] In step S1210, the base station (200) can identify whether a situation of coexistence of L4S flow and non-L4S flow has occurred.

[0282] If the base station (200) supports L4S but does not allocate a dedicated bearer for L4S flows, it can be identified that a situation in which L4S flows and non-L4S flows coexist has occurred. For example, as the base station (200) does not allocate a dedicated bearer for L4S flows, L4S flows and non-L4S flows may coexist on a single bearer.

[0283] The base station (200) can perform L4S-based coexistence technology to prevent resources from being unfairly allocated when L4S flows and non-L4S flows coexist in a single bearer and share a single queue.

[0284] In step S1220, the base station (200) can receive information from AF regarding the type of congestion control algorithm for performing L4S-based coexistence technology.

[0285] The base station (200) can receive information regarding the application-specific congestion control algorithm type from the AF. In one embodiment, the AF may transmit information regarding the congestion control algorithm type in a request message that includes an ECN marking. The AF may transmit information regarding the congestion control algorithm types supported in the uplink and downlink, respectively.

[0286] In one embodiment, the base station (200) may receive information from the terminal regarding the type of congestion control algorithm supported by the terminal's uplink. The base station (100) may receive information regarding the type of congestion control algorithm supported by the terminal via a NAS message.

[0287] For specific message types below, refer to FIGS. 13 to 18.

[0288] In step S1230, the base station (200) may set a base coupling factor based on information regarding the type of congestion control algorithm. The base coupling factor may be set in the PCF, SMF, RAN, or UPF, and specific methods are described below with reference to FIGS. 13 to 18. The coupling factor may refer to the relationship between the throughput of an L4S flow and the throughput of a non-L4S flow. The base coupling factor may refer to a basic coupling factor set when the throughput relationship between the two flow channels is not precisely known in order to perform L4S-based coexistence technology.

[0289] In one embodiment, the base station (200) can set a base coupling factor based on a congestion control algorithm. The base station (200) can set a base coupling factor using a congestion control algorithm for each application. The base station (200) can use a base coupling factor that has been pre-calculated according to a combination of congestion control algorithms. The base station (200) can use a base coupling factor that has been pre-calculated when a congestion control algorithm used for L4S flows and non-L4S flows is set.

[0290] In one embodiment, if there is no historical information regarding the RTT ratio of L4S flow and non-L4S flow, the base station (200) may set a base coupling factor by assuming that the two RTTs are the same. In one embodiment, if there is historical information regarding the RTT ratio of L4S flow and non-L4S flow, the base station (200) may set a base coupling factor by reflecting this information.

[0291] In one embodiment, the base station (200) may set a base coupling factor based on the priority of the flow or the priority of the application. As terminal-specific L4S applications have a higher priority than non-L4S applications, the base station (200) may set the throughput of L4S flows to be greater than the throughput of non-L4S flows. The base station (200) may set a base coupling factor by reflecting the throughput per flow.

[0292] In one embodiment, the base station (200) may set the base coupling factor for the uplink and downlink separately. The base station (200) may set the base coupling factor separately depending on the type of congestion control algorithm, historical information regarding RTT, and priority information per flow for the uplink and downlink.

[0293] In step S1240, the base station (200) can perform L4S-based coexistence technology based on the base coupling factor.

[0294] The base station (200) determines whether to perform L4S-based coexistence technology based on throughput regarding L4S flow and throughput regarding non-L4S flow, and can perform L4S-based coexistence technology based on the determination result and base coupling factor.

[0295] The base station (200) may decide to perform L4S-based coexistence technology if the sum of the throughput for L4S flows and the throughput for non-L4S flows is greater than or equal to the available throughput of the base station, and the throughput for non-L4S flows relative to the throughput for all flows is greater than or equal to a preset threshold ratio.

[0296] In one embodiment, the base station (200) may not perform L4S-based coexistence technology if the sum of the throughput for L4S flows and the throughput for non-L4S flows is less than the available throughput of the base station (200).

[0297] In one embodiment, the base station (200) may not perform L4S-based coexistence technology if the ratio of the throughput of non-L4S flows to the throughput of the total flow is smaller than a preset threshold ratio.

[0298] If the base station (200) decides to perform L4S-based coexistence technology, it can perform L4S-based coexistence technology based on the base coupling factor set in step S1230.

[0299] In one embodiment, the base station (200) can calculate a mark probability p to perform L4S-based coexistence technology. In one embodiment, the base station (200) can calculate the mark probability by detecting congestion based on queue delay. The base station (200) can perform a CE (congestion experienced) mark on an L4S flow with a probability of p. In one embodiment, the base station (200) can mark the packet header of an L4S flow with a CE mark or ECT (1) with a probability of p.

[0300] The base station (200) for non-L4S flows With the probability of, packets can be dropped or marked. The base station (200) can mark the header of a non-L4S flow with ECT(0) with the probability above. The base station (200) can drop packets of a non-L4S flow with the probability above.

[0301] In one embodiment, the base station (200) can obtain real-time information regarding the RTT ratio of L4S flows and non-L4S flows from the AF. Based on the real-time information regarding the RTT ratio, the base station (200) can perform a coupling factor update for L4S-based coexistence technology.

[0302] Base station (200) is the ratio between the RTT of an L4S flow and the RTT of a non-L4S flow, A coupling factor update can be performed by comparing , with a preset threshold value. In one embodiment, the terminal If it is less than the first threshold value set or exceeds the second threshold value, a coupling factor update can be performed.

[0303] for example, If the RTT value of the non-L4S flow is smaller than the RTT value of the L4S flow compared to the RTT value of the L4S flow, the base station (200) can perform a coupling factor update. If the RTT value of the non-L4S flow is larger than the RTT value of the L4S flow, the base station (200) can perform a coupling factor update.

[0304] In one embodiment, the base station (200) can update the coupling factor value by considering the application's confusion control algorithm type, flow-specific priority information, and real-time RTT information. The base station (200) can perform L4S-based coexistence technology based on the coupling factor. The base station (200) can maintain throughput processes between L4S flows and non-L4S flows by performing L4S-based coexistence technology reflecting the updated coupling factor.

[0305] FIGS. 13a to 13c are drawings illustrating a method for setting base coupling factors in a PCF, SMF, and RAN to perform L4S-based coexistence technology in a base station when L4S is supported in a RAN according to one embodiment of the present disclosure.

[0306] In FIGS. 13a to 13c, information regarding the types of congestion control algorithms supported in the uplink and downlink is transmitted and received in order to set the base coupling factor for the uplink and downlink.

[0307] Referring to Fig. 13a, the base coupling factor can be calculated and set in the PCF.

[0308] In step S1310, the AF may send an Nnef_AFsessionWithQoS_Create request message to the NEF. This message is for the AF to request the NEF to create a QoS session, and may include information regarding the types of congestion control algorithms supported on the downlink and uplink within the service request input. In one embodiment, the message may include information regarding ECN marking for L4S support.

[0309] Upon receiving and acknowledging the Nnef_AFsessionWithQoS_Create request message, the NEF sends the Npcf_PolicyAuthorizaton_Create request message to the PCF in step S1320. This message is intended to request or create a policy required for network service provision and may include information regarding the types of congestion control algorithms supported on the downlink and uplink within the service request input.

[0310] The PCF can calculate a base coupling factor (1300) for each of the downlink and uplink based on information regarding the types of congestion control algorithms supported in the received downlink and uplink. In one embodiment, the PCF can calculate the base coupling factor (1300) by further using historical information regarding the RTT ratio of L4S flows and non-L4S flows or information regarding the priority of flows.

[0311] In step S1330, the PCF may send an Npcf_PolicyAuthorization_Create response message to the NEF. This message is sent by the PCF in response to the message received from the NEF in step S1320 and may include information regarding whether the policy required for providing network services has been successfully created.

[0312] In step S1340, the PCF may send an Npcf_SMPolicyControl_UpdateNotify request message to the SMF. This message is used by the PCF to notify the SMF of policy updates and is intended to reflect changes in session management and QoS policies in real time. The message may include base coupling factors for downlinks and uplinks in the PCC policy information.

[0313] In step S1350, the SMF may send an Npcf_SMPolicyControl_UpdateNotify response message to the PCF. This message is sent by the SMF in response to the message received from the PCF in S1340 and may contain information regarding whether the policy update request was successfully applied or if an error occurred.

[0314] In step S1360, Namf_Communication_N1N2MessageTransfer messages can be transmitted and received between the SMF and the AMF. The N2 SM information transmitted by the SMF to the AMF may include base coupling factors for the downlink and uplink.

[0315] In step S1370, the AMF may send an N2 PDU Session Request message to the RAN. This message is used to initiate or request a procedure related to a PDU session between the AMF and the RAN, and may include the N2 SM information received in step S1360. The N2 SM information may include base coupling factors for the downlink and uplink.

[0316] RAN can perform L4S-based coexistence technology operations using the base coupling factor for the downlink and uplink received from S1370.

[0317] Referring to Fig. 13b, the base coupling factor can be calculated and set in the SMF.

[0318] In step S1310, the AF may send an Nnef_AFsessionWithQoS_Create request message to the NEF. This message is for the AF to request the NEF to create a QoS session, and may include information regarding the types of congestion control algorithms supported on the downlink and uplink within the service request input. In one embodiment, the message may include information regarding ECN marking for L4S support.

[0319] Upon receiving and acknowledging the Nnef_AFsessionWithQoS_Create request message, the NEF sends the Npcf_PolicyAuthorizaton_Create request message to the PCF in step S1320. This message is intended to request or create a policy required for network service provision and may include information regarding the types of congestion control algorithms supported on the downlink and uplink within the service request input.

[0320] In step S1330, the PCF may send an Npcf_PolicyAuthorization_Create response message to the NEF. This message is sent by the PCF in response to the message received from the NEF in step S1320 and may include information regarding whether the policy required for providing network services has been successfully created.

[0321] In step S1340, the PCF may send an Npcf_SMPolicyControl_UpdateNotify request message to the SMF. This message is used by the PCF to notify the SMF of policy updates and is intended to reflect changes in session management and QoS policies in real time. The message may include information about the types of congestion control algorithms supported on downlinks and uplinks within the PCC policy information.

[0322] In step S1350, the SMF may send an Npcf_SMPolicyControl_UpdateNotify response message to the PCF. This message is sent by the SMF in response to the message received from the PCF in S1340 and may contain information regarding whether the policy update request was successfully applied or if an error occurred.

[0323] The SMF can calculate (1300) a base coupling factor for each of the downlink and uplink based on information regarding the types of congestion control algorithms supported in the downlink and uplink received in step S1340. In one embodiment, the SMF can calculate (1300) the base coupling factor by further using historical information regarding the RTT ratio of L4S flows and non-L4S flows or information regarding the priority of flows.

[0324] In step S1360, Namf_Communication_N1N2MessageTransfer messages can be transmitted and received between the SMF and the AMF. The N2 SM information transmitted by the SMF to the AMF may include base coupling factors for the downlink and uplink.

[0325] In step S1370, the AMF may send an N2 PDU Session Request message to the RAN. This message is used to initiate or request a procedure related to a PDU session between the AMF and the RAN, and may include the N2 SM information received in step S1360. The N2 SM information may include base coupling factors for the downlink and uplink.

[0326] RAN can perform L4S-based coexistence technology operations using the base coupling factor for the downlink and uplink received from S1370.

[0327] Referring to Fig. 13c, the base coupling factor can be calculated and set in the RAN.

[0328] In step S1310, the AF may send an Nnef_AFsessionWithQoS_Create request message to the NEF. This message is for the AF to request the NEF to create a QoS session, and may include information regarding the types of congestion control algorithms supported on the downlink and uplink within the service request input. In one embodiment, the message may include information regarding ECN marking for L4S support.

[0329] Upon receiving and acknowledging the Nnef_AFsessionWithQoS_Create request message, the NEF sends the Npcf_PolicyAuthorizaton_Create request message to the PCF in step S1320. This message is intended to request or create a policy required for network service provision and may include information regarding the types of congestion control algorithms supported on the downlink and uplink within the service request input.

[0330] In step S1330, the PCF may send an Npcf_PolicyAuthorization_Create response message to the NEF. This message is sent by the PCF in response to the message received from the NEF in step S1320 and may include information regarding whether the policy required for providing network services has been successfully created.

[0331] In step S1340, the PCF may send an Npcf_SMPolicyControl_UpdateNotify request message to the SMF. This message is used by the PCF to notify the SMF of policy updates and is intended to reflect changes in session management and QoS policies in real time. The message may include information about the types of congestion control algorithms supported on downlinks and uplinks within the PCC policy information.

[0332] In step S1350, the SMF may send an Npcf_SMPolicyControl_UpdateNotify response message to the PCF. This message is sent by the SMF in response to the message received from the PCF in S1340 and may contain information regarding whether the policy update request was successfully applied or if an error occurred.

[0333] In step S1360, Namf_Communication_N1N2MessageTransfer messages can be transmitted and received between the SMF and the AMF. The N2 SM information transmitted by the SMF to the AMF may include information regarding the types of congestion control algorithms supported on the downlink and uplink.

[0334] In step S1370, the AMF may send an N2 PDU Session Request message to the RAN. This message is used to initiate or request a procedure related to a PDU session between the AMF and the RAN, and may include the N2 SM information received in step S1360. The N2 SM information may include information about the types of congestion control algorithms supported on the downlink and uplink.

[0335] The RAN can calculate a base coupling factor (1300) for each of the downlink and uplink based on information regarding the types of congestion control algorithms supported in the downlink and uplink received in step S1370. In one embodiment, the RAN can calculate the base coupling factor (1300) by further using historical information regarding the RTT ratio of L4S flows and non-L4S flows or information regarding the priority of flows.

[0336] RAN can perform L4S-based coexistence technology operations using the calculated base coupling factors for downlink and uplink.

[0337] FIGS. 14a to 14c are drawings for explaining a method of setting base coupling factors in a PCF, SMF, and UPF to perform L4S-based coexistence technology in a base station when L4S is supported in a UPF according to one embodiment of the present disclosure.

[0338] In FIGS. 14a to 14c, information regarding the types of congestion control algorithms supported in the uplink and downlink is transmitted and received in order to set the base coupling factor for the uplink and downlink.

[0339] Referring to Fig. 14a, the base coupling factor can be calculated and set in the PCF.

[0340] In step S1410, the AF may send an Nnef_AFsessionWithQoS_Create request message to the NEF. This message is for the AF to request the NEF to create a QoS session, and may include information regarding the types of congestion control algorithms supported on the downlink and uplink within the service request input. In one embodiment, the message may include information regarding ECN marking for L4S support.

[0341] Upon receiving and acknowledging the Nnef_AFsessionWithQoS_Create request message, the NEF sends the Npcf_PolicyAuthorizaton_Create request message to the PCF in step S1420. This message is intended to request or create a policy required for network service provision and may include information regarding the types of congestion control algorithms supported on the downlink and uplink within the service request input.

[0342] The PCF can calculate a base coupling factor (1400) for each of the downlink and uplink based on information regarding the types of congestion control algorithms supported in the received downlink and uplink. In one embodiment, the PCF can calculate the base coupling factor (1400) by further using historical information regarding the RTT ratio of L4S flows and non-L4S flows or information regarding the priority of flows.

[0343] In step S1430, the PCF may send an Npcf_PolicyAuthorization_Create response message to the NEF. This message is sent by the PCF in response to the message received from the NEF in step S1420 and may include information on whether the policy required for providing network services has been successfully created.

[0344] In step S1440, the PCF may send an Npcf_SMPolicyControl_UpdateNotify request message to the SMF. This message is used by the PCF to notify the SMF of policy updates and is intended to reflect changes in session management and QoS policies in real time. The message may include base coupling factors for downlinks and uplinks in the PCC policy information.

[0345] In step S1450, the SMF may send an Npcf_SMPolicyControl_UpdateNotify response message to the PCF. This message is sent by the SMF in response to the message received from the PCF in S1440 and may contain information regarding whether the policy update request was successfully applied or if an error occurred.

[0346] At step S1460, SMF may send an N4 Session Establishment / Modification Request message to UPF. This message is a message containing a request for the creation, modification, release, etc. of a PDU session, and may include base coupling factors for the downlink and uplink in the request input.

[0347] At step S1470, UPF may send an N4 Session Establishment / Modification Response message to SMF. This message is sent by UPF in response to the message received from SMF at S1460 and may contain the result of processing requests for PDU session creation, modification, and release.

[0348] UPF can perform L4S-based coexistence technology operations using the base coupling factors for the downlink and uplink received from S1460.

[0349] Referring to Fig. 14b, the base coupling factor can be calculated and set in the SMF.

[0350] In step S1410, the AF may send an Nnef_AFsessionWithQoS_Create request message to the NEF. This message is for the AF to request the NEF to create a QoS session, and may include information regarding the types of congestion control algorithms supported on the downlink and uplink within the service request input. In one embodiment, the message may include information regarding ECN marking for L4S support.

[0351] Upon receiving and acknowledging the Nnef_AFsessionWithQoS_Create request message, the NEF sends the Npcf_PolicyAuthorizaton_Create request message to the PCF in step S1420. This message is intended to request or create a policy required for network service provision and may include information regarding the types of congestion control algorithms supported on the downlink and uplink within the service request input.

[0352] In step S1430, the PCF may send an Npcf_PolicyAuthorization_Create response message to the NEF. This message is sent by the PCF in response to the message received from the NEF in step S1420 and may include information on whether the policy required for providing network services has been successfully created.

[0353] In step S1440, the PCF may send an Npcf_SMPolicyControl_UpdateNotify request message to the SMF. This message is used by the PCF to notify the SMF of policy updates and is intended to reflect changes in session management and QoS policies in real time. The message may include information about the types of congestion control algorithms supported on the downlink and uplink in the PCC policy information.

[0354] In step S1450, the SMF may send an Npcf_SMPolicyControl_UpdateNotify response message to the PCF. This message is sent by the SMF in response to the message received from the PCF in S1440 and may contain information regarding whether the policy update request was successfully applied or if an error occurred.

[0355] The SMF can calculate a base coupling factor (1400) for each of the downlink and uplink based on information regarding the types of congestion control algorithms supported in the received downlink and uplink. In one embodiment, the SMF can calculate the base coupling factor (1400) by further using historical information regarding the RTT ratio of L4S flows and non-L4S flows or information regarding the priority of flows.

[0356] At step S1460, SMF may send an N4 Session Establishment / Modification Request message to UPF. This message is a message containing a request for the creation, modification, release, etc. of a PDU session, and may include base coupling factors for the downlink and uplink in the request input.

[0357] At step S1470, UPF may send an N4 Session Establishment / Modification Response message to SMF. This message is sent by UPF in response to the message received from SMF at S1460 and may contain the result of processing requests for PDU session creation, modification, and release.

[0358] UPF can perform L4S-based coexistence technology operations using the base coupling factors for the downlink and uplink received from S1460.

[0359] Referring to Fig. 14c, the base coupling factor can be calculated and set in the SMF.

[0360] In step S1410, the AF may send an Nnef_AFsessionWithQoS_Create request message to the NEF. This message is for the AF to request the NEF to create a QoS session, and may include information regarding the types of congestion control algorithms supported on the downlink and uplink within the service request input. In one embodiment, the message may include information regarding ECN marking for L4S support.

[0361] Upon receiving and acknowledging the Nnef_AFsessionWithQoS_Create request message, the NEF sends the Npcf_PolicyAuthorizaton_Create request message to the PCF in step S1420. This message is intended to request or create a policy required for network service provision and may include information regarding the types of congestion control algorithms supported on the downlink and uplink within the service request input.

[0362] In step S1430, the PCF may send an Npcf_PolicyAuthorization_Create response message to the NEF. This message is sent by the PCF in response to the message received from the NEF in step S1420 and may include information on whether the policy required for providing network services has been successfully created.

[0363] In step S1440, the PCF may send an Npcf_SMPolicyControl_UpdateNotify request message to the SMF. This message is used by the PCF to notify the SMF of policy updates and is intended to reflect changes in session management and QoS policies in real time. The message may include information about the types of congestion control algorithms supported on the downlink and uplink in the PCC policy information.

[0364] In step S1450, the SMF may send an Npcf_SMPolicyControl_UpdateNotify response message to the PCF. This message is sent by the SMF in response to the message received from the PCF in S1440 and may contain information regarding whether the policy update request was successfully applied or if an error occurred.

[0365] At step S1460, the SMF may send an N4 Session Establishment / Modification Request message to the UPF. This message is a message containing a request for the creation, modification, release, etc. of a PDU session, and may include information about the types of congestion control algorithms supported on the downlink and uplink in the request input.

[0366] At step S1470, UPF may send an N4 Session Establishment / Modification Response message to SMF. This message is sent by UPF in response to the message received from SMF at S1460 and may contain the result of processing requests for PDU session creation, modification, and release.

[0367] UPF can calculate a base coupling factor (1400) for each of the downlink and uplink based on information regarding the types of congestion control algorithms supported in the received downlink and uplink. In one embodiment, UPF can calculate the base coupling factor (1400) by further using historical information regarding the RTT ratio of L4S flows and non-L4S flows or information regarding the priority of flows.

[0368] UPF can perform L4S-based coexistence technology operations using the calculated base coupling factors for downlink and uplink.

[0369] FIGS. 15a to 15c are drawings for explaining a method for determining whether to perform coexistence technology in PCF, SMF, and RAN and a coupling factor update method to perform L4S-based coexistence technology in a base station when L4S is supported in a RAN according to one embodiment of the present disclosure.

[0370] In FIGS. 15a to 15c, RTT information and throughput information of the downlink and uplink are transmitted and received to update whether L4S coexistence technology is performed and the coupling factor.

[0371] Referring to Fig. 15a, the L4S coexistence technology is performed in PCF and the coupling factor update is performed.

[0372] In step S1510, AF may send an Nnef_AFsessionWithQoS_Update request message to NEF. This message is for AF to request a QoS session update from NEF, and may include RTT information for downlink and uplink and throughput information for downlink and uplink within the service request input.

[0373] Upon receiving and acknowledging the Nnef_AFsessionWithQoS_Update request message, the NEF sends the Npcf_PolicyAuthorizaton_Update request message to the PCF in step S1520. This message is intended to update the policy required for providing network services and may include RTT information for downlink and uplink, as well as throughput information for downlink and uplink, within the service request input.

[0374] PCF can determine whether to apply L4S-based coexistence technology based on received downlink and uplink throughput information and can update coupling factors based on downlink and uplink RTT information (1500).

[0375] In one embodiment, the PCF may decide to perform L4S-based coexistence technology if the sum of the throughput for L4S flows and the throughput for non-L4S flows is greater than or equal to the available throughput of the base station, and the throughput for non-L4S flows relative to the throughput for total flows is greater than or equal to a preset threshold ratio.

[0376] In one embodiment, PCF is the ratio between the RTT of the L4S flow and the RTT of the non-L4S flow, A coupling factor update can be performed by comparing , with a preset threshold value. In one embodiment, the PCF is If it is less than the first threshold value set or exceeds the second threshold value, a coupling factor update can be performed.

[0377] In step S1530, the PCF may send an Npcf_PolicyAuthorization_Update response message to the NEF. This message is sent by the PCF in response to the message received from the NEF in step S1520 and may include information on whether the policy required for providing network services has been successfully updated.

[0378] In step S1540, the PCF may send an Npcf_SMPolicyControl_UpdateNotify request message to the SMF. This message is used by the PCF to notify the SMF of policy updates and is intended to reflect changes in session management and QoS policies in real time. The message may include information regarding whether L4S-based coexistence technology is applied to downlinks and uplinks, as well as coupling factors for downlinks and uplinks, in the PCC policy information. In one embodiment, the coupling factor may refer to the coupling factor updated according to the 1500 operation.

[0379] In step S1550, the SMF may send an Npcf_SMPolicyControl_UpdateNotify response message to the PCF. This message is sent by the SMF in response to the message received from the PCF in S1540 and may contain information regarding whether the policy update request was successfully applied or if an error occurred.

[0380] In step S1560, Namf_Communication_N1N2MessageTransfer messages can be transmitted and received between the SMF and the AMF. The N2 SM information transmitted by the SMF to the AMF may include information on whether L4S-based coexistence technology is applied to the downlink and uplink, and coupling factors for the downlink and uplink. In one embodiment, the coupling factor may refer to a coupling factor updated according to the 1500 operation.

[0381] In step S1570, the AMF may transmit an N2 message to the RAN. The message may include information on whether L4S-based coexistence technology is applied to the downlink and uplink, and coupling factors for the downlink and uplink. In one embodiment, the coupling factor may refer to a coupling factor updated according to the 1500 operation.

[0382] Referring to Fig. 15b, the L4S coexistence technology is performed in SMF and the coupling factor update is performed.

[0383] In step S1510, AF may send an Nnef_AFsessionWithQoS_Update request message to NEF. This message is for AF to request a QoS session update from NEF, and may include RTT information for downlink and uplink and throughput information for downlink and uplink within the service request input.

[0384] Upon receiving and acknowledging the Nnef_AFsessionWithQoS_Update request message, the NEF sends the Npcf_PolicyAuthorizaton_Update request message to the PCF in step S1520. This message is intended to update the policy required for providing network services and may include RTT information for downlink and uplink, as well as throughput information for downlink and uplink, within the service request input.

[0385] In step S1530, the PCF may send an Npcf_PolicyAuthorization_Update response message to the NEF. This message is sent by the PCF in response to the message received from the NEF in step S1520 and may include information on whether the policy required for providing network services has been successfully updated.

[0386] At step S1540, the PCF may send an Npcf_SMPolicyControl_UpdateNotify request message to the SMF. This message is used by the PCF to notify the SMF of policy updates and is intended to reflect changes in session management and QoS policies in real time. The message may include RTT information for downlink and uplink, as well as throughput information for downlink and uplink, within the PCC policy information.

[0387] In step S1550, the SMF may send an Npcf_SMPolicyControl_UpdateNotify response message to the PCF. This message is sent by the SMF in response to the message received from the PCF in S1540 and may contain information regarding whether the policy update request was successfully applied or if an error occurred.

[0388] SMF can determine whether to apply L4S-based coexistence technology based on received downlink and uplink throughput information and can update coupling factors based on downlink and uplink RTT information (1500).

[0389] In one embodiment, the SMF may decide to perform L4S-based coexistence technology if the sum of the throughput for L4S flows and the throughput for non-L4S flows is greater than or equal to the available throughput of the base station, and the throughput for non-L4S flows relative to the throughput for total flows is greater than or equal to a preset threshold ratio.

[0390] In one embodiment, SMF is the ratio between the RTT of the L4S flow and the RTT of the non-L4S flow, A coupling factor update can be performed by comparing , with a preset threshold value. In one embodiment, the PCF is If it is less than the first threshold value set or exceeds the second threshold value, a coupling factor update can be performed.

[0391] In step S1560, Namf_Communication_N1N2MessageTransfer messages can be transmitted and received between the SMF and the AMF. The N2 SM information transmitted by the SMF to the AMF may include information on whether L4S-based coexistence technology is applied to the downlink and uplink, and coupling factors for the downlink and uplink. In one embodiment, the coupling factor may refer to a coupling factor updated according to the 1500 operation.

[0392] In step S1570, the AMF may transmit an N2 message to the RAN. The message may include information on whether L4S-based coexistence technology is applied to the downlink and uplink, and coupling factors for the downlink and uplink. In one embodiment, the coupling factor may refer to a coupling factor updated according to the 1500 operation.

[0393] Referring to Fig. 15c, the L4S coexistence technology is performed in the RAN and the coupling factor is updated.

[0394] In step S1510, AF may send an Nnef_AFsessionWithQoS_Update request message to NEF. This message is for AF to request a QoS session update from NEF, and may include RTT information for downlink and uplink and throughput information for downlink and uplink within the service request input.

[0395] Upon receiving and acknowledging the Nnef_AFsessionWithQoS_Update request message, the NEF sends the Npcf_PolicyAuthorizaton_Update request message to the PCF in step S1520. This message is intended to update the policy required for providing network services and may include RTT information for downlink and uplink, as well as throughput information for downlink and uplink, within the service request input.

[0396] In step S1530, the PCF may send an Npcf_PolicyAuthorization_Update response message to the NEF. This message is sent by the PCF in response to the message received from the NEF in step S1520 and may include information on whether the policy required for providing network services has been successfully updated.

[0397] At step S1540, the PCF may send an Npcf_SMPolicyControl_UpdateNotify request message to the SMF. This message is used by the PCF to notify the SMF of policy updates and is intended to reflect changes in session management and QoS policies in real time. The message may include RTT information for downlink and uplink, as well as throughput information for downlink and uplink, within the PCC policy information.

[0398] In step S1550, the SMF may send an Npcf_SMPolicyControl_UpdateNotify response message to the PCF. This message is sent by the SMF in response to the message received from the PCF in S1540 and may contain information regarding whether the policy update request was successfully applied or if an error occurred.

[0399] In step S1560, Namf_Communication_N1N2MessageTransfer messages can be transmitted and received between the SMF and the AMF. The N2 SM information transmitted by the SMF to the AMF may include RTT information for the downlink and uplink, and throughput information for the downlink and uplink.

[0400] In step S1570, the AMF may send an N2 message to the RAN. The message may include RTT information for the downlink and uplink and throughput information for the downlink and uplink.

[0401] RAN can determine whether to apply L4S-based coexistence technology based on received downlink and uplink throughput information and can update coupling factors based on downlink and uplink RTT information (1500).

[0402] In one embodiment, the RAN may decide to perform L4S-based coexistence technology when the sum of the throughput for L4S flows and the throughput for non-L4S flows is greater than or equal to the available throughput of the base station, and the throughput for non-L4S flows relative to the throughput for all flows is greater than or equal to a preset threshold ratio.

[0403] In one embodiment, RAN is the ratio between the RTT of the L4S flow and the RTT of the non-L4S flow, A coupling factor update can be performed by comparing , with a preset threshold value. In one embodiment, the PCF is If it is less than the first threshold value set or exceeds the second threshold value, a coupling factor update can be performed.

[0404] FIGS. 16a to 16c are drawings for explaining a method for determining whether to perform coexistence technology in PCF, SMF, and UPF and a coupling factor update method to perform L4S-based coexistence technology in a base station when L4S is supported in UPF according to one embodiment of the present disclosure.

[0405] In FIGS. 16a to 16c, RTT information and throughput information of the downlink and uplink are transmitted and received to update whether L4S coexistence technology is performed and the coupling factor.

[0406] Referring to Fig. 16a, the L4S coexistence technology is performed in PCF and the coupling factor update is performed.

[0407] In step S1610, AF may send an Nnef_AFsessionWithQoS_Update request message to NEF. This message is for AF to request a QoS session update from NEF, and may include RTT information for downlink and uplink and throughput information for downlink and uplink within the service request input.

[0408] Upon receiving and acknowledging the Nnef_AFsessionWithQoS_Update request message, the NEF sends the Npcf_PolicyAuthorizaton_Update request message to the PCF in step S1620. This message is intended to update the policy required for providing network services and may include RTT information for downlink and uplink, as well as throughput information for downlink and uplink, within the service request input.

[0409] PCF can determine whether to apply L4S-based coexistence technology based on received downlink and uplink throughput information and can update coupling factors based on downlink and uplink RTT information (1600).

[0410] In one embodiment, the PCF may decide to perform L4S-based coexistence technology if the sum of the throughput for L4S flows and the throughput for non-L4S flows is greater than or equal to the available throughput of the base station, and the throughput for non-L4S flows relative to the throughput for total flows is greater than or equal to a preset threshold ratio.

[0411] In one embodiment, PCF is the ratio between the RTT of the L4S flow and the RTT of the non-L4S flow, A coupling factor update can be performed by comparing , with a preset threshold value. In one embodiment, the PCF is If it is less than the first threshold value set or exceeds the second threshold value, a coupling factor update can be performed.

[0412] In step S1630, the PCF may send an Npcf_PolicyAuthorization_Update response message to the NEF. This message is sent by the PCF in response to the message received from the NEF in step S1620 and may include information on whether the policy required for providing network services has been successfully created.

[0413] In step S1640, the PCF may send an Npcf_SMPolicyControl_UpdateNotify request message to the SMF. This message is used by the PCF to notify the SMF of policy updates and is intended to reflect changes in session management and QoS policies in real time. The message may include information regarding whether L4S-based coexistence technology is applied to downlinks and uplinks, as well as coupling factors for downlinks and uplinks, in the PCC policy information. In one embodiment, the coupling factor may refer to the coupling factor updated according to the 1600 operation.

[0414] In step S1650, the SMF may send an Npcf_SMPolicyControl_UpdateNotify response message to the PCF. This message is sent by the SMF in response to the message received from the PCF in S1640 and may contain information regarding whether the policy update request was successfully applied or if an error occurred.

[0415] In step S1660, the SMF may send an N4 Session Establishment / Modification Request message to the UPF. The message is a message containing a request for the creation, modification, release, etc. of a PDU session, and the request input may include information on whether L4S-based coexistence technology is applied to the downlink and uplink, and coupling factors for the downlink and uplink. In one embodiment, the coupling factor may refer to a coupling factor updated according to the 1600 operation.

[0416] At step S1670, UPF may send an N4 Session Establishment / Modification Response message to SMF. This message is sent by UPF in response to the message received from SMF at S1660 and may contain the result of processing requests for PDU session creation, modification, and release.

[0417] Referring to Fig. 16b, the L4S coexistence technology is performed in SMF and the coupling factor update is performed.

[0418] In step S1610, AF may send an Nnef_AFsessionWithQoS_Update request message to NEF. This message is for AF to request a QoS session update from NEF, and may include RTT information for downlink and uplink and throughput information for downlink and uplink within the service request input.

[0419] Upon receiving and acknowledging the Nnef_AFsessionWithQoS_Update request message, the NEF sends the Npcf_PolicyAuthorizaton_Update request message to the PCF in step S1620. This message is intended to update the policy required for providing network services and may include RTT information for downlink and uplink, as well as throughput information for downlink and uplink, within the service request input.

[0420] In step S1630, the PCF may send an Npcf_PolicyAuthorization_Update response message to the NEF. This message is sent by the PCF in response to the message received from the NEF in step S1620 and may include information on whether the policy required for providing network services has been successfully created.

[0421] In step S1640, the PCF may send an Npcf_SMPolicyControl_UpdateNotify request message to the SMF. This message is used by the PCF to notify the SMF of policy updates and is intended to reflect changes in session management and QoS policies in real time. The message may include RTT information for downlink and uplink, as well as throughput information for downlink and uplink, within the PCC policy information.

[0422] In step S1650, the SMF may send an Npcf_SMPolicyControl_UpdateNotify response message to the PCF. This message is sent by the SMF in response to the message received from the PCF in S1640 and may contain information regarding whether the policy update request was successfully applied or if an error occurred.

[0423] SMF can determine whether to apply L4S-based coexistence technology based on received downlink and uplink throughput information and can update coupling factors based on downlink and uplink RTT information (1600).

[0424] In one embodiment, the SMF may decide to perform L4S-based coexistence technology if the sum of the throughput for L4S flows and the throughput for non-L4S flows is greater than or equal to the available throughput of the base station, and the throughput for non-L4S flows relative to the throughput for total flows is greater than or equal to a preset threshold ratio.

[0425] In one embodiment, SMF is the ratio between the RTT of the L4S flow and the RTT of the non-L4S flow, A coupling factor update can be performed by comparing , with a preset threshold value. In one embodiment, the PCF is If it is less than the first threshold value set or exceeds the second threshold value, a coupling factor update can be performed.

[0426] In step S1660, the SMF may send an N4 Session Establishment / Modification Request message to the UPF. The message is a message containing a request for the creation, modification, release, etc. of a PDU session, and the request input may include information on whether L4S-based coexistence technology is applied to the downlink and uplink, and coupling factors for the downlink and uplink. In one embodiment, the coupling factor may refer to a coupling factor updated according to the 1600 operation.

[0427] At step S1670, UPF may send an N4 Session Establishment / Modification Response message to SMF. This message is sent by UPF in response to the message received from SMF at S1660 and may contain the result of processing requests for PDU session creation, modification, and release.

[0428] Referring to Fig. 16c, the L4S coexistence technology is performed in the UPF and the coupling factor update is performed.

[0429] In step S1610, AF may send an Nnef_AFsessionWithQoS_Update request message to NEF. This message is for AF to request a QoS session update from NEF, and may include RTT information for downlink and uplink and throughput information for downlink and uplink within the service request input.

[0430] Upon receiving and acknowledging the Nnef_AFsessionWithQoS_Update request message, the NEF sends the Npcf_PolicyAuthorizaton_Update request message to the PCF in step S1620. This message is intended to update the policy required for providing network services and may include RTT information for downlink and uplink, as well as throughput information for downlink and uplink, within the service request input.

[0431] In step S1630, the PCF may send an Npcf_PolicyAuthorization_Update response message to the NEF. This message is sent by the PCF in response to the message received from the NEF in step S1620 and may include information on whether the policy required for providing network services has been successfully created.

[0432] In step S1640, the PCF may send an Npcf_SMPolicyControl_UpdateNotify request message to the SMF. This message is used by the PCF to notify the SMF of policy updates and is intended to reflect changes in session management and QoS policies in real time. The message may include RTT information for downlink and uplink, as well as throughput information for downlink and uplink, within the PCC policy information.

[0433] In step S1650, the SMF may send an Npcf_SMPolicyControl_UpdateNotify response message to the PCF. This message is sent by the SMF in response to the message received from the PCF in S1640 and may contain information regarding whether the policy update request was successfully applied or if an error occurred.

[0434] At step S1660, the SMF may send an N4 Session Establishment / Modification Request message to the UPF. This message is a message containing a request for the creation, modification, release, etc. of a PDU session, and may include RTT information for the downlink and uplink and throughput information for the downlink and uplink in the request input.

[0435] At step S1670, UPF may send an N4 Session Establishment / Modification Response message to SMF. This message is sent by UPF in response to the message received from SMF at S1660 and may contain the result of processing requests for PDU session creation, modification, and release.

[0436] UPF can determine whether to apply L4S-based coexistence technology based on received downlink and uplink throughput information and can update coupling factors based on downlink and uplink RTT information (1600).

[0437] In one embodiment, the UPF may decide to perform L4S-based coexistence technology if the sum of the throughput for L4S flows and the throughput for non-L4S flows is greater than or equal to the available throughput of the base station, and the throughput for non-L4S flows relative to the throughput for total flows is greater than or equal to a preset threshold ratio.

[0438] In one embodiment, UPF is the ratio between the RTT of the L4S flow and the RTT of the non-L4S flow, A coupling factor update can be performed by comparing , with a preset threshold value. In one embodiment, the PCF is If it is less than the first threshold value set or exceeds the second threshold value, a coupling factor update can be performed.

[0439] FIGS. 17a to 17c are drawings for explaining a method of setting base coupling factors in PCF, SMF, and RAN using messages from a UE to perform L4S-based coexistence technology in a base station when L4S is supported in a RAN according to one embodiment of the present disclosure.

[0440] FIGS. 17a to 17c transmit and receive information regarding the type of congestion control algorithm supported by the terminal and the uplink to set the base coupling factor for the downlink, and transmit and receive information regarding the type of congestion control algorithm supported by the AF and the downlink to set the base coupling factor for the downlink. Hereinafter, for the sake of brevity in the specification, content overlapping with FIGS. 13a to 13c is omitted.

[0441] Referring to Fig. 17a, the base coupling factor can be calculated and set in the PCF.

[0442] In step S1710, the terminal (UE) may send a PDU Session Establishment Request message to the AMF. The message is a request message for establishing a PDU session and may include information about the type of congestion control algorithm of the terminal for the uplink.

[0443] In one embodiment, when the terminal transmits a registration request message, it may transmit a NAS message including information about the type of congestion control algorithm of the terminal for the uplink.

[0444] In step S1715, the AMF may send an Nsmf_PDUSession_CreateSMContext Request message to the SMF. This message is for creating a session management context for the terminal to create a PDU session, and may include information about the type of congestion control algorithm for the terminal on the uplink within the service request input.

[0445] In step S1720, the SMF and PCF may send and receive messages related to the SM policy association establishment procedure. This procedure exchanges policy-related information to allow PDU sessions to be processed according to the policy, and may include information regarding the type of congestion control algorithm of the terminal for the uplink within the service request input.

[0446] In step S1725, the AF may send an Nnef_AFsessionWithQoS_Create request message to the NEF. This message is for the AF to request the NEF to create a QoS session, and may include information regarding the types of congestion control algorithms supported on the downlink within the service request input. In one embodiment, the message may include information regarding ECN marking for L4S support.

[0447] Upon receiving and acknowledging the Nnef_AFsessionWithQoS_Create request message, the NEF sends the Npcf_PolicyAuthorizaton_Create request message to the PCF in step S1730. This message is intended to request or create a policy required for network service provision and may include information regarding the types of congestion control algorithms supported on the downlink within the service request input.

[0448] PCF can calculate a base coupling factor (1700) for each of the downlink and uplink based on information regarding the types of congestion control algorithms supported in the received downlink and uplink. PCF can calculate a base coupling factor for the uplink based on information regarding the types of congestion control algorithms supported in the uplink received from SMF, and can calculate a base coupling factor for the downlink based on information regarding the types of congestion control algorithms supported in the downlink received from NEF.

[0449] In one embodiment, the PCF may calculate a base coupling factor (1700) by additionally using historical information regarding the RTT ratio of L4S flow and non-L4S flow or information regarding the priority of the flow.

[0450] Hereinafter, steps S1735 to S1755 correspond to steps S1330 to S1370 of FIG. 13.

[0451] FIG. 17b is a combination of the operations of FIG. 17a and FIG. 13b, which is omitted for the sake of brevity in the specification.

[0452] FIG. 17c is a combination of the operations of FIG. 17a and FIG. 13c, which is omitted for the sake of brevity in the specification.

[0453] FIGS. 18a to 18c are drawings for explaining a method of setting base coupling factors in PCF, SMF, and UPF using messages from a UE to perform L4S-based coexistence technology at a base station when L4S is supported in a UPF according to one embodiment of the present disclosure.

[0454] FIGS. 18a to 18c transmit and receive information regarding the type of congestion control algorithm supported by the terminal and the uplink to set the base coupling factor for the downlink, and transmit and receive information regarding the type of congestion control algorithm supported by the AF and the downlink to set the base coupling factor for the downlink. Hereinafter, for the sake of brevity in the specification, content overlapping with FIGS. 14a to 14c is omitted.

[0455] Referring to Fig. 18a, the base coupling factor can be calculated and set in the PCF.

[0456] In step S1810, the terminal (UE) may send a PDU Session Establishment Request message to the AMF. The message is a request message for establishing a PDU session and may include information about the type of congestion control algorithm of the terminal for the uplink.

[0457] In one embodiment, when the terminal transmits a registration request message, it may transmit a NAS message including information about the type of congestion control algorithm of the terminal for the uplink.

[0458] In step S1815, the AMF may send an Nsmf_PDUSession_CreateSMContext Request message to the SMF. This message is for creating a session management context for the terminal to create a PDU session, and may include information about the type of congestion control algorithm for the terminal on the uplink within the service request input.

[0459] In step S1820, the SMF and PCF may send and receive messages related to the SM policy association establishment procedure. This procedure exchanges policy-related information to allow PDU sessions to be processed according to the policy, and may include information regarding the type of congestion control algorithm of the terminal for the uplink within the service request input.

[0460] In step S1825, the AF may send an Nnef_AFsessionWithQoS_Create request message to the NEF. This message is for the AF to request the NEF to create a QoS session, and may include information regarding the types of congestion control algorithms supported on the downlink within the service request input. In one embodiment, the message may include information regarding ECN marking for L4S support.

[0461] Upon receiving and acknowledging the Nnef_AFsessionWithQoS_Create request message, the NEF sends the Npcf_PolicyAuthorizaton_Create request message to the PCF in step S1830. This message is intended to request or create a policy required for network service provision and may include information regarding the types of congestion control algorithms supported on the downlink within the service request input.

[0462] PCF can calculate a base coupling factor (1800) for each of the downlink and uplink based on information regarding the types of congestion control algorithms supported in the received downlink and uplink. PCF can calculate a base coupling factor for the uplink based on information regarding the types of congestion control algorithms supported in the uplink received from SMF, and can calculate a base coupling factor for the downlink based on information regarding the types of congestion control algorithms supported in the downlink received from NEF.

[0463] In one embodiment, the PCF may calculate a base coupling factor (1800) by additionally using historical information regarding the RTT ratio of L4S flow and non-L4S flow or information regarding the priority of the flow.

[0464] Hereinafter, steps S1835 to S1855 correspond to steps S1430 to S1470 of FIG. 14.

[0465] FIG. 18b is a combination of the operations of FIG. 18a and FIG. 14b, which is omitted for the sake of brevity in the specification.

[0466] FIG. 18c is a combination of the operations of FIG. 18a and FIG. 14c, which is omitted for the sake of brevity in the specification.

[0467] FIG. 19 is a block diagram of a terminal or user equipment (100) according to one embodiment of the present disclosure.

[0468] The terminal (100) is an electronic device capable of wireless communication and may have various form factors. Examples of the terminal may include at least one of a user device (UE), a mobile station (MS), a cellular phone, a smartphone, a computer, a tablet, a wearable device, an Internet of Things (IoT) device, or other devices / systems capable of performing wireless communication with a base station (BS) and / or other terminals via a wireless channel.

[0469] Referring to FIG. 19, the terminal (100) may include at least one communication unit (1930) (hereinafter, communication unit), at least one processor (1920) (hereinafter, processor), and at least one memory (1910) (hereinafter, memory). According to at least one or a combination thereof of methods corresponding to embodiments of the present disclosure, the communication unit (1930), processor (1920), and memory (1910) of the terminal (100) may be operated. However, the components of the terminal (100) are not limited to the examples of components shown in FIG. 19. In other embodiments, the terminal (100) may include additional components in addition to the aforementioned components, or some components may be omitted. Also, in some embodiments, any combination of the communication unit (1930), processor (1920), or memory (1910) may be integrated into a single component.

[0470] The communication unit (1930) may be a basic communication circuit or communication circuitry that enables the terminal (100) to perform wireless communication with a node or entity of a network. For example, the communication unit (1930) may enable the terminal (100) to transmit and receive signals to and from a base station via cellular wireless communication, or to transmit and receive signals to and from another terminal via cellular wireless communication. For example, the communication unit (1930) may support at least one of various cellular wireless communication technologies including 3G (3rd generation), 4G (4th generation) LTE (long-term evolution), 5G (5th generation) NR (new radio), 6G (6th generation), etc., and the various cellular wireless communication technologies supported by the communication unit (1930) may include all subsequent evolved generations of wireless communication.

[0471] According to one embodiment, the terminal (100) may include a plurality of communication units, and for example, when supporting EN-DC (E-UTRA (evolved-universal terrestrial radio access) - NR dual connectivity), it may include a first communication unit that supports 4G LTE wireless communication and a second communication unit that supports 5G NR wireless communication. According to another embodiment, when the terminal (100) supports NR-DC (NR Dual Connectivity), the terminal (100) may include a plurality of communication units that support 5G NR wireless communication. According to another embodiment, when the terminal (100) supports short-range wireless communication, the terminal (100) may separately include a communication unit that supports at least one of a group of wireless communication protocol standards such as Bluetooth®, wireless LAN or WLAN (wireless local area network) network (including, but not limited to, IEEE (institute of electrical and electronics engineer) 802.11-2016 standard or modifications thereof such as 802.11ah, 802.11ad, 802.11ay, 802.11ax, 802.11az, 802.11ba and 802.11be).

[0472] According to one embodiment, the communication unit (1930) may include various circuit structures used to transmit and receive signals through a base station and a wireless channel. The signals may include control information and data. For example, the communication unit (1930) may be configured to include an RF (radio frequency) transmitter that up-converts and amplifies the frequency of a transmitted signal, and an RF receiver that low-noise amplifies a received signal and down-converts the frequency. The communication unit (1930) may output the signal received through the wireless channel to a processor (1920) and transmit the signal output from the processor (1920) through the wireless channel.

[0473] A processor (1920) may control the overall operation of a terminal (100) according to an embodiment of the present disclosure. The processor (1920) may be implemented as one or more IC (integrated circuit (or circuitry)) chips and may execute various data processing operations. The processor (1920) may include at least one electrical circuit and may execute instructions (or programs, code, data, etc.) stored in memory (1910) individually, collectively, or in any combination. Additionally, the processor (1920) may include a single-core processor or a multi-core processor, and in a specific implementation, may be composed of a processor assembly including a plurality of processing circuits.

[0474] The processor (1920) is electrically, operatively, and / or communicatively coupled to the communication unit (1930) so as to control the communication unit (1930).

[0475] The processor (1920) may include at least one processor (or, processing circuitry), and at least one processor may perform the following operations individually, collectively, or in any combination. For example, the processor (1920) may include a communication processor (CP) that controls communication operations and an application processor (AP) that controls the execution of an upper layer (e.g., an application layer). In a specific embodiment, at least one part of the processor (1920) may be included in one chip (or, IC), and another part of the processor (1920) may be included in a separate chip (or, IC). Alternatively, at least one processor may be included in other components, e.g., a communication unit (1930) or a memory (1910).

[0476] The processor (1920) may perform, cause, or control the operation of a terminal to perform at least one or a combination of the methods according to the embodiments of the present disclosure. For example, the processor (1920) may control the operation of a terminal to process a downlink signal received from a base station or to generate an uplink signal and transmit it to a base station. To this end, the processor (1920) may control other components of the terminal (100) to perform various operations by executing computer programs, code, or instructions stored in memory (1910).

[0477] Memory (1910) is a hardware storage device capable of storing information temporarily or permanently and may include one or more storage media. For example, memory (1910) may include a memory assembly comprising one or more storage media. For example, the one or more storage media may include a hard drive, flash memory, permanent memory such as ROM (read-only memory), semipermanent memory such as RAM (random access memory), cache memory, or any combination thereof.

[0478] The memory (1910) can be electrically, operatively, and / or communicatively coupled to the processor (1920) and can be accessed by the processor (1920).

[0479] A computer program, code, or instruction that can be executed by a processor (1920) may be stored in the memory (1910). According to one embodiment, the computer program, code, or instruction that can be executed by the processor (1920) may be stored in a single memory device or may be separated and distributed across two or more memory devices. The processor (1920) may perform various functions according to the embodiments of the present disclosure by executing the instruction stored in the memory (1910).

[0480] According to one embodiment of the present disclosure, the operation of the terminal (100) may be caused to be performed based on at least one processor (or processing circuit) configured to perform the features of the present disclosure individually, collectively, or in any combination based on the execution of instructions (or computer program or code) stored in memory (1910), based on processing circuitry not configured to execute instructions, and / or based on components of a processing circuitry not configured to execute instructions.

[0481] FIG. 20 is a block diagram of a base station (200) according to one embodiment of the present disclosure.

[0482] The base station (200) can perform wireless communication with at least one terminal within the area of ​​the base station (200) via a wireless channel. The base station (200) can perform communication with a node or entity of the network via wired or wireless communication.

[0483] Referring to FIG. 20, a base station (200) may include at least one communication unit (2030) (hereinafter, communication unit), at least one processor (2020) (hereinafter, processor), and at least one memory (2010) (hereinafter, memory). According to at least one or a combination thereof of methods corresponding to embodiments of the present disclosure, the communication unit (2030), processor (2020), and memory (2010) of the base station (200) may be operated. However, the components of the base station (200) are not limited to the examples of components shown in FIG. 20. In other embodiments, the base station (200) may include additional components in addition to the aforementioned components, or some components may be omitted. Also, in some embodiments, any combination of the communication unit (2030), processor (2020), or memory (2010) may be integrated into a single component.

[0484] The communication unit (2030) may be a communication circuit or communication circuitry that enables the base station (200) to perform wireless communication with a node or entity of the network. For example, the communication unit (2030) may enable the base station (200) to transmit and receive signals to and from a terminal (100) via cellular wireless communication or to transmit and receive signals to and from another network entity via wireless communication. For example, the communication unit (2030) may support various cellular wireless communication technologies including 3G (3rd generation), 4G (4th generation) LTE (long-term evolution), 5G (5th generation) NR (new radio), 6G (6th generation), etc., and the various cellular wireless communication technologies supported by the communication unit (2030) may include all subsequent generations of wireless communication. According to one embodiment, the communication unit (2030) may include various circuit structures used to transmit and receive signals to and from a terminal via a wireless channel. The above signal may include control information and data. For example, the communication unit (2030) may be configured to include an RF (radio frequency) transmitter that up-converts and amplifies the frequency of a transmitted signal, and an RF receiver that low-noise amplifies a received signal and down-converts the frequency. The communication unit (2030) may output a signal received through a wireless channel to a processor (2020) and transmit a signal output from the processor (2020) through a wireless channel.

[0485] Meanwhile, according to one embodiment of the present disclosure, a base station (200) may communicate with an entity or node of a network via wired or wireless communication. For example, the base station (200) may communicate via wired or wireless communication with an entity or node of an adjacent base station or core network via a backhaul network. Although not shown in the drawings, when the base station (200) performs wired communication, the base station (200) may include a separate network interface for wired communication in addition to the communication unit (2030). The network interface may be referred to as network interface circuitry, communication interface circuitry, etc.

[0486] A processor (2020) can control the overall operation of a base station (200) according to an embodiment of the present disclosure. The processor (2020) may be implemented as one or more IC (integrated circuit or circuitry) chips and may execute various data processing operations. The processor (2020) may include at least one electrical circuit and may execute instructions (or programs, code, data, etc.) stored in memory (2010) individually, collectively, or in any combination. Additionally, the processor (2020) may include a single-core processor or a multi-core processor, and in a specific implementation, may be composed of a processor assembly including a plurality of processing circuits.

[0487] The processor (2020) is electrically, operatively, and / or communicatively coupled to the communication unit (2030) so as to control the communication unit (2030).

[0488] The processor (2020) may include at least one processor (or processor circuitry), and at least one processor may perform the following operations individually, collectively, or in any combination. In a specific embodiment, at least one part of the processor (2020) may be included in one chip (or IC), and another part of the processor (2020) may be included in a separate chip (or IC). Alternatively, at least one processor may be included in other components, such as a communication unit (2030) or a memory (2010).

[0489] The processor (2020) may perform, cause, or control the operation of a base station to perform at least one or a combination of the methods according to the embodiments of the present disclosure. For example, the processor (2020) may control the operation of a base station to generate a downlink signal and transmit it to a terminal, or to process an uplink signal received from a terminal. Alternatively, the base station may transmit and receive signals with an adjacent base station, transmit a signal received from a terminal to an upper node of the network, or receive a signal from an upper node of the network and transmit it to a terminal. To this end, the processor (2020) may control other components of the base station (200) to perform various operations by executing computer programs, codes, and instructions stored in memory (2010).

[0490] Memory (2010) is a hardware storage device capable of storing information temporarily or permanently and may include one or more storage media. For example, memory (2010) may include a memory assembly comprising one or more storage media. For example, the one or more storage media may include a hard drive, flash memory, permanent memory such as ROM (read-only memory), semi-permanent memory such as RAM (random access memory), cache memory, or any combination thereof.

[0491] The memory (2010) can be electrically, operatively, and / or communicatively coupled with the processor (2020) and can be accessed by the processor (2020).

[0492] A memory (2010) may store a computer program, code, or instruction that can be executed by a processor (2020). According to one embodiment, the computer program, code, or instruction that can be executed by the processor (2020) may be stored in a single memory device or may be separated and distributed among two or more memory devices. The processor (2020) may perform various functions according to the embodiments of the present disclosure by executing the instruction stored in the memory (2010).

[0493] According to one embodiment of the present disclosure, the operation of a base station (200) may be caused to be performed based on at least one processor (or processing circuit) configured to perform the features of the present disclosure individually, collectively, or in any combination based on the execution of instructions (or computer programs or code) stored in memory (2010), based on processing circuitry not configured to execute instructions, and / or based on components of a processing circuitry not configured to execute instructions. A method for a terminal according to one embodiment of the present disclosure to perform an L4S (Low latency Low loss Scalable throughput) based coexistence technique may include the step of identifying whether an L4S flow and a non-L4S flow coexistence situation has occurred. The method may include the step of performing a base coupling factor setting for an L4S based coexistence technique. The above method may include a step of determining whether to perform L4S-based coexistence technology based on throughput regarding L4S flow and throughput regarding non-L4S flow. The above method may include a step of performing L4S-based coexistence technology based on the determination result and base coupling factor.

[0494] In one embodiment, the method may include a step of identifying whether historical information regarding the RTT ratios of L4S flows and non-L4S flows exists. If historical information regarding the RTT ratios does not exist, the method may include a step of setting a base coupling factor based on a congestion control algorithm and a default RTT ratio. If historical information regarding the RTT ratios exists, the method may include a step of setting a base coupling factor based on a congestion control algorithm type and historical information regarding the RTT ratios.

[0495] In one embodiment, the method may include the step of determining the throughput ratio of L4S flows and non-L4S flows based on priority information regarding L4S flows and priority information regarding non-L4S flows. A base coupling factor may be set based on the throughput ratio.

[0496] In one embodiment, the method may include the step of performing an L4S-based coexistence technique when the sum of the throughput for L4S flows and the throughput for non-L4S flows is greater than or equal to the available throughput of the terminal, and the ratio of the throughput for non-L4S flows to the sum of the throughput for L4S flows and the throughput for non-L4S flows is greater than or equal to a preset threshold ratio.

[0497] In one embodiment, the method may include the step of identifying real-time information regarding the RTT ratios of L4S flows and non-L4S flows. The method may include the step of performing a coupling factor update for an L4S-based coexistence technique based on the real-time information regarding the RTT ratios. The method may include the step of performing an L4S-based coexistence technique based on the coupling factor.

[0498] In one embodiment, the method may include the step of performing a coupling factor update when the RTT ratio is less than a preset first threshold value based on real-time information regarding the RTT ratio. The method may perform a coupling factor update when the RTT ratio exceeds a preset second threshold value based on real-time information regarding the RTT ratio.

[0499] A method for a base station to perform L4S-based coexistence technology according to one embodiment of the present disclosure may include a step of identifying whether a situation in which L4S flow and non-L4S flow coexistence occurs. The method may include a step of receiving information regarding a type of congestion control algorithm for performing L4S-based coexistence technology from an Application Function (AF). The method may perform a step of setting a base coupling factor based on the information regarding the type of congestion control algorithm. The method may include a step of performing L4S-based coexistence technology based on the base coupling factor.

[0500] A terminal performing an L4S-based coexistence technique according to one embodiment of the present disclosure may include a memory storing a plurality of instructions and at least one processor executing a plurality of instructions stored in the memory. The terminal can identify whether an L4S flow and non-L4S flow coexistence situation has occurred by executing a plurality of instructions individually or collectively by at least one processor. The terminal can perform a base coupling factor setting for an L4S-based coexistence technique by executing a plurality of instructions individually or collectively by at least one processor. The terminal can determine whether to perform an L4S-based coexistence technique based on throughput regarding an L4S flow and throughput regarding a non-L4S flow by executing a plurality of instructions individually or collectively by at least one processor. The terminal can perform an L4S-based coexistence technique based on a determination result and a base coupling factor by executing a plurality of instructions individually or collectively by at least one processor.

[0501] A device-readable storage medium may be provided in the form of a non-transitory storage medium. Here, 'non-transitory storage medium' simply means that it is a tangible device and does not contain a signal (e.g., electromagnetic waves), and the term does not distinguish between cases where data is stored semi-permanently and cases where it is stored temporarily. For example, a 'non-transitory storage medium' may include a buffer in which data is stored temporarily.

[0502] According to one embodiment, the method according to the various embodiments disclosed herein may be provided by being included in a computer program product. The computer program product may be traded between a seller and a buyer as a product. The computer program product may be distributed in the form of a device-readable storage medium (e.g., compact disc read-only memory (CD-ROM)), or distributed online (e.g., download or upload) through an application store or directly between two user devices (e.g., smartphones). In the case of online distribution, at least a portion of the computer program product (e.g., downloadable app) may be temporarily stored or temporarily created on a device-readable storage medium, such as the memory of a manufacturer's server, an application store's server, or a relay server.

Claims

In a method for a terminal to perform L4S (Low latency, Low loss, Scalable throughput) based coexistence technology, A step of identifying whether a situation in which L4S flow and non-L4S flow coexist has occurred; A step of setting the base coupling factor for L4S-based coexistence technology; A step of determining whether to perform the L4S-based coexistence technology based on the throughput of the L4S flow and the throughput of the non-L4S flow; and Based on the above determination result and the above base coupling factor, a step of obtaining a coupling factor that reflects real-time information regarding the RTT (round trip time) ratio of the L4S flow and the non-L4S flow; and A method comprising the step of performing the L4S-based coexistence technology based on the coupling factor obtained above. In paragraph 1, A step of identifying whether historical information regarding the RTT ratio of the above L4S flow and the above non-L4S flow exists; If historical information regarding the above RTT ratio does not exist, a step of performing the base coupling factor setting based on the congestion control algorithm type and the default RTT ratio; and A method comprising: a step of performing the base coupling factor setting based on the congestion control algorithm type and the historical information regarding the RTT ratio, if historical information regarding the RTT ratio exists. In Article 2, The method further includes the step of determining the throughput ratio of the L4S flow and the non-L4S flow based on priority information regarding the L4S flow and priority information regarding the non-L4S flow; A method in which the above base coupling factor is set based on the above throughput ratio. In any one of paragraphs 1 to 3, The step of determining whether to perform the above L4S-based coexistence technology is, A method comprising the step of performing the L4S-based coexistence technology when the sum of the throughput for the L4S flow and the throughput for the non-L4S flow is greater than or equal to the available throughput of the terminal, and the ratio of the throughput for the non-L4S flow to the sum of the throughput for the L4S flow and the throughput for the non-L4S flow is greater than or equal to a preset threshold ratio. In any one of paragraphs 1 to 4, A step of performing real-time information updates regarding the RTT ratios of the above L4S flow and the above non-L4S flow; A step of performing a coupling factor update for the L4S-based coexistence technology based on real-time information regarding the updated RTT ratio; and A method further comprising the step of performing the L4S-based coexistence technology based on the coupling factor. In Article 5, Based on real-time information regarding the updated RTT ratio, if the RTT ratio is less than a preset first threshold value, a step of performing the coupling factor update; and A method comprising the step of performing the coupling factor update when the RTT ratio exceeds a preset second threshold value based on real-time information regarding the updated RTT ratio. In a method for a base station to perform L4S (Low latency, Low loss, Scalable throughput) based coexistence technology, A step of identifying whether a situation in which L4S flow and non-L4S flow coexist has occurred; A step of receiving information regarding the type of congestion control algorithm for performing L4S-based coexistence technology from AF (Application Function); and A step of performing a base coupling factor setting based on information regarding the above-mentioned congestion control algorithm type; and A method comprising the step of performing the L4S-based coexistence technology based on the above base coupling factor. In Article 7, A step of receiving real-time information regarding the RTT ratio of the L4S flow and the non-L4S flow from the AF; A step of performing a coupling factor update for the L4S-based coexistence technology based on real-time information regarding the above RTT ratio; and A method further comprising the step of performing the L4S-based coexistence technology based on the coupling factor. In either Article 7 or Article 8, A step of receiving information regarding the type of congestion control algorithm of the terminal from the terminal; and A method comprising the step of performing the base coupling factor setting based on information regarding the type of congestion control algorithm of the terminal. In any one of paragraphs 7 through 9, A method further comprising the step of determining whether to perform the L4S-based coexistence technology based on the throughput regarding the L4S flow and the throughput regarding the non-L4S flow. In a terminal (100) that performs L4S (Low latency Low loss Scalable throughput) based coexistence technology, Memory for storing multiple instructions (1910); and It includes at least one processor (1920) that executes the plurality of instructions stored in the memory, As the above plurality of instructions are executed individually or collectively by the at least one processor (1920), the terminal (100), Identify whether a situation in which L4S flow and non-L4S flow coexist has occurred, and Perform base coupling factor settings for L4S-based coexistence technology, and Based on the throughput regarding the L4S flow and the throughput regarding the non-L4S flow, determine whether to perform the L4S-based coexistence technology, and Based on the above determination result and the above base coupling factor, a coupling factor is obtained that reflects real-time information regarding the RTT (round trip time) ratio of the L4S flow and the non-L4S flow, and A terminal (100) that performs the L4S-based coexistence technology based on the coupling factor obtained above. In Paragraph 11, As the above plurality of instructions are executed individually or collectively by the at least one processor (1920), the terminal (100), Identify whether historical information regarding the RTT ratios of the above L4S flow and the above non-L4S flow exists, and If historical information regarding the above RTT ratio does not exist, the above base coupling factor setting is performed based on the congestion control algorithm type and the default RTT ratio, and A terminal (100) that performs the base coupling factor setting based on the congestion control algorithm type and the history information regarding the RTT ratio, if there is history information regarding the above RTT ratio. In Article 12, As the above plurality of instructions are executed individually or collectively by the at least one processor (1920), the terminal (100), Based on priority information regarding the above L4S flow and priority information regarding the above non-L4S flow, the throughput ratio of the above L4S flow and the above non-L4S flow is determined, and The above base coupling factor is set based on the throughput ratio, terminal (100). In any one of paragraphs 11 to 13, As the above plurality of instructions are executed individually or collectively by the at least one processor (1920), the terminal (100), A terminal (100) that performs the L4S-based coexistence technology when the sum of the throughput for the L4S flow and the throughput for the non-L4S flow is greater than or equal to the available throughput of the terminal, and the ratio of the throughput for the non-L4S flow to the sum of the throughput for the L4S flow and the throughput for the non-L4S flow is greater than or equal to a preset threshold ratio. In any one of paragraphs 11 through 14, As the above plurality of instructions are executed individually or collectively by the at least one processor (1920), the terminal (100), Perform real-time information updates regarding the RTT ratios of the above L4S flow and the above non-L4S flow, and Based on the real-time information regarding the above-mentioned updated RTT ratio, a coupling factor update for the above-mentioned L4S-based coexistence technology is performed, and A terminal (100) that performs the L4S-based coexistence technology based on the above coupling factor.

Images