CN116319531A - Link state routing method and device based on multiple optimal criteria - Google Patents
Link state routing method and device based on multiple optimal criteria Download PDFInfo
- Publication number
- CN116319531A CN116319531A CN202310282654.7A CN202310282654A CN116319531A CN 116319531 A CN116319531 A CN 116319531A CN 202310282654 A CN202310282654 A CN 202310282654A CN 116319531 A CN116319531 A CN 116319531A
- Authority
- CN
- China
- Prior art keywords
- node
- dimensional vector
- router
- vector
- optimal
- 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/24—Multipath
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application relates to a link state routing method and device based on a plurality of optimal criteria, wherein the method comprises the following steps: constructing a network topology global view with a plurality of optimal criterion metric values based on at least one router, and respectively initializing at least one router in the network topology global view; based on the network topology global view, calculating paths from the current node of each router to other nodes after initialization; and extracting the pareto optimal path from the current node of each router in the path to each destination node, thereby improving the efficiency and accuracy of the optimal path acquisition through a plurality of optimal criteria. Therefore, the problems that the traditional routing algorithm cannot calculate the correct route efficiently under the condition of considering multiple indexes, and layering and distributed routing protocols are difficult to realize are solved.
Description
Technical Field
The present disclosure relates to the field of route optimization technologies, and in particular, to a method and an apparatus for routing a link state based on multiple optimization criteria.
Background
The conventional routing algorithm only uses one optimal criterion, such as the shortest distance path, the minimum delay path, the maximum bandwidth path, and the like, when calculating the optimal path, the method cannot adapt to the situation that multiple indexes are required at the same time, but the method of simply synthesizing multiple indexes (measurement values) into one comprehensive index through mathematical operation is difficult to simultaneously meet different requirements of different types of traffic on the path, for example, delay sensitive traffic hopes to use the minimum delay path, and throughput sensitive traffic hopes to use the maximum bandwidth path.
Therefore, the conventional routing algorithm cannot calculate the correct route efficiently under the condition of considering multiple indexes, and is difficult to realize a hierarchical and distributed routing protocol, which is needed to be solved.
Disclosure of Invention
The application provides a link state routing method and device based on a plurality of optimal criteria, which are used for solving the problems that a traditional routing algorithm cannot efficiently calculate correct routes under the condition of considering a plurality of indexes, and layering and distributed routing protocols are difficult to realize.
An embodiment of a first aspect of the present application provides a link state routing method based on a plurality of optimal criteria, including the following steps: constructing a network topology global view with a plurality of optimal criterion metric values based on at least one router, and respectively initializing at least one router in the network topology global view; based on the network topology global view, calculating paths from the current node of each router to other nodes after initialization; and extracting the pareto optimal path from the current node of each router to each destination node in the path, thereby improving the efficiency and accuracy of the optimal path acquisition through a plurality of optimal criteria.
Optionally, in an embodiment of the present application, initializing at least one router in the global view of network topology includes: constructing a first n+2-dimensional vector for each node in the network topology global view, wherein n is a positive integer; establishing n priority queues; and carrying out vector initialization on the first n+2-dimensional vector of the node where each router is located, and adding the vector into each priority queue.
Optionally, in an embodiment of the present application, the calculating, based on the global view of the network topology, the path from the node where each router is currently located to each other node includes: comparing the head elements in each priority queue to search for the optimal head element meeting the preset condition, and deleting the optimal head element from each priority queue; constructing a second n+2-dimensional vector for all adjacent nodes of the node corresponding to the optimal head element; comparing the second n+2-dimensional vector of each adjacent node with at least one first n+2-dimensional vector of the adjacent node one by one based on a preset strategy; if the second n+2-dimensional vector is better than any first n+2-dimensional vector, replacing the first n+2-dimensional vector with the second n+2-dimensional vector, and sequentially adding the first n+2-dimensional vector into each priority queue; if the second n+2-dimensional vector is inferior to any of the first n+2-dimensional vectors, no operation is performed; if the second n+2-dimensional vector is equal to or incomparable with all the first n+2-dimensional vectors, sequentially adding each priority queue; and repeatedly comparing the head elements in each priority queue to search for the optimal head element meeting the preset condition, and deleting the optimal head element from each priority queue until each priority queue is empty.
Optionally, in one embodiment of the present application, the extracting the pareto optimal path from the node where each router is currently located to the respective destination node in the path includes: taking the destination node as a current node, taking the first n+2-dimensional vector corresponding to the destination node as a current vector, and taking out a previous hop node from the current vector; if the previous-hop node is the current node of the router, sequentially connecting the destination node with the previous-hop node, and extracting the path from the current node of the router to the previous-hop node; otherwise, searching an n+2-dimensional vector which can be calculated by combining a link from the previous hop node to the current node in the first n+2-dimensional vector of the previous hop node, taking the n+2-dimensional vector as a new current vector, and taking the previous hop node as the new current node; and repeatedly executing the operation of taking out the previous-hop node from the current vector and extracting the path from the current node to the previous-hop node until all n+2-dimensional vectors of the destination node are accessed.
An embodiment of a second aspect of the present application provides a link state routing device based on a plurality of optimal criteria, including: constructing a network topology global view with a plurality of optimal criterion metric values based on at least one router, and respectively initializing at least one router in the network topology global view; the calculation module is used for calculating the path from the current node of each router to other nodes after initialization based on the network topology global view; the extraction module is used for extracting the pareto optimal path from the current node of each router in the path to each destination node, so that the high efficiency and accuracy of the optimal path acquisition are improved through a plurality of optimal criteria.
Optionally, in one embodiment of the present application, the initialization module includes: a first construction unit, configured to construct a first n+2-dimensional vector for each node in the network topology global view, where n is a positive integer; a queue unit, configured to establish n priority queues; and the enqueuing unit is used for carrying out vector initialization on the first n+2-dimensional vector of the node where each router is located and adding the vector into each priority queue.
Optionally, in one embodiment of the present application, the computing module includes: a first comparing unit, configured to compare the head elements in each priority queue to search for an optimal head element that meets a preset condition, and delete the optimal head element from each priority queue; a second construction unit, configured to construct a second n+2-dimensional vector for all neighboring nodes of the node corresponding to the optimal header element; the second comparison unit is used for comparing the second n+2-dimensional vector of each adjacent node with at least one first n+2-dimensional vector of the adjacent node one by one based on a preset strategy; if the second n+2-dimensional vector is better than any first n+2-dimensional vector, replacing the first n+2-dimensional vector with the second n+2-dimensional vector, and sequentially adding the first n+2-dimensional vector into each priority queue; if the second n+2-dimensional vector is inferior to any of the first n+2-dimensional vectors, no operation is performed; if the second n+2-dimensional vector is equal to or incomparable with all the first n+2-dimensional vectors, sequentially adding each priority queue; and the first repeating unit is used for repeatedly comparing the head elements in each priority queue to search for the optimal head element meeting the preset condition, and deleting the optimal head element from each priority queue until each priority queue is empty.
Optionally, in one embodiment of the present application, the extracting module includes: the processing unit is used for taking the destination node as a current node, taking the first n+2-dimensional vector corresponding to the destination node as a current vector, and taking out a last-hop node from the current vector; the connection unit is used for sequentially connecting the destination node with the previous-hop node if the previous-hop node is the current node of the router, and extracting the path from the current node of the router to the previous-hop node; otherwise, a searching unit is configured to search for an n+2-dimensional vector that can be calculated by combining a link from the previous hop node to the current node in the first n+2-dimensional vector of the previous hop node, and take the n+2-dimensional vector as a new current vector, where the previous hop node is taken as the new current node; and the second repeating unit is used for repeatedly executing the operation of taking out the previous-hop node from the current vector and extracting one path from the current node to the previous-hop node until all n+2-dimensional vectors of the destination node are accessed.
An embodiment of a third aspect of the present application provides an electronic device, including: the system comprises a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor executes the program to implement the link state routing method based on a plurality of optimal criteria as described in the above embodiments.
A fourth aspect of the present application provides a computer readable storage medium storing a computer program which, when executed by a processor, implements a link state routing method based on a plurality of optimization criteria as above.
Thus, embodiments of the present application have the following benefits:
according to the embodiment of the application, the network topology global view with a plurality of optimal criterion metric values can be constructed based on at least one router, and at least one router in the network topology global view is initialized respectively; based on the network topology global view, calculating paths from the current node of each router to other nodes after initialization; and extracting the pareto optimal path from the current node of each router in the path to each destination node, thereby improving the efficiency and accuracy of the optimal path acquisition through a plurality of optimal criteria. According to the method and the device, a routing algorithm using a plurality of optimal criteria is provided on the basis of the existing link state routing protocol and algorithm, so that pareto paths under all given optimal criteria can be calculated, namely, no other paths are better than the paths, and the high efficiency and the accuracy of the routing algorithm are ensured while the optimal criteria are considered. Therefore, the problems that the traditional routing algorithm cannot calculate the correct route efficiently under the condition of considering multiple indexes, and layering and distributed routing protocols are difficult to realize are solved.
Additional aspects and advantages of the application will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the application.
Drawings
The foregoing and/or additional aspects and advantages of the present application will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings, in which:
fig. 1 is a flowchart of a link state routing method based on a plurality of optimization criteria according to an embodiment of the present application;
FIG. 2 is a global view of a network topology provided by an embodiment of the present application;
FIG. 3 is an example diagram of a link state routing device based on multiple optimization criteria in accordance with an embodiment of the present application;
fig. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Wherein 10-a link state routing device based on a plurality of optimization criteria, 100-an initialization module, 200-a calculation module, 300-an extraction module, 401-a memory, 402-a processor, 403-a communication interface.
Detailed Description
Embodiments of the present application are described in detail below, examples of which are illustrated in the accompanying drawings, wherein the same or similar reference numerals refer to the same or similar elements or elements having the same or similar functions throughout. The embodiments described below by referring to the drawings are exemplary and intended for the purpose of explaining the present application and are not to be construed as limiting the present application.
The following describes a link state routing method and device based on a plurality of optimal criteria according to an embodiment of the present application with reference to the accompanying drawings. In view of the above-mentioned problems in the background art, the present application provides a link state routing method based on a plurality of optimal criteria, in which, based on at least one router, a network topology global view with a plurality of optimal criteria metric values is constructed, and at least one router in the network topology global view is initialized respectively; based on the network topology global view, calculating paths from the current node of each router to other nodes after initialization; and extracting the pareto optimal path from the current node of each router in the path to each destination node, thereby improving the efficiency and accuracy of the optimal path acquisition through a plurality of optimal criteria. According to the method and the device, based on the existing link state routing protocol and algorithm (such as OSPF), a routing algorithm using a plurality of optimal criteria is provided, so that pareto paths under all given optimal criteria can be calculated, namely, no other paths are better than the paths, and the high efficiency and the accuracy of the routing algorithm are ensured while the optimal criteria are considered. Therefore, the problems that the traditional routing algorithm cannot calculate the correct route efficiently under the condition of considering multiple indexes, and layering and distributed routing protocols are difficult to realize are solved.
Specifically, fig. 1 is a flowchart of a link state routing method based on a plurality of optimization criteria according to an embodiment of the present application.
As shown in fig. 1, the link state routing method based on the multiple optimal criteria includes the following steps:
in step S101, a global view of the network topology with a plurality of optimal criterion metric values is constructed based on at least one router, and at least one router in the global view of the network topology is initialized respectively.
The embodiment of the application can firstly construct a network topology global view with a plurality of metric values for each router in the current network, and the specific steps are as follows:
1. each router generates state information of a link directly connected with the router. Let the link from router node u to v be (u, v) and its link state information contains a vector of metrics defined as an n-dimensional vector l (u, v) = (a) 1 ,a 2 ,a 3 ,…,a n ) Wherein a is k A kth metric value representing the link;
2. based on the existing link state protocol, each router performs neighbor discovery and link state information flooding, and maintains a consistent link state database, thereby constructing a network topology global view with a plurality of metric values.
Therefore, in the embodiment of the application, in the process of establishing the global view of the network topology, indexes under a plurality of optimal criteria are all put into the link state information, so that the global view of the network topology is established, the optimal criteria are considered, the optimal criteria are used as the input of path calculation, and the performance of a routing algorithm is ensured.
Optionally, in one embodiment of the present application, initializing at least one router in the global view of the network topology includes: constructing a first n+2-dimensional vector for each node in the network topology global view, wherein n is a positive integer; establishing n priority queues; and initializing the first n+2-dimensional vector of the node where each router is located, and adding the vector into each priority queue.
It should be noted that, after the network topology global view is constructed, each router in the network topology global view needs to prepare and initialize path computation respectively, and the specific steps are as follows:
1. establishing an n+2-dimensional vector f for each node r in the global view of the network topology r ＝(a 1 ,a 2 ,a 3 ,…,a n P, r) to represent the current optimal metric vector (a) 1 ,a 2 ,a 3 ,…,a n ) The metric corresponds to a path from s to node r, where the last hop node of r is p; for any node r, a that is not equal to s k The initial value is the worst value that the kth metric can take (e.g., if the metric is path length, a k The value is positive infinity (+infinity); if the metric is path bandwidth, a k Take a value of 0, etc.), the initial value of p is null;
2. Establishing n priority queues Q 1 、Q 2 、…、Q n Wherein the elements are n+2-dimensional vectors (a 1 ,a 2 ,a 3 ,…,a n P, r); the element in the kth priority queue is according to the illumination magnitude value a k The values of (2) are arranged in good order, i.e. in Q k The elements of the header always being of the ratio Q k Other elements in (a) have better a k Value of other measure a j (j. Noteq. K) at Q k Is not considered;
3. initializing an n+2-dimensional vector of a node s to x s ＝(a 1 ,a 2 ,a 3 ,…,a n S, s), wherein a k For the optimal value that the kth metric can take, x is taken as s Joining each priority queue Q 1 、Q 2 、…、Q n 。
Therefore, the embodiment of the application respectively initializes each router in the network topology global view, thereby providing reliable data basis for subsequent path calculation.
In step S102, based on the global view of the network topology, a path from the current node of each router after initialization to each other node is calculated.
After the network topology global view is constructed and the routers in the network topology global view are respectively initialized, further, the embodiment of the application also needs to calculate and acquire the path from the current node of each initialized router to other nodes.
Optionally, in one embodiment of the present application, calculating, based on the global view of the network topology, a path from a node where each router is currently located to other nodes includes: comparing the head elements in each priority queue to search for the optimal head element meeting the preset condition, and deleting the optimal head element from each priority queue; constructing a second n+2-dimensional vector for all adjacent nodes of the node corresponding to the optimal head element; comparing the second n+2-dimensional vector of each adjacent node with at least one first n+2-dimensional vector of the adjacent node one by one based on a preset strategy; if the second n+2-dimensional vector is better than any first n+2-dimensional vector, replacing the first n+2-dimensional vector with the second n+2-dimensional vector, and sequentially adding each priority queue; if the second n+2-dimensional vector is inferior to any first n+2-dimensional vector, no operation is performed; if the second n+2-dimensional vector is equal to or incomparable with all the first n+2-dimensional vectors, sequentially adding each priority queue; and repeatedly comparing the head elements in each priority queue to search for the optimal head element meeting the preset condition, and deleting the optimal head element from each priority queue until each priority queue is empty.
In the embodiment of the present application, the specific steps of each router calculating the path from the present node s to each other node in the network are as follows:
1. compare and rank in priority queue Q 1 、Q 2 、…、Q n Find an element f satisfying no worse than any other element placed at the head of the priority queue u Element x of (2) v Wherein x is v ＝(a 1 ,a 2 ,a 3 ,…,a n P, v) is not inferior to x u ＝(a' 1 ,a' 2 ,a' 3 ,…,a' n P', u) means that at least one k is present, such that a k Is better than a' k And from Q 1 、Q 2 、…、Q n Delete x in v ；
2. Known f v ＝(a 1 ,a 2 ,a 3 ,…,a n P, v), the adjacent node u to node v satisfies u+.p, knowing l (u, v) = (b) 1 ,b 2 ,b 3 ,…,b n ) Construct n+2-dimensional vector g u ＝(a 1 ⊕ 1 b 1 ,a 2 ⊕ 2 b 2 ,a 3 ⊕ 3 b 3 ,…,a n ⊕ n b n V, u), wherein the operator ∈ k Representing the combination of two values of the kth metric, the specific method of operation is determined by the type of metric, e.g. a if the metric is path length k ⊕ k b k Is a as k +b k If the metric is bandwidth, a k ⊕ k b k For min (a) k ,b k ) Etc.;
3. will g u N+2-dimensional vector f existing with node u u One by one comparison (there may be multiple f u ): if there is a certain f u Better than g u No operation is performed; if g u Better than a certain f u Then use g u Substitute for f u And g is to u Sequentially adding Q 1 、Q 2 、…、Q n In (a) and (b); if g u Not inferior to all f u Will g u New n+2-dimensional vector as node u and will g u Sequentially adding Q 1 、Q 2 、…、Q n The method comprises the steps of carrying out a first treatment on the surface of the Wherein (a) 1 ,a 2 ,a 3 ,…,a n P, u) is better than (a' 1 ,a' 2 ,a' 3 ,…,a' n P', u) means that for all k there is a k Is better than a' k 。
4. Repeating the step 2 and the step 3 until all neighbor nodes of the node v are accessed;
5. repeating steps 1-4 until queue Q 1 、Q 2 、…、Q n All are empty.
Therefore, the embodiment of the application calculates the paths from the node to other nodes through each router respectively, so that the link state routing protocol realizes the layering and distributed routing protocol by enabling each router to calculate the respective optimal paths independently.
In step S103, pareto optimal paths from the current node of each router in the paths to each destination node are extracted, so that the efficiency and accuracy of optimal path acquisition are improved through a plurality of optimal criteria.
After each router obtains the path from the node to other nodes in the global view of the network topology, further, the embodiment of the application can extract the pareto optimal path from the current node of each router in the path to each destination node.
Optionally, in one embodiment of the present application, extracting a pareto optimal path from a node where each router is currently located in the path to each destination node includes: taking the destination node as a current node, taking a first n+2-dimensional vector corresponding to the destination node as a current vector, and taking out a previous hop node from the current vector; if the previous hop node is the current node of the router, sequentially connecting the destination node with the previous hop node, and extracting a path from the current node of the router to the previous hop node; otherwise, searching a link combining the previous-hop node to the current node in the first n+2-dimensional vector of the previous-hop node to calculate an n+2-dimensional vector of the current vector, and taking the n+2-dimensional vector as a new current vector, wherein the previous-hop node is taken as the new current node; and repeatedly executing the operation of taking out the previous-hop node from the current vector and extracting a path from the current node to the previous-hop node until all n+2-dimensional vectors of the destination node are accessed.
In the embodiment of the present application, for each destination node u in the global view of the network topology, the specific steps of extracting the pareto optimal path from s to u are as follows:
1. taking the node u as a current node, and taking an n+2-dimensional vector of the node u as a current vector;
2. the last hop node is taken out from the current vector;
3. if the previous hop node is the node s, the destination node is connected with the previous hop node obtained before in sequence, and a path from s to u is extracted;
4. otherwise, searching in the n+2-dimensional vector of the previous hop node, finding an n+2-dimensional vector in the n+2-dimensional vector, so that the current vector can be calculated by utilizing the vector and a link from the previous hop node to the current node, taking the n+2-dimensional vector of the previous hop node as a new current vector, taking the previous hop node as the new current node, and repeating the steps 2 to 4;
5. steps 1 to 4 are repeated until all n+2-dimensional vectors of node u have been accessed.
Thus, embodiments of the present application ensure that the correct route can be calculated in an efficient manner in the event that multiple metrics are required to be compromised by calculating the pareto optimal path from the current node to each destination node in the network.
The following application will further illustrate and describe, in connection with the accompanying drawings, a link state routing method according to the present application based on a plurality of optimization criteria.
In a specific embodiment of the present application, the global view of the network topology includes 4 nodes u, v, w, x, where the bandwidth of the link (x, w) is 20, the delay is 3, the bandwidth of the link (x, v) is 10, the delay is 2, the bandwidths of the link (u, v) and the link (v, u) are both 20, the delay is 4, the bandwidth of the link (w, u) is 5, the delay is 1, the bandwidth of the link (v, u) is 10, the delay is 3, as shown in fig. 2, the two-dimensional vector of the metric values of each link is represented by the two-dimensional vector of the metric values in the figure, and for the path to be calculated, the metric value vector includes two metric values of the bandwidth and the delay, wherein the greater the better the bandwidth, the smaller the better the delay, so in the specific embodiment of the present application, n=2.
The link state routing method of the specific embodiment of the present application using a plurality of optimization criteria calculates the path from x to u as follows:
1) Establishing initial 4-dimensional vectors of all nodes except the source node x, wherein the initial 4-dimensional vectors are (0, + -infinity, -, w), (0, + -infinity, -, v), (0, + -infinity, -, u);
2) Establishing two priority queues Q 1 、Q 2 ，Q 1 The elements in (a) are ordered from big to small according to the 1 st metric value (bandwidth), Q 2 The elements in (a) are ordered from small to large according to the 2 nd metric value (time delay);
3) Initializing 4-dimensional vector (+infinity, 0, x) of node x, adding it to Q respectively 1 、Q 2 At this time Q 1 And Q 2 Only one element (+infinity, 0, -, x);
4) Priority queue Q 1 And Q 2 The head elements of (a) are all (+ infinity, 0, x), (+ -. Infinity, 0, x) no worse than (+ infinity, 0, x), and (+ infinity, 0, x) are taken out and taken from Q 1 And Q 2 The current node is x;
(4.1) considering the neighbor node w reachable from x through the link (x, w), knowing l (x, w) = (20, 1), constructing a vector (min (+infinity, 20), 0+1, x, w) = (20, 1, x, w) which is better than the existing vector of w (0, + -infinity, -, w), thus updating (0, + -infinity, -, w) to (20, 1, x, w) and adding it to Q 1 And Q 2 ；
(4.2) taking into account the neighbor nodes v reachable from x via the link (x, v), knowing l (x, v) = (10, 2), constructing a vector (min (+infinity, 10), 0+2, x, v) = (10, 2, x, v) which is superior to v existing vector (0, + -infinity, -, v), thus updating (0, + -infinity, -, v) to (10, 2, x, v) and adding it to Q 1 And Q 2 ；
At this time Q 1 The elements in the method are (20, 1, x, w), (10, 2, x, v) in sequence from high to low according to the priority;
at this time Q 2 The elements in the list are (20, 1, x, w), (10, 2, x, v) in sequence from high to low according to the priority.
5) Priority queue Q 1 And Q 2 The head elements of (1, x, w), (20, 1, x, w) are not inferior to (20, 1, x, w), and (20, 1, x, w) is taken out and taken out of Q 1 And Q 2 Is deleted whenThe front node is w;
(5.1) considering neighbor node v reachable from w through link (w, v), known l (w, v) = (20, 4), constructing vector (min (20, 20), 1+4, w, v) = (20, 5, w, v) which is not inferior to all vectors (10, 2, x, v) existing for v, thus taking (20, 5, w, v) as new vector for node v and adding it to Q 1 And Q 2 ；
(5.2) considering neighbor node u reachable from w through link (w, u), knowing l (w, u) = (5, 1), constructing vector (min (20, 5), 1+1, w, u) = (5, 2, w, u), the vector is superior to the existing vector of u (0, + -infinity, -, u), so (0, + -infinity, -, u) is updated to (5, 2, w, u) and added to Q 1 And Q 2 ；
At this time Q 1 The elements in the list are (20, 5, w, v), (10, 2, x, v), (5, 2, w, u) in sequence from high to low according to the priority;
at this time Q 2 The elements in the list are (10, 2, x, v), (5, 2, w, u), (20, 5, w, v) in order from high to low.
6) Priority queue Q 1 And Q 2 The head elements of (20, 5, w, v) and (10, 2, x, v), (20, 5, w, v) are not inferior to (10, 2, x, v), and (20, 5, w, v) is taken out and taken out of Q 1 And Q 2 The current node is v;
(6.1) node w is the last hop node of v in (20, 5, w, v) and is therefore not considered;
(6.2) considering neighbor node u reachable from v through link (v, u), knowing l (v, u) = (10, 3), constructing vector (min (20, 10), 5+3, v, u) = (10, 8, v, u), which is not inferior to all vectors (5, 2, w, u) existing for u, thus taking (10, 8, v, u) as new vector for node u and adding it to Q 1 And Q 2 ；
At this time Q 1 The elements in the list are (10, 2, x, v), (10, 8, v, u), (5, 2, w, u) in sequence from high to low according to the priority;
at this time Q 2 The elements in the list are (10, 2, x, v), (5, 2, w, u), (10, 8, v, u) in order from high to low.
7) Priority queue Q 1 And Q 2 The head elements of (1) are (10, 2, x, v), (10, 2, x, v) not inferior to (10, 2, x, v), and (10, 2, x, v) is taken out and taken out of Q 1 And Q 2 The current node is v;
(7.1) considering the neighbor node w reachable from v through the link (v, w), knowing l (v, w) = (20, 4), constructing a vector (min (10, 20), 2+4, v, w) = (10, 6, v, w), the vector (20, 1, x, w) existing in w being superior to the vector, and thus doing nothing;
(7.2) considering neighbor node u reachable from v through link (v, u), knowing l (v, u) = (10, 3), constructing vector (min (10, 10), 2+3, v, u) = (10, 5, v, u), which is superior to u existing vector (10, 8, v, u), thus updating (10, 8, v, u) to (10, 5, v, u) and adding it to Q 1 And Q 2 ；
At this time Q 1 The elements in the list are (10, 5, v, u), (10, 8, v, u), (5, 2, w, u) in sequence from high to low according to the priority;
at this time Q 2 The elements in the list are (5, 2, w, u), (10, 5, v, u), (10, 8, v, u) in order from high to low.
8) Priority queue Q 1 And Q 2 The head elements of (10, 5, v, u) and (5, 2, w, u), (10, 5, v, u) are not inferior to (5, 2, w, u), respectively, (10, 5, v, u) is taken out and Q is taken out 1 And Q 2 The current node is u;
(8.1) u node has no adjacent node and does no operation;
at this time Q 1 The elements in the method are (10, 8, v, u), (5, 2, w, u) in sequence from high to low according to the priority;
at this time Q 2 The elements in the list are (5, 2, w, u), (10, 8, v, u) in order from high to low according to the priority.
9) Priority queue Q 1 And Q 2 The head elements of (10, 8, v, u) and (5, 2, w, u), (10, 8, v, u) are not inferior to (5, 2, w, u), respectively, (10, 8, v, u) is taken out and Q is taken out 1 And Q 2 The current node is u;
(9.1) u node has no adjacent node and does no operation;
at this time Q 1 The elements in the rule are (5, 2, w, u) in sequence from high to low according to the priority;
at this time Q 2 The elements in the list are (5, 2, w, u) in sequence from high to low according to the priority.
10 Priority queue Q) 1 And Q 2 The head elements of (5, 2, w, u), (5, 2, w, u) are not inferior to (5, 2, w, u), and (5, 2, w, u) is taken out and taken out of Q 1 And Q 2 The current node is u;
(10.1) u node has no adjacent node and does no operation;
at this time Q 1 And Q 2 All are empty.
11)Q 1 And Q 2 All empty and begin to extract the path from x to destination node u. At this time u has two vectors: (10, 5, v, u) and (5, 2, w, u);
12 Extracting a path from x to a destination node u from (10, 5, v, u) as follows:
(12.1) take the last hop node v from (10, 5, v, u) with two vectors (10, 2, x, v) and (20, 5, w, v), since (min (10, 10), 2+3, v, u) = (10, 5, v, u) is available from (10, 2, x, v) and l (v, u) = (10, 3), so (10, 2, x, v) is taken as the new current vector, v is taken as the new current node;
(12.2) taking the last hop node x from (10, 2, x, v), x being the source node, this results in a path from x to u: x-v-u.
13 Extracting a path from x to a destination node u from (5, 2, w, u) as follows:
(13.1) taking the last hop node w from (5, 2, w, u) and taking (20, 1, x, w) as the new current vector, and taking (20, 1, x, w) as the new current node since (min (20, 5), 1+1, w, u) = (5, 2, w, u) is obtained from (20, 1, x, w) and l (w, u) = (5, 1);
(13.2) taking the last hop node x from (20, 1, x, w), x being the source node, this results in a path from x to u: x-w-u.
(14) And after the two vectors of u are accessed, the execution of the link state routing method based on a plurality of optimal criteria is finished, and the final output is two paths: x-v-u, x-w-u.
According to the link state routing method based on the multiple optimal criteria, which is provided by the embodiment of the application, a network topology global view with multiple optimal criterion metric values is constructed based on at least one router, and at least one router in the network topology global view is initialized respectively; based on the network topology global view, calculating paths from the current node of each router to other nodes after initialization; and extracting the pareto optimal path from the current node of each router in the path to each destination node, thereby improving the efficiency and accuracy of the optimal path acquisition through a plurality of optimal criteria. According to the method and the device, a routing algorithm using a plurality of optimal criteria is provided on the basis of the existing link state routing protocol and algorithm, so that pareto paths under all given optimal criteria can be calculated, namely, no other paths are better than the paths, and the high efficiency and the accuracy of the routing algorithm are ensured while the optimal criteria are considered.
Next, a link state routing device based on a plurality of optimal criteria according to an embodiment of the present application will be described with reference to the accompanying drawings.
Fig. 3 is a block diagram of a link state routing device based on multiple optimization criteria in accordance with an embodiment of the present application.
As shown in fig. 3, the link state routing device 10 based on a plurality of optimization criteria includes: initialization module 100, calculation module 200, and extraction module 300.
The initialization module 100 is configured to construct a global view of a network topology with a plurality of optimal criterion metric values based on at least one router, and initialize at least one router in the global view of the network topology respectively.
The calculation module 200 is configured to calculate, based on the network topology global view, a path from a current node of each router after initialization to each other node.
The extracting module 300 is configured to extract pareto optimal paths from the current node of each router in the paths to each destination node, so that the efficiency and accuracy of obtaining the optimal paths are improved through multiple optimal criteria.
Optionally, in one embodiment of the present application, the initialization module 100 includes: the system comprises a first construction unit, a queue unit and an enqueuing unit.
The first construction unit is configured to construct a first n+2-dimensional vector for each node in the global view of the network topology, where n is a positive integer.
And the queue unit is used for establishing n priority queues.
And the enqueuing unit is used for carrying out vector initialization on the first n+2-dimensional vector of the node where each router is located, and adding the vector into each priority queue.
Optionally, in one embodiment of the present application, the computing module 200 includes: the first comparing unit, the second constructing unit, the second comparing unit and the first repeating unit.
The first comparison unit is used for comparing the head elements in each priority queue to search for the optimal head element meeting the preset condition, and deleting the optimal head element from each priority queue.
And the second construction unit is used for constructing a second n+2-dimensional vector for all adjacent nodes of the node corresponding to the optimal head element.
The second comparison unit is used for comparing the second n+2-dimensional vector of each adjacent node with at least one first n+2-dimensional vector of the adjacent node one by one based on a preset strategy; if the second n+2-dimensional vector is better than any first n+2-dimensional vector, replacing the first n+2-dimensional vector with the second n+2-dimensional vector, and sequentially adding each priority queue; if the second n+2-dimensional vector is inferior to any first n+2-dimensional vector, no operation is performed; if the second n+2-dimensional vector is equal to or incomparable with all the first n+2-dimensional vectors, each priority queue is added in turn.
And the first repeating unit is used for repeatedly comparing the head elements in each priority queue to search for the optimal head element meeting the preset condition, and deleting the optimal head element from each priority queue until each priority queue is empty.
Optionally, in one embodiment of the present application, the extraction module 300 includes: a processing unit, a connection unit, a search unit and a second repetition unit.
The processing unit is used for taking the destination node as a current node, taking a first n+2-dimensional vector corresponding to the destination node as the current vector, and taking out the last hop node from the current vector.
And the connection unit is used for sequentially connecting the destination node with the previous-hop node if the previous-hop node is the current node of the router and extracting a path from the current node of the router to the previous-hop node. Otherwise the first set of parameters is selected,
the searching unit is used for searching a link combining the previous-hop node to the current node in the first n+2-dimensional vector of the previous-hop node to calculate an n+2-dimensional vector of the current vector, taking the n+2-dimensional vector as a new current vector and taking the previous-hop node as the new current node.
And the second repeating unit is used for repeatedly executing the operation of taking out the previous-hop node from the current vector and extracting a path from the current node to the previous-hop node until all n+2-dimensional vectors of the destination node are accessed.
It should be noted that the foregoing explanation of the embodiment of the link state routing method based on the multiple optimal criteria is also applicable to the link state routing device based on the multiple optimal criteria of this embodiment, and will not be repeated herein.
According to the link state routing device based on the optimal criteria, a network topology global view with the optimal criteria metric values is constructed based on at least one router, and at least one router in the network topology global view is initialized respectively; based on the network topology global view, calculating paths from the current node of each router to other nodes after initialization; and extracting the pareto optimal path from the current node of each router in the path to each destination node, thereby improving the efficiency and accuracy of the optimal path acquisition through a plurality of optimal criteria. According to the method and the device, a routing algorithm using a plurality of optimal criteria is provided on the basis of the existing link state routing protocol and algorithm, so that pareto paths under all given optimal criteria can be calculated, namely, no other paths are better than the paths, and the high efficiency and the accuracy of the routing algorithm are ensured while the optimal criteria are considered.
Fig. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present application. The electronic device may include:
The processor 402, when executing the program, implements the link state routing method based on a plurality of optimization criteria provided in the above-described embodiments.
Further, the electronic device further includes:
a communication interface 403 for communication between the memory 401 and the processor 402.
A memory 401 for storing a computer program executable on the processor 402.
If the memory 401, the processor 402, and the communication interface 403 are implemented independently, the communication interface 403, the memory 401, and the processor 402 may be connected to each other by a bus and perform communication with each other. The bus may be an industry standard architecture (Industry Standard Architecture, abbreviated ISA) bus, an external device interconnect (Peripheral Component, abbreviated PCI) bus, or an extended industry standard architecture (Extended Industry Standard Architecture, abbreviated EISA) bus, among others. The buses may be divided into address buses, data buses, control buses, etc. For ease of illustration, only one thick line is shown in fig. 4, but not only one bus or one type of bus.
Alternatively, in a specific implementation, if the memory 401, the processor 402, and the communication interface 403 are integrated on a chip, the memory 401, the processor 402, and the communication interface 403 may complete communication with each other through internal interfaces.
The processor 402 may be a central processing unit (Central Processing Unit, abbreviated as CPU), or an application specific integrated circuit (Application Specific Integrated Circuit, abbreviated as ASIC), or one or more integrated circuits configured to implement embodiments of the present application.
The embodiments of the present application also provide a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements a link state routing method based on a plurality of optimization criteria as above.
In the description of the present specification, a description referring to terms "one embodiment," "some embodiments," "examples," "specific examples," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present application. In this specification, schematic representations of the above terms are not necessarily directed to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or N embodiments or examples. Furthermore, the different embodiments or examples described in this specification and the features of the different embodiments or examples may be combined and combined by those skilled in the art without contradiction.
Furthermore, the terms "first," "second," and the like, are used for descriptive purposes only and are not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include at least one such feature. In the description of the present application, the meaning of "N" is at least two, such as two, three, etc., unless explicitly defined otherwise.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and additional implementations are included within the scope of the preferred embodiment of the present application in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order from that shown or discussed, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the embodiments of the present application.
Logic and/or steps represented in the flowcharts or otherwise described herein, e.g., a ordered listing of executable instructions for implementing logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or N wires, a portable computer cartridge (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). In addition, the computer readable medium may even be paper or other suitable medium on which the program is printed, as the program may be electronically captured, via optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner if necessary, and then stored in a computer memory.
It is to be understood that portions of the present application may be implemented in hardware, software, firmware, or a combination thereof. In the above-described embodiments, the N steps or methods may be implemented in software or firmware stored in a memory and executed by a suitable instruction execution system. If implemented in hardware, as in another embodiment, may be implemented using any one or combination of the following techniques, as known in the art: discrete logic circuits having logic gates for implementing logic functions on data signals, application specific integrated circuits having suitable combinational logic gates, programmable Gate Arrays (PGAs), field Programmable Gate Arrays (FPGAs), and the like.
Those of ordinary skill in the art will appreciate that all or a portion of the steps carried out in the method of the above-described embodiments may be implemented by a program to instruct related hardware, where the program may be stored in a computer readable storage medium, and where the program, when executed, includes one or a combination of the steps of the method embodiments.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing module, or each unit may exist alone physically, or two or more units may be integrated in one module. The integrated modules may be implemented in hardware or in software functional modules. The integrated modules may also be stored in a computer readable storage medium if implemented in the form of software functional modules and sold or used as a stand-alone product.
The above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, or the like. Although embodiments of the present application have been shown and described above, it will be understood that the above embodiments are illustrative and not to be construed as limiting the application, and that variations, modifications, alternatives, and variations may be made to the above embodiments by one of ordinary skill in the art within the scope of the application.
Claims (10)
1. A link state routing method based on a plurality of optimization criteria, comprising the steps of:
constructing a network topology global view with a plurality of optimal criterion metric values based on at least one router, and respectively initializing at least one router in the network topology global view;
based on the network topology global view, calculating paths from the current node of each router to other nodes after initialization;
and extracting the pareto optimal path from the current node of each router to each destination node in the path, thereby improving the efficiency and accuracy of the optimal path acquisition through a plurality of optimal criteria.
2. The method of claim 1, wherein initializing at least one router in the global view of the network topology comprises:
Constructing a first n+2-dimensional vector for each node in the network topology global view, wherein n is a positive integer;
establishing n priority queues;
and carrying out vector initialization on the first n+2-dimensional vector of the node where each router is located, and adding the vector into each priority queue.
3. The method of claim 2, wherein the calculating the path of the current node of each router to other nodes based on the global view of the network topology comprises:
comparing the head elements in each priority queue to search for the optimal head element meeting the preset condition, and deleting the optimal head element from each priority queue;
constructing a second n+2-dimensional vector for all adjacent nodes of the node corresponding to the optimal head element;
comparing the second n+2-dimensional vector of each adjacent node with at least one first n+2-dimensional vector of the adjacent node one by one based on a preset strategy; if the second n+2-dimensional vector is better than any first n+2-dimensional vector, replacing the first n+2-dimensional vector with the second n+2-dimensional vector, and sequentially adding the first n+2-dimensional vector into each priority queue; if the second n+2-dimensional vector is inferior to any of the first n+2-dimensional vectors, no operation is performed; if the second n+2-dimensional vector is equal to or incomparable with all the first n+2-dimensional vectors, sequentially adding each priority queue;
And repeatedly comparing the head elements in each priority queue to search for the optimal head element meeting the preset condition, and deleting the optimal head element from each priority queue until each priority queue is empty.
4. A method according to claim 3, wherein said extracting the pareto optimal path from the node in the path where each router is currently located to the respective destination node comprises:
taking the destination node as a current node, taking the first n+2-dimensional vector corresponding to the destination node as a current vector, and taking out a previous hop node from the current vector;
if the previous-hop node is the current node of the router, sequentially connecting the destination node with the previous-hop node, and extracting the path from the current node of the router to the previous-hop node; otherwise the first set of parameters is selected,
searching an n+2-dimensional vector which can be calculated by combining a link from the previous hop node to the current node in the first n+2-dimensional vector of the previous hop node, taking the n+2-dimensional vector as a new current vector, and taking the previous hop node as the new current node;
And repeatedly executing the operation of taking out the previous-hop node from the current vector and extracting the path from the current node to the previous-hop node until all n+2-dimensional vectors of the destination node are accessed.
5. A link state routing apparatus based on a plurality of optimization criteria, comprising:
the initialization module is used for constructing a network topology global view with a plurality of optimal criterion metric values based on at least one router, and initializing at least one router in the network topology global view respectively;
the calculation module is used for calculating the path from the current node of each router to other nodes after initialization based on the network topology global view;
the extraction module is used for extracting the pareto optimal path from the current node of each router in the path to each destination node, so that the high efficiency and accuracy of the optimal path acquisition are improved through a plurality of optimal criteria.
6. The apparatus of claim 5, wherein the initialization module comprises:
a first construction unit, configured to construct a first n+2-dimensional vector for each node in the network topology global view, where n is a positive integer;
A queue unit, configured to establish n priority queues;
and the enqueuing unit is used for carrying out vector initialization on the first n+2-dimensional vector of the node where each router is located and adding the vector into each priority queue.
7. The apparatus of claim 6, wherein the computing module comprises:
a first comparing unit, configured to compare the head elements in each priority queue to search for an optimal head element that meets a preset condition, and delete the optimal head element from each priority queue;
a second construction unit, configured to construct a second n+2-dimensional vector for all neighboring nodes of the node corresponding to the optimal header element;
the second comparison unit is used for comparing the second n+2-dimensional vector of each adjacent node with at least one first n+2-dimensional vector of the adjacent node one by one based on a preset strategy; if the second n+2-dimensional vector is better than any first n+2-dimensional vector, replacing the first n+2-dimensional vector with the second n+2-dimensional vector, and sequentially adding the first n+2-dimensional vector into each priority queue; if the second n+2-dimensional vector is inferior to any of the first n+2-dimensional vectors, no operation is performed; if the second n+2-dimensional vector is equal to or incomparable with all the first n+2-dimensional vectors, sequentially adding each priority queue;
And the first repeating unit is used for repeatedly comparing the head elements in each priority queue to search for the optimal head element meeting the preset condition, and deleting the optimal head element from each priority queue until each priority queue is empty.
8. The apparatus of claim 7, wherein the extraction module comprises:
the processing unit is used for taking the destination node as a current node, taking the first n+2-dimensional vector corresponding to the destination node as a current vector, and taking out a last-hop node from the current vector;
the connection unit is used for sequentially connecting the destination node with the previous-hop node if the previous-hop node is the current node of the router, and extracting the path from the current node of the router to the previous-hop node; otherwise the first set of parameters is selected,
a searching unit, configured to search, in the first n+2-dimensional vector of the previous hop node, for an n+2-dimensional vector that can be calculated by combining a link from the previous hop node to the current node, and take the n+2-dimensional vector as a new current vector, where the previous hop node is taken as a new current node;
And the second repeating unit is used for repeatedly executing the operation of taking out the previous-hop node from the current vector and extracting one path from the current node to the previous-hop node until all n+2-dimensional vectors of the destination node are accessed.
9. An electronic device, comprising: a memory, a processor and a computer program stored on the memory and executable on the processor, the processor executing the program to implement the link state routing method based on a plurality of optimization criteria of any of claims 1-4.
10. A computer readable storage medium having stored thereon a computer program, wherein the program is to be executed by a processor for implementing a link state routing method based on a plurality of optimization criteria according to any of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310282654.7A CN116319531A (en) | 2023-03-22 | 2023-03-22 | Link state routing method and device based on multiple optimal criteria |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310282654.7A CN116319531A (en) | 2023-03-22 | 2023-03-22 | Link state routing method and device based on multiple optimal criteria |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116319531A true CN116319531A (en) | 2023-06-23 |
Family
ID=86814713
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310282654.7A Pending CN116319531A (en) | 2023-03-22 | 2023-03-22 | Link state routing method and device based on multiple optimal criteria |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116319531A (en) |
-
2023
- 2023-03-22 CN CN202310282654.7A patent/CN116319531A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR100544008B1 (en) | Costs in data networks | |
| US7561534B2 (en) | Methods of network routing having improved resistance to faults affecting groups of links subject to common risks | |
| Bell | Alternatives to Dial's logit assignment algorithm | |
| US10404576B2 (en) | Constrained shortest path determination in a network | |
| US20140269422A1 (en) | Encoding Explicit Paths As Segment Routing Segment Lists | |
| US20030227877A1 (en) | Routing restorable service-level-guaranteed connections using maximum 2-route flows | |
| US10560367B2 (en) | Bidirectional constrained path search | |
| US10880178B2 (en) | Automatic assignment of coordinates to network elements interconnected in a cartesian topology | |
| US5577030A (en) | Data communication routing method and device | |
| WO2017136186A1 (en) | Mutually compatible path search | |
| CN110661704B (en) | Calculation method of forwarding path and SDN controller | |
| EP3515018B1 (en) | Method, apparatus and system for measuring network path | |
| EP3278520B1 (en) | Distributed routing table system with improved support for multiple network topologies | |
| CN108347377B (en) | Data forwarding method and device | |
| CN110912816B (en) | Link rerouting method, device and storage medium | |
| CN116319531A (en) | Link state routing method and device based on multiple optimal criteria | |
| J# x00F3; zsa et al. | An efficient algorithm for global path optimization in MPLS networks | |
| CN111970586B (en) | Rapid optical network path routing calculation method and device under constraint condition and computer medium | |
| JP4436307B2 (en) | LSP (LabelSwitchedPath) path calculation method, apparatus and program | |
| CN116057905A (en) | Parameterization method for network sub-graph root node selection | |
| JPH08293880A (en) | Method and device of selecting route | |
| CN115242656B (en) | Communication establishment method and device | |
| US11489758B1 (en) | Path computation for unordered inclusion and regional revisit constraints | |
| JP5001996B2 (en) | Route calculation apparatus, route calculation method and program | |
| US20240223497A1 (en) | System and methods for computing flooding topology |
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 |