CN117278466A - Candidate path selection method for fault-tolerant traffic engineering scene - Google Patents
Candidate path selection method for fault-tolerant traffic engineering scene Download PDFInfo
- Publication number
- CN117278466A CN117278466A CN202311189103.2A CN202311189103A CN117278466A CN 117278466 A CN117278466 A CN 117278466A CN 202311189103 A CN202311189103 A CN 202311189103A CN 117278466 A CN117278466 A CN 117278466A
- Authority
- CN
- China
- Prior art keywords
- paths
- preset
- candidate
- path
- source
- 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.)
- Granted
Links
- 238000010187 selection method Methods 0.000 title claims abstract description 29
- 238000000034 method Methods 0.000 claims description 19
- 238000004590 computer program Methods 0.000 claims description 7
- 238000009825 accumulation Methods 0.000 claims description 4
- 238000005516 engineering process Methods 0.000 abstract description 6
- 238000004891 communication Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 235000008694 Humulus lupulus Nutrition 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000003491 array Methods 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 238000010200 validation analysis Methods 0.000 description 1
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/22—Alternate 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/24—Multipath
- H04L45/247—Multipath using M:N active or standby paths
-
- 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/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- 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/38—Flow based routing
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 the technical field of Internet, in particular to a candidate path selection method in a fault-tolerant traffic engineering scene, which comprises the following steps: determining at least one source-destination node pair of the candidate path to be sought; based on punishment items of a plurality of preset candidate paths, iteratively selecting a path which is not selected before and is shortest for each source-destination node pair from the plurality of preset candidate paths in sequence, and adjusting the punishment items of the plurality of preset candidate paths according to a path selection result until a preset iteration condition is met; an alternative path set for each source-destination node is generated from the selected path for each source-destination node. Therefore, the problems that in the related technology, the candidate path selection method cannot achieve excellent traffic engineering performance, connectivity, high expansibility and the like are solved, the quality of the route is greatly improved, and the network accessibility is ensured under the fault-tolerant scene.
Description
Technical Field
The application relates to the technical field of Internet, in particular to a candidate path selection method in a fault-tolerant traffic engineering scene.
Background
For traffic engineering models using source routing, traffic can only be routed on candidate paths, which are therefore the basis of source routing traffic engineering. If a certain node is congested to all optional candidate paths, the traffic therein cannot avoid the influence of network congestion; if there is no short hop count candidate path between a node pair, then any traffic split is high latency; if all candidate paths of a node pair pass through the same link, the link will carry all traffic so that load balancing is not possible.
The quality of the candidate path directly determines the upper limit that can be reached by the traffic engineering. In a fault tolerant scenario, the importance of the candidate links increases even further. The failed link may cause the candidate paths passing over it to fail altogether, and the node pairs may only be rerouted through the surviving connected paths. If a node pair has only a unique candidate path, then no improvement can be made to the routing scheme by whatever routing algorithm; if the candidate path between the node pair fails, then the reachability of the network no longer exists, not to mention traffic engineering to improve the quality of the route.
Thus, the present application considers that a candidate path scheme in an excellent fault tolerance scenario should satisfy the following three properties: traffic engineering performance guarantee, connectivity guarantee, and high scalability.
In the related art, the K-shortest path scheme selects a plurality of candidate paths with the minimum hops for the source-destination node pair, which can ensure excellent traffic engineering performance, but cannot achieve good balance between connectivity and scalability. Disjoint (dispatch) candidate paths avoid common edges between candidate paths of the same node pair, preserving excellent connectivity, but losing traffic engineering performance. The traffic independent routing (Oblivious Routing) based candidate path scheme is used in operation, while being excellent in both dimensions, but has the disadvantage that it extracts and processes the traffic independent routing scheme of the original topology, generating several candidate paths, which do not tend to choose paths with common edges (guaranteeing connectivity) and cannot have any actual performance guarantees, since the traffic independent routing optimizes the traffic matrix in the most extreme case, while the scheme needs to traverse almost all available paths in order to optimize the worst case performance, which makes it not very scalable in the face of large-scale topologies.
In summary, the candidate path selection methods in the related art are mostly only developed around one of connectivity and traffic engineering performance, and cannot be considered to have excellent traffic engineering performance, connectivity guarantee and high scalability.
Disclosure of Invention
The application provides a candidate path selection method, a candidate path selection device, electronic equipment and a storage medium aiming at a fault-tolerant traffic engineering scene, so as to solve the problems that in the related technology, the candidate path selection method cannot achieve excellent traffic engineering performance, connectivity, high expansibility and the like, greatly improve the quality of a route, and ensure the accessibility of a network in the fault-tolerant scene.
An embodiment of a first aspect of the present application provides a method for selecting a candidate path in a fault-tolerant traffic engineering scenario, including the following steps:
determining at least one source-destination node pair of the candidate path to be sought; based on punishment items of a plurality of preset candidate paths, iteratively selecting a path which is not selected before and is shortest for each source-destination node pair from the plurality of preset candidate paths in sequence, and adjusting the punishment items of the plurality of preset candidate paths according to a path selection result until a preset iteration condition is met; and generating a set of alternative paths for each source-destination node according to the selected path of each source-destination node.
Optionally, in some embodiments, after iteratively selecting one path from the preset plurality of candidate paths for each source-destination node pair, the method further includes: and adding 1 to the selected times corresponding to all the paths passing through in the preset multiple candidate paths.
Optionally, in some embodiments, after adding 1 to the number of selections corresponding to all paths passing through in the preset plurality of candidate paths, the method further includes: and adjusting the lengths of all the paths passing through in the preset multiple candidate paths to be preset multiples of an initial value.
Optionally, in some embodiments, the preset multiple is:
and num is the number of times of checking corresponding to all the paths passing through in the preset multiple candidate paths, and K is a penalty term for checking the alternative paths for multiple reasons.
Optionally, in some embodiments, the preset iteration condition is that the number of selected paths reaches the number of alternative paths or that no new paths to be selected exist.
An embodiment of a second aspect of the present application provides a candidate path selection device in a fault-tolerant traffic engineering scenario, including:
a determining module for determining at least one source-destination node pair of the candidate path; the selection module is used for iteratively selecting a path which is not selected before and is shortest for each source-destination node pair from the preset multiple candidate paths in sequence based on punishment items of the preset multiple candidate paths, and adjusting the punishment items of the preset multiple candidate paths according to a path selection result until preset iteration conditions are met; and a generating module, configured to generate an alternative path set of each source-destination node according to the selected path of each source-destination node.
Optionally, in some embodiments, after iteratively selecting one path from the preset plurality of candidate paths for each source-destination node pair, the selecting module further includes: and the accumulation unit is used for adding 1 to the selected times corresponding to all the paths passing through in the preset multiple candidate paths.
Optionally, in some embodiments, after adding 1 to the number of selections corresponding to all paths passing through among the preset plurality of candidate paths, the accumulating unit is further configured to: and adjusting the lengths of all the paths passing through in the preset multiple candidate paths to be preset multiples of an initial value.
Optionally, in some embodiments, the preset multiple is:
and num is the number of times of checking corresponding to all the paths passing through in the preset multiple candidate paths, and K is a penalty term for checking the alternative paths for multiple reasons.
Optionally, in some embodiments, the preset iteration condition is that the number of selected paths reaches the number of alternative paths or that no new paths to be selected exist.
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 capable of running on the processor, wherein the processor executes the program to realize the candidate path selection method in the fault-tolerant traffic engineering scene according to the embodiment.
An embodiment of a fourth aspect of the present application provides a computer readable storage medium having stored thereon a computer program for execution by a processor for implementing a candidate path selection method for a fault tolerant traffic engineering scenario as described in the above embodiment.
The method comprises the steps of determining at least one source-destination node pair of a candidate path to be sought, iteratively selecting a path which is not selected before and is shortest for each source-destination node pair from the preset candidate paths in sequence based on punishment items of the preset candidate paths, adjusting punishment items of the preset candidate paths according to a path selection result until preset iteration conditions are met, and generating a candidate path set of each source-destination node according to the selection path of each source-destination node. Therefore, the problems that in the related technology, the candidate path selection method cannot achieve excellent traffic engineering performance, connectivity, high expansibility and the like are solved, the quality of the route is greatly improved, and the network accessibility is ensured under the fault-tolerant scene.
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 method for selecting a candidate path in a fault tolerant traffic engineering scenario according to an embodiment of the present application;
fig. 2 is a schematic diagram of a candidate path selection device in a fault tolerant traffic engineering scenario according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
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 candidate path selection method, a candidate path selection device, an electronic device and a storage medium in a fault-tolerant traffic engineering scene according to the embodiments of the present application with reference to the accompanying drawings. Aiming at the problem that the candidate path selection method mentioned in the background art cannot achieve excellent traffic engineering performance, connectivity and high expansibility, the application provides a candidate path selection method in a fault-tolerant traffic engineering scene, wherein at least one source-destination node pair of a candidate path to be sought is determined; based on punishment items of a plurality of preset candidate paths, iteratively selecting a path which is not selected before and is shortest for each source-destination node pair from the plurality of preset candidate paths in sequence, and adjusting the punishment items of the plurality of preset candidate paths according to a path selection result until a preset iteration condition is met; an alternative path set for each source-destination node is generated from the selected path for each source-destination node. Therefore, the problems that in the related technology, the candidate path selection method cannot achieve excellent traffic engineering performance, connectivity, high expansibility and the like are solved, the quality of the route is greatly improved, and the network accessibility is ensured under the fault-tolerant scene.
Before describing the embodiments of the present application, three properties that should be satisfied by the candidate path scheme in the excellent fault tolerance scenario related to the related art of the present application will be briefly described.
The present application considers that a candidate path scheme in an excellent fault tolerance scenario should satisfy the following three properties:
1. and ensuring the flow engineering performance. The given candidate path must be able to support a high quality routing strategy. Besides ensuring the accessibility of fault-tolerant scenes as much as possible, the model should avoid congestion as much as possible and reduce time delay, so that the candidate path scheme also considers the performance of traffic engineering while ensuring connectivity and cannot cause performance damage when congestion occurs to a link.
2. Connectivity guarantees. In the event of a network failure, the respective source-destination node should ensure as much as possible that at least one candidate path exists that is not failed. Under the condition of at least one reachable path, the traffic engineering model can realize traffic forwarding without re-routing, and the calculation and deployment cost of re-planning paths is avoided. In order to improve the performance of the traffic engineering model in the fault-tolerant scene, a candidate path scheme is designed for the fault-tolerant scene, and the requirements of three dimensions of the robustness of the path, the traffic engineering performance and the solution space are considered.
3. High scalability. Faults occur in the network, resulting in dynamic changes in the network topology. Thus, the run time of the candidate path selection scheme needs to be within a reasonable time so as to dynamically keep up with the dynamic changes in network topology.
However, the candidate path selection methods in the related art are mostly only developed around one of connectivity and traffic engineering performance, and cannot achieve both excellent traffic engineering performance, connectivity guarantee and high scalability.
Therefore, the present application provides a candidate path selection method for a fault-tolerant traffic engineering scenario, which combines the above three excellent traffic engineering performances, and the candidate path selection method for a fault-tolerant traffic engineering scenario of the present application will be described in detail with reference to specific embodiments.
Specifically, fig. 1 is a flow chart of a candidate path selection method in a fault-tolerant traffic engineering scenario according to an embodiment of the present application.
As shown in fig. 1, the candidate path selection method for the fault-tolerant traffic engineering scenario includes the following steps:
in step S101, at least one source-destination node pair of the candidate path to be sought is determined.
Wherein the source-destination node pair is composed of a source node and a destination node in network transmission. Alternative paths, i.e., alternative links, of embodiments of the present application.
It will be appreciated by those skilled in the art that the network layer may pass through a number of intermediate nodes during the transfer of a data packet from a source node to a destination node, each intermediate node receiving information of a connection establishment packet, looking up a routing table based on the destination address of the packet, and selecting an appropriate output line. Thus, to obtain a set of alternative paths, the present application first needs to determine at least one source-destination node pair that needs to request an alternative path, thereby yielding a plurality of different candidate paths.
In step S102, based on the penalty items of the preset multiple candidate paths, one path which is not selected before and is the shortest is iteratively selected for each source-destination node pair from the preset multiple candidate paths in turn, and the penalty items of the preset multiple candidate paths are adjusted according to the path selection result until the preset iteration condition is satisfied.
It should be noted that, to meet the above-mentioned connectivity guarantee, the alternative path should reduce the number of common links as much as possible, that is, pass different links in the alternative path as much as possible; to meet the above traffic engineering performance guarantee, the alternative path should select as few hops as possible, and pass through the link with higher bandwidth. To meet both these needs, the present application proposes a "semi-disjoint" alternative strategy. The "semi-Disjoint" alternative path strategy derives the name from the "Disjoint" (dispatch) alternative path scheme in the related art, in which all alternative paths of the same source-destination node pair need to be strictly guaranteed to have no common link; while in the semi-disjoint alternative path strategy of the present application, it is not necessary to strictly meet this constraint, but only by constraining the links that appear to be common as few intersections as possible.
Specifically, the semi-disjoint alternative path policy of the present application adds a selected penalty term in the shortest path algorithm in the related art, that is, a penalty term of a plurality of candidate paths preset in the embodiment of the present application, that is, each candidate path is added to a selected penalty term, and at the beginning of each selection, the present application sets the penalty terms of all candidate paths to zero, and then starts iteration, and each iteration selects one alternative path.
Further, in order to make different links pass through the candidate paths as far as possible, and the links have fewer hops as far as possible, the embodiments of the present application need to iteratively select, from a preset plurality of candidate paths, a path that has never been selected before and is the shortest for each source-destination node pair. At this time, the penalty term (initially zero) of the selected path is changed, so the present application needs to adjust the penalty terms of the preset multiple candidate paths according to the path selection result and the iteration number.
Optionally, in some embodiments, after iteratively selecting one path from the preset plurality of candidate paths for each source-destination node pair, the method further includes: and adding 1 to the selected times corresponding to all the paths passing through in the preset multiple candidate paths.
Specifically, after iteratively selecting one path from the plurality of candidate paths for each source-destination node pair, which has not been selected before and is the shortest, the penalty term of the plurality of candidate paths needs to be adjusted, where the adjustment policy is to add one to the number of selections corresponding to all paths passing through in the paths.
Optionally, in some embodiments, after adding 1 to the number of selections corresponding to all paths passing through in the preset plurality of candidate paths, the method further includes: and adjusting the lengths of all the paths passing through in the preset multiple candidate paths to be a preset multiple of the initial value.
Further, after performing the 1-adding operation on the penalty items of the multiple candidate paths, the embodiment of the application adjusts the lengths of all paths passing through in the multiple candidate paths to a preset multiple of the initial value.
Optionally, in some embodiments, the preset multiple is:
and the num is the corresponding check times of all the paths passing through in the preset multiple candidate paths, and the K is a punishment item for checking the alternative paths for the repeated check.
Specifically, the embodiment of the application needs to change the lengths of all links involved in the path into initial values after adding one to the selected times corresponding to all paths passing through in the pathMultiple (i.e., num x K times the initial value added).
Optionally, in some embodiments, the preset iteration condition is that the number of selected paths reaches the number of alternative paths or that no new paths to be selected exist.
It should be noted that, in the embodiment of the present application, the penalty term of all links is set to zero, and then iteration is started, and the preset iteration condition in the embodiment of the present application is that, when the source-destination node pair starts to select a path each time, each iteration selects an alternative path until a predetermined number of alternative paths is reached or no new paths exist, thereby ending the iteration.
In step S103, a set of alternative paths for each source-destination node is generated from the selected paths for each source-destination node.
It will be appreciated that after the preset iteration conditions are met, the iteration ends and the final output is a set of alternative paths for each source-destination node.
According to the candidate path selection method for the fault-tolerant traffic engineering scene, at least one source-destination node pair of the candidate path is determined, a path which is not selected before and is shortest is selected for each source-destination node pair in sequence from the preset candidate paths based on punishment items of the preset candidate paths, punishment items of the preset candidate paths are adjusted according to path selection results until preset iteration conditions are met, and a candidate path set of each source-destination node is generated according to the selection path of each source-destination node. Therefore, the problems that in the related technology, the candidate path selection method cannot achieve excellent traffic engineering performance, connectivity, high expansibility and the like are solved, the quality of the route is greatly improved, and the network accessibility is ensured under the fault-tolerant scene.
Next, a candidate path selecting device in a fault-tolerant traffic engineering scenario according to an embodiment of the present application is described with reference to the accompanying drawings.
Fig. 2 is a block schematic diagram of a candidate path selection device for a fault tolerant traffic engineering scenario according to an embodiment of the present application.
As shown in fig. 2, the candidate path selection device 10 for the fault-tolerant traffic engineering scenario includes: a validation module 100, a selection module 200, and a generation module 300.
Wherein the determining module 100 is configured to determine at least one source-destination node pair of the candidate path to be sought; the selection module 200 is configured to iteratively select, for each source-destination node pair, one path that has not been selected before and is shortest from among the preset multiple candidate paths in turn based on penalty items of the preset multiple candidate paths, and adjust penalty items of the preset multiple candidate paths according to a path selection result until a preset iteration condition is satisfied; and a generation module 300 for generating a set of alternative paths for each source-destination node from the selected path for each source-destination node.
Optionally, in some embodiments, after iteratively selecting, for each source-destination node pair, one path from among a preset plurality of candidate paths, which has not been selected before and is the shortest, the selecting module 200 further includes: and an accumulation unit. The accumulation unit is used for adding 1 to the selected times corresponding to all the paths passing through in the preset multiple candidate paths.
Optionally, in some embodiments, after adding 1 to the number of selections corresponding to all paths passing through among the preset plurality of candidate paths, the accumulating unit is further configured to: and adjusting the lengths of all the paths passing through in the preset multiple candidate paths to be a preset multiple of the initial value.
Optionally, in some embodiments, the preset multiple is:
and the num is the corresponding check times of all the paths passing through in the preset multiple candidate paths, and the K is a punishment item for checking the alternative paths for the repeated check.
Optionally, in some embodiments, the preset iteration condition is that the number of selected paths reaches the number of alternative paths or that no new paths to be selected exist.
It should be noted that the foregoing explanation of the embodiment of the candidate path selection method in the fault-tolerant traffic engineering scenario is also applicable to the candidate path selection device in the fault-tolerant traffic engineering scenario in this embodiment, and will not be repeated herein.
According to the candidate path selection device for the fault-tolerant traffic engineering scene, at least one source-destination node pair of a candidate path is determined, a path which is not selected before and is shortest is selected for each source-destination node pair in sequence from the preset candidate paths based on punishment items of the preset candidate paths, punishment items of the preset candidate paths are adjusted according to path selection results until preset iteration conditions are met, and a candidate path set of each source-destination node is generated according to the selection path of each source-destination node. Therefore, the problems that in the related technology, the candidate path selection method cannot achieve excellent traffic engineering performance, connectivity, high expansibility and the like are solved, the quality of the route is greatly improved, and the network accessibility is ensured under the fault-tolerant scene.
Fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present application. The electronic device may include:
memory 301, processor 302, and a computer program stored on memory 301 and executable on processor 302.
The processor 302 implements the candidate path selection method for the fault tolerant traffic engineering scenario provided in the above embodiment when executing the program.
Further, the electronic device further includes:
a communication interface 303 for communication between the memory 301 and the processor 302.
A memory 301 for storing a computer program executable on the processor 302.
The memory 301 may comprise high speed RAM (Random Access Memory ) memory, and may also comprise non-volatile memory, such as at least one disk memory.
If the memory 301, the processor 302, and the communication interface 303 are implemented independently, the communication interface 303, the memory 301, and the processor 302 may be connected to each other through a bus and perform communication with each other. The bus may be an ISA (Industry Standard Architecture ) bus, a PCI (Peripheral Component, external device interconnect) bus, or EISA (Extended Industry Standard Architecture ) 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. 3, but not only one bus or one type of bus.
Alternatively, in a specific implementation, if the memory 301, the processor 302, and the communication interface 303 are integrated on a chip, the memory 301, the processor 302, and the communication interface 303 may perform communication with each other through internal interfaces.
The processor 302 may be a CPU (Central Processing Unit ) or ASIC (Application Specific Integrated Circuit, application specific integrated circuit) or one or more integrated circuits configured to implement embodiments of the present application.
The embodiment of the application also provides a computer readable storage medium, on which a computer program is stored, which when executed by a processor, implements the candidate path selection method under the fault-tolerant traffic engineering scene 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.
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. As with the other embodiments, if implemented in hardware, may be implemented using any one or combination of the following techniques, as is well 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, field programmable gate arrays, 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.
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. The candidate path selection method for the fault-tolerant traffic engineering scene is characterized by comprising the following steps:
determining at least one source-destination node pair of the candidate path to be sought;
based on punishment items of a plurality of preset candidate paths, iteratively selecting a path which is not selected before and is shortest for each source-destination node pair from the plurality of preset candidate paths in sequence, and adjusting the punishment items of the plurality of preset candidate paths according to a path selection result until a preset iteration condition is met; and
and generating an alternative path set of each source-destination node according to the selected path of each source-destination node.
2. The method of claim 1, further comprising, after iteratively selecting a previously unselected and shortest path for each source-destination node pair from the preset plurality of candidate paths in turn:
and adding 1 to the selected times corresponding to all the paths passing through in the preset multiple candidate paths.
3. The method of claim 2, further comprising, after adding 1 to the number of selections corresponding to all paths passing through among the preset plurality of candidate paths:
and adjusting the lengths of all the paths passing through in the preset multiple candidate paths to be preset multiples of an initial value.
4. A method according to claim 3, wherein the predetermined multiple is:
and num is the number of times of checking corresponding to all the paths passing through in the preset multiple candidate paths, and K is a penalty term for checking the alternative paths for multiple reasons.
5. The method according to any of claims 1-4, wherein the preset iteration condition is that the number of selected paths reaches the number of alternative paths or that no new paths to be selected exist.
6. A candidate path selection device for a fault tolerant traffic engineering scenario, comprising:
a determining module for determining at least one source-destination node pair of the candidate path;
the selection module is used for iteratively selecting a path which is not selected before and is shortest for each source-destination node pair from the preset multiple candidate paths in sequence based on punishment items of the preset multiple candidate paths, and adjusting the punishment items of the preset multiple candidate paths according to a path selection result until preset iteration conditions are met; and
and the generation module is used for generating an alternative path set of each source-destination node according to the selected path of each source-destination node.
7. The apparatus of claim 6, wherein the selection module, after iteratively selecting a previously unselected and shortest path from the preset plurality of candidate paths for each source-destination node pair, further comprises:
and the accumulation unit is used for adding 1 to the selected times corresponding to all the paths passing through in the preset multiple candidate paths.
8. The apparatus of claim 7, wherein the accumulating unit is further configured to, after adding 1 to the number of selections corresponding to all paths passing through among the preset plurality of candidate paths:
and adjusting the lengths of all the paths passing through in the preset multiple candidate paths to be preset multiples of an initial value.
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 candidate path selection method for a fault tolerant traffic engineering scenario as claimed in any one of claims 1 to 5.
10. A computer readable storage medium having stored thereon a computer program, wherein the program is executed by a processor for implementing the candidate path selection method for a fault tolerant traffic engineering scenario according to any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311189103.2A CN117278466B (en) | 2023-09-14 | 2023-09-14 | Candidate path selection method for fault-tolerant traffic engineering scene |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311189103.2A CN117278466B (en) | 2023-09-14 | 2023-09-14 | Candidate path selection method for fault-tolerant traffic engineering scene |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117278466A true CN117278466A (en) | 2023-12-22 |
| CN117278466B CN117278466B (en) | 2024-08-20 |
Family
ID=89218882
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311189103.2A Active CN117278466B (en) | 2023-09-14 | 2023-09-14 | Candidate path selection method for fault-tolerant traffic engineering scene |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117278466B (en) |
Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110142056A1 (en) * | 2009-12-15 | 2011-06-16 | Kumar Jain Manoj | Selecting A Path Through A Network |
| CN103439726A (en) * | 2013-09-06 | 2013-12-11 | 电子科技大学 | Rapid K shortest path planning method applied to GPS |
| CN103945484A (en) * | 2014-03-11 | 2014-07-23 | 北京农业信息技术研究中心 | Farmland wireless self-organizing network topology density correlation path selecting and optimizing method |
| US20170178073A1 (en) * | 2015-12-17 | 2017-06-22 | Sap Se | Reducing complexity of determining routes for shipping containers by reducing paths based on user selection |
| CN109587058A (en) * | 2019-01-07 | 2019-04-05 | 中国联合网络通信集团有限公司 | A kind of selection method and device of flux engineering route |
| CN111641557A (en) * | 2020-06-02 | 2020-09-08 | 西安电子科技大学 | Minimum cost backup path method for delay tolerant network |
| CN112465180A (en) * | 2019-09-09 | 2021-03-09 | 北京京东振世信息技术有限公司 | Vehicle path planning method and device |
| CN112769696A (en) * | 2019-11-06 | 2021-05-07 | 中兴通讯股份有限公司 | Routing method, network controller, system and storage medium |
| CN113630268A (en) * | 2021-07-29 | 2021-11-09 | 西安电子科技大学 | Method for acquiring maximum error separation path of fixed-length random interrupt scene in time-varying network |
| CN113687651A (en) * | 2021-07-06 | 2021-11-23 | 清华大学 | Path planning method and device for delivering vehicles according to needs |
| CN114298431A (en) * | 2021-12-31 | 2022-04-08 | 锐捷网络股份有限公司 | Network path selection method, device, equipment and storage medium |
| CN114564012A (en) * | 2022-02-16 | 2022-05-31 | 华南理工大学 | Unmanned racing car path planning method, system, device and storage medium |
| CN115643203A (en) * | 2022-09-15 | 2023-01-24 | 阿里巴巴（中国）有限公司 | Content distribution method, content distribution device, content distribution network, device, and medium |
| EP4152726A1 (en) * | 2021-09-20 | 2023-03-22 | Fujitsu Technology Solutions GmbH | Method for optimizing a routing in a communications network |
| CN116095785A (en) * | 2023-01-13 | 2023-05-09 | 北京智芯微电子科技有限公司 | Ad hoc network communication method, device, system and medium |
-
2023
- 2023-09-14 CN CN202311189103.2A patent/CN117278466B/en active Active
Patent Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110142056A1 (en) * | 2009-12-15 | 2011-06-16 | Kumar Jain Manoj | Selecting A Path Through A Network |
| CN103439726A (en) * | 2013-09-06 | 2013-12-11 | 电子科技大学 | Rapid K shortest path planning method applied to GPS |
| CN103945484A (en) * | 2014-03-11 | 2014-07-23 | 北京农业信息技术研究中心 | Farmland wireless self-organizing network topology density correlation path selecting and optimizing method |
| US20170178073A1 (en) * | 2015-12-17 | 2017-06-22 | Sap Se | Reducing complexity of determining routes for shipping containers by reducing paths based on user selection |
| CN109587058A (en) * | 2019-01-07 | 2019-04-05 | 中国联合网络通信集团有限公司 | A kind of selection method and device of flux engineering route |
| CN112465180A (en) * | 2019-09-09 | 2021-03-09 | 北京京东振世信息技术有限公司 | Vehicle path planning method and device |
| CN112769696A (en) * | 2019-11-06 | 2021-05-07 | 中兴通讯股份有限公司 | Routing method, network controller, system and storage medium |
| CN111641557A (en) * | 2020-06-02 | 2020-09-08 | 西安电子科技大学 | Minimum cost backup path method for delay tolerant network |
| CN113687651A (en) * | 2021-07-06 | 2021-11-23 | 清华大学 | Path planning method and device for delivering vehicles according to needs |
| CN113630268A (en) * | 2021-07-29 | 2021-11-09 | 西安电子科技大学 | Method for acquiring maximum error separation path of fixed-length random interrupt scene in time-varying network |
| EP4152726A1 (en) * | 2021-09-20 | 2023-03-22 | Fujitsu Technology Solutions GmbH | Method for optimizing a routing in a communications network |
| CN114298431A (en) * | 2021-12-31 | 2022-04-08 | 锐捷网络股份有限公司 | Network path selection method, device, equipment and storage medium |
| CN114564012A (en) * | 2022-02-16 | 2022-05-31 | 华南理工大学 | Unmanned racing car path planning method, system, device and storage medium |
| CN115643203A (en) * | 2022-09-15 | 2023-01-24 | 阿里巴巴（中国）有限公司 | Content distribution method, content distribution device, content distribution network, device, and medium |
| CN116095785A (en) * | 2023-01-13 | 2023-05-09 | 北京智芯微电子科技有限公司 | Ad hoc network communication method, device, system and medium |
Non-Patent Citations (5)
| Title |
|---|
| MING ZHU; DAN LI; YING LIU; DAN PEI; K.K. RAMAKRISHNAN; LILI LIU; JIANPING WU: "MIFO: Multi-path Interdomain Forwarding", 2015 44TH INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, 10 December 2015 (2015-12-10) * |
| RAJPUT, ABHISHEK (RAJPUT, ABHISHEK): "Quantum Simulation Algorithms with Applications to Quantum Error Correction and Topological Data Analysis", UNIVERSITY OF WASHINGTON, 6 September 2023 (2023-09-06) * |
| 丛培壮;张宇超;田野;王文东;李丹: "跨域场景下的联邦路由机制设计", 电信科学, 20 October 2020 (2020-10-20) * |
| 李陶深;肖猛;葛志辉;赵志刚;: "基于蚁群优化算法的多QoS选播路由算法研究", 微电子学与计算机, no. 08, 5 August 2010 (2010-08-05) * |
| 欧阳浩亚;: "车辆导航系统中多路径选择算法的研究", 湖南交通科技, no. 03, 30 September 2011 (2011-09-30) * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117278466B (en) | 2024-08-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7609624B2 (en) | Method and apparatus for pre-provisioning networks to support fast restoration with minimum overbuild | |
| US10574567B2 (en) | Modeling a border gateway protocol network | |
| US8675493B2 (en) | Routing bandwidth guaranteed paths with local restoration in label switched networks | |
| US7948899B2 (en) | Method and apparatus for communications traffic engineering | |
| US7554921B2 (en) | Method and apparatus for generating routing information in a data communication network | |
| JP2017525279A (en) | System and method for supporting efficient load balancing in a high performance computing (HPC) environment | |
| US12003409B2 (en) | Hierarchical ECMP control plane for dense topologies | |
| US20040083277A1 (en) | Method for fast cost-effective internet network topology design | |
| US20080253290A1 (en) | Optimization of Traffic Distribution in Multipath Routing | |
| CN117278466B (en) | Candidate path selection method for fault-tolerant traffic engineering scene | |
| Kanagavelu et al. | A pro-active and adaptive mechanism for fast failure recovery in SDN data centers | |
| US20230396546A1 (en) | Increasing multi-path size using hierarchical forwarding equivalent classes | |
| US10855581B2 (en) | System and method of computing ethernet routing paths | |
| US20060176819A1 (en) | Method for operating a network node of a communication network and network node of a communication network | |
| CA2537898C (en) | Method and apparatus for generating routing information in a data communications network | |
| KR102295159B1 (en) | Communication mehtod and apparatus of recovering communication fault | |
| Dai et al. | On the resilience of fast failover routing against dynamic link failures | |
| CN108390780B (en) | Method and apparatus for processing information | |
| Vindhya et al. | Network on Chip: A Review of Fault Tolerant Adaptive Routing Algorithm | |
| US20230362062A1 (en) | Topology partition detection | |
| Krishnan et al. | Fault-tolerant routing with minimum delay for mesh architecture | |
| US20230068443A1 (en) | Dynamic packet routing using prioritized groups | |
| WO2024092284A1 (en) | Algorithms for shortest paths to neighbors | |
| CN118264541A (en) | Standby path switching method and related equipment | |
| CN112583730A (en) | Routing information processing method and device for switching system and packet switching equipment |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |