WO2024041572A9 - 业务处理方法、装置、设备、介质及程序产品 - Google Patents

业务处理方法、装置、设备、介质及程序产品 Download PDF

Info

Publication number
WO2024041572A9
WO2024041572A9 PCT/CN2023/114474 CN2023114474W WO2024041572A9 WO 2024041572 A9 WO2024041572 A9 WO 2024041572A9 CN 2023114474 W CN2023114474 W CN 2023114474W WO 2024041572 A9 WO2024041572 A9 WO 2024041572A9
Authority
WO
WIPO (PCT)
Prior art keywords
computing power
computing
service
sfs
business
Prior art date
Application number
PCT/CN2023/114474
Other languages
English (en)
French (fr)
Other versions
WO2024041572A1 (zh
Inventor
孙剑平
Original Assignee
中国电信股份有限公司
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 中国电信股份有限公司 filed Critical 中国电信股份有限公司
Publication of WO2024041572A1 publication Critical patent/WO2024041572A1/zh
Publication of WO2024041572A9 publication Critical patent/WO2024041572A9/zh

Links

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]

Definitions

  • the present invention relates to the field of cloud computing business service chain technology, and in particular to a business processing method, device, equipment, medium and program product.
  • each supported service can be modeled as a combination of one or more service functions (SFs), where each service function performs a specific task on a network packet or set of packets.
  • SFs service functions
  • the service functions are applied sequentially, i.e., network traffic is directed through these service functions in a specified manner.
  • This technique is called service function chaining, and these chains are often called service function chaining (SFCs).
  • the service function chain (including the service functions included in the service function chain) is determined by static configuration. If a SF encounters a computing bottleneck or failure during the processing of data packets through the service function chain, it is necessary to re-arrange and change the chain from the beginning to bypass the problematic service function. In order to reduce the load of a specific SF, it is necessary to adjust the SFC, which is costly and lacks flexibility.
  • the present disclosure provides a business processing method, apparatus, device, medium and program product, which at least to some extent overcome the problem in the related art that when a computing bottleneck or failure occurs in a certain SF, it is necessary to re-arrange and change the chain from the beginning, which is costly and lacks flexibility.
  • a business processing method including: determining a computing power resource parameter corresponding to the business to be processed according to the business to be processed received at the interface of the business function chain SFC; the computing power resource parameter is at least one parameter corresponding to the computing power resources that need to be used when the business to be processed is processed by one or more business functions SF in the SFC; according to the computing power resource parameter, pre-occupying the computing power resources of the one or more SFs within a computing power resource occupation period, and determining an allocation method of the computing power resources that the business to be processed needs to use within the computing power resource occupation period; and sending the allocation method to the one or more SFs through a routing protocol, so that the one or more SFs process the business to be processed according to the allocation method.
  • the computing resource parameters include at least one of the following: computing resource occupation cycle, SFC business path identifier SPI number, target SF index address, the amount and duration of memory occupied by SF during the computing resource occupation cycle, the number of jobs processed by the central processing unit CPU, the estimated median, CPU time/each job, and memory output.
  • the computing power resource parameters corresponding to the pending business are determined according to the pending business received at the interface of the service function chain SFC, including: expanding the computing power resource parameters according to the routing protocol, and sending the computing power resource parameters to the one or more SFs, so that the one or more SFs upload computing power resource information according to the computing power resource parameters;
  • the computing power resource parameters are a way of expressing the computing power resources required to process the business in the form of parameters;
  • the computing power resource information is one or more When multiple SFs process services, the usage of computing resources/remaining available computing resources are returned based on the computing resource parameters;
  • the computing resource parameters corresponding to the business to be processed are determined based on the business to be processed and the computing resource information.
  • the method of extending the computing resource parameters includes: the routing protocol is extended through a protocol message body TLV or a probe request option.
  • the computing power resources of the one or more SFs in the computing power resource occupation period are pre-occupied according to the computing power resource parameters to determine the allocation method of the computing power resources required for the pending business in the computing power resource occupation period, including: if all the computing power resource parameters corresponding to the pending business are allocated to the one or more SFs, and no overload signal is received, the computing power resources required for the pending business in the computing power resource occupation period are allocated, and the allocation method is determined; or, if an overload signal is received during the pre-occupancy operation, the computing power resources of any SF are stopped from being occupied; wherein the overload signal is a signal generated when the computing power resources pre-occupied by any SF in the computing power resource occupation period are greater than a preset computing power resource threshold; the computing power resources of the SF having the same business function as any SF are pre-occupied until the computing power resources required for the pending business in the computing power resource occupation period are allocated, and no overload signal is received, and the allocation method is determined.
  • the method further includes: configuring remaining computing power resource indication information according to the pending business received at the interface of the business function chain SFC; the remaining computing power resource indication information indicates the remaining computing power resources of the SF within the computing power resource occupancy period, which is returned in real time by one or more SFs in the SFC when processing the pending business; configuring computing power resource adjustment indication information; wherein the computing power resource adjustment indication information indicates the forwarder to adjust the SF processing the pending business according to the remaining computing power resources of the SF within the computing power resource occupancy period, which is returned in real time by one or more SFs when processing the pending business; sending the computing power resource adjustment indication information to the forwarder, and sending the remaining computing power resource indication information to the one or more SFs through the routing protocol, so that the one or more SFs and the forwarder process the pending business.
  • the method further includes: configuring remaining computing power resource indication information; the remaining computing power resource indication information indicates the remaining computing power resources of the SF within the computing power resource occupation period, which is returned in real time by one or more SFs in the SFC when processing the pending business; configuring computing power resource adjustment indication information; wherein the computing power resource adjustment indication information indicates the forwarder to adjust the SF for processing the pending business according to the remaining computing power resources of the SF within the computing power resource occupation period, which is returned in real time by one or more SFs when processing the pending business; sending the allocation method to the one or more SFs through the routing protocol, including: sending the computing power resource adjustment indication information to the forwarder, and sending the allocation method and the remaining computing power resource indication information to the one or more SFs through the routing protocol, so that the one or more SFs and the forwarder process the pending business.
  • an embodiment of the present disclosure provides a business processing device, including: a determination unit, configured to determine the computing power resource parameters corresponding to the pending business according to the pending business received at the interface of the business function chain SFC; the computing power resource parameters are at least one parameter corresponding to the computing power resources that need to be used when the pending business is processed by one or more business functions SF in the SFC; a pre-occupancy unit, configured to pre-occupy the computing power resources of the one or more SFs within the computing power resource occupation period according to the computing power resource parameters, and determine the allocation method of the computing power resources that the pending business needs to use within the computing power resource occupation period; a sending unit, configured to send the allocation method to the one or more SFs through a routing protocol, so that the one or more SFs process the pending business according to the allocation method.
  • an embodiment of the present disclosure provides an electronic device, including: a processor; and A memory is configured to store executable instructions of the processor; wherein the processor is configured to perform the method described above by executing the executable instructions.
  • a computer-readable storage medium stores computer instructions, and the instructions are executed by a processor according to the method described above.
  • a computer program product including a computer program, and when the computer program is executed by a processor, the method as described above is implemented.
  • the embodiments of the present disclosure provide a business processing method, apparatus, device, medium and program product, which determine the computing power resource parameters corresponding to the pending business according to the pending business received at the interface of the business function chain SFC;
  • the computing power resource parameter is at least one parameter corresponding to the computing power resources required to be used when the pending business is processed by one or more business functions SF in the SFC, and according to the computing power resource parameter, pre-occupies the computing power resources of one or more SFs within the computing power resource occupation period, determines the allocation method of the computing power resources required for the pending business within the computing power resource occupation period, and sends the allocation method to one or more SFs through the routing protocol, so that one or more SFs process the pending business according to the allocation method.
  • the computing resources of each SF are allocated in advance.
  • the new mechanism introduced on the controller can not only realize the perception of computing resources by SFC and determine the computing resource parameters of the accessed pending services, but also constrain the SF according to the computing resources required by SFC based on the perception of computing resources, and flexibly adjust the existing service path identifier (Service Path Identifier, SPI) processing pipeline locally through resource identifiers to adapt to the differentiated computing performance requirements and improve the overall utilization efficiency of the service chain SF.
  • SPI Service Path Identifier
  • the SFC processing resources are effectively utilized to improve the service quality and service availability of SFC from the network level, and to improve the scalability of the service chain and the utilization rate of SF computing power.
  • NSH Network Service Header
  • the present disclosure also configures remaining computing power resource indication information according to the pending business received at the interface of the business function chain SFC; the remaining computing power resource indication information is to indicate the remaining computing power resources of the SF within the computing power resource occupancy period returned in real time by one or more SFs in the SFC when processing the pending business, and configures computing power resource adjustment indication information; wherein, the computing power resource adjustment indication information is to instruct the forwarder to adjust the indication information of the SF processing the pending business according to the remaining computing power resources of the SF within the computing power resource occupancy period returned in real time by one or more SFs when processing the pending business, and the computing power resource adjustment indication information is sent to the forwarder, and the remaining computing power resource indication information is sent to one or more SFs through the routing protocol, so that one or more SFs and the forwarder process the pending business.
  • each SF can provide real-time feedback to the forwarder during the processing of pending services, and autonomously refresh the branch processing logic of the local SFC without frequently rescheduling the SFC. In this way, the load of SFs with high computing power overhead can be unloaded to other SFs, which can reduce the overhead of rescheduling the SFC path.
  • FIG1 shows one application scenario of a service processing method according to an embodiment of the present disclosure
  • FIG2 shows a second application scenario of a service processing method in an embodiment of the present disclosure
  • FIG3 shows one of the flowcharts of a service processing method in an embodiment of the present disclosure
  • FIG4 shows a third application scenario of a service processing method in an embodiment of the present disclosure
  • FIG5 shows a schematic diagram of a periodic computing resource representation in an embodiment of the present disclosure
  • FIG6 shows a second flow chart of a service processing method in an embodiment of the present disclosure
  • FIG. 7 shows a fourth application scenario of a service processing method according to an embodiment of the present disclosure
  • FIG8 is a schematic diagram showing the structure of an SFC computing network in an embodiment of the present disclosure.
  • FIG9 shows a third flow chart of a service processing method in an embodiment of the present disclosure
  • FIG10 is a schematic diagram showing the structure of a service processing device according to an embodiment of the present disclosure.
  • FIG. 11 is a schematic structural diagram of an electronic device in an embodiment of the present disclosure.
  • SFC service function path
  • the present disclosure provides a service processing method, according to the service to be processed received at the interface of the service function chain SFC, the computing power resource parameter corresponding to the service to be processed is determined; the computing power resource parameter is at least one parameter corresponding to the computing power resource that needs to be used when the service to be processed is processed by one or more service functions SF in the SFC, according to the computing power resource parameter, the computing power resources of one or more SFs in the computing power resource occupation period are pre-occupied, the allocation method of the computing power resources that the service to be processed needs to use in the computing power resource occupation period is determined, and the allocation method is sent to one or more SFs through a routing protocol, so that one or more SFs process the service to be processed according to the allocation method.
  • a new mechanism is introduced, which can not only realize the perception of computing power resources by SFC and determine the computing power resource parameters of the accessed service to be processed, but also can pre-occupy the computing power resources of each SF in SFC in advance through the perception of computing power resources, determine the allocation method of computing power resources of the service to be processed, effectively utilize SFC processing resources, improve the service quality and service availability of SFC from the network level, and improve the scalability of the service chain and the utilization rate of SF computing power.
  • FIG. 1 is an application scenario of a business processing method provided by an embodiment of the present disclosure.
  • SFC computing power network 100 includes: a controller 101, a forwarder (Service Function Forwarder, SFF) 102, a classifier 103, and a series of SFs.
  • SFF Service Function Forwarder
  • SFC includes a series of service functions (or service function instances) residing on each network node, that is, SFC defines a series of SFs and the processing order that need to be processed for messages after service classification, and can support various routing protocols (Underlay) such as IPv4, IPv6, SFC, mpls, and vxlan.
  • SFC may include one or more service function paths (SFPs) along the SFC.
  • SFPs service function paths
  • the controller 101 may be configured to determine a path for processing pending services. For example, a service function path (SFP).
  • SFP service function path
  • the controller 101 may also be configured to monitor the status information of the classifier 103, the forwarder 102, and a series of SFs.
  • the controller 101 may also be configured to establish the determined path into the classifier 103 and the forwarder 102.
  • the controller 101 may also be configured to manage the processing of pending services according to various policies or agreed services.
  • the classifier 103 is configured to add a network service header NSH to the message corresponding to the service to be processed, mark the service function path SFP information including the service path identifier SPI and service index (Service Index, SI) information, and forward it to the forwarder 102.
  • NSH Network Service header
  • SI Service Index
  • the forwarder 102 is responsible for guiding the traffic in a defined order in and out of a series of service functions SF or other network elements processed by the forwarder 102 according to the encapsulated SFC new message in the SFC.
  • SF can be a physical or virtual network element with limited processing capabilities, which can be understood as computing power, IO, storage, bandwidth, etc. SF can be expanded when its processing capacity is insufficient to handle business.
  • the NSH message header needs to be processed through a proxy device (Proxy).
  • SPI uniquely marks a service chain path. After the SPI is determined, the forwarder 102 determines which SF the data needs to be forwarded to based on the service index, and forwards it based on the specific next-hop address queried, traversing the predetermined, fixed-order serial SF service function grouping for processing, which is difficult to flexibly adjust according to the actual computing power load of the SF.
  • the controller 101 in the SFC receives the service to be processed through the interface, it sends three groups of message classification strategies to the classifier 103 at the user traffic entrance, corresponding to the SPI1, SPI2, and SPI3 service function chain processing respectively.
  • 1 in Figure 1 represents SPI1
  • 2 represents SPI2
  • 3 represents SPI3.
  • SI value corresponding to the SPI number the corresponding group of SFs is traversed in descending order.
  • the controller 101 needs to obtain the SF 3.1 performance overload signal through the virtualization infrastructure manager or the host performance monitoring system, and confirm that SF3.1 has no expansion resources. Then, the controller 101 finds that SF3.2 has the same functions as SF3.1 and is available. According to the load conditions of each SFC, the controller 101 chooses to cancel the service chain SPI1 passing through SF3.1, and re-arranges the SPI1 path through SF3.2.
  • the adjusted SPI1 is shown in Figure 2.
  • a business processing method is provided in an embodiment of the present disclosure.
  • the method can be executed by any electronic device with computing and processing capabilities.
  • the electronic device is taken as a server as an example.
  • FIG3 is a flowchart of a service processing method in an embodiment of the present disclosure. As shown in FIG3 , the service processing method provided in an embodiment of the present disclosure includes the following steps:
  • S302 Determine computing power resource parameters corresponding to the business to be processed according to the business to be processed received at the interface of the business function chain SFC.
  • the computing power resource parameter is at least one parameter corresponding to the computing power resources required to be used when the to-be-processed service is processed by one or more service functions SF in the SFC.
  • the computing resource occupation period is the preset period for the controller to occupy the computing resources of SF during the process of configuring the policy. For example, if the business to be processed starts processing at 5:30, the controller can occupy the computing resources of SF for the period of 5:30-5:31, which can be expressed as the computing resource occupation period.
  • the SFC cannot perceive the computing resource information of the SF, and cannot specifically determine how much computing resources are needed to complete the processing of the received pending business, the problem can only be discovered when the processing quality of the pending business is deteriorated through the monitoring system. Based on this, the present disclosure provides a feasible embodiment, which is as follows:
  • the computing power resource parameters are determined as follows:
  • the computing power resource parameters are expanded according to the routing protocol, and the computing power resource parameters are sent to one or more SFs, so that one or more SFs upload computing power resource information according to the computing power resource parameters; when the computing power resource information is used by one or more SFs to process business, the computing power resource parameters corresponding to the business to be processed are determined according to the computing power resource parameters, the usage of the computing power resources/the remaining available computing power resources returned, and the computing power resource information.
  • the computing power resource parameter is a method of expressing the computing power resources required to process the business in the form of parameters.
  • Ways to extend computing resource parameters include: routing protocol extension through protocol message body TLV or probe request option.
  • SFC routing protocol extends computing resource parameters through TLV or option.
  • the computing power resource parameters are sent to each SF, so that the SF with publishing/receiving capabilities regularly provides the SFC routing protocol with computing power resource information that is not related to the SFC. It can be understood that when the SF processes pending services, the computing power resources are uploaded to the SFC routing protocol in the form of computing power resource parameters. Through the computing power resource information uploaded by a large number of SFs, the SFC controller can express the received pending services in the form of computing power resource parameters according to the computing power resource information when it receives the processing services in the future, so that the SFC computing power network can achieve specific perception of computing power.
  • the SF injects computing resource information of the SF into the SFC routing protocol, which may include available resource data of the VNF, VM or host where the SF is located.
  • the above computing resource information can be distributed to the controller, forwarder or classifier through the SFC routing protocol, and the controller can also receive it through BGP LS or restful interface.
  • computing resource parameters are sent down through the routing protocol, and the computing resource information is uploaded by SF. All network elements involved need clock synchronization.
  • S304 According to the computing power resource parameters, pre-occupy the computing power resources of one or more SFs within the computing power resource occupation period, and determine the allocation method of the computing power resources required for the to-be-processed business within the computing power resource occupation period.
  • the service processing method provided by the embodiment of the present disclosure is described by taking SPI1, SPI2, and SPI3 in Figure 1 as an example. All of them are cases where SPI1, SPI2, and SPI3 process the pending services, but Figure 4 shows another SFC computing power network 200.
  • the SFC computing power network 200 includes a controller 201, a forwarder 202, a classifier 203, and a series of SFs.
  • the computing resource parameters in the above content may include: computing resource occupation period, SFC service path identifier SPI number, target SF index address, memory quantity and duration of SF occupied during the computing resource occupation period, number of jobs processed by the central processing unit CPU, estimated median, CPU time/each job, memory output.
  • Figure 5 shows a schematic diagram of a periodic computing resource representation. It includes memory quantity-duration, median CPU time, number of requests, etc.
  • the specific processing includes:
  • the controller in the SFC computing network determines the computing resource parameters of the business to be processed.
  • the controller can mark an SFC as expected to occupy the computing resources of one or more SFs within a fixed period, and can pre-occupy the computing resources of one or more SFs within the computing resource occupation period.
  • the controller directly publishes the computing resource parameters to SF through the routing protocol to perform the pre-occupancy operation.
  • the computing resources of SF are pre-occupied by sending the computing resource parameters to each SF by the controller.
  • the computing resources of SF involved in SPI1 are pre-occupied.
  • the process of pre-occupancy may include the following two situations:
  • the overload signal is a signal generated when the computing power resources pre-occupied by any SF in the computing power resource occupation period are greater than the preset computing power resource threshold.
  • the overload signal includes information about which computing power resource occupation period has insufficient computing power resources.
  • SF3.1 For example, if in the process of pre-occupancy, taking SF3.1 as an example, since the above-mentioned SPI1, SPI2, and SPI3 all pass through SF3.1, therefore, in the process of pre-occupancy of the computing power resources of the SF involved in SPI1, SF3.1 is likely to have insufficient computing power resources because the computing power resources have been occupied by SPI2 and SPI3 in the computing power resource occupation period. Therefore, the controller can receive the overload signal sent back by SF3.1.
  • SF may send an overload cycle or overload signal. After receiving the overload signal, the controller will not continue to occupy or add new services in the SF. It can be understood that the controller will not allocate a new service function path SFP to the SF.
  • the controller of the SFC computing network can allocate the computing resources of the pending services originally occupied in SF3.1 to SF3.2, and determine the specific computing resource allocation method. Since the controller marks the service function chain with the service path identifier SPI1, it can be determined that the allocation method of SPI1 has changed due to the overload of SF3.1.
  • S306 Send the allocation mode to one or more SFs through the routing protocol, so that the one or more SFs process the pending services according to the allocation mode.
  • the controller can send the determined allocation method to the forwarder, classifier and each SF involved in SPI1 through the routing protocol, and notify each SF of the specific computing resource occupation period and the specific computing resource parameters of the service to be processed, so that each SF reserves the computing resources pre-occupied by the controller in the computing resource occupation period to process the service to be processed.
  • the entire pre-occupancy process has no effect on SPI2 and SPI3.
  • the steps S1, S2, S3, etc. shown in FIG4 are all steps executed by the controller, and S4 is the SF3.1 control.
  • the controller determines SF3.2 with the same service function as SF3.1, and pre-occupies SF3.2, pre-allocates the computing power resources required for the service to be processed to SF3.2, and finally determines the allocation method, and sends the determined allocation method to the classifier, forwarder and each SF to process the service to be processed.
  • no redundant description is given for various different situations.
  • the computing resources are allowed to be occupied in excess and the deficit is repaid in adjacent cycles.
  • the computing resources of this computing resource occupation cycle can be occupied in advance, and the pending services in the subsequent computing resource occupation cycle can be processed in advance.
  • the computing power resource parameters are effectively determined through the perception of the computing power resources by the SFC computing power network, and the computing power resource parameters are pre-occupied for each SF.
  • This method can effectively ensure that the computing power resources of the SF will not be overloaded during the process of the SF processing the business to be processed, and ensure that the business chain can work normally to complete the processing of the business to be processed.
  • This method can be called an explicit SFC computing power strategy, which is established by the controller in the SFC computing power network and sent to each SF, forwarder and classifier involved in the business function chain through the routing protocol.
  • this explicit SFC computing power strategy is sent through the routing protocol, and the entire process is to notify each SF through communication, which will not change the original SFC mechanism, and will not change the processing of the data packet or data packet set where the business to be processed is located by the controller and the classifier.
  • any SF when in the SFC computing power network, the controller needs to pre-occupy multiple business function chains on the SF, and each business function chain corresponds to an allocation method, all SFs involved in the business function chains can identify the corresponding business function chains.
  • the SF can identify which business function chain occupied the SF in which computing power resource occupation cycle, and other business function chains occupied the SF in which computing power resource occupation cycle. Any SF can identify the business function chain.
  • the communication between the controller and the SF requires the SF to have the ability to publish, receive and identify.
  • the publishing ability is the ability of the SF to publish computing resource information according to the routing protocol and to publish overload signals.
  • the receiving ability is the ability to receive information through the routing protocol.
  • the identification ability is that for any SF, it can identify which business function chain is passing through the SF at this time, and determine the business performed by this business function chain in the SF and the computing resources pre-occupied, etc. For non-computing power-aware network elements, it is sufficient to transparently transmit information.
  • SFs with the above capabilities can register with network elements such as OVS/vswitch routing, and regularly publish SFC-independent computing power information to the intra-domain routing protocol according to the mode specified by the computing power policy.
  • the present disclosure provides an implicit SFC computing power strategy in addition to the explicit SFC computing power strategy in the above service processing method, as shown in FIG6 , which includes the following steps:
  • the remaining computing power resource indication information indicates the remaining computing power resources of the SF within the computing power resource occupation period, which is returned in real time when one or more SFs in the SFC are processing pending services.
  • the computing power resource adjustment indication information is indication information for instructing the forwarder to adjust the SF for processing the pending business according to the remaining computing power resources of the SF within the computing power resource occupation period returned in real time when one or more SFs are processing the pending business.
  • S606 Send the computing power resource adjustment indication information to the forwarder, and send the remaining computing power resource indication information to one or more SFs through the routing protocol, so that the one or more SFs and the forwarder can process the pending service.
  • the process of adjusting the computing power of the SPI1 path by using the implicit SFC computing power strategy is shown in FIG. 7.
  • the controller receives a service to be processed at the interface, the controller performs a normal configuration of the service function chain.
  • the remaining computing power resource indication information is configured to instruct one or more SFs in the SFC to return the remaining computing power resources of the SF in the computing power resource occupation period to the controller or forwarder in real time when processing the pending business. That is, it can be understood as making the SF publish the remaining computing power resource percentage information in the computing power resource occupation period. It can also instruct each SF to return the percentage information of the computing power resources occupied in the computing power resource occupation period in real time.
  • the computing power resource adjustment indication information indicates that the forwarder can execute according to normal logic when the remaining computing power resources received from the SF meet the computing power resource constraint conditions. If the remaining computing power resources received from the SF do not meet the computing power resource constraint conditions, it is necessary to report or stop sending new pending services to the SF, or search whether there is an SF with the same business function as the SF based on the address of the SF, and send the new pending services originally forwarded to the SF to the SF with the same business function as the SF.
  • the above computing power resource constraint conditions can be that the remaining computing power resources of the SF are greater than or equal to 15%, etc. This setting of computing power resources can set different thresholds according to different cycles to meet the processing requirements of the business function chain for pending services.
  • the controller configures the computing power resource adjustment indication information to be sent to the forwarder, so that after receiving the remaining computing power resources of SF, the forwarder can balance the computing power resources of SF according to the remaining computing power resources. For example, when SF3.1 processes pending services in a certain cycle and returns the remaining computing power resources to the forwarder in real time, if the forwarder receives the remaining computing power resources sent by SF3.1 as 5%, it can balance autonomously.
  • each SF refers to the forwarder, which indicates uploading the remaining computing resources to the forwarder.
  • the forwarder After the forwarder receives the remaining computing resources of each SF, it can perform the next step of processing based on the remaining computing resources.
  • the pending services of SF3.1 in SPI1 are gradually unloaded to SF3.2 until the remaining computing power resources sent by SF3.1 to the forwarder within a certain period meet the computing power resource constraints.
  • the controller actually did not send out instructions to adjust the SPI1 path, nor did it reconfigure a new SPI path, and because SF3.1 and SF3.2 use equivalent addresses. Therefore, for the entire SFC computing power network, the SPI1 path has not been actually adjusted. It is only that when the computing power resources of SF3.1 are insufficient, the forwarder uses the computing power resources of SF3.2 for incremental deployment. SPI1, SPI2, and SPI3 are not affected, and the computing power resources of SF3.1 and 3.2 are normal.
  • the SPI1 path is adjusted from SF3.1 to SF3.2, and the pending service is processed by SF3.2.
  • the dotted line 1 represents the original SPI1 path, and the solid line 1 represents the SPI1 path after adjustment by the repeater.
  • the controller after receiving the service to be processed, configures the SPI path of the service to be processed in an existing manner and sends it to the classifier so that the SF involved in the SPI path can process the service to be processed.
  • the implicit SFC computing power strategy can essentially be understood as a special instruction to the forwarder and each SF through the routing protocol during the normal processing of the service to be processed, so that the forwarder can manage the traffic of the SPI and load balance each SF.
  • This implementation mode of the present disclosure can handle the SF computing power overload situation in the SFC computing power network at the forwarder through the above-mentioned implicit SFC computing power strategy, without the need for additional adjustment of the SPI path, thereby reducing the SFC quality degradation and end-to-end SPI reconstruction requirements caused by instantaneous/long-term fluctuations in SF computing power resources, improving the stability of the service chain, and enhancing the affinity between computing power and the SFC network.
  • the SFC computing network 200 shown in the present disclosure has a specific structural diagram as shown in FIG8 , which includes a controller 201, a forwarder 202, a classifier 203, and a series of SFs. To be handled by the agent.
  • the structure can be divided into the following:
  • the SFC computing network 200 can be divided into a control plane and a forwarding plane.
  • the control plane includes a controller 201
  • the forwarding plane includes a forwarder 202, a classifier 203, and a series of SFs.
  • the controller 201 includes a topology information module 2011 , a path calculation module 2012 , a computing power strategy configuration module 2013 and a routing computing power expansion module 2014 .
  • the path calculation module 2012 is mainly configured to configure a path for processing the pending service, and the path includes multiple SFs.
  • the computing power strategy configuration module 2013 is configured to configure the explicit SFC computing power strategy and implicit SFC computing power strategy mentioned in the above content.
  • the routing computing power expansion module 2014 is configured to receive computing power resource information distributed by the SF through the routing protocol, and publish the explicit SFC computing power strategy and implicit SFC computing power strategy configured by the computing power strategy configuration module 2013 through the routing protocol. It is also configured to publish computing power resource parameters and computing power resource constraints in the implicit SFC computing power strategy.
  • the forwarder 202 in the SFC computing power network 200 in the present disclosure can also be configured to adjust the computing power resource indication information sent by the controller 201.
  • the traffic or job, request
  • the traffic is unloaded to other SFs with the same function according to the available computing power ratio by adjusting the routing protocol computing power weight.
  • FIG9 shows a service processing method that uses the explicit SFC computing power strategy and the implicit SFC computing power strategy together, as shown in FIG9 , including the following steps:
  • S902 Determine computing power resource parameters corresponding to the business to be processed according to the business to be processed received at the interface of the business function chain SFC.
  • S904 According to the computing power resource parameters, pre-occupy the computing power resources of one or more SFs within the computing power resource occupation period, and determine the allocation method of the computing power resources required for the to-be-processed business within the computing power resource occupation period.
  • S910 Send computing resource adjustment indication information to the forwarder through the routing protocol, and send the allocation method and remaining computing resource indication information to one or more SFs through the routing protocol, so that one or more SFs and the forwarder process the pending services.
  • the business processing method based on the business function chain in this disclosure introduces business function chain computing power perception, publishing and computing power policy execution, computing power routing and other capabilities into the existing SFC computing power network architecture, and adds computing power resource parameters. On the basis of maintaining the compatibility of the business function chain forwarder, it solves the problem of insufficient flexibility of the existing SFC computing power and improves the utilization rate of SF.
  • the service processing pipeline of the SFC can be partially adjusted according to the implicit SFC computing power strategy and the computing power resource constraints of the SF without changing the entire SFC forwarding path.
  • the computing power resource perception methods involved in this disclosure are all published through routing protocols and processed through communication, without changing the existing SFC basic forwarding processing and proxy mechanism.
  • the SFC path re-arrangement demand and service quality degradation caused by computing power factors can also be reduced, and the computing power-driven SFC service upgrade can be accelerated.
  • the present disclosure also provides a service processing device, such as the following embodiment. Since the principle of solving the problem in the device embodiment is similar to that in the above method embodiment, the implementation of the device embodiment can refer to the implementation of the above method embodiment, and the repeated parts will not be repeated.
  • Figure 10 shows a structural schematic diagram of a business processing device in an embodiment of the present disclosure.
  • the business processing device 100 includes: a determination unit 1001, configured to determine the computing power resource parameters corresponding to the pending business according to the pending business received at the interface of the business function chain SFC; the computing power resource parameter is at least one parameter corresponding to the computing power resources that need to be used when the pending business is processed by one or more business functions SF in the SFC; a pre-occupancy unit 1002, configured to pre-occupy the computing power resources of one or more SFs within the computing power resource occupation period according to the computing power resource parameters, and determine the allocation method of the computing power resources that need to be used by the pending business within the computing power resource occupation period; a sending unit 1003, configured to send the allocation method to one or more SFs through a routing protocol, so that one or more SFs process the pending business according to the allocation method.
  • the determination unit 1001 is further configured to: expand computing power resource parameters according to the routing protocol, and send the computing power resource parameters to one or more SFs, so that one or more SFs upload computing power resource information according to the computing power resource parameters;
  • the computing power resource parameters are a way of expressing the computing power resources required to process the business in the form of parameters;
  • the computing power resource information is the usage of the computing power resources/remaining available computing power resources returned according to the computing power resource parameters when one or more SFs process the business; determine the computing power resource parameters corresponding to the business to be processed according to the business to be processed and the computing power resource information.
  • the pre-occupancy unit 1002 is further configured to: if all the computing power resource parameters corresponding to the pending business are allocated to one or more SFs, and no overload signal is received, the computing power resources required for the pending business to be processed during the computing power resource occupation period are allocated, and the allocation method is determined; or, if an overload signal is received during the pre-occupancy operation, the computing power resources of any SF are stopped from being occupied; wherein the overload signal is a signal generated when the computing power resources pre-occupied by any SF during the computing power resource occupation period are greater than a preset computing power resource threshold; the computing power resources of the SF having the same business function as any SF are pre-occupied until the computing power resources required for the pending business to be processed during the computing power resource occupation period are allocated, and no overload signal is received, and the allocation method is determined.
  • the business processing device 100 also includes: a balancing unit, which is configured to configure remaining computing power resource indication information according to the pending business received at the interface of the business function chain SFC; the remaining computing power resource indication information is the remaining computing power resources of the SF within the computing power resource occupation period returned in real time by one or more SFs in the SFC when processing the pending business; configure computing power resource adjustment indication information; wherein the computing power resource adjustment indication information is the indication information of the SF that processes the pending business according to the remaining computing power resources of the SF within the computing power resource occupation period returned in real time by one or more SFs when processing the pending business; send the computing power resource adjustment indication information to the forwarder, and send the remaining computing power resource indication information to one or more SFs through the routing protocol, so that one or more SFs and the forwarder process the pending business.
  • a balancing unit which is configured to configure remaining computing power resource indication information according to the pending business received at the interface of the business function chain SFC; the remaining computing power resource indication information is
  • the service processing device 100 further includes: a pre-occupancy balancing unit, configured to configure remaining computing power resource indication information; the remaining computing power resource indication information indicates the remaining computing power resources of the SF within the computing power resource occupation period returned in real time by one or more SFs in the SFC when processing the pending service; configuring computing power resource adjustment indication information; wherein the computing power resource adjustment indication information indicates the forwarder to adjust the indication information of the SF processing the pending service according to the remaining computing power resources of the SF within the computing power resource occupation period returned in real time by one or more SFs when processing the pending service; and sending the allocation mode to one or more SFs through the routing protocol.
  • the method includes sending computing resource adjustment indication information to a forwarder, and sending allocation mode and remaining computing resource indication information to one or more SFs through a routing protocol, so that one or more SFs and the forwarder can process the pending services.
  • the examples and application scenarios implemented by the above units and corresponding steps are the same, but are not limited to the contents disclosed in the above method embodiments. It should be noted that the above modules as part of the device can be executed in a computer system such as a set of computer executable instructions.
  • the electronic device 1100 according to this embodiment of the present disclosure is described below with reference to Fig. 11.
  • the electronic device 1100 shown in Fig. 11 is only an example and should not bring any limitation to the functions and scope of use of the embodiment of the present disclosure.
  • the electronic device 1100 is presented in the form of a general computing device.
  • the components of the electronic device 1100 may include, but are not limited to: the at least one processing unit 1110, the at least one storage unit 1120, and a bus 1130 connecting different system components (including the storage unit 1120 and the processing unit 1110).
  • the storage unit stores a program code, and the program code can be executed by the processing unit 1110, so that the processing unit 1110 executes the steps described in the above "Exemplary Method" section of this specification according to various exemplary embodiments of the present disclosure.
  • the processing unit 1110 can execute the following steps in the above method embodiment, for example: according to the pending business received at the interface of the business function chain SFC, determine the computing power resource parameter corresponding to the pending business; the computing power resource parameter is at least one parameter corresponding to the computing power resource that needs to be used when the pending business is processed by one or more business functions SF in the SFC; according to the computing power resource parameter, pre-occupy the computing power resources of one or more SFs in the computing power resource occupation period, and determine the allocation method of the computing power resources that the pending business needs to use in the computing power resource occupation period; send the allocation method to one or more SFs through the routing protocol, so that one or more SFs process the pending business according to the allocation method.
  • the storage unit 1120 may include a readable medium in the form of a volatile storage unit, such as a random access memory unit (RAM) 11201 and/or a cache memory unit 11202 , and may further include a read-only memory unit (ROM) 11203 .
  • RAM random access memory
  • ROM read-only memory
  • the storage unit 1120 may also include a program/utility 11204 having a set (at least one) of program modules 11205, such program modules 11205 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment.
  • program modules 11205 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment.
  • Bus 1130 may represent one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.
  • the electronic device 1100 may also communicate with one or more external devices 1140 (e.g., keyboards, pointing devices, Bluetooth devices, etc.), one or more devices that enable a user to interact with the electronic device 1100, and/or any device that enables the electronic device 1100 to communicate with one or more other computing devices (e.g., routers, modems, etc.). Such communication may be performed via an input/output (I/O) interface 1150.
  • the electronic device 1100 may also communicate with one or more networks (e.g., a local area network (LAN), a wide area network (WAN), and/or a public network, such as the Internet) via a network adapter 1160.
  • networks e.g., a local area network (LAN), a wide area network (WAN), and/or a public network, such as the Internet
  • the network adapter 1160 communicates with other modules of the electronic device 1100 via a bus 1130.
  • other hardware and/or software modules may be used in conjunction with the electronic device 1100, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data Data backup storage system, etc.
  • the technical solution according to the implementation of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the implementation of the present disclosure.
  • a non-volatile storage medium which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.
  • a computing device which can be a personal computer, a server, a terminal device, or a network device, etc.
  • the process described above with reference to the flowchart can be implemented as a computer program product or a computer program, which includes computer instructions, and the computer instructions are stored in a computer-readable storage medium.
  • the processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes any of the above-mentioned business processing methods.
  • a computer-readable storage medium is also provided, which may be a readable signal medium or a readable storage medium.
  • a program product capable of implementing the above method of the present disclosure is stored thereon.
  • various aspects of the present disclosure may also be implemented in the form of a program product, which includes a program code, and when the program product is run on a terminal device, the program code is used to cause the terminal device to execute the steps according to various exemplary implementations of the present disclosure described in the above “Exemplary Method” section of this specification.
  • Computer-readable storage media in the present disclosure may include, but are not limited to, an electrical connection having one or more conductors, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
  • RAM random access memory
  • ROM read-only memory
  • EPROM or flash memory erasable programmable read-only memory
  • CD-ROM compact disk read-only memory
  • CD-ROM compact disk read-only memory
  • magnetic storage device or any suitable combination of the foregoing.
  • a computer readable storage medium may include a data signal propagated in baseband or as part of a carrier wave, wherein a readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above.
  • a readable signal medium may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.
  • the program code contained on the computer-readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.
  • the program code for performing the operations of the present disclosure may be written in any combination of one or more programming languages, including object-oriented programming languages such as Java, C++, etc., and conventional procedural programming languages such as "C" or similar programming languages.
  • the program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server.
  • the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., using an Internet service provider to connect through the Internet).
  • LAN local area network
  • WAN wide area network
  • steps of the method in the present disclosure are described in a specific order in the drawings, this does not require or imply that the steps must be performed in this specific order, or that all the steps shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, and multiple steps may be combined into one step. step execution, and/or decompose a step into multiple steps for execution, etc.
  • the technical solution according to the implementation mode of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which can be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the implementation mode of the present disclosure.
  • a non-volatile storage medium which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.
  • a computing device which can be a personal computer, a server, a mobile terminal, or a network device, etc.

Landscapes

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

Abstract

一种业务处理方法、装置、设备、介质及程序产品，涉及云计算业务服务链技术领域，根据在业务功能链SFC的接口处接收到的待处理业务，确定待处理业务对应的算力资源参数，根据算力资源参数，对一个或者多个SF在算力资源占用周期内的算力资源进行预先占用操作，确定待处理业务在算力资源占用周期内需要使用的算力资源的分配方式，通过路由协议将分配方式下发至一个或者多个SF中，以使一个或者多个SF根据分配方式对待处理业务进行处理。在遵循现有SFC网络服务的基础上，通过路由协议引入新的机制，实现SFC对算力资源的感知，通过待处理业务的算力资源参数，对SFC中的每个SF的算力资源提前进行预占，从网络层面提高SFC的业务质量。

Description

业务处理方法、装置、设备、介质及程序产品
相关申请的交叉引用
本公开要求于2022年8月24日提交的申请号为202211021129.1、名称为“业务处理方法、装置、电子设备及存储介质”的中国专利申请的优先权，该中国专利申请的全部内容通过引用全部并入本文。
技术领域
本发明涉及云计算业务服务链技术领域，尤其涉及一种业务处理方法、装置、设备、介质及程序产品。
背景技术
随着互联网技术的不断进步，网络运营商开始向业务功能链或业务链接转变。
在这种方法中，每个受支持的业务可以建模为一个或多个业务功能(Service Function，SF)的组合，其中，每个业务功能的作用是对网络数据包或数据包集合执行特定任务。对于给定的业务，按顺序应用业务功能，即以指定方式引导网络流量通过这些业务功能。这种技术称为业务功能链接，这些链通常称为业务功能链(Service Function Chaining，SFC)。
业务功能链(包括业务功能链所包含的业务功能)由静态配置决定。若通过业务功能链处理数据包的过程中，某个SF出现算力瓶颈或者出现故障时，则需要从头重新编排和更改链，绕过出现问题的业务功能，为降低特定的SF的负载就需调整个SFC，开销较大，缺乏灵活性。
发明内容
本公开提供一种业务处理方法、装置、设备、介质及程序产品，至少在一定程度上克服相关技术中某个SF出现算力瓶颈或者出现故障时，则需要从头重新编排和更改链，开销大，缺乏灵活性的问题。
根据本公开的第一方面，提供一种业务处理方法，包括：根据在业务功能链SFC的接口处接收到的待处理业务，确定所述待处理业务对应的算力资源参数；所述算力资源参数为表征所述待处理业务被所述SFC中的一个或者多个业务功能SF处理时，需要使用的算力资源对应的至少一个参数；根据所述算力资源参数，对所述一个或者多个SF在算力资源占用周期内的算力资源进行预先占用操作，确定所述待处理业务在所述算力资源占用周期内需要使用的算力资源的分配方式；通过路由协议将所述分配方式下发至所述一个或者多个SF中，以使所述一个或者多个SF根据所述分配方式对所述待处理业务进行处理。
在一些实施例中，所述算力资源参数包括以下至少一种：算力资源占用周期、SFC业务路径标识符SPI编号、目标SF索引地址、算力资源占用周期内占用SF的内存数量和时长、中央处理器CPU处理的作业数、预估中位数、CPU时间/每次作业、内存输出量。
在一些实施例中，所述根据在业务功能链SFC的接口处接收到的待处理业务，确定所述待处理业务对应的算力资源参数，包括：根据所述路由协议扩展算力资源参数，并将所述算力资源参数下发至所述一个或者多个SF，以使所述一个或者多个SF根据所述算力资源参数，上传算力资源信息；所述算力资源参数为将处理业务时，所需要使用的算力资源通过参数的形式表述的表述方式；所述算力资源信息为所述一个或者 多个SF处理业务时，根据所述算力资源参数，返回的算力资源的使用情况/剩余可用算力资源的情况；根据所述待处理业务，以及所述算力资源信息，确定所述待处理业务对应的算力资源参数。
在一些实施例中，所述扩展算力资源参数的方式包括：所述路由协议通过协议消息体TLV或探测请求option进行扩展。
在一些实施例中，所述根据所述算力资源参数，对所述一个或者多个SF在算力资源占用周期内的算力资源进行预先占用操作，确定所述待处理业务在所述算力资源占用周期内需要使用的算力资源的分配方式，包括：若将所述待处理业务对应的算力资源参数全部分配至所述一个或者多个SF，且未收到过载信号，则所述待处理业务在所述算力资源占用周期内需要使用的算力资源分配完成，确定所述分配方式；或者，若在所述预先占用操作的过程中，接收到任意一个SF反馈的过载信号，则停止对所述任意一个SF的算力资源进行占用；其中，所述过载信号为所述任意一个SF在所述算力资源占用周期中，被预先占用的算力资源大于预设算力资源阈值生成的信号；对与所述任意一个SF具备相同业务功能的SF的算力资源进行预先占用操作，直至所述待处理业务在所述算力资源占用周期内需要使用的算力资源分配完成，且未收到过载信号，确定所述分配方式。
在一些实施例中，所述方法还包括：根据在业务功能链SFC的接口处接收到的待处理业务，配置剩余算力资源指示信息；所述剩余算力资源指示信息为指示所述SFC中的一个或者多个SF在处理所述待处理业务时，实时返回的在所述算力资源占用周期内SF的剩余算力资源；配置算力资源调整指示信息；其中，所述算力资源调整指示信息为指示转发器根据所述一个或者多个SF在处理所述待处理业务时，实时返回的在所述算力资源占用周期内SF的剩余算力资源，调整处理所述待处理业务的SF的指示信息；将所述算力资源调整指示信息下发至所述转发器，以及通过路由协议将所述剩余算力资源指示信息下发至所述一个或者多个SF中，以使所述一个或者多个SF和所述转发器对所述待处理业务进行处理。
在一些实施例中，所述确定所述待处理业务在所述算力资源占用周期内需要使用的算力资源的分配方式之后，所述方法还包括：配置剩余算力资源指示信息；所述剩余算力资源指示信息为指示所述SFC中的一个或者多个SF在处理所述待处理业务时，实时返回的在所述算力资源占用周期内SF的剩余算力资源；配置算力资源调整指示信息；其中，所述算力资源调整指示信息为指示转发器根据所述一个或者多个SF在处理所述待处理业务时，实时返回的在所述算力资源占用周期内SF的剩余算力资源，调整处理所述待处理业务的SF的指示信息；通过路由协议将所述分配方式下发至所述一个或者多个SF中，包括：将所述算力资源调整指示信息下发至所述转发器，以及通过路由协议将所述分配方式和所述剩余算力资源指示信息下发至所述一个或者多个SF中，以使所述一个或者多个SF和所述转发器对所述待处理业务进行处理。
根据本公开的第二方面，本公开中的实施例提供一种业务处理装置，包括：确定单元，设置为根据在业务功能链SFC的接口处接收到的待处理业务，确定所述待处理业务对应的算力资源参数；所述算力资源参数为表征所述待处理业务被所述SFC中的一个或者多个业务功能SF处理时，需要使用的算力资源对应的至少一个参数；预占单元，设置为根据所述算力资源参数，对所述一个或者多个SF在算力资源占用周期内的算力资源进行预先占用操作，确定所述待处理业务在所述算力资源占用周期内需要使用的算力资源的分配方式；下发单元，设置为通过路由协议将所述分配方式下发至所述一个或者多个SF中，以使所述一个或者多个SF根据所述分配方式对所述待处理业务进行处理。
根据本公开的第三方面，本公开实施例提供一种电子设备，包括：处理器；以及 存储器，设置为存储所述处理器的可执行指令；其中，所述处理器配置为经由执行所述可执行指令来执行如上所述的方法。
根据本公开的第四方面，提供一种计算机可读存储介质，所述计算机可读存储介质存储有计算机指令，所述指令被处理器执行如上所述的方法。
根据本公开的第五方面，还提供了一种计算机程序产品，包括计算机程序，所述计算机程序被处理器执行时实现如上所述的方法。
本公开的实施例所提供的一种业务处理方法、装置、设备、介质及程序产品，根据在业务功能链SFC的接口处接收到的待处理业务，确定待处理业务对应的算力资源参数；算力资源参数为表征待处理业务被SFC中的一个或者多个业务功能SF处理时，需要使用的算力资源对应的至少一个参数，根据算力资源参数，对一个或者多个SF在算力资源占用周期内的算力资源进行预先占用操作，确定待处理业务在算力资源占用周期内需要使用的算力资源的分配方式，通过路由协议将分配方式下发至一个或者多个SF中，以使一个或者多个SF根据分配方式对待处理业务进行处理。通过预占的方式，在SFC中的一个或者多个SF处理待处理业务时，提前将每个SF的算力资源分配好，在控制器上引入新的机制，不仅可以实现SFC对算力资源的感知，确定接入的待处理业务的算力资源参数，可以在对算力资源感知的基础上根据SFC所需的算力资源对SF进行约束，通过资源标识符对现有的业务路径标识符(Service Path Identifier，SPI)处理管线进行局部灵活调整，适应算力性能差异化需求，提高业务链SF整体利用效率。在遵循现有SFC网络服务报头(Network Service Header，NSH)等格式和基本转发方式基础上，有效利用SFC处理资源，从网络层面提高SFC的业务质量，业务可用性，提高业务链扩展性和SF算力利用率。
进一步地，本公开中还根据在业务功能链SFC的接口处接收到的待处理业务，配置剩余算力资源指示信息；剩余算力资源指示信息为指示SFC中的一个或者多个SF在处理待处理业务时，实时返回的在算力资源占用周期内SF的剩余算力资源，配置算力资源调整指示信息；其中，算力资源调整指示信息为指示转发器根据一个或者多个SF在处理待处理业务时，实时返回的在算力资源占用周期内SF的剩余算力资源，调整处理待处理业务的SF的指示信息，将算力资源调整指示信息下发至转发器，以及通过路由协议将剩余算力资源指示信息下发至一个或者多个SF中，以使一个或者多个SF和转发器对待处理业务进行处理。通过算力资源指示信息，和指示转发器对算力资源调整，使得每个SF在处理待处理业务的过程中实时反馈给转发器的方式，自主刷新局部SFC的分支处理逻辑，而无需重新频繁重编排SFC，就可以将高算力开销的SF的负载进行卸载到其他SF中，可以降低重新编排SFC路径的开销。
还可以同时通过算力资源预占和实时反馈的方式，指示每个SF和转发器对待处理业务进行处理，有效的提高SFC技术的应用效率和场景适应性。
附图说明
为了更清楚地说明本公开实施例或现有技术中的技术方案，下面将对实施例或现有技术描述中所需要使用的附图作一简单地介绍，显而易见地，下面描述中的附图仅仅是本公开的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动性的前提下，还可以根据这些附图获得其他的附图。
图1示出本公开实施例中一种业务处理方法的应用场景之一；
图2示出本公开实施例中一种业务处理方法的应用场景之二；
图3示出本公开实施例中一种业务处理方法的流程示意图之一；
图4示出本公开实施例中一种业务处理方法的应用场景之三；
图5示出本公开实施例中一种周期性算力资源表述示意图；
图6示出本公开实施例中一种业务处理方法的流程示意图之二；
图7示出本公开实施例中一种业务处理方法的应用场景之四；
图8示出本公开实施例中一种SFC算力网络的结构示意图；
图9示出本公开实施例中一种业务处理方法的流程示意图之三；
图10示出本公开实施例中一种业务处理装置的结构示意图；
图11示出本公开实施例中一种电子设备的结构示意图。
具体实施方式
现在将参考附图更全面地描述示例实施方式。然而，示例实施方式能够以多种形式实施，且不应被理解为限于在此阐述的范例；相反，提供这些实施方式使得本公开将更加全面和完整，并将示例实施方式的构思全面地传达给本领域的技术人员。所描述的特征、结构或特性可以以任何合适的方式结合在一个或更多实施方式中。
此外，附图仅为本公开的示意性图解，并非一定是按比例绘制。图中相同的附图标记表示相同或类似的部分，因而将省略对它们的重复描述。附图中所示的一些方框图是功能实体，不一定必须与物理或逻辑上独立的实体相对应。可以采用软件形式来实现这些功能实体，或在一个或多个硬件模块或集成电路中实现这些功能实体，或在不同网络和/或处理器装置和/或微控制器装置中实现这些功能实体。
由于目前SFC中所有报文均是按照固定顺序遍历所有SF，为考虑到算力资源的因素，所以可能会带来以下问题：
当某一个SF出现算力瓶颈时，SFC编排的路径固定，无法感知出现问题的SF，引起负反馈。当某一个SF出现算力瓶颈时，控制器需频繁从头端重新编排业务功能路径(Service Functionpath，SFP)，以达到绕过出现问题的SF，为降低某一个SF的负载就需调整个SFC管线，开销较大，缺乏灵活性。SFC缺乏直接感知算力资源的能力造成SF资源利用率较低。SFC感知对象主要为流量带宽，但是引起SFC对待处理业务处理质量下降的因素却是多方面的，具体因素SFC无法有效的感知到。
本公开提供了一种业务处理方法，根据在业务功能链SFC的接口处接收到的待处理业务，确定待处理业务对应的算力资源参数；算力资源参数为表征待处理业务被SFC中的一个或者多个业务功能SF处理时，需要使用的算力资源对应的至少一个参数，根据算力资源参数，对一个或者多个SF在算力资源占用周期内的算力资源进行预先占用操作，确定待处理业务在算力资源占用周期内需要使用的算力资源的分配方式，通过路由协议将分配方式下发至一个或者多个SF中，以使一个或者多个SF根据分配方式对待处理业务进行处理。在遵循现有SFC网络服务的基础上，引入新的机制，不仅可以实现SFC对算力资源的感知，确定接入的待处理业务的算力资源参数，还可以通过对算力资源的感知，对SFC中的每个SF的算力资源提前进行预占，确定待处理业务的算力资源的分配方式，有效利用SFC处理资源，从网络层面提高SFC的业务质量，业务可用性，提高业务链扩展性和SF算力利用率。
图1为本公开实施例提供的一种业务处理方法的应用场景。
在如图1所示的SFC算力网络100中，包括：控制器101、转发器(Service Function Forwarder，SFF)102，分类器103，以及一系列SF。
通常，SFC包括驻留在各个网络节点上的一系列业务功能(或业务功能实例)，也就是说，SFC是定义了经过业务分类后报文所需处理的一系列SF及处理次序，可支持IPv4，IPv6，SFC，mpls，vxlan等多样的路由协议(Underlay)。SFC可以包括沿SFC的一个或多个业务功能路径(Service Function Path，SFP)。当流量通过SFC从用户或用户设备(如用户设备112)转发时，流量中的数据包按顺序遍历SFP并由各种业务功能处理，其中，每个业务功能应用一个特定的功能，如防火墙、网络访问转换 (Network Access Translation，NAT)、深度报文检测(Deep Packet Inspection，DPI)等，之后将数据包转发到下一个网络节点。
其中，控制器101可以设置为确定处理待处理业务的路径。例如，业务功能路径(Service Function Path，SFP)。还可以设置为监测分类器103，转发器102以及一系列的SF的状态信息。还可以设置为将所确定的路径建立到分类器103和转发器102中。还可以设置为根据各种策略或者约定服务管理待处理业务的处理方式。
分类器103设置为为待处理业务对应的报文增加网络业务报头NSH，标注的业务功能路径SFP信息中包括的业务路径标识符SPI和业务索引(Service Index，SI)信息，并转交给转发器102。
转发器102在SFC中负责根据封装的SFC新消息引导流量按定义好的顺序进出一系列业务功能SF或者其他转发器102处理的网元。
SF可以是物理或虚拟网元，具备有限的处理能力，处理能力可以理解为算力，IO，存储，带宽等。SF在处理业务的处理能力不足的情况下，是可以进行扩展的。
其中，对于不支持SFC的SF节点，需通过代理设备(Proxy)处理NSH报文头。
需要说明的是，SPI唯一标记一条业务链路径。当SPI确定之后，转发器102根据业务索引判断需要将数据转发到哪个SF上，并根据查询到的具体的下一跳地址进行转发，遍历预定的、固定顺序的串联SF业务功能编组进行处理，难以根据SF的实际算力负载情况进行灵活调整。
如图1中所示的SFC算力网络，当SFC中的控制器101通过接口接收到待处理业务之后，对用户流量入口的分类器103下发3组报文分类策略，分别对应SPI1，SPI2，SPI3业务功能链处理。其中，图1中的1表示SPI1，2表示SPI2，3表示SPI3。根据SPI编号对应的SI数值降序遍历所对应的一组SF。
从图1中可以看出3条SFC均经过SF3.1，在建立SFC时SF 3.1算力充足，可满足3条SFC业务的并行处理流。但是经过长期的使用，SF3.1可能会出现算力瞬时或者长期的过载现象，可能是CPU处理时间满负荷，内存满载，内存IO超过载等。
当SF 3.1的算力过载影响到SPI1，SPI2，SPI3的业务质量，3条SPI均可能发生丢包，无响应，延迟增加等拖尾现象。
想要解决上述问题，需要通过控制器101通过虚拟化基础设施管理器或者主机性能监测系统获得SF 3.1性能过载信号，并确认SF3.1无扩容资源。然后，控制器101发现SF3.2与SF3.1功能一致并可用。控制器101根据各SFC负载情况，选择撤销经过SF3.1的业务链SPI1，并重编排SPI1路径经过SF3.2。调整之后的SPI1如图2所示。
经过调整之后的SFC算力网络，可以看出经过SF3.1的SPI减少为2个，SPI1经过SF3.2。但是，由于SFC无法感知到待处理业务的算力信息，一般当部分算力资源出现瓶颈或重载现象发生后，才会通过监控系统测量到业务质量劣化，并需要排除网络，算力等多方因素。SFC无法根据算力自主调整SPI管线，需通过头端拆除重建的方式，重建业务功能链，将SF3.1过载的业务卸载到SF3.2中。
上述是本公开中提供的一种业务处理方法的应用场景，本公开还提供了其他的业务处理方法的应用场景，下面结合附图及实施例对本示例实施方式进行详细说明。
首先，本公开实施例中提供了一种业务处理方法，该方法可以由任意具备计算处理能力的电子设备执行，下述过程中以电子设备为服务器为例。
图3示出本公开实施例中一种业务处理方法的流程图，如图3所示，本公开实施例中提供的业务处理方法包括如下步骤：
S302：根据在业务功能链SFC的接口处接收到的待处理业务，确定待处理业务对应的算力资源参数。
其中，算力资源参数为表征待处理业务被SFC中的一个或者多个业务功能SF处理时，需要使用的算力资源对应的至少一个参数。
需要说明的是，算力资源占用周期为控制器在配置策略的过程中，对SF的算力资源占用的预设周期。例如，待处理业务在5：30开始处理，控制器对于SF的算力资源进行占用的周期可以为5：30-5：31这段时间，这段时间即可以表示为算力资源占用周期。
在SFC算力网络中，由于SFC无法感知到SF的算力资源信息，并且也无法具体确定接收到的待处理业务在处理的过程中具体需要多少算力资源才可以将待处理业务处理完成，往往是通过监控系统测量到对待处理业务的处理过程中处理质量劣化，才能够发现问题，基于此，本公开提供了一种可行的实施例，具体如下：
在一种可能的实施例中，算力资源参数的确定方式如下：
根据路由协议扩展算力资源参数，并将算力资源参数下发至一个或者多个SF，以使一个或者多个SF根据算力资源参数，上传算力资源信息；算力资源信息为一个或者多个SF处理业务时，根据算力资源参数，返回的算力资源的使用情况/剩余可用算力资源的情况，根据待处理业务，以及算力资源信息，确定待处理业务对应的算力资源参数。
其中，算力资源参数为将处理业务时，所需要使用的算力资源通过参数的形式表述的表述方式。
扩展算力资源参数的方式包括：路由协议通过协议消息体TLV或探测请求option进行扩展。SFC的路由协议通过TLV或option扩展算力资源参数。
通过路由协议扩展算力资源参数，向每个SF发送算力资源参数，使得具备发布/接收能力的SF定期向SFC路由协议提供与SFC无关的算力资源信息。可以理解为，是一种将SF处理待处理业务时，将算力资源通过算力资源参数的形式上传到SFC路由协议中，通过大量的SF上传的算力资源信息，可以使得SFC的控制器在后续接收到到处理业务时，可以根据算力资源信息，将接收到的待处理业务通过算力资源参数的方式表示出来，以此可以使SFC算力网络做到对算力的具体感知。
其中，SF向SFC路由协议注入该SF的算力资源信息，可以包括：该SF所在VNF，VM或主机的可用资源数据。
具体地，上述算力资源信息可以通过SFC路由协议分发至控制器、转发器或者分类器等，控制器也可以通过BGP LS或restful接口接收。
需要说明的是，上述通过路由协议下发算力资源参数，以及SF上传算力资源信息，其中涉及到的网元均需要时钟同步。
S304：根据算力资源参数，对一个或者多个SF在算力资源占用周期内的算力资源进行预先占用操作，确定待处理业务在算力资源占用周期内需要使用的算力资源的分配方式。
在一种可能的实施例中，确定算力资源参数之后，如图4所示，以图1中存在的SPI1，SPI2，SPI3为例对本公开实施例提供的业务处理方法进行说明。均是SPI1，SPI2，SPI3对待处理业务进行处理的情况，但是图4中示出了另一种SFC算力网络200。其中，SFC算力网络200包括控制器201、转发器202、分类器203、以及一系列的SF。
上述内容中的算力资源参数可以包括：算力资源占用周期、SFC业务路径标识符SPI编号、目标SF索引地址、算力资源占用周期内占用SF的内存数量和时长、中央处理器CPU处理的作业数、预估中位数、CPU时间/每次作业、内存输出量。图5示出了一种周期性算力资源表述示意图。其中包括内存数量-时长，中位数CPU时间，请求数等。
其中，在SFC算力网络中接收待处理业务之后，具体的处理包括：
SFC算力网络中的控制器确定了待处理业务的算力资源参数，控制器可以标记一条SFC在固定周期内预计占用一个或者多个SF的算力资源，可以对一个或者多个SF在算力资源占用周期内的算力资源进行预先占用操作，在对SF的算力资源进行预占的过程中，是直接由控制器通过路由协议向SF发布算力资源参数，来进行预先占用操作。通过控制器向每个SF发送该算力资源参数对SF的算力资源进行预占。此处以对SPI1涉及到的SF的算力资源进行预占。
在进行预先占用的过程中，可能包括以下两种情况，分别如下：
(1)若将待处理业务对应的算力资源参数全部分配至一个或者多个SF，且未收到过载信号，则待处理业务在算力资源占用周期内需要使用的算力资源分配完成，确定分配方式。
示例性地，在控制器向SF的算力资源进行预先占用的过程中，将SPI1所要处理的待处理业务对应的算力资源全部分配完成之后，也没有接收到任何一个SF的过载信号。那么，说明SPI1中涉及到的SF，算力资源不会出现过载的情况，可以满足此算力资源占用周期内对待处理业务的处理。
(2)若在预先占用操作的过程中，接收到任意一个SF反馈的过载信号，则停止对任意一个SF的算力资源进行占用，对与任意一个SF具备相同业务功能的SF的算力资源进行预先占用操作，直至待处理业务在算力资源占用周期内需要使用的算力资源分配完成，且未收到过载信号，确定分配方式。
其中，过载信号为任意一个SF在算力资源占用周期中，被预先占用的算力资源大于预设算力资源阈值生成的信号。过载信号中包括对哪一个算力资源占用周期的算力资源不足的信息。
示例性地，若在预先占用的过程中，以SF3.1为例，由于上述SPI1，SPI2，SPI3均经过SF3.1，所以，在对SPI1涉及到的SF的算力资源的预先占用过程中，SF3.1很可能会由于算力资源已经被SPI2和SPI3在算力资源占用周期已经占用了，会出现算力资源不足的情况，所以，控制器可以接收到SF3.1发送回来的过载信号。
SF在算力资源占用周期内的算力资源占用完毕之后，SF可以发出过载的周期或者过载的信号，控制器接收到该过载信号之后，则不会在该SF继续进行占用或者新增业务，可以理解为控制器不会在想该SF分配新的业务功能路径SFP。
进一步地，SFC算力网络的控制器在接收到过载信号之后，可以将原本占用在SF3.1中的待处理业务的算力资源，分配到SF3.2中去。并确定好具体的算力资源分配方式，由于控制器标记了业务路径标识符为SPI1的业务功能链，则可以确定SPI1的分配方式由于SF3.1的过载，已经发生变化。
需要说明的是，以SF3.1为例，若控制器标记了SPI1，并对SF3.1进行预先占用的过程中，SF3.1发出过载信号，但是控制器没有发现与SF3.1具备相同业务功能的SF，那么，可以直接限制SPI1在SF3.1所能使用的的算力资源开销，此种方式限制SPI1的算力资源开销到预占用阀值，SPI2，SPI3业务不受影响，SF 3.1算力资源正常。
S306：通过路由协议将分配方式下发至一个或者多个SF中，以使一个或者多个SF根据分配方式对待处理业务进行处理。
在一种可能的实施例中，控制器可以将确定好的分配方式通过路由协议发至转发器、分类器以及SPI1涉及到的每个SF中去，通知每个SF具体的算力资源占用周期，以及待处理业务具体的算力资源参数，使得每个SF在算力资源占用周期中预留出已经被控制器预先占用的算力资源，来处理待处理业务。整个预先占用过程对SPI2和SPI3没有任何影响。
上述图4中示出的S1、S2、S3等步骤均为控制器执行的步骤，S4为SF3.1向控 制器返回的过载信号，控制器响应于此过载信号，则确定与SF3.1具备相同业务功能的SF3.2，并向SF3.2进行预先占用操作，将待处理业务所需要的算力资源预先分配给SF3.2，最终确定分配方式，将确定好的分配方式发送至分类器和转发器以及每个SF，以对待处理业务进行处理。图4中对各种不同的情况不在进行多余的赘述。
需要说明的是，当该SF在算力资源占用周期内具备额外算力资源时，允许算力资源以相邻周期为单位的超限占用和赤字偿还。也就是可以理解为：若某个算力资源占用周期中的算力资源有富余，则可以在提前对此算力资源占用周期的算力资源进行占用，以及对后面的算力资源占用周期中的待处理业务进行提前处理。
上述业务处理方法中，通过SFC算力网络对算力资源的感知，有效的确定出算力资源参数，并对每个SF的算力资源进行预先占用，在时钟同步的前提下，可以有效的保证SF对待处理业务进行处理的过程中，SF的算力资源不会过载，保证业务链可以正常工作完成对待处理业务的处理。此种方式可以称为显式SFC算力策略，通过SFC算力网络中的控制器进行建立，并通过路由协议下发至业务功能链涉及到的每个SF、转发器和分类器中。并且，此种显式SFC算力策略是通过路由协议进行下发，整个过程是通过通信的方式对每个SF进行通知，不会改变原有的SFC机制，没有改变控制器以及分类器对待处理业务所位于的数据包或者数据包集合的处理。
需要说明的是，针对任意一个SF，当在SFC算力网络中，控制器需要将多个业务功能链对SF进行预先占用操作，每个业务功能链分别对应一种分配方式时，所有的业务功能链涉及到的SF根据均是可以识别出对应的业务功能链的，SF可以识别出哪条业务功能链在那个算力资源占用周期对该SF进行了占用，其他的业务功能链在哪个算力资源占用周期对该SF进行了占用，任意一个SF都是可以对业务功能链进行识别的。
需要说明的是，在SFC算力网络中，控制器与SF之间的通信，需要SF为具备发布能力、接收能力和识别能力。其中，发布能力为SF根据路由协议发布算力资源信息，以及发布过载信号的能力。接收能力为通过路由协议接收信息的能力。识别能力为针对任意一个SF，可以识别出此时经过该SF的业务功能链是哪一条，并且确定出此条业务功能链在该SF进行的业务以及预先占用的算力资源等。针对非算力感知网元透传信息即可。
具备上述能力的SF可以向OVS/vswitch路由等网元注册，根据算力策略指定的模式，定期向域内路由协议发布SFC无关的算力信息。
在一种可能的实施方式中，本公开提供了上述业务处理方法中的显式SFC算力策略之外，还提供了一种隐式SFC算力策略，如图6所示，图6包括以下步骤：
S602：根据在业务功能链SFC的接口处接收到的待处理业务，配置剩余算力资源指示信息。
其中，剩余算力资源指示信息为指示SFC中的一个或者多个SF在处理待处理业务时，实时返回的在算力资源占用周期内SF的剩余算力资源。
S604：配置算力资源调整指示信息。
其中，算力资源调整指示信息为指示转发器根据一个或者多个SF在处理待处理业务时，实时返回的在算力资源占用周期内SF的剩余算力资源，调整处理待处理业务的SF的指示信息。
S606：将算力资源调整指示信息下发至转发器，以及通过路由协议将剩余算力资源指示信息下发至一个或者多个SF中，以使一个或者多个SF和转发器对待处理业务进行处理。
在一种可能的实施例中，通过隐式SFC算力策略对SPI1路径进行算力调整的过程如图7所示，在控制器在接口处接收到待处理业务时，在正常配置业务功能链的基 础上，配置剩余算力资源指示信息，指示SFC中的一个或者多个SF在处理待处理业务时，实时返回的在算力资源占用周期内SF的剩余算力资源到控制器或者转发器。即，可以理解为使得SF发布算力资源占用周期内的剩余算力资源百分比信息。也可以指示每个SF实时返回算力资源占用周期的已被占用的算力资源百分比信息。
需要说明的是，算力资源调整指示信息为指示转发器，在接收到SF发送的剩余算力资源满足算力资源约束条件时，则按照正常逻辑执行即可，若接收到SF发送的剩余算力资源不满足算力资源约束条件时，则需要上报或者停止向该SF继续发送新的待处理业务，或者，根据该SF的地址检索是否存在有与该SF具备相同业务功能的SF，可以将原本转发至该SF的新的待处理业务，发送至与该SF具备相同业务功能的SF。上述算力资源约束条件可以为SF的剩余算力资源大于或者等于15％等，此设定算力资源可以根据不同周期，设置不同的阈值，以满足业务功能链对待处理业务的处理需求。
控制器配置算力资源调整指示信息发送至转发器，使得转发器在接收到SF的剩余算力资源之后，可以根据剩余算力资源对SF的算力资源进行均衡调节。例如，在SF3.1在某个周期时，处理待处理业务，并实时返回剩余算力资源给转发器，若转发器接收到SF3.1发送的剩余算力资源已经为5％，则可以自主进行均衡。
如图7中的图7b所示，其中，每个SF指转发器的虚线表示向转发器上传剩余算力资源，转发器接收到每个SF的剩余算力资源之后，即可以根据剩余算力资源，进行下一步的处理。
进一步地，出现上述SF3.1的剩余算力资源已经为5％，但是控制器又分配给SF3.1新的待处理业务时，则SPI1中的SF3.1处理开销增加，此时，若SF3.1，SF3.2采用等价地址，根据转发器接收到的算力资源调整指示信息，转发器在SF3.1发布的剩余算力资源不足以满足算力资源约束条件时，不将后续控制器分配给SF3.1的其他待处理业务分发给SF3.1，并且将SF3.1已经在处理的业务逐步调整至SF3.2进行处理。
通过调整路由协议算力权重将SPI1中SF3.1的待处理业务(其中，此处的待处理业务可以是流量、作业或者请求)逐步卸载到SF3.2，直到SF3.1在某个周期内向转发器发送的剩余算力资源满足算力资源约束条件。在上述过程中，实质上控制器并没有发出调整SPI1路径的指示信息，也没有重新配置新的SPI路径，并且由于SF3.1和SF3.2使用的是等价地址。所以，对于整个SFC算力网络而言，SPI1路径并没有进行实际的调整，仅是转发器在SF3.1的算力资源不足时，利用SF3.2的算力资源进行了增量部署，SPI1，SPI2，SPI3均不受影响，SF3.1，3.2算力资源均正常。
如图7中的图7c所示，SPI1路径经过SF3.1调整为经过SF3.2，通过SF3.2对待处理业务进行处理。虚线1表示原有的SPI1路径，实线1表示经过转发器调整之后的SPI1路径。
在上述方式中，控制器在接收到待处理业务之后，通过现有的方式对待处理业务的SPI路径进行配置，并发送至分类器，以使SPI路径中涉及到的SF对待处理业务进行处理，隐式SFC算力策略实质上可以理解为在对待处理业务正常处理的过程中，通过路由协议对转发器和每个SF进行了特殊的指示，以使转发器可以对SPI的流量等进行管理和对每个SF进行负载均衡。
本公开中的此种实施方式，通过上述隐式SFC算力策略的方式可以在转发器处将SFC算力网络中存在的SF算力过载的情况处理完成，无需额外的调整SPI路径，降低了SF算力资源瞬时/长期波动引起SFC质量劣化和端到端重建SPI需求，提高了业务链稳定性，增强了算力与SFC网络的亲和性。
本公开示出的SFC算力网络200，其具体的结构示意图如图8所示，其中包括的控制器201、转发器202、分类器203、以及一系列的SF。SFC算力网络200可以对 待处理业务进行代理。
具体可以分为如下结构：SFC算力网络200可以分为控制面和转发面。其中，控制面包括控制器201、转发面包括转发器202、分类器203、以及一系列的SF。
具体地，控制器201包括拓扑信息模块2011、路径计算模块2012、算力策略配置模块2013和路由算力拓展模块2014。
其中，路径计算模块2012主要设置为配置对待处理业务进行处理的路径，路径中包括多个SF。
算力策略配置模块2013设置为配置上述内容中提到的显式SFC算力策略和隐式SFC算力策略。
路由算力拓展模块2014设置为接收SF通过路由协议分发的算力资源信息，将算力策略配置模块2013配置的显式SFC算力策略和隐式SFC算力策略通过路由协议进行发布。以及设置为发布算力资源参数以及隐式SFC算力策略中的算力资源约束条件等。
本公开中的SFC算力网络200中的转发器202除基本的转发功能外，还可以设置为根据控制器201发送的算力资源调整指示信息，在SF的剩余算力资源不足以满足算力资源约束条件时，通过调整路由协议算力权重将流量(或作业，请求)按可用算力比例卸载到其他相同功能SF。
在一种可能的实施方式中，图9示出了一种共同使用上述显式SFC算力策略和隐式SFC算力策略的业务处理方法，如图9所示，包括以下步骤：
S902：根据在业务功能链SFC的接口处接收到的待处理业务，确定待处理业务对应的算力资源参数。
S904：根据算力资源参数，对一个或者多个SF在算力资源占用周期内的算力资源进行预先占用操作，确定待处理业务在算力资源占用周期内需要使用的算力资源的分配方式。
S906：配置剩余算力资源指示信息。
S908：配置算力资源调整指示信息。
S910：通过路由协议将算力资源调整指示信息下发至转发器，以及通过路由协议将分配方式和剩余算力资源指示信息下发至一个或者多个SF中，以使一个或者多个SF和转发器对待处理业务进行处理。
本公开中的基于业务功能链的业务处理方法，在现有的SFC算力网络构架中引入业务功能链算力感知，发布和算力策略执行，算力路由等能力，新增了算力资源参数。在保持业务功能链转发器兼容性的基础上，解决了现有SFC算力灵活性不足的问题，同时提高了SF的利用率。
基于时间周期提供了显式和隐式两种SF算力资源占用策略和机制,降低了SF算力资源瞬时/长期波动引起SFC质量劣化和端到端重建SPI需求，提高了业务链稳定性，增强了算力与SFC网络的亲和性。
通过本公开中的业务处理方法，可以根据隐式SFC算力策略，以及针对SF的算力资源约束条件，局部调整SFC的业务处理管线，而不改变整个SFC转发路径。
还可以通过显式SFC算力策略，通过预先占用的方式，在处理待处理业务之前就锁定每个SF的算力资源，提高SFC算力网络中每个SF算力资源分配的合理性以及业务功能链的健壮性。
本公开中涉及到的算力资源感知方式，接收SF发送的算力资源信息，确定算力资源参数等方式，以及发布显式SFC算力策略，隐式SFC算力策略，发布算力资源约束条件等，均是通过路由协议进行发布，是通过通信的方式进行处理，没有改变现有SFC基本转发处理，代理机制。
可增量部署，可以通过将多个SF部署为同一个地址的方式，在某一个SF出现过载问题时，检索相同地址的SF，通过转发器将过载的SF的算力资源卸载至相同地址的SF中去，也可以理解为将算力资源卸载至相与出现问题的SF具备相同的业务功能的SF中去，仅需部分SF和转发器等关键网元支持算力感知。
通过上述方式，还可以减少算力因素引起的SFC路径重编排需求和业务质量降级，加快算力驱动的SFC业务升级。
基于同一发明构思，本公开实施例中还提供了一种业务处理装置，如下面的实施例。由于该装置实施例解决问题的原理与上述方法实施例相似，因此该装置实施例的实施可以参见上述方法实施例的实施，重复之处不再赘述。
图10示出本公开实施例中一种业务处理装置的结构示意图，如图10所示，该业务处理装置100包括：确定单元1001，设置为根据在业务功能链SFC的接口处接收到的待处理业务，确定待处理业务对应的算力资源参数；算力资源参数为表征待处理业务被SFC中的一个或者多个业务功能SF处理时，需要使用的算力资源对应的至少一个参数；预占单元1002，设置为根据算力资源参数，对一个或者多个SF在算力资源占用周期内的算力资源进行预先占用操作，确定待处理业务在算力资源占用周期内需要使用的算力资源的分配方式；下发单元1003，设置为通过路由协议将分配方式下发至一个或者多个SF中，以使一个或者多个SF根据分配方式对待处理业务进行处理。
在本公开的一个实施例中，确定单元1001，还设置为：根据路由协议扩展算力资源参数，并将算力资源参数下发至一个或者多个SF，以使一个或者多个SF根据算力资源参数，上传算力资源信息；算力资源参数为将处理业务时，所需要使用的算力资源通过参数的形式表述的表述方式；算力资源信息为一个或者多个SF处理业务时，根据算力资源参数，返回的算力资源的使用情况/剩余可用算力资源的情况；根据待处理业务，以及算力资源信息，确定待处理业务对应的算力资源参数。
在本公开的一个实施例中，预占单元1002，还设置为：若将待处理业务对应的算力资源参数全部分配至一个或者多个SF，且未收到过载信号，则待处理业务在算力资源占用周期内需要使用的算力资源分配完成，确定分配方式；或者，若在预先占用操作的过程中，接收到任意一个SF反馈的过载信号，则停止对任意一个SF的算力资源进行占用；其中，过载信号为任意一个SF在算力资源占用周期中，被预先占用的算力资源大于预设算力资源阈值生成的信号；对与任意一个SF具备相同业务功能的SF的算力资源进行预先占用操作，直至待处理业务在算力资源占用周期内需要使用的算力资源分配完成，且未收到过载信号，确定分配方式。
业务处理装置100，还包括：均衡单元，设置为根据在业务功能链SFC的接口处接收到的待处理业务，配置剩余算力资源指示信息；剩余算力资源指示信息为指示SFC中的一个或者多个SF在处理待处理业务时，实时返回的在算力资源占用周期内SF的剩余算力资源；配置算力资源调整指示信息；其中，算力资源调整指示信息为指示转发器根据一个或者多个SF在处理待处理业务时，实时返回的在算力资源占用周期内SF的剩余算力资源，调整处理待处理业务的SF的指示信息；将算力资源调整指示信息下发至转发器，以及通过路由协议将剩余算力资源指示信息下发至一个或者多个SF中，以使一个或者多个SF和转发器对待处理业务进行处理。
在本公开的一个实施例中，业务处理装置100，还包括：预占均衡单元，设置为配置剩余算力资源指示信息；剩余算力资源指示信息为指示SFC中的一个或者多个SF在处理待处理业务时，实时返回的在算力资源占用周期内SF的剩余算力资源；配置算力资源调整指示信息；其中，算力资源调整指示信息为指示转发器根据一个或者多个SF在处理待处理业务时，实时返回的在算力资源占用周期内SF的剩余算力资源，调整处理待处理业务的SF的指示信息；通过路由协议将分配方式下发至一个或者多 个SF中，包括：将算力资源调整指示信息下发至转发器，以及通过路由协议将分配方式和剩余算力资源指示信息下发至一个或者多个SF中，以使一个或者多个SF和转发器对待处理业务进行处理。
在本公开实施例中，上述单元与对应的步骤所实现的示例和应用场景相同，但不限于上述方法实施例所公开的内容。需要说明的是，上述模块作为装置的一部分可以在诸如一组计算机可执行指令的计算机系统中执行。
所属技术领域的技术人员能够理解，本公开的各个方面可以实现为系统、方法或程序产品。因此，本公开的各个方面可以具体实现为以下形式，即：完全的硬件实施方式、完全的软件实施方式(包括固件、微代码等)，或硬件和软件方面结合的实施方式，这里可以统称为“电路”、“模块”或“系统”。
下面参照图11来描述根据本公开的这种实施方式的电子设备1100。图11显示的电子设备1100仅仅是一个示例，不应对本公开实施例的功能和使用范围带来任何限制。
如图11所示，电子设备1100以通用计算设备的形式表现。电子设备1100的组件可以包括但不限于：上述至少一个处理单元1110、上述至少一个存储单元1120、连接不同系统组件(包括存储单元1120和处理单元1110)的总线1130。
其中，所述存储单元存储有程序代码，所述程序代码可以被所述处理单元1110执行，使得所述处理单元1110执行本说明书上述“示例性方法”部分中描述的根据本公开各种示例性实施方式的步骤。例如，所述处理单元1110可以执行上述方法实施例中的如下步骤，例如：根据在业务功能链SFC的接口处接收到的待处理业务，确定待处理业务对应的算力资源参数；算力资源参数为表征待处理业务被SFC中的一个或者多个业务功能SF处理时，需要使用的算力资源对应的至少一个参数；根据算力资源参数，对一个或者多个SF在算力资源占用周期内的算力资源进行预先占用操作，确定待处理业务在算力资源占用周期内需要使用的算力资源的分配方式；通过路由协议将分配方式下发至一个或者多个SF中，以使一个或者多个SF根据分配方式对待处理业务进行处理。
存储单元1120可以包括易失性存储单元形式的可读介质，例如随机存取存储单元(RAM)11201和/或高速缓存存储单元11202，还可以进一步包括只读存储单元(ROM)11203。
存储单元1120还可以包括具有一组(至少一个)程序模块11205的程序/实用工具11204，这样的程序模块11205包括但不限于：操作系统、一个或者多个应用程序、其它程序模块以及程序数据，这些示例中的每一个或某种组合中可能包括网络环境的实现。
总线1130可以为表示几类总线结构中的一种或多种，包括存储单元总线或者存储单元控制器、外围总线、图形加速端口、处理单元或者使用多种总线结构中的任意总线结构的局域总线。
电子设备1100也可以与一个或多个外部设备1140(例如键盘、指向设备、蓝牙设备等)通信，还可与一个或者多个使得用户能与该电子设备1100交互的设备通信，和/或与使得该电子设备1100能与一个或多个其它计算设备进行通信的任何设备(例如路由器、调制解调器等等)通信。这种通信可以通过输入/输出(I/O)接口1150进行。并且，电子设备1100还可以通过网络适配器1160与一个或者多个网络(例如局域网(LAN)，广域网(WAN)和/或公共网络，例如因特网)通信。如图所示，网络适配器1160通过总线1130与电子设备1100的其它模块通信。应当明白，尽管图中未示出，可以结合电子设备1100使用其它硬件和/或软件模块，包括但不限于：微代码、设备驱动器、冗余处理单元、外部磁盘驱动阵列、RAID系统、磁带驱动器以及数 据备份存储系统等。
通过以上的实施方式的描述，本领域的技术人员易于理解，这里描述的示例实施方式可以通过软件实现，也可以通过软件结合必要的硬件的方式来实现。因此，根据本公开实施方式的技术方案可以以软件产品的形式体现出来，该软件产品可以存储在一个非易失性存储介质(可以是CD-ROM，U盘，移动硬盘等)中或网络上，包括若干指令以使得一台计算设备(可以是个人计算机、服务器、终端装置、或者网络设备等)执行根据本公开实施方式的方法。
特别地，根据本公开的实施例，上文参考流程图描述的过程可以被实现为计算机程序产品或计算机程序，该计算机程序产品或计算机程序包括计算机指令，该计算机指令存储在计算机可读存储介质中。计算机设备的处理器从计算机可读存储介质读取该计算机指令，处理器执行该计算机指令，使得该计算机设备执行上述任一项的业务处理方法。
在本公开的示例性实施例中，还提供了一种计算机可读存储介质，该计算机可读存储介质可以是可读信号介质或者可读存储介质。其上存储有能够实现本公开上述方法的程序产品。在一些可能的实施方式中，本公开的各个方面还可以实现为一种程序产品的形式，其包括程序代码，当所述程序产品在终端设备上运行时，所述程序代码用于使所述终端设备执行本说明书上述“示例性方法”部分中描述的根据本公开各种示例性实施方式的步骤。
本公开中的计算机可读存储介质的更具体的例子可以包括但不限于：具有一个或多个导线的电连接、便携式计算机磁盘、硬盘、随机访问存储器(RAM)、只读存储器(ROM)、可擦式可编程只读存储器(EPROM或闪存)、光纤、便携式紧凑磁盘只读存储器(CD-ROM)、光存储器件、磁存储器件、或者上述的任意合适的组合。
在本公开中，计算机可读存储介质可以包括在基带中或者作为载波一部分传播的数据信号，其中承载了可读程序代码。这种传播的数据信号可以采用多种形式，包括但不限于电磁信号、光信号或上述的任意合适的组合。可读信号介质还可以是可读存储介质以外的任何可读介质，该可读介质可以发送、传播或者传输用于由指令执行系统、装置或者器件使用或者与其结合使用的程序。
可选地，计算机可读存储介质上包含的程序代码可以用任何适当的介质传输，包括但不限于无线、有线、光缆、RF等等，或者上述的任意合适的组合。
在具体实施时，可以以一种或多种程序设计语言的任意组合来编写用于执行本公开操作的程序代码，所述程序设计语言包括面向对象的程序设计语言—诸如Java、C++等，还包括常规的过程式程序设计语言—诸如“C”语言或类似的程序设计语言。程序代码可以完全地在用户计算设备上执行、部分地在用户设备上执行、作为一个独立的软件包执行、部分在用户计算设备上部分在远程计算设备上执行、或者完全在远程计算设备或服务器上执行。在涉及远程计算设备的情形中，远程计算设备可以通过任意种类的网络，包括局域网(LAN)或广域网(WAN)，连接到用户计算设备，或者，可以连接到外部计算设备(例如利用因特网服务提供商来通过因特网连接)。
应当注意，尽管在上文详细描述中提及了用于动作执行的设备的若干模块或者单元，但是这种划分并非强制性的。实际上，根据本公开的实施方式，上文描述的两个或更多模块或者单元的特征和功能可以在一个模块或者单元中具体化。反之，上文描述的一个模块或者单元的特征和功能可以进一步划分为由多个模块或者单元来具体化。
此外，尽管在附图中以特定顺序描述了本公开中方法的各个步骤，但是，这并非要求或者暗示必须按照该特定顺序来执行这些步骤，或是必须执行全部所示的步骤才能实现期望的结果。附加的或备选的，可以省略某些步骤，将多个步骤合并为一个步 骤执行，以及/或者将一个步骤分解为多个步骤执行等。
通过以上实施方式的描述，本领域的技术人员易于理解，这里描述的示例实施方式可以通过软件实现，也可以通过软件结合必要的硬件的方式来实现。因此，根据本公开实施方式的技术方案可以以软件产品的形式体现出来，该软件产品可以存储在一个非易失性存储介质(可以是CD-ROM，U盘，移动硬盘等)中或网络上，包括若干指令以使得一台计算设备(可以是个人计算机、服务器、移动终端、或者网络设备等)执行根据本公开实施方式的方法。
本领域技术人员在考虑说明书及实践这里公开的发明后，将容易想到本公开的其它实施方案。本公开旨在涵盖本公开的任何变型、用途或者适应性变化，这些变型、用途或者适应性变化遵循本公开的一般性原理并包括本公开未公开的本技术领域中的公知常识或惯用技术手段。说明书和实施例仅被视为示例性的，本公开的真正范围和精神由所附的权利要求指出。

Claims (11)

  1. 一种业务处理方法，所述方法包括：
    根据在业务功能链SFC的接口处接收到的待处理业务，确定所述待处理业务对应的算力资源参数；所述算力资源参数为表征所述待处理业务被所述SFC中的一个或者多个业务功能SF处理时，需要使用的算力资源对应的至少一个参数；
    根据所述算力资源参数，对所述一个或者多个SF在算力资源占用周期内的算力资源进行预先占用操作，确定所述待处理业务在所述算力资源占用周期内需要使用的算力资源的分配方式；
    通过路由协议将所述分配方式下发至所述一个或者多个SF中，以使所述一个或者多个SF根据所述分配方式对所述待处理业务进行处理。
  2. 根据权利要求1所述的业务处理方法，其中，所述算力资源参数包括以下至少一种：算力资源占用周期、SFC业务路径标识符SPI编号、目标SF索引地址、算力资源占用周期内占用SF的内存数量和时长、中央处理器CPU处理的作业数、预估中位数、CPU时间/每次作业、内存输出量。
  3. 根据权利要求1所述的业务处理方法，其中，所述根据在业务功能链SFC的接口处接收到的待处理业务，确定所述待处理业务对应的算力资源参数，包括：
    根据路由协议扩展所述算力资源参数，并将所述算力资源参数下发至所述一个或者多个SF，以使所述一个或者多个SF根据所述算力资源参数，上传算力资源信息；所述算力资源参数为将处理业务时，所需要使用的算力资源通过参数的形式表述的表述方式；所述算力资源信息为所述一个或者多个SF处理业务时，根据所述算力资源参数，返回的算力资源的使用情况/剩余可用算力资源的情况；
    根据所述待处理业务，以及所述算力资源信息，确定所述待处理业务对应的算力资源参数。
  4. 根据权利要求3所述的业务处理方法，其中，扩展算力资源参数的方式包括：所述路由协议通过协议消息体TLV或探测请求option进行扩展。
  5. 根据权利要求1所述的业务处理方法，其中，所述根据所述算力资源参数，对所述一个或者多个SF在算力资源占用周期内的算力资源进行预先占用操作，确定所述待处理业务在所述算力资源占用周期内需要使用的算力资源的分配方式，包括：
    若将所述待处理业务对应的算力资源参数全部分配至所述一个或者多个SF，且未收到过载信号，则所述待处理业务在所述算力资源占用周期内需要使用的算力资源分配完成，确定所述分配方式；或者，
    若在所述预先占用操作的过程中，接收到任意一个SF反馈的过载信号，则停止对所述任意一个SF的算力资源进行占用；其中，所述过载信号为所述任意一个SF在所述算力资源占用周期中，被预先占用的算力资源大于预设算力资源阈值生成的信号；
    对与所述任意一个SF具备相同业务功能的SF的算力资源进行预先占用操作，直至所述待处理业务在所述算力资源占用周期内需要使用的算力资源分配完成，且未收到过载信号，确定所述分配方式。
  6. 根据权利要求1所述的业务处理方法，其中，所述方法还包括：
    根据在业务功能链SFC的接口处接收到的待处理业务，配置剩余算力资源指示信息；所述剩余算力资源指示信息为指示所述SFC中的一个或者多个SF在处理所述待处理业务时，实时返回的在所述算力资源占用周期内SF的剩余算力资源；
    配置算力资源调整指示信息；其中，所述算力资源调整指示信息为指示转发器根据所述一个或者多个SF在处理所述待处理业务时，实时返回的在所述算力资源占用 周期内SF的剩余算力资源，调整处理所述待处理业务的SF的指示信息；
    将所述算力资源调整指示信息下发至所述转发器，以及通过路由协议将所述剩余算力资源指示信息下发至所述一个或者多个SF中，以使所述一个或者多个SF和所述转发器对所述待处理业务进行处理。
  7. 根据权利要求1所述的业务处理方法，其中，所述确定所述待处理业务在所述算力资源占用周期内需要使用的算力资源的分配方式之后，所述方法还包括：
    配置剩余算力资源指示信息；所述剩余算力资源指示信息为指示所述SFC中的一个或者多个SF在处理所述待处理业务时，实时返回的在所述算力资源占用周期内SF的剩余算力资源；
    配置算力资源调整指示信息；其中，所述算力资源调整指示信息为指示转发器根据所述一个或者多个SF在处理所述待处理业务时，实时返回的在所述算力资源占用周期内SF的剩余算力资源，调整处理所述待处理业务的SF的指示信息；
    通过路由协议将所述分配方式下发至所述一个或者多个SF中，包括：
    将所述算力资源调整指示信息下发至所述转发器，以及通过路由协议将所述分配方式和所述剩余算力资源指示信息下发至所述一个或者多个SF中，以使所述一个或者多个SF和所述转发器对所述待处理业务进行处理。
  8. 一种业务处理装置，所述装置包括：
    确定单元，用于根据在业务功能链SFC的接口处接收到的待处理业务，确定所述待处理业务对应的算力资源参数；所述算力资源参数为表征所述待处理业务被所述SFC中的一个或者多个业务功能SF处理时，需要使用的算力资源对应的至少一个参数；
    预占单元，用于根据所述算力资源参数，对所述一个或者多个SF在算力资源占用周期内的算力资源进行预先占用操作，确定所述待处理业务在所述算力资源占用周期内需要使用的算力资源的分配方式；
    下发单元，用于通过路由协议将所述分配方式下发至所述一个或者多个SF中，以使所述一个或者多个SF根据所述分配方式对所述待处理业务进行处理。
  9. 一种电子设备，包括：
    处理器；以及
    存储器，设置为存储所述处理器的可执行指令；
    其中，所述处理器配置为经由执行所述可执行指令来执行权利要求1～7中任意一项所述的方法。
  10. 一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被处理器执行时实现权利要求1～7中任意一项所述的方法。
  11. 一种计算机程序产品，包括计算机程序，所述计算机程序被处理器执行时实现权利要求1至7中任一项所述的方法。
PCT/CN2023/114474 2022-08-24 2023-08-23 业务处理方法、装置、设备、介质及程序产品 WO2024041572A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202211021129.1 2022-08-24
CN202211021129.1A CN117667366A (zh) 2022-08-24 2022-08-24 业务处理方法、装置、电子设备及存储介质

Publications (2)

Publication Number Publication Date
WO2024041572A1 WO2024041572A1 (zh) 2024-02-29
WO2024041572A9 true WO2024041572A9 (zh) 2024-04-11

Family

ID=90012571

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/114474 WO2024041572A1 (zh) 2022-08-24 2023-08-23 业务处理方法、装置、设备、介质及程序产品

Country Status (2)

Country Link
CN (1) CN117667366A (zh)
WO (1) WO2024041572A1 (zh)

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108574728B (zh) * 2017-03-08 2021-05-04 中兴通讯股份有限公司 用于移动边缘计算的流量路径改变检测的方法和装置
CN113448721A (zh) * 2020-03-27 2021-09-28 中国移动通信有限公司研究院 算力处理的网络系统及算力处理方法
CN112491739A (zh) * 2020-07-10 2021-03-12 中兴通讯股份有限公司 一种业务流量处理方法及装置
CN112751826B (zh) * 2020-12-07 2024-04-30 中兴通讯股份有限公司 算力应用流量转发方法及装置
CN113434294A (zh) * 2021-06-29 2021-09-24 腾讯科技（深圳）有限公司 一种数据处理方法、计算机设备以及可读存储介质

Also Published As

Publication number Publication date
WO2024041572A1 (zh) 2024-02-29
CN117667366A (zh) 2024-03-08

Similar Documents

Publication Publication Date Title
US10868755B2 (en) Implementing bi-directional paths in segment routing networks
EP3758412B1 (en) Multichannel data transmission method, apparatus, system and computer-readable medium
US11463511B2 (en) Model-based load balancing for network data plane
US8989019B2 (en) Transmission system, managing computer, and logical path construction method
WO2016015559A1 (zh) 云化数据中心网络的承载资源分配方法、装置及系统
US20120089981A1 (en) Method and system for power management in a virtual machine environment without disrupting network connectivity
WO2014118938A1 (ja) 通信経路の管理方法
CN109088820B (zh) 一种跨设备链路聚合方法、装置、计算装置和存储介质
US8095661B2 (en) Method and system for scaling applications on a blade chassis
US10153964B2 (en) Network routing using dynamic virtual paths in an overlay network
CN107645407B (zh) 一种适配QoS的方法和装置
JP5102689B2 (ja) 仮想ネットワークシステム、仮想ネットワーク構築方法
JP7092813B2 (ja) パケット伝送方法及び装置
CN108476175B (zh) 使用对偶变量的传送sdn流量工程方法与系统
JP2022539953A (ja) 転送経路決定方法及び装置
CN111371694B (zh) 一种分流方法、装置和系统、处理设备和存储介质
CN112187649A (zh) 一种报文转发方法、报文处理方法及装置
Tulumello et al. Micro SIDs: A solution for efficient representation of segment IDs in SRv6 networks
US11381497B2 (en) Path selection method and device
US20140330973A1 (en) System and method for brokering and provisioning in high-speed networks
JP7388533B2 (ja) ゲートウェイ装置、方法及びプログラム
WO2024041572A9 (zh) 业务处理方法、装置、设备、介质及程序产品
US8832266B2 (en) System and method for aggregating bandwidth of multiple active physical interfaces on application layer
JP2016122960A (ja) 管理システム、ネットワーク管理方法、ネットワークシステム
JP4595591B2 (ja) 通信品質制御方法及び通信品質制御システム

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23856660

Country of ref document: EP

Kind code of ref document: A1