CN116074921A - Network slice connection method, device, equipment and medium - Google Patents

Network slice connection method, device, equipment and medium Download PDF

Info

Publication number
CN116074921A
CN116074921A CN202111286316.8A CN202111286316A CN116074921A CN 116074921 A CN116074921 A CN 116074921A CN 202111286316 A CN202111286316 A CN 202111286316A CN 116074921 A CN116074921 A CN 116074921A
Authority
CN
China
Prior art keywords
list
network slice
application
pdu session
connection
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202111286316.8A
Other languages
Chinese (zh)
Inventor
郭晓珍
刁继群
向颖欣
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Samsung Guangzhou Mobile R&D Center
Samsung Electronics Co Ltd
Original Assignee
Samsung Guangzhou Mobile R&D Center
Samsung Electronics Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Samsung Guangzhou Mobile R&D Center, Samsung Electronics Co Ltd filed Critical Samsung Guangzhou Mobile R&D Center
Priority to CN202111286316.8A priority Critical patent/CN116074921A/en
Priority to PCT/KR2022/016575 priority patent/WO2023080542A1/en
Publication of CN116074921A publication Critical patent/CN116074921A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/248—Connectivity information update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W48/00—Access restriction; Network selection; Access point selection
    • H04W48/18—Selecting a network or a communication service
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/302—Route determination based on requested QoS
    • H04L45/306—Route determination based on the nature of the carried application
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/80—Ingress point selection by the source endpoint, e.g. selection of ISP or POP
    • H04L45/85—Selection among different networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/80—Ingress point selection by the source endpoint, e.g. selection of ISP or POP
    • H04L45/85—Selection among different networks
    • H04L45/851—Dynamic network selection or re-selection, e.g. after degradation of quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W76/00—Connection management
    • H04W76/10—Connection setup
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W48/00—Access restriction; Network selection; Access point selection
    • H04W48/16—Discovering, processing access restriction or access information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W76/00—Connection management
    • H04W76/10—Connection setup
    • H04W76/12—Setup of transport tunnels

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Quality & Reliability (AREA)
  • Computer And Data Communications (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The disclosure relates to a network slice connection method, a device, equipment and a medium, wherein the network slice connection method comprises the following steps: acquiring a first list, wherein the first list is a terminal routing rule URSP list issued by a network; based on the application actually installed in the terminal, performing reduction processing on the first list to obtain a second list; based on the second list, a connection is established with the network slice.

Description

Network slice connection method, device, equipment and medium
Technical Field
The present disclosure relates to the field of mobile communications, and more particularly, to a network slice connection method, apparatus, device, and medium.
Background
Under the 5G (5 th Generation Mobile Communication Technology, fifth generation mobile communication technology) network architecture, operators meet different requirements of users in different industries on network capabilities through network slicing, and various applications can sign up the network slicing capabilities with the operators. The terminal connects the network slices by creating a PDU session (Protocol Data Unit session, PDU session) for the application. But currently it generally takes a long time to apply a connection network slice.
Disclosure of Invention
The present disclosure provides a network slice connection method, apparatus, device and medium, which at least solve the above-mentioned problems in the related art, or may not solve any of the above-mentioned problems.
According to a first aspect of an embodiment of the present disclosure, there is provided a network slice connection method, including: acquiring a first list, wherein the first list is a terminal routing rule URSP list issued by a network; based on the application actually installed in the terminal, performing reduction processing on the first list to obtain a second list; based on the second list, a connection is established with the network slice.
Optionally, the reducing the first list based on the application actually installed in the terminal to obtain a second list includes: querying URSP information corresponding to the application which is actually installed from the first list; the second list is generated based on the urs information corresponding to the actually installed applications.
Optionally, after obtaining the second list, further comprising: and according to a preset rule, performing sequencing optimization processing on the second list.
Optionally, the sorting optimization processing for the second list according to a preset rule includes: and carrying out the sorting optimization processing according to at least one of the use frequency, the use priority, the data traffic ranking and the network application ranking of the actually installed application.
Optionally, the method further comprises: and updating the second list when the application actually installed in the terminal changes.
Optionally, the updating the second list includes at least one of: inquiring URSP information corresponding to the new application from the first list when the new application is installed in the terminal, and adding the URSP information corresponding to the new application to the second list; when an application of the applications actually installed in the terminal is deleted, deleting the URSP information corresponding to the deleted application from the second list.
Optionally, the method further comprises: and when the URSP list issued by the network is updated, selectively updating the second list.
Optionally, the selectively updating the second list includes: checking the updated urs list and the first list; if the verification results are inconsistent, the updated URSP list is stored as a new first list; comparing the second list with the new first list; and updating the items needing to be updated in the second list under the condition that the items needing to be updated exist in the second list.
Optionally, the establishing a connection with a network slice based on the second list includes: in response to a request from a user to open a first application, looking up traffic descriptors matching first features of the first application from the second list to obtain first routing descriptors of the first application; matching an existing PDU session by the first routing descriptor in case the first routing descriptor is obtained from the second list; when a first PDU session corresponding to the first routing descriptor is matched from the existing PDU sessions, establishing connection with a network slice through the first PDU session; when the first PDU session corresponding to the first routing descriptor is not matched from the existing PDU sessions, a first PDU session creation request is initiated through the first routing descriptor, and a connection is established with a network slice through the successfully created first PDU session.
Optionally, the establishing a connection with a network slice based on the second list further includes: matching an existing PDU session by a default second routing descriptor in the second list in the case that the first routing descriptor is not acquired from the second list; when a second PDU session corresponding to the second routing descriptor is matched from the existing PDU sessions, establishing connection with a network slice through the second PDU session; and when the second PDU session corresponding to the second routing descriptor is not matched from the existing PDU sessions, initiating a second PDU session creation request through the second routing descriptor, and establishing connection with a network slice through the successfully created second PDU session.
According to a second aspect of embodiments of the present disclosure, there is provided a network slice connection device, comprising: an acquisition unit configured to: acquiring a first list, wherein the first list is a terminal routing rule URSP list issued by a network; a processing unit configured to: based on the application actually installed in the terminal, performing reduction processing on the first list to obtain a second list; a connection unit configured to: and establishing a connection with the target network slice based on the second list.
Optionally, the processing unit may be configured to: querying URSP information corresponding to the application which is actually installed from the first list; the second list is generated based on the urs information corresponding to the actually installed applications.
Optionally, the method further comprises a ranking optimization unit, which may be configured to: and according to a preset rule, performing sequencing optimization processing on the second list.
Alternatively, the ranking optimization unit may be configured to: and carrying out the sorting optimization processing according to at least one of the use frequency, the use priority, the data traffic ranking and the network application ranking of the actually installed application.
Optionally, the method further comprises a first updating unit, the first updating unit being configurable to: and updating the second list when the application actually installed in the terminal changes.
Optionally, the first updating unit may be configured to: inquiring URSP information corresponding to a new application from the first list when the new application is installed in the terminal, and adding the URSP information of the new application to the second list; when an application of the applications actually installed in the terminal is deleted, deleting the URSP information corresponding to the deleted application from the second list.
Optionally, the method further comprises a second updating unit, the second updating unit being configurable to: and when the URSP list issued by the network is updated, selectively updating the second list.
Optionally, the second updating unit may be configured to: checking the updated urs list and the first list; if the verification results are inconsistent, the updated URSP list is stored as a new first list; comparing the second list with the new first list; and updating the items needing to be updated in the second list under the condition that the items needing to be updated exist in the second list.
Alternatively, the connection unit may be configured to: in response to a request from a user to open a first application, looking up traffic descriptors matching first features of the first application from the second list to obtain first routing descriptors of the first application; matching an existing PDU session by the first routing descriptor in case the first routing descriptor is obtained from the second list; when a first PDU session corresponding to the first routing descriptor is matched from the existing PDU sessions, establishing connection with a network slice through the first PDU session; when the first PDU session corresponding to the first routing descriptor is not matched from the existing PDU sessions, a first PDU session creation request is initiated through the first routing descriptor, and a connection is established with a network slice through the successfully created first PDU session.
Optionally, the connection unit may be further configured to: matching an existing PDU session by a default second routing descriptor in the second list in the case that the first routing descriptor is not acquired from the second list; when a second PDU session corresponding to the second routing descriptor is matched from the existing PDU sessions, establishing connection with a network slice through the second PDU session; and when the second PDU session corresponding to the second routing descriptor is not matched from the existing PDU sessions, initiating a second PDU session creation request through the second routing descriptor, and establishing connection with a network slice through the successfully created second PDU session.
According to a third aspect of embodiments of the present disclosure, there is provided an electronic device, comprising: at least one processor; at least one memory storing computer-executable instructions, wherein the computer-executable instructions, when executed by the at least one processor, cause the at least one processor to perform a network slice connection method according to the present disclosure.
According to a fourth aspect of embodiments of the present disclosure, there is provided a computer-readable storage medium, which when executed by at least one processor, causes the at least one processor to perform a network slice connection method according to the present disclosure.
The technical scheme provided by the embodiment of the disclosure at least brings the following beneficial effects:
according to the network slice matching method and device, the terminal routing rule URSP list issued by the network is subjected to reduction processing through the application actually installed in the terminal, so that the data size of the terminal routing rule URSP list can be greatly reduced, when the application in the terminal is connected with the network slice, the corresponding RSD information can be matched by inquiring the terminal routing rule URSP list subjected to reduction processing, and then PDU session is created to establish connection with the network slice, so that the inquiry time can be shortened to a certain extent, the connection time of the application and the network slice can be shortened, and the connection process can be accelerated.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the disclosure and together with the description, serve to explain the principles of the disclosure and do not constitute an undue limitation on the disclosure.
Fig. 1 is a flowchart illustrating a network slice connection method according to an exemplary embodiment of the present disclosure.
Fig. 2 is a schematic diagram illustrating a generation process of a second list according to an exemplary embodiment of the present disclosure.
Fig. 3 is a block diagram illustrating a network slice connection apparatus according to an exemplary embodiment of the present disclosure.
Fig. 4 is a block diagram illustrating an electronic device 400 according to an exemplary embodiment of the present disclosure.
Detailed Description
In order to enable those skilled in the art to better understand the technical solutions of the present disclosure, the technical solutions of the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings.
It should be noted that the terms "first," "second," and the like in the description and claims of the present disclosure and in the foregoing figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the disclosure described herein may be capable of operation in sequences other than those illustrated or described herein. The embodiments described in the examples below are not representative of all embodiments consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with some aspects of the present disclosure as detailed in the accompanying claims.
It should be noted that, in this disclosure, "at least one of the items" refers to a case where three types of juxtaposition including "any one of the items", "a combination of any of the items", "an entirety of the items" are included. For example, "including at least one of a and B" includes three cases side by side as follows: (1) comprises A; (2) comprising B; (3) includes A and B. For example, "at least one of the first and second steps is executed", that is, three cases are juxtaposed as follows: (1) performing step one; (2) executing the second step; (3) executing the first step and the second step.
Under the 5G network architecture, operators meet different requirements of users in different industries on network capabilities through network slicing, and various applications can sign up the network slicing capabilities with the operators. The terminal connects the network slices by creating a PDU session (Protocol Data Unit session, PDU session) for the application.
The application request to create a PDU session requires RSD (Route selection descriptor, routing descriptor) information, while the acquisition of RSD information requires matching TDs (Traffic descriptor, traffic descriptors/traffic descriptors) in the list of urs (UE route selection policy, terminal routing rules) through the characteristics of the application (e.g. APP ID). However, the process of matching TDs from the urs list is typically time consuming, resulting in a long time consuming connection process of the application to the network slice, affecting the user experience. For example, when a user opens an application in a terminal and the application tries to connect to a network slice, firstly, a corresponding TD is queried from a terminal routing rule urs list by using its feature (for example, APP ID (identity of application)), then a corresponding RSD is acquired according to the corresponding TD, and then a subsequent network connection can be performed.
In order to reduce the connection time consumption of an application and a network slice, the present disclosure provides a network slice connection method and a device, specifically, by using an application actually installed in a terminal, a terminal routing rule urs list issued by a network is subjected to reduction processing, so that the data volume of the terminal routing rule urs list can be greatly reduced. Hereinafter, a network slice connection method and apparatus according to an exemplary embodiment of the present disclosure will be described in detail with reference to fig. 1 to 4.
Fig. 1 is a flowchart illustrating a network slice connection method according to an exemplary embodiment of the present disclosure.
Referring to fig. 1, in step 101, a first list may be acquired, where the first list is a list of terminal routing rules urs issued by the network.
According to an exemplary embodiment of the present disclosure, the first list is obtained by a terminal (e.g., a smartphone, tablet, computer, etc., a networkable device). After the terminal successfully registers to the 5G network, the network will issue a terminal routing rule URSP list to the terminal, and the terminal can store the URSP list as a first list. In other embodiments, the urs list may also be preset in the terminal.
In step 102, the first list may be subjected to a reduction process based on the application actually installed in the terminal, to obtain a second list.
According to an exemplary embodiment of the present disclosure, the urs information corresponding to the actually installed applications may be queried from the first list, and the second list may be generated based on the urs information corresponding to the actually installed applications. Specifically, the terminal may create a blank second list, query the first list for the urs p information of the application (e.g., including the TDs and RSDs corresponding to the application) through the features (e.g., APP IDs) of the actually installed applications, save the queried urs p information of the application in the blank second list, and each actually installed application performs the query process, to finally obtain the second list including the urs p information corresponding to all actually installed applications. In other embodiments, the urs information corresponding to the applications that are not actually installed in the first list may be deleted, and then a list including only the urs information corresponding to the applications that are actually installed may be stored as the second list. In addition, not every application has corresponding urs information (e.g., an application has not signed up with an operator, etc.), so default urs information also exists in the first list so that applications without corresponding urs information can establish network slice connections, and thus default urs information is also saved in the second list.
According to the exemplary embodiment of the disclosure, after the second list is obtained, the second list is further subjected to sorting optimization processing according to a preset rule, so that the time for establishing connection between the application and the network slice is further shortened. Here, the ranking optimization process may be performed according to at least one of a frequency of use, a priority of use, a data traffic ranking, and a network application ranking of the applications that have been actually installed. In particular, applications in the second list may be ranked according to their data traffic ranks or network application ranks (e.g., ranked in order of low to high data traffic consumption, or ranked in order of high to low network application ranks, etc.), and sometimes, the user may have a priority of use for the same type of application, or may use some applications more frequently, so that applications with high frequency of use or high priority of use may be ranked at the head position in the second list, and in a query manner in which a search is performed item-by-item from the first item of the second list, applications with high frequency of use or high priority of use may be more quickly matched to corresponding RSDs, thereby establishing a connection with a network slice more quickly. In some embodiments, the actual installed applications have been prioritized, so the first list may be downscaled directly according to the prioritized order, so the resulting second list itself has a prioritized order, and no further prioritization optimization is required.
Fig. 2 is a schematic diagram illustrating a generation process of a second list according to an exemplary embodiment of the present disclosure.
Referring to fig. 2, a urs table a corresponds to a first list, a urs table B corresponds to a second list, and an application table in the middle of the urs table a and the urs table B corresponds to an application actually installed in the terminal. The URSP table a includes a TD information field and an RSD information field, the TD information field mainly includes an APP ID (i.e., an application name) and a priority (for example, obtained according to a frequency of use, a priority of use, a data traffic ranking, and a network application ranking of the application), when the second list is generated, the corresponding TD is obtained from the urs table a according to the APP ID (for example, APP id=an aiqi technology) of the installed application, and the RSD information corresponding to the TD (for example, for the aiqi technology, two RSDs are corresponding to the application, which may be selected according to a priority order from high to low) is stored in the urs table B.
According to an exemplary embodiment of the present disclosure, the second list may be updated when an application actually installed in the terminal changes. Specifically, when a new application is installed in the terminal, querying the first list for the urs information corresponding to the new application, and adding the urs information corresponding to the new application to the second list; and when the application in the applications actually installed in the terminal is deleted, deleting the URSP information corresponding to the deleted application from the second list so that the second list always comprises the corresponding URSP information of all the applications in the terminal.
According to an exemplary embodiment of the present disclosure, the second list may be selectively updated when the network-delivered urs list is updated. Specifically, when the terminal registers in a new area or when there is an update in the urs list in the network (e.g., there is a new application subscribed with the operator, etc.), the network will issue an updated urs list to the terminal, at this time, the updated urs list may be compared with the first list, and if a discrepancy occurs, the discrepancy is updated into the second list, so that the urs information in the second list is synchronized with the latest urs information. Specifically, the updated urs list and the first list may be checked, and if the check results are inconsistent, the updated urs list is saved as a new first list, and then the second list is compared with the new first list, and if there is an item requiring update in the second list, the item requiring update in the second list is updated. Here, a hash algorithm, such as, but not limited to, MD4 (Message Digest), MD5, SHA-1 (Secure Hash Algorithm ), etc., may be employed to calculate the check values of the updated URSP list and the first list, if the check values of the two are consistent, no update is required for the second list, if the check values of the two are inconsistent, the updated URSP list is overlaid on the first list, and then the overlaid first list is dematched with the second list, and if an update item is present, the update item is updated into the second list.
Referring back to fig. 1, at step 203, a connection may be established with the network slice based on the second list.
According to the exemplary embodiments of the present disclosure, when a terminal establishes a connection with a network slice, corresponding urs information (i.e., network slice information) is queried from a second list to establish a connection, and since the second list is subjected to a reduction process, the amount of data is greatly reduced, and the connection time with the network slice can be shortened to some extent. In particular, the terminal may search for a Traffic Descriptor (TD) matching a first feature (e.g., APP ID) of a first application from a second list to obtain a first routing descriptor (RSD) of the first application in response to a request from a user to open the first application. Here, when the applications in the second list are ranked according to the priority of the applications or the frequency of use, etc., the search may be performed item by item from the first item of the second list to query the corresponding urs information of the applications, or the keywords (for example, APP ID, etc.) may be hashed to quickly query the corresponding urs information by searching the hash table. Upon querying from the second list, two situations may occur: first, the first routing descriptor is acquired from the second list, at this time, an existing PDU session can be matched through the first routing descriptor, when a first PDU session corresponding to the first routing descriptor is matched from the existing PDU sessions, a connection is established with a network slice through the first PDU session, and when a first PDU session corresponding to the first routing descriptor is not matched from the existing PDU sessions, a first PDU session creation request is initiated through the first routing descriptor, and a connection is established with the network slice through the first PDU session which is successfully created; secondly, the first routing descriptor is not acquired from the second list, and at the moment, the existing PDU session can be matched through the default second routing descriptor in the second list; when a second PDU session corresponding to the second routing descriptor is matched from the existing PDU sessions, a connection is established with the network slice through the second PDU session, and when the second PDU session corresponding to the second routing descriptor is not matched from the existing PDU sessions, a second PDU session creation request is initiated through the second routing descriptor, and a connection is established with the network slice through the second PDU session which is successfully created.
Fig. 3 is a block diagram illustrating a network slice connection apparatus according to an exemplary embodiment of the present disclosure.
Referring to fig. 3, a network slice connection apparatus 300 according to an exemplary embodiment of the present disclosure may include an acquisition unit 301, a processing unit 302, and a connection unit 303.
The obtaining unit 301 may obtain a first list, where the first list is a terminal routing rule urs list issued by the network; the processing unit 302 may perform reduction processing on the first list based on the application actually installed in the terminal, to obtain a second list; the connection unit 303 may establish a connection with the target network slice based on the second list.
According to an example embodiment of the present disclosure, the processing unit 302 may query the first list for the urs information corresponding to the actually installed applications and generate the second list based on the urs information corresponding to the actually installed applications.
According to an exemplary embodiment of the present disclosure, the network slice connection device 300 further includes a ranking optimization unit 304 (not shown in fig. 3), and the ranking optimization unit 304 may perform ranking optimization processing on the second list according to a preset rule, in particular, may perform ranking optimization processing according to at least one of a frequency of use, a priority of use, a data traffic ranking, and a network application ranking of an application that is actually installed.
According to an exemplary embodiment of the present disclosure, the network slice connection apparatus 300 further includes a first updating unit 305 (not shown in fig. 3), and the first updating unit 305 may update the second list when an application actually installed in the terminal changes, and in particular, may query the first list for urs information corresponding to a new application when the new application is installed in the terminal, and add the urs information of the new application to the second list; and deleting the urs information corresponding to the deleted applications from the second list when an application among applications actually installed in the terminal is deleted.
According to an exemplary embodiment of the present disclosure, the network slice connection device 300 further includes a second updating unit 306 (not shown in fig. 3), and the second updating unit 306 may selectively update the second list when the ossp list issued by the network is updated, specifically, may check the updated ossp list and the first list, save the updated ossp list as a new first list if the check result is inconsistent, and compare the second list with the new first list, and update items requiring update in the second list if there are items requiring update in the second list.
According to an exemplary embodiment of the present disclosure, the connection unit 303 may search for a traffic descriptor matching a first feature of a first application from a second list to obtain a first routing descriptor of the first application in response to a request from a user to open the first application. At this time, if the first routing descriptor is acquired from the second list, the existing PDU session is matched by the first routing descriptor: when a first PDU session corresponding to a first routing descriptor is matched from the existing PDU sessions, establishing a connection with a network slice through the first PDU session; when a first PDU session corresponding to the first routing descriptor is not matched from the existing PDU sessions, a first PDU session creation request is initiated through the first routing descriptor, and a connection is established with the network slice through the successfully created first PDU session. If the first routing descriptor is not obtained from the second list, matching the already existing PDU session by default the second routing descriptor in the second list: when a second PDU session corresponding to a second routing descriptor is matched from the existing PDU sessions, establishing connection with the network slice through the second PDU session; when a second PDU session corresponding to the second routing descriptor is not matched from the existing PDU sessions, a second PDU session creation request is initiated through the second routing descriptor, and a connection is established with the network slice through the creation of a successful second PDU session.
Fig. 4 is a block diagram of an electronic device 400 according to an exemplary embodiment of the present disclosure.
Referring to fig. 4, an electronic device 400 includes at least one memory 401 and at least one processor 402, the at least one memory 401 having stored therein a set of computer-executable instructions that, when executed by the at least one processor 402, perform a network slice connection method according to an exemplary embodiment of the present disclosure.
By way of example, electronic device 400 may be a PC computer, tablet device, personal digital assistant, smart phone, or other device capable of executing the above-described set of instructions. Here, the electronic device 400 is not necessarily a single electronic device, but may be any apparatus or a collection of circuits capable of executing the above-described instructions (or instruction sets) individually or in combination. The electronic device 400 may also be part of an integrated control system or system manager, or may be configured as a portable electronic device that interfaces with either locally or remotely (e.g., via wireless transmission).
In electronic device 400, processor 402 may include a Central Processing Unit (CPU), a Graphics Processor (GPU), a programmable logic device, a special purpose processor system, a microcontroller, or a microprocessor. By way of example, and not limitation, processors may also include analog processors, digital processors, microprocessors, multi-core processors, processor arrays, network processors, and the like.
The processor 402 may execute instructions or code stored in the memory 401, wherein the memory 401 may also store data. The instructions and data may also be transmitted and received over a network via a network interface device, which may employ any known transmission protocol.
The memory 401 may be integrated with the processor 402, for example, RAM or flash memory is arranged within an integrated circuit microprocessor or the like. In addition, the memory 401 may include a separate device, such as an external disk drive, a storage array, or other storage device that may be used by any database system. The memory 401 and the processor 402 may be operatively coupled or may communicate with each other, for example, through an I/O port, a network connection, etc., so that the processor 402 can read files stored in the memory.
In addition, electronic device 400 may also include a video display (such as a liquid crystal display) and a user interaction interface (such as a keyboard, mouse, touch input device, etc.). All components of electronic device 400 may be connected to each other via a bus and/or a network.
According to an exemplary embodiment of the present disclosure, a computer-readable storage medium storing instructions may also be provided, wherein the instructions, when executed by at least one processor, cause the at least one processor to perform a network slice connection method according to the present disclosure. Examples of the computer readable storage medium herein include: read-only memory (ROM), random-access programmable read-only memory (PROM), electrically erasable programmable read-only memory (EEPROM), random-access memory (RAM), dynamic random-access memory (DRAM), static random-access memory (SRAM), flash memory, nonvolatile memory, CD-ROM, CD-R, CD + R, CD-RW, CD+RW, DVD-ROM, DVD-R, DVD + R, DVD-RW, DVD+RW, DVD-RAM, BD-ROM, BD-R, BD-R LTH, BD-RE, blu-ray or optical disk storage, hard Disk Drives (HDD), solid State Disks (SSD), card memory (such as multimedia cards, secure Digital (SD) cards or ultra-fast digital (XD) cards), magnetic tape, floppy disks, magneto-optical data storage, hard disks, solid state disks, and any other means configured to store computer programs and any associated data, data files and data structures in a non-transitory manner and to provide the computer programs and any associated data, data files and data structures to a processor or computer to enable the processor or computer to execute the programs. The computer programs in the computer readable storage media described above can be run in an environment deployed in a computer device, such as a client, host, proxy device, server, etc., and further, in one example, the computer programs and any associated data, data files, and data structures are distributed across networked computer systems such that the computer programs and any associated data, data files, and data structures are stored, accessed, and executed in a distributed fashion by one or more processors or computers.
According to the network slice matching method and device, the terminal routing rule URSP list issued by the network is subjected to reduction processing through the application actually installed in the terminal, so that the data size of the terminal routing rule URSP list can be greatly reduced, when the application in the terminal is connected with the network slice, the corresponding RSD information can be matched by inquiring the terminal routing rule URSP list subjected to reduction processing, and then PDU session is created to establish connection with the network slice, so that the inquiry time can be shortened to a certain extent, the connection time of the application and the network slice can be shortened, and the connection process can be accelerated.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any adaptations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It is to be understood that the present disclosure is not limited to the precise arrangements and instrumentalities shown in the drawings, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims (22)

1. A network slice connection method, comprising:
acquiring a first list, wherein the first list is a terminal routing rule URSP list issued by a network;
based on the application actually installed in the terminal, performing reduction processing on the first list to obtain a second list;
based on the second list, a connection is established with the network slice.
2. The network slice connection method as claimed in claim 1, wherein the performing the reduction process on the first list based on the application actually installed in the terminal to obtain the second list comprises:
querying URSP information corresponding to the application which is actually installed from the first list;
the second list is generated based on the urs information corresponding to the actually installed applications.
3. The network slice connection method of claim 1, further comprising, after obtaining the second list:
and according to a preset rule, performing sequencing optimization processing on the second list.
4. The network slice connection method as claimed in claim 3, wherein said performing a ranking optimization process on the second list according to a preset rule includes:
and carrying out the sorting optimization processing according to at least one of the use frequency, the use priority, the data traffic ranking and the network application ranking of the actually installed application.
5. The network slice connection method of claim 1, further comprising:
and updating the second list when the application actually installed in the terminal changes.
6. The network slice connection method of claim 5, wherein the updating the second list comprises at least one of:
inquiring URSP information corresponding to the new application from the first list when the new application is installed in the terminal, and adding the URSP information corresponding to the new application to the second list;
when an application of the applications actually installed in the terminal is deleted, deleting the URSP information corresponding to the deleted application from the second list.
7. The network slice connection method of claim 1, further comprising:
and when the URSP list issued by the network is updated, selectively updating the second list.
8. The network slice connection method of claim 7, wherein the selectively updating the second list comprises:
checking the updated urs list and the first list;
if the verification results are inconsistent, the updated URSP list is stored as a new first list;
comparing the second list with the new first list;
and updating the items needing to be updated in the second list under the condition that the items needing to be updated exist in the second list.
9. The network slice connection method of claim 1, wherein the establishing a connection with a network slice based on the second list comprises:
in response to a request from a user to open a first application, looking up traffic descriptors matching first features of the first application from the second list to obtain first routing descriptors of the first application;
matching an existing PDU session by the first routing descriptor in case the first routing descriptor is obtained from the second list;
when a first PDU session corresponding to the first routing descriptor is matched from the existing PDU sessions, establishing connection with a network slice through the first PDU session;
when the first PDU session corresponding to the first routing descriptor is not matched from the existing PDU sessions, a first PDU session creation request is initiated through the first routing descriptor, and a connection is established with a network slice through the successfully created first PDU session.
10. The network slice connection method of claim 9, wherein the establishing a connection with a network slice based on the second list further comprises:
matching an existing PDU session by a default second routing descriptor in the second list in the case that the first routing descriptor is not acquired from the second list;
when a second PDU session corresponding to the second routing descriptor is matched from the existing PDU sessions, establishing connection with a network slice through the second PDU session;
and when the second PDU session corresponding to the second routing descriptor is not matched from the existing PDU sessions, initiating a second PDU session creation request through the second routing descriptor, and establishing connection with a network slice through the successfully created second PDU session.
11. A network slice connection device, comprising:
an acquisition unit configured to: acquiring a first list, wherein the first list is a terminal routing rule URSP list issued by a network;
a processing unit configured to: based on the application actually installed in the terminal, performing reduction processing on the first list to obtain a second list;
a connection unit configured to: and establishing a connection with the target network slice based on the second list.
12. The network slice connection apparatus of claim 11, wherein the processing unit is configured to:
querying URSP information corresponding to the application which is actually installed from the first list;
the second list is generated based on the urs information corresponding to the actually installed applications.
13. The network slice connection apparatus of claim 11, further comprising a ranking optimization unit configured to:
and according to a preset rule, performing sequencing optimization processing on the second list.
14. The network slice connection apparatus of claim 13, wherein the ordering optimization unit is configured to:
and carrying out the sorting optimization processing according to at least one of the use frequency, the use priority, the data traffic ranking and the network application ranking of the actually installed application.
15. The network slice connection apparatus of claim 11, further comprising a first update unit configured to:
and updating the second list when the application actually installed in the terminal changes.
16. The network slice connection apparatus of claim 15, wherein the first updating unit is configured to:
inquiring URSP information corresponding to a new application from the first list when the new application is installed in the terminal, and adding the URSP information of the new application to the second list;
when an application of the applications actually installed in the terminal is deleted, deleting the URSP information corresponding to the deleted application from the second list.
17. The network slice connection apparatus of claim 11, further comprising a second updating unit configured to:
and when the URSP list issued by the network is updated, selectively updating the second list.
18. The network slice connection apparatus of claim 17, wherein the second updating unit is configured to:
checking the updated urs list and the first list;
if the verification results are inconsistent, the updated URSP list is stored as a new first list;
comparing the second list with the new first list;
and updating the items needing to be updated in the second list under the condition that the items needing to be updated exist in the second list.
19. The network slice connection apparatus of claim 11, wherein the connection unit is configured to:
in response to a request from a user to open a first application, looking up traffic descriptors matching first features of the first application from the second list to obtain first routing descriptors of the first application;
matching an existing PDU session by the first routing descriptor in case the first routing descriptor is obtained from the second list;
when a first PDU session corresponding to the first routing descriptor is matched from the existing PDU sessions, establishing connection with a network slice through the first PDU session;
when the first PDU session corresponding to the first routing descriptor is not matched from the existing PDU sessions, a first PDU session creation request is initiated through the first routing descriptor, and a connection is established with a network slice through the successfully created first PDU session.
20. The network slice connection apparatus of claim 19, wherein the connection unit is further configured to:
matching an existing PDU session by a default second routing descriptor in the second list in the case that the first routing descriptor is not acquired from the second list;
when a second PDU session corresponding to the second routing descriptor is matched from the existing PDU sessions, establishing connection with a network slice through the second PDU session;
and when the second PDU session corresponding to the second routing descriptor is not matched from the existing PDU sessions, initiating a second PDU session creation request through the second routing descriptor, and establishing connection with a network slice through the successfully created second PDU session.
21. An electronic device, comprising:
at least one processor;
at least one memory storing computer-executable instructions,
wherein the computer executable instructions, when executed by the at least one processor, cause the at least one processor to perform the network slice connection method of any one of claims 1 to 10.
22. A computer-readable storage medium, wherein instructions in the computer-readable storage medium, when executed by at least one processor, cause the at least one processor to perform the network slice connection method of any one of claims 1 to 10.
CN202111286316.8A 2021-11-02 2021-11-02 Network slice connection method, device, equipment and medium Pending CN116074921A (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202111286316.8A CN116074921A (en) 2021-11-02 2021-11-02 Network slice connection method, device, equipment and medium
PCT/KR2022/016575 WO2023080542A1 (en) 2021-11-02 2022-10-27 Method and apparatus for network slicing in mobile communication system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111286316.8A CN116074921A (en) 2021-11-02 2021-11-02 Network slice connection method, device, equipment and medium

Publications (1)

Publication Number Publication Date
CN116074921A true CN116074921A (en) 2023-05-05

Family

ID=86168645

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111286316.8A Pending CN116074921A (en) 2021-11-02 2021-11-02 Network slice connection method, device, equipment and medium

Country Status (2)

Country Link
CN (1) CN116074921A (en)
WO (1) WO2023080542A1 (en)

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP4362434A3 (en) * 2017-08-11 2024-06-26 Huawei Technologies Co., Ltd. Pdu type setting method, ue policy setting method, and related entity
CN111182572B (en) * 2017-10-20 2021-03-05 Oppo广东移动通信有限公司 Method for transmitting data, terminal equipment and network equipment
CN110418328B (en) * 2018-04-28 2021-01-05 华为技术有限公司 Communication method and device
CN110474840B (en) * 2018-05-09 2022-05-10 华为技术有限公司 Data transmission method, device and readable storage medium
WO2020153773A1 (en) * 2019-01-22 2020-07-30 Samsung Electronics Co., Ltd. Device and method for providing network slice interworking in wireless communication system

Also Published As

Publication number Publication date
WO2023080542A1 (en) 2023-05-11

Similar Documents

Publication Publication Date Title
US11526470B2 (en) Data validation for data record migrations
US11296940B2 (en) Centralized configuration data in a distributed file system
US10445182B2 (en) Undo changes on a client device
US10595204B2 (en) Flexible remote server validation
CN108846753B (en) Method and apparatus for processing data
US10963370B2 (en) Default mock implementations at a server
US20170031948A1 (en) File synchronization method, server, and terminal
US20140304384A1 (en) Uploading large content items
US10209976B2 (en) Automated application installation
US20200034473A1 (en) Asynchronous deletion in non-relational databases
US10572506B2 (en) Synchronizing data stores for different size data objects
US20130117218A1 (en) Cross-store electronic discovery
US10983718B2 (en) Method, device and computer program product for data backup
US20190005031A1 (en) Accessing cloud based document libraries over unreliable networks
CN112243017A (en) File uploading method and device
US9449036B2 (en) Handling an increase in transactional data without requiring relocation of preexisting data between shards
JP2014123360A (en) Tag classification system and method for virtual machine
JP2016009225A (en) Database management device, database management method, program, and recording medium
CN112579877A (en) Information source system control method, device, storage medium and equipment
US20150100615A1 (en) Drag and drop of a uri to link resources
US11757976B2 (en) Unified application management for heterogeneous application delivery
CN116074921A (en) Network slice connection method, device, equipment and medium
CN103491113B (en) A kind of synchronous method, the apparatus and system of information fusion file
US20180253319A1 (en) Adaptively linking data between independent systems based on a uniform resource locator
US11921752B2 (en) Sharing data across cloud-based data warehouses

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication