Business scheduling method and related equipment

Abstract

The present application provides a service scheduling method and related equipment. The service scheduling method includes: sending a high-priority service tag to the edge node of the adjacent domain to notify the existence of high-priority services within the own domain, generating a second path compression sequence based on the first path compression sequence sent by the edge node, and sending the second path compression sequence to the high-priority service source node in the own domain, so that the high-priority service source node forwards the high-priority service data packet to the destination node according to the second path compression sequence. The solution of the present application meets the cross-domain scheduling requirements of high-priority services to avoid network congestion and can avoid increasing the burden on routers.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a service scheduling method and related equipment. Background Art

[0002] To help high-priority services avoid network congestion, multipath routing is a common network-side approach in multi-service scheduling. However, the existing Internet has over a million routing prefixes, placing significant pressure on routers. Introducing multipath routing entries for multi-service scheduling would further increase the burden on routers.

[0003] In the related art, segment routing is introduced, stacked at the head node, and the segment routing header SRH is compressed, but it only supports compression within the domain (within the AS) and does not support wide area network application scenarios (inter-domain scenarios across ASs). Summary of the Invention

[0004] In view of this, the purpose of this application is to propose a service scheduling method and related equipment to solve or partially solve the above problems.

[0005] In a first aspect, the present application provides a service scheduling method with a first node device as an execution subject, including:

[0006] Sending a high-priority service tag to an edge node of an adjacent domain to establish a connection with the adjacent domain and notify the presence of a high-priority service in the own domain; wherein the adjacent domain includes the destination node;

[0007] receiving a first path compression sequence and a first path compression sequence existence flag sent by the edge node; wherein the first path compression sequence and the first path compression sequence existence flag are generated by the edge node in response to determining that the high priority service is marked as existing and a first congested link exists in the adjacent domain;

[0008] In response to determining that the first path compression sequence existence mark is present and a second congested link exists in the own domain, generating a second path compression sequence according to the first path compression sequence;

[0009] The second path compression sequence is sent to a high-priority service source node in its own domain, so that the high-priority service source node forwards the high-priority service data packet to the destination node according to the second path compression sequence.

[0010] In a second aspect of the present application, a service scheduling method with a second node device as an execution subject is provided, comprising:

[0011] receiving a high-priority service tag sent by the first node device;

[0012] In response to determining that the high-priority service is marked as existing and a first congested link exists in the domain where the high-priority service is located, generating a first path compression sequence and a first path compression sequence existence mark;

[0013] The first path compression sequence and the first path compression sequence existence mark are sent to the first node device.

[0014] In a third aspect of the present application, a service scheduling method with a third node device as an execution subject is provided, comprising:

[0015] receiving a second path compression sequence sent by a first node device within its own domain; wherein the second path compression sequence is generated by the first node device based on the first path compression sequence in response to determining that the first path compression sequence existence mark is present and a second congested link exists within its own domain; and the first path compression sequence is generated by a second node device in an adjacent domain in response to determining that the high-priority service mark sent by the first node device is present and a first congested link exists within the adjacent domain;

[0016] The high-priority service data packet is forwarded to a destination node in an adjacent domain according to the second path compression sequence.

[0017] In a fourth aspect of the present application, a first node device is provided, including:

[0018] A memory, a processor, and a computer program stored in the memory and executable by the processor, wherein the processor implements the method described in the first aspect when executing the computer program.

[0019] In a fifth aspect, the present application provides a second node device, including:

[0020] A memory, a processor, and a computer program stored in the memory and executable by the processor, characterized in that when the processor executes the computer program, the method described in the second aspect is implemented.

[0021] In a sixth aspect of the present application, a third node device is provided, including:

[0022] A memory, a processor, and a computer program stored in the memory and executable by the processor, characterized in that when the processor executes the computer program, the method described in the third aspect is implemented.

[0023] In a seventh aspect, the present application provides a service scheduling system, including:

[0024] The first node device as described in the fourth aspect;

[0025] The second node device as described in the fifth aspect;

[0026] The third node device as described in the sixth aspect.

[0027] As can be seen from the above, the service scheduling method and related equipment provided by the present application send a high-priority service tag to the edge node of the adjacent domain to notify the existence of high-priority services in its own domain, and generate a second path compression sequence based on the first path compression sequence sent by the edge node, and send the second path compression sequence to the high-priority service source node in its own domain, so that the high-priority service source node forwards the high-priority service data packet to the destination node according to the second path compression sequence, thereby meeting the cross-domain scheduling requirements of high-priority services in wide area network scenarios to avoid network congestion and avoid increasing the burden on routers. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] In order to more clearly illustrate the technical solutions in this application or related technologies, the following briefly introduces the drawings required for use in the embodiments or related technical descriptions. Obviously, the drawings described below are merely embodiments of this application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.

[0029] Figure 1 This is a flow chart of a service scheduling method with a first node device as the execution subject according to an embodiment of the present application;

[0030] Figure 2 A schematic diagram of an exemplary SRH compression algorithm according to an embodiment of the present application;

[0031] Figure 3 A schematic diagram of an exemplary service scheduling method according to an embodiment of the present application;

[0032] Figure 4 This is a flow chart of a service scheduling method with a second node device as the execution subject according to an embodiment of the present application;

[0033] Figure 5 This is a flow chart of a service scheduling method with a third node device as the execution subject according to an embodiment of the present application;

[0034] Figure 6 This is a structural diagram of the first node device of an embodiment of the present application. DETAILED DESCRIPTION

[0035] In order to make the objectives, technical solutions and advantages of this application more clear, the embodiments of this application are described in detail below with reference to the accompanying drawings.

[0036] It should be noted that, unless otherwise defined, the technical terms or scientific terms used in the embodiments of the present application should have the usual meanings understood by people with ordinary skills in the field to which this application belongs. The "first", "second" and similar words used in the embodiments of the present application do not indicate any order, quantity or importance, but are only used to distinguish different components. "Include" or "comprise" and similar words mean that the elements or objects appearing before the word cover the elements or objects listed after the word and their equivalents, without excluding other elements or objects. "Connect" or "connected" and similar words are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. "Up", "down", "left", "right" and the like are only used to indicate relative positional relationships. When the absolute position of the described object changes, the relative positional relationship may also change accordingly.

[0037] Due to the imbalance between my country's power energy production and economic development, the traffic carried by the corresponding communication networks has also shown similar imbalances. Specifically, the traffic transmission of business traffic crosses the scope, and the load of routing equipment varies greatly, resulting in frequent network congestion. In order to enable high-priority services to avoid network congestion, multi-path routing is a common method on the network side in multi-service scheduling methods. However, the number of routing prefixes in the existing Internet has exceeded one million, and the routers are under great pressure. If multi-path routing entries are introduced for multi-service scheduling, such as two-dimensional routing, policy routing, and centrally controlled SD-WAN (Software Defined Wide Area Network) flow tables, the burden on routers will be further increased.

[0038] In related technologies, segment routing, which pushes packets at the head node, can effectively reduce the number of FIBs (Forwarding Information Bases) in intermediate routers. Segment routing technology features source routing, statelessness, and support for centralized control. This approach requires only the head node to store transit point information in the Segment Routing Header (SRH). Intermediate nodes do not need to maintain FIB entries for multipath routing and can simply forward packets based on the SRH.

[0039] However, due to MTU (Maximum Transmission Unit) limitations and potentially long paths in wide area networks, SRH packets can contribute to a high proportion of control information, leading to poor bandwidth utilization. This is particularly true in IPv6 (Internet Protocol Version 6) networks, where IPv6 addresses are large and SRv6 (Segment Routing IPv6) intermediate nodes do not pop the stack, but only move the identifiers of the current transit point. This can significantly impact bandwidth utilization. Therefore, SRH compression is necessary.

[0040] Related art SRH compression schemes combined with multipath routing only support intra-domain compression, that is, compression within an autonomous system (AS). They do not support wide area network (WAN) scenarios (inter-AS scenarios). However, in WAN scenarios, SRHs are longer due to longer paths, making SRH compression even more necessary.

[0041] In view of this, an embodiment of the present application provides a service scheduling method and related equipment, which sends a high-priority service tag to the edge node of an adjacent domain to notify the existence of high-priority services within the own domain, generates a second path compression sequence based on the first path compression sequence sent by the edge node, and sends the second path compression sequence to the high-priority service source node in the own domain, so that the high-priority service source node forwards the high-priority service data packet to the destination node according to the second path compression sequence, thereby meeting the cross-domain scheduling requirements of high-priority services to avoid network congestion. In addition, the solution of the present application supports wide area network application scenarios and can avoid increasing the burden on routers.

[0042] refer to Figure 1 , is a flow chart of a service scheduling method with the first node device as the execution subject in an embodiment of the present application. Figure 1 As shown, the method may include the following steps.

[0043] Step S101: Send a high-priority service tag to an edge node of an adjacent domain to notify the existence of a high-priority service in its own domain; wherein the adjacent domain includes a destination node.

[0044] In this embodiment, the high-priority service tag can be based on the BGP protocol (Border Gateway Protocol) and rely on the BGP-OPEN extended message. Specifically, the BGP-OPEN extended message can also include six fields to enable the self-domain to establish a BGP connection with the adjacent domain. The six fields are: BGP protocol version number, sender's AS domain number, time interval, sender ID, optional parameters, and the length of the optional parameters; among them, a high-priority service tag field can be added to the optional parameter field to indicate the presence of high-priority services in the self-domain; it can be understood that the value of the length field in response to the optional parameter is 0, indicating that there are no optional parameters.

[0045] During specific implementation, the initial value of the high priority service flag field may be marked as 0, indicating that it is empty; and the value of the high priority service flag field is updated to 1, indicating that there is a high priority service in the own domain.

[0046] In this embodiment, the own domain is logically connected to the adjacent domain, and a connection is established using TCP (Transmission Control Protocol); then the above-mentioned BGP-OPEN extended message is transmitted to the edge node of the adjacent domain in the form of unicast, thereby establishing a BGP connection with the adjacent domain, and notifying the adjacent domain that there is a high-priority service in the domain where the own node is located.

[0047] In this way, this embodiment realizes routing and data transmission between ASes based on the BGP protocol; and expands on the existing BGP-OPEN message by adding a high-priority service tag field to the optional parameter field to inform the adjacent domain of the existence of high-priority services in its own domain.

[0048] Step S102: Receive a first path compression sequence and a first path compression sequence existence flag sent by the edge node; wherein the first path compression sequence and the first path compression sequence existence flag are generated by the edge node in response to determining that the high priority service is marked as existing and a first congested link exists in the adjacent domain.

[0049] In this embodiment, both the first path compression sequence and the first path compression sequence presence flag can be based on the BGP protocol and rely on a BGP-UPDATE extended message. The BGP-UPDATE extended message can also include five fields to enable the own domain to exchange routing information with the adjacent domain. The five fields are: a list of routes to be revoked, the length of infeasible routes, a list of route attributes to be updated, a list of address prefixes to be updated, and the lengths of the list of route attributes to be updated and the list of address prefixes to be updated.

[0050] Specifically, the BGP-UPDATE extended message can include a "First Path Compression Sequence Existence Flag" field in the "To-Update Routing Attribute List" field to indicate the existence of a path compression sequence for high-priority services. The "First Path Compression Sequence" field can also be included in the "To-Update Address Prefix List" field to store and describe the path for high-priority services. In response to the values ​​of 0 in the "To-Update Routing Attribute List" and "To-Update Address Prefix List" length fields, it indicates that no routes and their routing attributes are to be announced. The specific process for the second node device (i.e., the edge node of the adjacent domain) to generate the first path compression sequence and the "First Path Compression Sequence Existence Flag" will be described later.

[0051] It can be understood that the initial value of the first path compression sequence existence flag field can be marked as 0, indicating that it is empty; updating the value of the first path compression sequence existence flag field to 1 indicates that there is a path compression sequence for high priority services (ie, the first path compression sequence).

[0052] Step S103: In response to determining that the first path compression sequence existence mark is present and a second congested link exists in the own domain, generate a second path compression sequence according to the first path compression sequence.

[0053] In some embodiments, using the example of a BGP-UPDATE extended message containing the first path compression sequence and the first path compression sequence presence flag, a received BGP-UPDATE extended message is parsed, and subsequent execution steps are determined based on the parsing results. The parsing process may include: querying the first path compression sequence presence flag field; if the value of the field is 0, terminating the parsing process and subsequent tasks; and if the value of the field is 1, detecting network congestion within the domain and, if a second congested link exists within the domain, generating a second path compression sequence based on the first path compression sequence.

[0054] In some optional embodiments, in response to the presence of a second congested link within the local domain, the first path compression sequence field of the BGP-UPDATE extended message is retrieved and used as the first field; a second detour path with minimal overhead to the high-priority service source node is calculated, and the second detour path is compressed to obtain a second field; and the second path compression sequence is generated based on the first field and the second field. Specifically, the method for calculating the second detour path can adopt the Dijkstra algorithm; the method for compressing the calculated second detour path can adopt the SRH compression algorithm.

[0055] refer to Figure 2 , is a schematic diagram of an exemplary SRH compression algorithm. Figure 2The path information from A to J is shown. In response to the congestion of the link {C, H}, the node before the fault C and the node after the fault H are determined, and the cost of the link {C, H} is changed from 2 to ∞. Specifically, the detour path between the node before the fault C and the node after the fault H is calculated, as shown in Figure 2 As shown, three paths can be included: C→E→F→H (path 1), C→D→H (path 2), and C→G→H (path 3), with the costs of these three paths being 6, 3, and 7, respectively. Thus, by using the Dijkstra algorithm, path 2 can be determined to be the optimal detour path between node C before the fault and node H after the fault, i.e., the detour path with the lowest cost. Therefore, nodes C, D, and H involved in path 2 are stacked into the SRH to obtain the corresponding path compression sequence. Node C is at the top of the stack, and node H is at the bottom.

[0056] In another embodiment, the target node for the high-priority service does not include the destination node, meaning that there is currently no high-priority service destined for the destination node within the domain. Therefore, in this embodiment, only the first path compression sequence field of the BGP-UPDATE extended message needs to be retrieved and saved. When high-priority service destined for the destination node subsequently appears within the domain, a corresponding path compression sequence is generated based on the saved first path compression sequence field. In this way, when high-priority service destined for the destination node appears within the domain, subsequent operations can be performed directly based on the saved first path compression sequence, without having to wait for the first path compression sequence to be received. This improves data transmission efficiency and reduces network resource usage during transmission.

[0057] Step S104: Send the second path compression sequence to the high-priority service source node in its own domain, so that the high-priority service source node forwards the high-priority service data packet to the destination node according to the second path compression sequence.

[0058] In this embodiment, the second path compression sequence may be based on the OSPF protocol (Open Shortest Path First) and encapsulated as an advertisement message within the own domain under the OSPF protocol.

[0059] refer to Figure 3 , is a schematic diagram of an exemplary service scheduling method (wherein, VIP indicates the presence of high-priority services, and R1, R2, R3, R4, R5, R6, R7, R8, and R9 are edge nodes in their respective domains). Figure 3As shown, there is no high-priority service in AS3, but there is high-priority service in AS2, AS4, AS5, and AS6, and AS1 is the adjacent domain corresponding to these domains; node D in AS1 is the destination node, node S in AS2 is the source node of the high-priority service, and the target nodes of the high-priority service in AS4, AS5, and AS6 do not include the destination node D (that is, AS4, AS5, and AS6 currently do not have high-priority service going to the destination node D).

[0060] It is understandable that Figure 3 As shown, R2, R7, R8, and R9 each send a high-priority service tag to R1 to notify AS1 of the presence of a high-priority service within their own domain (AS2, AS4, AS5, and AS6). They receive a first path compression sequence and a first path compression sequence presence tag sent by R1, where the first path compression sequence and the first path compression sequence presence tag are generated by R1 in response to determining that the high-priority service tag is present and a first congested link exists within AS1. In response to determining that the first path compression sequence presence tag is present and a congested link exists within their own domain, R2 generates a second path compression sequence based on the first path compression sequence. R7, R8, and R9 each only save the first path compression sequence, waiting for a high-priority service to be sent to a destination node D within their own domain (AS4, AS5, and AS6), and then generate a corresponding path compression sequence based on the saved first path compression sequence. R2 sends the second path compression sequence to the high-priority service source node S, so that node S forwards the high-priority service data packet to the destination node D according to the second path compression sequence.

[0061] It should be noted that AS2 is directly connected to AS1, so R2 directly sends the high-priority service tag to R1, and does not send the high-priority service tag from R3 to R5 and then to R6 via R4.

[0062] Figure 4 FIG. 1 shows a flow chart of a service scheduling method with the second node device as the execution subject according to an embodiment of the present application. Figure 4 As shown, the method may include the following steps.

[0063] Step S401: Receive a high-priority service tag sent by a first node device.

[0064] Step S402: In response to determining that the high-priority service is marked as existing and a first congested link exists in the domain where the high-priority service is located, generate a first path compression sequence and a first path compression sequence existence mark.

[0065] In some embodiments, taking the high-priority service tag as an example, the received BGP-OPEN extension message is parsed, and subsequent execution steps are determined based on the parsing results. The parsing process may include: querying the high-priority service tag field; if the value of the field is 0, ending the parsing process and terminating subsequent tasks; and if the value of the field is 1, sensing the network congestion status within the domain, and generating a first path compression sequence if a first congested link exists within the domain.

[0066] In some embodiments, in response to the presence of a first congested link within the local domain, a first detour path with the lowest cost to a destination node within the local domain is calculated, and the first detour path is compressed to obtain the first path compression sequence. Specifically, the method for calculating the first detour path may employ a Dijkstra algorithm, and the method for compressing the calculated first detour path may employ an SRH compression algorithm.

[0067] Step S403: Send the first path compression sequence and the first path compression sequence existence flag to the first node device.

[0068] In some embodiments, taking the first path compression sequence and the first path compression sequence existence mark relying on the BGP-UPDATE extended message as an example, the BGP-UPDATE extended message is sent to the first node device in a unicast form, so that the BGP connection between its own domain and the domain where the first node device is located is maintained, and routing information can be exchanged.

[0069] In this way, this embodiment is based on the BGP protocol and expands on the existing BGP-OPEN message. A first path compression sequence field is added to the address prefix list field to be updated, and a first path compression sequence existence mark field is added to the routing attribute list field to be updated to store and describe the path of high-priority services and mark the compression sequence of the path of the high-priority services, thereby realizing the exchange of routing information between ASs.

[0070] refer to Figure 5 This application also provides a service scheduling method with a third node device (ie, a high-priority service source node) as the execution subject. Figure 5 As shown, the method may include the following steps.

[0071] Step S501: Receive a second path compression sequence sent by a first node device within its own domain; wherein the second path compression sequence is generated by the first node device based on the first path compression sequence in response to determining that a first path compression sequence existence mark is present and a second congested link exists within the own domain; and the first path compression sequence is generated by a second node device in an adjacent domain in response to determining that a high-priority service mark sent by the first node device is present and a first congested link exists within the adjacent domain.

[0072] Step S502: Forward the high-priority service data packet to a destination node in an adjacent domain according to the second path compression sequence.

[0073] In some optional embodiments, the second path compression sequence can be set in the packet header of the high-priority service data packet to forward the high-priority service data packet to the destination node in the adjacent domain according to the second path compression sequence, thereby meeting the cross-domain scheduling requirements of high-priority services to avoid network congestion.

[0074] In some optional embodiments, in response to determining that the top node of the second path compression sequence is directly connected to any node between itself and the destination node, the high-priority service data packet is forwarded to the top node according to the second path compression sequence, and is relayed to the destination node through the top node.

[0075] In this way, a second path compression sequence is added to the SRH, and the SRH is used to guide the forwarding of data packets in the network, so as to achieve the priority forwarding of data packets according to the second path compression sequence, without the need to forward data packets according to the routing table entries in the FIB table, so as to avoid the problem of increasing the number of entries in the FIB table, thereby improving the overall transmission performance of the network.

[0076] Furthermore, in some optional embodiments, the packet header further includes a one-dimensional routing table. In response to determining that the top node of the second path compression sequence is not directly connected to any node between the top node and the destination node, the high-priority service data packet is forwarded to a next-hop node corresponding to the any node according to the one-dimensional routing table, and relayed to the destination node via the next-hop node.

[0077] It should be noted that the above description is limited to some embodiments of the present application. Other embodiments are within the scope of the appended claims. In some cases, the actions or steps recited in the claims may be performed in an order different from that described in the above embodiments and still achieve the desired results. Furthermore, the processes depicted in the accompanying drawings do not necessarily require the specific order or sequential order shown to achieve the desired results. In certain embodiments, multitasking and parallel processing are also possible or may be advantageous.

[0078] It is understood that the method of this embodiment can be applied in a distributed scenario and completed by multiple devices working together. One of the multiple devices may only perform one or more steps in the method of the embodiment of the application, and the multiple devices will interact with each other to complete the method described.

[0079] Based on the same technical concept, the present application also provides a first node device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, it implements the topology construction method described in the corresponding embodiment above. It is understood that the first node device corresponds to the edge node of the domain where the high-priority service source node in the aforementioned method embodiment is located. Furthermore, the first node device has the beneficial effects of the corresponding method embodiment, which will not be elaborated here.

[0080] Figure 6 FIG1 shows a more specific hardware structure diagram of a first node device provided in this embodiment. The device may include: a processor 1010, a memory 1020, an input / output interface 1030, a communication interface 1040, and a bus 1050. The processor 1010, the memory 1020, the input / output interface 1030, and the communication interface 1040 are connected to each other within the device via the bus 1050.

[0081] The processor 1010 can be implemented using a general-purpose CPU (Central Processing Unit), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits, and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this specification.

[0082] The memory 1020 can be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory), static storage devices, dynamic storage devices, etc. The memory 1020 can store an operating system and other application programs. When the technical solutions provided in the embodiments of this specification are implemented through software or firmware, the relevant program code is stored in the memory 1020 and is called and executed by the processor 1010.

[0083] The input / output interface 1030 is used to connect input / output modules to implement information input and output. The input / output modules can be configured as components within the device (not shown in the figure) or can be externally connected to the device to provide corresponding functions. Input devices may include a keyboard, mouse, touch screen, microphone, various sensors, etc., and output devices may include a display, speaker, vibrator, indicator light, etc.

[0084] The communication interface 1040 is used to connect to a communication module (not shown) to enable communication between the device and other devices. The communication module can communicate via a wired method (such as USB, network cable, etc.) or a wireless method (such as mobile network, WiFi, Bluetooth, etc.).

[0085] The bus 1050 comprises a path for transmitting information between the various components of the device (eg, the processor 1010 , the memory 1020 , the input / output interface 1030 , and the communication interface 1040 ).

[0086] It should be noted that although the above device only shows the processor 1010, the memory 1020, the input / output interface 1030, the communication interface 1040, and the bus 1050, in a specific implementation, the device may also include other components necessary for normal operation. In addition, it will be understood by those skilled in the art that the above device may only include the components necessary to implement the embodiments of this specification, and does not necessarily include all the components shown in the figure.

[0087] Furthermore, this application also provides a second node device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, it implements the topology construction method described in the corresponding embodiment above. It is understood that this second node device corresponds to the edge node of the domain where the destination node in the aforementioned method embodiment resides. Furthermore, this second node device has the beneficial effects of the corresponding method embodiment, which will not be further elaborated here.

[0088] Furthermore, this application also provides a third node device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, it implements the topology construction method described in the corresponding embodiment above. It is understood that this third node device corresponds to the high-priority service source node in the aforementioned method embodiment. Furthermore, this third node device has the beneficial effects of the corresponding method embodiment, which will not be further elaborated here.

[0089] In addition, the present application also provides a service scheduling system, including the first node device, the second node device and the third node device. The service scheduling system uses the first node device, the second node device and the third node device to realize the cross-domain scheduling requirements of high-priority services to avoid network congestion in wide area network application scenarios. The first node device sends a high-priority service mark to the second node device to notify the existence of high-priority services in its own domain, and generates a second path compression sequence based on the first path compression sequence sent by the second node device, and sends the second path compression sequence to the third node device, so that the third node device forwards the high-priority service data packet to the destination node according to the second path compression sequence, thereby improving data transmission efficiency, and avoiding the increase of router burden, thereby improving the overall transmission performance of the network.

[0090] Those skilled in the art should understand that the discussion of any of the above embodiments is merely illustrative and is not intended to imply that the scope of the present application (including the claims) is limited to these examples. Within the scope of the present application, the technical features in the above embodiments or different embodiments may be combined, the steps may be implemented in any order, and there are many other variations of the different aspects of the embodiments of the present application as described above, which are not provided in detail for the sake of simplicity.

[0091] In addition, for simplicity of description and discussion, and in order not to make the embodiment of the application difficult to understand, the known power supply / ground connection with integrated circuit (IC) chip and other components may or may not be shown in the accompanying drawings provided. In addition, the device can be shown in the form of a block diagram to avoid making the embodiment of the application difficult to understand, and this also takes into account the following fact, that is, the details of the embodiment of these block diagram devices are highly dependent on the platform to be implemented in the embodiment of the application (that is, these details should be fully within the scope of understanding of those skilled in the art). When specific details (for example, circuit) are set forth to describe exemplary embodiments of the application, it will be apparent to those skilled in the art that the embodiment of the application can be implemented without these specific details or when these specific details are changed. Therefore, these descriptions should be considered to be illustrative rather than restrictive.

[0092] Although the present invention has been described in conjunction with specific embodiments thereof, many alternatives, modifications, and variations of these embodiments will be apparent to those skilled in the art based on the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may utilize the embodiments discussed.

[0093] The embodiments of the present application are intended to cover all such substitutions, modifications, and variations that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the embodiments of the present application should be included in the scope of protection of this application.

Claims

1. A service scheduling method, characterized in that: include: Sending a high-priority service marker to an edge node of an adjacent domain to notify the presence of a high-priority service within the own domain; wherein the adjacent domain includes the destination node; receiving a first path compression sequence and a first path compression sequence presence flag sent by the edge node; wherein the first path compression sequence and the first path compression sequence presence flag are obtained by the edge node, in response to a first congested link in its own domain, calculating a first detour path with the lowest cost between the edge node and a destination node in the domain, and compressing the first detour path to obtain the first path compression sequence; In response to determining that the first path compression sequence is marked as present and a second congested link exists within the local domain, a second path compression sequence is generated based on the first path compression sequence; wherein the second path compression sequence is obtained by the first node device, in response to the second congested link existing within the local domain, using the first path compression sequence as a first field, calculating a second detour path with the lowest overhead between the first node device and the high-priority service source node, compressing the second detour path to obtain a second field, and generating the second path compression sequence based on the first field and the second field; The second path compression sequence is sent to a high-priority service source node in its own domain, so that the high-priority service source node forwards the high-priority service data packet to the destination node according to the second path compression sequence.

2. The method according to claim 1, characterized in that Generating a second path compression sequence according to the first path compression sequence includes: Using the first path compression sequence as a first field; Calculating a second detour path with the minimum overhead to the high-priority service source node, and compressing the second detour path to obtain a second field; The second path compression sequence is generated according to the first field and the second field.

3. A service scheduling method, characterized in that: include: receiving a high-priority service tag sent by the first node device; In response to determining that the high-priority service is marked as present and a first congested link exists in the domain, calculating a first detour path with minimum cost to a destination node in the domain, and compressing the first detour path to obtain a first path compression sequence; The first path compression sequence and the first path compression sequence existence mark are sent to the first node device.

4. A service scheduling method, characterized in that: include: receiving a second path compression sequence sent by a first node device within its own domain; wherein the second path compression sequence is obtained by the first node device, in response to a second congested link in its own domain, using the first path compression sequence as a first field, calculating a second detour path with the lowest cost between the node and a high-priority service source node, compressing the second detour path to obtain a second field, and generating the second path compression sequence based on the first field and the second field; and the presence flag of the first path compression sequence and the first path compression sequence is obtained by the edge node, in response to a first congested link in its own domain, calculating a first detour path with the lowest cost between the node and a destination node within its own domain, and compressing the first detour path to obtain the first path compression sequence. The high-priority service data packet is forwarded to a destination node in an adjacent domain according to the second path compression sequence.

5. The method according to claim 4, characterized in that The second path compression sequence is set in the header of the high priority service data packet, and the header also includes a one-dimensional routing table; The forwarding of the high-priority service data packet to the destination node in the adjacent domain includes: In response to determining that the top node of the second path compression sequence is directly connected to any node between the top node and the destination node, forwarding the high-priority service data packet to the top node according to the second path compression sequence, and relaying the high-priority service data packet to the destination node through the top node; In response to determining that the top node of the second path compression sequence is not directly connected to any node between itself and the destination node, the high-priority service data packet is forwarded to the next-hop node corresponding to the any one node according to the one-dimensional routing table, and is relayed to the destination node through the next-hop node.

6. A first node device, comprising a memory, a processor, and a computer program stored in the memory and executable by the processor, characterized in that: When the processor executes the computer program, the method according to any one of claims 1 to 2 is implemented.

7. A second node device comprising a memory, a processor, and a computer program stored in the memory and executable by the processor, characterized in that: When the processor executes the computer program, the method according to claim 3 is implemented.

8. A third node device, comprising a memory, a processor, and a computer program stored in the memory and executable by the processor, characterized in that: When the processor executes the computer program, the method according to any one of claims 4 to 5 is implemented.

9. A business scheduling system, characterized in that: include: The first node device as claimed in claim 6; The second node device as claimed in claim 7; The third node device as described in claim 8.

Images