CN113067720A - Service chain remapping method, electronic equipment and storage medium - Google Patents

Service chain remapping method, electronic equipment and storage medium Download PDF

Info

Publication number
CN113067720A
CN113067720A CN202110226806.2A CN202110226806A CN113067720A CN 113067720 A CN113067720 A CN 113067720A CN 202110226806 A CN202110226806 A CN 202110226806A CN 113067720 A CN113067720 A CN 113067720A
Authority
CN
China
Prior art keywords
network
service
service chain
resource pool
network resource
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202110226806.2A
Other languages
Chinese (zh)
Other versions
CN113067720B (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.)
Beijing University of Posts and Telecommunications
Original Assignee
Beijing University of Posts and Telecommunications
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 Beijing University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Priority to CN202110226806.2A priority Critical patent/CN113067720B/en
Publication of CN113067720A publication Critical patent/CN113067720A/en
Application granted granted Critical
Publication of CN113067720B publication Critical patent/CN113067720B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06Management of faults, events, alarms or notifications
    • H04L41/0654Management of faults, events, alarms or notifications using network fault recovery
    • H04L41/0663Performing the actions predefined by failover planning, e.g. switching to standby network elements

Abstract

The embodiment of the specification provides a service chain remapping method, an electronic device and a storage medium. The method comprises the following steps: determining network service corresponding to the fault service chain; acquiring network resources of a communication network providing communication services for the network service to generate a network resource pool; determining a failed network resource corresponding to the failed service chain, and deleting the failed network resource from the network resource pool to update the network resource pool; and generating a target mapping scheme for the network service according to the network resource pool and deploying a service chain according to the target mapping scheme. The electronic device comprises a memory, a processor, and a computer program stored on the memory and executable on the processor to perform the service chain remapping method. The non-transitory computer-readable storage medium stores computer instructions for causing the computer to perform the service chain remapping method.

Description

Service chain remapping method, electronic equipment and storage medium
Technical Field
One or more embodiments of the present disclosure relate to the field of network communication technologies, and in particular, to a service chain remapping method, an electronic device, and a storage medium.
Background
In recent years, the innovation of internet technology and the generation of massive terminals are mutually promoted and jointly developed, and the emerging application of diversified functions brings great convenience to the life of people. Meanwhile, the generation of a large number of emerging applications promotes the increase in the demand of users for network services, resulting in a proliferation of network traffic. At present, people often use Network Function Virtualization (NFV) technology to provide corresponding service chains for various Network services to implement Network services.
The generation of service chains enables network service providers to provide high quality end-to-end customized services to users, ensuring that meeting QoS requirements of the service is the ultimate goal of deploying service chains. However, when the network service is implemented by using the service chain, a service chain fault may occur, which inevitably increases the service delay and the packet loss rate, and adversely affects the service quality of the service. Most of the existing service chain remapping methods mainly save resources, and the communication service quality of the network service cannot be considered for quickly replying the network service, so that the communication service quality of the network service after remapping is reduced.
Disclosure of Invention
In view of the above, an object of one or more embodiments of the present disclosure is to provide a service chain remapping method, an electronic device, and a storage medium, which can provide a new service chain for network service again when the service chain fails, where the new service chain can meet the service quality requirement of the service to the greatest extent.
In view of the above, one or more embodiments of the present specification provide a service chain remapping method, including:
determining network service corresponding to the fault service chain;
acquiring network resources of a communication network providing communication services for the network service to generate a network resource pool;
determining a failed network resource corresponding to the failed service chain, and deleting the failed network resource from the network resource pool to update the network resource pool;
and generating a target mapping scheme for the network service according to the network resource pool and deploying a service chain according to the target mapping scheme.
Optionally, the communication network includes a virtual function network and an underlying network;
the virtual function network comprises a plurality of virtual network function nodes, and the virtual network function nodes are configured to be connected according to a certain logic sequence to form a virtual service chain corresponding to the network service;
the underlying network comprises a plurality of underlying network nodes, and the underlying network nodes are used for instantiating the virtual network function nodes and distributing computing resources, storage resources and bandwidth resources for the virtual network function nodes.
Optionally, the obtaining network resources of a communication network providing communication services for the network service to generate a network resource pool includes:
generating a virtual network resource pool according to the virtual network function node;
generating a bottom network resource pool according to the bottom network nodes;
wherein, according to the bottom network node generates a bottom network resource pool, including:
generating a node set according to the underlying network nodes;
generating a link set according to network links among the underlying network nodes;
generating a set of computing resources from the computing resources of the plurality of underlay network nodes;
generating a storage resource set according to the storage resources of the plurality of underlying network nodes;
generating a bandwidth resource set according to the bandwidth resources of the plurality of underlying network nodes;
generating the underlying network resource pool according to the node set, the link set, the computing resource set, the storage resource set and the bandwidth resource set;
the network resource pool comprises the virtual network resource pool and the underlying network resource pool.
Optionally, the determining a failed network resource corresponding to the failed service chain, and deleting the failed network resource from the network resource pool to update the network resource pool includes:
determining a fault type of the faulty service chain;
in response to the faulty service chain being a virtual network function fault, deleting a faulty virtual network function node from the virtual network resource pool;
in response to the failure service chain being a forwarding network node failure, deleting a failed network node from the node set, and respectively deleting computing resources, storage resources and bandwidth resources borne by the failed network node from the computing resource set, the storage resource set and the bandwidth resource set;
in response to the failed service chain being a network link failure, the failed link is removed from the set of links.
Optionally, the generating a target mapping scheme for the network service according to the network resource pool and deploying a service chain according to the target mapping scheme includes:
according to the service request of the network service, acquiring the virtual network function node required by the network service from the virtual network resource pool to generate a virtual service chain;
acquiring a plurality of bottom layer network nodes in the bottom layer network resource pool according to the virtual service chain to respectively generate a plurality of bottom layer service chains, calculating the satisfaction degrees of the plurality of bottom layer service chains, and screening and determining a target service chain as the target mapping scheme according to the satisfaction degrees;
and calling a network resource deployment service chain in the underlying network resource pool according to the target service chain.
Optionally, the obtaining, according to the virtual service chain, a plurality of the underlying network nodes in the underlying network resource pool to generate a plurality of underlying service chains respectively, calculating the satisfaction degrees of the plurality of underlying service chains, and determining, according to the satisfaction degree screening, a target service chain as the target mapping scheme includes:
searching a target mapping scheme in the underlying network resource pool according to the logical sequence structure of the virtual service chain and the resource requirements of each virtual network function node:
step 1: obtaining the service quality requirement information of the network service, and determining a time delay threshold t according to the service quality requirement informationbAnd a reliability threshold rbSetting a search time threshold tmaxSetting and initializing a scheme search time t as 0;
step 2: randomly generating two service chains S according to the underlying network resource pool1And S2Respectively determine service chains S1And S2Time delay t of1、t2And reliability r1、r2
And step 3: if t1≤tb、r1≥rbAnd t is2≤tb、r2≥rbIf not, returning to execute the step 1;
and 4, step 4: respectively calculating service chain S according to time delay and reliability1And S2Quality of service satisfaction sat1、sat2
And 5: comparison service chain S1And S2Quality of service satisfaction sat1And sat2The service chain with high service quality satisfaction degree is recorded as a first mapping scheme SC, and the corresponding service quality satisfaction degree is recorded as a first satisfaction degree satSCMarking the service chain with small service quality satisfaction degree as a second mapping scheme SC', and marking the corresponding service quality satisfaction degree as a second satisfaction degree satSC′;
Step 6: deleting the underlying network resources related to the first mapping scheme SC and the second mapping scheme SC' from the underlying network resource pool to update the underlying network resource pool;
and 7: randomly generating a service chain S according to the underlying network resource pool3Determining a service chain S3Time delay t of3And reliability r3If t is3≤tb、r3≥rbIf not, the next step is executed, otherwise, the step is executed repeatedly;
and 8: calculating service chain S according to time delay and reliability3Quality of service satisfaction sat3
And step 9: comparison sat3And satSC、satSCThe size of the three is that the bottom network resources occupied by the service chain corresponding to the minimum value in the three are released to the bottom network resource pool, the first mapping scheme SC is updated to the service chain corresponding to the maximum value in the three, and the first satisfaction sat is obtainedSCUpdating to the maximum value of the three, updating the second mapping scheme SC' to the service chain corresponding to the second maximum value of the three, and updating the second satisfaction satSC' update to the second largest value of the three;
step 10: deleting the underlying network resources related to the first mapping scheme SC and the second mapping scheme SC' from the underlying network resource pool to update the underlying network resource pool;
step 11: if the scheme search time t is less than or equal to tmaxIf not, stopping searching, using the first mapping scheme SC as the target mapping scheme and the second mapping scheme SC' as the alternative mapping scheme.
Optionally, calculating the service quality satisfaction of the service chain according to the delay and the reliability includes:
for service chain SiWith a corresponding time delay of tiReliability of riThen the service chain SiQuality of service satisfaction satiComprises the following steps:
Figure BDA0002956743290000041
optionally, the method further includes:
and storing the alternative mapping scheme, and directly redeploying the service chain according to the alternative mapping scheme if the service chain fault occurs again after the service chain is deployed according to the target mapping scheme.
One or more embodiments of the present specification also provide a service chain remapping electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the method when executing the program as follows:
determining network service corresponding to the fault service chain;
acquiring network resources of a communication network providing communication services for the network service to generate a network resource pool;
determining a failed network resource corresponding to the failed service chain, and deleting the failed network resource from the network resource pool to update the network resource pool;
and generating a target mapping scheme for the network service according to the network resource pool and deploying a service chain according to the target mapping scheme.
One or more embodiments of the present specification also provide a non-transitory computer-readable storage medium storing computer instructions for causing the computer to perform the method of:
determining network service corresponding to the fault service chain;
acquiring network resources of a communication network providing communication services for the network service to generate a network resource pool;
determining a failed network resource corresponding to the failed service chain, and deleting the failed network resource from the network resource pool to update the network resource pool;
and generating a target mapping scheme for the network service according to the network resource pool and deploying a service chain according to the target mapping scheme.
As can be seen from the foregoing, in the remapping method, the electronic device, and the storage medium provided in one or more embodiments of the present disclosure, the delay budget and the reliability of the network service are used as important reference parameters, an available remapping scheme that satisfies the network service parameters is continuously searched according to the network resources integrated in the early stage, a service chain performance evaluation parameter, which is the service quality satisfaction degree, is provided, a service chain remapping scheme is continuously searched and updated within a time defined by a remapping time threshold, a service chain remapping scheme with the maximum service quality satisfaction degree is obtained and deployed in the network, the second largest scheme is used as a backup scheme to prevent a secondary failure of the service chain, and the two schemes share the same set of vNF resources to save resource consumption. The method comprises the steps of classifying service chain fault types, updating resources according to fault conditions, and effectively dealing with different service chain faults; according to different requirements of different services on two aspects of time delay and reliability, dedicated customized high-quality service is provided for the services, and the service has extremely high adaptability to different types of services; the service chain deployment scheme and the backup scheme can be provided at the same time, and share the vNF resources, so that the secondary failure of the service chain can be effectively prevented, and the resource consumption can be saved; the determined remapping results are effective to mitigate service quality degradation caused by the failure.
Drawings
In order to more clearly illustrate one or more embodiments or prior art solutions of the present specification, the drawings that are needed in the description of the embodiments or prior art will be briefly described below, and it is obvious that the drawings in the following description are only one or more embodiments of the present specification, and that other drawings may be obtained by those skilled in the art without inventive effort from these drawings.
Fig. 1 is a schematic diagram of a service chaining and mapping method according to one or more embodiments of the present disclosure;
fig. 2 is a schematic diagram of a virtual service chain in a service chain mapping method according to one or more embodiments of the present disclosure;
fig. 3 is a schematic diagram of a lower-layer network in a service chaining mapping method according to one or more embodiments of the present disclosure;
fig. 4 is a schematic diagram illustrating a method for generating a target mapping scheme to redeploy a service chain in a service chain mapping method according to one or more embodiments of the present disclosure;
FIG. 5-a is an underlying network schematic diagram illustrating the presence of a service chain failure in one or more embodiments of the specification;
FIG. 5-b is a schematic diagram illustrating an updated underlying network topology in one or more embodiments of the disclosure;
fig. 6 is a schematic diagram of an electronic device for service chaining and mapping according to one or more embodiments of the present disclosure.
Detailed Description
For the purpose of promoting a better understanding of the objects, aspects and advantages of the present disclosure, reference is made to the following detailed description taken in conjunction with the accompanying drawings.
It is to be noted that unless otherwise defined, technical or scientific terms used in one or more embodiments of the present specification should have the ordinary meaning as understood by those of ordinary skill in the art to which this disclosure belongs. The use of "first," "second," and similar terms in one or more embodiments of the specification is not intended to indicate any order, quantity, or importance, but rather is used to distinguish one element from another. The word "comprising" or "comprises", and the like, means that the element or item listed before the word covers the element or item listed after the word and its equivalents, but does not exclude other elements or items. The terms "connected" or "coupled" and the like are not restricted to physical or mechanical connections, but may include electrical connections, whether direct or indirect. "upper", "lower", "left", "right", and the like are used merely to indicate relative positional relationships, and when the absolute position of the object being described is changed, the relative positional relationships may also be changed accordingly.
In the past decade, the innovation of internet technology and the generation of massive terminals have been mutually promoted and developed together, and the emerging application of diversified functions brings great convenience to the life of people. Meanwhile, the generation of a large number of emerging applications promotes the increase in the demand of users for network services, resulting in a proliferation of network traffic. In addition, different applications have different Quality of Service (QoS) requirements, resulting in a high diversity of network traffic QoS requirements. Thus, network Service Providers (SPs) face tremendous operational pressures and challenges. The Network Function Virtualization (NFV) technology enables a Network architecture and a resource allocation manner to be more flexible and controllable, and can effectively alleviate the operation pressure to a certain extent. The NFV decouples the network function from the hardware device, and decomposes the network function into various atomic network functions (e.g., firewall, load balancer, etc.) to be run on the server of the open architecture in a virtualized manner, thereby greatly improving the flexibility of network deployment. When a user sends a Network Service request, SPs may guide Network application traffic to implement Network services through different virtual Network Functions (vNFs) according to a certain sequence according to a requirement of a Network application, and this customized Service form is referred to as a Service Chain (SC).
The generation of service chains enables network service providers to provide high quality end-to-end customized services to users, ensuring that meeting QoS requirements of the service is the ultimate goal of deploying service chains. However, when a service chain fails, the service delay and the packet loss rate are inevitably increased, which adversely affects the service quality of the service. Most of the existing service chain remapping methods mainly save resources, and the communication service quality of the network service cannot be considered for quickly replying the network service, so that the communication service quality of the network service after remapping is reduced.
In view of the above problems, the present application provides a remapping method, an electronic device, and a storage medium, which continuously search and compare remapping schemes with high service quality satisfaction determined by taking the delay budget and reliability of network services as important reference parameters.
Hereinafter, the technical means of the present disclosure will be described in further detail with reference to specific examples.
In one aspect, the present specification embodiments provide a service chain remapping method.
As shown in fig. 1, one or more embodiments of the present specification provide a service chain remapping method, including:
s1: determining network service corresponding to the fault service chain;
s2: acquiring network resources of a communication network providing communication services for the network service to generate a network resource pool;
s3: determining a failed network resource corresponding to the failed service chain, and deleting the failed network resource from the network resource pool to update the network resource pool;
s4: and generating a target mapping scheme for the network service according to the network resource pool and deploying a service chain according to the target mapping scheme.
The service chain remapping method takes the time delay budget and the reliability of network service as important reference parameters, continuously searches an available remapping scheme meeting the network service parameters according to the network resources integrated in the early stage, provides a service chain performance evaluation parameter of service quality satisfaction, continuously searches and updates the service chain remapping scheme within the time limited by a remapping time threshold value, and obtains the service chain remapping scheme with the maximum service quality satisfaction, and deploys the service chain remapping scheme into a network.
In a service chain remapping method provided in one or more embodiments of the present description, the communication network includes a virtual function network and an underlying network;
the virtual function network comprises a plurality of virtual network function nodes, and the virtual network function nodes are configured to be connected according to a certain logic sequence to form a virtual service chain corresponding to the network service;
the underlying network comprises a plurality of underlying network nodes, and the underlying network nodes are used for instantiating the virtual network function nodes and distributing computing resources, storage resources and bandwidth resources for the virtual network function nodes.
As shown in fig. 2, a virtual service chain diagram formed by a plurality of virtual network function nodes related to the network service is provided, where the virtual service chain includes several virtual network function nodes vNF 1-vNF 5, and those skilled in the art can understand that the several virtual network function nodes vNF 1-vNF 5 shown in fig. 2 are only partial nodes in the virtual function network, the virtual function network may further include more other virtual network function nodes, and the logical connection relationships shown by the several virtual network function nodes vNF 1-vNF 5 are exemplary representations, and the plurality of virtual network function nodes may have different logical connection relationships according to different requirements of specific network services.
As shown in fig. 3, a schematic diagram of a correspondence between the virtual function network and the underlying network is shown, in which only an instantiated correspondence between a part of virtual network function nodes and a part of underlying network nodes is shown. The partial underlay network shown in fig. 3 includes 5 underlay network nodes respectively corresponding to several virtual network function nodes vNF 1-vNF 5, and is configured to instantiate several virtual network function nodes vNF 1-vNF 5, and allocate computing resources, storage resources, and bandwidth resources to several virtual network function nodes vNF 1-vNF 5.
In a service chain remapping method provided in one or more embodiments of the present specification, the obtaining network resources of a communication network providing communication services for the network traffic to generate a network resource pool includes:
generating a virtual network resource pool according to the virtual network function nodes, and further comprising all the virtual network function nodes vNFiAdding the virtual network resource pool vNF into a virtual network resource pool;
generating a bottom network resource pool according to the bottom network nodes;
wherein, according to the bottom network node generates a bottom network resource pool, including:
generating a node set according to the underlying network nodes, and further comprising generating all the underlying network nodes niAdding the node into a node set N;
generating a link set according to the network links among the underlying network nodes, and further comprising all network links li-j(for network node n)iAnd a network node njLinks between) are added to the link set L;
generating a set of computing resources from the computing resources of a plurality of the underlay network nodes, further comprising grouping each network node niC of a computing resourceiJoining to a set of computing resources CnPerforming the following steps;
generating a set of storage resources from the storage resources of a plurality of the underlay network nodes, further comprising grouping each network node niStorage resource m ofiJoining to a storage resource set MnPerforming the following steps;
and generating a set of bandwidth resources from the bandwidth resources of a plurality of the underlying network nodes, further comprising grouping each network node niBandwidth resource b oniJoining to a set of bandwidth resources BnPerforming the following steps;
according to the node set N, the link set L and the computing resource set CnThe set of storage resources MnAnd the bandwidth resource set BnGenerating the underlying network resource pool P;
the network resource pool comprises the virtual network resource pool vNF and the underlying network resource pool P.
In a service chain remapping method provided in one or more embodiments of this specification, the determining a failed network resource corresponding to the failed service chain, deleting the failed network resource from the network resource pool to update the network resource pool S3, includes:
determining a fault type of the faulty service chain;
responding the fault service chain as a virtual network function fault, and sending a fault virtual network function node vNFfDeleting from the virtual network resource pool vNF;
responding to the failure service chain as the failure of the forwarding network node, and connecting the failed network node nfDeleting the computing resources c borne by the failed network node from the node set N respectivelyfStorage resource mfAnd bandwidth resource bfFrom the aboveComputing resource set CnThe set of storage resources MnAnd the bandwidth resource set BnDeleting;
responding to the fault service chain being network link fault, and sending the fault link IfIs removed from the link set L.
The service chain remapping method classifies service chain fault types, deletes corresponding fault resources from network resources to update the network resources aiming at different types of service chain fault conditions, can effectively deal with different service chain faults, and provides fault-free network resources for the execution of a subsequent search remapping scheme.
As shown in fig. 4, in a service chain remapping method provided in one or more embodiments of the present specification, the generating a target mapping scheme for the network traffic according to the network resource pool and deploying a service chain according to the target mapping scheme includes:
s401: according to the service request of the network service, acquiring the virtual network function node required by the network service from the virtual network resource pool to generate a virtual service chain;
s402: acquiring a plurality of bottom layer network nodes in the bottom layer network resource pool according to the virtual service chain to respectively generate a plurality of bottom layer service chains, calculating the satisfaction degrees of the plurality of bottom layer service chains, and screening and determining a target service chain as the target mapping scheme according to the satisfaction degrees;
s403: and calling a network resource deployment service chain in the underlying network resource pool according to the target service chain.
Further, the obtaining, according to the virtual service chain, a plurality of the underlying network nodes in the underlying network resource pool to generate a plurality of underlying service chains, respectively, calculating the satisfaction degrees of the plurality of underlying service chains, and determining a target service chain as the target mapping scheme according to the satisfaction degree screening S402 includes:
searching a target mapping scheme in the underlying network resource pool according to the logical sequence structure of the virtual service chain and the resource requirements of each virtual network function node:
step 1: obtaining the service quality requirement information of the network service, and determining a time delay threshold t according to the service quality requirement informationbAnd a reliability threshold rbSetting a search time threshold tmaxSetting and initializing a scheme search time t as 0;
step 2: randomly generating two service chains S according to the underlying network resource pool1And S2Respectively determine service chains S1And S2Time delay t of1、t2And reliability r1、r2
And step 3: if t1≤tb、r1≥rbAnd t is2≤tb、r2≥rbIf not, returning to execute the step 1;
and 4, step 4: respectively calculating service chain S according to time delay and reliability1And S2Quality of service satisfaction sat1、sat2
For service chain SiWith a corresponding time delay of tiReliability of riThen the service chain SiQuality of service satisfaction satiComprises the following steps:
Figure BDA0002956743290000101
and 5: comparison service chain S1And S2Quality of service satisfaction sat1And sat2The service chain with high service quality satisfaction degree is recorded as a first mapping scheme SC, and the corresponding service quality satisfaction degree is recorded as a first satisfaction degree satSCMarking the service chain with small service quality satisfaction degree as a second mapping scheme SC', and marking the corresponding service quality satisfaction degree as a second satisfaction degree satSC′;
Step 6: deleting the underlying network resources related to the first mapping scheme SC and the second mapping scheme SC' from the underlying network resource pool to update the underlying network resource pool;
and 7: randomly generating a service chain S according to the underlying network resource pool3Determining a service chain S3Time delay t of3And reliability r3If t is3≤tb、r3≥rbIf not, the next step is executed, otherwise, the step is executed repeatedly;
and 8: calculating service chain S according to time delay and reliability3Quality of service satisfaction sat3
And step 9: comparison sat3And satSC、satSCThe size of the three is that the bottom network resources occupied by the service chain corresponding to the minimum value in the three are released to the bottom network resource pool, the first mapping scheme SC is updated to the service chain corresponding to the maximum value in the three, and the first satisfaction sat is obtainedSCUpdating to the maximum value of the three, updating the second mapping scheme SC' to the service chain corresponding to the second maximum value of the three, and updating the second satisfaction satSC' update to the second largest value of the three;
step 10: deleting the underlying network resources related to the first mapping scheme SC and the second mapping scheme SC' from the underlying network resource pool to update the underlying network resource pool;
step 11: if the scheme search time t is less than or equal to tmaxIf not, stopping searching, using the first mapping scheme SC as the target mapping scheme and the second mapping scheme SC' as the alternative mapping scheme.
In the service chain remapping method, the network resource deployment service chain in the underlying network resource pool is called according to the target service chain, the service chain deployment is further carried out according to a first mapping scheme SC, a second mapping scheme SC' is used as a backup scheme to prevent secondary failure of the service chain, and the service chain deployment service chain share the vNF resource. When the failure occurs again, the second mapping scheme SC' can be directly selected for service chain redeployment.
The service chain remapping method provides exclusive customized high-quality service for different services according to different requirements of the different services in two aspects of time delay and reliability, and has extremely high adaptability to different types of services; the service chain deployment scheme and the backup scheme can be provided at the same time, and the service chain deployment scheme and the backup scheme share the vNF resources, so that secondary faults of the service chain can be effectively prevented, and resource consumption can be saved.
The following describes, with reference to the underlying network diagrams shown in fig. 5-a and 5-b, generating a target mapping scheme for the network traffic according to the network resource pool and deploying a service chain according to the target mapping scheme.
As shown in fig. 5-a, for the underlying network diagram with service chain failure, service chain failure information of the service a is received, and a link failure occurs in the service chain deployed for the first time, where the number of the failed link is l2-12. First, link l2-12And removing the link from the underlying link set L, and updating the underlying network topology, wherein the updated underlying network topology is as shown in fig. 5-b. Then generating a virtual service chain vNFs-SC for the business AAThe virtual service chain vNFs-SCACan be as shown in fig. 1, and calculates its resource requirements:
vNF1the required computing resources are cv1Storage resource is mv1Bandwidth resource of bv1=BA
vNF2The required computing resources are cv2Storage resource is mv1Bandwidth resource of bv2=BA
vNF3The required computing resources are cv3Storage resource is mv3Bandwidth resource of bv3=BA
vNF4The required computing resources are cv4Storage resource is mv4Bandwidth resource of bv4=BA
vNF5The required computing resources are cv5Storage resource is m5Bandwidth resource of bv5=BA
Reading QoS requirement of service A to obtain its time delay budget tbAAnd the reliability requirement rbA(ii) a Setting the maximum search time tmaxAnd searching time t and initializing the searching time t to be 0; according to virtual service chain vNFs-SCAThe logic of (2) and all the computational resources, storage resources and bandwidth resources required by the vNF contained in the logic are searched in an underlying network resource pool, and two service chains S are randomly generated1AAnd S2A(ii) a Calculating respective S1AAnd S2ATime delay t of1A、t2AAnd S1AAnd S2AReliability of r1A、r2AAnd judging whether it satisfies t1A≤tbA、r1A≥rbA,t2A≤tbA、r2A≥rbA(ii) a If the condition is not met, repeating the previous two steps; if the conditions are satisfied, continuing to calculate S respectively1AAnd S2AQoS satisfaction degree sat1A、sat2AWherein:
Figure BDA0002956743290000121
and compare sat1A、sat2AThe size of (d); if sat1A>sat2AThen S will be1AUpdate to deployment scenario SCAAnd then sat1AValue assignment to satAWill S2AUpdate to backup scheme SC'AAnd then sat2AValue assignment to sat'A(ii) a If sat1A<sat2AThen S will be2AUpdate to deployment scenario SCAAnd then sat2AValue assignment to satAWill S1AUpdate to backup scheme SC'AAnd then sat1AValue assignment to sat'A(ii) a Will SCAAnd SC'AOccupied underlying network resources are removed from the underlying network resource pool, and available resources in the underlying network resource pool are updated; randomly generating a service chain S3A(ii) a Calculating its time delay t3AReliability r3AJudging whether t is satisfied simultaneously3A≤tbA、r3A≥rbAIf yes, executing the next step, otherwise, repeating the step; the QoS satisfaction of S3A is calculated,
Figure BDA0002956743290000122
Figure BDA0002956743290000123
comparison satA、satA' and sat3AThe size of (2). The service chain scheme with the maximum sat value is updated to the deployment scheme SC, and the corresponding sat value is assigned to the satAUpdating the service chain scheme with the second largest sat value into the backup scheme SC', and assigning the corresponding sat value to the satA'; releasing the underlying network resources occupied by the service chain scheme with the minimum sat value in the comparison of the previous step into an underlying network resource pool, and updating the SCAAnd SCARemoving occupied underlying network resources from the underlying network resource pool, and updating available resources in the underlying network resource pool; judging whether the scheme searching time limit t is less than or equal to tmaxWhether the result is true or not; if yes, continuing to randomly generate the service chain S3AContinuing to update SC according to the above stepsAAnd SCA'; otherwise, according to the deployment scenario SCADeploying service chain and connecting SCA' as a backup scheme to prevent service chain secondary failures, both sharing vNF resources.
It is to be appreciated that the method can be performed by any apparatus, device, platform, cluster of devices having computing and processing capabilities.
It should be noted that the method of one or more embodiments of the present disclosure may be performed by a single device, such as a computer or server. The method of the embodiment can also be applied to a distributed scene and completed by the mutual cooperation of a plurality of devices. In such a distributed scenario, one of the devices may perform only one or more steps of the method of one or more embodiments of the present disclosure, and the devices may interact with each other to complete the method.
It should be noted that the above description describes certain embodiments of the present disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.
In another aspect, the present specification embodiments provide a service chain remapping electronic device.
Fig. 6 is a schematic diagram illustrating a more specific hardware structure of an electronic device according to this embodiment, where the electronic device may include: a processor 1010, a memory 1020, an input/output interface 1030, a communication interface 1040, and a bus 1050. Wherein the processor 1010, memory 1020, input/output interface 1030, and communication interface 1040 are communicatively coupled to each other within the device via bus 1050.
The processor 1010 may be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an Application Specific Integrated Circuit (ASIC), or one or more Integrated circuits, and is configured to execute related programs to implement the technical solution of the service chain remapping method provided in the embodiment of the present disclosure.
The Memory 1020 may be implemented in the form of a ROM (Read Only Memory), a RAM (Random Access Memory), a static storage device, a dynamic storage device, or the like. The memory 1020 may store an operating system and other application programs, and when the technical solution provided by the embodiments of the present specification is implemented by software or firmware, the relevant program codes are stored in the memory 1020 and called to be executed by the processor 1010.
The input/output interface 1030 is used for connecting an input/output module to input and output information. The i/o module may be configured as a component in a device (not shown) or may be external to the device to provide a corresponding function. The input devices may include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output devices may include a display, a speaker, a vibrator, an indicator light, etc.
The communication interface 1040 is used for connecting a communication module (not shown in the drawings) to implement communication interaction between the present apparatus and other apparatuses. The communication module can realize communication in a wired mode (such as USB, network cable and the like) and also can realize communication in a wireless mode (such as mobile network, WIFI, Bluetooth and the like).
Bus 1050 includes a path that transfers information between various components of the device, such as processor 1010, memory 1020, input/output interface 1030, and communication interface 1040.
It should be noted that although the above-mentioned device only shows the processor 1010, the memory 1020, the input/output interface 1030, the communication interface 1040 and the bus 1050, in a specific implementation, the device may also include other components necessary for normal operation. Furthermore, it can be understood by those skilled in the art that the above-mentioned apparatus may also include only the components necessary for implementing the technical solution of the service chain remapping method described in the embodiments of the present specification, and does not necessarily include all the components shown in the drawings.
The electronic device of the foregoing embodiment is used to implement the corresponding method in the foregoing embodiment, and has the beneficial effects of the corresponding method embodiment, which are not described herein again.
In another aspect, the present specification embodiments provide a non-transitory computer-readable storage medium storing computer instructions for causing the computer to perform the service chain remapping method.
Computer-readable media of the present embodiments, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device.
Those of ordinary skill in the art will understand that: the discussion of any embodiment above is meant to be exemplary only, and is not intended to intimate that the scope of the disclosure, including the claims, is limited to these examples; within the spirit of the present disclosure, features from the above embodiments or from different embodiments may also be combined, steps may be implemented in any order, and there are many other variations of different aspects of one or more embodiments of the present description as described above, which are not provided in detail for the sake of brevity.
In addition, well-known power/ground connections to Integrated Circuit (IC) chips and other components may or may not be shown in the provided figures, for simplicity of illustration and discussion, and so as not to obscure one or more embodiments of the disclosure. Furthermore, devices may be shown in block diagram form in order to avoid obscuring the understanding of one or more embodiments of the present description, and this also takes into account the fact that specifics with respect to implementation of such block diagram devices are highly dependent upon the platform within which the one or more embodiments of the present description are to be implemented (i.e., specifics should be well within purview of one skilled in the art). Where specific details (e.g., circuits) are set forth in order to describe example embodiments of the disclosure, it should be apparent to one skilled in the art that one or more embodiments of the disclosure can be practiced without, or with variation of, these specific details. Accordingly, the description is to be regarded as illustrative instead of restrictive.
While the present disclosure has been described in conjunction with specific embodiments thereof, many alternatives, modifications, and variations of these embodiments will be apparent to those of ordinary skill in the art in light of the foregoing description. For example, other memory architectures (e.g., dynamic ram (dram)) may use the discussed embodiments.
It is intended that the one or more embodiments of the present specification embrace all such alternatives, modifications and variations as fall within the broad scope of the appended claims. Therefore, any omissions, modifications, substitutions, improvements, and the like that may be made without departing from the spirit and principles of one or more embodiments of the present disclosure are intended to be included within the scope of the present disclosure.

Claims (10)

1. A method for service chain remapping, comprising:
determining network service corresponding to the fault service chain;
acquiring network resources of a communication network providing communication services for the network service to generate a network resource pool;
determining a failed network resource corresponding to the failed service chain, and deleting the failed network resource from the network resource pool to update the network resource pool;
and generating a target mapping scheme for the network service according to the network resource pool and deploying a service chain according to the target mapping scheme.
2. The method of claim 1, wherein the communication network comprises a virtual function network and an underlying network;
the virtual function network comprises a plurality of virtual network function nodes, and the virtual network function nodes are configured to be connected according to a certain logic sequence to form a virtual service chain corresponding to the network service;
the underlying network comprises a plurality of underlying network nodes, and the underlying network nodes are used for instantiating the virtual network function nodes and distributing computing resources, storage resources and bandwidth resources for the virtual network function nodes.
3. The method of claim 2, wherein obtaining network resources of a communication network providing communication services for the network traffic to generate a network resource pool comprises:
generating a virtual network resource pool according to the virtual network function node;
generating a bottom network resource pool according to the bottom network nodes;
wherein, according to the bottom network node generates a bottom network resource pool, including:
generating a node set according to the underlying network nodes;
generating a link set according to network links among the underlying network nodes;
generating a set of computing resources from the computing resources of the plurality of underlay network nodes;
generating a storage resource set according to the storage resources of the plurality of underlying network nodes;
generating a bandwidth resource set according to the bandwidth resources of the plurality of underlying network nodes;
generating the underlying network resource pool according to the node set, the link set, the computing resource set, the storage resource set and the bandwidth resource set;
the network resource pool comprises the virtual network resource pool and the underlying network resource pool.
4. The method of claim 3, wherein determining the failed network resource corresponding to the failed service chain, deleting the failed network resource from the network resource pool to update the network resource pool comprises:
determining a fault type of the faulty service chain;
in response to the faulty service chain being a virtual network function fault, deleting a faulty virtual network function node from the virtual network resource pool;
in response to the failure service chain being a forwarding network node failure, deleting a failed network node from the node set, and respectively deleting computing resources, storage resources and bandwidth resources borne by the failed network node from the computing resource set, the storage resource set and the bandwidth resource set;
in response to the failed service chain being a network link failure, the failed link is removed from the set of links.
5. The method of claim 3, wherein generating a target mapping scheme for the network traffic based on the network resource pool and deploying service chains according to the target mapping scheme comprises:
according to the service request of the network service, acquiring the virtual network function node required by the network service from the virtual network resource pool to generate a virtual service chain;
acquiring a plurality of bottom layer network nodes in the bottom layer network resource pool according to the virtual service chain to respectively generate a plurality of bottom layer service chains, calculating the satisfaction degrees of the plurality of bottom layer service chains, and screening and determining a target service chain as the target mapping scheme according to the satisfaction degrees;
and calling a network resource deployment service chain in the underlying network resource pool according to the target service chain.
6. The method according to claim 5, wherein the obtaining a plurality of underlying network nodes in the underlying network resource pool according to the virtual service chain to generate a plurality of underlying service chains respectively, calculating the satisfaction degrees of the plurality of underlying service chains, and determining a target service chain as the target mapping scheme according to the satisfaction degree screening, comprises:
searching a target mapping scheme in the underlying network resource pool according to the logical sequence structure of the virtual service chain and the resource requirements of each virtual network function node:
step 1: obtaining the service quality requirement information of the network service, and determining a time delay threshold t according to the service quality requirement informationbAnd a reliability threshold rbSetting a search time threshold tmaxSetting and initializing a scheme search time t as 0;
step 2: randomly generating two service chains S according to the underlying network resource pool1And S2Is divided intoIdentify service chain S1And S2Time delay t of1、t2And reliability r1、r2
And step 3: if t1≤tb、r1≥rbAnd t is2≤tb、r2≥rbIf not, returning to execute the step 1;
and 4, step 4: respectively calculating service chain S according to time delay and reliability1And S2Quality of service satisfaction sat1、sat2
And 5: comparison service chain S1And S2Quality of service satisfaction sat1And sat2The service chain with high service quality satisfaction degree is recorded as a first mapping scheme SC, and the corresponding service quality satisfaction degree is recorded as a first satisfaction degree satSCMarking the service chain with small service quality satisfaction degree as a second mapping scheme SC', and marking the corresponding service quality satisfaction degree as a second satisfaction degree satSC′;
Step 6: deleting the underlying network resources related to the first mapping scheme SC and the second mapping scheme SC' from the underlying network resource pool to update the underlying network resource pool;
and 7: randomly generating a service chain S according to the underlying network resource pool3Determining a service chain S3Time delay t of3And reliability r3If t is3≤tb、r3≥rbIf not, the next step is executed, otherwise, the step is executed repeatedly;
and 8: calculating service chain S according to time delay and reliability3Quality of service satisfaction sat3
And step 9: comparison sat3And satSC、satSCThe size of the three is that the bottom network resources occupied by the service chain corresponding to the minimum value in the three are released to the bottom network resource pool, the first mapping scheme SC is updated to the service chain corresponding to the maximum value in the three, and the first satisfaction sat is obtainedSCUpdating to the maximum value of the threeThe second mapping scheme SC' is updated to the service chain corresponding to the second maximum value of the three, and the second satisfaction sat is obtainedSC' update to the second largest value of the three;
step 10: deleting the underlying network resources related to the first mapping scheme SC and the second mapping scheme SC' from the underlying network resource pool to update the underlying network resource pool;
step 11: if the scheme search time t is less than or equal to tmaxIf not, stopping searching, using the first mapping scheme SC as the target mapping scheme and the second mapping scheme SC' as the alternative mapping scheme.
7. The method of claim 6, wherein calculating the quality of service satisfaction of the service chain based on latency and reliability comprises:
for service chain SiWith a corresponding time delay of tiReliability of riThen the service chain SiQuality of service satisfaction satiComprises the following steps:
Figure FDA0002956743280000031
8. the method of claim 6, further comprising:
and storing the alternative mapping scheme, and directly redeploying the service chain according to the alternative mapping scheme if the service chain fault occurs again after the service chain is deployed according to the target mapping scheme.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the method according to any of claims 1 to 8 when executing the program.
10. A non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the method of any one of claims 1 to 8.
CN202110226806.2A 2021-03-01 2021-03-01 Service chain remapping method, electronic equipment and storage medium Active CN113067720B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110226806.2A CN113067720B (en) 2021-03-01 2021-03-01 Service chain remapping method, electronic equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110226806.2A CN113067720B (en) 2021-03-01 2021-03-01 Service chain remapping method, electronic equipment and storage medium

Publications (2)

Publication Number Publication Date
CN113067720A true CN113067720A (en) 2021-07-02
CN113067720B CN113067720B (en) 2022-06-03

Family

ID=76559383

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110226806.2A Active CN113067720B (en) 2021-03-01 2021-03-01 Service chain remapping method, electronic equipment and storage medium

Country Status (1)

Country Link
CN (1) CN113067720B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180349202A1 (en) * 2017-05-30 2018-12-06 Hewlett Packard Enterprise Development Lp Virtual Network Function Resource Allocation
CN110311862A (en) * 2019-06-14 2019-10-08 北京邮电大学 A kind of service chaining mapping method and device
CN110505082A (en) * 2019-07-26 2019-11-26 国家电网有限公司 A kind of NFV service chaining mapping method towards cost and QoS

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20180349202A1 (en) * 2017-05-30 2018-12-06 Hewlett Packard Enterprise Development Lp Virtual Network Function Resource Allocation
CN110311862A (en) * 2019-06-14 2019-10-08 北京邮电大学 A kind of service chaining mapping method and device
CN110505082A (en) * 2019-07-26 2019-11-26 国家电网有限公司 A kind of NFV service chaining mapping method towards cost and QoS

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
刘艺等: "一种区分等级的可生存服务功能链映射方法", 《计算机研究与发展》 *

Also Published As

Publication number Publication date
CN113067720B (en) 2022-06-03

Similar Documents

Publication Publication Date Title
US10051056B2 (en) Resource planning method, system, and apparatus for cluster computing architecture
US10601682B2 (en) Service availability management method, service availability management apparatus, and network function virtualization architecture thereof
KR102546521B1 (en) Apparatus and method for providing services in distributed edge cloud environment
CN110519406B (en) Virtual address allocation method and device, CTDB cluster and storage medium
KR20170073605A (en) Composite partition functions
CN109214421A (en) A kind of model training method, device and computer equipment
CN108804188A (en) Changing an interface skin method and device
CN106034138A (en) Remote service calling method and remote service calling device
CN105306507A (en) Disaster tolerance processing method and disaster tolerance processing device in distributed architecture
CN111324471A (en) Service adjusting method, device, equipment and storage medium
CN114841322A (en) Processing method and processing device of neural network computation graph
US10819618B1 (en) Network testing system
CN112202829A (en) Social robot scheduling system and scheduling method based on micro-service
CN110187992B (en) Fault analysis method and device
CN114970814A (en) Processing method and processing device of neural network computation graph
CN113553178A (en) Task processing method and device and electronic equipment
US11442763B2 (en) Virtual machine deployment system using configurable communication couplings
CN116933886B (en) Quantum computing execution method, quantum computing execution system, electronic equipment and storage medium
CN113067720B (en) Service chain remapping method, electronic equipment and storage medium
CN111147600B (en) Service execution method and terminal under cluster environment
US20130339800A1 (en) Failover estimation using contradiction
CN110704182A (en) Deep learning resource scheduling method and device and terminal equipment
CN114153732A (en) Fault scene testing method and device, electronic equipment and storage medium
CN113126884A (en) Data migration method and device, electronic equipment and computer storage medium
CN110798411A (en) Service calling method, traffic scheduling 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