Method and device for switching

Abstract

Embodiments of the present application relate to methods and apparatus for performing handover in a next generation network (NGN). An exemplary method includes: transmitting task information associated with a UE; and receiving at least one task result feedback (TRF) configuration associated with the UE from at least one candidate base station (BS), wherein each configuration indicates how to provide result feedback about the task to the UE via a corresponding candidate BS of the at least one candidate BS. Embodiments of the present application can efficiently guarantee the performance requirements (such as latency, energy, computing power, etc.) of the UE during the handover procedure.

Description

Technical Field

[0001] Embodiments of the present application relate generally to wireless communication techniques, and more particularly to methods and apparatus for handover, for example, in a Next Generation Network (NGN). Background Art

[0002] Based on current research projects in 3GPP, it is clear that integrating NGN with AI technology is a trend. AI is expected to become a technical enabler for intelligent management, control, and diagnosis of complex networks envisioned by NGN. On the other hand, AI-based applications are rapidly developing to meet the growing and challenging needs of mobile terminal users (e.g., user equipment (UE) in NGN). In NGN using AI technology, mobility management for supporting AI-based services in NGN needs to be carefully studied.

[0003] In view of the above, the industry hopes to improve the handover technology in NGN so as to efficiently guarantee the Quality of Service (QoS) or Quality of Experience (QoE) requirements (such as latency, energy, computing power, etc.) of UE. Summary of the invention

[0004] Some embodiments of the present application at least provide a technical solution for handover, which can at least adapt to NGN.

[0005] According to some embodiments of the present application, a method may include: transmitting task information associated with a UE; and receiving at least one task result feedback (TRF) configuration associated with the UE from at least one candidate base station (BS), wherein each configuration indicates how to provide result feedback about the task to the UE via a corresponding candidate BS of the at least one candidate BS.

[0006] According to some other embodiments of the present application, a method may include: receiving task information associated with a UE, wherein the task information includes an indicator indicating whether any task of the UE is in progress; in response to at least one task being in progress as indicated by the indicator, transmitting a request message for TRF configuration associated with the UE, wherein the request message includes the task information.

[0007] According to some other embodiments of the present application, a method may include: receiving a request message for a TRF configuration associated with a UE, wherein the request message includes task information associated with the UE; determining at least one candidate TRF configuration based on the task information; and transmitting the at least one candidate TRF configuration.

[0008] Some embodiments of the present application also provide an apparatus comprising: at least one non-transitory computer-readable medium having computer-executable instructions stored therein; at least one receiver; at least one transmitter; and at least one processor coupled to the at least one non-transitory computer-readable medium, the at least one receiver, and the at least one transmitter. The computer-executable instructions are programmed to implement any of the methods described above with the at least one receiver, the at least one transmitter, and the at least one processor.

[0009] Embodiments of the present application provide a technical solution for handover, which can efficiently meet the QoS or QoE requirements (such as latency, energy, computing power, etc.) of the UE during the handover procedure. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] In order to describe the manner in which the advantages and features of the present application can be obtained, the description of the present application is presented by reference to specific embodiments of the present application illustrated in the accompanying drawings. These drawings depict only example embodiments of the present application and therefore should not be considered as limiting the scope thereof.

[0011] Figure 1 is a schematic diagram illustrating an exemplary wireless communication system 100 according to an embodiment of the present application;

[0012] Figure 2 is a flow chart illustrating a method for switching according to some embodiments of the present application;

[0013] Figures 3(a) to 3(c) An example of task information according to some embodiments of the present application is described;

[0014] Figures 4(a) to 4(b) An example of at least one candidate TRF configuration according to some embodiments of the present application is described;

[0015] Figure 5 A simplified block diagram illustrating an apparatus for switching according to some embodiments of the present application;

[0016] Figure 6 A simplified block diagram illustrating an apparatus for switching according to some other embodiments of the present application; and

[0017] Figure 7 A simplified block diagram illustrating an apparatus for switching according to some other embodiments of the present application. DETAILED DESCRIPTION

[0018] The detailed description of the accompanying drawings is intended as a description of the currently preferred embodiments of the present application, and is not intended to represent the only form in which the present application can be practiced. It should be understood that the same or equivalent functions can be accomplished by different embodiments that are intended to be included in the spirit and scope of the present application.

[0019] Reference will now be made in detail to some embodiments of the present application, examples of which are illustrated in the accompanying drawings. To facilitate understanding, embodiments are provided under specific network architectures and new service scenarios (e.g., 3GPP 5G, 3GPP LTE Release 8, etc.). It is well understood by those skilled in the art that, with the development of network architectures and new service scenarios, the embodiments in the present application are also applicable to similar technical problems.

[0020] NGN using AI technology may need to run a large number of applications and perform large-scale calculations. Due to the limited computing power, storage and battery life of mobile devices, it is almost impossible for mobile devices to meet the stringent requirements required by AI-based applications, which are characterized by latency sensitivity and computational intensiveness. For this reason, computation migration and computational paradigm are introduced in NGN.

[0021] The basic design principle of computing migration is to use powerful infrastructure (such as remote servers) to enhance the computing power of less powerful devices (such as mobile devices). For example, computing migration can include edge-oriented computing migration and cloud-oriented computing migration. Edge-oriented computing migration outperforms cloud-oriented computing migration in terms of the balance between latency and computing power.

[0022] Figure 1 is a schematic diagram illustrating an exemplary wireless communication system 100 according to an embodiment of the present application.

[0023] like Figure 1 As shown in FIG. 1 , the wireless communication system 100 may include at least one BS (e.g., BS 101a, BS 101b, and BS 101c), at least one UE (e.g., UE 102), at least one user plane function (UPF) (e.g., UPF 103a and UPF 103b), at least one server (e.g., server 104a and server 104b), at least one control plane (e.g., CP 105), and a core network (e.g., CN 106). The radio access network (e.g., RAN 107) may include all BSs. The core network 106 may include at least one user plane and a control plane.

[0024] Although for simplicity in Figure 1 Three BSs, one UE, two UPFs and two servers are illustrated in FIG. 1 , but it is considered that in some other embodiments of the present application, the wireless communication system 100 may include more or fewer BSs, UEs, UPFs and servers.

[0025] A BS may also be referred to as an access point, access terminal, base station, macro cell, Node-B, enhanced Node B (eNB), gNB, home Node-B, relay node, or device, or described using other terms used in the art. A BS is typically part of a radio access network that may include a controller communicatively coupled to the BS.

[0026] UE 102 may include a computing device, such as a desktop computer, a laptop computer, a personal digital assistant (PDA), a tablet computer, a smart TV (e.g., a TV connected to the Internet), a set-top box, a game console, a security system (including a security camera), a car computer or the like. According to an embodiment of the present application, UE 102 may include a portable wireless communication device, a smart phone, a cellular phone, a flip phone, a device with a user identity module, a personal computer, a selective call receiver, or any other device capable of sending and receiving communication signals on a wireless network. In some embodiments, UE 102 may include a wearable device, such as a smart watch, a fitness bracelet, an optical head-mounted display or the like. In some embodiments, UE 102 may include a vehicle. In addition, UE 102 may be referred to as a user unit, a mobile device, a mobile station, a user, a terminal, a mobile terminal, a wireless terminal, a fixed terminal, a user station, a user terminal, or a device, or may be described using other terms used in the art.

[0027] The UPF is generally responsible for the delivery of user data between the data network and the UE (via the RAN). The server may be an edge node (EN), a content server, a cloud server, or any other server that can run tasks associated with the UE. Tasks associated with the UE may be migrated from the UE or from the network to the server.

[0028] The wireless communication system 100 is compatible with any type of network capable of sending and receiving wireless communication signals. For example, the wireless communication system 100 is compatible with wireless communication networks, cellular telephone networks, time division multiple access (TDMA)-based networks, code division multiple access (CDMA)-based networks, orthogonal frequency division multiple access (OFDMA)-based networks, LTE networks, 3GPP-based networks, 3GPP 5G networks, satellite communication networks, high altitude platform networks, and / or other communication networks.

[0029] Considering that mobility is an inherent characteristic of UE, how to design efficient mobility management is challenging to support task migration in the context of edge-oriented task migration, where servers (eg, ENs) are geographically distributed.

[0030] by Figure 1As an example, UE 102 may currently be served by a source BS (e.g., BS 101a). For an ongoing session of UE 102, at least one task of the session may be migrated to server 104a via BS 101a and UPF 103a, as illustrated by the bold curve with arrows. UE 102 keeps moving in the direction indicated by the dashed arrow. When UE 102 moves to the position represented by P, a handover (HO) decision may be triggered by BS 101a based on a measurement report from UE 102. According to the HO procedure specified in 3GPP, the target BS will be determined by the source BS (e.g., BS 101a) based on the measurement report from UE 102 and the handover request confirmation from at least one candidate BS (e.g., BS 101b and BS 101c).

[0031] In the existing HO procedure, service continuity or session continuity of legacy data access has been guaranteed by utilizing methods such as data forwarding. For example, for legacy data access, data buffered in the source BS will be delivered from the source BS to the determined target BS during the HO execution phase.

[0032] However, task migration is different from legacy data access in resource utilization patterns and QoS or QoE requirements, and therefore requires different information for target BS determination in the HO procedure. For example, for task migration, it may not be necessary to deliver tasks during the HO execution phase. Therefore, for different target BSs, when and how task result feedback will be transmitted from the server 104a to the UE 102 via the target BS is different.

[0033] For example, if BS 101b is determined to be the target BS for UE 102, once the task result is obtained by server 104a, the task result feedback may be transmitted to UE 102 via a path from server 104a to UPF 103a to BS 101b.

[0034] If it is determined that BS 101c is the target BS for UE 102, once the task result is obtained by server 104a, the task result feedback can be transmitted to UE 102 via one of two alternative paths. The first path can be from server 104a to UPF 103a to UPF 103b and then to BS 101c. The second path can be from server 104a to UPF 103a to BS 101c. Alternatively, the task can be transferred to server 104b (which is closer to BS 101c) and executed in server 104b, and the task result, once obtained, will be delivered to UE 102 via the path from server 104b to UPF 103b to BS 101c.

[0035] Taking the above into consideration, different target BSs determined in the HO procedure will require different costs for the system when performing task transfer and task result feedback and thus introduce different QoS or QoE (e.g., energy, computing power, etc.) for the task results to be obtained by the end user. Therefore, determining the target BS in the HO procedure should consider the connection between the server and the target BS, thereby satisfying the performance for performing task result feedback to the UE.

[0036] Considering the above situation, the embodiments of the present application provide a technical solution for handover, which can efficiently guarantee the QoS or QoE requirements (such as latency, energy, computing power, etc.) of the UE. More details about the embodiments of the present application will be described below in conjunction with the accompanying drawings.

[0037] Figure 2 is a flow chart illustrating a method for switching according to some embodiments of the present application.

[0038] refer to Figure 2 At step 200, a core network (e.g., Figure 1 The CN 106 shown in FIG. 106 may provide the UE (eg, as shown in FIG. 106 ) within the source BS at the connection establishment phase or the last tracking area (TA) update phase. Figure 1 The source BS may be a NG-RAN node. In an embodiment of the present application, the NG-RAN node may be an eNB, a gNB, an ng-eNB, an en-gNB, etc.

[0039] At step 201, the source BS may transmit a measurement configuration to the UE, and the UE may report a measurement result according to the measurement configuration. The measurement configuration may include information similar to that specified in 3GPP TS 38.331. For example, the measurement configuration may include a measurement object and a measurement report configuration.

[0040] The measurement object may contain a list of objects for which the UE should perform measurements. For intra-frequency and inter-frequency measurements, the measurement object indicates the frequency / time position and subcarrier spacing of the reference signal to be measured. For this measurement object, the network may configure a list of cell-specific offsets, a list of 'blacklisted' cells, and a list of 'whitelisted' cells. According to some embodiments of the present application, blacklisted cells are not applicable in event assessment or measurement reporting. Whitelisted cells are the only cells that are applicable in event assessment or measurement reporting.

[0041] The measurement report configuration may include a report configuration list, which may include one or more report configurations per measurement object. Each measurement report configuration may include a reporting criterion. The reporting criterion may indicate a trigger for the UE to send a measurement report periodically or based on an event. For example, an event may be an A3 event or an A5 event as specified in 3GPP TS 38.331. An A3 event may mean that the signal quality of a neighboring cell is better than the signal quality of a serving cell by an offset. An A5 event may mean that the signal quality of a serving cell becomes worse than a first threshold and the signal quality of a neighboring cell becomes better than a second threshold.

[0042] After receiving the measurement configuration, the UE may perform measurement based on the measurement object and report the measurement result if a reporting criterion is met.

[0043] Step 201 is not necessary for the method according to some embodiments of the present application. It is not excluded that the source BS may decide to switch at any time at step 202. For example, the source BS may decide to switch the UE at step 202 based on the measurement result and / or radio resource management information reported from the UE.

[0044] Based on the measurement results reported from the UE, the source BS may determine at least one candidate BS from which the target BS may be selected. In the current technology, the source BS may transmit a handover request to the at least one candidate BS. However, this handover request does not consider the task of migrating to the server.

[0045] According to some embodiments of the present application, at step 203, the source BS may transmit task information associated with the UE to at least one candidate BS (eg, Figure 2 Each of the at least one candidate BS may be a NG-RAN node. For example, the candidate BS may be Figure 1 Although for simplicity Figure 2 Only one candidate BS (eg, BS 1) is illustrated in FIG. 4 , but it is considered that in some other embodiments of the present application, the number of candidate BSs may be greater than 1.

[0046] According to some embodiments of the present application, the task information may include an indicator indicating whether any task associated with the UE is being performed. The indicator may be implemented, for example, by a field having one bit.

[0047] In an embodiment of the present application, in response to at least one task being in progress as indicated by the indicator, the task information may further include an information unit. The information unit may include at least one task unit.

[0048] In some embodiments, each task unit in at least one task unit includes a server unit. The server unit may at least include an identification (ID) of a server on which the task indicated by the task unit is executed. The ID of the server may be, for example, an IP address of the server. In some other embodiments, a session may include at least one task. Therefore, each task unit in at least one task unit may include a session ID associated with the task. In some other embodiments, each task unit in at least one task unit may include at least one of the QoS or QoE requirements of the task result feedback received by the UE and the remaining running time of the task. In some other embodiments, each task unit may include the data volume and / or rate of task result feedback, the occupied resources (e.g., can be expressed as the number of virtual machines (VMs)) used for task operation and / or storage, and the data volume and / or rate of the intermediate task result transmission.

[0049] For example, FIG. 3( a ) illustrates an example of task information according to some embodiments of the present application.

[0050] Referring to FIG. 3( a ), the task information may include an indicator indicating that at least one task associated with the UE is in progress. Therefore, the task information may include an information unit. The information unit may include N task units labeled as task unit #0, task unit #1, ..., and task unit #N-1, which means that there are N tasks associated with the UE that are migrated to one or more servers, where N is a positive integer. These N tasks may be from at least one session.

[0051] Each of the task units may include an ID of a session associated with the task, a server unit indicating a server on which the task is executed, and other information of the task as described above. For example, task unit #0 may include the following information associated with the task indicated by task unit #0: an ID of a session associated with the task, a server unit indicating a server on which the task is executed, and other information as described above (e.g., QoS or QoE requirements for task result feedback to be received by the UE and the remaining running time of the task). It should be understood by those skilled in the art that "#0" may not be an ID of a task, but may refer to an index of a task in a task sequence.

[0052] In some other embodiments, the session ID and the server unit may be separated from the task unit. For example, FIG. 3( b ) illustrates an example of task information according to some embodiments of the present application.

[0053] Referring to Figure 3 (b), the task information may include an indicator indicating that at least one task associated with the UE is in progress. Therefore, the task information may include an information unit. The information unit may include N entries, which means that there are N tasks associated with the UE that are migrated to one or more servers, where N is a positive integer. Each entry may be associated with a corresponding task. For example, the first entry may include the following information associated with the task indicated by this entry: session ID#0 indicating the session ID of the session associated with the task, server unit#0 indicating the server on which the task is executed, and task unit#0 including other information of the task as described above. Similarly, the second entry may include session ID#1, server unit#1, and task unit#1 as described above. The Nth entry may include session ID#N-1, server unit#N-1, and task unit#N-1 as described above.

[0054] In another embodiment of the present application, in response to at least one task being in progress as indicated by an indicator, the task information may include an information unit. The information unit includes at least one global task ID. Each of the at least one global task ID indicates how to find the task unit of the task. That is, in this embodiment, the detailed information of the task may be stored in a specific location other than the information unit but associated with the information unit through the global task ID.

[0055] In some embodiments, the task unit includes a server unit. The server unit may at least include the ID of the server on which the task indicated by the task unit is executed. In some other embodiments, the session may include at least one task. Therefore, the task unit may include a session ID associated with the task. In some other embodiments, the task unit may include at least one of the QoS or QoE requirements of the task result feedback received by the UE and the remaining running time of the task. In some other embodiments, the task unit may include the data volume and / or rate of the task result feedback, the occupied task operation and / or storage resources (for example, can be expressed as the number of virtual machines (VMs)), and the data volume and / or rate of the intermediate task result transmission.

[0056] In some embodiments, each global task ID may include an ID of a storage node where the task units are stored, an ID of a UE associated with the task, and an ID of a session associated with the task.

[0057] For example, FIG. 3( c ) illustrates an example of task information according to some embodiments of the present application.

[0058] Referring to FIG. 3( c ), the task information may include an indicator indicating that at least one task associated with the UE is in progress. Therefore, the task information may include an information unit. The information unit may include N global task IDs labeled as global task ID#0, global task ID#1, ..., and global task ID#N-1, which means that there are N tasks associated with the UE that are migrated to one or more servers, where N is a positive integer. Each global task ID may indicate how to find the task unit of the task.

[0059] For example, global task ID #0 may include the following information associated with the task indicated by task unit #0: the ID of the storage node in which task unit #0 is stored, the ID of the UE associated with the task, and the ID of the session associated with the task. Task unit #0 may include the following information associated with the task indicated by task unit #0, such as: the server ID associated with the task, the session ID of the task, and other information as described above (e.g., the QoS or QoE requirements of the result feedback of the task received by the UE and the remaining running time of the task). It should be understood by those skilled in the art that '#0' may not be the ID of the task, but may refer to the index of the task in the task sequence.

[0060] In yet another embodiment of the present application, in response to no task being in progress as indicated by the indicator, the information unit may be empty.

[0061] According to some embodiments of the present application, the task information may be included in a message, for example, included in a HO request message.

[0062] After receiving the task information, each candidate BS may check the indicator in the task information. In response to no task being in progress as indicated by the indicator, the candidate BS may perform normal admission control, as specified in 3GPP 38.300.

[0063] In response to at least one task being in progress as indicated by the indicator, each candidate BS may transmit a request message for TRF configuration associated with the UE to the core network at step 204. The request message may include task information.

[0064] After receiving the request message for TRF configuration from each candidate BS, the core network may determine at least one candidate TRF configuration based on the task information of each candidate BS. Then, at step 205, the core network may transmit at least one candidate TRF configuration to each candidate BS. Each candidate configuration may indicate how to provide result feedback about the task to the UE via a corresponding candidate BS of at least one candidate BS.

[0065] For example, assume that a candidate BS (e.g., BS 1) may represent Figure 1101b or BS 101c shown in FIG. 101, after receiving the task information from the source BS (e.g., BS 101a), BS 1 may transmit a request message for the TRF candidate configuration to the core network. In the case where BS 1 represents BS 101b, since there is only one path (server 104a to UPF 103a to BS101b) to deliver the task result from server 104a to UE 102 via BS 101b, the core network may transmit one TRF candidate configuration indicating the above one path to BS 1.

[0066] In the case where BS1 represents BS 101c, there may be three paths to deliver the task result from server 104a to UE 102 via BS 101c. For example, the first path is from server 104a to UPF 103a to UPF 103b to BS 101c. The second path is from server 104a to UPF 103b to BS 102c. The third path may include first transferring the task executed in server 104a to server 104b as an intermediate task result and then delivering the task result obtained in server 104b to UPF 103b to BS 101c. The core network may transmit three candidate configurations of REF indicating the above three paths, respectively, to BS 1.

[0067] According to some embodiments of the present application, each candidate configuration of at least one candidate TRF configuration includes at least one TRF unit.

[0068] According to some other embodiments of the present application, each candidate configuration may have a corresponding configuration ID, and the configuration ID may be included in at least one TRF unit of the candidate configuration or may be separated from at least one TRF unit.

[0069] According to an embodiment of the present application, each TRF unit in at least one TRF unit includes an ID of a session associated with a task indicated by the TRF unit. In an embodiment, each TRF unit in at least one TRF unit includes a server unit. In some embodiments, the server unit includes at least one of an ID (e.g., an IP address) of a server on which the task indicated by the TRF unit is executed and routing information between the server and the candidate BS. In an embodiment, the routing information may include at least an end-to-end delay of a routing path between the server and the candidate BS. In another embodiment, the routing information may include information of a routing path. In another embodiment, the routing information may include node information included in the routing path.

[0070] According to another embodiment of the present application, each TRF unit may include the time when the result feedback of the task will be transmitted back from the server and the configuration for transmitting the result feedback along the routing path between the server and the candidate BS.

[0071] For example, FIG. 4( a ) illustrates an example of at least one candidate TRF configuration according to some embodiments of the present application.

[0072] Referring to FIG. 4( a ), at least one candidate TRF configuration may include N TRF candidate configurations, where N is a positive integer. Taking the candidate configuration marked by #N-1 as an example, it may include a configuration ID #N-1 indicating the candidate configuration and TRF units #0, TRF units #1, ..., TRF units #M. N-1 M N-1 TRF units. Number M N-1 is a positive integer representing the number of different tasks involved in the candidate configuration labeled as configuration ID #N-1.

[0073] Each TRF unit may include an ID of a session associated with the task indicated by the TRF unit. Each TRF unit may include a server unit. The server unit includes at least one of an ID (e.g., an IP address) of a server on which the task indicated by the TRF unit is executed and routing information between the server and the candidate BS.

[0074] For example, TRF unit #0 may include session ID #0 and server unit #0. Server unit #0 may include the ID of the server on which the task indicated by TRF unit #0 is performed (e.g., IP address) and routing information between the server and the candidate BS. Similarly, TRF unit #1 may include session ID #1 and server unit #1. Server unit #1 may include the ID of the server on which the task indicated by TRF unit #1 is performed (e.g., IP address) and routing information between the server and the candidate BS. TRF unit #M N-1 May contain session ID#M N-1 and server unit #M N-1 . Server Unit #M N-1 May include a TRF unit #M on which it is executed N-1 The ID (eg, IP address) of the server for the indicated task and the routing information between the server and the candidate BS.

[0075] Each TRF unit may also include the time when the result feedback of the task will be transmitted back from the server and the configuration for transmitting the result feedback. For example, TRF unit #0 may include the time when the result feedback of the task will be transmitted back from the server indicated by server unit #0 and the configuration for transmitting the result feedback, TRF unit #1 may include the time when the result feedback of the task will be transmitted back from the server indicated by server unit #1 and the configuration for transmitting the result feedback, and TRF unit #2 may include the time when the result feedback of the task will be transmitted back from the server indicated by server unit #2 and the configuration for transmitting the result feedback, and TRF unit #4 may include the time when the result feedback of the task will be transmitted back from the server indicated by server unit #3 and the configuration for transmitting the result feedback. N-1 The result feedback of the task can be included from the server unit #MN-1 Indicates the time when the server transmits back and the configuration used to transmit the result feedback.

[0076] In some embodiments, the server unit may be detached from the TRF unit.For example, FIG. 4( b ) illustrates an example of a candidate TRF configuration according to some embodiments of the present application.

[0077] Referring to FIG4(b), the difference between FIG4(b) and FIG4(a) is that the server unit in FIG4(b) is separated from its corresponding TRF unit. In this example, the information contained in the server unit is the same as that in FIG4(a), and the TRF unit may contain the remaining information except for the server unit in FIG4(a).

[0078] After receiving at least one candidate configuration, at step 206, each candidate BS (eg, BS 1) may perform admission control.

[0079] In addition to other operations as specified in 3GPP TS 38.300, the candidate BS may perform admission control based on at least one candidate TRF configuration to select a TRF configuration that can meet the handover requirements of the UE from the at least one candidate TRF configuration. That is, the HO request from the UE may be accepted.

[0080] After that, at step 207, each candidate BS (eg, BS 1) may transmit the selected TRF configuration to the source BS.

[0081] According to some embodiments of the present application, the selected TRF configuration may be included in a second message, such as a HO request confirmation message. In these embodiments, each candidate BS may prepare for handover with layer 1 (L1) / layer 2 (L2) and send a HO request confirmation to the source BS. The HO request confirmation message may include an RRC reconfiguration message to be delivered to the UE via the source BS to perform the handover. The selected TRF configuration may be included as part of the information in the HO request confirmation message.

[0082] After receiving at least one selected configuration of the TRF from at least one candidate BS, respectively, the source BS may determine a target BS from the at least one candidate BS based on the at least one selected configuration of the TRF at step 208. Figure 2 In the example of Figure 1 BS 1 of BS 101b is determined as the target BS for the UE to perform handover.

[0083] At step 208, the source BS may transmit an RRC reconfiguration message included in the HO request confirmation from the target BS to the UE to instruct the UE to perform a handover procedure with the target BS. According to some embodiments of the present application, the RRC reconfiguration message may include information required to access the target cell, that is, at least the target cell ID, the new cell radio network temporary identifier (C-RNTI), the target BS security algorithm identifier of the selected security algorithm, and the system information of the target cell.

[0084] At step 209, the source BS may transmit a secondary node (SN) state transfer message to the target BS.

[0085] After receiving the RRC reconfiguration message, at step 210, the UE may detach from the source BS and synchronize to the target BS.

[0086] At step 211, downlink data destined for the UE is still provided from the core network to the source BS, which forwards the data to the target BS. At step 212, the target BS buffers the data forwarded from the source BS and waits for the UE to complete the handover.

[0087] At step 213, the UE may synchronize to the target cell and complete the RRC handover procedure by sending an RRC reconfiguration complete message to the target BS. In the case of dual active protocol stack (DAPS) HO, the UE does not detach from the source cell after receiving the RRC reconfiguration message. The UE may release the source signaling radio bearer (SRB) resources of the source cell, security configuration, and stop downlink reception / uplink transmission with the source BS after receiving an explicit release from the target BS.

[0088] At step 214, the target BS (eg, BS 1) may transmit a path switch request message to the core network. The path switch request message may include the selected TRF configuration.

[0089] The target BS transmits a path switch request message to the core network to trigger the core network to switch the DL data path toward the target BS and establish an NG-C interface instance toward the target BS.

[0090] After receiving the path switch request, at step 215, the core network may perform a path switch based on the selected TRF configuration. According to some embodiments of the present application, the core network will perform a reconfiguration of the task according to the information contained in the selected TRF configuration. According to some other embodiments of the present application, the core network may switch the DL data path toward the target BS. The core network may send one or more "end markers" to the source BS on the old path per PDU session / tunnel, and then, may release any U-plane / transport network layer (TNL) resources toward the source BS.

[0091] At step 216, the core network may transmit a path switch request confirm message to the target BS as an acknowledgement of the path switch request message.

[0092] In response to receiving the path switch request confirmation message from the core network, the target BS may send a UE context release at step 217 to notify the source BS of the handover success. Then, the source BS may release the radio and control plane (C-plane) related resources associated with the UE context. Thereafter, any ongoing data forwarding may continue.

[0093] Figure 5 A simplified block diagram of a device for switching according to some embodiments of the present application is shown. Device 500 may be as follows Figure 1 The source BS (e.g., BS 101a) shown in FIG.

[0094] refer to Figure 5 , the device 500 may include at least one non-transitory computer-readable medium 502, at least one receiving circuit system 504, at least one transmitting circuit system 506, and at least one processor 508. In some embodiments of the present application, the at least one receiving circuit system 504 and the at least one transmitting circuit system 506 may be integrated into at least one transceiver. The at least one non-transitory computer-readable medium 502 may have computer-executable instructions stored therein. The at least one processor 508 may be coupled to the at least one non-transitory computer-readable medium 502, the at least one receiving circuit system 504, and the at least one transmitting circuit system 506. The computer-executable instructions may be programmed to implement a method with the at least one receiving circuit system 504, the at least one transmitting circuit system 506, and the at least one processor 508. The method may be a method according to an embodiment of the present application, for example Figure 2 The method shown in .

[0095] Figure 6 A simplified block diagram illustrating a device for switching according to some other embodiments of the present application. Device 600 may be a candidate BS (e.g., Figure 1 BS 101b and 101c shown in FIG.

[0096] refer to Figure 6, the device 600 may include at least one non-transitory computer-readable medium 602, at least one receiving circuit system 604, at least one transmitting circuit system 606, and at least one processor 608. In some embodiments of the present application, the at least one receiving circuit system 604 and the at least one transmitting circuit system 606 may be integrated into at least one transceiver. Computer executable instructions may be stored in the at least one non-transitory computer-readable medium 602. At least one processor 608 may be coupled to the at least one non-transitory computer-readable medium 602, the at least one receiving circuit system 604, and the at least one transmitting circuit system 606. The computer executable instructions may be programmed to implement a method with the at least one receiving circuit system 604, the at least one transmitting circuit system 606, and the at least one processor 608. The method may be a method according to an embodiment of the present application, for example Figure 2 The method shown in .

[0097] Figure 7 A simplified block diagram of a device for switching according to some other embodiments of the present application is shown. Device 600 may be a core network (e.g., Figure 1 106 shown in FIG.

[0098] refer to Figure 7 , the device 700 may include at least one non-transitory computer-readable medium 702, at least one receiving circuit system 704, at least one transmitting circuit system 706, and at least one processor 708. In some embodiments of the present application, the at least one receiving circuit system 704 and the at least one transmitting circuit system 706 may be integrated into at least one transceiver. Computer executable instructions may be stored in the at least one non-transitory computer-readable medium 702. At least one processor 708 may be coupled to the at least one non-transitory computer-readable medium 702, the at least one receiving circuit system 704, and the at least one transmitting circuit system 706. The computer executable instructions may be programmed to implement a method with the at least one receiving circuit system 704, the at least one transmitting circuit system 706, and the at least one processor 708. The method may be a method according to an embodiment of the present application, for example Figure 2 The method shown in .

[0099] The method according to the embodiments of the present disclosure may also be implemented on a programmed processor. However, the controller, flow chart and module may also be implemented on a general or special purpose computer, a programmed microprocessor or microcontroller and peripheral integrated circuit elements, an integrated circuit, a hardware electronic or logic circuit (such as a discrete element circuit), a programmable logic device or the like. In general, any device residing on a finite state machine capable of implementing the flow chart shown in the figure can be used to implement the processor functions of the present application. For example, an embodiment of the present application provides a device for speech emotion recognition, which includes a processor and a memory. Computer programmable instructions for implementing the method for speech emotion recognition are stored in a memory, and the processor is configured to execute computer programmable instructions for implementing the method for speech emotion recognition. The method may be the method described above or other methods according to the embodiments of the present application.

[0100] Alternative embodiments preferably implement the method according to the embodiments of the present application in a non-transitory computer-readable storage medium storing computer programmable instructions. The instructions are preferably executed by a computer executable component that is preferably integrated with a network security system. The non-transitory computer-readable storage medium may be stored on any suitable computer-readable medium, such as RAM, ROM, flash memory, EEPROM, optical storage device (CD or DVD), hard drive, floppy disk drive, or any suitable device. The computer executable component is preferably a processor, but the instructions may be executed alternatively or additionally by any suitable dedicated hardware device. For example, an embodiment of the present disclosure provides a non-transitory computer-readable storage medium having computer programmable instructions stored therein. The computer programmable instructions are configured to implement the method of speech emotion recognition described above or other methods according to the embodiments of the present application.

[0101] Although the present application has been described with reference to the specific embodiments of the present application, it is apparent that many substitutions, modifications and variations may be apparent to those skilled in the art. For example, the various components of the embodiments may be interchanged, added or substituted in other embodiments. Moreover, all elements of each figure are not necessary for the operation of the disclosed embodiments. For example, a person skilled in the art of the disclosed embodiments will be able to make and use the teachings of the present application by only adopting the elements of the independent claims. Therefore, the embodiments of the present application set forth herein are intended to be illustrative rather than restrictive. Various changes may be made without departing from the spirit and scope of the present application.

Claims

1. A device for switching, comprising: at least one non-transitory computer-readable medium having computer-executable instructions stored therein; at least one receiver; at least one transmitter; and at least one processor coupled to the at least one non-transitory computer-readable medium, the at least one receiver, and the at least one transmitter; wherein the computer executable instructions cause the at least one processor to: transmitting task information associated with a user equipment (UE), wherein the task information includes an indicator indicating whether any task of the UE is in progress; and In a case where at least one task is in progress as indicated by the indicator, at least one task result feedback (TRF) configuration associated with the UE is received from at least one candidate base station (BS), wherein each configuration indicates how to provide result feedback regarding at least one task to the UE via a corresponding candidate BS of the at least one candidate BS. 2 . The apparatus of claim 1 , wherein in a case where at least one task is in progress as indicated by the indicator, the task information further comprises an information unit, wherein the information unit comprises at least one task unit.

3. The apparatus according to claim 2, wherein: Each of the at least one task unit comprises a server unit, wherein the server unit comprises at least an identification (ID) of a server; and Each of the at least one task unit includes at least one of a quality of service (QoS) or quality of experience (QoE) requirement for feedback of a result of the task received by the UE and a remaining running time of the task.

4. An apparatus according to claim 1, wherein, in a case where at least one task is in progress as indicated by the indicator, the task information further includes an information unit, wherein the information unit includes at least one global task ID, wherein each of the at least one global task ID indicates how to find a task unit of a task, wherein each global task ID includes an ID of a storage node in which the task unit is stored, an ID of the UE associated with the task, and an ID of a session associated with the task.

5. The apparatus of claim 1, wherein the task information is included in a handover (HO) request message and each of the at least one TRF configuration is received in a HO request acknowledgement from the corresponding candidate BS.

6. The apparatus of claim 1, wherein the computer-executable instructions cause the at least one processor to: determining a target BS from the at least one candidate BS based on the at least one TRF configuration; and A radio resource control (RRC) reconfiguration message is transmitted to the UE to instruct the UE to perform a handover procedure with the target BS.

7. A device for switching, comprising: at least one non-transitory computer-readable medium having computer-executable instructions stored therein; at least one receiver; at least one transmitter; and at least one processor coupled to the at least one non-transitory computer-readable medium, the at least one receiver, and the at least one transmitter; wherein the computer executable instructions cause the at least one processor to: receiving task information associated with a user equipment (UE), wherein the task information includes an indicator indicating whether any task of the UE is in progress; In a case where at least one task is ongoing as indicated by the indicator, transmitting a request message for a task result feedback (TRF) configuration associated with the UE, wherein the request message includes the task information; as well as At least one candidate TRF configuration associated with the UE is received, wherein each configuration indicates how to provide result feedback regarding at least one task to the UE via a candidate base station (BS).

8. The apparatus of claim 7, wherein each of the at least one candidate TRF configuration comprises at least one TRF unit, wherein each of the at least one TRF unit comprises a server unit, and wherein the server unit comprises at least one of an ID of a server and routing information between the server and the candidate BS.

9. The apparatus of claim 8, wherein each TRF unit includes a time at which result feedback of a task is to be transmitted back from a server and a configuration for transmitting the result feedback along a routing path between the server and the candidate BS.

10. The apparatus of claim 7, wherein, in a case where at least one task is in progress as indicated by the indicator, the task information further comprises an information unit, wherein the information unit comprises at least one task unit, wherein each of the at least one task unit comprises a server unit, wherein the server unit comprises at least an identification (ID) of a server, wherein each of the at least one task unit comprises at least one of a quality of service (QoS) or quality of experience (QoE) requirement for feedback of a result of the task received by the UE and a remaining running time of the task.

11. An apparatus according to claim 7, wherein, in a case where at least one task is in progress as indicated by the indicator, the task information further includes an information unit, wherein the information unit includes at least one global task ID, wherein each of the at least one global task ID indicates how to find a task unit of a task, wherein each global task ID includes an ID of a storage node in which the task unit is stored, an ID of the UE associated with the task, and an ID of a session associated with the task.

12. The apparatus of claim 7, wherein: The task information is included in a handover (HO) request message; and The computer executable instructions cause the at least one processor to: receiving at least one candidate TRF configuration associated with the UE; performing admission control based on the at least one candidate TRF configuration to select a TRF configuration that can satisfy the handover requirement from the at least one candidate TRF configuration; and The selected TRF configuration is transmitted in the HO Request Acknowledgement.

13. A device for switching, comprising: at least one non-transitory computer-readable medium having computer-executable instructions stored therein; at least one receiver; at least one transmitter; and at least one processor coupled to the at least one non-transitory computer-readable medium, the at least one receiver, and the at least one transmitter; wherein the computer executable instructions are programmed to cause the at least one processor to: receiving a request message for a task result feedback (TRF) configuration associated with a user equipment (UE), wherein the request message includes task information associated with the UE, wherein the task information includes an indicator indicating whether any task of the UE is in progress; In a case where at least one task is ongoing as indicated by the indicator, determining at least one candidate TRF configuration based on the task information; and The at least one candidate TRF configuration is transmitted, wherein each configuration indicates how to provide result feedback on at least one task to the UE via a candidate base station (BS).

14. An apparatus according to claim 13, wherein, in a case where at least one task is in progress as indicated by the indicator, the task information further comprises an information unit, wherein the information unit comprises at least one task unit, wherein each of the at least one task unit comprises a server unit, wherein the server unit comprises at least an identification (ID) of a server.

15. An apparatus according to claim 13, wherein, in a case where at least one task is in progress as indicated by the indicator, the task information further includes an information unit, wherein the information unit includes at least one global task ID, wherein each of the at least one global task ID indicates how to find a task unit of a task, wherein each global task ID includes an ID of a storage node in which the task unit is stored, an ID of the UE associated with the task, and an ID of a session associated with the task.

16. The apparatus of claim 13, wherein each of the at least one candidate TRF configuration comprises at least one TRF unit, wherein each of the at least one TRF unit comprises a server unit, wherein the server unit comprises at least one of an ID of a server and routing information between the server and the candidate BS.

17. The apparatus of claim 16, wherein each of the at least one TRF unit includes a time at which result feedback of a task is to be transmitted back from a server and a configuration for transmitting the result feedback along a routing path between the server and the candidate BS.

18. The apparatus of claim 13, wherein the computer executable instructions cause the at least one processor to: receiving a path switch request message, wherein the path switch request message includes a selected TRF configuration of the at least one candidate TRF configuration; and Path switching is performed based on the selected TRF configuration.

Images