CN114020455A - Arranging method and device of service functions and computer readable storage medium - Google Patents

Arranging method and device of service functions and computer readable storage medium Download PDF

Info

Publication number
CN114020455A
CN114020455A CN202111258328.XA CN202111258328A CN114020455A CN 114020455 A CN114020455 A CN 114020455A CN 202111258328 A CN202111258328 A CN 202111258328A CN 114020455 A CN114020455 A CN 114020455A
Authority
CN
China
Prior art keywords
service function
node
nodes
service
ith
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
CN202111258328.XA
Other languages
Chinese (zh)
Other versions
CN114020455B (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.)
China United Network Communications Group Co Ltd
Research Institute of China United Network Communications Corp Ltd
Original Assignee
China United Network Communications Group 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 China United Network Communications Group Co Ltd filed Critical China United Network Communications Group Co Ltd
Priority to CN202111258328.XA priority Critical patent/CN114020455B/en
Publication of CN114020455A publication Critical patent/CN114020455A/en
Application granted granted Critical
Publication of CN114020455B publication Critical patent/CN114020455B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements 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/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061—Partitioning or combining of resources
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements 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/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements 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/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5083—Techniques for rebalancing the load in a distributed system

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)
  • Computer And Data Communications (AREA)

Abstract

The application provides a method and a device for arranging service functions and a computer readable storage medium, relates to the field of network communication, and can reasonably configure nodes for providing the service functions, thereby effectively controlling service time delay and improving service effects. The method comprises the following steps: receiving a service request from user equipment, wherein the service request is used for requesting to deploy a service function chain, the service function chain is composed of M service functions in sequence, and M is a positive integer greater than 1; for a first service function in the M service functions, acquiring attribute information of the first service function of each node in N nodes capable of providing the first service function, and a distance between each node in the N nodes and user equipment; and selecting an optimal node from the N nodes as a deployment node of the first service function according to the attribute information of the first service function of each node in the N nodes and the distance between each node in the N nodes and the user equipment.

Description

Arranging method and device of service functions and computer readable storage medium
Technical Field
The present application relates to the field of network communication technologies, and in particular, to a method and an apparatus for arranging service functions, and a computer-readable storage medium.
Background
In the past, operators provided services for users by using a centralized resource pool, however, with the increase of enterprise users and the increase of network delay requirements of users, the problems of slow response speed and low processing efficiency of the centralized resource pool are also exposed. Therefore, in order to provide better service for users, operators can meet different service requirements of different users by establishing a distributed resource pool on the user side instead of a centralized resource pool.
In the case of a distributed resource pool, individual service functions in a service function chain may be taken care of by nodes (servers or virtual machines on servers) in different resource pools. Because the nodes in different resource pools are different and the service functions provided by different nodes are also different, in this case, it is important to select a suitable node to execute the corresponding service function, and if the node is selected unreasonably, the service effect of the service function chain may be poor or the service processing delay may be high.
Therefore, a method for selecting a suitable node for a service function in a service function chain is needed to ensure that the service function chain has a better service effect and a lower service processing delay.
Disclosure of Invention
The application provides a service function arranging method, a service function arranging device and a computer readable storage medium, which can reasonably select a deployment node of a service function so as to give consideration to the service effect and the service delay time of a service function chain.
In a first aspect, the present application provides a service function arrangement method, including: receiving a service request from user equipment, wherein the service request is used for requesting to deploy a service function chain, the service function chain is composed of M service functions in sequence, and M is a positive integer greater than 1; for a first service function in the M service functions, acquiring attribute information of the first service function of each node in N nodes capable of providing the first service function, and a distance between each node in the N nodes and user equipment; the attribute information of the first service function of a node comprises one or more of: the node comprises a resource availability ratio, stability information related to a first service function, or service function evaluation information related to the first service function, wherein the resource availability ratio is used for representing the ratio of idle resources which can be provided by the node to the whole resources, the stability information related to the first service function is used for indicating the probability of normal operation when the node provides the first service function, the service function evaluation information related to the first service function is used for indicating the evaluation of a user on the first service function provided by the node, and N is a positive integer; and selecting an optimal node from the N nodes as a deployment node of the first service function according to the attribute information of the first service function of each node in the N nodes and the distance between each node in the N nodes and the user equipment.
Based on the technical scheme provided by the application, after M service functions in the service function chain are determined, the attribute information of the first service function of N nodes capable of providing the first service function and the distance between each node in the N nodes and the user equipment are obtained. Wherein the attribute information includes: resource availability, stability information associated with the first service function, or service function rating information associated with the first service function. Based on the method, according to the attribute information and the distance information, multiple dimensions are considered, and the optimal node is selected from the N nodes to serve as the deployment node of the first service function, so that the service effect and the service processing time delay are considered.
Optionally, selecting an optimal node from the N nodes as a deployment node of the first service function according to the attribute information of the first service function of each node in the N nodes and the distance between each node in the N nodes and the user equipment, includes: determining a score related to the first service function of each node in the N nodes according to the attribute information of the first service function of each node in the N nodes and the distance between each node in the N nodes and the user equipment; and according to the scores of the nodes in the N nodes, which are related to the first service function, selecting the node with the highest score from the N nodes as the deployment node of the first service function.
In this way, the score of each node in the N nodes related to the first service function is determined according to the attribute information of the first service function of each node in the N nodes and the distance between each node in the N nodes and the user equipment. Through the grading, the quality of the first service function of each node and the distance between each node and the user equipment can be visually seen, and therefore the optimal node can be accurately selected from the N nodes.
Optionally, the resource availability includes: the availability ratio of bandwidth resources and the availability ratio of computing resources; the bandwidth resource availability is formulated by
Figure BDA0003324629140000021
Determining; wherein p isbRepresenting the bandwidth resource availability, b representing the bandwidth of the node configuration, bHas been usedIndicating the bandwidth currently used by the node; computing power resource availability, from formula
Figure BDA0003324629140000022
Determining; wherein p iswRepresenting computing power resource availability, w representing computing power of node configuration, wHas been usedRepresenting the computational power currently used by the node.
Optionally, the stability information associated with the first service function is represented by the formula pd＝dGo outdIs provided withdDeficiency of QiDetermining; wherein p isdRepresenting stability information, dGo outIndicating the non-failure rate of the egress router of the node, dIs provided withRepresenting the non-failure rate of a target device in the node for providing the first service function, dDeficiency of QiRepresenting a non-failure rate of a virtual machine in the target device for providing the first service function.
Optionally, the score of each node of the N nodes related to the first service function satisfies the following relationship: by the formula
Figure BDA0003324629140000031
Determining a score associated with a first service function for each of the N nodes; wherein the content of the first and second substances,
Figure BDA0003324629140000032
a score associated with the first service function is indicated for each of the N nodes,
Figure BDA0003324629140000033
indicating the distance between each of the N nodes and the user equipment,
Figure BDA0003324629140000034
indicating an evaluation value, m, associated with a first service function for each of the N nodes1The number of the first service function of M service functions in the service function chain is represented, N represents the number of N nodes capable of providing the first service function, and x, y and z are constants; the evaluation value of each node in the N nodes is calculated by formula
Figure BDA0003324629140000035
Determining; wherein p isvAnd d, e, f and g are constants, and d + e + f + g is 1.
Optionally, for an ith service function in the M service functions, obtaining attribute information of the ith service function of each node in P nodes capable of providing the ith service function, and a distance between each node in the P nodes and a deployment node of the i-1 service function, where i is a positive integer greater than 1; the attribute information of the ith service function of a node includes one or more of: the node comprises a resource availability ratio, stability information related to the ith service function, or service function evaluation information related to the ith service function, wherein the resource availability ratio is used for representing the ratio of idle resources which can be provided by the node to the whole resources, the stability information related to the ith service function is used for indicating the probability of normal operation when the node provides the ith service function, the service function evaluation information related to the ith service function is used for indicating the evaluation of a user on the ith service function provided by the node, and P is a positive integer; and selecting an optimal node from the P nodes as a deployment node of the ith service function according to the attribute information of the ith service function of each node in the P nodes and the distance between each node in the P nodes and the deployment node of the (i-1) th service function.
Based on the technical scheme provided by the application, after the deployment node of the first service function is determined, the attribute information of the ith service function of each node in the P nodes capable of providing the ith service function and the distance between each node in the P nodes and the deployment node of the (i-1) th service function are obtained. Wherein the attribute information includes: resource availability, stability information related to the ith service function, or service function evaluation information related to the ith service function. Based on the above, according to the attribute information and the distance information, multiple dimensions are considered, and an optimal node is selected from the P nodes as a deployment node of the ith service function, so that the service effect and the service processing delay are considered.
Optionally, selecting an optimal node from the P nodes as a deployment node of the ith service function according to attribute information of the ith service function of each node in the P nodes and a distance between each node in the P nodes and the deployment node of the ith-1 service function, where the method includes: determining the grade of each node in the P nodes related to the ith service function according to the attribute information of the ith service function of each node in the P nodes and the distance between each node in the P nodes and the deployment node of the (i-1) th service function; and selecting the node with the highest score from the P nodes as a deployment node of the ith service function according to the score of each node in the P nodes related to the ith service function.
In a second aspect, there is provided a service function arrangement apparatus, including: the system comprises a receiving module, a service module and a service module, wherein the receiving module is used for receiving a service request from user equipment, the service request is used for requesting the deployment of a service function chain, the service function chain consists of M service functions in sequence, and M is a positive integer greater than 1; an obtaining module, configured to, for a first service function in the M service functions, obtain attribute information of the first service function of each node in N nodes that can provide the first service function, and a distance between each node in the N nodes and the user equipment; the attribute information of the first service function of a node comprises one or more of: the node comprises a resource availability ratio, stability information related to a first service function, or service function evaluation information related to the first service function, wherein the resource availability ratio is used for representing the ratio of idle resources which can be provided by the node to the whole resources, the stability information related to the first service function is used for indicating the probability of normal operation when the node provides the first service function, the service function evaluation information related to the first service function is used for indicating the evaluation of a user on the first service function provided by the node, and N is a positive integer; and the selection module is used for selecting the optimal node from the N nodes as the deployment node of the first service function according to the attribute information of the first service function of each node in the N nodes and the distance between each node in the N nodes and the user equipment.
In a third aspect, there is provided an apparatus for arranging service functions, comprising: a processor, a communication interface, and a memory; the memory is for storing one or more programs, the one or more programs including computer executable instructions, which when executed by the service function orchestration device, cause the service function orchestration device to perform any of the service function orchestration methods as provided by the first aspect.
In a fourth aspect, the present application provides a computer-readable storage medium, in which instructions are stored, and when the instructions are executed on a computer, the instructions cause the computer to execute any one of the service function arrangement methods provided in the first aspect.
In a fifth aspect, the present application provides a computer program product comprising instructions which, when run on a computer, cause the computer to perform any of the service function orchestration methods provided by the first aspect above.
For the description of the second to fifth aspects in the present application, reference may be made to the detailed description of the first aspect; in addition, for the beneficial effects described in the second aspect to the fifth aspect, reference may be made to the beneficial effect analysis of the first aspect, and details are not described here.
Drawings
FIG. 1 is a schematic structural diagram of an SFC provided by the present application;
FIG. 2 is a schematic diagram of a service function orchestration system according to the present application;
FIG. 3 is a flow chart of a method for orchestrating service functions according to the present application;
FIG. 4 is a flow chart of another service function orchestration method provided herein;
FIG. 5 is a flow chart of another method for orchestrating service functions provided herein;
FIG. 6 is a flow chart of another method for orchestrating service functions provided herein;
FIG. 7 is a schematic structural diagram of a service function orchestration device according to the present application;
fig. 8 is a schematic structural diagram of another service function orchestration device provided by the present application.
Detailed Description
A method, an apparatus, and a computer-readable storage medium for arranging service functions provided in the present application will be described in detail below with reference to the accompanying drawings.
The term "and/or" herein is merely an association describing an associated object, meaning that three relationships may exist, e.g., a and/or B, may mean: a exists alone, A and B exist simultaneously, and B exists alone.
The terms "first" and "second" and the like in the description and drawings of the present application are used for distinguishing different objects or for distinguishing different processes for the same object, and are not used for describing a specific order of the objects.
Furthermore, the terms "including" and "having," and any variations thereof, as referred to in the description of the present application, 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.
It should be noted that in the embodiments of the present application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or explanations. Any embodiment or design described herein as "exemplary" or "e.g.," is not necessarily to be construed as preferred or advantageous over other embodiments or designs. Rather, use of the word "exemplary" or "such as" is intended to present concepts related in a concrete fashion.
In the description of the present application, the meaning of "a plurality" means two or more unless otherwise specified.
As described in the background, where a distributed resource pool is employed, individual service functions in a service function chain may be responsible for nodes (servers or virtual machines on servers) in different resource pools. Because the nodes in different resource pools are different and the service functions provided by different nodes are also different, in this case, it is important to select a suitable node to execute the corresponding service function, and if the node is selected unreasonably, the service effect of the service function chain may be poor or the service processing delay may be high.
In view of the foregoing technical problems, an embodiment of the present application provides a method for arranging service functions, which specifically includes: receiving a service request from user equipment, wherein the service request is used for requesting to deploy a service function chain, the service function chain is composed of M service functions in sequence, and M is a positive integer greater than 1; for a first service function in the M service functions, acquiring attribute information of the first service function of each node in N nodes capable of providing the first service function, and a distance between each node in the N nodes and user equipment; and selecting an optimal node from the N nodes as a deployment node of the first service function according to the attribute information of the first service function of each node in the N nodes and the distance between each node in the N nodes and the user equipment.
Based on the technical solution provided by the embodiment of the present application, after M service functions in a service function chain are determined, attribute information of a first service function of N nodes capable of providing the first service function and a distance between each node of the N nodes and user equipment are obtained. Wherein the attribute information includes: resource availability, stability information associated with the first service function, or service function rating information associated with the first service function. Based on the method, according to the attribute information and the distance information, multiple dimensions are considered, and the optimal node is selected from the N nodes to serve as the deployment node of the first service function, so that the service effect and the service processing time delay are considered.
The Service Function Chain (SFC) related to the embodiment of the present application is a set of ordered service functions (or service functions), and the SFC performs a series of service processing on an IP packet, a link frame, or a data stream on a network based on classification or policy. Fig. 1 is a schematic diagram of a composition structure of an SFC provided in an embodiment of the present application. As shown in fig. 1, the SFC includes:
a classifier (SC) is configured to classify the network traffic according to rules and forward the network traffic to a corresponding SFF.
A service function node (SF) is a functional unit for processing a data packet according to a specific function requirement, and the SF is loaded on a server or a virtual machine of the server.
And the Service Function Forwarder (SFF) is used for providing forwarding of the service layer and forwarding the network traffic to the corresponding function.
The SC, SF, and SFF are all network nodes in the network, and the network node is a device connected to an independent website with a function of transmitting or receiving data. Alternatively, the node may be a switch device or a router device.
In a service function chain, each service function is performed by one or more nodes that are specifically assigned. Which service functions are included in a service function chain may be customized to the business needs of the user equipment. For example, an administrator of a data center may define a service function chain of security service functions (e.g., virtualized firewall functions, virtualized intrusion detection functions, etc.), where each service function may be configured to process network traffic received from a computing device in a particular order.
In some embodiments, a node may provide one or more service functions.
Fig. 2 is a schematic diagram of an architecture of a service function orchestration system according to an embodiment of the present application. Optionally, the system may be connected to an egress router of each node, and the egress router may report a condition of a service function that can be provided by each node. As shown in table 1, the format of the report message for the egress router is:
TABLE 1
Route ID Node ID Location Fun name
Wherein, Route ID represents the number of the router connected with the node; node ID represents the number of the Node; location represents the position of the node; the Fun name represents information of the service function that the node can provide.
For example, in conjunction with fig. 2, the report message of the egress router may be stored in the service function orchestration system in the form shown in table 2:
TABLE 2
Route ID Node ID Location Fun name
R1 N1 BD {A,C}
R2 N2 SJZ {B,C}
R3 N3 BD {A,D}
R4 N4 LF {B,D}
R5 N5 LF {A}
The embodiments provided in the present application will be described in detail below with reference to the accompanying drawings.
As shown in fig. 3, an embodiment of the present application provides a service function arrangement method, which is applied to the service function arrangement system shown in fig. 2, and the method includes:
s101, receiving a service request from user equipment.
The service request is used for requesting to deploy a service function chain, the service function chain is composed of M service functions in sequence, and M is a positive integer greater than 1.
S102, for a first service function in the M service functions, acquiring attribute information of the first service function of each node in the N nodes capable of providing the first service function, and distances between each node in the N nodes and the user equipment.
It should be understood that there are N nodes capable of providing the first service function, where N is a positive integer, that is, there are at least 1 node capable of providing the first service function.
Wherein the attribute information of the first service function of a node comprises one or more of: resource availability, stability information related to the first service function, or service function evaluation information related to the first service function.
And the resource availability is used for representing the ratio of the idle resources which can be provided by the node to the whole resources. Optionally, the resource availability includes: bandwidth resource availability and computational resource availability. The bandwidth resource availability may satisfy the following formula (1), and the computational resource availability may satisfy the following formula (2):
Figure BDA0003324629140000081
wherein p isbRepresenting the bandwidth resource availability, b representing the bandwidth of the node configuration, bHas been usedIndicating the bandwidth currently used by the node.
Figure BDA0003324629140000082
Wherein p iswRepresenting computing power resource availability, w representing computing power of node configuration, wHas been usedDisplay sectionThe calculation force currently used is pointed out.
Stability information associated with the first service function indicating a probability of normal operation of the node when providing the first service function. Optionally, the stability information related to the first service function may satisfy the following formula (3):
pd＝dgo outdIs provided withdDeficiency of QiFormula (3)
Wherein p isdRepresenting stability information, dGo outIndicating the non-failure rate of the egress router of the node, dIs provided withRepresenting the non-failure rate of a target device in the node for providing the first service function, dDeficiency of QiRepresenting a non-failure rate of a virtual machine in the target device for providing the first service function.
In some embodiments, if the service function is provided directly by the target device in the node, then dDeficiency of QiMay be set to 1.
Service function evaluation information associated with the first service function for indicating a user's evaluation of the first service function provided by the node. Optionally, the service function evaluation information related to the first service function may satisfy the following formula (4):
Figure BDA0003324629140000083
wherein p isvThe method comprises the steps of representing service evaluation information, x representing the number of times that a node successfully provides a first service function, y representing the number of times that a node fails to provide the first service function, a representing the number of times of satisfactory evaluation, b representing the number of times of basically satisfactory evaluation, c representing the number of times of unsatisfactory evaluation, alpha representing a weight parameter of the number of times of satisfactory evaluation, beta representing a weight parameter of the number of times of basically satisfactory evaluation, gamma representing a weight parameter of the number of times of unsatisfactory evaluation, and alpha, beta and gamma are constants. Illustratively, α has a value of 1, β has a value of 0.67, and γ has a value of 0.33.
In the embodiment of the present application, the distance between the node and the user equipment may be determined according to the location information of the node and the location information of the user equipment. It should be understood that the location information of the node may be obtained from a message reported by an egress router of the node, and the location information of the user equipment may be obtained from a message sent by the user equipment.
S103, according to the attribute information of the first service function of each node in the N nodes and the distance between each node in the N nodes and the user equipment, selecting an optimal node from the N nodes as a deployment node of the first service function.
Optionally, as shown in fig. 4, step S103 may be implemented as the following steps:
and S1031, determining scores related to the first service function of each node in the N nodes according to the attribute information of the first service function of each node in the N nodes and the distance between each node in the N nodes and the user equipment.
In some embodiments, determining the score associated with the first service function for each of the N nodes may satisfy the following equation (5):
Figure BDA0003324629140000091
wherein the content of the first and second substances,
Figure BDA0003324629140000092
a score associated with the first service function is indicated for each of the N nodes,
Figure BDA0003324629140000093
indicating the distance between each of the N nodes and the user equipment,
Figure BDA0003324629140000094
indicating an evaluation value, m, associated with a first service function for each of the N nodes1The number representing the first of the M service functions in the service function chain, N the number of the N nodes capable of providing the first service function, x, y, z being constants.
Optionally, the evaluation value related to the first service function of each node of the N nodes in the above formula (5)
Figure BDA0003324629140000095
Can be determined by equation (6):
Figure BDA0003324629140000096
wherein d, e, f and g are constants, and d + e + f + g is 1.
S1032, according to the scores of the nodes in the N nodes, which are related to the first service function, selecting the node with the highest score from the N nodes as a deployment node of the first service function.
In some embodiments, the N nodes may be arranged in a descending order according to the scores of the respective nodes in the N nodes related to the first service function, and the node with the sequence number of 1 has the highest score, that is, the node may be used as the deployment node of the first service function.
For example, assume that there are 4 nodes, a1, a2, A3, and a4, which can provide the first service function. Assume the evaluation value of the first node A1
Figure BDA0003324629140000097
Is 7, distance from user equipment
Figure BDA0003324629140000098
Is 1; evaluation value of the second node A2
Figure BDA0003324629140000099
Is 8, distance from user equipment
Figure BDA00033246291400000910
Is 2; evaluation value of the third node A3
Figure BDA0003324629140000101
9, and user equipmentIs a distance of
Figure BDA0003324629140000102
Is 1; evaluation value of the fourth node A4
Figure BDA0003324629140000103
Is 10, distance from user equipment
Figure BDA0003324629140000104
Is 4; x is 0.5, y is 2, and z is 1. Then, as shown in table 3, the scores of the nodes can be obtained according to the above formula (5):
TABLE 3
Figure BDA0003324629140000105
Wherein, Kmax＝max{1，2，1，4}＝4。
The nodes are sorted in descending order according to their scores, which may be as the sorted list shown in table 4:
TABLE 4
Ranking Node numbering Score S m1n
1 A3 162
2 A4 100
3 A1 98
4 A2 90.5
Thus, as shown in table 4, the first ranked node a3 may be selected as the deployment node for the first service function.
The technical scheme provided by the embodiment of the application at least has the following beneficial effects: after determining the M service functions in the service function chain, obtaining attribute information of a first service function of N nodes capable of providing the first service function, and distances between each node of the N nodes and the user equipment. Wherein the attribute information includes: resource availability, stability information associated with the first service function, or service function rating information associated with the first service function. Based on the method, according to the attribute information and the distance information, multiple dimensions are considered, and the optimal node is selected from the N nodes to serve as the deployment node of the first service function, so that the service effect and the service processing time delay are considered.
As shown in fig. 5, an embodiment of the present application provides another service function orchestration method, configured to determine, after a deployment node of a first service function of a service function chain is determined, a deployment node of a next service function according to a deployment node of a previous service function until a complete service function chain is formed. The method comprises the following steps:
s201, for the ith service function in the M service functions, acquiring attribute information of the ith service function of each node in P nodes capable of providing the ith service function and the distance between each node in the P nodes and the deployment node of the (i-1) th service function.
Wherein i is a positive integer greater than 1. It should be understood that there are P nodes capable of providing the ith service function, where P is a positive integer, that is, at least 1 node can provide the ith service function.
Wherein the attribute information of the ith service function of a node includes one or more of: resource availability, stability information related to the ith service function, or service function evaluation information related to the ith service function.
And the resource availability is used for representing the ratio of the idle resources which can be provided by the node to the whole resources. Optionally, the resource availability includes: bandwidth resource availability ratio pbSum power resource availability pw. Bandwidth resource availability ratio pbThe calculation formula (2) can refer to the formula (1) above, and the calculation resource availability ratio pwReference may be made to the above equation (2), which is not described herein again.
And the stability information related to the ith service function is used for indicating the probability of normal operation when the node provides the ith service function. Optionally, the stability information related to the ith service function may refer to the above formula (3), and is not described herein again.
Wherein p isdRepresenting stability information, dGo outIndicating the non-failure rate of the egress router of the node, dIs provided withRepresenting the non-failure rate of the target device in the node for providing the ith service function, dDeficiency of QiRepresenting a non-failure rate of a virtual machine in the target device for providing the ith service function.
In some embodiments, if the service function is provided directly by the target device in the node, then dDeficiency of QiMay be set to 1.
Service function evaluation information related to the ith service function is used for indicating the evaluation of the ith service function provided by the node by the user. Optionally, the service function evaluation information related to the ith service function may refer to the above formula (4), and is not described herein again.
Wherein p isvRepresenting service evaluation information, x representing the number of times a node successfully provides an ith service function, y representing the number of times a node fails to provide the ith service function, a tableThe number of satisfactory evaluations is shown, b is the number of substantially satisfactory evaluations, c is the number of unsatisfactory evaluations, α is a weighting parameter for the number of satisfactory evaluations, β is a weighting parameter for the number of substantially satisfactory evaluations, γ is a weighting parameter for the number of unsatisfactory evaluations, α, β, γ are all constants, illustratively, α has a value of 1, β has a value of 0.67, γ has a value of 0.33.
S202, according to the attribute information of the ith service function of each node in the P nodes and the distance between each node in the P nodes and the deployment node of the (i-1) th service function, selecting the optimal node from the P nodes as the deployment node of the ith service function.
As shown in fig. 6, step S202 may be implemented as the following steps:
s2021, determining scores of each node in the P nodes, which are related to the ith service function, according to the attribute information of the ith service function of each node in the P nodes and the distance between each node in the P nodes and the deployment node of the (i-1) th service function.
In some embodiments, determining the score associated with the ith service function for each of the P nodes may satisfy the following equation (7):
Figure BDA0003324629140000121
wherein the content of the first and second substances,
Figure BDA0003324629140000122
represents the scores associated with the ith service function for each of the P nodes,
Figure BDA0003324629140000123
representing the distance between each of the P nodes and the deployment node of the i-1 st service function,
Figure BDA0003324629140000124
represents the evaluation value related to the ith service function of each node in P nodes, and m represents the service functionThe number of the ith service function of the M service functions in the energy chain, n represents the number of P nodes capable of providing the ith service function, and x, y and z are constants.
Alternatively, the evaluation value related to the ith service function of each of the P nodes in the above formula (7)
Figure BDA0003324629140000125
Can be determined by equation (8):
Figure BDA0003324629140000126
wherein d, e, f and g are constants, and d + e + f + g is 1.
In some embodiments, there is a case where one node can provide two service functions simultaneously, that is, the deployment node of the i-1 st service function can also provide the ith service function, and then, the distance between the node and the deployment node of the i-1 st service function is 0 at this time, that is, the node is a deployment node of the i-1 st service function
Figure BDA0003324629140000127
Due to the fact that
Figure BDA0003324629140000128
In the formula (7), so that
Figure BDA0003324629140000129
When this is the case, equation (7) cannot be used.
Therefore, when the deployment node of the i-1 st service function can also provide the ith service function, the embodiment of the present application calculates the evaluation value of the node related to the ith service function by using formula (8)
Figure BDA00033246291400001210
By using
Figure BDA00033246291400001211
As a score for the node associated with the ith service function.
S2022, according to the scores of the nodes in the P nodes, which are related to the ith service function, selecting the node with the highest score from the P nodes as the deployment node of the ith service function.
In some embodiments, the P nodes may be arranged in a descending order according to the scores of the respective nodes in the P nodes related to the ith service function, and the node with the sequence number of 1 has the highest score, that is, the node may be used as the deployment node of the ith service function.
For example, assume that there are 5 nodes that can provide the second service function, B1, B2, B3, B4, and B5. Assume the evaluation value of the first node B1
Figure BDA00033246291400001212
6, distance from the deployment node of the first service function
Figure BDA00033246291400001213
Is 1; evaluation value of the second node B2
Figure BDA00033246291400001214
7, distance from the deployment node of the first service function
Figure BDA00033246291400001215
Is 1; evaluation value of the third node B3
Figure BDA0003324629140000131
8, distance from the deployment node of the first service function
Figure BDA0003324629140000132
Is 2; evaluation value of the fourth node B4
Figure BDA0003324629140000133
9, distance from the deployment node of the first service function
Figure BDA0003324629140000134
Is 1; fifth aspect of the inventionEvaluation value of individual node B5
Figure BDA0003324629140000135
10, distance from the deployment node of the first service function
Figure BDA0003324629140000136
Is 4; x is 0.5, y is 2, and z is 1. Then, as shown in table 5, the scores of the nodes can be obtained according to the above formula (7):
TABLE 5
Figure BDA0003324629140000137
Wherein, Kmax＝max{1，1，2，1，4}＝4。
The nodes are sorted in descending order according to their scores, which may be as shown in the sorted list of table 6:
TABLE 6
Ranking Node numbering Score S m2n
1 B4 162
2 B5 100
3 B2 98
4 B3 90.5
5 B1 72
Thus, as shown in Table 6, the first ranked node B4 may be selected as the deployment node for the second service function.
The technical scheme provided by the embodiment of the application at least has the following beneficial effects: after determining the deployment node of the first service function, acquiring attribute information of the ith service function of each node in the P nodes capable of providing the ith service function and the distance between each node in the P nodes and the deployment node of the (i-1) th service function. Wherein the attribute information includes: resource availability, stability information related to the ith service function, or service function evaluation information related to the ith service function. Based on the above, according to the attribute information and the distance information, multiple dimensions are considered, and an optimal node is selected from the P nodes as a deployment node of the ith service function, so that the service effect and the service processing delay are considered.
In some embodiments, according to the method for arranging service functions provided in fig. 3, the deployment node of the first service function can be accurately determined; according to the method for arranging service functions provided in fig. 5, a deployment node of a second service function may be determined according to a deployment node of a first service function, a deployment node of a third service function may be determined according to a deployment node of the second service function, and so on until deployment nodes of M service functions in a service function chain are determined. After the deployment node of each service function in the service function chain is determined, a complete service function chain may be generated, and the service function chain is sent to the relevant device (e.g., a server), so as to complete the corresponding service.
It can be seen that the foregoing describes the solution provided by the embodiments of the present application primarily from a methodological perspective. In order to implement the functions, the embodiments of the present application provide corresponding hardware structures and/or software modules for performing the respective functions. Those of skill in the art will readily appreciate that the various illustrative modules and algorithm steps described in connection with the embodiments disclosed herein may be implemented as hardware or combinations of hardware and computer software. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
In the embodiment of the present application, functional modules may be divided according to the above method example, for example, each functional module may be divided corresponding to each function, or two or more functions may be integrated into one processing module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. Optionally, the division of the modules in the embodiment of the present application is schematic, and is only a logic function division, and there may be another division manner in actual implementation.
Fig. 7 is a schematic structural diagram of an apparatus for arranging service functions according to an embodiment of the present disclosure. The device can be used for executing the arrangement method of the service functions so as to improve the service effect. The device includes: a receiving module 401, an obtaining module 402 and a selecting module 403.
A receiving module 401, configured to receive a service request from a user equipment, where the service request is used to request to deploy a service function chain, and the service function chain is formed by M service functions in sequence, where M is a positive integer greater than 1.
An obtaining module 402, configured to, for a first service function in the M service functions, obtain attribute information of the first service function of each node in N nodes that can provide the first service function, and a distance between each node in the N nodes and the user equipment; the attribute information of the first service function of a node comprises one or more of: the node comprises a resource availability ratio, stability information related to a first service function, or service function evaluation information related to the first service function, wherein the resource availability ratio is used for representing the ratio of idle resources which can be provided by the node to the whole resources, the stability information related to the first service function is used for indicating the probability of normal operation when the node provides the first service function, the service function evaluation information related to the first service function is used for indicating the evaluation of a user on the first service function provided by the node, and N is a positive integer.
A selecting module 403, configured to select an optimal node from the N nodes as a deployment node of the first service function according to attribute information of the first service function of each node in the N nodes and a distance between each node in the N nodes and the user equipment.
In some embodiments, the selecting module 403 is specifically configured to determine, according to the attribute information of the first service function of each node in the N nodes and the distance between each node in the N nodes and the user equipment, a score of each node in the N nodes, which is related to the first service function; and according to the scores of the nodes in the N nodes, which are related to the first service function, selecting the node with the highest score from the N nodes as the deployment node of the first service function.
In some embodiments, the resource availability includes: the availability ratio of bandwidth resources and the availability ratio of computing resources; the obtaining module 402 is specifically configured to obtain the formula
Figure BDA0003324629140000151
Determining the bandwidth resource availability; wherein p isbRepresenting the bandwidth resource availability, b representing the bandwidth of the node configuration, bHas been usedIndicating the bandwidth currently used by the node; as described aboveAn obtaining module 402, specifically configured to obtain a formula
Figure BDA0003324629140000152
Determining the computing power resource availability; wherein p iswRepresenting computing power resource availability, w representing computing power of node configuration, wHas been usedRepresenting the computational power currently used by the node.
In some embodiments, the obtaining module 402 is specifically configured to obtain the formula pd＝dGo outdIs provided withdDeficiency of QiDetermining stability information associated with the first service function; wherein p isdRepresenting stability information, dGo outIndicating the non-failure rate of the egress router of the node, dIs provided withRepresenting the non-failure rate of a target device in the node for providing the first service function, dDeficiency of QiRepresenting a non-failure rate of a virtual machine in the target device for providing the first service function.
In some embodiments, the selection module 403 is specifically configured to select the data according to a formula
Figure BDA0003324629140000153
Determining a score associated with a first service function for each of the N nodes; wherein the content of the first and second substances,
Figure BDA0003324629140000154
a score associated with the first service function is indicated for each of the N nodes,
Figure BDA0003324629140000155
indicating the distance between each of the N nodes and the user equipment,
Figure BDA0003324629140000156
indicating an evaluation value, m, associated with a first service function for each of the N nodes1The number of the first service function of M service functions in the service function chain is represented, N represents the number of N nodes capable of providing the first service function, and x, y and z are constants; the selection module 403 is further configured to select a formula
Figure BDA0003324629140000161
Determining an evaluation value related to a first service function of each of the N nodes; wherein p isvAnd d, e, f and g are constants, and d + e + f + g is 1.
In some embodiments, the obtaining module 402 is further configured to, for an ith service function in the M service functions, obtain attribute information of the ith service function of each node in P nodes capable of providing the ith service function, and a distance between each node in the P nodes and a deployment node of the i-1 st service function, where i is a positive integer greater than 1; the attribute information of the ith service function of a node includes one or more of: the node comprises a resource availability ratio, stability information related to the ith service function, or service function evaluation information related to the ith service function, wherein the resource availability ratio is used for representing the ratio of idle resources which can be provided by the node to the whole resources, the stability information related to the ith service function is used for indicating the probability of normal operation when the node provides the ith service function, the service function evaluation information related to the ith service function is used for indicating the evaluation of a user on the ith service function provided by the node, and P is a positive integer. The selecting module 403 is further configured to select an optimal node from the P nodes as a deployment node of the ith service function according to the attribute information of the ith service function of each node in the P nodes and the distance between each node in the P nodes and the deployment node of the ith-1 service function.
In some embodiments, the selecting module 403 is specifically configured to determine, according to the attribute information of the ith service function of each node in the P nodes and the distance between each node in the P nodes and the deployment node of the i-1 th service function, a score of each node in the P nodes, which is related to the ith service function; and selecting the node with the highest score from the P nodes as a deployment node of the ith service function according to the score of each node in the P nodes related to the ith service function.
In the case of implementing the functions of the integrated modules in the form of hardware, the embodiment of the present invention provides another possible structural schematic diagram of the service function arrangement apparatus in the above embodiment. As shown in fig. 8, the service function orchestration device includes: a processor 502, a communication interface 503, and a bus 504. Optionally, the communication device may further comprise a memory 501.
The processor 502 may be implemented or performed with various illustrative logical blocks, modules, and circuits described in connection with the disclosure. The processor 502 may be a central processing unit, general purpose processor, digital signal processor, application specific integrated circuit, field programmable gate array or other programmable logic device, transistor logic device, hardware component, or any combination thereof. Which may implement or perform the various illustrative logical blocks, modules, and circuits described in connection with the disclosure. The processor 502 may also be a combination of computing functions, e.g., comprising one or more microprocessors, a combination of DSPs and microprocessors, and the like.
A communication interface 503 for connecting with other devices through a communication network. The communication network may be an ethernet network, a radio access network, a Wireless Local Area Network (WLAN), etc.
The memory 501 may be, but is not limited to, 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 magnetic disk storage medium or other magnetic storage device, 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.
As a possible implementation, the memory 501 may be present separately from the processor 502, and the memory 501 may be connected to the processor 502 via a bus 504 for storing instructions or program code. The processor 502, when calling and executing instructions or program codes stored in the memory 501, is able to implement the communication method provided by the embodiment of the present invention.
In another possible implementation, the memory 501 may also be integrated with the processor 502.
The bus 504 may be an Extended Industry Standard Architecture (EISA) bus or the like. The bus 504 may be divided into an address bus, a data bus, a control bus, and the like. For ease of illustration, only one thick line is shown in FIG. 8, but this is not intended to represent only one bus or type of bus.
Through the description of the above embodiments, it is clear to those skilled in the art that, for convenience and simplicity of description, the foregoing division of the functional modules is merely used as an example, and in practical applications, the foregoing function distribution may be completed by different functional modules according to needs, that is, the internal structure of the service function scheduling apparatus is divided into different functional modules to complete all or part of the above described functions.
The embodiment of the application also provides a computer readable storage medium. All or part of the processes in the above method embodiments may be performed by computer instructions to instruct related hardware, and the program may be stored in the above computer-readable storage medium, and when executed, may include the processes in the above method embodiments. The computer readable storage medium may be of any of the embodiments described above or a memory. The computer readable storage medium may also be an external storage device of the communication apparatus, such as a plug-in hard disk, a Smart Memory Card (SMC), a Secure Digital (SD) card, a flash memory card (flash card), or the like, provided on the communication apparatus. Further, the computer-readable storage medium may include both an internal storage unit and an external storage device of the communication apparatus. The computer-readable storage medium stores the computer program and other programs and data required by the communication apparatus. The above-described computer-readable storage medium may also be used to temporarily store data that has been output or is to be output.
The present application further provides a computer program product, which contains a computer program, and when the computer program product runs on a computer, the computer is caused to execute the method for arranging the service functions provided in the above embodiments.
The above description is only an embodiment of the present application, but the scope of the present application is not limited thereto, and any changes or substitutions within the technical scope of the present disclosure should be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims (10)

1. A method for orchestrating service functions, the method comprising:
receiving a service request from user equipment, wherein the service request is used for requesting to deploy a service function chain, the service function chain is composed of M service functions in sequence, and M is a positive integer greater than 1;
for a first service function in the M service functions, obtaining attribute information of the first service function of each node in N nodes capable of providing the first service function, and a distance between each node in the N nodes and the user equipment; the attribute information of the first service function of a node comprises one or more of: the node comprises a resource availability ratio, stability information related to a first service function, or service function evaluation information related to the first service function, wherein the resource availability ratio is used for representing the ratio of idle resources which can be provided by the node to the whole resources, the stability information related to the first service function is used for indicating the probability of normal operation when the node provides the first service function, the service function evaluation information related to the first service function is used for indicating the evaluation of a user on the first service function provided by the node, and N is a positive integer;
and selecting an optimal node from the N nodes as a deployment node of the first service function according to the attribute information of the first service function of each node in the N nodes and the distance between each node in the N nodes and the user equipment.
2. The method according to claim 1, wherein said selecting an optimal node from the N nodes as a deployment node of the first service function according to the attribute information of the first service function of each node of the N nodes and the distance between each node of the N nodes and the user equipment comprises:
determining a score of each node in the N nodes related to the first service function according to attribute information of the first service function of each node in the N nodes and a distance between each node in the N nodes and the user equipment;
and according to the scores of the nodes in the N nodes, which are related to the first service function, selecting the node with the highest score from the N nodes as the deployment node of the first service function.
3. The method of claim 2, wherein the resource availability ratio comprises: the availability ratio of bandwidth resources and the availability ratio of computing resources;
the bandwidth resource availability is formulated by
Figure FDA0003324629130000011
Determining;
wherein p isbRepresenting the bandwidth resource availability, b representing the bandwidth of the node configuration, bHas been usedIndicating the bandwidth currently used by the node;
the computing power resource availability is given by formula
Figure FDA0003324629130000021
Determining;
wherein p iswRepresenting computing power resource availability, w representing computing power of node configuration, wHas been usedRepresenting the computational power currently used by the node.
4. The method of claim 3, wherein the stability information associated with the first service function is represented by the formula pd＝dGo outdIs provided withdDeficiency of QiDetermining;
wherein p isdRepresenting stability information, dGo outIndicating the non-failure rate of the egress router of the node, dIs provided withRepresenting the non-failure rate of a target device in the node for providing the first service function, dDeficiency of QiRepresenting a non-failure rate of a virtual machine in the target device for providing a first service function.
5. The method of claim 4, wherein the score associated with the first service function for each of the N nodes satisfies the following relationship:
by the formula
Figure FDA0003324629130000022
Determining a score associated with the first service function for each of the N nodes;
wherein the content of the first and second substances,
Figure FDA0003324629130000023
a score associated with the first service function representing each of the N nodes,
Figure FDA0003324629130000024
representing distances between respective nodes of the N nodes and the user equipment,
Figure FDA0003324629130000025
Figure FDA0003324629130000026
an evaluation value, m, representing the first service function of each of the N nodes1Representing said serviceThe number of a first service function of the M service functions in the function chain, N represents the number of N nodes capable of providing the first service function, and x, y and z are constants;
the evaluation value of each of the N nodes related to the first service function is represented by a formula
Figure FDA0003324629130000027
Determining;
wherein p isvAnd d, e, f and g are constants, and d + e + f + g is 1.
6. The method according to any one of claims 1 to 5, further comprising:
for an ith service function in M service functions, acquiring attribute information of the ith service function of each node in P nodes capable of providing the ith service function and a distance between each node in the P nodes and a deployment node of an i-1 th service function, wherein i is a positive integer greater than 1; the attribute information of the ith service function of a node includes one or more of: the node comprises a resource availability ratio, stability information related to the ith service function, or service function evaluation information related to the ith service function, wherein the resource availability ratio is used for representing the ratio of idle resources which can be provided by the node to the whole resources, the stability information related to the ith service function is used for indicating the probability of normal operation when the node provides the ith service function, the service function evaluation information related to the ith service function is used for indicating the evaluation of a user on the ith service function provided by the node, and P is a positive integer;
and selecting an optimal node from the P nodes as a deployment node of the ith service function according to the attribute information of the ith service function of each node in the P nodes and the distance between each node in the P nodes and the deployment node of the (i-1) th service function.
7. The method according to claim 6, wherein said selecting an optimal node from the P nodes as a deployment node of the ith service function according to the attribute information of the ith service function of each node in the P nodes and the distance between each node in the P nodes and the deployment node of the (i-1) th service function comprises:
determining a grade of each node in the P nodes related to the ith service function according to the attribute information of the ith service function of each node in the P nodes and the distance between each node in the P nodes and the deployment node of the (i-1) th service function;
and according to the scores of all the nodes in the P nodes, which are related to the ith service function, selecting the node with the highest score from the P nodes as the deployment node of the ith service function.
8. An apparatus for organizing service functions, comprising:
the system comprises a receiving module, a service module and a service module, wherein the receiving module is used for receiving a service request from user equipment, the service request is used for requesting to deploy a service function chain, the service function chain consists of M service functions in sequence, and M is a positive integer greater than 1;
an obtaining module, configured to, for a first service function in M service functions, obtain attribute information of the first service function of each node in N nodes that can provide the first service function, and a distance between each node in the N nodes and the user equipment; the attribute information of the first service function of a node comprises one or more of: the node comprises a resource availability ratio, stability information related to a first service function, or service function evaluation information related to the first service function, wherein the resource availability ratio is used for representing the ratio of idle resources which can be provided by the node to the whole resources, the stability information related to the first service function is used for indicating the probability of normal operation when the node provides the first service function, the service function evaluation information related to the first service function is used for indicating the evaluation of a user on the first service function provided by the node, and N is a positive integer;
a selecting module, configured to select an optimal node from the N nodes as a deployment node of the first service function according to attribute information of the first service function of each node in the N nodes and a distance between each node in the N nodes and the user equipment.
9. An arrangement of service functions, characterized in that the arrangement comprises: a processor, a communication interface, and a memory; the memory is configured to store one or more programs, the one or more programs including computer executable instructions, which, when the service function orchestration device is running, are executed by the processor to cause the service function orchestration device to perform the service function orchestration method according to any one of claims 1-7.
10. A computer-readable storage medium, comprising computer-executable instructions which, when executed on a computer, cause the computer to perform the method of orchestrating service functions according to any one of claims 1 to 7.
CN202111258328.XA 2021-10-27 2021-10-27 Arranging method and device of service functions and computer readable storage medium Active CN114020455B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111258328.XA CN114020455B (en) 2021-10-27 2021-10-27 Arranging method and device of service functions and computer readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111258328.XA CN114020455B (en) 2021-10-27 2021-10-27 Arranging method and device of service functions and computer readable storage medium

Publications (2)

Publication Number Publication Date
CN114020455A true CN114020455A (en) 2022-02-08
CN114020455B CN114020455B (en) 2023-01-24

Family

ID=80057989

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111258328.XA Active CN114020455B (en) 2021-10-27 2021-10-27 Arranging method and device of service functions and computer readable storage medium

Country Status (1)

Country Link
CN (1) CN114020455B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023221857A1 (en) * 2022-05-17 2023-11-23 大唐移动通信设备有限公司 Service processing method and apparatus, and related device thereof
CN117527590A (en) * 2024-01-04 2024-02-06 湖北省楚天云有限公司 Method, system and medium for micro-service deployment and request routing based on edge network

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108260169A (en) * 2018-01-26 2018-07-06 重庆邮电大学 A kind of service function chain dynamic deployment method ensured based on QoS
CN111654386A (en) * 2020-01-15 2020-09-11 许继集团有限公司 Method and system for establishing service function chain
CN111800291A (en) * 2020-05-27 2020-10-20 北京邮电大学 Service function chain deployment method and device
CN111866054A (en) * 2019-12-16 2020-10-30 北京小桔科技有限公司 Cloud host building method and device, electronic equipment and readable storage medium

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108260169A (en) * 2018-01-26 2018-07-06 重庆邮电大学 A kind of service function chain dynamic deployment method ensured based on QoS
CN111866054A (en) * 2019-12-16 2020-10-30 北京小桔科技有限公司 Cloud host building method and device, electronic equipment and readable storage medium
CN111654386A (en) * 2020-01-15 2020-09-11 许继集团有限公司 Method and system for establishing service function chain
CN111800291A (en) * 2020-05-27 2020-10-20 北京邮电大学 Service function chain deployment method and device

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023221857A1 (en) * 2022-05-17 2023-11-23 大唐移动通信设备有限公司 Service processing method and apparatus, and related device thereof
CN117527590A (en) * 2024-01-04 2024-02-06 湖北省楚天云有限公司 Method, system and medium for micro-service deployment and request routing based on edge network

Also Published As

Publication number Publication date
CN114020455B (en) 2023-01-24

Similar Documents

Publication Publication Date Title
Agarwal et al. VNF placement and resource allocation for the support of vertical services in 5G networks
CN112153700B (en) Network slice resource management method and equipment
CN108243044B (en) Service deployment method and device
CN114020455B (en) Arranging method and device of service functions and computer readable storage medium
US10070328B2 (en) Predictive network traffic management
CN113037786B (en) Intelligent computing power scheduling method, device and system
Alicherry et al. Network aware resource allocation in distributed clouds
EP3461087A1 (en) Network-slice resource management method and apparatus
CN103763346B (en) A kind of distributed resource scheduling method and device
CN103391206B (en) A kind of method for scheduling task and device thereof
CN110502321A (en) A kind of resource regulating method and system
CN109582452A (en) A kind of container dispatching method, dispatching device and electronic equipment
CN114402341A (en) Method, device and system for determining equipment information
CN112073237B (en) Large-scale target network construction method in cloud edge architecture
CN103685057B (en) Flow statistical method and device
CN103329493A (en) On-chip packet cut-through
US8705369B2 (en) Routing cost normalizing
CN110297959A (en) Date storage method, device, storage medium and Edge Server
Satpathy et al. Vmatch: A matching theory based vdc reconfiguration strategy
Zhu et al. VNF-B&B: Enabling edge-based NFV with CPE resource sharing
CN110113269B (en) Flow control method based on middleware and related device
CN115396515A (en) Resource scheduling method, device and storage medium
CN109831319A (en) A kind of network function dispositions method considering multi dimensional resource constraint
WO2017213065A1 (en) Service management system, service management method, and recording medium
CN114172817A (en) Virtual network function deployment method and system for edge computing

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
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20230810

Address after: 100033 21 Finance Street, Xicheng District, Beijing.

Patentee after: CHINA UNITED NETWORK COMMUNICATIONS GROUP Co.,Ltd.

Patentee after: China United Network Communications Corp Research Institute

Address before: 100033 21 Finance Street, Xicheng District, Beijing.

Patentee before: CHINA UNITED NETWORK COMMUNICATIONS GROUP Co.,Ltd.