CN108132827B - Network slice resource mapping method, related equipment and system - Google Patents

Network slice resource mapping method, related equipment and system Download PDF

Info

Publication number
CN108132827B
CN108132827B CN201611092681.4A CN201611092681A CN108132827B CN 108132827 B CN108132827 B CN 108132827B CN 201611092681 A CN201611092681 A CN 201611092681A CN 108132827 B CN108132827 B CN 108132827B
Authority
CN
China
Prior art keywords
host
vnfc
vnfcs
resource
determining
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201611092681.4A
Other languages
Chinese (zh)
Other versions
CN108132827A (en
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.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN201611092681.4A priority Critical patent/CN108132827B/en
Publication of CN108132827A publication Critical patent/CN108132827A/en
Application granted granted Critical
Publication of CN108132827B publication Critical patent/CN108132827B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/455Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533Hypervisors; Virtual machine monitors
    • G06F9/45558Hypervisor-specific management and integration aspects
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/455Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533Hypervisors; Virtual machine monitors
    • G06F9/45558Hypervisor-specific management and integration aspects
    • G06F2009/45595Network integration; Enabling network access in virtual machine instances

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The embodiment of the application discloses a method and a device for mapping network slice resources, wherein the method comprises the following steps: receiving an instantiation request of a network slice, wherein the network slice comprises M virtualized network function VNFs, the M VNFs comprise N virtualized network function components VNFCs, and the instantiation request comprises resource demand information of each VNFC in the N VNFCs, wherein N and M are integers greater than 1; determining first priorities of the N VNFCs according to the resource demand information; and determining a corresponding relation between the N VNFCs and a Host according to the first priority, wherein the corresponding relation is used for mapping Host resources for the N VNFCs. By adopting the method and the device, the utilization rate of the Host resources can be improved.

Description

Network slice resource mapping method, related equipment and system
Technical Field
The present application relates to the field of communications technologies, and in particular, to a network slice resource mapping method, a related device, and a system.
Background
Network Function Virtualization (NFV) is a technology for reducing the cost of expensive Network equipment by using standard general-purpose hardware such as x86 and using Virtualization technology to carry various Network software functions. The NFV realizes flexible loading of software by decoupling software and hardware and abstracting concrete functions, so that functions of network equipment do not depend on special hardware any more, resources can be fully and flexibly shared, rapid development and deployment of new services are realized, and automatic deployment, elastic expansion, fault isolation, self-healing and the like can be carried out based on actual service requirements.
Under the wave of NFV revolution, the European Telecommunications Standardization Institute (ETSI) has established a reference framework for NFV so that all participants can complete related research and development work according to a common framework.
The ETSI-based NFV architecture can complete mapping of network slices (slices), wherein key components in the NFV architecture, i.e., mapping components participating in network slices, mainly include: an NFV Infrastructure layer (NFVI) for providing an operating environment of the VNF, including required hardware and software; a Virtualized Network Function (VNF), where multiple VNFs form a Network Service (NS), that is, a Network slice, and the mapping of the Network slice is a process of allocating Data Center (DC) resources, which are formed by hosts of NFVI, to resources required by the Network slice, and the final resource form is that a Virtual Network with a certain topology structure, to which multiple VMs are connected, provides the Network Function Service; a Virtualized Network Function Component (VNFC) is a Component of a VNF, one or more VNFCs form a VNF for completing a specific Function of the VNF, and a general VNFC corresponds to a VM (virtual machine) resource template; management and Orchestration (MANO), responsible for lifecycle Management of NS and VNFs, and Management of NFVI infrastructure. An Operation Support System (OSS)/service support system (BSS) for an operator management function and having an interface support with a MANO.
In the prior art, the Host resource mapping of NS/Slice supported by the NFV architecture is performed in a manner of completing mapping of each VNF in NS/Slice, that is, each VNF is mapped independently, and then performing mapping of links between VNFs. That is, the mapping of a network slice is performed separately for each VNF, and in this case, the physical resource allocation and consumption for mapping the network slice may not be optimal. Therefore, how to optimize the utilization of physical resources and improve the overall performance of the NFV system becomes a problem to be solved urgently.
Content of application
The technical problem to be solved by the embodiments of the present application is to provide a network slice resource mapping method, related device and system, by which the utilization rate of Host resources can be improved, and the overall performance of the system can be improved.
In a first aspect, an embodiment of the present application provides a network slice resource mapping method, which may include:
receiving an instantiation request of a network slice, wherein the network slice comprises M virtualized network function VNFs, the M VNFs comprise N virtualized network function components VNFCs, and the instantiation request comprises resource demand information of each VNFC in the N VNFCs, wherein N and M are integers greater than 1; determining first priorities of the N VNFCs according to the resource demand information; and determining a corresponding relation between the N VNFCs and a Host according to the first priority, wherein the corresponding relation is used for mapping Host resources for the N VNFCs. In other words, in the embodiment of the present application, all VNFCs in a network slice are prioritized according to resource demand information, and then Host resources are globally mapped to all VNFCs according to the priorities, so that physical resource consumption can be effectively reduced and physical resource mapping efficiency can be improved.
With reference to the first aspect, in a first possible implementation manner, the resource requirement information includes a resource requirement size of the VNFC: the determining the first priorities of the N VNFCs according to the resource demand information includes: determining first priorities of the N VNFCs according to resource demand sizes of the N VNFCs, wherein the larger the resource demand size is, the higher the corresponding first priority is. According to the embodiment of the application, the corresponding first priority is determined according to the resource demand of the VNFC, the corresponding Host is preferentially allocated to the VNFC with large resource demand, and the improvement of the overall performance of the NFV framework is facilitated.
With reference to the first aspect, in a second possible implementation manner, the resource requirement information includes a resource requirement size of the VNFCs and a VNFC topology relationship between the N VNFCs; the determining the first priorities of the N VNFCs according to the resource demand information includes: acquiring adjacent VNFCs of each VNFC according to the VNFC topological relation, wherein a VNFC link is established between every two adjacent VNFCs; respectively calculating the total resource demand size of each VNFC and the adjacent VNFCs according to the resource demand size of the VNFC; and determining first priorities of the N VNFCs according to the total resource demand, wherein the larger the total resource demand is, the higher the corresponding first priority is. The influence of the adjacent VNFCs of the VNFC on the first priority of the VNFC is further considered, the better Host resources are further accurately allocated to the VNFC with the higher first priority, the utilization rate of the Host resources is effectively improved, and the overall performance of the NFV framework is favorably improved.
With reference to the first aspect, or with reference to any one of the foregoing possible implementation manners of the first aspect, in a third possible implementation manner, the method further includes: acquiring available resource information of L hosts in a DC network of a data center; determining the service quality grades of the L hosts according to the available resource information; the determining the corresponding relationship between the N VNFCs and the Host resource according to the first priority includes: and determining the corresponding relation between the N VNFCs and the Host according to the level of the first priority and the level of the quality of service level of the L hosts, wherein the higher the first priority is, the higher the quality of service level of the corresponding Host is. The method and the device further determine the service quality grade of the Host so as to perform bidirectional corresponding matching according to the first priority of the VNFC and the service quality grade of the Host, more accurately allocate the better Host resources to the VNFC with the higher first priority, effectively improve the utilization rate of the Host resources and be beneficial to improving the overall performance of the NFV framework.
With reference to the third possible implementation manner of the first aspect, in a fourth possible implementation manner, the available resource information includes an available resource size of a Host and a Host topology relationship between the L hosts; the determining the service quality levels of the L hosts according to the available resource information comprises: acquiring adjacent hosts of each Host according to the Host topological relation, wherein a Host link is established between every two adjacent hosts; respectively calculating the size of the available total resource of each Host and the adjacent hosts according to the size of the available resource of the Host; and determining the service quality grades of the L hosts according to the size of the available total resources, wherein the larger the available total resources are, the higher the corresponding service quality grade is. The embodiment of the application further considers the influence of the adjacent Host of the Host on the service quality grade of the Host, further accurately allocates the better Host resource to the VNFC with the higher first priority, effectively improves the utilization rate of the Host resource and is beneficial to improving the overall performance of the NFV framework.
With reference to the fourth possible implementation manner of the first aspect, in a fifth possible implementation manner, the determining, according to the first priority, a correspondence between the N VNFCs and the Host includes: determining a Host corresponding to the target VNFC with the highest first priority and without the corresponding relation determined currently as a target Host, wherein the target Host is the Host with the highest service quality level and can be mapped currently; determining a Host corresponding to an adjacent VNFC of the target VNFC as the target Host; and executing the step of determining the Host corresponding to the target VNFC with the highest first priority and without the corresponding relationship currently determined as the target Host until all the N VNFCs determine the corresponding Host. According to the embodiment of the application, when the corresponding relation of the Host is determined for the VNFC with higher priority, the corresponding relation of the adjacent VNFC is determined to the same Host, so that the redundancy of VNFC links is reduced, the utilization rate of Host resources is effectively improved, and the overall performance of an NFV framework is favorably improved.
With reference to the fifth possible implementation manner of the first aspect, in a sixth possible implementation manner, the determining, as the target Host, a Host corresponding to an adjacent VNFC of the target VNFC includes: according to the first priority, determining hosts corresponding to adjacent VNFCs of the target VNFC as the target hosts in sequence; and judging the adjacent VNFC which does not correspond to the target Host as the VNFC of which the corresponding relation is not determined currently. In the embodiment of the application, when the corresponding relationship of the Host is determined for the VNFCs with higher priorities, the corresponding relationship of the adjacent VNFCs is determined to the same Host, and in the process of corresponding the multiple adjacent VNFCs to the same Host, the subsequent determination is performed according to the first priority of the VNFCs, so that the rationality of Host resource allocation is ensured, and the overall performance of the NFV framework is improved.
With reference to the first aspect, or with reference to any one of the foregoing possible implementation manners of the first aspect, in a seventh possible implementation manner, the resource requirement information includes a bandwidth requirement size of X VNFC links among the N VNFCs, where X is an integer greater than 0; the method further comprises the following steps: acquiring bandwidth resource information of a Host link between L hosts in a DC network of a data center; after determining the correspondence between the N VNFCs and the Host according to the first priority, the method includes: detecting whether redundant VNFC links are included in the X VNFC links, wherein two VNFCs of the redundant VNFC links correspond to the same Host; if Y redundant VNFC links are detected, determining second priorities of (X-Y) VNFC links except the Y redundant VNFC links in the X VNFC links according to the bandwidth demand size, wherein the larger the bandwidth demand of the VNFC links in the (X-Y) VNFC links is, the higher the corresponding second priorities are, and both Y and X-Y are integers greater than or equal to 0; and determining a Host link corresponding to the (X-Y) VNFC links according to the bandwidth resource information and the level of the second priority. According to the embodiment of the application, when the VNFC link of the VNFC determines the corresponding Host link, the priority of the bandwidth resource demand size is considered, the corresponding bandwidth resources are allocated to the VNFC link according to the priority, the situation that the VNFC link with the higher priority is determined to fail due to the fact that the VNFC corresponding relation is not determined due to the fact that the bandwidth resources of the Host link are insufficient is avoided, the Host resource allocation of the VNFC is reasonable, and meanwhile the reasonability of the bandwidth resource allocation of the VNFC link is guaranteed.
In a second aspect, the present application provides a network slice resource mapping apparatus, which has a function of implementing the method in the foregoing method embodiment. The function can be realized by hardware, and can also be realized by executing corresponding software by hardware. The hardware or software includes one or more modules corresponding to the functions described above.
In a third aspect, the present application provides a network slice resource mapping apparatus, where the network slice resource mapping apparatus includes a processor, and the processor is configured to support the network slice resource mapping apparatus to execute a corresponding function in the network slice resource mapping method provided in the first aspect. The network slice resource mapping device may also include a memory, coupled to the processor, that retains program instructions and data necessary for the network slice resource mapping device. The network slice resource mapping apparatus may further comprise a communication interface for the network slice resource mapping apparatus to communicate with other devices or a communication network.
In a fourth aspect, the present application provides a computer storage medium for storing computer software instructions for the network slice resource mapping apparatus provided in the third aspect, which contains a program designed to execute the above aspects.
In a fifth aspect, the present application provides a computer program, where the computer program includes instructions, when the computer program is executed by a computer, the computer may execute the flow in the network slice resource mapping method in any one of the above first aspects.
The embodiment of the application has the following beneficial effects:
according to the embodiment of the application, the instantiation request of the network slice is received, the first priority of the N VNFCs is determined according to the resource demand information, the corresponding relation between the N VNFCs and the Host is finally determined according to the first priority, and the corresponding relation is used for mapping Host resources of the N VNFCs. According to the method and the device, priority ordering is carried out on all VNFCs in the network slice according to the resource demand information, and then corresponding mapping resources are allocated to all the VNFCs in a global mode according to the priority, so that consumption of physical resources can be effectively reduced, and the utilization rate of the physical resources is improved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a schematic diagram of an NFV architecture model provided by an embodiment of the present application;
fig. 2 is a schematic structural diagram of a network slice resource mapping apparatus according to an embodiment of the present application;
fig. 3 is a flowchart illustrating a network slice resource mapping method according to an embodiment of the present application;
fig. 4 is a specific application scenario diagram of a network slice resource mapping method provided in the embodiment of the present application;
fig. 5 is a flowchart illustrating another network slice resource mapping method according to an embodiment of the present application;
fig. 6 is a flowchart illustrating a further network slice resource mapping method according to an embodiment of the present application;
fig. 7 is a flowchart illustrating a further network slice resource mapping method according to an embodiment of the present application;
fig. 8 is a schematic structural diagram of another network slice resource mapping apparatus according to an embodiment of the present application.
Detailed Description
The embodiments of the present application will be described below with reference to the drawings.
The terms "first," "second," "third," "fourth," and "fifth," etc. in the description and claims of this application and in the accompanying drawings are used for distinguishing between different objects and not for describing a particular order. Furthermore, the terms "include" and "have," as well as any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus.
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments.
"plurality" means two or more. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship.
Embodiments of the present application are described below with reference to the drawings.
In order to facilitate understanding of the embodiments of the present application, the NFV architecture of ETSI based on the embodiments of the present application is described below. Fig. 1 is a schematic diagram of an NFV architecture model provided in an embodiment of the present application, please refer to fig. 1, in which an NFV architecture mainly includes an Infrastructure layer (NFVI) of an NFV, a Virtualized Network Function (VNF), a Virtualized Network Function Component (VNFC), a Management and organization (MANO), an Operation Support System (OSS)/service support system (BSS). The following detailed description of the functional modules in the architecture is performed:
NFVI: the virtual network management system is used for providing a running environment of the VNF and is also responsible for comprehensively virtualizing hardware resources of computing, storage and network and mapping the hardware resources into virtual resources for the VNF to use. The operating environment comprises required hardware and software, wherein the hardware comprises calculation, network and storage resources; the software mainly comprises a system management program Hypervisor, a network controller, a storage manager and other tools. Resources of the NFVI in the DC resource pool are embodied as Host resources and network resources between the Host hosts, where the Host resources are specifically a Central Processing Unit (CPU) and a storage resource, respectively; the network resources between the hosts are bandwidth resources.
VNF and VNFC: the VNF realizes various traditional physical network functions by using software, runs on the NFVI, uses various computing, storage and virtual resources of network functions after being virtualized by the NFVI, and forms an NS for providing specific network function services; the virtualized network function unit VNFC is a component of the VNF, and is used to complete a certain specific function of the VNF, generally, the VNFC corresponds to a VM (virtual machine) resource template, and the VM has corresponding resource and constraint descriptions, including CPU, storage resource, affinity inverse affinity constraint (whether different VMs can be co-deployed, that is, co-mapped to the same Host), deployment location constraint, and the like.
Slice: network slices, which are equivalent to NS defined by ESTI, are required to have the capability of being formulated as required in order to meet the different requirements of different services on network performance, namely, the network slices can be flexibly configured, a physical network is cut into a plurality of virtual network slices, each virtual network slice NS faces different application scene requirements, and the final resource form of the virtual network is a virtual network which is connected with a plurality of VMs and has a certain topological structure; nodes of a network slice refer to VMs forming the slice, links of the network slice refer to Virtual Links (VL) for connection among the VMs, and the VL also has corresponding bandwidth resource requirement description; the mapping of network slices is a process in which DC resources, consisting of the Host of NFVI, are allocated to the resources required for the network slices.
And MANO: the management orchestration module in the NFV architecture is responsible for lifecycle management for Slice/NS and VNFs, as well as management of the NFVI infrastructure. The MANO is responsible for lifecycle management and orchestration of the NFVI's software and hardware resources, as well as the VNF, which focuses on all the virtual management tasks under the NFV framework. For example, physical resource information in the DC network and the like are fed back to relevant processing modules in the NFV architecture.
OSS/BSS: the operation support system/service support system, the management function of the operator, and the MANO have interface support. For example, an instantiation request of a network slice is initiated to a related processing module in the NFV architecture.
It is understood that the NFV architecture may further include a relevant processing module, such as a network service/network Slice Policy Agent (NS/Slice Policy Agent), for performing any network Slice resource mapping method in the present application.
Based on the NFV architecture, the embodiment of the application determines the first priority of the N VNFCs according to the resource demand information by receiving an instantiation request of a network slice, and finally determines the correspondence between the N VNFCs and the Host according to the level of the first priority, where the correspondence is used for mapping Host resources for the N VNFCs. According to the method and the device, priority ordering is carried out on all VNFCs in the network slice according to the resource demand information, and then corresponding mapping resources are allocated to all the VNFCs in a global mode according to the priority, so that consumption of physical resources can be effectively reduced, and the utilization rate of the physical resources is improved. It is understood that the NFV architecture specifically applied in the embodiments of the present application includes, but is not limited to, an ETSI-based NFV architecture, and as long as the architecture to which the network slice resource mapping method in the present application can be applied belongs to the scope protected and covered by the present application.
Referring to fig. 2, fig. 2 is a schematic structural diagram of a network slice resource mapping apparatus provided in an embodiment of the present application, and the network slice resource mapping apparatus provided in the embodiment of the present application may be implemented in the structure in fig. 2, where the network slice resource mapping apparatus 10 includes at least one processor 101, at least one memory 102, and at least one communication interface 103. In addition, the network slice resource mapping apparatus may further include general components such as an antenna, which will not be described in detail herein.
The processor 101 may be a general purpose Central Processing Unit (CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits for controlling the execution of programs according to the above schemes.
A communication interface 103 for communicating with other devices or communication Networks, such as ethernet, Radio Access Network (RAN), Wireless Local Area Network (WLAN), etc.
The Memory 102 may be a Read-Only Memory (ROM) or other type of static storage device that can store static information and instructions, a Random Access Memory (RAM) or other type of dynamic storage device that can store information and instructions, an Electrically Erasable Programmable Read-Only Memory (EEPROM), a Compact Disc Read-Only Memory (CD-ROM) or other optical Disc storage, optical Disc storage (including Compact Disc, laser Disc, optical Disc, digital versatile Disc, blu-ray Disc, etc.), magnetic disk storage media or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to these. The memory may be self-contained and coupled to the processor via a bus. The memory may also be integral to the processor.
The memory 102 is used for storing application program codes for executing the above scheme, and is controlled by the processor 101 to execute. The processor 101 is configured to execute application program codes of all network slice resource mapping methods provided in the present application stored in the memory 102.
The memory 102 of the network slice resource mapping apparatus shown in fig. 2 stores code that can perform any one of the network slice resource mapping method flows provided in fig. 3-7 in this embodiment, such as receiving an instantiation request of a network slice, where the network slice includes M virtualized network functions VNFs, where the M VNFs include N virtualized network function components VNFCs, and the instantiation request includes resource requirement information of each VNFC of the N VNFCs, where N and M are integers greater than 1; determining first priorities of the N VNFCs according to the resource demand information; and determining a corresponding relation between the N VNFCs and a Host according to the first priority, wherein the corresponding relation is used for mapping Host resources for the N VNFCs.
The specific operation flow and the corresponding functions performed by the network slice resource mapping device 10 in the present application will be described in detail below with reference to the network slice resource mapping device 10 corresponding to fig. 2 and the method flows corresponding to fig. 3 to fig. 7:
referring to fig. 3, fig. 3 is a schematic flowchart of a network slice resource mapping method provided in an embodiment of the present application. The network slice resource mapping apparatus 10 in fig. 2 is configured to support and execute the method flow steps S201 to S203 shown in fig. 3, and optionally, is further configured to support and execute the method flow steps S204 to S205. It should be noted that, in order to describe the network slice resource mapping method in the embodiment of the present application in more detail, the corresponding execution main body is described in each flow step in the present application, but this does not mean that the embodiment of the present application can only execute the corresponding method flow through the described execution main body.
The NFV architecture described below in conjunction with FIG. 1 describes Sender, NS/Slice Policy Agent, and MANO as detailed execution agents, where Sender may be a configuration manager, OSS/BSS in the NFV; the NS/Slice Policy Agent may be a processing module in the NFV architecture or a processing module integrated with the MANO. It should be understood that the executing entities may also be network elements or devices independent of each other, and the present application is not limited thereto specifically, as long as the executing entities capable of executing the related method flow all belong to the scope covered by the present application.
Step S201: the Sender sends an instantiation request of the network Slice to the NS/Slice Policy Agent; the NS/Slice Policy Agent receives an instantiation request for a network Slice.
Specifically, the Sender sends an instantiation request of a network Slice to an NS/Slice Policy Agent, and the NS/Slice Policy Agent receives the instantiation request of the network Slice, where the network Slice includes M virtualized network functions VNFs, the M VNFs include N virtualized network function components VNFCs, and the instantiation request includes resource requirement information of each VNFC of the N VNFCs, where N and M are integers greater than 1. The instantiation request may include individual VNFC resource requirements and/or link resource requirements for the network slice.
For example, as shown in fig. 4, fig. 4 is a specific application scenario diagram of the network slice resource mapping method provided in the embodiment of the present application, assuming that a network slice 1 needs to be instantiated in fig. 4, and the network slice 1 is formed by a VNFAAnd VNFBConnection formation, VNFAAnd is composed of VNFCA1Composition, VNFBThen by VNFCB1、VNFCB2And a VNFC link VL between the twoB1-B2Composition, VNFAAnd VNFBWith a VNFC link VL therebetweenA1-B1VNFCs may be included in the instantiation request, respectivelyA1、VNFCB1And VNFCB2Host resource demand size of, and VLB1-B2And VLA1-B2The bandwidth resource requirement size.
Step S202: determining a first priority of the N VNFCs according to the resource demand information.
Specifically, in the prior art, the NS/Slice mapping supported in the NFV architecture is performed in such a way that mapping of each VNF unit constituting the NS/Slice is completed first, that is, each VNF is mapped independently. Taking the application scenario of fig. 4 as an example, the VNF is mapped firstARemapping VNFsBMapping VNFBIncluding mapping VNFCB1、VNFCB2And VLB1-B2And then mapping of the links between VNFs (i.e., VNFs)AAnd VNFBVNFC link VL in betweenA1-B2). Therefore, in the prior art, each VNF is regarded as an unrelated individual, each VNF mapping is considered separately, and resource requirements of multiple VNFs are not considered together, so that when a network slice allocates resources, global consideration cannot be given, and physical resource consumption for mapping the network slice cannot be optimal, that is, physical resource consumption cost is too high. For example, in some cases, resource requirements, CPU requirements, or storage space requirements may be different due to different functional requirements of multiple VNFCs in the same VNF, but in the prior art, the same VNF performs the Host resource mapping uniformly, so that different Host resource mappings with pertinence cannot be performed on different VNFCs in the same VNF, and thus, for some VNFCs with smaller resource requirements, waste of physical resources may be caused, and for some VNFCs with higher resource requirements, shortage of physical resources may be caused. In the embodiment of the present application, resource requirements of all VNFs in one network slice are considered overall, and are reasonably planned, and personalized Host resource allocation is performed on different VNFCs according to the first priorities of the VNFCs, that is, allocation mapping of overall resources is specifically performed on all VNFCs in all VNFs.
It should be noted that, the N VNFCs are sorted by priority from high to bottom or from low to high according to the resource demand information, where a determining factor of the first priority may be a function of different VNFCs; the VNFCs may also be sorted by a first priority according to resource requirement of different VNFCs, such as a requirement of a CPU, a requirement of a storage space, a requirement of data security, and a requirement of a processing speed of data, and the like, and a list sorted by a first priority is generated.
In a possible implementation manner, the resource requirement information includes a resource requirement size of the VNFCs, and performing the first priority ranking on the N VNFCs according to the resource requirement information specifically includes: and performing first priority ranking on the N VNFCs according to the resource demand size of the N VNFCs, wherein the larger the resource demand size is, the higher the corresponding first priority is. That is, in the embodiment of the present application, the VNFC with the larger resource requirement size is set to the level with the higher first priority, so that when the Host resource is allocated, the Host resource can be allocated preferentially, or the Host resource with higher quality can be allocated.
Step S203: and the NS/Slice Policy Agent determines the corresponding relation between the N VNFCs and the Host according to the first priority, wherein the corresponding relation is used for mapping Host resources for the N VNFCs.
Specifically, the correspondence relationship of the Host is determined for the N VNFCs according to the first high-low priority list obtained in step S202. The principle may be that the Host resource is preferentially mapped to the VNFCs with higher first priorities, for example, the Host resource with better service quality is allocated to the VNFCs with higher first priorities, so that the most important VNFCs can obtain better quality or more resources, and finally, the Host resource is more reasonably utilized.
Optionally, the embodiment of the present application may further include the following step S204 and step S205, to specifically execute the determined correspondence between the VNFCs and the Host, that is, to specifically map the Host resources to the N VNFCs according to the determined correspondence, the specific steps are as follows:
step S204: and the NS/Slice Policy Agent sends the corresponding relation to the MANO, and the MANO receives the corresponding relation.
Specifically, it can be understood that, in steps S201 to S203, the correspondence between the N VNFCs and the Host is mainly determined, and therefore, after the correspondence is determined, the actual mapping execution needs to be performed. In one particular example, the determined correspondence (e.g., correspondence policy, mapping policy) may be enforced by a MANO in the NFV architecture.
Step S205: and the MANO performs Host mapping for the N VNFCs according to the corresponding relation.
Specifically, it should be noted that before a Host is not mapped, it is an entire physical resource, and when a VNFC (logical function resource) is mapped to a specific Host (physical resource) and the mapping is successful, a specific logical function entity VM (virtual machine) running on the physical resource is formed. For example, when a certain VNFC is successfully mapped to a Host, one VM on the Host is formed, and when a certain 100 VNFCs are successfully mapped to a Host, 100 VMs on the Host are formed.
In the embodiment of the application, an instantiation request of a network slice is received, wherein the instantiation request includes resource demand information of each VNFC of the N VNFCs; and performing first priority ordering on the N VNFCs according to the resource demand information in the instantiation request, and finally performing Host resource mapping on the N VNFCs according to the first priority, namely performing priority ordering on all VNFCs in the network slice according to the resource demand information, and then globally mapping the Host resources for all VNFCs according to the priorities, so that physical resource consumption can be effectively reduced and the mapping efficiency between virtual resources and physical resources is improved.
Referring to fig. 5, fig. 5 is a schematic flowchart of another network slice resource mapping method provided in the embodiment of the present application. The network slice resource mapping apparatus 10 in fig. 2 is configured to support and execute the method flow steps S301 to S305 shown in fig. 5, and optionally, is further configured to support and execute the method flow steps S306 and S307. It should be noted that, in order to describe the network slice resource mapping method in the embodiment of the present application in more detail, the corresponding execution main body is described in each flow step in the present application, but this does not mean that the embodiment of the present application can only execute the corresponding method flow through the described execution main body.
Step S301 to step S302 refer to step S201 to step S202 in the embodiment of fig. 2, which are not described herein again.
S303: the MANO reports the available resource information of L Host in the DC network of the data center to the NS/Slice Policy Agent; the NS/Slice Policy Agent acquires the available resource information of L hosts in the DC network of the data center.
Specifically, optionally, after receiving the implementation request of the network Slice, the NS/Slice Policy Agent may initiate a request for acquiring available physical resource information in the DC network where the network Slice is currently located to the MANO, and after knowing that the NS/Slice Policy Agent needs to acquire available resource information of the Host, the MANO reports the available resource information of the L hosts in the DC network to the NS/Slice Policy Agent. The NS/Slice Policy Agent receives available resource information reported by the MANO, wherein the available resource information can comprise available resource information and connection topology information of physical nodes and links.
Step S304: and the NS/Slice Policy Agent determines the service quality levels of the L hosts according to the available resource information.
Specifically, in the embodiment of the present application, not only the first priorities of the VNFCs of the resource demanders are ranked, but also the ranks of the service quality of the Host of the resource provider are ranked, so that the Host resources with higher service quality ranks are allocated to the VNFCs with higher first priorities.
Step S305: and the NS/Slice Policy Agent determines the corresponding relation between the N VNFCs and the Host according to the level of the first priority and the level of the quality of service level of the L hosts, wherein the higher the first priority is, the higher the corresponding quality of service level of the Host is.
Specifically, after the NS/Slice Policy Agent sorts the N VNFCs according to the first priority, and sorts the L hosts according to the service quality level, the NS/Slice Policy Agent determines the corresponding Host for the N VNFCs according to the principle that the higher the first priority is, the higher the service quality level of the corresponding Host resource is. I.e. a higher first priority may represent more resources required by the VNFC or a higher required quality of service, and thus a higher quality of service Host resource is allocated to it.
It can be understood that there are multiple Host resources in the data center, and in the embodiment of the present application, the available resource information of all hosts in the data center DC may be obtained, or of course, only the available resource information of some hosts may be obtained. Because the resource pool where the DC may exist is huge, it may be wasted if all resources in the DC resource pool are acquired each time, and therefore, the DC may be divided into regions and only all hosts of a certain region may be acquired. The specific value of L is not limited in this application.
In a possible implementation manner, the better the CPU performance of the Host and/or the larger the storage space is, the higher the level of the service quality of the corresponding Host resource is.
Optionally, the embodiment of the present application may further include step S306 and step S307, to perform specific execution on the determined correspondence between the VNFCs and the Host, that is, perform specific mapping of Host resources on the N VNFCs according to the determined correspondence, specifically, step S306 to step S307 may refer to step S204 to step S205 in the embodiment of fig. 3, and details are not repeated here.
The embodiment of the application not only retains the beneficial effects of the embodiment corresponding to fig. 3, but also further determines the service quality level of the Host, so as to perform bidirectional corresponding matching according to the first priority of the VNFC and the service quality level of the Host, more accurately allocate the better Host resources to the VNFC with the higher first priority, effectively improve the utilization rate of the Host resources, and facilitate the improvement of the overall performance of the NFV framework.
Referring to fig. 6, fig. 6 is a schematic flowchart of another network slice resource mapping method provided in the embodiment of the present application. The network slice resource mapping apparatus 10 in fig. 2 is configured to support and execute the method flow steps S401 to S410 shown in fig. 6, and optionally, is further configured to support and execute the method flow steps S411 and S412. It should be noted that, in order to describe the network slice resource mapping method in the embodiment of the present application in more detail, the corresponding execution main body is described in each flow step in the present application, but this does not mean that the embodiment of the present application can only execute the corresponding method flow through the described execution main body.
Step S401: the Sender sends an instantiation request of the network Slice to the NS/Slice Policy Agent; the NS/Slice Policy Agent receives an instantiation request for a network Slice.
Specifically, the resource requirement information includes a resource requirement size of the VNFCs and a topological relationship between the N VNFCs.
Step S402: and the NS/Slice Policy Agent acquires the adjacent VNFC of each VNFC according to the VNFC topological relation, wherein a VNFC link is established between the two adjacent VNFCs.
Specifically, the resource requirement information includes a resource requirement size of the VNFCs and a VNFC topology relationship between the N VNFCs, and the topology relationship mainly includes a link connection relationship between the VNFCs, that is, a VNFC link refers to a link between two adjacent VNFCs.
Similarly, in the embodiment of the present application, compared with the embodiments corresponding to fig. 3 and fig. 5, the difference is that not only the resource requirement of the VNFC itself is used as the only determining factor with the first priority being higher or lower, but also the resource requirement of the adjacent VNFC of the VNFC is used as the determining basis with the first priority being higher or lower, because in the subsequent mapping process of the Host resource, the adjacent Host is preferentially mapped onto the same Host, so as to avoid the situation that a VNFC link needs to be established between the adjacent VNFCs and bandwidth resources are wasted, and if the resource requirement of the adjacent VNFC of one VNFC is larger, the interaction between the VNFC and the VNFCs is proved to be more, and if the resource requirement of the adjacent VNFC is larger, the first priority of the VNFC can be indirectly proved to be higher.
Step S403: and the NS/Slice Policy Agent respectively calculates the total resource demand size of each VNFC and the adjacent VNFCs according to the resource demand size of the VNFC.
In a possible implementation manner, the resource requirement size of the adjacent VNFC may also be multiplied by a certain weight coefficient, then added to the resource requirement size of the VNFC itself, and then sorted, in short, as long as the factor of the available resource size of the adjacent VNFC is considered, how to specifically weight the total resource requirement size of the whole (including the VNFC and its adjacent VNFC) may be flexibly performed, and this application is not particularly limited thereto.
Step S404: and the NS/Slice Policy Agent determines the first priority of the N VNFCs according to the total resource demand, wherein the larger the total resource demand is, the higher the corresponding first priority is.
Step S405: the MANO reports the available resource information of L Host in the DC network of the data center to the NS/Slice Policy Agent; the NS/Slice Policy Agent acquires the available resource information of L hosts in the DC network of the data center.
Specifically, the available resource information includes a current available resource size of the Host and a Host topology relationship between the L hosts. The available resource information of the L hosts in the embodiment of the present application includes not only the type and size of the resource that can be provided by each Host, but also the topological relationship between the L hosts, that is, information such as the connection link between the hosts, so as to subsequently allocate corresponding bandwidth resources to the VNFC link between the VNFCs.
Step S406: and the NS/Slice Policy Agent acquires the adjacent Host of each Host according to the Host topological relation, wherein a Host link is established between the two adjacent hosts.
Specifically, the adjacent Host of each Host is obtained through the topological relation between the hosts obtained in step S405, that is, the Host with which the Host link is established is obtained.
Step S407: the NS/Slice Policy Agent respectively calculates the size of the available total resource of each Host and the adjacent Host according to the size of the available resource of the Host;
specifically, the total available resource size of each Host and its neighboring hosts is calculated, and the available total resource size of each Host (including the available resources of its neighboring hosts) is obtained.
Step S408: and the NS/Slice Policy Agent determines the service quality grades of the L hosts according to the size of the available total resources, wherein the larger the available total resources are, the higher the corresponding service quality grade is.
Specifically, after the total available resource size corresponding to each Host and its neighboring hosts is obtained through statistics, the service quality grades of each Host are ranked according to the total available resource size, where the ranking principle is that the larger the total available resource is, the higher the corresponding service quality grade is, the difference between the embodiment of the present application and the embodiment of the application corresponding to fig. 5 is that the grade of the service quality of the Host in fig. 5 is only related to the available resource size of the Host, and the larger the available resource is, the higher the corresponding service quality grade is. In the embodiment of the application, not only the size of the available resource of the Host itself is considered, but also the size of the available resource of the adjacent Host of the Host is considered, because the adjacent Host is the Host with the Host link established between the adjacent Host and the Host, and just because of the Host link, the Host resource can be shared between the Host and the adjacent Host. Therefore, if the available resources provided by the Host are not large, but the number of the adjacent hosts is large, and the available resources of the adjacent hosts are large, the available resources can be indirectly provided for the Host, so that when one Host has more adjacent hosts and more available resources, the grade of the service quality of the Host can be improved.
In a possible implementation manner, the size of the available resource of the adjacent Host may also be multiplied by a certain weight coefficient, then the obtained value is added to the size of the available resource of the Host itself, and then the ranking is performed, in short, as long as the factor of the size of the available resource of the adjacent Host is considered, how to perform weighting on the size of the total available resource of the whole (including the Host and the adjacent Host) may be flexible, and this application is not limited specifically.
Step S409: and the NS/Slice Policy Agent determines the Host corresponding to the target VNFC with the highest first priority and the corresponding relation which is not determined currently as the target Host, determines the Host corresponding to the adjacent VNFC of the target VNFC as the target Host, and the target Host is the Host with the highest service quality level which can be mapped currently.
Specifically, in the embodiment of the present application, when determining the correspondence between the VNFCs and the Host, it is considered that the determination is started from the target VNFC with the largest total resource demand size, that is, the first highest target VNFC, and the physical resource in the DC resource pool mapped to the target VNFC is naturally also the target Host with the highest service quality level. Next, the difference from the embodiment corresponding to fig. 3 is that, in the embodiment of the present application, not only all VNFCs are directly subjected to the Host resource allocation correspondence according to the first priority level, but after a certain VNFC is subjected to the Host correspondence, it is prioritized to correspond its adjacent VNFCs to the same Host determined by the VNFC, because a VNFC link is established between the adjacent VNFCs, and if the adjacent VNFCs can be mapped to the same Host, the VNFC link can be omitted, because communication is performed inside the same Host, and there is no need to pass through the VNFC link, that is, there is no need to consume bandwidth resources.
In a possible implementation manner, according to the first priority, determining, as the target Host, hosts corresponding to adjacent VNFCs of the target VNFC in sequence; and judging the adjacent VNFC which does not correspond to the target Host as the VNFC of which the corresponding relation is not determined currently. That is, after the target VNFC is associated with the target Host, when the target VNFC is associated with the target Host, the target Host resources may be associated with the adjacent VNFCs in sequence according to the first priority of the adjacent VNFCs. If, in the sequential correspondence process, the current target Host has limited physical resources, and therefore the correspondence of the Host cannot be completed for all the adjacent VNFCs, then the VNFC without the mapping of the Host resource is determined as the VNFC without the mapping of the Host resource at this time, and then the adjacent VNFCs which do not correspond to the target Host need to be subsequently determined as the VNFCs for which the correspondence relationship is currently not determined, so that the correspondence relationship of the Host needs to be determined again subsequently.
Step S410: and the NS/Slice Policy Agent executes the step of determining the Host corresponding to the target VNFC with the highest first priority and without the corresponding relationship currently determined as the target Host until the N VNFCs determine the corresponding Host.
Specifically, based on the determination result in step S409 and all VNFCs for which correspondence has not been currently determined, the loop execution according to step S409 is performed again, that is, the VNFCs with the higher first priority and which have already completed Host correspondence determination and the adjacent VNFCs with the higher first priority and which correspond to the VNFCs are removed, all VNFCs for which correspondence determination has failed and for which correspondence determination has not been performed are mapped again according to the mapping rule in step S409, and the above operation is repeated in this loop until all VNFCs complete corresponding Host relationship determination.
Taking the specific application scenario diagram corresponding to fig. 4 as an example, assume that the VNFCs of the network slice 1 in fig. 4 have the first priority order from high to lowB1、VNFCA1、VNFCB2And the service quality of the Host in the DC is ranked from top to bottom as Host1 and Host2, so according to the mapping method provided in the embodiment of the present application, the VNFC is rankedB1Preferential mapping to Host1, followed by VNFCB1Is VNFCA1And VNFCB2Mapping and prioritizing the VNFC with the first higher priorityA1Mapping to Host1, if the resources on Host1 are already urgent, the VNFC cannot be continuedB2When mapping to Host1, then VNFC is mappedB2Mapping to the Host2 with the highest grade of quality of service. The following need to map the links between VNFCs based on the above mapping relationship, since the VNFCs are already in useB1And VNFCA1Mapped on the same Host1, thus VNFC link VLA1-B1Then culling can be performed without further mapping, and only VL is needed at this timeB1-B2Is not required, and because of VNFCB1And VNFCB2Mapped on Host1 and Host2, respectively, and thus VLB1-B2It needs to be mapped on the Host link between Host1 and Host 2.
Optionally, the embodiment of the present application may further include step S411 and step S412, to perform specific execution on the determined correspondence between the VNFCs and the Host, that is, perform specific mapping of Host resources on the N VNFCs according to the determined correspondence, specifically, step S411 to step S412 may refer to step S204 to step S205 in the embodiment of fig. 3, and details are not repeated here.
The embodiment of the present application not only retains the beneficial effects of the embodiments corresponding to fig. 3 and fig. 5, but also further considers the influence of the neighboring VNFCs of the VNFCs on the first priority level thereof and the influence of the neighboring Host of the Host on the service quality level thereof, further accurately allocates the better Host resources to the VNFCs with the higher first priority level, effectively improves the utilization rate of the Host resources, and is beneficial to improving the overall performance of the NFV framework.
Referring to fig. 7, fig. 7 is a schematic flowchart of another network slice resource mapping method provided in the embodiment of the present application. The network slice resource mapping apparatus 10 in fig. 2 is configured to support and execute the method flow step S501 and step S514 shown in fig. 7, and optionally, is further configured to support and execute the method flow step S515 and step S516. It should be noted that, in order to describe the network slice resource mapping method in the embodiment of the present application in more detail, the corresponding execution main body is described in each flow step in the present application, but this does not mean that the embodiment of the present application can only execute the corresponding method flow through the described execution main body.
It is understood that the method flow in the embodiment of the present application may be combined with any one of the method flows in the embodiments corresponding to fig. 3, fig. 5, fig. 6, or fig. 7, and the method flow corresponding to fig. 6 is described below as an example, but is not limited to being combined with the method flow corresponding to fig. 3, fig. 5, or fig. 7.
Step S501 to step S510 refer to step S401 to step S410 in the above embodiment of fig. 6, which is not described herein again.
Step S511: and acquiring bandwidth resource information of a Host link between L hosts in the DC network of the data center.
Specifically, the resource requirement information of the instantiation request further includes a bandwidth requirement size of X VNFC links among the N VNFCs, where X is an integer greater than 0. Since the resource mapping of the VNFCs also relates to bandwidth mapping of VNFC links between the VNFCs, after the VNFCs have completed the determination of the corresponding relationship of the Host, it is necessary to determine the correspondence of the bandwidth resources to the VNFC links between the VNFCs according to the determined correspondence of the VNFCs on the specific Host. It should be emphasized that, in this step, the acquisition of the bandwidth resource information of the Host link between the Host and the Host may be performed simultaneously with the "acquiring available resource information of L hosts in the data center DC network" in step S505, or may be performed non-sequentially, that is, the embodiment of the present application does not specifically limit when the bandwidth resource information of the Host link between the hosts is acquired, and as long as the bandwidth resource information is acquired before the use of the bandwidth resource information in step S515, the acquisition of the bandwidth resource information of the Host link between the hosts belongs to the scope covered by the present application.
Step S512: and detecting whether the X VNFC links contain redundant VNFC links or not, wherein two VNFCs of the redundant VNFC links correspond to the same Host.
Specifically, before mapping the VNFC links, it is detected whether two VNFCs corresponding to all VNFC links that need to be mapped correspond to the same Host, because bandwidth resources do not need to be reallocated between the VNFCs corresponding to the same Host to establish the VNFC links for the VNFC links. Therefore, the VNFC links of this type can be eliminated, and only the VNFC links existing between VNFCs corresponding to different hosts need to be allocated with bandwidth resources.
Step S513: if Y redundant VNFC links are detected, determining second priorities of (X-Y) VNFC links except the Y redundant VNFC links in the X VNFC links according to the bandwidth demand size, wherein the larger the bandwidth demand of the VNFC links in the (X-Y) VNFC links is, the higher the corresponding second priorities are, and both Y and X-Y are integers greater than or equal to 0.
Specifically, the (X-Y) VNFC links from which the redundant VNFC links are removed in step S515 are determined uniformly with respect to the second priority of the VNFC links, where the determination rule is that the larger the bandwidth requirement of the VNFC links is, the higher the second priority is.
Step S514: and determining a Host link corresponding to the (X-Y) VNFC links according to the bandwidth resource information and the level of the second priority.
In particular, the mapping of bandwidth resources is also performed according to the second priority level, because there may be a problem that the bandwidth resources between two hosts are limited, and the correspondence of VNFC links is directly related to whether the mapping of VNFCs is successful, so the correspondence may still be determined from the highest VNFC link,
optionally, if bandwidth resources of a VNFC link in the (X-Y) VNFC links are not mapped successfully, determining that two VNFCs corresponding to the VNFC link fail to map DC resources. That is, after the correspondence relationship between the VNFC links is determined according to the steps in step S514 and step S515, since the mapping cannot be completed due to the problem of the bandwidth resource between the hosts, the two VNFCs corresponding to the failed VNFC link also correspond to the correspondence relationship determination failure, and thus, feedback of the failure of the VNFC correspondence relationship determination can be performed.
In one possible implementation, the rule for determining the specific correspondence of the VNFC link may be mapped by using a depth first search DFS algorithm.
Optionally, this embodiment of the present application may further include step S515 and step S516, to perform specific execution on the determined correspondence between the VNFCs and the Host, that is, perform specific mapping of Host resources on the N VNFCs according to the determined correspondence, specifically, step S515 to step S516 may refer to step S204 to step S205 in the embodiment of fig. 3, which is not described herein again.
The embodiment of the present application not only retains the beneficial effects of the embodiments corresponding to fig. 3, fig. 5, and fig. 6, but also considers the priority of the bandwidth resource demand size when the VNFC link of the VNFC determines the corresponding Host link, and allocates the corresponding bandwidth resources to the VNFC link according to the priority, thereby avoiding the failure of the determination of the VNFC correspondence relationship due to the insufficiency of the bandwidth resources of the Host link in the VNFC link with a higher priority, and ensuring the reasonability of the allocation of the bandwidth resources of the VNFC link while ensuring the reasonability of the allocation of the Host resources of the VNFC.
In order to better implement fig. 3 to fig. 7 (corresponding network slice resource mapping methods) in the embodiments of the present application, the present application also provides related devices for implementing the methods described above.
Referring to fig. 8, fig. 8 is a schematic structural diagram of another network slice resource mapping apparatus according to an embodiment of the present disclosure. As shown in fig. 8, the apparatus 20 includes: a receiving unit 201, a first determining unit 202 and a second determining unit 203.
A receiving unit 201, configured to receive an instantiation request of a network slice, where the network slice includes M virtualized network function VNFs, the M VNFs include N virtualized network function components VNFCs, and the instantiation request includes resource requirement information of each VNFC of the N VNFCs, where N and M are integers greater than 1;
a first determining unit 202, configured to determine first priorities of the N VNFCs according to the resource demand information;
a second determining unit 203, configured to determine, according to the first priority, a correspondence between the N VNFCs and a Host, where the correspondence is used to perform mapping of Host resources for the N VNFCs.
Specifically, the resource requirement information includes a resource requirement size of the VNFC:
the first determining unit 202 is specifically configured to: determining first priorities of the N VNFCs according to resource demand sizes of the N VNFCs, wherein the larger the resource demand size is, the higher the corresponding first priority is.
Further, the resource requirement information includes a resource requirement size of the VNFCs and VNFC topology relationships between the N VNFCs;
the first determining unit 202 is specifically configured to: acquiring adjacent VNFCs of each VNFC according to the VNFC topological relation, wherein a VNFC link is established between every two adjacent VNFCs; respectively calculating the total resource demand size of each VNFC and the adjacent VNFCs according to the resource demand size of the VNFC; and determining first priorities of the N VNFCs according to the total resource demand, wherein the larger the total resource demand is, the higher the corresponding first priority is.
Optionally, as shown by the dashed box in fig. 8, the apparatus 20 further comprises:
a first obtaining unit 204, configured to obtain available resource information of L hosts in a data center DC network;
a third determining unit 205, configured to determine quality of service levels of the L hosts according to the available resource information;
the second determining unit 203 is specifically configured to: and determining the corresponding relation between the N VNFCs and the Host according to the level of the first priority and the level of the quality of service level of the L hosts, wherein the higher the first priority is, the higher the quality of service level of the corresponding Host is.
Still further, the available resource information includes the available resource size of the Host and the Host topological relation among the L hosts;
the third determining unit 205 is specifically configured to: acquiring adjacent hosts of each Host according to the Host topological relation, wherein a Host link is established between every two adjacent hosts; respectively calculating the size of the available total resource of each Host and the adjacent hosts according to the size of the available resource of the Host; and determining the service quality grades of the L hosts according to the size of the available total resources, wherein the larger the available total resources are, the higher the corresponding service quality grade is.
Still further, the second determining unit 203 is specifically configured to:
determining a Host corresponding to the target VNFC with the highest first priority and without the corresponding relation determined currently as a target Host, wherein the target Host is the Host with the highest service quality level and can be mapped currently; determining a Host corresponding to an adjacent VNFC of the target VNFC as the target Host; and executing the step of determining the Host corresponding to the target VNFC with the highest first priority and without the corresponding relationship currently determined as the target Host until all the N VNFCs determine the corresponding Host.
Still further, the second determining unit 203 is configured to determine a Host corresponding to an adjacent VNFC of the target VNFC as the target Host, specifically:
and according to the first priority, sequentially determining the Host corresponding to the adjacent VNFC of the target VNFC as the target Host, and determining the adjacent VNFC which does not correspond to the target Host as the VNFC of which the corresponding relation is not currently determined.
Still further, as shown in fig. 8, the resource requirement information includes bandwidth requirement sizes of X VNFC links among the N VNFCs, where X is an integer greater than 0;
optionally, as shown by the dashed box in fig. 8, the apparatus 20 further comprises:
a second obtaining unit 206, configured to obtain bandwidth resource information of a Host link between L hosts in a data center DC network;
a detecting unit 207, configured to detect whether a redundant VNFC link is included in the X VNFC links after determining a correspondence between the N VNFCs and a Host according to a level of the first priority, where two VNFCs of the redundant VNFC links correspond to a same Host;
a fourth determining unit 208, configured to determine, if Y redundant VNFC links are detected, a second priority of (X-Y) VNFC links, except for the Y redundant VNFC links, in the X VNFC links according to the size of the bandwidth requirement, where the larger the bandwidth requirement of a VNFC link in the (X-Y) VNFC links is, the higher the corresponding second priority is, and both Y and (X-Y) are integers greater than or equal to 0;
a fifth determining unit 209, configured to determine, according to the bandwidth resource information, a Host link corresponding to the (X-Y) VNFC links according to the level of the second priority.
In the embodiment of the present application, the network slice resource mapping device 20 is presented in the form of a unit. An "element" may refer to an application-specific integrated circuit (ASIC), a processor and memory that execute one or more software or firmware programs, an integrated logic circuit, and/or other devices that may provide the described functionality. Further, the first determining unit 202, the second determining unit 203, the third determining unit 205, the detecting unit 207, the fourth determining unit 208, and the fifth determining unit 209 may be implemented by the processor 101 of the network slice resource mapping apparatus shown in fig. 2, and the receiving unit 201, the first obtaining unit 204, and the second obtaining unit 206 may be implemented by the processor 101 of the network slice resource mapping apparatus shown in fig. 2 controlling the communication interface 103.
It should be noted that, for the functions of each functional unit in the apparatus 20 described in the embodiment of the present application, reference may be made to the corresponding network slice resource mapping apparatus in the embodiment shown in fig. 2 and the related descriptions of the method embodiments described in fig. 3 to fig. 7, which are not described herein again.
The present application further provides a computer storage medium, where the computer storage medium may store a program, and when the program is executed, the program includes some or all of the steps of any one of the network slice resource mapping methods described in the foregoing method embodiments.
Embodiments of the present application also provide a computer program, which includes instructions that, when executed by a computer, enable the computer to perform some or all of the steps of any one of the network slice resource mapping methods.
In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required in this application.
In the embodiments provided in the present application, it should be understood that the disclosed apparatus may be implemented in other manners. For example, the above-described embodiments of the apparatus are merely illustrative, and for example, the above-described division of the units is only one type of division of logical functions, and other divisions may be realized in practice, 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 some interfaces, devices or units, and may be an electric 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 integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit may be stored in a computer-readable storage medium if it is implemented in the form of a software functional unit and sold or used as a separate product. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution 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, a network device, or the like, and may specifically be a processor in the computer device) to execute all or part of the steps of the above-described method of the embodiments of the present application. The storage medium may include: a U-disk, a removable hard disk, a magnetic disk, an optical disk, a Read-Only Memory (ROM) or a Random Access Memory (RAM), and the like.
The above embodiments are only used for illustrating the technical solutions of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions in the embodiments of the present application.

Claims (14)

1. A network slice resource mapping method is characterized by comprising the following steps:
receiving an instantiation request of a network slice, wherein the network slice comprises M virtualized network function VNFs, the M VNFs comprise N virtualized network function components VNFCs, and the instantiation request comprises resource demand information of each VNFC in the N VNFCs, wherein N and M are integers greater than 1;
determining first priorities of the N VNFCs according to the resource demand information;
determining a corresponding relation between the N VNFCs and a Host according to the first priority, wherein the corresponding relation is used for mapping Host resources for the N VNFCs;
the method further comprises the following steps:
acquiring available resource information of L hosts in a DC network of a data center;
determining the service quality grades of the L hosts according to the available resource information;
the determining the corresponding relationship between the N VNFCs and the Host resource according to the first priority includes:
and determining the corresponding relation between the N VNFCs and the Host according to the level of the first priority and the level of the quality of service level of the L hosts, wherein the higher the first priority is, the higher the quality of service level of the corresponding Host is.
2. The method of claim 1, wherein the resource requirement information comprises a resource requirement size of a VNFC;
the determining the first priorities of the N VNFCs according to the resource demand information includes:
determining first priorities of the N VNFCs according to resource demand sizes of the N VNFCs, wherein the larger the resource demand size is, the higher the corresponding first priority is.
3. The method of claim 1, wherein the resource requirement information comprises a resource requirement size of VNFCs and VNFC topology relationships between the N VNFCs;
the determining the first priorities of the N VNFCs according to the resource demand information includes:
acquiring adjacent VNFCs of each VNFC according to the VNFC topological relation, wherein a VNFC link is established between every two adjacent VNFCs;
respectively calculating the total resource demand size of each VNFC and the adjacent VNFCs according to the resource demand size of the VNFC;
and determining first priorities of the N VNFCs according to the total resource demand, wherein the larger the total resource demand is, the higher the corresponding first priority is.
4. The method of claim 1, wherein the available resource information comprises an available resource size of a Host and a Host topology relationship between the L hosts;
the determining the service quality levels of the L hosts according to the available resource information comprises:
acquiring adjacent hosts of each Host according to the Host topological relation, wherein a Host link is established between every two adjacent hosts;
respectively calculating the size of the available total resource of each Host and the adjacent hosts according to the size of the available resource of the Host;
and determining the service quality grades of the L hosts according to the size of the available total resources, wherein the larger the available total resources are, the higher the corresponding service quality grade is.
5. The method of claim 4, wherein the determining the correspondence between the N VNFCs and the Host according to the first priority comprises:
determining a Host corresponding to the target VNFC with the highest first priority and without the corresponding relation determined currently as a target Host, wherein the target Host is the Host with the highest service quality level and can be mapped currently;
determining a Host corresponding to an adjacent VNFC of the target VNFC as the target Host;
and executing the step of determining the Host corresponding to the target VNFC with the highest first priority and without the corresponding relationship currently determined as the target Host until all the N VNFCs determine the corresponding Host.
6. The method of claim 5, wherein determining a Host corresponding to a neighbor VNFC of the target VNFC as the target Host comprises:
according to the first priority, determining hosts corresponding to adjacent VNFCs of the target VNFC as the target hosts in sequence;
and judging the adjacent VNFC which does not correspond to the target Host as the VNFC of which the corresponding relation is not determined currently.
7. The method according to any of claims 1 to 6, wherein the resource requirement information includes a bandwidth requirement size of X VNFC links between the N VNFCs, where X is an integer greater than 0;
the method further comprises the following steps:
acquiring bandwidth resource information of a Host link between L hosts in a DC network of a data center;
after determining the correspondence between the N VNFCs and the Host according to the first priority, the method includes:
detecting whether redundant VNFC links are included in the X VNFC links, wherein two VNFCs of the redundant VNFC links correspond to the same Host;
if Y redundant VNFC links are detected, determining second priorities of (X-Y) VNFC links except the Y redundant VNFC links in the X VNFC links according to the bandwidth demand size, wherein the larger the bandwidth demand of the VNFC links in the (X-Y) VNFC links is, the higher the corresponding second priorities are, and both Y and X-Y are integers greater than or equal to 0;
and determining a Host link corresponding to the (X-Y) VNFC links according to the bandwidth resource information and the level of the second priority.
8. A network slice resource mapping apparatus, comprising:
a receiving unit, configured to receive an instantiation request of a network slice, where the network slice includes M virtualized network function VNFs, the M VNFs include N virtualized network function components VNFCs, and the instantiation request includes resource demand information of each VNFC of the N VNFCs, where N and M are integers greater than 1;
a first determining unit, configured to determine first priorities of the N VNFCs according to the resource demand information;
a second determining unit, configured to determine, according to a level of the first priority, a correspondence between the N VNFCs and a Host, where the correspondence is used to perform mapping of Host resources for the N VNFCs;
the device further comprises:
the first acquisition unit is used for acquiring available resource information of L hosts in a DC network of a data center;
a third determining unit, configured to determine quality of service levels of the L hosts according to the available resource information;
the second determining unit is specifically configured to: and determining the corresponding relation between the N VNFCs and the Host according to the level of the first priority and the level of the quality of service level of the L hosts, wherein the higher the first priority is, the higher the quality of service level of the corresponding Host is.
9. The apparatus of claim 8, wherein the resource requirement information comprises a resource requirement size of a VNFC;
the first determining unit is specifically configured to: determining first priorities of the N VNFCs according to resource demand sizes of the N VNFCs, wherein the larger the resource demand size is, the higher the corresponding first priority is.
10. The apparatus of claim 8, wherein the resource requirement information comprises a resource requirement size of VNFCs and VNFC topology relationships between the N VNFCs;
the first determining unit is specifically configured to: acquiring adjacent VNFCs of each VNFC according to the VNFC topological relation, wherein a VNFC link is established between every two adjacent VNFCs; respectively calculating the total resource demand size of each VNFC and the adjacent VNFCs according to the resource demand size of the VNFC; and determining first priorities of the N VNFCs according to the total resource demand, wherein the larger the total resource demand is, the higher the corresponding first priority is.
11. The apparatus of claim 8, wherein the available resource information comprises an available resource size of a Host and a Host topology relationship between the L hosts;
the third determining unit is specifically configured to: acquiring adjacent hosts of each Host according to the Host topological relation, wherein a Host link is established between every two adjacent hosts; respectively calculating the size of the available total resource of each Host and the adjacent hosts according to the size of the available resource of the Host; and determining the service quality grades of the L hosts according to the size of the available total resources, wherein the larger the available total resources are, the higher the corresponding service quality grade is.
12. The apparatus according to claim 11, wherein the second determining unit is specifically configured to:
determining a Host corresponding to the target VNFC with the highest first priority and without the corresponding relation determined currently as a target Host, wherein the target Host is the Host with the highest service quality level and can be mapped currently; determining a Host corresponding to an adjacent VNFC of the target VNFC as the target Host; and executing the step of determining the Host corresponding to the target VNFC with the highest first priority and without the corresponding relationship currently determined as the target Host until all the N VNFCs determine the corresponding Host.
13. The apparatus according to claim 12, wherein the second determining unit is configured to determine, as the target Host, a Host corresponding to an adjacent VNFC of the target VNFC, specifically:
and according to the first priority, sequentially determining the Host corresponding to the adjacent VNFC of the target VNFC as the target Host, and determining the adjacent VNFC which does not correspond to the target Host as the VNFC of which the corresponding relation is not currently determined.
14. The apparatus according to any of claims 8-13, wherein the resource requirement information comprises a bandwidth requirement size of X VNFC links between the N VNFCs, where X is an integer greater than 0; the device further comprises:
the second acquisition unit is used for acquiring bandwidth resource information of a Host link between L hosts in the DC network of the data center;
the device, still include:
the detection unit is used for detecting whether redundant VNFC links are included in the X VNFC links after determining the corresponding relation between the N VNFCs and the Host according to the first priority, wherein two VNFCs of the redundant VNFC links correspond to the same Host;
a fourth determining unit, configured to determine, according to the size of the bandwidth requirement, a second priority of (X-Y) VNFC links, except for the Y redundant VNFC links, in the X VNFC links, if Y redundant VNFC links are detected, where the larger the bandwidth requirement of a VNFC link in the (X-Y) VNFC links is, the higher the corresponding second priority is, and both Y and (X-Y) are integers greater than or equal to 0;
and a fifth determining unit, configured to determine, according to the bandwidth resource information and according to the level of the second priority, a Host link corresponding to the (X-Y) VNFC links.
CN201611092681.4A 2016-11-30 2016-11-30 Network slice resource mapping method, related equipment and system Active CN108132827B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201611092681.4A CN108132827B (en) 2016-11-30 2016-11-30 Network slice resource mapping method, related equipment and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201611092681.4A CN108132827B (en) 2016-11-30 2016-11-30 Network slice resource mapping method, related equipment and system

Publications (2)

Publication Number Publication Date
CN108132827A CN108132827A (en) 2018-06-08
CN108132827B true CN108132827B (en) 2021-12-10

Family

ID=62388340

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201611092681.4A Active CN108132827B (en) 2016-11-30 2016-11-30 Network slice resource mapping method, related equipment and system

Country Status (1)

Country Link
CN (1) CN108132827B (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111200859A (en) * 2018-11-19 2020-05-26 华为技术有限公司 Network slice selection method, network equipment and terminal
CN111355602B (en) * 2018-12-21 2021-11-30 华为技术有限公司 Resource object management method and device
CN112118579B (en) * 2019-06-21 2024-03-26 华为技术有限公司 Resource allocation method and device
CN110958666B (en) * 2019-11-20 2022-02-18 无锡北邮感知技术产业研究院有限公司 Network slice resource mapping method based on reinforcement learning
CN113055218B (en) * 2019-12-29 2022-08-05 中国移动通信集团浙江有限公司 Redundancy evaluation method and device for NFV network and computing equipment
CN112672110B (en) * 2020-12-16 2023-05-26 深圳市国电科技通信有限公司 Unmanned aerial vehicle inspection real-time video transmission system based on network slicing
CN114172820B (en) * 2021-11-26 2024-03-05 广东技术师范大学 Cross-domain SFC dynamic deployment method, device, computer equipment and storage medium

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102932479B (en) * 2012-11-16 2015-01-07 北京邮电大学 Virtual network mapping method for realizing topology awareness based on historical data
CN103856563B (en) * 2014-03-06 2017-05-10 南京理工大学 Cloud computing network resource distribution method based on service quality requirement drive
CN105634780B (en) * 2014-11-04 2020-04-07 中兴通讯股份有限公司 Method and device for realizing VNF elastic expansion
CN105634778B (en) * 2014-11-04 2020-09-22 南京中兴软件有限责任公司 Method and system for realizing VNF instantiation, NFVO and VNFM
CN105634782B (en) * 2014-11-06 2019-03-01 华为技术有限公司 A kind of method and network element management device instantiating VNF
WO2016082143A1 (en) * 2014-11-27 2016-06-02 华为技术有限公司 Virtual network policy configuration method and system, as well as virtual network element and network management system thereof
CN104598316B (en) * 2014-12-25 2018-06-05 华为技术有限公司 A kind of storage resource distribution method and device
JP6418255B2 (en) * 2015-02-06 2018-11-07 日本電気株式会社 Fault monitoring apparatus, virtual network system, fault monitoring method and program
CN104917659B (en) * 2015-06-02 2018-09-14 浙江大学 A kind of mapping method of virtual network based on virtual network connection performance

Also Published As

Publication number Publication date
CN108132827A (en) 2018-06-08

Similar Documents

Publication Publication Date Title
CN108132827B (en) Network slice resource mapping method, related equipment and system
US11704144B2 (en) Creating virtual machine groups based on request
EP3606008B1 (en) Method and device for realizing resource scheduling
US20190230004A1 (en) Network slice management method and management unit
US10694389B2 (en) Network slice management method, management unit, and system
US10924966B2 (en) Management method, management unit, and system
EP3461087A1 (en) Network-slice resource management method and apparatus
US11831509B2 (en) Network service management method, device, and system
CN110098946B (en) Method and device for deploying virtualized network element equipment
WO2018040525A1 (en) Method, device, and equipment for processing resource pool
CN109522090B (en) Resource scheduling method and device
CN106663012B (en) Hardware acceleration method and related equipment
CN106031116A (en) Method, apparatus and system for associating NS with VNF
EP4187813A1 (en) Resource distribution method for cloud service and related device
CN107251486A (en) A kind of method for extending linkage, apparatus and system
CN112583615B (en) VNF instantiation method, NFVO, VIM, VNFM and system
CN108345490B (en) Method and system for deploying virtual machine in NFV
CA3190966A1 (en) Automatic node fungibility between compute and infrastructure nodes in edge zones
TW201327205A (en) Managing method for hardware performance and cloud computing system
WO2017070963A1 (en) Method, apparatus, and system for deploying virtual resources
CN115686843A (en) Heterogeneous virtualization multi-tenant resource isolation scheduling method and device
CN110347473B (en) Method and device for distributing virtual machines of virtualized network elements distributed across data centers
CN109558214B (en) Host machine resource management method and device in heterogeneous environment and storage medium
CN108206838B (en) A kind of SiteServer LBS, method and device
CN112118579B (en) Resource allocation 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