CN117640427A - Network slice acquisition method and device, storage medium and electronic equipment - Google Patents

Network slice acquisition method and device, storage medium and electronic equipment Download PDF

Info

Publication number
CN117640427A
CN117640427A CN202210955528.9A CN202210955528A CN117640427A CN 117640427 A CN117640427 A CN 117640427A CN 202210955528 A CN202210955528 A CN 202210955528A CN 117640427 A CN117640427 A CN 117640427A
Authority
CN
China
Prior art keywords
index
network slice
sla
target
service
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202210955528.9A
Other languages
Chinese (zh)
Inventor
曹亚平
孙颖
邓桓
郑洁莹
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Telecom Corp Ltd
Original Assignee
China Telecom Corp Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China Telecom Corp Ltd filed Critical China Telecom Corp Ltd
Priority to CN202210955528.9A priority Critical patent/CN117640427A/en
Publication of CN117640427A publication Critical patent/CN117640427A/en
Pending legal-status Critical Current

Links

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The application belongs to the technical field of networks, and relates to a network slice acquisition method, a device, a storage medium and electronic equipment. The method comprises the following steps: acquiring a service demand index corresponding to a target service, and performing recursion searching in a Service Level Agreement (SLA) tree structure according to the service demand index to acquire a target leaf node; acquiring a network slice mapping table, and determining a target network slice in the network slice mapping table according to the target leaf node; the SLA tree structure is formed by constructing according to the index type and the index level corresponding to the target service. The user SLA demand can be rapidly mapped to the corresponding network slice based on the SLA tree structure and the network slice mapping table, the efficiency of acquiring the network slice corresponding to the user service demand and opening the user service is improved, the demand of agilely opening the user service is met, and the network capacity of an operator is improved.

Description

Network slice acquisition method and device, storage medium and electronic equipment
Technical Field
The present disclosure relates to the field of network technologies, and in particular, to a network slice acquisition method, a network slice acquisition system, a computer storage medium, and an electronic device.
Background
With the continuous evolution of communication networks such as 5G ((5 th Generation Mobile Communication Technology, fifth generation mobile communication technology), the differentiated requirements of the vertical industry on the communication networks are increasingly obvious, the service level protocol SLA (Service Level Agreement) index is also more complex, and the differentiated requirements on the index number and the index level are more and more outstanding.
At present, after the service requirement of a user is acquired, the index type and the index level in the service requirement are respectively compared with each index type and each index level in the service level agreement SLA to acquire a corresponding network slice, but along with the improvement of the complexity of the SLA, the method for acquiring the network slice is time-consuming, low in efficiency and high in system overhead, cannot meet the requirement of quick opening of the service of the user, and is also unfavorable for the improvement of the network capability of an operator.
It should be noted that the information disclosed in the foregoing background section is only for enhancing understanding of the background of the present application.
Disclosure of Invention
The invention aims to provide a network slice acquisition method, a network slice acquisition system, a computer storage medium and electronic equipment, so that the efficiency of acquiring a network slice corresponding to user service requirements and opening user services is improved at least to a certain extent, the requirements of agilely opening the user services are met, and the network capacity of operators is improved.
Other features and advantages of the present application will be apparent from the following detailed description, or may be learned in part by the practice of the application.
According to a first aspect of the present application, there is provided a network slice acquisition method, including:
acquiring a service demand index corresponding to a target service, and performing recursion searching in a Service Level Agreement (SLA) tree structure according to the service demand index to acquire a target leaf node;
acquiring a network slice mapping table, and determining a target network slice in the network slice mapping table according to the target leaf node;
the SLA tree structure is formed by constructing according to the index type and the index level corresponding to the target service.
According to a second aspect of the present application, there is provided a network slice acquisition apparatus comprising:
the searching module is used for acquiring a service demand index corresponding to the target service, and carrying out recursion searching in the service level agreement SLA tree structure according to the service demand index so as to acquire a target leaf node;
the determining module is used for obtaining a network slice mapping table and determining a target network slice in the network slice mapping table according to the target leaf node;
The SLA tree structure is formed by constructing according to the index type and the index level corresponding to the target service.
According to a third aspect of the present application, there is provided a computer storage medium having stored thereon a computer program, characterized in that the computer program, when executed by a processor, implements the network slice acquisition method described above.
According to a fourth aspect of the present application, there is provided an electronic device, comprising:
a processor; and
a memory for storing executable instructions of the processor;
wherein the processor is configured to perform the network slice acquisition method described above via execution of the executable instructions.
As can be seen from the above technical solutions, the network slice acquiring method, the network slice acquiring device, the computer storage medium and the electronic device in the exemplary embodiments of the present application have at least the following advantages and positive effects:
according to the network slice obtaining method, after obtaining the service demand index corresponding to the target service, recursion searching is carried out in the service level agreement SLA tree structure according to the service demand index to obtain the target leaf node, and then the target network slice is determined in the network slice mapping table according to the target leaf node, wherein the SLA tree structure is formed by constructing according to the index type and the index level corresponding to the target service. According to the embodiment of the application, on one hand, an SLA tree structure can be constructed based on the index type and the index level corresponding to the target service, and recursive search is performed in the SLA tree structure according to the service demand index, so that the efficiency of acquiring the target leaf node is improved; on the other hand, after the SLA tree structure is formed, network slices are correspondingly arranged for each path in the SLA tree structure, and on the basis of improving the efficiency of acquiring the target leaf nodes, the efficiency of acquiring the target network slices is also improved, so that the opening and the use of user services based on the target network slices are realized, and the user experience and the network capacity of operators are further improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and together with the description, serve to explain the principles of the application. It is apparent that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained from these drawings without inventive effort for a person of ordinary skill in the art.
Fig. 1 schematically shows a structural diagram of a system architecture to which the network slice acquisition method in the embodiment of the present application is applied.
Fig. 2 schematically shows a flowchart of a network slice acquisition method in an embodiment of the present application.
Fig. 3 schematically shows a flowchart of constructing an SLA tree structure according to an index type and an index level in an embodiment of the present application.
Fig. 4 schematically shows a structural schematic diagram of an SLA tree structure in an embodiment of the present application.
Fig. 5 schematically illustrates a linked list of children corresponding to the SLA tree structure illustrated in fig. 4 in an embodiment of the present application.
Fig. 6 schematically shows a structural schematic diagram of an SLA tree structure constructed according to SLA text corresponding to the 5G service in the embodiment of the present application.
Fig. 7 schematically illustrates a linked list of children corresponding to the SLA tree structure illustrated in fig. 6 in an embodiment of the present application.
Fig. 8 schematically illustrates a structural diagram of a network slice mapping table in an embodiment of the present application.
Fig. 9 schematically shows a block diagram of the network slice acquisition apparatus in the present application.
Fig. 10 schematically illustrates a block diagram of a computer system suitable for use in implementing embodiments of the present application.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. However, the exemplary embodiments may be embodied in many forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the example embodiments to those skilled in the art.
Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the present application. One skilled in the relevant art will recognize, however, that the aspects of the application can be practiced without one or more of the specific details, or with other methods, components, devices, steps, etc. In other instances, well-known methods, devices, implementations, or operations are not shown or described in detail to avoid obscuring aspects of the application.
The terms "a," "an," "the," and "said" are used in this specification to denote the presence of one or more elements/components/etc.; the terms "comprising" and "having" are intended to be inclusive and mean that there may be additional elements/components/etc. in addition to the listed elements/components/etc.; the terms "first" and "second" and the like are used merely as labels, and are not intended to limit the number of their objects.
The block diagrams depicted in the figures are merely functional entities and do not necessarily correspond to physically separate entities. That is, the functional entities may be implemented in software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.
The flow diagrams depicted in the figures are exemplary only, and do not necessarily include all of the elements and operations/steps, nor must they be performed in the order described. For example, some operations/steps may be decomposed, and some operations/steps may be combined or partially combined, so that the order of actual execution may be changed according to actual situations.
With the continuous evolution of communication networks, the differentiated demands of the vertical industry on communication networks have increased significantly from earlier 2G, 3G, to present 4G, 5G, to future 6G, etc. With the increasing complexity of Service Level Agreement (SLA) indexes, how to rapidly map the service demands of users to a network slice capable of meeting the guarantee demands is a current urgent problem to be solved.
Aiming at the problems in the related art, the application provides a network slice acquisition method, which relates to the construction of a service level agreement SLA tree structure and the acquisition of a network slice.
Before describing the technical solutions in the embodiments of the present application in detail, technical terms that may be related to the embodiments of the present application are first explained and described.
(1) Service level agreement: service Level Agreement, abbreviated as SLA, refers to a commonly accepted agreement or contract between the business providing the service and the customer regarding quality, level, performance, etc. of the service.
(2) Network slice: the method is an on-demand networking mode, and operators can separate a plurality of virtual end-to-end networks on a unified infrastructure, and each network slice is logically isolated from a wireless access network to a bearing network and then to a core network so as to adapt to various types of applications. In one network slice, the method can be divided into at least three parts of a wireless network sub-slice, a bearing network sub-slice and a core network sub-slice.
(3) Tree structure: a tree structure is a hierarchy of nested structures. The outer and inner layers of a tree structure have similar structures, so that the structure can be represented recursively.
(4) Leaf nodes: leaf nodes are concepts in discrete mathematics, and nodes without sub-nodes (i.e., degree 0) in a tree are called leaf nodes, called "leaves" for short, and are also called terminal nodes.
(5) Child linked list representation: is a storage mode of the tree, and the storage process is as follows: starting from the root node of the tree, each node in the tree is sequentially stored by using the sequence table, and the child linked list representation is provided with a linked list for each node, so that the child nodes of each node are stored in the positions in the sequence table. If a node does not have a child node (leaf node), then the linked list of that node is an empty linked list.
After introducing terms that may be related to embodiments of the present application, a detailed description is given of a network slice acquisition method in the present application.
Fig. 1 schematically shows a block diagram of an exemplary system architecture to which the technical solution of the present application is applied.
As shown in fig. 1, a system architecture 100 may include a terminal device 101, a server 102, and a network 103. The terminal device 101 may include various electronic devices with display screens, such as a smart phone, a tablet computer, a notebook computer, a desktop computer, a smart television, and a smart vehicle terminal. The server 102 may be an independent physical server, a server cluster or a distributed system formed by a plurality of physical servers, or a cloud server providing cloud computing services. The network 103 may be a communication medium of various connection types capable of providing a communication link between the terminal device 101 and the server 102, and may be a wired communication link or a wireless communication link, for example.
The system architecture in the embodiments of the present application may have any number of terminal devices, networks, and servers, as desired for implementation. For example, the server may be a server group composed of a plurality of server devices.
In one embodiment of the present application, the network slice obtaining method may be applied to the terminal device 101 or the server 102, taking application to the server 102 as an example, an operator may send all SLA index information designed in the service system from the terminal device 101 to the server 102 through the network 103, and after the server 102 receives all SLA index information, the server 102 may construct an SLA tree structure according to the index type and the index level included in the SLA index information. Then, the service requirement index of the user can be input to the terminal equipment 101 through the input equipment built in or externally connected to the terminal equipment 101, the terminal equipment 101 can send the service requirement index to the server 102 through the network 103, so that the server 102 recursively searches the target leaf node corresponding to the service requirement index in the SLA tree structure according to the service requirement index, finally, a target network slice corresponding to the target leaf node can be obtained based on the network slice mapping table, and then, the user service is opened based on the obtained target network slice, so that the normal use of the user is ensured.
As described above, the technical solution provided in the embodiment of the present application may be applied to the terminal device 101 or the server 102, and when the server 102 performs the network slice acquisition method in the present application, the server may be a cloud server that provides cloud computing services.
Cloud computing (clouding) is a computing model that distributes computing tasks across a large pool of computers, enabling various application systems to acquire computing power, storage space, and information services as needed. The network that provides the resources is referred to as the "cloud". Resources in the cloud are infinitely expandable in the sense of users, and can be acquired at any time, used as needed, expanded at any time and paid for use as needed.
As a basic capability provider of cloud computing, a cloud computing resource pool (cloud platform for short, generally referred to as IaaS (Infrastructure as a Service, infrastructure as a service) platform) is established, in which multiple types of virtual resources are deployed for external clients to select for use.
According to the logic function division, a PaaS (Platform as a Service ) layer can be deployed on an IaaS (Infrastructure as a Service ) layer, and a SaaS (Software as a Service, software as a service) layer can be deployed above the PaaS layer, or the SaaS can be directly deployed on the IaaS. PaaS is a platform on which software runs, such as a database, web container, etc. SaaS is a wide variety of business software such as web portals, sms mass senders, etc. Generally, saaS and PaaS are upper layers relative to IaaS.
The following describes in detail the network slice acquiring method, the network slice acquiring device, the computer readable medium, the electronic device and other technical schemes provided in the present application with reference to the specific embodiments.
Fig. 2 shows a flowchart of a network slice acquisition method, as shown in fig. 2, including:
step S210: acquiring a service demand index corresponding to a target service, and performing recursion searching in a Service Level Agreement (SLA) tree structure according to the service demand index to acquire a target leaf node; the SLA tree structure is formed by constructing according to the index type and the index level corresponding to the target service;
step S220: and acquiring a network slice mapping table, and determining a target network slice in the network slice mapping table according to the target leaf node.
According to the network slice obtaining method, after obtaining the service demand index corresponding to the target service, recursively searching in the service level agreement SLA tree structure according to the service demand index to obtain the target leaf node, and then determining the target network slice in the network slice mapping table according to the target leaf node, wherein the SLA tree structure is formed by constructing according to the index type and the index level corresponding to the target service. According to the embodiment of the application, on one hand, an SLA tree structure can be constructed based on the index type and the index level corresponding to the target service, and recursive search is performed in the SLA tree structure according to the service demand index, so that the efficiency of acquiring the target leaf node is improved; on the other hand, after the SLA tree structure is formed, network slices are correspondingly arranged for each path in the SLA tree structure, and on the basis of improving the efficiency of acquiring the target leaf nodes, the efficiency of acquiring the target network slices is also improved, so that the opening and the use of user services based on the target network slices are realized, and the user experience and the network capacity of operators are further improved.
The steps of the network slice acquisition method shown in fig. 2 are described in detail below.
In step S210, obtaining a service requirement index corresponding to a target service, and performing recursive lookup in a service level agreement SLA tree structure according to the service requirement index to obtain a target leaf node; the SLA tree structure is formed by constructing according to the index type and the index level corresponding to the target service.
In the exemplary embodiment of the present application, before determining the network slice corresponding to the user's service requirement index, a tree structure may be formed according to the pre-designed SLA index, and each path in the tree structure is mapped to the corresponding network slice, so that after the user's service requirement index is obtained, the target network slice corresponding to the user's service requirement index may be quickly obtained.
In the exemplary embodiment of the present application, when forming a tree structure according to a pre-designed SLA index, firstly, a service level agreement SLA text corresponding to a target service is obtained; and then extracting all index types and index levels from the SLA text, and constructing an SLA tree structure according to all the index types and index levels. The index type is the type of all indexes related to the target service, the index level is the grading information related to each index type and used for evaluating the service quality, for example, a 5G service can be taken as an example, the SLA text can comprise a plurality of index types, and specifically can comprise indexes such as bandwidth, time delay, packet loss rate and the like, each index type corresponds to one or more index levels, for example, the bandwidth is divided into three levels of 50MHz, 100MHz and 200MHz, the time delay is divided into two levels of less than 20ms and greater than 20ms, the packet loss rate is divided into two levels of less than 5% and greater than 5%, and the like.
Fig. 3 schematically illustrates a flow chart of constructing an SLA tree structure according to index types and index levels, as illustrated in fig. 3, in step S301, a correspondence between the index levels is obtained, and levels of each of the index types are determined according to the correspondence; in step S302, a plurality of layers that do not include root nodes in the SLA tree structure are constructed according to each index type and the index level corresponding to each index type; in step S303, sub-nodes in each of the layers are constructed according to the index levels corresponding to the index types of each level; in step S304, the SLA tree structure is constructed according to the correspondence among the root node, the layer, the child node, and the child node.
The tree structure refers to a data structure in which a tree relationship of 'one-to-many' exists between data elements, so in order to form an SLA tree structure, the corresponding relationship between index levels included in different index types needs to be considered, so that the level of each index type is determined according to the corresponding relationship between index levels, and then the SLA tree structure is constructed according to the level of the index type and the index level included in the index type. For example, the index type a includes an index level a and an index level B, the index type B includes an index level c, an index level d, an index level e and an index level f, and the index level a corresponds to the index level c and the index level d, and the index level B corresponds to the index level e and the index level f. Further, the index level a and the index level B are sub-nodes in the layer constructed according to the index type A, the index level c, the index level d, the index level e and the index level f are sub-nodes in the layer constructed according to the index type B, and finally, the SLA tree structure can be constructed according to the corresponding relation among the root node, the layer, the sub-nodes and the sub-nodes.
After determining the corresponding relation among the layers, sub-nodes and sub-nodes in the tree structure, the index levels corresponding to the index types can be ordered according to the levels of the index types, then continuous index numbers are set for the ordered index levels, and the sub-nodes are represented in the SLA tree structure by adopting the index numbers. The index number may be a numeric index number, an alphabetic index number, an index number combining a number and an alphabetic index number, or the like, which is not particularly limited in the embodiment of the present application.
In the method, the SLA index is converted into the tree structure with one root node and a plurality of child nodes, each layer except the root node represents one index type, different child nodes with the same father node represent different levels of the index type of the layer, and the SLA index and each index level can be clearly mapped on the tree structure.
Fig. 4 schematically illustrates a structural schematic diagram of an SLA tree structure, as shown in fig. 4, where the SLA tree structure includes m layers, namely, a first layer (root layer) 401 corresponding to a root node, and a second layer 402, a third layer 403, a fourth layer 404, … …, and an mth layer 40m corresponding to each index type, respectively, the index levels corresponding to each index type are sub-nodes in each layer, specifically, an index number corresponding to the root node in the first layer 401 is 0, index numbers corresponding to three sub-nodes in the second layer 402 are 1,2, and 3, respectively, the index types corresponding to the third layer 403 include three index levels, respectively, the sub-nodes in the third layer 403 are sub-nodes represented by index numbers (4, 5, 6), (7, 8, 9), (10, 11, 12), the three groups of sub-nodes have the same content and correspond to the sub-nodes with index numbers 1,2, 3, respectively, the index type corresponding to the fourth layer 404 comprises two index levels, correspondingly, the sub-nodes in the fourth layer 404 are sub-nodes represented by index numbers (13, 14), (15, 16), (17, 18), (19, 20), (21, 22), (23, 24), (25, 26), (27, 28), (29, 30), the sub-nodes in the m-th layer 40m are sub-nodes represented by index numbers NS1, NS2, NS3, NS4, NS5, NS6, … …, n-1, n, respectively, wherein n is a positive integer greater than 1, and m is a positive integer.
In the exemplary embodiment of the present application, the SLA tree structure is formed by constructing according to the index type and the index level corresponding to the target service, where the target service may be one or more of all the services included in the service system, and when one target service is used, the SLA tree structure is a tree corresponding to one service, and when a plurality of target services are used, the SLA tree structure is a tree corresponding to a plurality of services, which is equivalent to a tree containing a plurality of subtrees, and when a target leaf node is obtained, a path corresponding to the corresponding service can be obtained according to the service requirement index of the user.
In the exemplary embodiment of the present application, the SLA tree structure is a complete tree including all index types and index levels, and each path from each root of the tree to a leaf node represents a combination of a set of SLA requirement indexes, so after the SLA tree structure is constructed and formed, a path corresponding to a service requirement index of a user can be quickly determined based on the SLA tree structure, and further, a corresponding target leaf node can be obtained.
When the target leaf node is obtained, the target leaf node can be obtained in a recursive search mode, namely, the target leaf node is searched from top to bottom (from a root node) in an SLA tree structure according to the service demand index of a user, the corresponding stratum is positioned in the SLA tree structure according to the index type in the service demand index, and then the corresponding sub-nodes are positioned in the positioned stratum according to the index level in the service demand index, and the steps are progressed layer by layer until the target leaf node is obtained. In the embodiment of the application, the target leaf node is obtained by recursively searching the SLA tree structure, so that the data processing amount can be reduced, the expenditure of a service system is reduced, and the searching efficiency is improved.
In the exemplary embodiment of the present application, a child linked list may also be constructed according to the SLA tree structure, and recursively searched in the child linked list according to the service requirement index of the user, so as to obtain the target leaf node.
The child linked list representation is a storage way of a tree, fig. 5 schematically shows a child linked list corresponding to the SLA tree structure shown in fig. 4, as shown in fig. 5, the child linked list includes a first linear table 501 and a second linear table 502, the first linear table 501 is a linear table composed of n+1 head pointers corresponding to a root node and n child nodes, the second linear table 502 is a linear table composed of a single linked list formed by arranging child nodes of the root node and each child node, tables corresponding to each node in the first linear table 501 and the second linear table 502 are composed of index numbers, values corresponding to the nodes and pointers, the pointers in the first linear table 501 are pointers pointing to child linked lists, and the pointers in the second linear table 502 are pointers pointing to next child nodes. It should be noted that the root node has no value, and thus, the value thereof in the table corresponding to the root node is represented by root.
After generating the child linked list according to the SLA tree structure, recursively inquiring in the child linked list according to the service demand index of the user to obtain the target leaf node.
In step S220, a network slice mapping table is obtained, and a target network slice is determined in the network slice mapping table according to the target leaf node.
In the exemplary embodiment of the present application, after the SLA tree structure is constructed and formed, a network slice corresponding to each path may be preset for a set of index data on each path, and because the leaf nodes of different paths are different, the network slice corresponding to each path is also a network slice corresponding to each leaf node, and after the target leaf node is obtained, a corresponding target network slice may be obtained according to the mapping relationship between the target leaf node and the network slice, and a service is opened based on the target network slice, so as to ensure a normal service flow of a user. In the method, the network slice is established through one-to-one correspondence with the leaf nodes of the SLA tree structure, the presetting of network slice examples of all SLA index combinations is realized, and conditions are provided for the rapid opening of subsequent services.
In an exemplary embodiment of the present application, index numbers corresponding to all leaf nodes in an SLA tree structure may be obtained, and network slice identifiers corresponding to each leaf node may be obtained at the same time, and then the index numbers corresponding to the leaf nodes and the network slice identifiers corresponding to the leaf nodes are mapped to construct a network slice mapping table, and further a target network slice corresponding to a target leaf node is determined according to the network slice mapping table. Specifically, the index number corresponding to the target leaf node may be compared with the index number in the network slice mapping table; when an index number corresponding to a target leaf node exists in the network slice mapping table, a target network slice identifier corresponding to the index number is obtained, and a network slice corresponding to the target network slice identifier is used as a target network slice.
The network slice acquisition method can be applied to various service scenes, such as 4G, 5G, 6G and other service scenes. In order to make the network slice acquisition method clearer, the network slice acquisition method of the present application will be specifically described below by taking a 5G service scenario as an example.
The SLA text comprises two index types, namely a bandwidth and a time delay index, wherein the bandwidth and the time delay index correspond to one or more index levels, specifically, the bandwidth is divided into three levels of 50MHz, 100MHz and 200MHz, and the time delay is divided into two levels of less than 20ms and more than 20 ms.
When the SLA tree structure is constructed according to the index type and the index level, as each bandwidth level corresponds to two time delay levels, the highest level of the bandwidth and the level of the time delay can be determined, correspondingly, when the SLA tree structure is formed, the layer corresponding to the bandwidth is a second layer adjacent to the first layer where the root node is located, the bandwidth level contained in the bandwidth is a sub-node in the second layer, namely a first-level sub-node, the layer corresponding to the time delay is a third layer adjacent to the second layer, and the time delay level contained in the time delay is a sub-node in the third layer, namely a second-level sub-node.
Fig. 6 schematically illustrates a structural schematic diagram of an SLA tree structure constructed according to SLA text corresponding to a 5G service, as shown in fig. 6, in the first layer 601, only one root node is provided, corresponding index numbers are 0, the second layer 602 corresponds to a bandwidth and includes three primary sub-nodes, index numbers are 1, 2 and 3 respectively, the third layer 603 corresponds to a time delay and includes six secondary sub-nodes, and index numbers are 4, 5, 6, 7, 8 and 9 respectively.
After obtaining the service demand index related to the 5G service submitted by the user, the target leaf node can be obtained by recursively searching in the SLA tree structure according to the index type and the index level in the service demand index.
Further, a child linked list can be constructed according to the SLA tree structure, recursive searching is performed in the child linked list according to index types and index levels in the service demand indexes, target leaf nodes are obtained, and then target network slices are determined according to the target leaf nodes and the network slice mapping table.
Fig. 7 schematically illustrates a child linked list corresponding to the SLA tree structure illustrated in fig. 6, and as illustrated in fig. 7, the child linked list 700 includes a first linear table 701 and a second linear table 702, the first linear table 701 includes tables corresponding to a Root node and 9 child nodes, the table corresponding to the Root node includes an index number, a Root, and a head pointer pointing to the child linked list corresponding to the Root node, the table corresponding to each child node includes an index number, a value, and a head pointer pointing to the child linked list corresponding to each child node, and the second linear table 702 includes a child linked list corresponding to the Root node 0 and child nodes 1, 2, and 3.
Assuming that the service requirement index of the user is 100Mbps bandwidth and time delay less than 20ms, recursively inquiring in a child linked list according to specific bandwidth and time delay requirements, firstly searching in the child linked list corresponding to a root node in the child linked list according to the bandwidth requirement, finding out a node with index number 2 to meet the bandwidth requirement, then searching in the child linked list corresponding to index number 2 according to the time delay requirement, and finding out a node with index number 6 to meet the time delay requirement, wherein the node with index number 6 is a leaf node, so that the node with index number 6 can be determined to be a target leaf node.
Further, the target network slice may be determined in the network slice mapping table from the target leaf node. Fig. 8 schematically illustrates a structure of a network slice mapping table, and as shown in fig. 8, network slice identifiers corresponding to leaf nodes with index numbers 4, 5, 6, 7, 8, and 9 are NS1, NS2, NS3, NS4, NS5, and NS6, respectively. The index number corresponding to the target leaf node is compared with the index number in the network slice mapping table, so that the target network slice identifier is NS3, the network slice corresponding to NS3 can be determined as the target network slice, the user service can be opened based on the target network slice, and the normal operation of the user service is ensured.
According to the network slice obtaining method, after obtaining the service demand index corresponding to the target service, recursion searching is carried out in the service level agreement SLA tree structure according to the service demand index to obtain the target leaf node, and then the target network slice is determined in the network slice mapping table according to the target leaf node, wherein the SLA tree structure is formed by constructing according to the index type and the index level corresponding to the target service. According to the embodiment of the application, on one hand, an SLA tree structure can be constructed based on the index type and the index level corresponding to the target service, and recursive search is performed in the SLA tree structure according to the service demand index, so that the efficiency of acquiring the target leaf node is improved; on the other hand, after the SLA tree structure is formed, network slices are correspondingly arranged for each path in the SLA tree structure, the efficiency of acquiring target leaf nodes is improved on the basis of improving the efficiency of acquiring target network slices, the network slices of different guarantee types are ensured to be matched according to the SLA requirements of user services, the opening time of the user services based on the target network slices is further shortened, the system efficiency is improved, and the user experience and the network capacity of operators are further improved.
The application further provides a network slice acquisition device, fig. 9 shows a schematic structural diagram of the network slice acquisition device, and as shown in fig. 9, the network slice acquisition device 900 may include a search module 901 and a determination module 902. Wherein:
the searching module 901 is configured to obtain a service requirement index corresponding to a target service, and recursively search in a service level agreement SLA tree structure according to the service requirement index to obtain a target leaf node;
a determining module 902, configured to obtain a network slice mapping table, and determine a target network slice in the network slice mapping table according to the target leaf node;
the SLA tree structure is formed by constructing according to the index type and the index level corresponding to the target service.
In one embodiment of the present application, the search module 901 is configured to:
constructing a child linked list according to the SLA tree structure;
and carrying out recursion searching in the child linked list according to the service demand index so as to acquire the target leaf node.
In one embodiment of the present application, the network slice mapping table includes index numbers of leaf nodes and network slice identifiers corresponding to the leaf nodes; the determining module 902 is configured to:
Comparing the index number corresponding to the target leaf node with the index number in the network slice mapping table;
and when the index number corresponding to the target leaf node exists in the network slice mapping table, acquiring a target network slice identifier corresponding to the index number, and taking the network slice corresponding to the target network slice identifier as the target network slice.
In one embodiment of the present application, the network slice obtaining apparatus 900 further includes:
the information extraction module is used for acquiring a service level agreement SLA text corresponding to the target service and extracting an index type and an index level corresponding to the target service from the SLA text before recursively searching in a service level agreement SLA tree structure according to the service demand index;
and the tree construction module is used for constructing the SLA tree structure according to the index type and the index level.
In one embodiment of the present application, the number of the index types is a plurality, and the number of the index levels corresponding to each index type is one or a plurality; the tree construction module includes:
the grade determining unit is used for obtaining the corresponding relation between the index grades and determining the grade of each index type according to the corresponding relation;
A layer construction unit, configured to construct a plurality of layers in the SLA tree structure that do not include root nodes according to each index type and a level corresponding to each index type;
a sub-node construction unit, configured to construct sub-nodes in each of the layers according to the index levels corresponding to the index types of each level;
and the tree construction unit is used for constructing the SLA tree structure according to the corresponding relation among the root node, the layer, the sub-nodes and the sub-nodes.
In an exemplary embodiment of the present application, the sub-node construction unit is configured to:
sorting the index levels corresponding to the index types according to the levels;
and setting different and continuous index numbers for the index levels after sequencing, and representing the sub-nodes in the SLA tree structure by using the index numbers.
In an exemplary embodiment of the present application, the network slice acquisition device is further configured to:
acquiring index numbers corresponding to leaf nodes in the SLA tree structure;
acquiring a network slice identifier corresponding to each leaf node;
mapping the index number corresponding to each leaf node and the network slice identifier corresponding to each leaf node to obtain the network slice mapping table.
It should be noted that although in the above detailed description several modules or units of a device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functions of two or more modules or units described above may be embodied in one module or unit, in accordance with embodiments of the present application. Conversely, the features and functions of one module or unit described above may be further divided into a plurality of modules or units to be embodied.
Furthermore, although the various steps of the methods herein are depicted in the accompanying drawings in a particular order, this is not required to either suggest that the steps must be performed in that particular order, or that all of the illustrated steps must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step to perform, and/or one step decomposed into multiple steps to perform, etc.
From the above description of embodiments, those skilled in the art will readily appreciate that the example embodiments described herein may be implemented in software, or may be implemented in software in combination with the necessary hardware. Thus, the technical solution according to the embodiments of the present application may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (may be a CD-ROM, a U-disk, a mobile hard disk, etc.) or on a network, and includes several instructions to cause a computing device (may be a personal computer, a server, a mobile terminal, or a network device, etc.) to perform the method according to the embodiments of the present application.
Fig. 10 schematically shows a block diagram of a computer system for implementing an electronic device according to an embodiment of the present application, which may be provided in a terminal device or a server.
It should be noted that, the computer system 1000 of the electronic device shown in fig. 10 is only an example, and should not impose any limitation on the functions and the application scope of the embodiments of the present application.
As shown in fig. 10, the computer system 1000 includes a central processing unit 1001 (Central Processing Unit, CPU) which can execute various appropriate actions and processes according to a program stored in a Read-Only Memory 1002 (ROM) or a program loaded from a storage section 1008 into a random access Memory 1003 (Random Access Memory, RAM). In the random access memory 1003, various programs and data necessary for the system operation are also stored. The cpu 1001, the rom 1002, and the ram 1003 are connected to each other via a bus 1004. An Input/Output interface 1005 (i.e., an I/O interface) is also connected to bus 1004.
In some embodiments, the following components are connected to the input/output interface 1005: an input section 1006 including a keyboard, a mouse, and the like; an output portion 1007 including a Cathode Ray Tube (CRT), a liquid crystal display (Liquid Crystal Display, LCD), and a speaker; a storage portion 1008 including a hard disk or the like; and a communication section 1009 including a network interface card such as a local area network card, a modem, or the like. The communication section 1009 performs communication processing via a network such as the internet. The drive 1010 is also connected to the input/output interface 1005 as needed. A removable medium 1011, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like, is installed as needed in the drive 1010, so that a computer program read out therefrom is installed as needed in the storage section 1008.
In particular, according to embodiments of the present application, the processes described in the various method flowcharts may be implemented as computer software programs. For example, embodiments of the present application include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flowcharts. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 1009, and/or installed from the removable medium 1011. The computer programs, when executed by the central processor 1001, perform the various functions defined in the system of the present application.
It should be noted that, the computer readable medium shown in the embodiments of the present application may be a computer readable signal medium or a computer readable medium, or any combination of the two. The computer readable medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-Only Memory (ROM), an erasable programmable read-Only Memory (Erasable Programmable Read Only Memory, EPROM), flash Memory, an optical fiber, a portable compact disc read-Only Memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present application, however, a computer-readable signal medium may include a data signal that propagates in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may be any computer readable medium that is not a computer readable medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wired, etc., or any suitable combination of the foregoing.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
It should be noted that although in the above detailed description several modules or units of a device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functions of two or more modules or units described above may be embodied in one module or unit, in accordance with embodiments of the present application. Conversely, the features and functions of one module or unit described above may be further divided into a plurality of modules or units to be embodied.
From the above description of embodiments, those skilled in the art will readily appreciate that the example embodiments described herein may be implemented in software, or may be implemented in software in combination with the necessary hardware. Thus, the technical solution according to the embodiments of the present application may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a mobile hard disk, etc.) or on a network, comprising several instructions to cause an electronic device to perform the method according to the embodiments of the present application.
It is to be understood that the present application is not limited to the precise arrangements and instrumentalities shown in the drawings, which have been described above, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the application is limited only by the appended claims.

Claims (10)

1. A network slice acquisition method, comprising:
acquiring a service demand index corresponding to a target service, and performing recursion searching in a Service Level Agreement (SLA) tree structure according to the service demand index to acquire a target leaf node;
acquiring a network slice mapping table, and determining a target network slice in the network slice mapping table according to the target leaf node;
The SLA tree structure is formed by constructing according to the index type and the index level corresponding to the target service.
2. The method of claim 1, wherein said recursively searching in the service level agreement SLA tree structure according to the traffic demand indicator to obtain a target leaf node comprises:
constructing a child linked list according to the SLA tree structure;
and carrying out recursion searching in the child linked list according to the service demand index so as to acquire the target leaf node.
3. The method of claim 1, wherein the network slice mapping table includes an index number of a leaf node and a network slice identification corresponding to the leaf node;
the obtaining a network slice mapping table, determining a target network slice in the network slice mapping table according to the target leaf node, includes:
comparing the index number corresponding to the target leaf node with the index number in the network slice mapping table;
and when the index number corresponding to the target leaf node exists in the network slice mapping table, acquiring a target network slice identifier corresponding to the index number, and taking the network slice corresponding to the target network slice identifier as the target network slice.
4. The method of claim 1, wherein prior to recursively searching in a service level agreement SLA tree structure in accordance with the traffic demand indicators, the method further comprises:
acquiring a Service Level Agreement (SLA) text corresponding to the target service, and extracting an index type and an index level corresponding to the target service from the SLA text;
and constructing the SLA tree structure according to the index type and the index level.
5. The method of claim 4, wherein the number of index types is a plurality, and the number of index levels corresponding to each of the index types is one or more;
the constructing the SLA tree structure according to the index type and the index level includes:
acquiring the corresponding relation between the index levels, and determining the level of each index type according to the corresponding relation;
constructing a plurality of layers which do not contain root nodes in the SLA tree structure according to each index type and the corresponding level of each index type;
constructing sub-nodes in each layer according to the index grade corresponding to the index type of each grade;
And constructing the SLA tree structure according to the corresponding relation among the root node, the layer, the sub-nodes and the sub-nodes.
6. The method of claim 5, wherein said constructing sub-nodes in each of said layers from said index levels corresponding to each level of said index type comprises:
sorting the index levels corresponding to the index types according to the levels;
and setting different and continuous index numbers for the index levels after sequencing, and representing the sub-nodes in the SLA tree structure by using the index numbers.
7. The method according to claim 1, wherein the method further comprises:
acquiring index numbers corresponding to leaf nodes in the SLA tree structure;
acquiring a network slice identifier corresponding to each leaf node;
mapping the index number corresponding to each leaf node and the network slice identifier corresponding to each leaf node to obtain the network slice mapping table.
8. A network slice acquisition device, comprising:
the searching module is used for acquiring a service demand index corresponding to the target service, and carrying out recursion searching in the service level agreement SLA tree structure according to the service demand index so as to acquire a target leaf node;
The determining module is used for obtaining a network slice mapping table and determining a target network slice in the network slice mapping table according to the target leaf node;
the SLA tree structure is formed by constructing according to the index type and the index level corresponding to the target service.
9. A computer storage medium having stored thereon a computer program, which when executed by a processor implements the network slice acquisition method of any one of claims 1 to 7.
10. An electronic device, comprising:
a processor; and
a memory for storing executable instructions of the processor;
wherein the processor is configured to perform the network slice acquisition method of any one of claims 1 to 7 via execution of the executable instructions.
CN202210955528.9A 2022-08-10 2022-08-10 Network slice acquisition method and device, storage medium and electronic equipment Pending CN117640427A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210955528.9A CN117640427A (en) 2022-08-10 2022-08-10 Network slice acquisition method and device, storage medium and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210955528.9A CN117640427A (en) 2022-08-10 2022-08-10 Network slice acquisition method and device, storage medium and electronic equipment

Publications (1)

Publication Number Publication Date
CN117640427A true CN117640427A (en) 2024-03-01

Family

ID=90016837

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210955528.9A Pending CN117640427A (en) 2022-08-10 2022-08-10 Network slice acquisition method and device, storage medium and electronic equipment

Country Status (1)

Country Link
CN (1) CN117640427A (en)

Similar Documents

Publication Publication Date Title
CN109255072B (en) Information recall method and device, computer storage medium and electronic equipment
CN110147437A (en) A kind of searching method and device of knowledge based map
RU2605041C2 (en) Methods and systems for displaying microblog topics
CN104850241A (en) Mobile terminal and text input method thereof
CN114428907A (en) Information searching method and device, electronic equipment and storage medium
CN115062150B (en) Text classification method and device, electronic equipment and storage medium
CN117640427A (en) Network slice acquisition method and device, storage medium and electronic equipment
CN114995719B (en) List rendering method, device, equipment and storage medium
CN116346777A (en) Dictionary tree domain name matching method, device, equipment and storage medium
CN113157695B (en) Data processing method and device, readable medium and electronic equipment
CN115718879A (en) Data governance method, device and storage medium
CN115952258A (en) Generation method of government affair label library, and label determination method and device of government affair text
CN113011672B (en) Logistics aging prediction method and device, electronic equipment and storage medium
CN115186738A (en) Model training method, device and storage medium
CN111737572B (en) Search statement generation method and device and electronic equipment
CN114565105A (en) Data processing method and deep learning model training method and device
US8577861B2 (en) Apparatus and method for searching information
CN113780827A (en) Article screening method and device, electronic equipment and computer readable medium
CN113077199A (en) Method and device for determining distribution route
CN114861057B (en) Resource sending method, training of recommendation model and device
CN116383454B (en) Data query method of graph database, electronic equipment and storage medium
CN116541421B (en) Address query information generation method and device, electronic equipment and computer medium
EP4318375A1 (en) Graph data processing method and apparatus, computer device, storage medium and computer program product
CN116992109A (en) Catalog generation method, catalog generation device, electronic equipment and storage medium
CN115567584A (en) Processing method and device of subscription theme, electronic equipment and readable storage medium

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