CN115696466A - S-NSSAI priority determination method and device - Google Patents
S-NSSAI priority determination method and device Download PDFInfo
- Publication number
- CN115696466A CN115696466A CN202211165599.5A CN202211165599A CN115696466A CN 115696466 A CN115696466 A CN 115696466A CN 202211165599 A CN202211165599 A CN 202211165599A CN 115696466 A CN115696466 A CN 115696466A
- Authority
- CN
- China
- Prior art keywords
- node
- nssai
- matrix
- dnn
- priority
- 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.)
- Granted
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: the method comprises the steps of obtaining slice data in a network framework 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 communications technologies, and in particular, to a method and an apparatus for determining a priority of an S-NSSAI.
Background
In fifth generation communication systems (5g), a User Equipment (UE) may subscribe to at least one Single Network Slice Selection Assistance Information (S-NSSAI).
In the 5G core network, a large number of UEs are connected and each UE subscribes to at least one S-NSSAI, and since the network resources of the same communication operator are constant, there is no reference for how much network resources each S-NSSAI in the core network of the communication operator should allocate, and thus, reasonable allocation of network resources cannot be achieved.
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-NSSAI, so that a communications operator allocates network resources by referring to the priority of each S-NSSAI by calculating the priority of each S-NSSAI in a core network, thereby solving a technical problem that network resources cannot be reasonably allocated in the prior art, and achieving a technical effect of reasonably allocating network resources.
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 an S-NSSAI, where the method for determining a priority of an S-NSSAI is applied to a network data analysis function NWDAF, and the method for determining a priority of an S-NSSAI includes: the method comprises the steps of obtaining slice data in a network framework 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 all S-NSSAIs in the slice data by presetting a damping factor, a transfer matrix and a distribution matrix, so that the priority of the S-NSSAI corresponding to each element is determined according to the element value of the element in the priority matrix.
Optionally, 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 of the at least one DNN and each UE as nodes, and constructing a directed topology graph according to slice data, wherein the steps comprise: connecting any two S-NSSAI nodes in each S-NSSAI node by using a connecting line of a double arrow; and aiming at each S-NSSAI node, pointing the S-NSSAI node to a DNN node corresponding to at least one DNN configured by the S-NSSAI, and/or aiming at each UE node, pointing the UE node to an S-NSSAI node corresponding to at least one S-NSSAI subscribed by the UE, and obtaining a directed topology graph.
Optionally, determining a distribution matrix and a transfer matrix according to a connection relationship between nodes in the directed topology graph, including: determining the total number of nodes of the directed topological graph and the node label of each node; determining the reciprocal of the total number of the nodes as the element value of each element of the distribution matrix, wherein the row number of each element of the distribution matrix corresponds to the node label number, and the column number of each element of the distribution matrix is one; aiming at each node in the directed topological graph, constructing a transfer matrix according to the node label of at least one out-link node of the node and the total out-link node 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; aiming at each node in the directed topological graph, according to the node label of at least one out-link node of the node and the total out-link node number of the node, constructing a transfer matrix, comprising the following steps: for each column in the transfer matrix, determining a node corresponding to a node label with the same column number as the column as a target node of the column; finding out target elements corresponding to the row number which is the same as the node label number of at least one out-link node of the target nodes of the column in each element of the column; determining the reciprocal of the total number of the link points of the target nodes in the row 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 a priority matrix corresponding to all S-NSSAIs in the slice data by presetting a damping factor, a transfer matrix, and a distribution matrix, including: updating the distribution matrix through presetting a damping factor, a transfer matrix and the distribution matrix; calculating the difference value between the updated distribution matrix and the distribution matrix to obtain a difference value matrix; judging whether the element value of each element in the difference value matrix is smaller than a preset difference value or not; and if the element value of each element in the difference matrix is smaller than a preset difference, determining the updated distribution matrix as the priority matrix.
Optionally, updating the distribution matrix by presetting the damping factor, the transfer matrix and the distribution matrix, including: updating the distribution matrix by the following formula:
in the formula, rt +1 refers to a distribution matrix updated at the t +1 th time, d refers to a preset damping factor, M refers to a transfer matrix, rt refers to a distribution matrix updated at the t th time, n refers to the total node number of the directed topology, and α refers to a preset column vector.
In a second aspect, an embodiment of the present application further provides an S-NSSAI priority determination apparatus, where the S-NSSAI priority determination apparatus includes: an obtaining module, configured to obtain slice data in a network framework of a core network, where the slice data is used to describe at least one single network slice selection assistance information S-NSSAI subscribed to by each UE of at least one user equipment UE, and at least one data network name DNN configured for each S-NSSAI of the at least one S-NSSAI; the construction module is used for constructing a directed topology graph by taking each S-NSSAI, each DNN in at least one DNN and each UE as nodes according to the slice data; 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 the priority matrix corresponding to all the S-NSSAIs in the slice data through presetting the damping factor, the transfer matrix and the distribution matrix 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 matrix.
Optionally, 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 connecting module is used for connecting any two S-NSSAI nodes in each S-NSSAI node by using a double-arrow connecting line; and a second connection module, configured to, for each S-NSSAI node, point the S-NSSAI node to a DNN node corresponding to at least one DNN configured by the S-NSSAI, and/or, for each UE node, point the UE node to an S-NSSAI node corresponding to at least one S-NSSAI subscribed to the UE, so as to obtain a directed topology graph.
In a third aspect, an embodiment of the present application further provides an electronic device, including: a processor, a memory and a bus, the memory storing processor-executable machine-readable instructions, the processor and the memory communicating via the bus when the electronic device is running, the machine-readable instructions being executed by the processor to perform the steps of the S-NSSAI prioritization method according to the first aspect or any of the possible implementations of the first aspect.
In a fourth aspect, this embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored, where the computer program is executed by a processor to perform the step of prioritizing the S-NSSAI in the first aspect or any possible implementation manner of the first aspect.
The method for determining the priority of the S-NSSAI is applied to a network data analysis function NWDAF, and comprises the following steps: acquiring slice data in a network framework of a core network, wherein the slice data is used for describing at least one piece of single network slice selection auxiliary information S-NSSAI subscribed by each UE in at least one piece of 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-NSSAIs in the slice data by presetting a damping factor, a transfer matrix and a distribution matrix. According to the method and the device, the priority of each S-NSSAI in the core network is calculated, so that a 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 aforementioned objects, features and advantages of the present application comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
To more clearly illustrate the technical solutions of the embodiments of the present application, the drawings needed in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present application and therefore should not be considered as limiting the scope, and those skilled in the art can also obtain other related drawings based on the drawings without inventive efforts.
Fig. 1 shows a flowchart of a method for prioritizing S-NSSAI according to an embodiment of the present application.
Fig. 2 shows a schematic diagram of a directed topology provided in an embodiment of the present application.
Fig. 3 is a flowchart illustrating a step of determining a priority matrix corresponding to all S-NSSAIs in slice data by presetting a damping factor, a transition matrix, and a distribution matrix according to an embodiment of the present application.
Fig. 4 is a functional block diagram of an apparatus for prioritizing S-NSSAI according to an embodiment of the present application.
Fig. 5 shows a schematic structural diagram of an electronic device provided in an embodiment of the present application.
Detailed Description
To make the purpose, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it should be understood that the drawings in the present application are for illustrative and descriptive purposes only and are not used to limit the scope of protection of the present application. Additionally, it should be understood that the schematic drawings are not necessarily drawn to scale. The flowcharts used in this application illustrate operations implemented according to some embodiments of the present application. It should be understood that the operations of the flow diagrams may be performed out of order, and that steps without logical context may be performed in reverse order or concurrently. One skilled in the art, under the guidance of this application, may add one or more other operations to, or remove one or more operations from, the flowchart.
In addition, the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. The components of the embodiments of the present application, generally described and illustrated in the figures herein, can be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, presented in the accompanying drawings, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments of the application. All other embodiments, which can be obtained by a person skilled in the art without making any inventive step based on the embodiments of the present application, fall within the scope of protection of the present application.
In the prior art, the network resources of each communication operator are constant, and no reference is made for how many network resources should be allocated to each S-NSSAI corresponding to the 5G core network of the communication operator, so that reasonable allocation of the network resources cannot be realized.
Based on this, the embodiment of the present application provides a method and an apparatus for determining priorities of S-NSSAIs, so that a communications operator allocates network resources by referring to the priorities of each S-NSSAI by calculating the priority of each S-NSSAI in a core network, thereby solving the technical problem that network resources cannot be reasonably allocated in the prior art, and achieving the technical effect of reasonably allocating network resources, which are specifically as follows:
referring to fig. 1, fig. 1 is a flowchart of a method for prioritizing S-NSSAI according to an embodiment of the present application. As shown in fig. 1, a method for determining a priority of an S-NSSAI provided in an embodiment of the present application includes the following steps:
s101: slice data in a network framework of a core network is obtained, the slice data being used for describing at least one single network slice selection assistance information S-NSSAI to which each of at least one user equipment UE subscribes, and at least one data network name DNN configured for each of the at least one S-NSSAI.
The priority determination method of the S-NSSAI is applied to a Network Data analysis Function (NWDAF). That is, at least one S-NSSAI to which each UE of the at least one UE subscribes and at least one DNN configured for each of the at least one S-NSSAI to which each UE subscribes are obtained.
The network construction of the 5G core network comprises the following steps: AMF (Access and Mobility Management Function), UDM (Unified Data Management), NSSF (Network Slice Selection Function).
The NWDAF acquires at least one single Network slice selection auxiliary information S-NSSAI subscribed by each UE from the NSSF, and the NWDAF acquires at least one Data Network Name DNN (Data Network Name) configured for each S-NSSAI from the UDM.
That is, the at least one S-NSSAI to which users are subscribed for the NWDAF may be set by the communications operator. The number of S-NSSAIs in the slice data should be greater than one.
After obtaining slice data in a network framework of a core network, the slice data describing at least one single network slice selection assistance information S-NSSAI to which each of at least one user equipment UE is subscribed and at least one data network name DNN configured for each of the at least one S-NSSAI, the method further comprises: judging whether the number of S-NSSAIs in the slice data is greater than one; if the number of the S-NSSAIs in the slice data is larger than one, each S-NSSAI, each DNN in at least one DNN and each UE are used as nodes, and a directed topology graph is constructed according to the slice data; if the number of the S-NSSAIs in the slice data is less than or equal to one, determining the S-NSSAI as a target S-NSSAI, and acquiring at least one S-NSSAI subscribed by other UEs except the UE corresponding to the target S-NSSAI and at least one data network name DNN configured for each S-NSSAI in the at least one S-NSSAI again to increase the number of the S-NSSAIs.
Because each UE subscribes to at least one S-NSSAI, if only one S-NSSAI subscribed by one UE is acquired, the priority of the S-NSSAI is considered to be the maximum. Therefore, to calculate the priority of different S-NSSAIs, it is necessary to guarantee that the number of S-NSSAIs is greater than one.
S102: and 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.
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, and constructing a directed topology graph according to slice data, wherein the steps of: connecting any two S-NSSAI nodes in each S-NSSAI node by using a connecting line of a double arrow; and aiming at each S-NSSAI node, pointing the S-NSSAI node to a DNN node corresponding to at least one DNN configured by the S-NSSAI, and/or aiming at each UE node, pointing the UE node to an S-NSSAI node corresponding to at least one S-NSSAI subscribed by the UE, and obtaining a directed topology graph.
That is, the nodes of the directed topology graph include: an S-NSSAI node, a DNN node and a UE node.
For example, please refer to fig. 2, fig. 2 is a schematic diagram of a directed topology graph provided in an embodiment of the present application. As shown in fig. 2, a circle is referred to as an S-NSSAI node, a triangle is referred to as a UE node, a square is referred to as a DNN node, any two S-NSSAI nodes are connected by a double arrow, each S-NSSAI node points to the DNN node corresponding to the S-NSSAI, and each UE node points to the S-NSSAI node corresponding to the UE.
S103: and determining a distribution matrix and a transfer matrix according to the connection relation among all 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 topology graph, wherein the method comprises the following steps: determining the total number of nodes of the directed topological graph and the node label of each node; determining the reciprocal of the total number of the nodes as the element value of each element of the distribution matrix, wherein the row number of each element of the distribution matrix corresponds to the node label, and the column number of each element of the distribution matrix is one; aiming at each node in the directed topological graph, constructing a transfer matrix according to the node label of at least one out-link node of the node and the total out-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 means that the initial influence of each node is assumed to be the same, and then the element value of each element of the distribution matrix is the reciprocal of the total number of nodes, and each element of the distribution matrix means the initial influence of the node corresponding to the element. The distribution matrix is an n-dimensional column vector, n referring to the total number of nodes.
As shown in fig. 2, the total number of nodes of the directed topology graph is 9,1 refers to the first S-NSSAI node with node number 1, 2 refers to the second S-NSSAI node with node number 2, 3 refers to the third S-NSSAI node with node number 3, 4 refers to the first UE node with node number 4, 5 refers to the second UE node with node number 5, 6 refers to the third UE node with node number 6, 7 refers to the first DNN node with node number 7, 8 refers to the second DNN node with node number 8, and 9 refers to the third DNN node with node number 9. Distribution matrix of directed topology graph
Distribution matrix R 0 Is a 9-dimensional column matrix, distribution matrix R 0 The number of rows in each element is equal to the node label of the node to which the element corresponds, and the value of the element in each element is one-ninth. That is, the first row and the first column correspond to the first S-NSSAI node with node number 1, and the initial influence of the first S-NSSAI node is one ninth.
The number of rows and columns of the transfer matrix is equal to the number of total nodes; aiming at each node in the directed topological graph, according to the node label of at least one out-link node of the node and the total out-link node number of the node, constructing a transfer matrix, comprising the following steps: for each column in the transfer matrix, determining a node corresponding to a node label with the same column number as the column as a target node of the column; finding out target elements corresponding to the row number which is the same as the node label number of at least one out-link node of the target nodes of the column in each element of the column; determining the reciprocal of the total number of the link points of the target nodes in the row 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 outlink nodes of 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 with node number 1 includes three exit link points: a second S-NSSAI node with node designation 2, a third S-NSSAI node with node designation 3, and a first DNN node with node designation 7; the second S-NSSAI node, node number 2, includes three exit 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-NSSAI node, node designation 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 out-link node: a first S-NSSAI node with node designation 1; the second UE node with node number 5 comprises an out-link node: a first S-NSSAI node with node designation 1; the third UE node with node number 6 includes an out-link node: a second S-NSSAI node having node designation 2; the nodes with node numbers 7, 8 and 9 have no chain link points.
Furthermore, for the first column in the transfer matrix, the target node of the first column is the first S-NSSAI node with the node label 1; the element of the second row and the first column, the element of the third row and the first column and the element of the seventh row and the first column are target elements of the first column, and the values of the element of the second row and the first column, the element of the third row and the first column and the element of the seventh row and the first column are determined to be one third; determining the element value of the elements in the first column except the elements in the second row and the first column, the elements in the third row and the first column and the elements in the seventh row and the first column as 0; the above calculation is also performed for other columns, which is not described herein again, so as to obtain the transition matrix M.
S104: and determining a priority matrix corresponding to all S-NSSAIs in the slice data by presetting a damping factor, a transfer matrix and a distribution matrix, so that the priority of the S-NSSAI corresponding to each element is determined according to the element value of the element in the priority matrix.
That is, one priority matrix corresponding to all S-NSSAIs in the slice data is obtained.
Referring to fig. 3, fig. 3 is a flowchart illustrating a step of determining a priority matrix corresponding to all S-NSSAIs in slice data according to a preset damping factor, a transition matrix, and a distribution matrix according to an embodiment of the present application. As shown in fig. 3, determining the priority matrix corresponding to all S-NSSAIs in the slice data by presetting the damping factor, the transition matrix, and the distribution matrix includes:
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 value matrix.
S203: and judging whether the element value of each element in the difference value 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 a 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, the process returns to step S201, the distribution matrix is updated again through the preset damping factor, the transfer matrix and the updated distribution matrix, and the update times is increased by one.
Updating the distribution matrix by presetting a damping factor, a transfer matrix and the distribution matrix, wherein the updating comprises the following steps:
the distribution matrix is updated by the following formula:
in the formula (1), R t+1 Refers to the distribution matrix of the t +1 th update, d refers to the preset damping factor, M refers to the transfer matrix, R t The distribution matrix of the t-th update is referred to, n is the total node number of the directed topology graph, and alpha is a preset column vector.
Where α is an n-dimensional column vector, the number of rows of α is equal to the number of total nodes, 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, and R is 0 Substituting into formula (1) to obtain R1, wherein the number of updates is 1, and continuously updating until R t+1 And R t By approximation, i.e. by adding R t+1 Minus R t And obtaining a difference matrix, wherein each element in the difference matrix is smaller than a preset difference.
All priority matrixes corresponding to the S-NSSAI in the slice data are n-dimensional column vectors, and the row number of each element in the priority matrixes 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 size of the element values; and determining the sequence of the at least one sequenced 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 in the first row and the first column in the priority matrix is the priority value of the first S-NSSAI node with the node number 1, the element value of the element in the second row and the first column in the priority matrix is the priority value of the second S-NSSAI node with the node number 2, and the element value of the element in the third row and the first column in the priority matrix is the priority value of the third S-NSSAI node with the node number 3.
The priority values of the S-NSSAI nodes can be arranged in a descending order, the order of the S-NSSAI nodes after the descending order is determined as the priority of the S-NSSAI corresponding to the S-NSSAI node, and the S-NSSAI corresponding to the top S-NSSAI node is considered to have the largest priority and need the most network resources. Therefore, a communication operator can allocate more network resources to the S-NSSAI corresponding to the top S-NSSAI node, and the network resources can be understood as the flow rate which can be provided by the communication operator every minute.
Or, the Priority of the S-NSSAI obtained in the present application may also be used as one of reference indicators of a Priority (cell Reselection Priority) of cell Reselection, where the cell Reselection refers to that the UE selects a cell with the best signal quality to provide a service signal by monitoring signal qualities of a neighboring cell and a current cell in an idle mode. Further, the communication operator can freely set the priority of cell reselection with reference to the priority of S-NSSAI supported by each cell.
Based on the same application concept, the embodiment of the present application further provides an S-NSSAI priority determination apparatus corresponding to the S-NSSAI priority determination method provided in the above embodiment, and since the principle of solving the problem of the apparatus in the embodiment of the present application is similar to that of the S-NSSAI priority determination method in the above embodiment of the present application, the apparatus may be implemented by referring to the implementation of the method, and the repeated parts are not described again.
Referring to fig. 4, fig. 4 is a functional block diagram of an S-NSSAI prioritization apparatus according to an embodiment of the present application. The priority determination device 10 for 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-NSSAI subscribed to by each UE of at least one user equipment UE, and at least one data network name DNN configured for each S-NSSAI of the at least one S-NSSAI; a constructing module 102, configured to construct a directed topology graph with each S-NSSAI, each DNN of the at least one DNN, and each UE as nodes according to the slice data; a first determining module 103, configured to determine a distribution matrix and a transfer matrix according to a connection relationship between nodes in the directed topology graph; the second determining module 104 is configured to determine, through a preset damping factor, a transition matrix, and a distribution matrix, a priority matrix corresponding to all S-NSSAIs in slice data, so that a priority of the S-NSSAI corresponding to each element in the priority matrix is determined according to a size of 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 connecting module is used for connecting any two S-NSSAI nodes in each S-NSSAI node by using a double-arrow connection line;
and a second connection module, configured to, for each S-NSSAI node, point the S-NSSAI node to a DNN node corresponding to at least one DNN configured by the S-NSSAI, and/or, for each UE node, point the UE node to an S-NSSAI node corresponding to at least one S-NSSAI subscribed to the UE, so as to obtain a directed topology graph.
Based on the same application concept, referring to fig. 5, a schematic structural diagram of an electronic device provided in the embodiment of the present application is shown, where the electronic device 20 includes: a processor 201, a memory 202 and a bus 203, wherein the memory 202 stores machine-readable instructions executable by the processor 201, when the electronic device 20 is running, the processor 201 communicates with the memory 202 via the bus 203, and the machine-readable instructions are executed by the processor 201 to perform the steps of the S-NSSAI prioritization method according to any of the above embodiments.
In particular, the machine readable instructions, when executed by the processor 201, may perform the following: acquiring slice data in a network framework 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; constructing a directed topology graph according to the slice data with the each S-NSSAI, each DNN of the at least one DNN and the each UE as nodes; determining a distribution matrix and a transfer matrix according to the connection relation between each node in the directed topological graph; and determining a priority matrix corresponding to all S-NSSAIs in the slice data by presetting a damping factor, the transfer matrix and the distribution matrix, so that the priority of the S-NSSAI corresponding to each element is determined according to the element value of the element in the priority matrix.
Based on the same application concept, the present application further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the computer program performs the steps of the S-NSSAI priority determination method provided in the foregoing embodiment.
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 priority determination method for S-NSSAI can be executed.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the system and the apparatus described above may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again. In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one logical division, and there may be other divisions when actually implemented, and for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of devices or units through some communication interfaces, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed 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 can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into 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 the form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the 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 priority determination method of S-NSSAI is applied to a network data analysis function (NWDAF), and comprises the following steps:
acquiring slice data in a network framework 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 the slice data;
determining a distribution matrix and a transfer matrix according to the connection relation between each node in the directed topological graph;
and determining a priority matrix corresponding to all S-NSSAIs in the slice data by presetting a damping factor, the transfer matrix and the distribution matrix, so that the priority of the S-NSSAI corresponding to each element is determined according to the element value of the element in the priority matrix.
2. The method of claim 1, wherein each S-NSSAI corresponds to one S-NSSAI node, wherein each DNN corresponds to one DNN node, and wherein each UE corresponds to one UE node; the constructing a directed topology graph according to the slice data with the each S-NSSAI, each DNN of the at least one DNN, and the each UE as nodes includes:
connecting any two S-NSSAI nodes in each S-NSSAI node by using a connecting line of a double arrow;
and aiming at each S-NSSAI node, pointing the S-NSSAI node to a DNN node corresponding to at least one DNN configured by the S-NSSAI, and/or aiming at each UE node, pointing the UE node to an S-NSSAI node corresponding to at least one S-NSSAI subscribed by the UE, and obtaining a directed topology graph.
3. The method according to claim 1, wherein the determining a distribution matrix and a transition matrix according to the connection relationship between nodes in the directed topology graph includes:
determining the total number of nodes of the directed topology graph and the node label of each node;
determining the reciprocal of the total node number as an element value of each element of a distribution matrix, wherein the row number of each element of the distribution matrix corresponds to the node label number, and the column number of each element of the distribution matrix is one;
aiming at each node in the directed topological graph, constructing a transfer matrix according to the node label of at least one out-link node of the node and the total out-link node number of the node; the at least one exit link point of the node refers to the at least one node to which the node points.
4. The priority determination method of claim 3, wherein the number of rows and columns of the transition matrix is equal to the total number of nodes; the method for constructing the transfer matrix for each node in the directed topology graph according to the node label of at least one out-link node of the node and the total out-link node number of the node comprises the following steps:
for each column in the transfer matrix, determining a node corresponding to a node label with the same column number as the column as a target node of the column;
finding out target elements corresponding to the row number which is the same as the node label number of at least one out-link node of the target nodes of the column in each element of the column;
determining the reciprocal of the total 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 according to claim 1, wherein the determining the priority matrix corresponding to all S-NSSAIs in the slice data by presetting a damping factor, the transition matrix, and the distribution matrix comprises:
updating the distribution matrix through a preset 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 value matrix;
judging whether the element value of each element in the difference matrix is smaller than a preset difference value or not;
and if the element value of each element in the difference matrix is smaller than a preset difference, determining the updated distribution matrix as the priority matrix.
6. The method of claim 5, wherein the updating the distribution matrix by a preset damping factor, the transition matrix, and the distribution matrix comprises:
updating the distribution matrix by the following formula:
in the formula, R t+1 Refers to the distribution matrix of the t +1 th update, d refers to the preset damping factor, M refers to the transfer matrix, R t The distribution matrix of the t-th update is referred to, n is the total node number of the directed topology graph, and alpha is a preset column vector.
7. An S-NSSAI priority determination device, comprising:
an obtaining module, configured to obtain slice data in a network framework of a core network, where the slice data is used to describe at least one single network slice selection assistance information S-NSSAI subscribed to by each UE of at least one user equipment UE, and at least one data network name DNN configured by each S-NSSAI of the at least one S-NSSAI;
a building module, configured to take each S-NSSAI, each DNN of the at least one DNN, and each UE as nodes, and build a directed topology graph according to the slice data;
a first determining module, configured to determine a distribution matrix and a transfer matrix according to a connection relationship between nodes in the directed topology graph;
a second determining module, configured to determine, through a preset damping factor, the transfer matrix, and the distribution matrix, a priority matrix corresponding to all S-NSSAIs in the slice data, so as to determine, according to an element value of each element in the priority matrix, a priority of the S-NSSAI corresponding to the element.
8. The apparatus of claim 7, wherein each S-NSSAI corresponds to one S-NSSAI node, wherein each DNN corresponds to one DNN node, and wherein each UE corresponds to one UE node; the building module further comprises:
the first connecting module is used for connecting any two S-NSSAI nodes in each S-NSSAI node by using a double-arrow connection line;
and a second connection module, configured to, for each S-NSSAI node, point the S-NSSAI node to a DNN node corresponding to at least one DNN configured by the S-NSSAI, and/or, for each UE node, point the UE node to an S-NSSAI node corresponding to at least one S-NSSAI subscribed to the UE, so as to obtain a directed topology graph.
9. An electronic device, comprising: a processor, a memory and a bus, the memory storing machine-readable instructions executable by the processor, the processor and the memory communicating over the bus when the electronic device is operating, the machine-readable instructions when executed by the processor performing the steps of the S-NSSAI prioritization method of any of claims 1-6.
10. A computer-readable storage medium, having stored thereon a computer program which, when being executed by a processor, carries out the steps of the S-NSSAI prioritization method according to any one 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 true CN115696466A (en) | 2023-02-03 |
| CN115696466B 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 (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160366064A1 (en) * | 2013-07-23 | 2016-12-15 | Zte Corporation | Dynamic bandwidth scheduling method and device, and computer storage medium |
| 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 |
| US20200359291A1 (en) * | 2017-10-09 | 2020-11-12 | Telefonaktiebolaget Lm Ericsson (Publ) | Methods for establishing connection for packet data transfer of a wireless communication device |
| 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 |
-
2022
- 2022-09-23 CN CN202211165599.5A patent/CN115696466B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160366064A1 (en) * | 2013-07-23 | 2016-12-15 | Zte Corporation | Dynamic bandwidth scheduling method and device, and computer storage medium |
| CN110431888A (en) * | 2017-03-17 | 2019-11-08 | 高通股份有限公司 | Non-compatible network is sliced and carries out priority ranking |
| US20200359291A1 (en) * | 2017-10-09 | 2020-11-12 | Telefonaktiebolaget Lm Ericsson (Publ) | Methods for establishing connection for packet data transfer of a wireless communication device |
| 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 |
|---|---|
| CN115696466B (en) | 2023-06-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109032801B (en) | Request scheduling method, system, electronic equipment and storage medium | |
| CN108009016B (en) | Resource load balancing control method and cluster scheduler | |
| CN107656807B (en) | Automatic elastic expansion method and device for virtual resources | |
| CN109981744B (en) | Data distribution method and device, storage medium and electronic equipment | |
| CN111597054B (en) | Information processing method, system, electronic equipment and storage medium | |
| CN114265927A (en) | Data query method and device, storage medium and electronic device | |
| CN113746763B (en) | Data processing method, device and equipment | |
| CN111123869B (en) | Flexible job shop scheduling method and device based on worker operation experience | |
| CN115696466A (en) | S-NSSAI priority determination method and device | |
| CN111049750B (en) | Message forwarding method, system and equipment | |
| CN110674134B (en) | Geographic information data storage method, query method and device | |
| CN109245948B (en) | Security-aware virtual network mapping method and device | |
| CN107301017B (en) | Data storage method and device | |
| CN106533730B (en) | Hadoop cluster component index acquisition method and device | |
| CN114553717A (en) | Network node dividing method, device, equipment and storage medium | |
| CN108520025B (en) | Service node determination method, device, equipment and medium | |
| CN110149234B (en) | Graph data compression method, device, server and storage medium | |
| CN111324444A (en) | Cloud computing task scheduling method and device | |
| CN110502338B (en) | Performance capacity expansion prediction method and device, computing equipment and storage medium | |
| CN114826936B (en) | Method and system for determining key node set of weighted network communication efficiency | |
| CN117370619B (en) | Method and device for storing and sub-sampling images in fragments | |
| CN113395342B (en) | Power grid monitoring system preposed service scheduling method based on load balanced distribution | |
| CN111179376B (en) | Method and device for generating flow node diagram, storage medium and electronic equipment | |
| CN112364530B (en) | Parameter coupling method and device and computer equipment | |
| CN114245462A (en) | DBFO-based wireless ad hoc network channel allocation optimization method and device |
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 |