Traffic scheduling and path planning method, device, computer equipment and storage medium

Abstract

The present application relates to a method, apparatus, computer equipment, storage medium and computer program product for traffic scheduling and path planning. The method comprises: obtaining carbon emission factor information of the routing node itself; encapsulating the carbon emission factor information in an extended internal gateway protocol, and transmitting the carbon emission factor information of the routing node to other routing nodes and controllers within the autonomous domain based on the extended internal gateway protocol; receiving the traffic transmission path issued by the controller; the traffic transmission path is the transmission path that is calculated by the controller based on a preset constraint factor and the carbon emission factor information of multiple routing nodes within the autonomous domain, and is the optimal transmission path in terms of the constraint factor dimension and the carbon emission dimension; and performing traffic scheduling according to the traffic transmission path. This method can realize energy information transmission and green routing within the autonomous domain.

Description

Technical Field

[0001] The present application relates to the field of network communication technology, and in particular to a traffic scheduling and path planning method, apparatus, computer equipment, storage medium, and computer program product. Background Art

[0002] Promoting "dual carbon" initiatives is an urgent need to address prominent resource and environmental constraints, achieve sustainable development, and align with technological advancements. Large-scale IP networks primarily rely on IGP (Interior Gateway Protocol) for routing and optimization within autonomous domains. Under the dual carbon strategy, low-carbon networks are an inevitable choice. However, current energy-saving solutions primarily focus on optimizing localized device energy consumption. Simply reducing device power consumption for energy conservation has limited effectiveness and lacks the ability to globally perceive and transmit energy information, making it impossible to provide energy-saving solutions for network-wide traffic scheduling and path planning. Summary of the Invention

[0003] Based on this, it is necessary to provide a traffic scheduling and path planning method, device, computer equipment, computer-readable storage medium and computer program product that can realize energy information transmission and green routing within an autonomous domain to address the above technical problems.

[0004] In a first aspect, the present application provides a traffic scheduling method, which is applied to a routing node in an autonomous domain, comprising:

[0005] Obtain the carbon emission factor information of the routing node itself;

[0006] Encapsulating the carbon emission factor information in an extended interior gateway protocol, and transmitting the carbon emission factor information of the routing node to other routing nodes and controllers within the autonomous domain based on the extended interior gateway protocol;

[0007] Receive a traffic transmission path issued by the controller; the traffic transmission path is a transmission path that is calculated by the controller based on a preset constraint factor and carbon emission factor information of multiple routing nodes in the autonomous domain, and is optimal in terms of the constraint factor dimension and the carbon emission dimension;

[0008] Traffic scheduling is performed according to the traffic transmission path.

[0009] In one embodiment, the carbon emission factor includes a standard-defined carbon emission factor and a carbon emission factor of the power system related to the power consumption of the routing node; and before obtaining the carbon emission factor information of the routing node itself, the method further includes:

[0010] The carbon emission factor defined in the standard is rounded to obtain the first carbon emission factor;

[0011] When the carbon emission factor of the power system related to the power consumption of the routing node is a decimal, rounding the carbon emission factor of the power system related to the power consumption of the routing node to obtain a second carbon emission factor;

[0012] The first carbon emission factor and the second carbon emission factor are integrated as the carbon emission factor information of the routing node itself.

[0013] In one embodiment, the carbon emission factor information is encapsulated in an extended internal gateway protocol, including:

[0014] The TLV architecture is extended in the interior gateway protocol to obtain an extended interior gateway protocol;

[0015] In the extended internal gateway protocol, the attribute of the carbon emission factor information is added.

[0016] In one embodiment, in the extended internal gateway protocol, attributes of the carbon emission factor information are added, including:

[0017] Formatting the carbon emission factor information according to the TLV architecture format in the internal gateway protocol to obtain attributes of the carbon emission factor information;

[0018] In the extended internal gateway protocol, the attributes of the carbon emission factor information are added to obtain the encapsulation information of the carbon emission factor information.

[0019] In one embodiment, transmitting the carbon emission factor information of the routing node to other routing nodes and controllers within the autonomous domain based on the extended interior gateway protocol includes:

[0020] Sending the carbon emission factor information of the routing node to other routing nodes in the autonomous domain by flooding;

[0021] In the case where the current routing node is the target node, the carbon emission factor information of the routing node and the carbon emission factor information of other nodes are sent to the controller.

[0022] In one embodiment, performing traffic scheduling according to the traffic transmission path includes:

[0023] When the traffic transmission path sent by the controller includes multiple traffic transmission paths, determining at least one routing node corresponding to each of the traffic transmission paths;

[0024] Calculating a sum of quantitative values ​​of attributes of the carbon emission factor information of the at least one routing node;

[0025] Filtering out the traffic transmission path with the smallest sum of the quantity values ​​as the target traffic transmission path;

[0026] Traffic scheduling is performed according to the target traffic transmission path.

[0027] In a second aspect, the present application also provides a traffic path planning method, which is applied to a controller, comprising:

[0028] receiving encapsulated information sent by a target routing node within an autonomous domain; the encapsulated information includes carbon emission factor information of multiple routing nodes in the autonomous domain; the carbon emission factor information of each routing node is encapsulated in an extended interior gateway protocol and transmitted between routing nodes within the autonomous domain based on the extended interior gateway protocol; the target routing node is one of the multiple routing nodes in the autonomous domain;

[0029] Based on the carbon emission factor information of the multiple routing nodes and the preset constraint factors, calculate a transmission path that is optimal in terms of the constraint factor dimension and the carbon emission dimension as the traffic transmission path;

[0030] The traffic transmission path is sent to the routing nodes of the autonomous domain; the traffic transmission path is used to instruct each routing node to perform traffic scheduling according to the traffic transmission path.

[0031] In a third aspect, the present application further provides a traffic scheduling device, which is applied to a routing node in an autonomous domain, including:

[0032] Information acquisition module, which obtains the carbon emission factor information of the routing node itself;

[0033] an information encapsulation module, configured to encapsulate the carbon emission factor information in an extended internal gateway protocol, and transmit the carbon emission factor information of the routing node to other routing nodes and controllers within the autonomous domain based on the extended internal gateway protocol;

[0034] a path acquisition module, configured to receive a traffic transmission path issued by the controller; the traffic transmission path being a transmission path that is optimal in terms of the constraint factor dimension and the carbon emission dimension, calculated by the controller based on a preset constraint factor and carbon emission factor information of multiple routing nodes within the autonomous domain;

[0035] The traffic scheduling module is used to perform traffic scheduling according to the traffic transmission path.

[0036] In a fourth aspect, the present application further provides a flow path planning device, which is applied to a controller and includes:

[0037] an information acquisition module, configured to receive encapsulated information sent by a target routing node within an autonomous domain; the encapsulated information includes carbon emission factor information for multiple routing nodes within the autonomous domain; the carbon emission factor information for each routing node is encapsulated in an extended interior gateway protocol and transmitted between routing nodes within the autonomous domain based on the extended interior gateway protocol; the target routing node is a routing node within the autonomous domain;

[0038] A path calculation module, configured to calculate, based on the carbon emission factor information of the plurality of routing nodes and a preset constraint factor, a transmission path that is optimal in terms of the constraint factor dimension and the carbon emission dimension, as the traffic transmission path;

[0039] The path sending module is used to send the traffic transmission path to the routing nodes of the autonomous domain; the traffic transmission path is used to instruct each routing node to perform traffic scheduling according to the traffic transmission path.

[0040] In a fifth aspect, the present application further provides a computer device, comprising a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:

[0041] Obtain the carbon emission factor information of the routing node itself;

[0042] Encapsulating the carbon emission factor information in an extended interior gateway protocol, and transmitting the carbon emission factor information of the routing node to other routing nodes and controllers within the autonomous domain based on the extended interior gateway protocol;

[0043] Receive a traffic transmission path issued by the controller; the traffic transmission path is a transmission path that is calculated by the controller based on a preset constraint factor and carbon emission factor information of multiple routing nodes in the autonomous domain, and is optimal in terms of the constraint factor dimension and the carbon emission dimension;

[0044] Traffic scheduling is performed according to the traffic transmission path.

[0045] In a sixth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the following steps are implemented:

[0046] Obtain the carbon emission factor information of the routing node itself;

[0047] Encapsulating the carbon emission factor information in an extended interior gateway protocol, and transmitting the carbon emission factor information of the routing node to other routing nodes and controllers within the autonomous domain based on the extended interior gateway protocol;

[0048] Receive a traffic transmission path issued by the controller; the traffic transmission path is a transmission path that is calculated by the controller based on a preset constraint factor and carbon emission factor information of multiple routing nodes in the autonomous domain, and is optimal in terms of the constraint factor dimension and the carbon emission dimension;

[0049] Traffic scheduling is performed according to the traffic transmission path.

[0050] In a seventh aspect, the present application further provides a computer program product, comprising a computer program, which, when executed by a processor, implements the following steps:

[0051] Obtain the carbon emission factor information of the routing node itself;

[0052] Encapsulating the carbon emission factor information in an extended interior gateway protocol, and transmitting the carbon emission factor information of the routing node to other routing nodes and controllers within the autonomous domain based on the extended interior gateway protocol;

[0053] Receive a traffic transmission path issued by the controller; the traffic transmission path is a transmission path that is calculated by the controller based on a preset constraint factor and carbon emission factor information of multiple routing nodes in the autonomous domain, and is optimal in terms of the constraint factor dimension and the carbon emission dimension;

[0054] Traffic scheduling is performed according to the traffic transmission path.

[0055] The above-mentioned traffic scheduling and path planning method, device, computer equipment, storage medium and computer program product obtain the carbon emission factor information of each routing node in the autonomous domain, encapsulate the information in the extended internal gateway protocol, and transmit it to other routing nodes and controllers in the autonomous domain. The controller calculates the comprehensive optimal transmission path based on the carbon emission factor information of each routing node and the preset constraint factors. The path is the path with the least carbon emissions and the least restrictions on other constraints. The routing nodes perform traffic scheduling according to the path, perceive energy information and transmit information from a global perspective, and the control plane node collects energy information from each node to make the optimal plan, thereby realizing energy information transmission and green routing within the autonomous domain. BRIEF DESCRIPTION OF THE DRAWINGS

[0056] In order to more clearly illustrate the technical solutions in the embodiments of the present 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 only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0057] Figure 1This is an application environment diagram of a traffic scheduling method in one embodiment;

[0058] Figure 2 Schematic diagram of a flow chart of a traffic scheduling method in one embodiment;

[0059] Figure 3 1. A flow chart of an internal gateway protocol extension step in one embodiment;

[0060] Figure 4 A schematic diagram of the structure of the TLV architecture in the interior gateway protocol in one embodiment;

[0061] Figure 5 A flow chart of a traffic path planning method according to another embodiment;

[0062] Figure 6 Schematic diagram of a flow chart of a traffic scheduling and path planning method in another embodiment;

[0063] Figure 7 is a structural block diagram of a traffic scheduling device in one embodiment;

[0064] Figure 8 is a structural block diagram of a traffic path planning device in one embodiment;

[0065] Figure 9 FIG. 1 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0066] In order to make the purpose, technical solutions and advantages of this application more clear, the following further describes this application in detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain this application and are not intended to limit this application.

[0067] The traffic scheduling method provided in the embodiment of the present application can be applied to Figure 1 In the application environment shown, routing node 102 communicates with controller 104 via a network. Routing node 102 obtains its own carbon emission factor information, encapsulates the carbon emission factor information in an extended internal gateway protocol, and transmits its carbon emission factor information to other routing nodes and controller 104 within the autonomous domain based on the extended internal gateway protocol. Routing node 102 also receives the traffic transmission path issued by controller 104. This traffic transmission path is the optimal transmission path in terms of constraint factors and carbon emissions, calculated by controller 104 based on preset constraint factors and carbon emission factor information of multiple routing nodes 102 within the autonomous domain. Routing node 102 performs traffic scheduling based on this traffic transmission path. Controller 104 can be implemented as an independent server or a server cluster consisting of multiple servers.

[0068] In an exemplary embodiment, Figure 2 As shown, a traffic scheduling method is provided, which is applied to Figure 1 Taking the routing node 102 in FIG. 1 as an example, the method includes the following steps S202 to S208. In which:

[0069] Step S202: Acquire the carbon emission factor information of the routing node itself.

[0070] A routing node is a crucial component of a computer network, responsible for forwarding data packets to their destination. It is a device or node in the network responsible for forwarding data packets from the source node to the destination node. A routing node uses a routing table to determine the optimal path for a data packet and forward it accordingly.

[0071] The carbon emission factor information may be a carbon dioxide accounting method according to relevant guidelines or standard documents to maintain the normal operation of the routing node, and the carbon dioxide emissions generated by the electricity, such as wind power and coal power.

[0072] Optionally, corresponding carbon emission factor information may be pre-set for each routing node within the autonomous domain. Based on this setting information, when executing the method of the present disclosure, each routing node may obtain its own corresponding carbon emission factor information.

[0073] Step S204: encapsulate the carbon emission factor information in the extended internal gateway protocol, and transmit the carbon emission factor information of the routing node to other routing nodes and controllers in the autonomous domain based on the extended internal gateway protocol.

[0074] The Interior Gateway Protocol (IGP) is a protocol for exchanging routing information between gateways (hosts and routers) within an autonomous network. Routing information can be used by the Internet Protocol (IP) or other network protocols to describe how routing is performed.

[0075] An autonomous domain refers to a combination of all inter-network protocols and routers under the jurisdiction of one or more entities in the Internet, which implement a common routing policy for the Internet.

[0076] Optionally, each routing node in the autonomous domain encapsulates its own carbon emission factor information obtained in an extended internal gateway protocol, and transmits the carbon emission factor information of the routing node to other routing nodes and controllers in the autonomous domain based on the extended internal gateway protocol, thereby realizing global perception and transmission of carbon emission factor information within the autonomous domain.

[0077] Step S206, receiving the traffic transmission path sent by the controller; the traffic transmission path is the optimal transmission path in terms of constraint factor dimension and carbon emission dimension, calculated by the controller based on the preset constraint factor and carbon emission factor information of multiple routing nodes in the autonomous domain.

[0078] A traffic transmission path is the path that data flows from a source node to a destination node in a network. On the Internet, data flows through multiple network devices and links, with routing algorithms determining the optimal path for transmission.

[0079] Among them, the constraint factors can be bandwidth, delay, metric and load, etc. The controller is used to calculate the constraint factors of the traffic transmission path, which can be one or more of them.

[0080] Optionally, the routing node receives the traffic transmission path issued by the controller. The traffic transmission path is based on the preset constraint factors, such as bandwidth, latency, metric and load, and the carbon emission factor information of multiple routing nodes in the autonomous domain. By configuring different weights for each constraint factor and attribute, calculations are performed based on the corresponding weights, and the calculated scores are used to comprehensively calculate the optimal transmission path in terms of the constraint factor dimension and the carbon emission dimension.

[0081] Step S208: Perform traffic scheduling according to the traffic transmission path.

[0082] Traffic scheduling refers to the process of scheduling and managing data flows based on network congestion and resource utilization. Traffic scheduling algorithms enable the rational allocation of network resources and optimized traffic transmission. The goal of traffic scheduling is to improve network performance, reduce congestion and latency, increase bandwidth utilization, and ensure reliable and stable data transmission. Common traffic scheduling algorithms include shortest path first, minimum bandwidth first, and minimum delay first.

[0083] Optionally, the routing nodes within the autonomous domain perform traffic scheduling according to the optimal traffic transmission path issued by the controller.

[0084] In the above-mentioned traffic scheduling method, the carbon emission factor information of each routing node in the autonomous domain is obtained, and the information is encapsulated in the extended internal gateway protocol and transmitted to other routing nodes and controllers in the autonomous domain. The controller calculates the comprehensive optimal transmission path based on the carbon emission factor information of each routing node and the preset constraint factors. This path is the path with the least carbon emissions and the least restrictions on other constraint factors. The routing nodes perform traffic scheduling according to this path, perceive energy information and transmit information from a global perspective, and the control plane node collects energy information from each node to make the optimal plan, thereby realizing energy information transmission and green routing within the autonomous domain.

[0085] In an exemplary embodiment, the carbon emission factor includes a standard-defined carbon emission factor and a carbon emission factor of the power system related to the power consumption of the routing node; before step S202 obtains the carbon emission factor information of the routing node itself, it also includes: rounding the standard-defined carbon emission factor to obtain a first carbon emission factor; when the carbon emission factor of the power system related to the power consumption of the routing node is a decimal, rounding the carbon emission factor of the power system related to the power consumption of the routing node to obtain a second carbon emission factor; integrating the first carbon emission factor and the second carbon emission factor as the carbon emission factor information of the routing node itself.

[0086] Among them, the carbon emission factors defined by the standard can be carbon emission factors of various energy sources defined according to the standard document, all of which are decimals. The carbon emission factors of the power system can be carbon emission factors given by the power system based on the power consumption of the routing node, which can be decimals or integers. Optionally, the routing node rounds off the carbon emission factors defined by the standard to obtain a first carbon emission factor; when the carbon emission factor of the power system related to the power consumption of the routing node is a decimal, the carbon emission factor of the power system related to the power consumption of the routing node is rounded off, and when the carbon emission factor of the power system related to the power consumption of the routing node is an integer, no rounding is performed to obtain the second carbon emission factor information; the first carbon emission factor and the second carbon emission factor are integrated as the carbon emission factor information of the routing node itself.

[0087] In this embodiment, by explaining the method for obtaining the value of the carbon emission factor, it is possible to round off the decimal carbon emission factor, which facilitates information carrying.

[0088] In an exemplary embodiment, Figure 3 As shown, a flow chart of the internal gateway protocol extension steps is provided, step S204 encapsulates the carbon emission factor information in the extended internal gateway protocol, including the following steps S302 to S304.

[0089] Step S302: Expand the TLV (Type-Length-Value) structure in the internal gateway protocol to obtain the expanded internal gateway protocol.

[0090] The TLV architecture is a data transmission and storage format commonly used in communication protocols and data exchange. It divides data into three parts: tag (Type), length (Length), and value (Value). The tag identifies the data type, the length indicates the length of the value, and the value is the actual data content.

[0091] Optionally, a location for the TLV architecture is reserved in the internal gateway protocol according to the format of the TLV architecture to obtain an extended internal gateway protocol for adding required attribute data, such as adding the label, numerical length and actual data content corresponding to the carbon emission factor information to the TLV architecture.

[0092] Step S304: adding attributes of carbon emission factor information to the expanded internal gateway protocol.

[0093] Step S304 specifically involves adding attributes of the carbon emission factor information to the TLV structure of the extended interior gateway protocol. Optionally, the routing node encapsulates the formatted carbon emission factor information attributes within the TLV structure of the extended interior gateway protocol, allowing the extended interior gateway protocol to carry the carbon emission factor information for transmission.

[0094] In this embodiment, by extending the TLV architecture part in the internal gateway protocol, new data types can be easily added without modifying existing codes, thereby improving flexibility and scalability.

[0095] In an exemplary embodiment, step S304 adds attributes of the carbon emission factor information to the expanded internal gateway protocol, including: formatting the carbon emission factor information according to the TLV architecture format of the internal gateway protocol to obtain the attributes of the carbon emission factor information; and adding the attributes of the carbon emission factor information to the expanded internal gateway protocol to obtain encapsulation information of the carbon emission factor information. Encapsulation refers to the aggregation of data or functions into units.

[0096] The format definition refers to the carbon emission factor information in the IGP (Interior Gateway Protocol) attribute TLV format:<Type,Length,Value> ,Type and Length, 1 byte each, Value is variable length, Type code is currently used code + 1, indicating that the information in the TLV format is carbon emission factor information.

[0097] Optionally, the routing node defines the format of the carbon emission factor information according to the format of the TLV architecture in the interior gateway protocol. The carbon emission factor information is defined as <carbon emission factor tag, carbon emission factor data length, carbon emission factor actual data value>, where the tag and data length are 1 byte, and the actual data value length is the variable length of the data. The attributes of the carbon emission factor information are obtained in the TLV architecture part of the extended interior gateway protocol, such as Figure 4 As shown, a structural diagram of the TLV architecture in the internal gateway protocol is provided, the attributes of the carbon emission factor information are added, and the encapsulation information of the carbon emission factor information is obtained.

[0098] In this embodiment, by defining the carbon emission factor information in the format of the TLV architecture, it is convenient to encapsulate the attributes of the carbon emission factor information in the extended internal gateway protocol for global transmission.

[0099] In an exemplary embodiment, step S204 transmits the carbon emission factor information of the routing node to other routing nodes and controllers within the autonomous domain based on the extended internal gateway protocol, including: sending the carbon emission factor information of the routing node to other routing nodes within the autonomous domain through flooding; when the current routing node is the target node, sending the carbon emission factor information of the routing node and the carbon emission factor information of other nodes to the controller.

[0100] Flooding is a data flow transmission technology used by switches and bridges to send data flows received on a certain interface out of all interfaces except that interface.

[0101] Optionally, the routing node transmits the encapsulated carbon emission factor information to other nodes in the entire autonomous domain through flooding. At the same time, any routing node in the designated autonomous domain transmits the carbon emission factor information of all routing nodes received after flooding through BGP-LS (Border Gateway Protocol-Link State ， BGP-LS is a multi-protocol extension of BGP that uses BGP to transmit IGP (Interior Gateway Protocol) link status. BGP-LS makes it easy to obtain topology information from multiple IGP domains.

[0102] In this embodiment, the carbon emission factor information transmission method of the routing node itself is described. The flooding method is used between the routing nodes in the autonomous domain, and the BGP protocol is used for transmission between the routing nodes and the controller, which improves the reliability and stability of information transmission.

[0103] In an exemplary embodiment, according to the methods of all the above embodiments, step S208 performs traffic scheduling according to the traffic transmission path, including: when the traffic transmission path sent by the controller includes multiple traffic transmission paths, determining at least one routing node corresponding to each traffic transmission path; calculating the sum of the quantitative values ​​of the attributes of the carbon emission factor information of at least one routing node; screening out the traffic transmission path with the smallest sum of quantitative values ​​as the target traffic transmission path; and performing traffic scheduling according to the target traffic transmission path.

[0104] The target traffic transmission path refers to a path through which traffic transmission can effectively reduce carbon emissions. Optionally, when the traffic transmission path issued by the controller includes multiple equivalent traffic transmission paths, the routing node determines at least one routing node corresponding to each traffic transmission path, calculates the sum of the quantitative values ​​of the carbon emission factor information attributes of the at least one routing node corresponding to each traffic transmission path, selects the traffic transmission path with the smallest sum of quantitative values ​​as the target traffic transmission path, and schedules traffic within the autonomous domain based on the target transmission path.

[0105] In this embodiment, when there are multiple equivalent traffic transmission paths issued by the controller, the traffic transmission path with the lowest corresponding carbon emission factor is screened out as the target traffic transmission path for traffic scheduling, so that there are more equivalent traffic paths on the wide area network, and different services are scheduled in combination with new energy characteristics while ensuring quality, which can effectively reduce carbon emissions and reduce costs and increase efficiency.

[0106] In another exemplary embodiment, Figure 5 As shown, a flow path planning method is provided, which is applied to a controller and includes the following steps S502 to S506.

[0107] Step S502, receiving encapsulated information sent by the target routing node in the autonomous domain; the encapsulated information includes carbon emission factor information of multiple routing nodes in the autonomous domain; the carbon emission factor information of each routing node is encapsulated in the extended internal gateway protocol and transmitted between routing nodes in the autonomous domain based on the extended internal gateway protocol; the target routing node is one of the multiple routing nodes in the autonomous domain.

[0108] Optionally, the controller receives encapsulated information sent by a target routing node within the autonomous domain, where the encapsulated information is obtained by rounding off the carbon emission factor information of multiple routing nodes within the autonomous domain, defining the format of the TLV architecture, and encapsulating it in an internal gateway protocol with an extended TLV architecture; the carbon emission factor information of each routing node is encapsulated in the extended internal gateway protocol, and transmitted between routing nodes within the autonomous domain through a flooding mechanism based on the extended internal gateway protocol, and then the target routing node is designated to be sent to the controller through BGP-LS; the target routing node is one of the multiple routing nodes in the autonomous domain.

[0109] Step S504 : Based on the carbon emission factor information of the multiple routing nodes and the preset constraint factors, a transmission path that is optimal in terms of the constraint factor dimension and the carbon emission dimension is calculated as the traffic transmission path.

[0110] Optionally, the controller calculates the optimal transmission path in terms of the constraint factor dimension and the carbon emission dimension based on the carbon emission factor information of multiple routing nodes and the preset constraint factor. For example, if the constraint factor is delay, the delay and carbon emissions are combined, and the traffic transmission path with the lowest comprehensive combination of the two is used as the traffic transmission path.

[0111] Step S506: Send the traffic transmission path to the routing nodes of the autonomous domain; the traffic transmission path is used to instruct each routing node to perform traffic scheduling according to the traffic transmission path.

[0112] Optionally, the controller sends the calculated optimal traffic transmission path to each routing node in the autonomous domain. After each routing node receives the optimal traffic transmission path, it performs traffic scheduling according to the optimal traffic transmission path to complete energy-saving scheduling of traffic on the autonomous domain network.

[0113] In this embodiment, the carbon emission factor information of each routing node in the autonomous domain is obtained, and the information is encapsulated in the extended internal gateway protocol and transmitted to other routing nodes and controllers in the autonomous domain. The controller calculates the comprehensive optimal transmission path based on the carbon emission factor information of each routing node and the preset constraint factors. This path is the path with the least carbon emissions and the least restrictions on other constraint factors. The routing nodes perform traffic scheduling according to the path, perceive energy information and transmit information from a global perspective, and the control plane node collects energy information from each node to make the optimal plan, thereby realizing energy information transmission and green routing within the autonomous domain.

[0114] In an exemplary embodiment, in order to illustrate the technical solution in more detail, as shown in FIG. Figure 6 As shown, a method for traffic scheduling and path planning is provided, and the specific steps include the following steps S602 to S616.

[0115] Step S602, rounding the carbon emission factor defined in the standard to obtain a first carbon emission factor; when the carbon emission factor of the power system related to the power consumption of the routing node is a decimal, rounding the carbon emission factor of the power system related to the power consumption of the routing node to obtain a second carbon emission factor; integrating the first carbon emission factor and the second carbon emission factor as the carbon emission factor information of the routing node itself.

[0116] Step S604: Acquire the carbon emission factor information of the routing node itself.

[0117] Specifically, the routing nodes within the autonomous domain obtain their corresponding carbon emission factor information that has undergone rounding and integration processing.

[0118] Step S606: Expand the TLV architecture in the internal gateway protocol to obtain an expanded internal gateway protocol.

[0119] Specifically, before traffic scheduling is required, a TLV architecture position is reserved in the internal gateway protocol according to the format of the TLV architecture to obtain an extended internal gateway protocol, and the reserved position is used to add new attribute data defined in the TLV architecture format.

[0120] Step S608, formatting the carbon emission factor information according to the format of the TLV architecture in the internal gateway protocol to obtain the attributes of the carbon emission factor information; in the expanded internal gateway protocol, the attributes of the carbon emission factor information are added to obtain encapsulation information of the carbon emission factor information.

[0121] Specifically, the routing node defines the format of the carbon emission factor information according to the format of the TLV architecture in the internal gateway protocol. The carbon emission factor information is defined as <carbon emission factor tag, carbon emission factor data length, carbon emission factor actual data content>, where the carbon emission factor tag and the carbon emission factor data length are 1 byte in length, and the length of the carbon emission factor actual data content is the variable length of the actual data content. The attributes of the carbon emission factor information are obtained in the TLV architecture part of the extended internal gateway protocol, such as Figure 4 As shown, a structural diagram of the TLV architecture in the internal gateway protocol is provided, the attributes of the carbon emission factor information are added, and the encapsulation information of the carbon emission factor information is obtained.

[0122] In step S610, the routing node sends the carbon emission factor information of the routing node to other routing nodes in the autonomous domain by flooding; when the current routing node is the target node, the carbon emission factor information of the routing node and the carbon emission factor information of other nodes are sent to the controller.

[0123] In step S612, the controller receives the encapsulation information sent by the target routing node within the autonomous domain, and based on the carbon emission factor information of multiple routing nodes and the preset constraint factors, calculates the optimal transmission path in terms of the constraint factor dimension and the carbon emission dimension, and sends it to the routing node as the traffic transmission path.

[0124] Step S614: The routing node receives the traffic transmission path sent by the controller.

[0125] Step S616, when the traffic transmission path sent by the controller includes multiple traffic transmission paths, the routing node receiving the traffic transmission path determines at least one routing node corresponding to each traffic transmission path; calculates the sum of the quantitative values ​​of the attributes of the carbon emission factor information of at least one routing node; screens out the traffic transmission path with the smallest sum of the quantitative values ​​as the target traffic transmission path; and performs traffic scheduling according to the target traffic transmission path.

[0126] Specifically, when the traffic transmission path sent by the controller includes multiple equivalent traffic transmission paths, the routing node determines at least one routing node corresponding to each traffic transmission path, calculates the sum of the attribute values ​​of the carbon emission factor information of the at least one routing node corresponding to each traffic transmission path, selects the traffic transmission path with the smallest sum of the attribute values ​​as the target traffic transmission path, and schedules the traffic within the autonomous domain according to the target transmission path. For example, the traffic transmission path sent by the controller includes two equivalent paths, ABC and ADC, where the attribute values ​​of the carbon emission factor information corresponding to ABCD are 5, 5, 5, and 10, respectively. The sum of the attribute values ​​of the carbon emission factor information generated by the traffic passing through the ABC path is 15, and the sum of the attribute values ​​of the carbon emission factor information generated by the traffic passing through the ADC path is 20. In this case, the traffic transmission path ABC is the more optimal transmission path.

[0127] In this embodiment, the IGP protocol (ISIS or OSPF) is extended through the TLV architecture to add a carbon emission factor attribute. The flooding mechanism of the IGP protocol itself propagates this information to all IGP routing nodes in the autonomous system, so that the IGP routing nodes in all domains can perceive the energy information of other devices. At the same time, this information is also passed to the control plane; the control plane can use this information as a relevant factor for path planning and traffic scheduling, formulate the optimal routing strategy, and realize integrated carbon network scheduling.

[0128] It should be understood that, although the various steps in the flowcharts involved in the various embodiments described above are displayed in sequence according to the instructions of the arrows, these steps are not necessarily executed in sequence in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order restriction on the execution of these steps, and these steps can be executed in other orders. Moreover, at least a portion of the steps in the flowcharts involved in the various embodiments described above can include multiple steps or multiple stages, and these steps or stages are not necessarily executed and completed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a portion of steps or stages in other steps.

[0129] Based on the same inventive concept, the embodiments of the present application also provide a traffic scheduling device for implementing the aforementioned traffic scheduling method. The implementation solution provided by the device is similar to the implementation solution described in the aforementioned method. Therefore, the specific limitations in one or more traffic scheduling device embodiments provided below can be found in the above-mentioned limitations on the traffic scheduling method and will not be repeated here.

[0130] In an exemplary embodiment, Figure 7As shown, a traffic scheduling device 700 is provided, comprising: an information acquisition module 702, an information encapsulation module 704, a path acquisition module 706 and a traffic scheduling module 708, wherein:

[0131] The information acquisition module 702 acquires the carbon emission factor information of the routing node itself.

[0132] The information encapsulation module 704 is configured to encapsulate the carbon emission factor information in the extended internal gateway protocol, and transmit the carbon emission factor information of the routing node to other routing nodes and controllers within the autonomous domain based on the extended internal gateway protocol.

[0133] The path acquisition module 706 is used to receive the traffic transmission path issued by the controller; the traffic transmission path is the transmission path that is calculated by the controller based on the preset constraint factor and the carbon emission factor information of multiple routing nodes in the autonomous domain, and is the optimal transmission path in terms of constraint factor dimension and carbon emission dimension.

[0134] The traffic scheduling module 708 is used to perform traffic scheduling according to the traffic transmission path.

[0135] Furthermore, in one embodiment, the information acquisition module 702 is also used to round off the carbon emission factor defined in the standard to obtain a first carbon emission factor; when the carbon emission factor of the power system related to the power consumption of the routing node is a decimal, round off the carbon emission factor of the power system related to the power consumption of the routing node to obtain a second carbon emission factor; and integrate the first carbon emission factor and the second carbon emission factor as the carbon emission factor information of the routing node itself.

[0136] Furthermore, in one embodiment, the information encapsulation module 704 is further configured to extend the TLV architecture in the internal gateway protocol to obtain an extended internal gateway protocol; and to add attributes of the carbon emission factor information to the extended internal gateway protocol.

[0137] Furthermore, in one embodiment, the information encapsulation module 704 is also used to send the carbon emission factor information of the routing node to other routing nodes in the autonomous domain through flooding; when the current routing node is the target node, the carbon emission factor information of the routing node and the carbon emission factor information of other nodes are sent to the controller.

[0138] Furthermore, in one embodiment, the traffic scheduling module 708 is also used to determine at least one routing node corresponding to each traffic transmission path when the traffic transmission path sent by the controller includes multiple traffic transmission paths; calculate the sum of the quantitative values ​​of the attributes of the carbon emission factor information of at least one routing node; screen out the traffic transmission path with the smallest sum of the quantitative values ​​as the target traffic transmission path; and perform traffic scheduling according to the target traffic transmission path.

[0139] In an exemplary embodiment, Figure 8 As shown, a flow path planning device 800 is provided, comprising: an information acquisition module 802, a path calculation module 804 and a flow path sending module 806, wherein:

[0140] The information acquisition module 802 is used to receive encapsulated information sent by the target routing node within the autonomous domain; the encapsulated information includes the carbon emission factor information of multiple routing nodes in the autonomous domain; the carbon emission factor information of each routing node is encapsulated in the extended internal gateway protocol and transmitted between the routing nodes in the autonomous domain based on the extended internal gateway protocol; the target routing node is a routing node in the autonomous domain.

[0141] The path calculation module 804 is used to calculate the optimal transmission path in terms of constraint factor and carbon emission dimensions based on the carbon emission factor information of multiple routing nodes and the preset constraint factors, as the traffic transmission path.

[0142] The path sending module 806 is used to send the traffic transmission path to the routing nodes of the autonomous domain; the traffic transmission path is used to instruct each routing node to perform traffic scheduling according to the traffic transmission path.

[0143] Each module in the traffic scheduling device 700 and the traffic path planning device 800 can be implemented in whole or in part by software, hardware, or a combination thereof. Each module can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in the computer device in the form of software, so that the processor can call and execute the corresponding operations of each module.

[0144] In an exemplary embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as shown in FIG. Figure 9As shown. The computer device includes a processor, a memory, an input / output interface (Input / Output, abbreviated as I / O) and a communication interface. The processor, memory and input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and computer program in the non-volatile storage medium. The database of the computer device is used to store carbon emission factor information corresponding to each routing node, multiple constraint factor information data, etc. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a traffic scheduling and path planning method is implemented.

[0145] Those skilled in the art will understand that Figure 9 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than shown in the figure, or combine certain components, or have a different component arrangement.

[0146] In one embodiment, a computer device is further provided, including a memory and a processor. The memory stores a computer program, and the processor implements the steps in the above method embodiments when executing the computer program.

[0147] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the steps in the above-mentioned method embodiments are implemented.

[0148] In one embodiment, a computer program product is provided, including a computer program, which implements the steps in the above method embodiments when executed by a processor.

[0149] Those skilled in the art will appreciate that all or part of the processes in the above-mentioned embodiment methods can be implemented by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, database or other media used in the embodiments provided in this application may include at least one of non-volatile and volatile memory. Non-volatile memory may include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory may include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in the various embodiments provided herein may include at least one of a relational database and a non-relational database. Non-relational databases may include, but are not limited to, distributed databases based on blockchains. The processor involved in the various embodiments provided herein may be, but are not limited to, a general-purpose processor, a central processing unit, a graphics processing unit, a digital signal processor, a programmable logic unit, a data processing logic unit based on quantum computing, and the like.

[0150] The technical features of the above embodiments can be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0151] The above-described embodiments merely represent several implementation methods of the present application. While the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the present application. It should be noted that a person of ordinary skill in the art may make various modifications and improvements without departing from the spirit of the present application, and these modifications and improvements fall within the scope of protection of the present application. Therefore, the scope of protection of the present application shall be determined by the appended claims.

Claims

1. A traffic scheduling method, characterized in that: Applied to a routing node in an autonomous domain, the method includes: Obtain the carbon emission factor information of the routing node itself; Encapsulating the carbon emission factor information in an extended interior gateway protocol, and transmitting the carbon emission factor information of the routing node to other routing nodes and controllers within the autonomous domain based on the extended interior gateway protocol; Receive a traffic transmission path issued by the controller; the traffic transmission path is a transmission path that is calculated by the controller based on a preset constraint factor and carbon emission factor information of multiple routing nodes in the autonomous domain, and is optimal in terms of the constraint factor dimension and the carbon emission dimension; Traffic scheduling is performed according to the traffic transmission path.

2. The method according to claim 1, characterized in that The carbon emission factor includes a carbon emission factor defined by a standard and a carbon emission factor of the power system related to the power consumption of the routing node; Before obtaining the carbon emission factor information of the routing node itself, the method further includes: The carbon emission factor defined in the standard is rounded to obtain the first carbon emission factor; When the carbon emission factor of the power system related to the power consumption of the routing node is a decimal, rounding the carbon emission factor of the power system related to the power consumption of the routing node to obtain a second carbon emission factor; The first carbon emission factor and the second carbon emission factor are integrated as the carbon emission factor information of the routing node itself.

3. The method according to claim 1, characterized in that Encapsulating the carbon emission factor information in the extended internal gateway protocol includes: The TLV architecture is extended in the interior gateway protocol to obtain an extended interior gateway protocol; In the extended internal gateway protocol, the attribute of the carbon emission factor information is added.

4. The method according to claim 3, characterized in that The attributes of the carbon emission factor information added to the expanded internal gateway protocol include: Formatting the carbon emission factor information according to the TLV architecture format in the internal gateway protocol to obtain attributes of the carbon emission factor information; In the extended internal gateway protocol, the attributes of the carbon emission factor information are added to obtain the encapsulation information of the carbon emission factor information.

5. The method according to claim 1, wherein The transmitting the carbon emission factor information of the routing node to other routing nodes and controllers within the autonomous domain based on the extended interior gateway protocol includes: Sending the carbon emission factor information of the routing node to other routing nodes in the autonomous domain by flooding; In the case where the current routing node is the target node, the carbon emission factor information of the routing node and the carbon emission factor information of other nodes are sent to the controller.

6. The method according to any one of claims 1 to 5, characterized in that The performing traffic scheduling according to the traffic transmission path includes: When the traffic transmission path sent by the controller includes multiple traffic transmission paths, determining at least one routing node corresponding to each of the traffic transmission paths; Calculating a sum of quantitative values ​​of attributes of the carbon emission factor information of the at least one routing node; Filtering out the traffic transmission path with the smallest sum of the quantity values ​​as the target traffic transmission path; Traffic scheduling is performed according to the target traffic transmission path.

7. A traffic path planning method, characterized in that: Applied to a controller, the method includes: receiving encapsulated information sent by a target routing node within an autonomous domain; the encapsulated information includes carbon emission factor information of multiple routing nodes in the autonomous domain; the carbon emission factor information of each routing node is encapsulated in an extended interior gateway protocol and transmitted between routing nodes within the autonomous domain based on the extended interior gateway protocol; the target routing node is one of the multiple routing nodes in the autonomous domain; Based on the carbon emission factor information of the multiple routing nodes and the preset constraint factors, calculate a transmission path that is optimal in terms of the constraint factor dimension and the carbon emission dimension as the traffic transmission path; The traffic transmission path is sent to the routing nodes of the autonomous domain; the traffic transmission path is used to instruct each routing node to perform traffic scheduling according to the traffic transmission path.

8. A flow scheduling device, characterized in that: Applied to a routing node in an autonomous domain, the device comprises: Information acquisition module, which obtains the carbon emission factor information of the routing node itself; an information encapsulation module, configured to encapsulate the carbon emission factor information in an extended internal gateway protocol, and transmit the carbon emission factor information of the routing node to other routing nodes and controllers within the autonomous domain based on the extended internal gateway protocol; a path acquisition module, configured to receive a traffic transmission path issued by the controller; the traffic transmission path being a transmission path that is optimal in terms of the constraint factor dimension and the carbon emission dimension, calculated by the controller based on a preset constraint factor and carbon emission factor information of multiple routing nodes within the autonomous domain; The traffic scheduling module is used to perform traffic scheduling according to the traffic transmission path.

9. A flow path planning device, characterized in that: Applied to a controller, the device comprises: an information acquisition module, configured to receive encapsulated information sent by a target routing node within an autonomous domain; the encapsulated information includes carbon emission factor information for multiple routing nodes within the autonomous domain; the carbon emission factor information for each routing node is encapsulated in an extended interior gateway protocol and transmitted between routing nodes within the autonomous domain based on the extended interior gateway protocol; the target routing node is a routing node within the autonomous domain; A path calculation module, configured to calculate, based on the carbon emission factor information of the plurality of routing nodes and a preset constraint factor, a transmission path that is optimal in terms of the constraint factor dimension and the carbon emission dimension, as the traffic transmission path; The path sending module is used to send the traffic transmission path to the routing nodes of the autonomous domain; the traffic transmission path is used to instruct each routing node to perform traffic scheduling according to the traffic transmission path.

10. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 7 are implemented.

11. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.

12. A computer program product comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 7 are implemented.

Images