CN111030928A - Routing information determination method, node, system and storage medium - Google Patents
Routing information determination method, node, system and storage medium Download PDFInfo
- Publication number
- CN111030928A CN111030928A CN201811179631.9A CN201811179631A CN111030928A CN 111030928 A CN111030928 A CN 111030928A CN 201811179631 A CN201811179631 A CN 201811179631A CN 111030928 A CN111030928 A CN 111030928A
- Authority
- CN
- China
- Prior art keywords
- node
- information
- abstract
- optimization target
- minimum
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/04—Interdomain routing, e.g. hierarchical routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the invention discloses a method, a node, a system and a storage medium for determining routing information. The method comprises the following steps: 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, and determines routing information based on the abstract node information; wherein the abstract node information satisfies the optimization objective information.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method, a node, a system, and a storage medium for determining routing information.
Background
When a service is opened, an optical transport network generally needs to perform routing calculation according to different constraint conditions or optimization targets according to different service types.
According to The abstract and Control of Traffic Engineering network (ACTN) model of The Internet Engineering Task Force (IETF), there are two main ways to calculate cross-domain routing:
the first way is to complete cross-domain routing calculation through the cooperation of an inter-domain controller (SC) and an intra-Domain Controller (DC); SC only calculates inter-domain route without storing intra-domain topology, and specifies the sequence of the route passing through each domain to determine inter-domain intercommunication link; and according to the inter-domain intercommunication nodes, issuing intra-domain route calculation requests to each domain, and calculating intra-domain routes by the DC. The advantage of this approach is that the SC computation is relatively simple, and the disadvantage is that the computed route is only an inter-domain route, not a globally optimal route;
the second mode is that SC completes cross-domain route calculation independently; the SC collects information of all DCs, forms a global topology, and calculates global routes. The advantage of this approach is that a globally optimal route can be computed, and the disadvantage is that a large amount of storage space is required and the computation load of the SC is very large.
Disclosure of Invention
In order to solve the existing technical problem, embodiments of the present invention provide a method, a node, a system, and a storage medium for determining routing information.
In order to achieve the above purpose, the technical solution of the embodiment of the present invention is realized as follows:
the embodiment of the invention provides a method for determining routing information, which comprises the following steps:
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, and determines routing information based on the abstract node information; wherein the abstract node information satisfies the optimization objective information.
In the foregoing 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 objective information includes at least one of the following parameters: minimum hop count, minimum time delay, minimum flash times, load balancing parameters.
In the above solution, the obtaining, by the first node, abstract node information from the second node, and determining routing information based on the abstract node information includes:
the first node obtains abstract node information from the second node, wherein the abstract node information comprises at least one group of abstract nodes and a mapping relation of parameter values; the parameter corresponding to the parameter value comprises at least one of the following parameters: minimum hop count, minimum time delay, minimum flash frequency and load balancing parameters;
and the first node determines the routing information meeting the condition based on the mapping relation of the at least one group of abstract nodes and the parameter area.
The embodiment of the invention also provides a method for determining the routing information, which comprises the following steps: the second node obtains a network abstraction request from the first node; the network abstraction request carries optimization target information;
and 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 foregoing solution, the determining, by the second node, abstract node information based on the optimization target information includes: and the second node determines an abstract node and a corresponding parameter value based on at least one parameter of the minimum hop count, the minimum delay, the minimum flash frequency and the load balancing parameter included in the optimization target information, and determines abstract node information based on the abstract node and the corresponding parameter value.
In the above scheme, the method further comprises: and the second node records the connection relation of the abstract nodes meeting the optimization target information and the mapping relation between the physical resources corresponding to the abstract nodes.
The embodiment of the invention also provides a node, which is a first node; the node comprises: the system comprises a first communication unit and a first processing unit; wherein the content of the first and second substances,
the first communication unit is used for sending a network abstraction request to the second node; the network abstraction request carries optimization target information; obtaining abstract node information from the second node; wherein the abstract node information satisfies the optimization objective 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 scheme, the first processing unit is further configured to obtain optimization target information before the first communication unit sends the network abstraction request to the second node; the optimization objective information includes at least one of the following parameters: minimum hop count, minimum time delay, minimum flash times, load balancing parameters.
In the above scheme, the first communication unit 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 a mapping relationship between parameter values; the parameter corresponding to the parameter value comprises at least one of the following parameters: minimum hop count, minimum time delay, minimum flash frequency and load balancing parameters;
the first processing unit is configured to determine, based on the mapping relationship between the at least one group of abstract nodes and the parameter area, routing information that satisfies a condition.
The embodiment of the invention also provides a node, wherein the node is a second node; the node comprises: a second communication unit and a second processing unit; wherein the content of the first and second substances,
the second communication unit is used for obtaining 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 foregoing solution, the second processing unit is configured to determine an abstract node and a corresponding parameter value based on at least one of a minimum hop count, a minimum delay, a minimum number of flash-off times, and a load balancing parameter included in the optimization target information, and determine abstract node information based on the abstract node and the corresponding parameter value.
In the foregoing scheme, the second processing unit is further configured to record a connection relationship between the abstract nodes that satisfy the optimization target information and a mapping relationship between physical resources corresponding to the abstract nodes.
The embodiment of the invention also provides a system for determining the routing information, which comprises a first node and a second node; wherein the content of the first and second substances,
the first node is used for sending a network abstraction request to the second node; the network abstraction request carries optimization target information; the second node is also used for obtaining abstract node information from the second node and determining routing information based on the abstract node information; wherein the abstract node information satisfies the optimization objective information;
the second node is used for obtaining a network abstraction request from the first node; the network abstraction request carries optimization target information; and the first node is also used for determining abstract node information based on the optimization target information and sending the abstract node information to the first node.
An embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the steps of the routing information determination method applied to the first node according to the embodiment of the present invention; alternatively, the program implements the steps of the routing information determination method applied to the second node according to the embodiment of the present invention when executed by the processor.
The embodiment of the invention also provides a node, which comprises a memory, a processor and a computer program which is stored on the memory and can run on the processor, wherein the processor executes the program to realize the steps of the routing information determination method applied to the first node in the embodiment of the invention; or, the processor implements the steps of the routing information determination method applied to the second node according to the embodiment of the present invention when executing the program.
According to the routing information determining method, the node, the system and the storage medium provided by the embodiment of the invention, on one hand, a first node sends a network abstraction request to a second node; the network abstraction request carries optimization target information; obtaining abstract node information from the second node, and determining routing information based on the abstract node information; wherein the abstract node information satisfies the optimization objective information. In another aspect, a second node obtains a network abstraction request from a first node; the network abstraction request carries optimization target information; and determining abstract node information based on the optimization target information, and sending the abstract node information to the first node. By adopting the technical scheme of the embodiment of the invention, the optimization target information is sent to the second node (such as DC) through the first node (such as SC), and the abstract node information meeting the optimization target information is obtained, so that the routing information is calculated through the abstract node information, and on one hand, the determination of the global optimal routing in the domain and between the 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, and the first node (such as SC) is not required to collect all domain information and calculate the global optimal routing, so that the pressure of the calculation resource and the storage resource of the first node (such as SC) is greatly reduced, and the service quality and the cost are also ensured on the other hand.
Drawings
Fig. 1 is a schematic diagram of a network control architecture to which a routing information determination method according to an embodiment of the present invention is applied;
fig. 2 is a first flowchart of a routing information determining method according to an embodiment of the present invention;
fig. 3 is a flowchart illustrating a second method for determining routing information according to an embodiment of the present invention;
fig. 4 is a third schematic flowchart of a routing information determining method according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of a node structure according to an embodiment of the present invention;
FIG. 6 is a schematic diagram of another 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 Description
Before elaborating the technical solution of the embodiment of the present invention, a Network control architecture based on a Software Defined Network (SDN) is briefly described.
Fig. 1 is a schematic diagram of a network control architecture to which a routing information determination method according to an embodiment of the present invention is applied; as shown in fig. 1, the network control architecture includes SC and DC; the DC is used for realizing the routing control and resource management in the domain; the SC is used for inter-domain coordination and resource scheduling, and realizes multi-domain interworking, especially configuration of an interworking port, and the like. Each domain requires at least one DC; and at least one SC is needed between multiple domains. And signaling is interacted between the DC and the SC through a DC northbound interface, so that the SC unified scheduling is realized. The northbound interface typically uses an information model of international standards (e.g., the present embodiment may be based on the IETF ACTN standard model).
In one example, a domain refers to a network area range, such as a network area range corresponding to a network device to which a vendor or an operator belongs. It will be appreciated that the network area ranges between one domain and another may be separate from each other, may overlap or partially overlap each other.
The ACTN is a data model proposed by IETF, can express network abstraction models with different degrees by using Yang language description, and can be used for a data transfer information model between multi-layer SDN controllers.
The present invention will be described in further detail with reference to the accompanying drawings and specific embodiments.
The embodiment of the invention provides a method for determining routing information. Fig. 2 is a first flowchart of a routing information determining method according to an embodiment of the present invention; as shown in fig. 2, the method includes:
step 101: a first node sends a network abstraction request to a second node; the network abstraction request carries optimization objective 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 objective information.
The routing information determination method of the 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. And the second node is used for route control and resource management in the domain; as an example, the second node may be DC.
In an optional embodiment of the invention, before the first node sends the network abstraction request to the second node, the method further comprises: the first node obtains optimization target information; the optimization objective information includes at least one of the following parameters: minimum hop count, minimum time delay, minimum flash times, load balancing parameters.
In this embodiment, a network abstraction request message sent by a first node to a second node carries a field representing optimization target information; the parameters included in the optimization target information can be configured in advance by a professional, for example, through a human-computer interaction interface.
As an example, if the network control architecture in this embodiment is based on the ACTN standard model of the IETF, a connectivity-model (connectivity-model) in the model represents a cross-connection matrix, two fields are added in the connectivity-model, for example, a first field is added to represent optimization target information, and a second field is added to represent abstract node information, so as to specifically represent parameter values corresponding to the abstract nodes. As an example, the newly added fields may be illustrated by the bold portions in the code example as a newly added optimization-criterion (optimization-criterion) field and a connectivity-cost (connection-cost) field; the definitions of the two newly added fields can be shown in table 1, wherein the optimization-criterion field is used to indicate the type of the optimization target information; and the connection-cost field is used for representing a value corresponding to the type of the optimization target information.
TABLE 1
In this embodiment, the first node sends a network abstraction request to the second node when receiving a specific operation; 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 instantiation (VN instantiation) operation or a virtual network Update (VN Update) operation, etc., but is not limited to the above operation; it can be understood that when the first node receives the virtual network instantiation operation, the first node sends a virtual network instantiation request to the second node, and the request carries optimization target information; or when the first node receives the virtual network updating operation, sending a virtual network updating request to the second node, wherein the request carries the optimization target information. The optimization target information carried in the request can be that an optimization-criterion field is carried in the request message. In practical application, identifiers corresponding to parameter types included in different optimization target information can be configured in advance, for example, 1 corresponds to the minimum hop count, 2 corresponds to the minimum delay, 3 corresponds to the minimum flash frequency, and 4 corresponds to load balancing, so that the parameter types included in the optimization-criterion information can be represented by adding the identifiers in an optimization-criterion field carried in a request message.
In this embodiment, the first node sends a network abstraction request to all the second nodes associated therewith, so as to obtain the abstract node information fed back by all the second nodes.
In an optional embodiment of the present invention, the obtaining, by the first node, abstract node information from the second node, and determining routing information based on the abstract node information includes: the first node obtains abstract node information from the second node, wherein the abstract node information comprises at least one group of abstract nodes and a mapping relation of parameter values; the parameter corresponding to the parameter value comprises at least one of the following parameters: minimum hop count, minimum time delay, minimum flash frequency and load balancing parameters; and the first node determines the routing information meeting the condition based on the mapping relation of the at least one group of abstract nodes and the parameter area.
In this embodiment, the first node obtains the abstract node information fed back by all the second nodes, where the abstract node information includes at least one group of abstract nodes and a mapping relationship of parameter values. As an example, the abstract node is an edge node corresponding to the routing path determined by the second node according to the optimization target information, and the first node may perform inter-domain path optimization calculation according to the abstract nodes fed back by all the second nodes, so as to determine the optimal routing information. As another example, the abstract node information includes edge nodes and corresponding parameter values corresponding to the routing path determined by the second node according to the optimization target information, and the second node may perform intra-domain path selection and inter-domain path optimization calculation according to the abstract nodes and corresponding parameter values fed back by all the second nodes, that is, determine two edge nodes of a domain corresponding to a certain second node, and further determine an inter-domain shortest route based on the edge nodes of the domain corresponding to all the second nodes, thereby determining 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 invention, the method further comprises: and the first node sends the routing information to the second node so that the second node configures the actual network equipment according to the routing information and the locally stored mapping relation.
By adopting the technical scheme of the embodiment of the invention, the optimization target information is sent to the second node (such as DC) through the first node (such as SC), and the abstract node information meeting the optimization target information is obtained, so that the routing information is calculated through the abstract node information, and on one hand, the determination of the global optimal routing in the domain and between the 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, and the first node (such as SC) is not required to collect all domain information and calculate the global optimal routing, so that the pressure of the calculation resource and the storage resource of the first node (such as SC) is greatly reduced, and the service quality and the cost are also ensured on the other hand.
The embodiment of the invention also provides a method for determining the routing information. Fig. 3 is a flowchart illustrating a second 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 objective information.
Step 202: and the second node determines abstract node information based on the optimization target information and sends the abstract node information to the first node.
The routing information determination method of the present embodiment is applied to the second node; the second node is used for route control and resource management in the domain; as an example, the second node may be DC. And 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 determining, by the second node, abstract node information based on the optimization objective information includes: and the second node determines an abstract node and a corresponding parameter value based on at least one parameter of the minimum hop count, the minimum delay, the minimum flash frequency and the load balancing parameter included in the optimization target information, and determines abstract node information based on the abstract node and the corresponding parameter value.
As an example, if the network control architecture in this embodiment is based on an ACTN standard model of the IETF, a connection-matrix in the model represents a cross-connection matrix, and two fields are added to the connection-matrix, for example, a first field is added to represent optimization target information, and a second field is added to represent abstract node information, so that a parameter value corresponding to an abstract node can be specifically represented. As an example, the newly added fields may be indicated by the bold portions in the code example in the above embodiments, such as the newly added optimization-criterion field and the connectivity-cost field; the definitions of the two newly added fields can be shown in table 1, wherein the optimization-criterion field is used to indicate the type of the optimization target information; and the connection-cost field is used for representing a 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 a virtual network instantiation operation, the network abstraction request sends a virtual network instantiation request to the second node, where the request carries optimization target information; or when the first node receives the virtual network updating operation, sending a virtual network updating request to the second node, wherein the request carries the optimization target information. The optimization target information carried in the request can be that an optimization-criterion field is carried in the request message. In practical application, identifiers corresponding to parameter types included in different optimization target information can be configured in advance, for example, 1 corresponds to the minimum hop count, 2 corresponds to the minimum delay, 3 corresponds to the minimum flash frequency, and 4 corresponds to load balancing, so that the parameter types included in the optimization-criterion information can be represented by adding the identifiers in an optimization-criterion field carried in a request message.
In this embodiment, the second node performs calculation of an intra-domain optimal route based on the optimization target information, specifically based on the parameter type included in the optimization target information, for example, if the parameter included in the optimization target information is the minimum hop count and the minimum delay, the second node determines a routing path satisfying the minimum hop count in the domain, selects a routing path with the minimum delay from the routing paths, and generates abstract node information by taking an edge node of the finally determined routing path and the hop count and the delay corresponding to the path as parameter values.
In an optional embodiment of the invention, the method further comprises: and the second node records the connection relation of the abstract nodes meeting the optimization target information and the mapping relation between the physical resources corresponding to the abstract nodes.
In an optional embodiment of the invention, the method further comprises: and the second node receives the routing information from the first node and configures the actual network equipment based on the routing information and the mapping relation.
By adopting the technical scheme of the embodiment of the invention, the optimization target information is sent to the second node (such as DC) through the first node (such as SC), and the abstract node information meeting the optimization target information is obtained, so that the routing information is calculated through the abstract node information, and on one hand, the determination of the global optimal routing in the domain and between the 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, and the first node (such as SC) is not required to collect all domain information and calculate the global optimal routing, so that the pressure of the calculation resource and the storage resource of the first node (such as SC) is greatly reduced, and the service quality and the cost are also ensured on the other hand.
Fig. 4 is a third schematic flowchart of a routing information determining method according to an embodiment of the present invention; in this embodiment, the first node is SC, and the second node is DC; 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 abstract request carries an optimization-criterion field; the optimization-criterion field represents the parameter type of the optimization target information;
step 303: the DC virtualizes actual network equipment in the domain into nodes, calculates the optimal route in the domain according to the parameter type carried in the network abstract request, and stores the route and the mapping relation of the corresponding actual network equipment; wherein the optimal route is a route satisfying the parameter type;
step 304: the DC sends abstract node information to the SC; the abstract node information comprises edge nodes of the determined optimal route and values corresponding to the corresponding parameter types;
step 305: the SC forms an inter-domain abstract topology according to abstract node information fed back by all DCs, determines the shortest routing path on the abstract topology and generates routing information;
step 306: the SC sends routing information to all DCs;
step 307: the DC sends configuration information to corresponding actual network equipment according to the routing information and the stored mapping relation;
step 308: the DC feeds back the path establishment result to the SC.
The embodiment of the invention also provides a node. FIG. 5 is a schematic diagram of a node structure 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 content of the first and second substances,
the first communication unit 41 is configured to send a network abstraction request to a second node; the network abstraction request carries optimization target information; obtaining abstract node information from the second node; wherein the abstract node information satisfies the optimization objective 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 the network abstraction request to the second node; the optimization objective information includes at least one of the following parameters: minimum hop count, minimum time delay, minimum flash times, 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 a mapping relationship between parameter values; the parameter corresponding to the parameter value comprises at least one of the following parameters: minimum hop count, minimum time delay, minimum flash frequency and load balancing parameters;
the first processing unit 42 is configured to determine, based on the mapping relationship between the at least one group of abstract nodes and the parameter area, routing information that satisfies a condition.
In the embodiment of the present invention, the first Processing Unit 42 in the node may be implemented by a Central Processing Unit (CPU), a Digital Signal Processor (DSP), a Micro Control Unit (MCU), or a Programmable Gate Array (FPGA) in the node in practical application; the first communication unit 41 in the node can be implemented by a communication module (including a basic communication suite, an operating system, a communication module, a standardized interface, a protocol, etc.) and a transceiver antenna in practical application.
It should be noted that: in the node provided in the foregoing embodiment, when determining routing information, only the division of each program module is described as an example, and in practical applications, the processing distribution may be completed by different program modules according to needs, that is, 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 embodiments of the node and the routing information determining method provided by the above embodiments belong to the same concept, and specific implementation processes thereof are described in the embodiments of the methods for details, and are not described herein again.
The embodiment of the invention also provides a node. FIG. 6 is a schematic diagram of another 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 content of the first and second substances,
the second communication unit 51 is configured 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 determine an abstract node and a corresponding parameter value based on at least one of a minimum hop count, a minimum delay, a minimum number of flash times, and a load balancing parameter included in the optimization target information, and determine the abstract node information 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 a connection relationship of the abstract nodes that satisfy the optimization target information and a mapping relationship between physical resources corresponding to the abstract nodes.
In the embodiment of the present invention, the second processing unit 52 in the node can be implemented by a CPU, a DSP, an MCU or an FPGA in the node in practical application; the second communication unit 51 in the node can be implemented by a communication module (including a basic communication suite, an operating system, a communication module, a standardized interface, a protocol, etc.) and a transceiver antenna in practical application.
It should be noted that: in the node provided in the foregoing embodiment, when determining routing information, only the division of each program module is described as an example, and in practical applications, the processing distribution may be completed by different program modules according to needs, that is, 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 embodiments of the node and the routing information determining method provided by the above embodiments belong to the same concept, and specific implementation processes thereof are described in the embodiments of the methods for details, and are not described herein again.
The embodiment of the invention also provides a system for determining the routing information, which comprises a first node and a second node; wherein the content of the first and second substances,
the first node is used for sending a network abstraction request to the second node; the network abstraction request carries optimization target information; the second node is also used for obtaining abstract node information from the second node and determining routing information based on the abstract node information; wherein the abstract node information satisfies the optimization objective information;
the second node is used for obtaining a network abstraction request from the first node; the network abstraction request carries optimization target information; and the first node is also used for determining abstract node information based on the optimization target information and sending 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 the network abstraction request to the second node; the optimization objective information includes at least one of the following parameters: minimum hop count, minimum time delay, minimum flash times, 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 group of abstract nodes and a mapping relationship of parameter values; the parameter corresponding to the parameter value comprises at least one of the following parameters: minimum hop count, minimum time delay, minimum flash frequency and load balancing parameters; and determining the routing information meeting the condition based on the mapping relation of the at least one group of abstract nodes and the parameter area.
In an optional embodiment of the present invention, the second node is configured to determine an abstract node and a corresponding parameter value based on at least one of a minimum hop count, a minimum delay, a minimum number of flash times, and a load balancing parameter included in the optimization target information, and determine abstract node information based on the abstract node and the corresponding parameter value.
In an optional embodiment of the present invention, the second node is further configured to record a connection relationship between the abstract nodes that satisfy the optimization target information and a mapping relationship between physical resources corresponding to the abstract nodes.
Fig. 7 is a schematic diagram of a hardware structure of a node according to an embodiment of the present invention; as shown in fig. 7, the node comprises a memory 62, a processor 61 and a computer program stored on the memory 62 and executable on the processor 61. It will be appreciated that the node also includes a communications interface 63; the various components in the node are coupled together by a bus system 64. It will be appreciated that the bus system 64 is used to enable communications among the components. The bus system 64 includes a power bus, a control bus, and a status signal bus in addition to the data bus. For clarity of illustration, however, the various buses are labeled as bus system 64 in fig. 7.
Optionally, the node may be specifically a first node in the embodiment of the present application, and the node may implement a corresponding process implemented by the first node in each method in the embodiment of the present application, and details are not described herein for brevity.
Optionally, the node may be specifically a second node in the embodiment of the present application, and the node may implement a corresponding process implemented by the second node in each method in the embodiment of the present application, and for brevity, details are not described here again.
It will be appreciated that the memory 62 can be either volatile memory or nonvolatile memory, and can include both volatile and nonvolatile memory. Among them, the nonvolatile Memory may be a Read Only Memory (ROM), a Programmable Read Only Memory (PROM), an Erasable Programmable Read-Only Memory (EPROM), an Electrically Erasable Programmable Read-Only Memory (EEPROM), a magnetic random access Memory (FRAM), a Flash Memory (Flash Memory), a magnetic surface Memory, an optical disk, or a Compact Disc Read-Only Memory (CD-ROM); the magnetic surface storage may be disk storage or tape storage. Volatile memory can be Random Access Memory (RAM), which acts as external cache memory. By way of illustration 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 (DRAM), Synchronous Dynamic Random Access Memory (SDRAM), Double Data Rate Synchronous Dynamic Random Access Memory (DDRSDRAM), Enhanced Synchronous Dynamic Random Access Memory (ESDRAM), Enhanced Synchronous Dynamic Random Access Memory (Enhanced DRAM), Synchronous Dynamic Random Access Memory (SLDRAM), Direct Memory (DRmb Access), and Random Access Memory (DRAM). The memory 62 described in connection with the embodiments of the invention is intended to comprise, without being limited to, these and any other suitable types of memory.
The method 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 having signal processing capabilities. In implementation, the steps of the above method may be performed by integrated logic circuits of hardware or instructions in the form of software in the processor 61. The processor 61 described above may be a general purpose processor, a DSP, or other programmable logic device, discrete gate or transistor logic device, discrete hardware components, or the like. Processor 61 may implement or perform the methods, steps, and logic blocks disclosed in 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 by the embodiment of the invention can be directly implemented by a hardware decoding processor, or can be implemented by combining hardware and software modules in the decoding processor. The software modules may be located in a storage medium located in the memory 62, and the processor 61 reads the information in the memory 62 and performs the steps of the aforementioned method in conjunction with its hardware.
An embodiment of the present invention also provides a computer-readable storage medium on which a computer program is stored.
Optionally, the computer-readable storage medium may be applied to the first node in the embodiment of the present application, and the computer program enables the computer to execute the corresponding process implemented by the first node in each method in the embodiment of the present application, which is not described herein again for brevity.
Optionally, the computer-readable storage medium may be applied to the second node in the embodiment of the present application, and the computer program enables the computer to execute the corresponding process implemented by the second node in each method in the embodiment of the present application, which is not described herein again for brevity.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. The above-described device embodiments are merely illustrative, for example, the division of the unit is only a logical functional division, and there may be other division ways in actual implementation, such as: multiple units or components may be combined, or may be integrated into another system, or some features may be omitted, or not implemented. In addition, the coupling, direct coupling or communication connection between the components shown or discussed may be through some interfaces, and the indirect coupling or communication connection between the devices or units may be electrical, mechanical or other forms.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed on a plurality of network units; some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, all the functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may be separately regarded as one unit, or two or more units may be integrated into one unit; the integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.
Those of ordinary skill in the art will understand that: all or part of the steps for implementing the method embodiments may be implemented by hardware related to program instructions, and the program may be stored in a computer readable storage medium, and when executed, the program performs the steps including the method embodiments; and the aforementioned storage medium includes: a removable storage device, a ROM, a RAM, a magnetic or optical disk, or various other media that can store program code.
Alternatively, the integrated unit of the present invention may be stored in a computer-readable storage medium if it is implemented in the form of a software functional module and sold or used as a separate product. Based on such understanding, the technical solutions of the embodiments of the present invention may be essentially implemented or a part contributing to the prior art may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the methods described in the embodiments of the present invention. And the aforementioned storage medium includes: a removable storage device, a ROM, a RAM, a magnetic or optical disk, or various other media that can store program code.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the appended claims.
Claims (15)
1. A method for determining routing information, the method comprising:
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, and determines routing information based on the abstract node information; wherein the abstract node information satisfies the optimization objective information.
2. The method of claim 1, wherein prior to the first node sending a network abstraction request to the second node, the method further comprises:
the first node obtains optimization target information; the optimization objective information includes at least one of the following parameters: minimum hop count, minimum time delay, minimum flash times, load balancing parameters.
3. The method of claim 1 or 2, wherein the first node obtains abstract node information from the second node, and wherein determining routing information based on the abstract node information comprises:
the first node obtains abstract node information from the second node, wherein the abstract node information comprises at least one group of abstract nodes and a mapping relation of parameter values; the parameter corresponding to the parameter value comprises at least one of the following parameters: minimum hop count, minimum time delay, minimum flash frequency and load balancing parameters;
and the first node determines the routing information meeting the condition based on the mapping relation of the at least one group of abstract nodes and the parameter area.
4. A method for determining routing information, the method comprising:
the second node obtains a network abstraction request from the first node; the network abstraction request carries optimization target information;
and 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 of claim 4, wherein the second node determines abstract node information based on the optimization objective information, comprising:
and the second node determines an abstract node and a corresponding parameter value based on at least one parameter of the minimum hop count, the minimum delay, the minimum flash frequency and the load balancing parameter included in the optimization target information, and determines abstract node information based on the abstract node and the corresponding parameter value.
6. The method according to claim 4 or 5, characterized in that the method further comprises:
and the second node records the connection relation of the abstract nodes meeting the optimization target information and the mapping relation between the physical resources corresponding to the abstract nodes.
7. A node, wherein the node is a first node; the node comprises: the system comprises a first communication unit and a first processing unit; wherein the content of the first and second substances,
the first communication unit is used for sending a network abstraction request to the second node; the network abstraction request carries optimization target information; obtaining abstract node information from the second node; wherein the abstract node information satisfies the optimization objective 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 of claim 7, wherein the first processing unit is further configured to obtain optimization objective information before the first communication unit sends a network abstraction request to the second node; the optimization objective information includes at least one of the following parameters: minimum hop count, minimum time delay, minimum flash times, 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, where the abstract node information includes at least one group of abstract nodes and a mapping relationship between parameter values; the parameter corresponding to the parameter value comprises at least one of the following parameters: minimum hop count, minimum time delay, minimum flash frequency and load balancing parameters;
the first processing unit is configured to determine, based on the mapping relationship between the at least one group of abstract nodes and the parameter area, routing information that satisfies a condition.
10. A node, wherein the node is a second node; the node comprises: a second communication unit and a second processing unit; wherein the content of the first and second substances,
the second communication unit is used for obtaining 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 determine an abstract node and a corresponding parameter value based on at least one of a minimum hop count, a minimum delay, a minimum number of flash times, and a load balancing parameter included in the optimization target information, and determine 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 a connection relationship of the abstract nodes that satisfy the optimization target information and a mapping relationship between physical resources corresponding to the abstract nodes.
13. A routing information determination system, characterized in that the system comprises a first node and a second node; wherein the content of the first and second substances,
the first node is used for sending a network abstraction request to the second node; the network abstraction request carries optimization target information; the second node is also used for obtaining abstract node information from the second node and determining routing information based on the abstract node information; wherein the abstract node information satisfies the optimization objective information;
the second node is used for obtaining a network abstraction request from the first node; the network abstraction request carries optimization target information; and the first node is also used for determining abstract node information based on the optimization target information and sending the abstract node information to the first node.
14. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 3; alternatively, the program is adapted to carry out the steps of the method of any one of claims 4 to 6 when executed by a processor.
15. A node comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor when executing the program implements the steps of the method of any one of claims 1 to 3; alternatively, the processor, when executing the program, performs the steps of the method of any of claims 4 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811179631.9A CN111030928A (en) | 2018-10-10 | 2018-10-10 | Routing information determination method, node, system and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811179631.9A CN111030928A (en) | 2018-10-10 | 2018-10-10 | Routing information determination method, node, system and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111030928A true CN111030928A (en) | 2020-04-17 |
Family
ID=70191793
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811179631.9A Pending CN111030928A (en) | 2018-10-10 | 2018-10-10 | Routing information determination method, node, system and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111030928A (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1595895A (en) * | 2003-09-10 | 2005-03-16 | 华为技术有限公司 | A routing method based on resource restriction |
| US20070230363A1 (en) * | 2006-03-31 | 2007-10-04 | Buskens Richard W | Methods and devices for computing paths to assure the inter-domain transport of QoS sensitive information |
| CN101753417A (en) * | 2008-12-03 | 2010-06-23 | 华为技术有限公司 | Method for calculating and determining routing, path calculating unit and system for determining routing |
| US20110019674A1 (en) * | 2008-03-28 | 2011-01-27 | Paola Iovanna | End-to-end inter-domain routing |
| CN105264844A (en) * | 2014-04-10 | 2016-01-20 | 华为技术有限公司 | Routing method, apparatus and device in software defined network |
| CN106375214A (en) * | 2016-11-10 | 2017-02-01 | 北京邮电大学 | SDN-based tiered routing path determination method and device |
| CN106850435A (en) * | 2016-12-16 | 2017-06-13 | 北京格林伟迪科技股份有限公司 | A kind of cross-domain end-to-end label exchange route setting method and system |
| CN107332768A (en) * | 2017-06-06 | 2017-11-07 | 烽火通信科技股份有限公司 | A kind of cross-domain path calculation method of multiple domain controller |
| CN107395502A (en) * | 2016-05-17 | 2017-11-24 | 华为技术有限公司 | The method and apparatus for determining routing policy |
| CN107465615A (en) * | 2017-08-03 | 2017-12-12 | 全球能源互联网研究院有限公司 | A kind of route determining methods and controller based on layering multiple domain |
-
2018
- 2018-10-10 CN CN201811179631.9A patent/CN111030928A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1595895A (en) * | 2003-09-10 | 2005-03-16 | 华为技术有限公司 | A routing method based on resource restriction |
| US20070230363A1 (en) * | 2006-03-31 | 2007-10-04 | Buskens Richard W | Methods and devices for computing paths to assure the inter-domain transport of QoS sensitive information |
| US20110019674A1 (en) * | 2008-03-28 | 2011-01-27 | Paola Iovanna | End-to-end inter-domain routing |
| CN101753417A (en) * | 2008-12-03 | 2010-06-23 | 华为技术有限公司 | Method for calculating and determining routing, path calculating unit and system for determining routing |
| CN105264844A (en) * | 2014-04-10 | 2016-01-20 | 华为技术有限公司 | Routing method, apparatus and device in software defined network |
| CN107395502A (en) * | 2016-05-17 | 2017-11-24 | 华为技术有限公司 | The method and apparatus for determining routing policy |
| CN106375214A (en) * | 2016-11-10 | 2017-02-01 | 北京邮电大学 | SDN-based tiered routing path determination method and device |
| CN106850435A (en) * | 2016-12-16 | 2017-06-13 | 北京格林伟迪科技股份有限公司 | A kind of cross-domain end-to-end label exchange route setting method and system |
| CN107332768A (en) * | 2017-06-06 | 2017-11-07 | 烽火通信科技股份有限公司 | A kind of cross-domain path calculation method of multiple domain controller |
| CN107465615A (en) * | 2017-08-03 | 2017-12-12 | 全球能源互联网研究院有限公司 | A kind of route determining methods and controller based on layering multiple domain |
Non-Patent Citations (3)
| Title |
|---|
| 崔阿军等: "一种基于启发式搜索的跨域认证路径构建算法", 《计算机工程》 * |
| 崔雅迪: "面向SDN网络的多控制器协作机制与网络性能优化算法", 《中国优秀硕士学位论文全文数据库》 * |
| 杨建华: "基于启发式多约束最优路径的软件定义网络服务质量路由算法研究", 《中国优秀硕士学位论文全文数据库》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2849064B1 (en) | Method and apparatus for network virtualization | |
| CN109845303B (en) | Management method and management unit for network slices | |
| JP6162194B2 (en) | Chassis controller to convert universal flow | |
| US9461877B1 (en) | Aggregating network resource allocation information and network resource configuration information | |
| CN107566271B (en) | Method and apparatus for computing and propagating network forwarding state using transactions | |
| US20180262436A1 (en) | Chassis controller | |
| US20160352578A1 (en) | System and method for adaptive paths locator for virtual network function links | |
| WO2019042186A1 (en) | Network management method and related device | |
| EP3682597B1 (en) | Modeling access networks as trees in software-defined network controllers | |
| US10250484B2 (en) | Network service computation system | |
| Draxler et al. | Joint optimization of scaling and placement of virtual network services | |
| CN110650037B (en) | Heterogeneous network device configuration method and device | |
| CN107959582A (en) | A kind of management method and device of example of cutting into slices | |
| CN110808857B (en) | Network intercommunication method, device, equipment and storage medium for realizing Kubernetes cluster | |
| CN109964507A (en) | Management method, administrative unit and the system of network function | |
| CN115514696B (en) | Method, device and equipment for transmitting computing power resource information | |
| CN108885564A (en) | Resource in network virtualization scene places control | |
| CN110389711A (en) | Endpoint device is helped to realize method, equipment and the computer program product of SR-IOV function | |
| WO2021078058A1 (en) | Resource scheduling method, apparatus and device, and computer-readable storage medium | |
| US8856342B2 (en) | Efficiently relating adjacent management applications managing a shared infrastructure | |
| CN111030928A (en) | Routing information determination method, node, system and storage medium | |
| WO2017182086A1 (en) | Management of network resources shared by multiple customers | |
| US20230081545A1 (en) | Attribution of user data sources across datasets in a data sharing platform | |
| CN105765903B (en) | A kind of topology discovery method and equipment | |
| US11405284B1 (en) | Generating network link utilization targets using a packet-loss-versus-link utilization model |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200417 |