CN115696466B - Method and device for determining priority of S-NSSAI - Google Patents
Method and device for determining priority of S-NSSAI Download PDFInfo
- Publication number
- CN115696466B CN115696466B CN202211165599.5A CN202211165599A CN115696466B CN 115696466 B CN115696466 B CN 115696466B CN 202211165599 A CN202211165599 A CN 202211165599A CN 115696466 B CN115696466 B CN 115696466B
- Authority
- CN
- China
- Prior art keywords
- node
- nssai
- determining
- priority
- matrix
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application provides a method and a device for determining the priority of S-NSSAI, wherein the method for determining the priority of S-NSSAI is applied to a network data analysis function NWDAF, and the method comprises the following steps: acquiring slice data in a network architecture of a core network, wherein the slice data is used for describing at least one single network slice selection auxiliary information S-NSSAI subscribed by each UE in at least one user equipment UE and at least one data network name DNN configured by each S-NSSAI in at least one S-NSSAI; taking each S-NSSAI, each DNN in at least one DNN and each UE as nodes, and constructing a directed topology graph according to slice data; determining a distribution matrix and a transfer matrix according to the connection relation among all nodes in the directed topological graph; and determining a priority matrix corresponding to the S-NSSAI in the slice data by presetting a damping factor, a transfer matrix and a distribution matrix.
Description
Technical Field
The present application relates to the field of 5G communication technologies, and in particular, to a method and an apparatus for determining a priority of S-nsai.
Background
In a fifth generation communication system (5th Generation,5G), a User Equipment (UE) may subscribe to at least one single network slice selection assistance information (Single Network Slice Selection Assistance Information, S-NSSAI).
A large number of UEs are connected in the 5G core network, and each UE subscribes to at least one S-nsai, because the network resources of the same communication carrier are constant, there is no reference for how many network resources should be allocated for each S-nsai in the core network of the communication carrier, so that reasonable allocation of network resources cannot be realized.
Disclosure of Invention
In view of this, an object of the present application is to provide at least a method and an apparatus for determining a priority of S-nsai, by calculating the priority of each S-nsai in a core network, so that a communication operator can allocate network resources with reference to the priority of each S-nsai, which solves the technical problem that network resources cannot be allocated reasonably in the prior art, and achieves the technical effect of allocating network resources reasonably.
The application mainly comprises the following aspects:
in a first aspect, an embodiment of the present application provides a method for determining a priority of S-nsai, where the method for determining a priority of S-nsai is applied to a network data analysis function NWDAF, and the method for determining a priority of S-nsai includes: acquiring slice data in a network architecture of a core network, wherein the slice data is used for describing at least one single network slice selection auxiliary information S-NSSAI subscribed by each UE in at least one user equipment UE and at least one data network name DNN configured by each S-NSSAI in at least one S-NSSAI; taking each S-NSSAI, each DNN in at least one DNN and each UE as nodes, and constructing a directed topology graph according to slice data; determining a distribution matrix and a transfer matrix according to the connection relation among all nodes in the directed topological graph; and determining priority matrixes corresponding to all the S-NSSAIs in the slice data by presetting damping factors, transfer matrixes and distribution matrixes, so that the priority of the S-NSSAI corresponding to each element in the priority matrixes is determined according to the element value of the element.
Optionally, each S-nsai corresponds to one S-nsai node, each DNN corresponds to one DNN node, and each UE corresponds to one UE node; taking each S-NSSAI, each DNN in at least one DNN and each UE as nodes, constructing a directed topology graph according to slice data, and comprising: connecting any two S-NSSAI nodes in each S-NSSAI node by using a double-arrow connecting line; for each S-NSSAI node, the S-NSSAI node is directed to a DNN node corresponding to at least one DNN configured by the S-NSSAI, and/or for each UE node, the UE node is directed to an S-NSSAI node corresponding to at least one S-NSSAI subscribed by the UE, so that a directed topology graph is obtained.
Optionally, determining the distribution matrix and the transfer matrix according to the connection relationship between the nodes in the directed topology graph includes: determining the total node number of the directed topology graph and the node label of each node; determining the reciprocal of the total node number as the element value of each element of the distribution matrix, wherein the number of rows of each element of the distribution matrix corresponds to the node mark, and the number of columns of each element of the distribution matrix is one; for each node in the directed topology graph, constructing a transfer matrix according to the node label of at least one outgoing node of the node and the total outgoing link point number of the node; at least one out-link point of the node refers to at least one node to which the node points.
Optionally, the number of rows and columns of the transfer matrix is equal to the total number of nodes; for each node in the directed topology graph, constructing a transfer matrix according to the node label of at least one outgoing node of the node and the total outgoing link point number of the node, including: for each column in the transfer matrix, determining a node corresponding to a node label equal to the column number of the column as a target node of the column; among the elements of the column, finding out the target element corresponding to the same number of rows as the node label of at least one out-link node of the target node of the column; determining the reciprocal of the total out link point number of the target node of the column as the element value of the target element; and setting element values of elements except the target element of each column in the transfer matrix to be zero to obtain the transfer matrix.
Optionally, determining priority matrices corresponding to all S-nsais in slice data by presetting damping factors, transfer matrices and distribution matrices, including: updating the distribution matrix by presetting damping factors, a transfer matrix and a distribution matrix; calculating the difference value between the updated distribution matrix and the distribution matrix to obtain a difference matrix; judging whether the element value of each element in the difference matrix is smaller than a preset difference value; and if the element value of each element in the difference matrix is smaller than the preset difference value, determining the updated distribution matrix as the priority matrix.
Optionally, updating the distribution matrix by presetting a damping factor, a transfer matrix and a distribution matrix includes: updating the distribution matrix by the following formula:
in the formula, rt+1 refers to a distribution matrix updated for the t+1st time, d refers to a preset damping factor, M refers to a transfer matrix, rt refers to a distribution matrix updated for the t time, n refers to the total node number of the directed topology graph, and alpha refers to a preset column vector.
In a second aspect, embodiments of the present application further provide a priority determining apparatus of S-nsai, where the priority determining apparatus of S-nsai includes: an acquisition module, configured to acquire slice data in a network architecture of a core network, where the slice data is used to describe at least one single network slice selection assistance information S-nsai subscribed by each UE in at least one user equipment UE, and at least one data network name DNN configured by each S-nsai in the at least one S-nsai; the construction module is used for constructing a directed topological graph according to slice data by taking each S-NSSAI, each DNN in at least one DNN and each UE as nodes; the first determining module is used for determining a distribution matrix and a transfer matrix according to the connection relation among all nodes in the directed topological graph; and the second determining module is used for determining priority matrixes corresponding to all the S-NSSAIs in the slice data by presetting damping factors, transfer matrixes and distribution matrixes so as to determine the priority of the S-NSSAI corresponding to each element according to the element value of the element in the priority matrixes.
Optionally, each S-nsai corresponds to one S-nsai node, each DNN corresponds to one DNN node, and each UE corresponds to one UE node; the construction module further comprises: the first connection module is used for connecting any two S-NSSAI nodes in each S-NSSAI node by using a double-arrow connecting line; and the second connection module is used for directing the S-NSSAI node to a DNN node corresponding to at least one DNN configured by the S-NSSAI for each S-NSSAI node, and/or directing the UE node to the S-NSSAI node corresponding to at least one S-NSSAI subscribed by the UE for each UE node to obtain a directed topological graph.
In a third aspect, embodiments of the present application further provide an electronic device, including: a processor, a memory and a bus, the memory storing machine readable instructions executable by the processor, the processor and the memory in communication via the bus when the electronic device is running, the machine readable instructions when executed by the processor performing the steps of the priority determining method of S-nsai in the first aspect or any of the possible implementations of the first aspect.
In a fourth aspect, the embodiments of the present application further provide a computer readable storage medium, on which a computer program is stored, which when executed by a processor performs the step of determining the priority of the S-nsai in the first aspect or any of the possible implementation manners of the first aspect.
The method and the device for determining the priority of the S-NSSAI, provided by the embodiment of the application, are applied to a network data analysis function NWDAF, and the method for determining the priority of the S-NSSAI comprises the following steps: acquiring slice data in a network architecture of a core network, wherein the slice data is used for describing at least one single network slice selection auxiliary information S-NSSAI subscribed by each UE in at least one user equipment UE and at least one data network name DNN configured by each S-NSSAI in at least one S-NSSAI; taking each S-NSSAI, each DNN in at least one DNN and each UE as nodes, and constructing a directed topology graph according to slice data; determining a distribution matrix and a transfer matrix according to the connection relation among all nodes in the directed topological graph; and determining priority matrixes corresponding to all S-NSSAI in slice data by presetting damping factors, transfer matrixes and distribution matrixes. According to the method and the device, the priority of each S-NSSAI in the core network is calculated, so that the communication operator can allocate the network resources by referring to the priority of each S-NSSAI, the technical problem that the network resources cannot be reasonably allocated in the prior art is solved, and the technical effect of reasonably allocating the network resources is achieved.
In order to make the above objects, features and advantages of the present application more comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the embodiments will be briefly described below, it being understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered limiting the scope, and that other related drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 shows a flowchart of a method for determining priority of S-NSSAI according to an embodiment of the present application.
Fig. 2 shows a schematic diagram of a directed topology provided by an embodiment of the present application.
Fig. 3 is a flowchart illustrating the steps for determining priority matrices corresponding to all S-nsais in slice data by presetting damping factors, transfer matrices and distribution matrices according to an embodiment of the present application.
Fig. 4 shows a functional block diagram of a priority determining apparatus of S-NSSAI according to an embodiment of the present application.
Fig. 5 shows a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present application more clear, the technical solutions of the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application, and it should be understood that the accompanying drawings in the present application are only for the purpose of illustration and description, and are not intended to limit the protection scope of the present application. In addition, it should be understood that the schematic drawings are not drawn to scale. A flowchart, as used in this application, illustrates operations implemented according to some embodiments of the present application. It should be appreciated that the operations of the flow diagrams may be implemented out of order and that steps without logical context may be performed in reverse order or concurrently. Moreover, one or more other operations may be added to the flow diagrams and one or more operations may be removed from the flow diagrams as directed by those skilled in the art.
In addition, the described embodiments are only some, but not all, of the embodiments of the present application. The components of the embodiments of the present application, which are generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, as provided in the accompanying drawings, is not intended to limit the scope of the application, as claimed, but is merely representative of selected embodiments of the application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present application without making any inventive effort, are intended to be within the scope of the present application.
In the prior art, the network resources of each communication carrier are constant, and no reference exists for how many network resources are allocated to each S-NSSAI corresponding to the 5G core network of the communication carrier, so that reasonable allocation of the network resources cannot be realized.
Based on this, the embodiment of the application provides a method and a device for determining the priority of S-nsai, which calculate the priority of each S-nsai in a core network, so that a communication operator allocates network resources with reference to the priority of each S-nsai, thereby solving the technical problem that the network resources cannot be reasonably allocated in the prior art, and achieving the technical effect of reasonably allocating the network resources, and specifically comprising the following steps:
referring to fig. 1, fig. 1 is a flowchart of a method for determining priority of S-NSSAI according to an embodiment of the present application. As shown in fig. 1, the method for determining the priority of S-NSSAI provided in the embodiment of the present application includes the following steps:
s101: slice data in a network architecture of the core network is acquired, the slice data being used to describe at least one single network slice selection assistance information S-nsai subscribed to by each of the at least one user equipment UE, and at least one data network name DNN configured by each of the at least one S-nsai.
The priority determination method of S-NSSAI is applied to the network data analysis function NWDAF (Network Data Analytics Function). That is, at least one S-NSSAI subscribed to by each of the at least one UE and at least one DNN configured by each of the at least one S-NSSAI subscribed to by each of the at least one UE are obtained.
The network construction of the 5G core network comprises the following steps: AMF (Access and Mobility Management Function, access and mobility management functions), UDM (Unified Data Management ), NSSF (Network Slice Selection Function, network slice selection function).
The NWDAF obtains at least one single network slice selection assistance information S-nsai subscribed to by each UE from the NSSF, and the NWDAF obtains at least one data network name DNN (Data Network Name) configured by each S-nsai from the UDM.
That is, at least one S-nsai that enables the NWDAF to acquire which users subscribe to may be set by the communications carrier itself. The number of S-nsais in the slice data should be greater than one.
After obtaining slice data in a network architecture of the core network, the slice data describing at least one single network slice selection assistance information S-nsai subscribed to by each UE of the at least one user equipment UE, and at least one data network name DNN configured by each of the at least one S-nsai, the method further comprises: judging whether the number of S-NSSAI in slice data is greater than one; if the number of S-NSSAI in the slice data is greater than one, each S-NSSAI, each DNN in at least one DNN and each UE are taken as nodes, and a directed topology graph is constructed according to the slice data; if the number of S-nsais in the slice data is less than or equal to one, determining the S-nsai as a target S-nsai, and acquiring at least one S-nsai subscribed by other UEs except the UE corresponding to the target S-nsai, and at least one data network name DNN configured by each S-nsai in the at least one S-nsai again to increase the number of S-nsais.
Since each UE subscribes to at least one S-nsai, if only one S-nsai subscribed to by one UE is obtained, the priority of the S-nsai is considered to be the largest. Therefore, in order to calculate the priorities of the different S-NSSAIs, it is necessary to ensure that the number of S-NSSAIs is greater than one.
S102: and taking each S-NSSAI, each DNN in at least one DNN and each UE as nodes, and constructing a directed topological graph according to the slice data.
Each S-NSSAI corresponds to one S-NSSAI node, each DNN corresponds to one DNN node, and each UE corresponds to one UE node.
Taking each S-NSSAI, each DNN in at least one DNN and each UE as nodes, constructing a directed topology graph according to slice data, and comprising: connecting any two S-NSSAI nodes in each S-NSSAI node by using a double-arrow connecting line; for each S-NSSAI node, the S-NSSAI node is directed to a DNN node corresponding to at least one DNN configured by the S-NSSAI, and/or for each UE node, the UE node is directed to an S-NSSAI node corresponding to at least one S-NSSAI subscribed by the UE, so that a directed topology graph is obtained.
That is, the nodes of the directed topology graph include: S-NSSAI node, DNN node and UE node.
For example, referring to fig. 2, fig. 2 is a schematic diagram of a directed topology provided in an embodiment of the present application. As shown in fig. 2, circles are denoted by S-nsai nodes, triangles are denoted by UE nodes, squares are denoted by DNN nodes, any two S-nsai nodes are connected by double-headed arrows, each S-nsai node is directed to the DNN node corresponding to the S-nsai, and each UE node is directed to the S-nsai node corresponding to the UE.
S103: and determining a distribution matrix and a transfer matrix according to the connection relation among the nodes in the directed topological graph.
Determining a distribution matrix and a transfer matrix according to the connection relation among all nodes in the directed topological graph, wherein the method comprises the following steps: determining the total node number of the directed topology graph and the node label of each node; determining the reciprocal of the total node number as the element value of each element of the distribution matrix, wherein the number of rows of each element of the distribution matrix corresponds to the node mark, and the number of columns of each element of the distribution matrix is one; for each node in the directed topology graph, constructing a transfer matrix according to the node label of at least one outgoing node of the node and the total outgoing link point number of the node; at least one out-link point of the node refers to at least one node to which the node points.
The distribution matrix refers to the initial influence of the node corresponding to each element, and the element value of each element of the distribution matrix is the reciprocal of the total node number. The distribution matrix is an n-dimensional column vector, n referring to the total number of nodes.
As shown in fig. 2, the total node number of the directed topology is 9,1 refers to a first S-nsai node with node number 1, 2 refers to a second S-nsai node with node number 2, 3 refers to a third S-nsai node with node number 3, 4 refers to a first UE node with node number 4, and 5 refers to a second U with node number 5E node, 6 refers to a third UE node with node number 6, 7 refers to a first DNN node with node number 7, 8 refers to a second DNN node with node number 8, and 9 refers to a third DNN node with node number 9. Distribution matrix of directed topology
Distribution matrix R 0 Is a 9-dimensional column matrix, a distribution matrix R 0 The number of rows of each element in the list is equal to the node label of the node corresponding to the element, and the element value of each element is one ninth. That is, the elements of the first row and the first column correspond to a first S-NSSAI node with node number 1, and the initial impact of the first S-NSSAI node is one-ninth.
The number of rows and columns of the transfer matrix is equal to the total node number; for each node in the directed topology graph, constructing a transfer matrix according to the node label of at least one outgoing node of the node and the total outgoing link point number of the node, including: for each column in the transfer matrix, determining a node corresponding to a node label equal to the column number of the column as a target node of the column; among the elements of the column, finding out the target element corresponding to the same number of rows as the node label of at least one out-link node of the target node of the column; determining the reciprocal of the total out link point number of the target node of the column as the element value of the target element; and setting element values of elements except the target element of each column in the transfer matrix to be zero to obtain the transfer matrix.
The total number of link points for the node refers to the total number of nodes pointed to from the node.
Illustratively, as shown in FIG. 2, the first S-NSSAI node, node number 1, includes three egress link points: a second S-NSSAI node with node number 2, a third S-NSSAI node with node number 3, and a first DNN node with node number 7; the second S-nsai node with node number 2 includes three outgoing link points: a first S-NSSAI node with node number 1, a third S-NSSAI node with node number 3, and a second DNN node with node number 8; the third S-nsai node with node number 3 includes three exit link points: a first S-NSSAI node with node number 1, a second S-NSSAI node with node number 2, and a third DNN node with node number 9; the first UE node with node number 4 includes an outgoing node: a first S-NSSAI node with node number 1; the second UE node with node number 5 includes an outgoing node: a first S-NSSAI node with node number 1; the third UE node with node number 6 includes an outgoing node: a second S-NSSAI node with node number 2; the nodes with the node numbers 7, 8 and 9 have no chain link points.
Further, for a first column in the transfer matrix, the target node of the first column is a first S-nsai node with a node number of 1; the elements of the first column of the second row, the elements of the first column of the third row and the elements of the first column of the seventh row are target elements of the first column, and the element values of the elements of the first column of the second row, the elements of the first column of the third row and the elements of the first column of the seventh row are determined to be one third; determining the element values of the elements in the first column except the elements of the first column of the second row, the elements of the first column of the third row and the elements of the first column of the seventh row to be 0; the above calculation is also performed for other columns, and will not be described again here, so as to obtain the transfer matrix M.
S104: and determining priority matrixes corresponding to all the S-NSSAIs in the slice data by presetting damping factors, transfer matrixes and distribution matrixes, so that the priority of the S-NSSAI corresponding to each element in the priority matrixes is determined according to the element value of the element.
That is, one priority matrix corresponding to all S-NSSAI in slice data is obtained.
Referring to fig. 3, fig. 3 is a flowchart illustrating a step of determining priority matrices corresponding to all S-nsais in slice data by presetting damping factors, transfer matrices and distribution matrices according to an embodiment of the present application. As shown in fig. 3, determining priority matrices corresponding to all S-nsais in slice data by presetting damping factors, transfer matrices and distribution matrices, including:
s201: and updating the distribution matrix by presetting a damping factor, a transfer matrix and the distribution matrix.
S202: and calculating the difference value between the updated distribution matrix and the distribution matrix to obtain a difference matrix.
S203: judging whether the element value of each element in the difference matrix is smaller than a preset difference value.
S204: and determining the updated distribution matrix as a priority matrix.
If the element value of each element in the difference matrix is smaller than the preset difference value, determining the updated distribution matrix as a priority matrix; if any element in the difference matrix is greater than or equal to the preset difference, returning to step S201, updating the distribution matrix again by the preset damping factor, the transfer matrix and the updated distribution matrix, and adding one to the update times.
Updating the distribution matrix by presetting a damping factor, a transfer matrix and a distribution matrix, comprising:
updating the distribution matrix by the following formula:
in the formula (1), R t+1 Refers to the t+1st updated distribution matrix, d refers to the preset damping factor, M refers to the transfer matrix, R t Refers to the distribution matrix updated at the t-th time, n refers to the total node number of the directed topology, and alpha refers to the preset column vector.
Wherein, α is an n-dimensional column vector, the number of rows of α is equal to the total node number, the number of columns is 1, and the element value of each element in α is one.
The preset damping factor is typically set to 0.85. That is, R 0 Is an initial distribution matrix, R is as follows 0 Substituting into formula (1) to obtain R1, wherein the update times are 1, and continuously updating until R t+1 And R is R t Approximation, i.e. R t+1 Subtracting R t Obtaining a difference matrix, the difference matrixEach element in the array is smaller than a preset difference value.
The priority matrix corresponding to all S-NSSAI in the slice data is an n-dimensional column vector, and the row number of each element in the priority matrix corresponds to the node label. Determining element values of elements corresponding to each NSSAI node in at least one S-NSSAI node from the priority matrix, and sorting the at least one S-NSSAI node in a descending order according to the sizes of the element values; determining the sequence of the sequenced at least one S-NSSAI node as the priority of the at least one NSSAI, and sending the priority of the at least one S-NSSAI to the AMF.
Illustratively, according to the embodiment of the present application, the element value of the element of the first row and the first column in the priority matrix is the priority value of the first S-nsai node with the node number 1, the element value of the element of the first column of the second row in the priority matrix is the priority value of the second S-nsai node with the node number 2, and the element value of the element of the first column of the third row in the priority matrix is the priority value of the third S-nsai node with the node number 3.
The priority values of the S-nsai nodes may be arranged in a descending order, and the order of the S-nsai nodes after the descending order is determined as the priority of the S-nsai corresponding to the S-nsai node, where the priority of the S-nsai corresponding to the S-nsai node arranged in the first order is considered to be the largest and the most network resources are needed. Thus, the communication operator can allocate more network resources to the S-nsai corresponding to the S-nsai node arranged at the forefront, and the network resources can be understood as the flow which can be provided by the communication operator per minute.
Or, the priority of the S-nsai obtained in the present application may also be used as one of the reference indexes of the priority (cell Reselection Priority) of cell reselection, where cell reselection refers to that the UE selects a cell with the best signal quality to provide a service signal by monitoring the signal quality of the neighboring cell and the current cell in the idle mode. Further, the communication carrier may set the priority of the cell reselection from the row with reference to the priority of the S-nsai supported by the respective cells.
Based on the same application concept, the embodiment of the present application further provides a priority determining device of S-nsai corresponding to the priority determining method of S-nsai provided in the foregoing embodiment, and since the principle of solving the problem by the device in the embodiment of the present application is similar to that of the priority determining method of S-nsai in the foregoing embodiment of the present application, the implementation of the device may refer to the implementation of the method, and the repetition is omitted.
Fig. 4 is a functional block diagram of a priority determining apparatus of S-NSSAI according to an embodiment of the present application. The priority determining apparatus 10 of the S-NSSAI includes: an obtaining module 101, configured to obtain slice data in a network architecture of a core network, where the slice data is used to describe at least one single network slice selection assistance information S-nsai subscribed by each UE in at least one user equipment UE, and at least one data network name DNN configured by each S-nsai in the at least one S-nsai; a building module 102, configured to build a directed topology map according to slice data with each S-nsai, each DNN of the at least one DNN, and each UE as nodes; a first determining module 103, configured to determine a distribution matrix and a transfer matrix according to a connection relationship between each node in the directed topology graph; the second determining module 104 is configured to determine, by presetting a damping factor, a transfer matrix, and a distribution matrix, a priority matrix corresponding to all S-nsais in the slice data, so that the priority of the S-nsais corresponding to each element in the priority matrix is determined according to the element value of the element.
Each S-NSSAI corresponds to one S-NSSAI node, each DNN corresponds to one DNN node, and each UE corresponds to one UE node; the construction module further comprises: the first connection module is used for connecting any two S-NSSAI nodes in each S-NSSAI node by using a double-arrow connecting line;
and the second connection module is used for directing the S-NSSAI node to a DNN node corresponding to at least one DNN configured by the S-NSSAI for each S-NSSAI node, and/or directing the UE node to the S-NSSAI node corresponding to at least one S-NSSAI subscribed by the UE for each UE node to obtain a directed topological graph.
Based on the same application concept, referring to fig. 5, which is a schematic structural diagram of an electronic device provided in an embodiment of the present application, the electronic device 20 includes: a processor 201, a memory 202 and a bus 203, said memory 202 storing machine readable instructions executable by said processor 201, said processor 201 and said memory 202 communicating via said bus 203 when the electronic device 20 is running, said machine readable instructions being executed by said processor 201 to perform the steps of the method of prioritizing S-NSSAI according to any of the embodiments described above.
In particular, the machine readable instructions, when executed by the processor 201, may perform the following: acquiring slice data in a network architecture of a core network, wherein the slice data is used for describing at least one single network slice selection auxiliary information S-NSSAI subscribed by each UE in at least one user equipment UE and at least one data network name DNN configured by each S-NSSAI in at least one S-NSSAI; taking each S-NSSAI, each DNN in the at least one DNN and each UE as nodes, and constructing a directed topology graph according to the slice data; determining a distribution matrix and a transfer matrix according to the connection relation among all nodes in the directed topological graph; and determining priority matrixes corresponding to all the S-NSSAIs in the slice data through presetting damping factors, the transfer matrixes and the distribution matrixes, so that the priority of the S-NSSAI corresponding to each element in the priority matrixes is determined according to the element value of the element.
Based on the same application concept, the embodiment of the present application further provides a computer readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the steps of the priority determining method of S-nsai provided in the foregoing embodiment are executed.
Specifically, the storage medium can be a general storage medium, such as a mobile disk, a hard disk, and the like, and when a computer program on the storage medium is run, the method for determining the priority of the S-nsai can be executed.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described system and apparatus may refer to corresponding procedures in the foregoing method embodiments, which are not described herein again. In the several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. The above-described apparatus embodiments are merely illustrative, for example, the division of the units is merely a logical function division, and there may be other manners of division in actual implementation, and for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some communication interface, device or unit indirect coupling or communication connection, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a non-volatile computer readable storage medium executable by a processor. Based on such understanding, the technical solutions of the present application may be embodied in essence or a part contributing to the prior art or a part of the technical solutions, or in the form of a software product, which is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
The foregoing is merely a specific embodiment of the present application, but the protection scope of the present application is not limited thereto, and any person skilled in the art can easily think about changes or substitutions within the technical scope of the present application, and the changes or substitutions are covered in the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A method for determining a priority of S-nsai, wherein the method for determining a priority of S-nsai is applied to a network data analysis function NWDAF, and the method for determining a priority of S-nsai includes:
acquiring slice data in a network architecture of a core network, wherein the slice data is used for describing at least one single network slice selection auxiliary information S-NSSAI subscribed by each UE in at least one user equipment UE and at least one data network name DNN configured by each S-NSSAI in at least one S-NSSAI;
taking each S-NSSAI, each DNN in at least one DNN and each UE as nodes, and constructing a directed topological graph according to the slice data;
determining a distribution matrix and a transfer matrix according to the connection relation among all nodes in the directed topological graph;
and determining priority matrixes corresponding to all the S-NSSAIs in the slice data through presetting damping factors, the transfer matrixes and the distribution matrixes, so that the priority of the S-NSSAI corresponding to each element in the priority matrixes is determined according to the element value of the element.
2. The method of claim 1, wherein each S-nsai corresponds to an S-nsai node, each DNN corresponds to a DNN node, and each UE corresponds to a UE node; the constructing a directed topology map by using each S-nsai, each DNN of at least one DNN, and each UE as nodes according to the slice data includes:
connecting any two S-NSSAI nodes in each S-NSSAI node by using a double-arrow connecting line;
for each S-NSSAI node, the S-NSSAI node is directed to a DNN node corresponding to at least one DNN configured by the S-NSSAI, and/or for each UE node, the UE node is directed to an S-NSSAI node corresponding to at least one S-NSSAI subscribed by the UE, so that a directed topology graph is obtained.
3. The method for determining the priority according to claim 1, wherein determining the distribution matrix and the transfer matrix according to the connection relationship between the nodes in the directed topology graph comprises:
determining the total node number of the directed topology graph and the node label of each node;
determining the reciprocal of the total node number as the element value of each element of a distribution matrix, wherein the number of rows of each element of the distribution matrix corresponds to the node mark number, and the number of columns of each element of the distribution matrix is one;
for each node in the directed topology graph, constructing a transfer matrix according to the node label of at least one outgoing link node of the node and the total outgoing link point number of the node; at least one out-link point of the node refers to at least one node to which the node points.
4. A priority determination method as claimed in claim 3 wherein the number of rows and columns of the transfer matrix is equal to the total number of nodes; for each node in the directed topology graph, constructing a transfer matrix according to the node label of at least one outgoing node of the node and the total outgoing link point number of the node, including:
for each column in the transfer matrix, determining a node corresponding to a node label equal to the column number of the column as a target node of the column;
among the elements of the column, finding out the target element corresponding to the same number of rows as the node label of at least one out-link node of the target node of the column;
determining the reciprocal of the total out link point number of the target node of the column as the element value of the target element;
and setting element values of elements except the target element of each column in the transfer matrix to be zero to obtain the transfer matrix.
5. The method for determining the priority according to claim 1, wherein determining the priority matrix corresponding to all S-nsais in the slice data by presetting a damping factor, the transfer matrix and the distribution matrix includes:
updating the distribution matrix by presetting a damping factor, the transfer matrix and the distribution matrix;
calculating the difference value between the updated distribution matrix and the distribution matrix to obtain a difference matrix;
judging whether the element value of each element in the difference matrix is smaller than a preset difference value;
and if the element value of each element in the difference matrix is smaller than the preset difference value, determining the updated distribution matrix as the priority matrix.
6. The method according to claim 5, wherein updating the distribution matrix by presetting a damping factor, the transfer matrix, and the distribution matrix comprises:
updating the distribution matrix by the following formula:
in the formula, R t+1 Refers to the t+1st timeUpdated distribution matrix, d refers to preset damping factor, M refers to transfer matrix, R t Refers to the distribution matrix updated at the t-th time, n refers to the total node number of the directed topology, and alpha refers to the preset column vector.
7. A priority determining apparatus of an S-nsai, wherein the priority determining apparatus of an S-nsai includes:
an acquisition module, configured to acquire slice data in a network architecture of a core network, where the slice data is configured to describe at least one single network slice selection assistance information S-nsai subscribed by each UE in at least one user equipment UE, and at least one data network name DNN configured by each S-nsai in at least one S-nsai;
the construction module is used for constructing a directed topological graph according to the slice data by taking each S-NSSAI, each DNN in at least one DNN and each UE as nodes;
the first determining module is used for determining a distribution matrix and a transfer matrix according to the connection relation among all nodes in the directed topological graph;
and the second determining module is used for determining priority matrixes corresponding to all the S-NSSAIs in the slice data through presetting damping factors, the transfer matrixes and the distribution matrixes, so that the priority of the S-NSSAI corresponding to each element in the priority matrixes is determined according to the element value of the element.
8. The priority determination apparatus as recited in claim 7 wherein each S-nsai corresponds to an S-nsai node, each DNN corresponds to a DNN node, and each UE corresponds to a UE node; the building module further comprises:
the first connection module is used for connecting any two S-NSSAI nodes in each S-NSSAI node by using a double-arrow connecting line;
and the second connection module is used for directing the S-NSSAI node to a DNN node corresponding to at least one DNN configured by the S-NSSAI for each S-NSSAI node, and/or directing the UE node to the S-NSSAI node corresponding to at least one S-NSSAI subscribed by the UE for each UE node to obtain a directed topological graph.
9. An electronic device, comprising: a processor, a memory and a bus, said memory storing machine-readable instructions executable by said processor, said processor and said memory communicating via said bus when the electronic device is running, said machine-readable instructions when executed by said processor performing the steps of the priority determination method of S-nsai according to any of claims 1 to 6.
10. A computer readable storage medium, characterized in that the computer readable storage medium has stored thereon a computer program which, when executed by a processor, performs the steps of the priority determining method of S-NSSAI according to any of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211165599.5A CN115696466B (en) | 2022-09-23 | 2022-09-23 | Method and device for determining priority of S-NSSAI |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211165599.5A CN115696466B (en) | 2022-09-23 | 2022-09-23 | Method and device for determining priority of S-NSSAI |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115696466A CN115696466A (en) | 2023-02-03 |
| CN115696466B true CN115696466B (en) | 2023-06-06 |
Family
ID=85062835
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211165599.5A Active CN115696466B (en) | 2022-09-23 | 2022-09-23 | Method and device for determining priority of S-NSSAI |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115696466B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109769269A (en) * | 2017-11-09 | 2019-05-17 | 华为技术有限公司 | Communication means and the network equipment |
| CN110431888A (en) * | 2017-03-17 | 2019-11-08 | 高通股份有限公司 | Non-compatible network is sliced and carries out priority ranking |
| CN112737823A (en) * | 2020-12-22 | 2021-04-30 | 国网北京市电力公司 | Resource slice allocation method and device and computer equipment |
| CN113411841A (en) * | 2020-03-17 | 2021-09-17 | ***通信集团浙江有限公司 | 5G slice cutting and joining method and device and computing equipment |
| CN114585026A (en) * | 2020-11-30 | 2022-06-03 | 中兴通讯股份有限公司 | Frequency point switching method, terminal, base station and storage medium |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104348551B (en) * | 2013-07-23 | 2018-12-28 | 中兴通讯股份有限公司 | A kind of the dynamic bandwidth dispatching method and device of smooth burst mode transmission looped network |
| CN111201811A (en) * | 2017-10-09 | 2020-05-26 | 瑞典爱立信有限公司 | Method for establishing a connection for packet data transfer of a wireless communication device |
-
2022
- 2022-09-23 CN CN202211165599.5A patent/CN115696466B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110431888A (en) * | 2017-03-17 | 2019-11-08 | 高通股份有限公司 | Non-compatible network is sliced and carries out priority ranking |
| CN109769269A (en) * | 2017-11-09 | 2019-05-17 | 华为技术有限公司 | Communication means and the network equipment |
| CN113411841A (en) * | 2020-03-17 | 2021-09-17 | ***通信集团浙江有限公司 | 5G slice cutting and joining method and device and computing equipment |
| CN114585026A (en) * | 2020-11-30 | 2022-06-03 | 中兴通讯股份有限公司 | Frequency point switching method, terminal, base station and storage medium |
| CN112737823A (en) * | 2020-12-22 | 2021-04-30 | 国网北京市电力公司 | Resource slice allocation method and device and computer equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115696466A (en) | 2023-02-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107656807B (en) | Automatic elastic expansion method and device for virtual resources | |
| EP3780434A1 (en) | Blind channel detection method, signal transmission method and related device | |
| CN108834191B (en) | Cell reselection method and device, electronic equipment and storage medium | |
| CN104484134A (en) | Method and device for allocating distributed type storage magnetic discs | |
| CN105630419A (en) | Partition view sending method of resource pools and management node | |
| CN115696466B (en) | Method and device for determining priority of S-NSSAI | |
| CN113660687B (en) | Network difference cell processing method, device, equipment and storage medium | |
| CN111049750B (en) | Message forwarding method, system and equipment | |
| CN111225045B (en) | HIVE high-availability early warning method, device and computer readable storage medium | |
| WO2015145254A2 (en) | Method, apparatus, and system for comp-based resource allocation | |
| CN113014663B (en) | Task and resource matching method supporting cross-node computing task survivability and succession | |
| CN114710411B (en) | Bandwidth allocation method, device, gateway and storage medium | |
| CN110234167B (en) | Channel allocation method, channel allocation device and electronic equipment | |
| CN115544697A (en) | Broadband node position planning method, device, equipment and storage medium | |
| CN112153679B (en) | Network switching method and device | |
| CN114173396A (en) | Method and device for determining terminal networking time, electronic equipment and storage medium | |
| CN114338654A (en) | File transmission method, storage service distribution method, device, equipment and medium | |
| CN115474222B (en) | Communication method and system of terminal, electronic equipment and storage medium | |
| CN113541993A (en) | Network evaluation method and device, network index processing method, equipment and medium | |
| CN116669150A (en) | Star-ground fusion network selection method and device and computer readable storage medium | |
| CN117370619B (en) | Method and device for storing and sub-sampling images in fragments | |
| CN117676898A (en) | Resource scheduling method, device, computer equipment and storage medium | |
| CN110475271B (en) | Method and system for setting service instance in mobile edge computing based network | |
| CN115982668A (en) | Calculation force measuring method and device and computer readable storage medium | |
| CN116320837A (en) | Spectrum flexible optical network resource optimization method based on traffic grooming and related equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |