Chain scheduling system and method for application service

Abstract

Embodiments of the present disclosure relate to a chain scheduling system and method for an application service. The method is applied to a service-aware gateway, and comprises: parsing a received application traffic packet to obtain a service identifier, wherein the application traffic packet comprises a service chain identifier and the service identifier; querying a service route on the basis of the service identifier, and determining a destination service node of the application traffic packet; and when the destination service node is not a local service node, guiding the application traffic packet to an SR policy by means of a network device comprised in an underlying network, so as to forward the application traffic packet by means of the underlying network.

Description

Chained scheduling system and method of application services

[0001] Cross-reference of related disclosures

[0002] Embodiments of the present disclosure are based on Chinese Patent Publication 2024110934478 filed on August 8, 2024, entitled “Chained scheduling system and method of application services” and claiming priority to the patent publication, the disclosure of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0003] Embodiments of the present disclosure relate to the technical field of network communication, and in particular to a chained scheduling system and method of application services. BACKGROUND

[0004] Currently, with the increasing complexity of application functions and the ubiquitous deployment of clouds, applications are often not in the form of monoliths, but are decomposed into logically independent functional modules and deployed in the form of “microservices”. The microservice module deployment mode under the microservice architecture evolves from centralized deployment by service providers to distributed deployment by multiple service providers, and distributed resources, distributed computing power, and distributed services have become the development trend of future emerging businesses. Therefore, there will be a large amount of east-west traffic between microservices across pools, domains, and clusters that need to be scheduled, and there will also be a demand for serial service chain access between microservices to meet the overall logic of the application.

[0005] In an open service interconnection scenario, a service-aware network interconnects general services, intelligent services, and other service resources and data resources provided by different service providers through different network operators, and provides basic services to society. The basic services are deployed across network management domains and service operation domains, and the application sequentially calls multiple basic services, which requires serial chain access scheduling between services to ensure the overall computing network demand of the application end to end.

[0006] To solve the problem of application-level service orchestration and invocation, some existing architectures for inter-microservice communication based on application layer processing, such as Service Mesh, exist. Service Mesh is located at the application layer and coexists with microservices, inserts a dedicated sidecar between microservice instances, intercepts and manages inter-microservice communication, and implements functions such as service discovery, service registration, load balancing, fault recovery, measurement and monitoring, access control, and end-to-end identity verification. However, Service Mesh is actually at the application layer above the TCP / IP network layer and cannot perceive the connection network capabilities in cross-domain scenarios, cannot dynamically schedule and adjust, and cannot provide refined network service requirements. In addition, for each independent service node, the routing of remote services is isolated, i.e., the calling relationship of a microservice that may exist in one or more service chains is missing.

[0007] The existing network side service function chain (SFC) technology is used for connecting network services on a logical layer to form an ordered service combination. The SFC realizes that a message passes through network devices in sequence according to a specified path by adding service chain path information in the original message. The SFC can realize flexible scheduling of network services, but for application layer services, traffic needs to be routed to the network layer to perform application processing, and the existing mechanism cannot meet the demand for application continuity. SUMMARY

[0008] To solve the above problems, the chain scheduling scheme of application services is provided. For solving the problem of serial chain access scheduling between services, not only the end-to-end network path of services can be overall arranged from a centralized perspective, but also the network path can be segmented and planned, and the scheduling of application service traffic can be realized segment by segment.

[0009] According to a first aspect of the embodiments of the present disclosure, a chain scheduling method of application services is provided, applied to a service-aware gateway, and characterized in that the method comprises: parsing a received application traffic message to obtain a service identifier, wherein the application traffic message contains a service chain identifier and the service identifier; querying a service route according to the service identifier to determine a destination service node of the application traffic message; and in the case that the destination service node is not a local service node, guiding the application traffic message to an SR Policy through network devices contained in an underlying network, so as to realize forwarding of the application traffic message via the underlying network.

[0010] According to a second aspect of the embodiments of the present disclosure, a chain scheduling method of application services is provided, applied to a service proxy node, and characterized in that the method comprises: receiving an application traffic message; in response to an ingress interface of the application traffic message being a corresponding service node, querying a service chain table according to a service chain identifier to obtain a next-hop service identifier; encapsulating or updating the next-hop service identifier into the application traffic message; and forwarding the application traffic message to a service-aware gateway corresponding to the service proxy node.

[0011] According to a third aspect of the embodiments of the present disclosure, a chain scheduling method of application services is provided, applied to a service node, and characterized in that the method comprises: receiving an application traffic message; processing the application traffic message; and sending the processed application traffic message to a corresponding service proxy node, so that the service proxy node encapsulates the processed application traffic message according to a next-hop service identifier obtained by the service proxy node and forwards the processed application traffic message to a corresponding service-aware gateway.

[0012] According to a fourth aspect of the embodiments of the present disclosure, a chain scheduling system for application service is provided, and has the characteristics that the chain scheduling system comprises a service-aware gateway, a service proxy node and a service node, wherein the service-aware gateway is configured to parse a received application traffic message to obtain a service identifier, query a service route according to the service identifier, determine a destination service node of the application traffic message, and in a case that the destination service node is a local service node, forward the application traffic message to a service proxy node corresponding to the service-aware gateway; the service proxy node is configured to, in response to an ingress interface of the application traffic message being the service-aware gateway, record a service chain identifier and the service identifier carried in the application traffic message, and forward the application traffic message to a service node corresponding to the service proxy node; the service node is configured to process the application traffic message, and send the processed application traffic message to a corresponding service proxy node; the service proxy node is configured to, in response to an ingress interface of the application traffic message being the corresponding service node, query a service chain table according to the service chain identifier, obtain a next-hop service identifier, encapsulate or update the next-hop service identifier into the application traffic message, and forward the application traffic message to a service-aware gateway corresponding to the service proxy node; and the service-aware gateway is configured to parse a received application traffic message to obtain a service identifier, query a service route according to the service identifier, determine a destination service node of the application traffic message, and in a case that the destination service node is not a local service node, guide the application traffic message to an SR Policy through a network device included in an underlying network, so as to realize forwarding of the application traffic message via the underlying network.

[0013] According to a fifth aspect of the embodiments of the present disclosure, a wireless communication device is provided, which includes a memory storing one or more programs and a processor electrically coupled to the memory and configured to execute the one or more programs to perform any method or steps or combination thereof in the embodiments of the present disclosure.

[0014] According to a sixth aspect of the embodiments of the present disclosure, a non-transitory computer-readable storage medium storing one or more programs configured to, when executed by a processor, cause performance of any method or steps or combination thereof in the embodiments of the present disclosure.

[0015] The above and other aspects and implementations thereof are described in more detail in the accompanying drawings, descriptions and claims. BRIEF DESCRIPTION OF DRAWINGS

[0016] In order to more clearly illustrate the technical solutions in the embodiments of the present disclosure, the drawings needed to be used in the embodiments description will be briefly introduced. Obviously, the drawings in the following description are only some embodiments of the present disclosure, and other drawings can be obtained by those skilled in the art based on these drawings without departing from the scope of the embodiments of the present disclosure.

[0017] FIG. 1 is a schematic diagram of a chain scheduling system of application services according to an embodiment of the present disclosure.

[0018] FIG. 2 is a schematic diagram of a chain scheduling module in a chain scheduling system of application services according to an embodiment of the present disclosure.

[0019] FIG. 3 is a flowchart of a chain scheduling method of application services according to an embodiment of the present disclosure.

[0020] FIG. 4 is a flowchart of a processing procedure of implementing end-to-end application micro services by establishing chain scheduling according to an embodiment of the present disclosure.

[0021] FIG. 5 is a flowchart of a chain scheduling method of application services implemented by a service-aware gateway according to an embodiment of the present disclosure.

[0022] FIG. 6 is a flowchart of a chain scheduling method of application services implemented by a service proxy node according to an embodiment of the present disclosure.

[0023] FIG. 7 is a flowchart of a chain scheduling method of application services implemented by a service node according to an embodiment of the present disclosure.

[0024] FIG. 8 is a structural diagram of an electronic device according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0025] The technical solutions in the embodiments of the present disclosure will be described clearly and completely with reference to the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are only some embodiments of the present disclosure, not all embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by those skilled in the art without creative work are within the scope of the present disclosure.

[0026] Throughout the specification and claims, the meaning of a term can depend on the context in which it is used. Similarly, the use of "in one embodiment" or "in some embodiments" herein does not necessarily refer to the same embodiment and the use of "in another embodiment" or "in other embodiments" herein does not necessarily refer to a different embodiment. The use of a phrase such as "in one implementation" or "in some implementations" herein does not necessarily refer to the same implementation and the use of a phrase such as "in another implementation" or "in other implementations" herein does not necessarily refer to a different implementation. For example, claimed subject matter includes all or part of exemplary embodiments or implementations.

[0027] Generally, the terms can be understood at least in part from the context in which they are used. For example, the terms "and", "or", and "and / or" as used herein can include a variety of meanings that can depend at least in part upon the context in which they are used. Typically, "or" if used to associate a list, such as A, B or C, is intended to mean A, B, and C, here used in the inclusive sense, as well as A, B or C, here used in the exclusive sense. In addition, the term "one or more" or "at least one" as used herein, depending at least in part upon context, can be used to describe any feature, structure, or characteristic in the singular or can be used to describe combinations of features, structures or characteristics. Similarly, terms such as "a", "an", or "the", again, depending at least in part upon context, can be understood to

[0028] To solve the problem of inter-service serial chain access scheduling, the embodiment of the disclosure provides a chain scheduling system of an application service. One specific APP application can be composed of one or more microservices or services, as shown in FIG. 1, the APP application is composed of three services, each service corresponds to a service node, which are Service A, Service B and Service C respectively, the service nodes execute the respective services in order and jointly provide the overall service to the outside. Each service is deployed in different resource pools and needs to be cross-domain scheduled through network equipment.

[0029] As shown in FIG. 1, the chain scheduling system includes an application service layer, a service proxy layer, and a network forwarding layer. According to some embodiments, the application service layer is responsible for function decomposition and orchestration of services, and management and operation of service requirements. The application service layer includes a plurality of service nodes, each of which performs a respective function and service. According to some embodiments, the service proxy layer can be composed of 7-layer (application layer) service proxy nodes in the OSI (Open System Interconnect) model, which are not limited in deployment location, and are responsible for 7-layer termination of service traffic, sending service traffic into service nodes for 7-layer service processing, and converting application service requirements into network layer requirements, encapsulating network layer packet headers, and reinitiating next service operations. In the embodiment shown in FIG. 1, the service proxy nodes corresponding to the service nodes Service A, Service B, and Service C are proxy A, proxy B, and proxy C, respectively. According to some embodiments, the network forwarding layer can be composed of service-aware gateways that can implement service routing functions, and is responsible for actual forwarding of service traffic, and utilizes the large-scale connection capability of the network and the high-quality algorithm network joint scheduling capability to achieve traffic control and service guarantee for the entire link during chain scheduling of application services. In the embodiment shown in FIG. 1, the service nodes Service A, Service B, and Service C, the service proxy nodes proxy A, proxy B, and proxy C, and the service-aware gateways A, B, and C are in a corresponding relationship.

[0030] According to some embodiments, the service nodes, the service proxy nodes, and the service-aware gateways can have various deployment modes, for example, the service nodes and the service proxy nodes can be deployed together (for example, integrated in one device), while the service-aware gateways are separately arranged, and the like, and the embodiments of the present disclosure do not make any limitation in this regard.

[0031] FIG. 2 is a schematic diagram of a chain scheduling module in a chain scheduling system of application services according to an embodiment of the present disclosure. As shown in FIG. 2, the chain scheduling module in the chain scheduling system includes service nodes, service proxy nodes, and service-aware gateways, for example, includes the service node Service A, the service proxy node proxy A, and the service-aware gateway A, which are in a corresponding relationship.

[0032] FIG. 3 is a flow chart of a chain scheduling method of an application service according to an embodiment of the present disclosure. In the embodiment shown in FIG. 3, the APP application is composed of three services, each of which corresponds to a service node, namely Service A, Service B and Service C, and the service proxy nodes corresponding to the service nodes Service A, Service B and Service C are proxy A, proxy B and proxy C respectively, and the service-aware gateways A, B and C corresponding to the service nodes Service A, Service B and Service C or the service proxy nodes proxy A, proxy B and proxy C respectively.

[0033] As shown in FIG. 3, the service operation management pre-orchestrates the application service into a service chain according to the services involved by the application, the service chain is represented by a group of service identifiers (Service-ID A, Service-ID B, Service-ID C) to form a Service List, and the service chain List is represented by a service chain identifier SFC-ID. When the application performs service orchestration to generate the service chain, each available service proxy node in the service chain is informed, such as proxy A, proxy B and proxy C. Each service proxy node will receive one or more service chain policies from the service operation management, and each service proxy node will store these service chain policies in a service chain table, as shown in Table 1:

[0034] Table 1

[0035] Table 1 shows the service chain table stored in the service proxy node proxy A, which includes the service chain identifier and the next hop service identifier, or the service chain identifier and the service chain. The service chain table is indexed by the service chain identifier SFC-ID, and the next hop microservice identifier can be found.

[0036] In the SRv6 or SR-MPLS network environment, each SR Policy (Segment Routing Policy) is associated with a Binding SID, and the data packet is guided to the associated SR Policy by the BSID (Binding Segment identifier). In the SRv6 network, if the destination IPv6 address of the message received by the network device is the BSID of a certain SR Policy, the message is forwarded through the SR Policy. In the SR-MPLS network, the network device receives the data packet with the BSID as the top label, and the data packet is guided to the SR Policy associated with the BSID, the BSID label is popped out, and the label stack of the associated SR Policy is pushed in. The BSID can be associated with a tunnel to guide the traffic to the tunnel.

[0037] According to an embodiment, as shown in FIG. 3, the application APP encapsulates the service chain identifier SFC-ID and the identifier Service-ID A of the first service node Service A into the message of the application traffic through the proxy proxy.

[0038] According to an embodiment, in the SRv6 or SR-MPLS network environment, the application access service-aware gateway I receives the application traffic message, parses the Service-ID A carried in the message, queries the service routing or computing power routing according to the Service-ID A, and guides the application traffic message to the SR Policy through the network device included in the underlay network. Guiding the application traffic message to the SR Policy can include various ways. According to a specific embodiment, the BSID A encapsulated to the service-aware gateway A is guided by the network device included in the underlay network to the SR Policy associated with the BSID A, and the service-aware scheduling is performed through the forwarding path of the underlay network.

[0039] After the traffic is forwarded to the service-aware gateway A, the service identifier Service-ID A carried in the message is parsed, the service routing or computing power routing is queried, the Service-ID A is obtained as a local service, the BSID A is removed, and the message is handed over to the service proxy node Proxy A for processing.

[0040] The service proxy node Proxy A caches the service chain identifier SFC-ID and the service identifier Service-ID A, and terminates the network layer routing forwarding of the message, and transfers the message payload to the service node Service A for processing.

[0041] After the service node Service A processes the update payload data, a message is sent out, and the message is acquired by the service proxy node Proxy A again. According to the service chain identifier SFC-ID recorded previously, the service chain table is queried, and it is known that the next service identifier is Service-ID B. The service identifier Service-ID B is encapsulated into the message, and the forwarding processing of the next service node Service B is initiated.

[0042] The service-aware gateway A receives the application traffic sent back by the service proxy node Proxy A, parses the service identifier Service-ID B carried in the message, queries the service routing or computing power routing, and guides the application traffic message to the SR Policy through the network devices included in the underlying network. Guiding the application traffic message to the SR Policy can include various ways. According to one specific embodiment, the BSID B encapsulated to the service-aware gateway B is guided to the SR Policy associated with each BSID B by the network devices included in the underlying network, and the message is forwarded to the service-aware gateway B through the underlying network.

[0043] For the above service routing or computing power routing, it can be stored in the service-aware gateway and jointly generated according to the network resource state and the service resource state when the service routing or computing power routing is calculated by the algorithm network business orchestrator or the service-aware gateway. Taking the service-aware gateway A as an example, the service routing or computing power routing can be as shown in Table 2 or Table 3:

[0044] Table 2

[0045] Table 3

[0046] According to Table 2, the out-interface includes the interface of the service proxy node corresponding to the destination service node (for example, the service proxy node Proxy A corresponding to Service A) and the interface of the service-aware gateway corresponding to the destination service node (for example, the service-aware gateway B corresponding to Service B).

[0047] According to Table 3, the next hop node includes the local service proxy node (for example, the service proxy node Proxy A corresponding to Service A) and the service-aware gateway corresponding to the destination service node (for example, the service-aware gateway B corresponding to Service B).

[0048] The traffic is forwarded to the service-aware gateway B, and the processing of the service proxy node Proxy B is similar to the processing of the service proxy node Proxy A. The traffic is forwarded to the service-aware gateway C, and the processing of the service proxy node Proxy C is similar to the processing of the service proxy nodes Proxy A and Proxy B. Finally, all microservices in the service chain Service List are processed.

[0049] For each service node Service A, Service B, and Service C, the same or similar processing procedure is performed, and the difference is that the services or functions provided by the service nodes are different, for example, Service A provides decoding, Service B provides encryption, and Service C provides rendering. The functions or services of the service nodes are scheduled through serial chain access to realize the functions or services of a specific application.

[0050] FIG. 4 is a processing flowchart for implementing end-to-end application microservices by establishing chain scheduling according to an embodiment of the present disclosure. As shown in FIG. 4, the service operation management pre-orchestrates a certain application APP into a group of services according to the services involved in the application, and the services are executed in series by Service A, Service B, and Service C to meet the application requirements. The application is represented by a service chain identifier and service identifiers as (SFC-ID1, Service-ID A, Service-ID B, Service-ID C). Each service node accesses the service-aware gateway through a respective microservice proxy node and accesses the operator's wide area network.

[0051] According to an embodiment, the APP application end submits an application service request to the network, and the request includes the execution strategy of services A, B, and C and the bandwidth, latency, and other index requirements. In the application chain service scenario, the processing flow of the present application for establishing chain scheduling to implement end-to-end application microservices includes the following steps, as shown in FIG. 4:

[0052] Step 1: The application APP encapsulates the service chain identifier SFC-ID and the service identifier Service-ID A of the first service node Service A into the application traffic packet through the proxy node proxy.

[0053] Step 2: After receiving the application traffic message, the application access service-aware gateway I parses the service identifier Service-ID A carried in the message, queries the service route or computing power route according to Service-ID A, and guides the application traffic message to the SR Policy through the network devices contained in the underlying network. Guiding the application traffic message to the SR Policy can include various ways. According to a specific embodiment, the BSID A encapsulated to the service-aware gateway A guides the application traffic message to the SR Policy associated with each BSID A through the forwarding path of the underlying network, and performs service-aware scheduling.

[0054] Step 3: After the application traffic message is forwarded to the service-aware gateway A, the service-aware gateway A parses the service identifier Service-ID A carried in the message, queries the service route or computing power route, obtains that Service-ID A is a local service, removes BSID A, and hands the message to the service proxy node Proxy A for processing.

[0055] Step 4: The service proxy node Proxy A caches the service chain identifier SFC-ID and the service identifier Service-ID A, and terminates the network layer routing and forwarding of the message, and transfers the message payload to the service node Service A for processing.

[0056] Step 5: After the service node Service A processes the updated payload data, a message is issued, and the message is again obtained by the service proxy node Proxy A.

[0057] Step 6: The service proxy node Proxy A queries the service chain table according to the service chain identifier SFC-ID recorded previously, and knows that the next service identifier is Service-ID B, encapsulates Service-ID B into the message, and initiates the forwarding processing of the next service node Service B.

[0058] Step 7: The service-aware gateway A receives the application traffic returned by the service proxy node Proxy A, parses the service identifier Service-ID B carried in the message, queries the service route or computing power route, and guides the application traffic message to the SR Policy through the network devices contained in the underlying network. Guiding the application traffic message to the SR Policy can include various ways. According to a specific embodiment, the BSID B encapsulated to the service-aware gateway B guides the application traffic message to the SR Policy associated with each BSID B through the network devices contained in the underlying network, and forwards the message to the service-aware gateway B through the underlying network.

[0059] Step 8: After the application traffic message is forwarded to the service-aware gateway B, the operation performed by the service-aware gateway B is as shown in step 3.

[0060] Step 9: The operation performed by the service proxy node Proxy B is as shown in step 4.

[0061] Step 10: The operation performed by the service node Service B is as shown in step 5.

[0062] Step 11: The operation performed by the service proxy node Proxy B is as shown in step 6.

[0063] Step 12: The operation performed by the service-aware gateway B is as shown in step 7.

[0064] Step 13: After the application traffic message is forwarded to the service-aware gateway C, the operation performed by the service-aware gateway C is as shown in step 3 or step 8.

[0065] Step 14: The operation performed by the service proxy node Proxy C is as shown in step 4 or step 9.

[0066] In the above embodiment, the services involved by the specific application APP include three services of Service A, Service B and Service C. It can be understood by those skilled in the art that the above service division is only an example. According to actual needs, the specific application APP can include different numbers of services, and the nodes providing the same service are usually more than one, which can be selected and combined according to actual requirements. These all belong to the range covered by the present disclosure.

[0067] On the basis of the embodiments shown in FIGS. 1 to 4, according to one aspect of the embodiments of the present disclosure, a chain scheduling method for application services implemented by a service-aware gateway is provided, as shown in FIG. 5. After the application traffic message is forwarded to the service-aware gateway, the service-aware gateway parses the service identifier Service-ID carried in the message, queries the service route or the computing power route, and determines whether the destination service node corresponding to the Service-ID is a local service node. In the case where it is determined that the Service-ID is a local service node, the BSID is removed, and the message is handed over to the corresponding service proxy node Proxy for processing. In the case where it is determined that the destination service node corresponding to the Service-ID is not a local service node, the application traffic message is guided to the SR Policy through the network device contained in the underlying network. According to one specific embodiment, the BSID of the service-aware gateway corresponding to the destination service node is encapsulated in the application traffic message, so as to guide the application traffic message to the SR Policy associated with the BSID through the network device contained in the underlying network, thereby realizing the forwarding of the application traffic message via the underlying network.

[0068] On the basis of the embodiments shown in FIGS. 1-4, according to another aspect of the embodiments of the present disclosure, a chain scheduling method of application service implemented by a service proxy node is provided, as shown in FIG. 6. After receiving the application traffic message, the service proxy node determines whether the ingress interface of the application traffic message is a service-aware gateway or a service node. In the case where the ingress interface of the application traffic message is determined to be a service-aware gateway, the service proxy node records the service chain identifier and the service identifier carried in the application traffic message, and forwards the application traffic message to the service node corresponding to the service proxy node for processing. In the case where the ingress interface of the application traffic message is determined to be a service node, the next-hop service identifier is obtained by querying the service chain table according to the recorded service chain identifier, the next-hop service identifier is encapsulated into the application traffic message, and the application traffic message is forwarded to the service-aware gateway corresponding to the service proxy node.

[0069] On the basis of the embodiments shown in FIGS. 1-4, according to another aspect of the embodiments of the present disclosure, a chain scheduling method of application service implemented by a service node is provided, as shown in FIG. 7. After receiving the application traffic message, the service node processes the application traffic message, and then sends the processed application traffic message to the corresponding service proxy node. The service proxy node intercepts the processed application traffic message, so that the service proxy node encapsulates the processed application traffic message by using the obtained next-hop service identifier, and forwards the processed application traffic message to the corresponding service-aware gateway.

[0070] According to the chain scheduling system and method of application service provided by the embodiments of the present disclosure, by designing the application service chain scheduling architecture of the application service layer, the service proxy layer and the network forwarding layer, and the serial chain access scheduling method between services, not only the end-to-end network path of the service can be overall arranged from the centralized perspective, but also the network path can be segmented and planned, and the scheduling of the application service traffic can be realized segment by segment.

[0071] In the above embodiments, the description of each embodiment focuses on different aspects, and the parts not described in detail in a certain embodiment can be referred to the related description of other embodiments.

[0072] It should be noted that, for the foregoing method embodiments, in order to simply describe, each is described as a combination of a series of actions, but those skilled in the art should know that the embodiments of the present disclosure are not limited to the order of the actions described, because according to the embodiments of the present disclosure, certain steps can be performed in other order or at the same time. Secondly, those skilled in the art should know that the embodiments described in the specification are all optional embodiments, and the actions and modules involved are not necessarily required by the embodiments of the present disclosure.

[0073] In several embodiments provided in the present disclosure, it should be understood that the disclosed apparatus can be implemented in other manners. For example, the division of the apparatus embodiments is merely an example, and the division of the units can be different, for example, multiple units or components can be combined, or some features can be ignored or not executed. In addition, the displayed or discussed mutual couplings or direct couplings or communication connections can be indirect couplings or communication connections through some interfaces, devices or units, and can be in electrical, mechanical or other forms.

[0074] Referring to FIG. 8, a wireless communication device is provided, including a processor and a memory. The memory stores computer instructions or one or more programs, when the computer instructions or one or more programs are executed by the processor, the processor executes the computer instructions to implement the method and refinement shown in FIGS. 5-7.

[0075] It should be understood that the above-described apparatus embodiments are merely illustrative, and the disclosed apparatus can also be implemented in other manners. For example, the division of the units / modules in the above-described embodiments is merely a logical function division, and actual implementation can be in another manner. For example, multiple units, modules or components can be combined, or can be integrated into another system, or some features can be ignored or not executed.

[0076] In addition, each functional unit / module in each embodiment of the present disclosure can be integrated in one unit / module, or each unit / module can exist physically, or two or more units / modules can be integrated together. The integrated unit / module can be implemented in the form of hardware or software program module.

[0077] The integrated units / modules, if implemented in the form of hardware, can be digital circuits, analog circuits, etc. The physical implementation of the hardware structure includes, but is not limited to, transistors, memristors, etc. Unless otherwise specified, the processor or chip can be any appropriate hardware processor, such as a CPU, a GPU, an FPGA, a DSP, an ASIC, etc. Unless otherwise specified, the on-chip cache, off-chip memory, and storage can be any appropriate magnetic storage medium or magneto-optical storage medium, such as resistive random access memory (RRAM), dynamic random access memory (DRAM), static random access memory (SRAM), enhanced dynamic random access memory (EDRAM), high-bandwidth memory (HBM), hybrid memory cube (HMC), etc.

[0078] The integrated units / modules, if implemented in the form of software program modules and sold or used as independent products, can be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of the present disclosure, essentially or in part, or all or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium, and includes a number of instructions for making a computer electronic device (which can be a personal computer, a server, or a network electronic device, etc.) execute all or part of the steps of the methods described in various embodiments of the present disclosure. The aforementioned storage medium includes: a U disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a mobile hard disk, a magnetic disk or an optical disk, and various media that can store program codes.

[0079] The embodiments of the present disclosure also provide a non-transitory computer-readable storage medium storing one or more computer programs, which, when executed by a plurality of processors, cause the processors to perform the methods shown in FIGS. 5 to 7 and the refinements.

[0080] Reference within this specification to features, advantages, or similar language does not imply that all of the features and advantages that can be realized from the present solution should be or are contained in, or must be realized in, any single

[0081] Furthermore, the described features, advantages, and characteristics of the present solution can be combined in any suitable manner in one or more embodiments. One skilled in the relevant art will recognize, in light of the description herein, that the present solution can be practiced without one or more of the specific features or advantages of a particular embodiment. In other instances, additional features and advantages can be recognized in light of the

[0082] The above describes the embodiments of the present disclosure in detail, and the principles and implementation manners of the embodiments of the present disclosure are described by applying specific examples. The above description of the embodiments is only for helping to understand the method and core idea of the embodiments of the present disclosure. Meanwhile, the person skilled in the art can make changes or deformations according to the idea of the embodiments of the present disclosure, based on the specific implementation manners and application scope of the present disclosure. The changes or deformations are all within the protection scope of the embodiments of the present disclosure. In summary, the content of the present specification should not be understood as limiting the embodiments of the present disclosure.

Claims

1. A chain scheduling method of application service, applied to a service-aware gateway, comprising: parsing a received application traffic message to obtain a service identifier, wherein the application traffic message contains a service chain identifier and the service identifier; inquiring a service route according to the service identifier to determine a destination service node of the application traffic message; and in a case where the destination service node is not a local service node, guiding the application traffic message to an SR Policy through a network device contained in an underlying network, thereby realizing forwarding the application traffic message via the underlying network.

2. The method of claim 1, wherein, Further comprising: in a case where the destination service node is a local service node, forwarding the application traffic message to a service proxy node corresponding to the service-aware gateway.

3. The method of claim 1 or 2, wherein, The service route comprises a corresponding relationship between a service identifier and an out interface or a corresponding relationship between a service identifier and a next hop node, wherein the out interface comprises an interface of a service proxy node corresponding to the destination service node and an interface of a service-aware gateway corresponding to the destination service node, and the next hop node comprises a local service proxy node and a service-aware gateway corresponding to the destination service node.

4. The method of claim 1 or 2, wherein, The guiding of the application traffic message to the SR Policy through the network device contained in the underlying network comprises: encapsulating a BSID of a service-aware gateway corresponding to the destination service node in the application traffic message; and guiding the application traffic message to an SR Policy associated with the BSID through the network device contained in the underlying network. 5.A chain scheduling method of application service, applied to a service proxy node, comprising: receiving an application traffic message; inquiring a service chain table according to a service chain identifier in response to an in interface of the application traffic message being a corresponding service node to obtain a next hop service identifier; encapsulating or updating the next hop service identifier into the application traffic message; and forwarding the application traffic message to a service-aware gateway corresponding to the service proxy node. Further comprising:

6. The method of claim 5, wherein, in response to the in interface of the application traffic message being a service-aware gateway, recording a service chain identifier and a service identifier carried in the application traffic message; and forwarding the application traffic message to a service node corresponding to the service proxy node. The service chain table comprises a service chain identifier and a next hop service identifier, or comprises a service chain identifier and a service chain. 8.A chain scheduling method of application service, applied to a service node, comprising:

7. The method of claim 5 or 6, wherein, receiving an application traffic message; processing the application traffic message; and sending the processed application traffic message to a corresponding service proxy node, so that the service proxy node encapsulates the processed application traffic message through a next hop service identifier obtained by the service proxy node and forwards the processed application traffic message to a corresponding service-aware gateway. 9.A chain scheduling system of application service, comprising a service-aware gateway, a service proxy node and a service node, wherein: ​ ​ ​ The service-aware gateway is configured to parse a received application traffic message to obtain a service identifier, query a service route according to the service identifier, determine a destination service node of the application traffic message, and forward the application traffic message to a service proxy node corresponding to the service-aware gateway in a case where the destination service node is a local service node. The service proxy node is configured to record a service chain identifier and a service identifier carried in the application traffic message in response to an ingress interface of the application traffic message being a service-aware gateway, and forward the application traffic message to a service node corresponding to the service proxy node. The service node is configured to process the application traffic message and send the processed application traffic message to a corresponding service proxy node. The service proxy node is configured to query a service chain table according to a service chain identifier in response to an ingress interface of the application traffic message being a corresponding service node, obtain a next-hop service identifier, encapsulate or update the next-hop service identifier into the application traffic message, and forward the application traffic message to a service-aware gateway corresponding to the service proxy node. The service-aware gateway is configured to parse a received application traffic message to obtain a service identifier, query a service route according to the service identifier, determine a destination service node of the application traffic message, and guide the application traffic message to an SR Policy through a network device included in an underlying network in a case where the destination service node is not a local service node, thereby realizing forwarding of the application traffic message via the underlying network.

10. A wireless communication device comprising a memory storing one or more programs and one or more processors electrically coupled to the memory and configured to execute the one or more programs to perform the method of any of claims 1-8.

11. A non-transitory computer-readable storage medium storing one or more programs configured to, when executed by a processor, perform the method of any of claims 1-8.

Images