CN111030928A - A routing information determination method, node, system and storage medium - Google Patents

Abstract

The embodiments of the present invention disclose a routing information determination method, node, system and storage medium. The method includes: a first node sends a network abstraction request to a second node; the network abstraction request carries optimization target information; the first node obtains abstract node information from the second node, based on the abstract node information determining routing information; wherein the abstract node information satisfies the optimization target information.

Description

A routing information determination method, node, system and storage medium

technical field

The present invention relates to the field of communication technologies, in particular to a routing information determination method, node, system and storage medium.

Background technique

When the service is opened, according to different service types, the optical transport network usually needs to perform routing calculation according to different constraints or optimization objectives.

According to the Abstraction and Control of Traffic Engineered Networks (ACTN, Abstraction and Control of Traffic Engineered Networks) model of the Internet Engineering Task Force (IETF), there are currently two main ways to calculate cross-domain routing:

The first method is to use the inter-domain controller (SC) and the intra-domain controller (DC) to complete the inter-domain routing calculation; the SC does not save the intra-domain topology, but only calculates the inter-domain routes, specifies the order of routes passing through each domain, and determines the inter-domain routing. Interconnection link: According to the inter-domain interconnection node, the intra-domain route calculation request is sent to each domain, and the DC calculates the intra-domain route. The advantage of this method is that the SC calculation is relatively simple, but the disadvantage is that the calculated route is only an inter-domain route, not a globally optimal route;

The second method is that the SC completes the cross-domain routing calculation alone; the SC collects the information of all DCs, forms a global topology, and calculates the global routing. The advantage of this method is that the global optimal route can be calculated.

SUMMARY OF THE INVENTION

In order to solve the existing technical problems, the embodiments of the present invention provide a routing information determination method, node, system and storage medium.

In order to achieve the above-mentioned purpose, the technical scheme of the embodiment of the present invention is realized as follows:

An embodiment of the present invention provides a method for determining routing information, and the method includes:

The first node sends a network abstraction request to the second node; the network abstraction request carries optimization target information;

The first node obtains abstract node information from the second node, and determines routing information based on the abstract node information; wherein the abstract node information satisfies the optimization target information.

In the above solution, before the first node sends the network abstraction request to the second node, the method further includes: the first node obtains optimization target information; the optimization target information includes at least one of the following parameters: a minimum number of hops, a Minimum latency, minimum number of flashes, and load balancing parameters.

In the above solution, the first node obtains abstract node information from the second node, and determines routing information based on the abstract node information, including:

The first node obtains abstract node information from the second node, and the abstract node information includes at least one set of abstract nodes and the mapping relationship of parameter values; the parameters corresponding to the parameter values include at least one of the following parameters 1: Minimum hops, minimum delay, minimum number of flashes, load balancing parameters;

The first node determines routing information that satisfies the condition based on the at least one group of abstract nodes and the mapping relationship of the parameter area.

The embodiment of the present invention also provides a method for determining routing information, the method includes: the second node obtains a network abstraction request from the first node; the network abstraction request carries optimization target information;

The second node determines abstract node information based on the optimization target information, and sends the abstract node information to the first node.

In the above solution, the second node determines the abstract node information based on the optimization target information, including: the second node includes the minimum number of hops, the minimum delay, the minimum number of flashes, and load balancing based on the optimization target information. At least one of the parameters determines an abstract node and a corresponding parameter value, and determines abstract node information based on the abstract node and the corresponding parameter value.

In the above solution, the method further includes: the second node records the connection relationship of the abstract nodes satisfying the optimization target information and the mapping relationship between the physical resources corresponding to the abstract nodes.

An embodiment of the present invention further provides a node, where the node is a first node; the node includes: a first communication unit and a first processing unit; wherein,

The first communication unit is configured to send a network abstraction request to the second node; the network abstraction request carries optimization target information; obtains abstract node information from the second node; wherein the abstract node information satisfies the Optimize target information;

The first processing unit is configured to determine routing information based on the abstract node information obtained by the first communication unit.

In the above solution, the first processing unit is further configured to obtain optimization target information before the first communication unit sends a network abstraction request to the second node; the optimization target information includes at least one of the following parameters: the minimum Hop count, minimum delay, minimum number of flashes, and load balancing parameters.

In the above solution, the first communication unit is used to obtain abstract node information from the second node, and the abstract node information includes at least one group of abstract nodes and a mapping relationship of parameter values; the parameter values correspond to The parameters include at least one of the following parameters: minimum number of hops, minimum delay, minimum number of flashes, and load balancing parameters;

The first processing unit is configured to determine routing information that satisfies the condition based on the mapping relationship between the at least one group of abstract nodes and the parameter area.

An embodiment of the present invention further provides a node, where the node is a second node; the node includes: a second communication unit and a second processing unit; wherein,

The second communication unit is used to obtain a network abstraction request from the first node; the network abstraction request carries optimization target information;

The second processing unit is configured to determine abstract node information based on the optimization target information obtained by the second communication unit, and send the abstract node information to the first node.

In the above solution, the second processing unit is configured to determine abstract nodes and corresponding parameters based on at least one of the minimum number of hops, the minimum delay, the minimum number of flashes, and load balancing parameters included in the optimization target information. value, and the abstract node information is determined based on the abstract node and the corresponding parameter values.

In the above solution, the second processing unit is further configured to record the connection relationship of the abstract nodes satisfying the optimization target information and the mapping relationship between the physical resources corresponding to the abstract nodes.

An embodiment of the present invention further provides a routing information determination system, the system includes a first node and a second node; wherein,

The first node is used to send a network abstraction request to the second node; the network abstraction request carries optimization target information; it is also used to obtain abstract node information from the second node, and determine a route based on the abstract node information information; wherein, the abstract node information satisfies the optimization target information;

the second node is configured to obtain a network abstraction request from the first node; the network abstraction request carries optimization target information; and is further configured to determine abstract node information based on the optimization target information, and send the abstract node information to the first node.

The embodiment of the present invention also provides a computer-readable storage medium, on which a computer program is stored, and when the program is executed by a processor, implements the steps of the method for determining routing information applied to the first node according to the embodiment of the present invention; Alternatively, when the program is executed by the processor, the steps of the method for determining routing information applied to the second node according to the embodiment of the present invention are implemented.

An embodiment of the present invention further provides a node, including a memory, a processor, and a computer program stored in the memory and running on the processor, where the processor implements the application described in the embodiment of the present invention when the processor executes the program The steps of the method for determining routing information applied to the first node; or, when the processor executes the program, the steps of the method for determining routing information applied to the second node according to the embodiment of the present invention are implemented.

In the routing information determination method, node, system, and storage medium provided by the embodiments of the present invention, on the one hand, a first node sends a network abstraction request to a second node; the network abstraction request carries optimization target information; The abstract node information, and routing information is determined based on the abstract node information; wherein, the abstract node information satisfies the optimization target information. On the other hand, the second node obtains a network abstraction request from the first node; the network abstraction request carries optimization target information; determines abstraction node information based on the optimization target information, and sends the abstraction node information to the first node . By adopting the technical solutions of the embodiments of the present invention, the first node (eg SC) sends the optimization target information to the second node (eg DC), and obtains the abstract node information that satisfies the optimization target information, so as to calculate the route based on the abstract node information information, on the one hand, the determination of the global optimal routing within and between domains is realized; on the other hand, the optimal routing information in the domain is calculated and determined by the second node based on the optimization target information, without the need for the first node (such as SC) to collect all the information. The information of the domain and the calculation of the global optimal route greatly reduce the pressure on the computing resources and storage resources of the first node (such as SC), and on the other hand, it also ensures the service quality and cost of the business.

Description of drawings

1 is a schematic diagram of a network control architecture to which a method for determining routing information according to an embodiment of the present invention is applied;

2 is a schematic flowchart 1 of a method for determining routing information according to an embodiment of the present invention;

3 is a second schematic flowchart of a method for determining routing information according to an embodiment of the present invention;

FIG. 4 is a third schematic flowchart of a method for determining routing information according to an embodiment of the present invention;

FIG. 5 is a schematic diagram of a composition structure of a node according to an embodiment of the present invention;

FIG. 6 is a schematic diagram of another composition structure of a node according to an embodiment of the present invention;

FIG. 7 is a schematic diagram of a hardware structure of a node according to an embodiment of the present invention.

Detailed ways

Before the technical solutions of the embodiments of the present invention are described in detail, a network control architecture based on a Software Defined Network (SDN, Software Defined Network) is briefly described first.

1 is a schematic diagram of a network control architecture to which a method for determining routing information according to an embodiment of the present invention is applied; as shown in FIG. 1 , the network control architecture includes SC and DC; wherein, DC is used to implement routing control and resource management in a domain; SC It is used for inter-domain coordination and resource scheduling to realize multi-domain interworking, especially the configuration of interworking ports. Each domain requires at least one DC; and multiple domains require at least one SC. The DC and SC exchange signaling through the DC northbound interface to implement unified SC scheduling. The northbound interface usually uses an international standard information model (for example, this embodiment may be based on the ACTN standard model of the IETF).

In an example, a domain refers to a network area range, for example, a network area range corresponding to a network device belonging to a certain manufacturer or a certain operator. It can be understood that the network area ranges between one domain and another domain may be separated from each other, and may also overlap each other or partially overlap.

Among them, ACTN is a data model proposed by the IETF. It is described in Yang language, which can express different levels of network abstraction models and can be used for data transfer information models between multi-layer SDN controllers.

The present invention will be described in further detail below with reference to the accompanying drawings and specific embodiments.

The embodiment of the present invention provides a method for determining routing information. FIG. 2 is a schematic flowchart 1 of a method for determining routing information according to an embodiment of the present invention; as shown in FIG. 2 , the method includes:

Step 101: The first node sends a network abstraction request to the second node; the network abstraction request carries optimization target information.

Step 102: the first node obtains abstract node information from the second node, and determines routing information based on the abstract node information; wherein the abstract node information satisfies the optimization target information.

The method for determining routing information in this embodiment is applied to a first node; the first node is used for inter-domain coordination and resource scheduling. As an example, the first node may be an SC. The second node is used for routing control and resource management within the domain; as an example, the second node may be a DC.

In an optional embodiment of the present invention, before the first node sends the network abstraction request to the second node, the method further includes: the first node obtains optimization target information; the optimization target information includes the following parameters: At least one of: minimum hop count, minimum latency, minimum number of flashes, and load balancing parameters.

In this embodiment, the network abstraction request message sent by the first node to the second node carries a field representing optimization target information; wherein the parameters included in the optimization target information can be pre-configured by professionals, for example, through a human-computer interaction interface to configure.

As an example, if the network control architecture in this embodiment is based on the ACTN standard model of the IETF, the connectivity-matrices in the model represents a cross-connection matrix. In the connectivity-matrices, two fields are added by adding two fields. , for example, a first field is added to represent the optimization target information, and a second field is added to represent the abstract node information, which can specifically represent the parameter value corresponding to the abstract node. As an example, the newly added fields can be shown by the bolded parts in the following code example, such as the newly added optimization-criterion field and connectivity-cost field; the above two The definitions of the newly added fields may be shown in Table 1, wherein the optimization-criterion field is used to indicate the type of the optimization target information; the connectivity-cost field is used to indicate the value corresponding to the type of the optimization target information.

Table 1

In this embodiment, when receiving a specific operation, the first node sends a network abstraction request to the second node; wherein, the sent network abstraction request may be an operation request corresponding to the specific operation. As an example, the specific operation may be a virtual network instantiate (VN Instantiate) operation or a virtual network update (VN Update) operation, etc. Of course, it is not limited to the above operations; it can be understood that the first node receives the virtual network During the instantiation operation, a virtual network instantiation request is sent to the second node, and the request carries the optimization target information; or, when the first node receives the virtual network update operation, a virtual network update request is sent to the second node, the request It carries optimization target information. The optimization target information carried in the request may be an optimization-criterion field carried in the request message. In practical applications, the identifiers corresponding to the parameter types included in different optimization target information can be pre-configured. For example, 1 corresponds to the minimum number of hops, 2 corresponds to the minimum delay, 3 corresponds to the minimum number of flashes, and 4 corresponds to load balancing. In the optimization-criterion field carried in the field, adding an identifier indicates the parameter type included in the optimization target information.

In this embodiment, the first node sends a network abstraction request to all second nodes associated with it, so as to obtain abstract node information fed back by all second nodes.

In an optional embodiment of the present invention, the first node obtains abstract node information from the second node, and determining routing information based on the abstract node information includes: the first node obtains information from the second node. The abstract node information of the second node, where the abstract node information includes at least one set of abstract nodes and the mapping relationship of parameter values; the parameter corresponding to the parameter value includes at least one of the following parameters: minimum hop count, minimum delay , the minimum number of flashes, and load balancing parameters; the first node determines routing information that satisfies the conditions based on the at least one group of abstract nodes and the mapping relationship between the parameter areas.

In this embodiment, the first node obtains the abstract node information fed back by all the second nodes, and the abstract node information includes one less group of abstract nodes and the mapping relationship of parameter values. As an example, the abstract node is the edge node corresponding to the routing path determined by the second node according to the optimization target information. optimal routing information. As another example, the abstract node information includes the edge node corresponding to the routing path determined by the second node according to the optimization target information and the corresponding parameter value, then the second node can be based on the abstract nodes and corresponding parameter values fed back by all the second nodes. The parameter values are used to select intra-domain paths and optimize inter-domain paths, that is, to determine two edge nodes of the domain corresponding to a second node, and further determine the shortest inter-domain route based on the edge nodes of the domain corresponding to all second nodes. , so as to determine the optimal routing information.

In this embodiment, the routing information determined by the first node may represent the shortest routing path.

In an optional embodiment of the present invention, the method further includes: the first node sending the routing information to the second node, so that the second node can make the routing information and the mapping relationship saved locally according to the second node Configure the actual network device.

By adopting the technical solutions of the embodiments of the present invention, the first node (eg SC) sends the optimization target information to the second node (eg DC), and obtains the abstract node information that satisfies the optimization target information, so as to calculate the route based on the abstract node information information, on the one hand, the determination of the global optimal routing within and between domains is realized; on the other hand, the optimal routing information in the domain is calculated and determined by the second node based on the optimization target information, without the need for the first node (such as SC) to collect all the information. The information of the domain and the calculation of the global optimal route greatly reduce the pressure on the computing resources and storage resources of the first node (such as SC), and on the other hand, it also ensures the service quality and cost of the business.

The embodiment of the present invention also provides a method for determining routing information. FIG. 3 is a second schematic flowchart of a method for determining routing information according to an embodiment of the present invention; as shown in FIG. 3 , the method includes:

Step 201: The second node obtains a network abstraction request from the first node; the network abstraction request carries optimization target information.

Step 202: The second node determines abstract node information based on the optimization target information, and sends the abstract node information to the first node.

The method for determining routing information in this embodiment is applied to a second node; the second node is used for routing control and resource management in a domain; as an example, the second node may be a DC. The first node is used for inter-domain coordination and resource scheduling. As an example, the first node may be an SC.

In an optional embodiment of the present invention, the second node determining the abstract node information based on the optimization target information includes: the second node includes a minimum number of hops and a minimum delay based on the optimization target information. The abstract node and corresponding parameter values are determined by at least one parameter among the minimum number of flashes and the load balancing parameter, and the abstract node information is determined based on the abstract node and the corresponding parameter values.

As an example, if the network control architecture in this embodiment is based on the ACTN standard model of the IETF, the connectivity-matrices in the model represents a cross-connection matrix, and two fields are added in the connectivity-matrices, for example, adding the first The field is used to represent the optimization target information, and a second field is added to represent the abstract node information, which can specifically represent the parameter value corresponding to the abstract node. As an example, the newly added fields can be shown by the bolded parts in the code examples in the above embodiments, such as the newly added optimization-criterion field and the connectivity-cost field; the definitions of the above two newly added fields can be as described above As shown in Table 1, the optimization-criterion field is used to indicate the type of the optimization target information; the connectivity-cost field is used to indicate the value corresponding to the type of the optimization target information.

In this embodiment, the network abstraction request may be a request corresponding to a specific operation of the first node. For example, when the first node receives the virtual network instantiation operation, it sends a virtual network instantiation request to the second node, and the request carrying optimization target information; or, when the first node receives the virtual network update operation, sends a virtual network update request to the second node, where the request carries the optimization target information. The optimization target information carried in the request may be an optimization-criterion field carried in the request message. In practical applications, the identifiers corresponding to the parameter types included in different optimization target information can be pre-configured. For example, 1 corresponds to the minimum number of hops, 2 corresponds to the minimum delay, 3 corresponds to the minimum number of flashes, and 4 corresponds to load balancing. In the optimization-criterion field carried in the field, adding an identifier indicates the parameter type included in the optimization target information.

In this embodiment, the second node calculates the optimal route in the domain based on the optimization target information, specifically based on the parameter types included in the optimization target information. For example, the parameters included in the optimization target information are the minimum number of hops and the minimum delay, then the second node The node determines the routing path that satisfies the minimum number of hops in the domain, and then selects the routing path with the lowest delay from the routing path, and uses the edge node of the final routing path and the corresponding hops and delay of the path as parameter values to generate an abstract node. information.

In an optional embodiment of the present invention, the method further includes: the second node records the connection relationship of the abstract nodes satisfying the optimization target information and the mapping relationship between the physical resources corresponding to the abstract nodes.

In an optional embodiment of the present invention, the method further includes: receiving, by the second node, routing information from the first node, and configuring an actual network device based on the routing information and the mapping relationship.

By adopting the technical solutions of the embodiments of the present invention, the first node (eg SC) sends the optimization target information to the second node (eg DC), and obtains the abstract node information that satisfies the optimization target information, so as to calculate the route based on the abstract node information information, on the one hand, the determination of the global optimal routing within and between domains is realized; on the other hand, the optimal routing information in the domain is calculated and determined by the second node based on the optimization target information, without the need for the first node (such as SC) to collect all the information. The information of the domain and the calculation of the global optimal route greatly reduce the pressure on the computing resources and storage resources of the first node (such as SC), and on the other hand, it also ensures the service quality and cost of the business.

FIG. 4 is a schematic flow chart 3 of a method for determining routing information according to an embodiment of the present invention; this embodiment is described by taking the first node as an SC and the second node as a DC as an example; as shown in FIG. 4 , the method includes:

Step 301: the SC receives a service request; the service request may specifically be a virtual network instantiation request or a virtual network update request;

Step 302: the SC sends a network abstraction request to the DC; the network abstraction request carries an optimization-criterion field; the optimization-criterion field represents the parameter type of the optimization target information;

Step 303: The DC virtualizes the actual network devices in the domain into nodes, calculates the optimal route in the domain according to the parameter type carried in the network abstraction request, and saves the mapping relationship between the route and the corresponding actual network device; The optimal route is the route that satisfies the parameter type;

Step 304: the DC sends the abstract node information to the SC; the abstract node information includes the determined edge node of the optimal route and the value corresponding to the corresponding parameter type;

Step 305: the SC forms an abstract topology between domains according to the abstract node information fed back by all DCs, and determines the shortest routing path on the abstract topology, and generates routing information;

Step 306: SC sends routing information to all DCs;

Step 307: the DC sends configuration information to the corresponding actual network device according to the routing information and the saved mapping relationship;

Step 308: The DC feeds back the road construction result to the SC.

The embodiment of the present invention also provides a node. FIG. 5 is a schematic diagram of a composition structure of a node according to an embodiment of the present invention; as shown in FIG. 5 , the node includes: a first communication unit 41 and a first processing unit 42; wherein,

The first communication unit 41 is configured to send a network abstraction request to the second node; the network abstraction request carries optimization target information; obtains abstract node information from the second node; wherein the abstract node information satisfies all requirements. Describe the optimization target information;

The first processing unit 42 is configured to determine routing information based on the abstract node information obtained by the first communication unit 41 .

In an optional embodiment of the present invention, the first processing unit 42 is further configured to obtain optimization target information before the first communication unit 41 sends a network abstraction request to the second node; the optimization target The information includes at least one of the following parameters: minimum number of hops, minimum delay, minimum number of flashes, and load balancing parameters.

In an optional embodiment of the present invention, the first communication unit 41 is configured to obtain abstract node information from the second node, where the abstract node information includes at least one group of abstract nodes and parameters of parameter values. The mapping relationship; the parameter corresponding to the parameter value includes at least one of the following parameters: the minimum number of hops, the minimum delay, the minimum number of flashes, and the load balancing parameter;

The first processing unit 42 is configured to determine routing information that satisfies the condition based on the mapping relationship between the at least one group of abstract nodes and the parameter area.

In this embodiment of the present invention, the first processing unit 42 in the node may be composed of a central processing unit (CPU, Central Processing Unit), a digital signal processor (DSP, Digital Signal Processor), a central processing unit (CPU, Central Processing Unit), a digital signal processor (DSP, Digital Signal Processor), Microcontroller Unit (MCU, Microcontroller Unit) or Programmable Gate Array (FPGA, Field-Programmable Gate Array); the first communication unit 41 in the node can be implemented through a communication module (including: basic communication in practical applications) kits, operating systems, communication modules, standardized interfaces and protocols, etc.) and transceiver antenna implementation.

It should be noted that: when the nodes provided in the above-mentioned embodiments determine routing information, only the division of the above-mentioned program modules is used as an example. The internal structure of the node is divided into different program modules to complete all or part of the processing described above. In addition, the nodes provided in the above embodiments belong to the same concept as the routing information determining method embodiments, and the specific implementation process thereof is detailed in the method embodiments, which will not be repeated here.

The embodiment of the present invention also provides a node. FIG. 6 is a schematic diagram of another composition structure of a node according to an embodiment of the present invention; as shown in FIG. 6 , the node includes: a second communication unit 51 and a second processing unit 52 ; wherein,

The second communication unit 51 is used to obtain a network abstraction request from the first node; the network abstraction request carries optimization target information;

The second processing unit 52 is configured to determine abstract node information based on the optimization target information obtained by the second communication unit 51, and send the abstract node information to the first node.

In an optional embodiment of the present invention, the second processing unit 52 is configured to, based on at least one of a minimum number of hops, a minimum delay, a minimum number of flashes, and a load balancing parameter included in the optimization target information The abstract node and the corresponding parameter value are determined by the parameters, and the abstract node information is determined based on the abstract node and the corresponding parameter value.

In an optional embodiment of the present invention, the second processing unit 52 is further configured to record the connection relationship of the abstract nodes satisfying the optimization target information and the mapping relationship between the physical resources corresponding to the abstract nodes.

In this embodiment of the present invention, the second processing unit 52 in the node can be implemented by a CPU, DSP, MCU or FPGA in the node in practical applications; the second communication unit 51 in the node can be implemented in practical applications. In the application, the communication module (including: basic communication suite, operating system, communication module, standardized interface and protocol, etc.) and the transceiver antenna can be used.

It should be noted that: when the nodes provided in the above-mentioned embodiments determine routing information, only the division of the above-mentioned program modules is used as an example. The internal structure of the node is divided into different program modules to complete all or part of the processing described above. In addition, the nodes provided in the above embodiments belong to the same concept as the routing information determining method embodiments, and the specific implementation process thereof is detailed in the method embodiments, which will not be repeated here.

An embodiment of the present invention further provides a routing information determination system, the system includes a first node and a second node; wherein,

The first node is used to send a network abstraction request to the second node; the network abstraction request carries optimization target information; it is also used to obtain abstract node information from the second node, and determine a route based on the abstract node information information; wherein, the abstract node information satisfies the optimization target information;

the second node is configured to obtain a network abstraction request from the first node; the network abstraction request carries optimization target information; and is further configured to determine abstract node information based on the optimization target information, and send the abstract node information to the first node.

In an optional embodiment of the present invention, the first node is further configured to obtain optimization target information before sending a network abstraction request to the second node; the optimization target information includes at least one of the following parameters: the minimum Hop count, minimum delay, minimum number of flashes, and load balancing parameters.

In an optional embodiment of the present invention, the first node is configured to obtain abstract node information from the second node, where the abstract node information includes at least one set of abstract nodes and a mapping relationship of parameter values ; The parameter corresponding to the parameter value includes at least one of the following parameters: the minimum number of hops, the minimum delay, the minimum number of flashes, and the load balancing parameter; based on the at least one group of abstract nodes and the mapping relationship of the parameter area, it is determined to satisfy the Conditional routing information.

In an optional embodiment of the present invention, the second node is configured to, based on at least one parameter of the minimum number of hops, the minimum delay, the minimum number of flashes, and load balancing parameters included in the optimization target information An abstract node and corresponding parameter values are determined, and abstract node information is determined based on the abstract node and the corresponding parameter values.

In an optional embodiment of the present invention, the second node is further configured to record the connection relationship of the abstract nodes satisfying the optimization target information and the mapping relationship between the physical resources corresponding to the abstract nodes.

An embodiment of the present invention also provides a node, and FIG. 7 is a schematic diagram of the hardware structure of the node according to the embodiment of the present invention; as shown in FIG. 7 , the node includes a memory 62, a processor 61, and is stored in the memory 62 and can be stored in the memory 62. A computer program running on the processor 61 . It can be understood that the node also includes a communication interface 63 ; various components in the node are coupled together through a bus system 64 . It will be appreciated that the bus system 64 is used to implement the connection communication between these components. In addition to the data bus, the bus system 64 also includes a power bus, a control bus and a status signal bus. However, for the sake of clarity, the various buses are labeled as bus system 64 in FIG. 7 .

Optionally, the node may specifically be the first node of the embodiment of the present application, and the node may implement the corresponding processes implemented by the first node in each method of the embodiment of the present application, which is not repeated here for brevity.

Optionally, the node may specifically be the second node of the embodiment of the present application, and the node may implement the corresponding processes implemented by the second node in each method of the embodiment of the present application, which is not repeated here for brevity.

It will be appreciated that the memory 62 may be either volatile memory or non-volatile memory, and may include both volatile and non-volatile memory. Among them, the non-volatile memory may be a read-only memory (ROM, Read Only Memory), a programmable read-only memory (PROM, Programmable Read-Only Memory), an erasable programmable read-only memory (EPROM, Erasable Programmable Read-only memory) Only Memory), Electrically Erasable Programmable Read-Only Memory (EEPROM, Electrically Erasable Programmable Read-Only Memory), Magnetic Random Access Memory (FRAM, ferromagnetic random access memory), Flash Memory (Flash Memory), Magnetic Surface Memory , CD-ROM, or Compact Disc Read-Only Memory (CD-ROM, Compact Disc Read-Only Memory); the magnetic surface memory can be a magnetic disk memory or a tape memory. The volatile memory may be Random Access Memory (RAM), which is used as an external cache memory. By way of example and not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), Synchronous Static Random Access Memory (SSRAM), Dynamic Random Access Memory Memory (DRAM, Dynamic Random Access Memory), Synchronous Dynamic Random Access Memory (SDRAM, SynchronousDynamic Random Access Memory), Double Data Rate Synchronous Dynamic Random Access Memory (DDRSDRAM, Double Data Rate Synchronous Dynamic Random Access Memory), Enhanced Synchronous Dynamic Random Access Memory (ESDRAM, Enhanced Synchronous Dynamic Random Access Memory), Synchronous Link Dynamic Random Access Memory (SLDRAM, SyncLink Dynamic Random Access Memory), Direct Memory Bus Random Access Memory (DRRAM, Direct Rambus Random Access Memory) . The memory 62 described in the embodiments of the present invention is intended to include, but not be limited to, these and any other suitable types of memory.

The methods disclosed in the above embodiments of the present invention may be applied to the processor 61 or implemented by the processor 61 . The processor 61 may be an integrated circuit chip with signal processing capability. In the implementation process, each step of the above-mentioned method can be completed by a hardware integrated logic circuit in the processor 61 or an instruction in the form of software. The above-mentioned processor 61 may be a general-purpose processor, a DSP, or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, and the like. The processor 61 may implement or execute the methods, steps, and logical block diagrams disclosed in the embodiments of the present invention. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the method disclosed in combination with the embodiments of the present invention can be directly embodied as being executed by a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor. The software module may be located in a storage medium, and the storage medium is located in the memory 62, and the processor 61 reads the information in the memory 62, and completes the steps of the foregoing method in combination with its hardware.

Embodiments of the present invention also provide a computer-readable storage medium, on which a computer program is stored.

Optionally, the computer-readable storage medium can be applied to the first node in the embodiments of the present application, and the computer program causes the computer to execute the corresponding processes implemented by the first node in the various methods of the embodiments of the present application. For brevity, It is not repeated here.

Optionally, the computer-readable storage medium may be applied to the second node in the embodiments of the present application, and the computer program causes the computer to execute the corresponding processes implemented by the second node in the various methods of the embodiments of the present application. For brevity, It is not repeated here.

In the several embodiments provided in this application, it should be understood that the disclosed apparatus and method may be implemented in other manners. The device embodiments described above are only illustrative. For example, the division of the units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components may be combined, or Can be integrated into another system, or some features can be ignored, or not implemented. In addition, the coupling, or direct coupling, or communication connection between the components shown or discussed may be through some interfaces, and the indirect coupling or communication connection of devices or units may be electrical, mechanical or other forms. of.

The unit described above as a separate component may or may not be physically separated, and the component displayed as a unit may or may not be a physical unit, that is, it may be located in one place or distributed to multiple network units; Some or all of the units may be selected according to actual needs to achieve the purpose of the solution in this embodiment.

In addition, each functional unit in each embodiment of the present invention may all be integrated into one processing unit, or each unit may be separately used as a unit, or two or more units may be integrated into one unit; the above-mentioned integration The unit can be implemented either in the form of hardware or in the form of hardware plus software functional units.

Those of ordinary skill in the art can understand that all or part of the steps of implementing the above method embodiments can be completed by program instructions related to hardware, the aforementioned program can be stored in a computer-readable storage medium, and when the program is executed, execute It includes the steps of the above method embodiments; and the aforementioned storage medium includes: a removable storage device, a ROM, a RAM, a magnetic disk or an optical disk and other media that can store program codes.

Alternatively, if the above-mentioned integrated unit of the present invention is implemented in the form of a software function module and sold or used as an independent product, it may also be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of the embodiments of the present invention may be embodied in the form of software products in essence or the parts that make contributions to the prior art. The computer software products are stored in a storage medium and include several instructions for A computer device (which may be a personal computer, a server, or a network device, etc.) is caused to execute all or part of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes: a removable storage device, a ROM, a RAM, a magnetic disk or an optical disk and other mediums that can store program codes.

The above are only specific embodiments of the present invention, but the protection scope of the present invention is not limited thereto. Any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed by the present invention. should be included within the protection scope of the present invention. Therefore, the protection scope of the present invention should be based on the protection scope of the claims.

Claims (15)

1. A method for determining routing information, wherein the method comprises: The first node sends a network abstraction request to the second node; the network abstraction request carries optimization target information; The first node obtains abstract node information from the second node, and determines routing information based on the abstract node information; wherein the abstract node information satisfies the optimization target information. 2. The method according to claim 1, wherein before the first node sends a network abstraction request to the second node, the method further comprises: The first node obtains optimization target information; the optimization target information includes at least one of the following parameters: a minimum number of hops, a minimum delay, a minimum number of flashes, and a load balancing parameter. 3. The method according to claim 1 or 2, wherein the first node obtains abstract node information from the second node, and determines routing information based on the abstract node information, comprising: The first node obtains abstract node information from the second node, and the abstract node information includes at least one set of abstract nodes and the mapping relationship of parameter values; the parameters corresponding to the parameter values include at least one of the following parameters 1: Minimum hop count, minimum delay, minimum number of flashes, load balancing parameters; The first node determines routing information that satisfies the condition based on the at least one group of abstract nodes and the mapping relationship of the parameter area. 4. A method for determining routing information, wherein the method comprises: The second node obtains a network abstraction request from the first node; the network abstraction request carries optimization target information; The second node determines abstract node information based on the optimization target information, and sends the abstract node information to the first node. 5. The method according to claim 4, wherein the second node determines abstract node information based on the optimization target information, comprising: The second node determines an abstract node and a corresponding parameter value based on at least one of the minimum number of hops, the minimum delay, the minimum number of flashes, and the load balancing parameter included in the optimization target information, and based on the abstract node And the corresponding parameter values determine the abstract node information. 6. The method according to claim 4 or 5, wherein the method further comprises: The second node records the connection relationship of the abstract nodes satisfying the optimization target information and the mapping relationship between the physical resources corresponding to the abstract nodes. 7. A node, wherein the node is a first node; the node comprises: a first communication unit and a first processing unit; wherein, The first communication unit is configured to send a network abstraction request to the second node; the network abstraction request carries optimization target information; obtains abstract node information from the second node; wherein the abstract node information satisfies the Optimize target information; The first processing unit is configured to determine routing information based on the abstract node information obtained by the first communication unit. 8. The node according to claim 7, wherein the first processing unit is further configured to obtain optimization target information before the first communication unit sends a network abstraction request to the second node; the optimization The target information includes at least one of the following parameters: minimum number of hops, minimum delay, minimum number of flashes, and load balancing parameters. 9. The node according to claim 7 or 8, wherein the first communication unit is configured to obtain abstract node information from the second node, the abstract node information comprising at least one group of abstract nodes and The mapping relationship of parameter values; the parameters corresponding to the parameter values include at least one of the following parameters: minimum number of hops, minimum delay, minimum number of flashes, and load balancing parameters; The first processing unit is configured to determine routing information that satisfies the condition based on the mapping relationship between the at least one group of abstract nodes and the parameter area. 10. A node, wherein the node is a second node; the node comprises: a second communication unit and a second processing unit; wherein, The second communication unit is used to obtain a network abstraction request from the first node; the network abstraction request carries optimization target information; The second processing unit is configured to determine abstract node information based on the optimization target information obtained by the second communication unit, and send the abstract node information to the first node. 11. The node according to claim 10, wherein the second processing unit is configured to include a minimum number of hops, a minimum delay, a minimum number of flashes, and a load balancing parameter based on the optimization target information. At least one parameter determines an abstract node and a corresponding parameter value, and determines abstract node information based on the abstract node and the corresponding parameter value. 12. The node according to claim 10 or 11, wherein the second processing unit is further configured to record the connection relationship of the abstract nodes that satisfy the optimization target information and the relationship between the physical resources corresponding to the abstract nodes. Mapping relations. 13. A system for determining routing information, wherein the system comprises a first node and a second node; wherein, The first node is used to send a network abstraction request to the second node; the network abstraction request carries optimization target information; it is also used to obtain abstract node information from the second node, and determine a route based on the abstract node information information; wherein, the abstract node information satisfies the optimization target information; the second node is configured to obtain a network abstraction request from the first node; the network abstraction request carries optimization target information; and is further configured to determine abstract node information based on the optimization target information, and send the abstract node information to the first node. 14. A computer-readable storage medium on which a computer program is stored, characterized in that, when the program is executed by a processor, the steps of the method according to any one of claims 1 to 3 are implemented; or, the program is executed by the processor When executed, the steps of the method of any one of claims 4 to 6 are implemented. 15. A node, comprising a memory, a processor and a computer program stored in the memory and running on the processor, wherein the processor implements any of claims 1 to 3 when executing the program. or, when the processor executes the program, the processor implements the steps of the method according to any one of claims 4 to 6.

Images