CN112242953A - Method and device for realizing end-to-end path dynamic management based on ISIS - Google Patents
Method and device for realizing end-to-end path dynamic management based on ISIS Download PDFInfo
- Publication number
- CN112242953A CN112242953A CN202011066638.7A CN202011066638A CN112242953A CN 112242953 A CN112242953 A CN 112242953A CN 202011066638 A CN202011066638 A CN 202011066638A CN 112242953 A CN112242953 A CN 112242953A
- Authority
- CN
- China
- Prior art keywords
- group
- information
- isis
- nodes
- node
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- 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/54—Organization of routing tables
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
Abstract
The invention discloses a method and a device for realizing end-to-end path dynamic management based on ISIS, wherein the method comprises the following steps: collecting an ISIS link database of certain equipment and storing the ISIS link database in a note book; dividing the row data marked with the index into a first group, dividing the other rows into a second group, and marking the node information of each group; preferentially processing the information in the first group, processing the information in the second group after all the information is processed, storing the drawn node information by using a list, and finishing drawing if two drawn node information appear in the list at the same time; and constructing a forwarding path between any two points according to the drawing result. The method and the device can realize rapid and accurate deployment, improve operation and maintenance and cutover efficiency, reduce operation time, error rate and the like.
Description
Technical Field
The invention relates to the field of network operation and maintenance or cutover, in particular to a method and a device for realizing end-to-end path dynamic management based on ISIS.
Background
In the process of network equipment operation and cutover, a network engineer needs to perform end-to-end adjustment on a path between two points running an ISIS protocol due to a fault such as packet loss or temporary need or service forwarding need. The specific process of manual adjustment at present is as follows: a forwarding path between two points is constructed by using a synchronization mechanism of an ISIS routing protocol (final data of all ISIS devices are consistent) and a relationship between local and neighbor entries in a link database LSPID table entry, taking fig. 1 as an example:
taking the number as local node information, and checking detailed information:
the following table is recorded according to SOURCE, NBR ID, COST:
| cost@NBRID|SOURCE|cost@NBRID | remarks for note |
| 0001.0001.0001.00|10@0001.0001.0001.01 | |
The following table is recorded according to SOURCE, NBR ID, COST:
and looking at the node information without the star mark, the detailed information is checked:
the following table is recorded according to SOURCE, NBR ID, COST:
finally, according to the association relationship of each node in the table, the constructed relationship topology is shown in fig. 2:
the interconnection relationship between the R1 and the R3, and the forwarding path and cost between the two can be determined through topology, which is a relatively simple network structure, and for a complex network, tens of devices or hundreds of devices may be involved in cross-networking, and the network is labor-consuming and time-consuming by manpower alone, and is also prone to errors.
Disclosure of Invention
In order to solve the problems of low efficiency and accuracy caused by manual operation, the invention provides a method and a device for realizing end-to-end path dynamic management based on ISIS (intermediate system to intermediate system), which help a network engineer to manage the mode of a forwarding path between any two points in an ISIS network in the process of network operation and maintenance or cutover, change the mode from manual drawing to automatic generation, realize rapid and accurate deployment, improve the efficiency of operation and maintenance and cutover, reduce the operation time and the like.
In order to achieve the purpose, the invention adopts the following technical scheme:
in an embodiment of the present invention, a method for implementing end-to-end path dynamic management based on ISIS is provided, where the method includes:
collecting an ISIS link database of certain equipment and storing the ISIS link database in a note book;
dividing the row data marked with the index into a first group, dividing the other rows into a second group, and marking the node information of each group;
preferentially processing the information in the first group, processing the information in the second group after all the information is processed, storing the drawn node information by using a list, and finishing drawing if two drawn node information appear in the list at the same time;
and constructing a forwarding path between any two points according to the drawing result.
Further, dividing the row data marked with x into a first group, and dividing the other row data into a second group, and marking the node information of each group, including:
and grouping the row data marked with the letters and the row data not marked with the letters, wherein the row data marked with the letters are a first group, the row data not marked with the letters are a second group, and indicating characters represent nodes of each group and are stored in the notebook.
Further, preferentially processing the information in the first group, processing the information in the second group after all processing is finished, and storing the drawn node information by using the list, and if two drawn node information appear in the list at the same time, ending the drawing, including:
preferentially processing the information in the first group according to the output content of the last step, drawing the relationship between the nodes by taking the identifier as an origin point, and checking the detailed information of the identifier;
and processing the information in the second group, outputting a non-repetitive node in the previous step as an origin point for drawing, and finishing drawing if two pieces of drawn node information appear in the list at the same time.
Further, according to the output content of the previous step, the information in the first group is preferentially processed, the relationship between the nodes is drawn by taking the identifier as an origin, and the detailed information of the identifier is viewed, wherein the method comprises the following steps:
and according to the output content of the last step, preferentially processing the information in the first group, drawing the relationship between the nodes by taking the identifier as an origin, checking the detailed information of the identifier, and inserting interface + interface information corresponding to the primary IP address in front of each second address.
Further, the information in the second group is processed again, and the non-repetitive node output in the previous step is used as an origin for drawing, and if two pieces of drawn node information appear in the list at the same time, the drawing is finished, including:
and processing the information in the second group, outputting non-repetitive nodes in the previous step as an origin point to draw, if a plurality of nodes exist, drawing the origin point in sequence, and if two pieces of drawn node information appear in the list at the same time, ending the drawing.
Further, the information in the second group is processed again, and the non-repetitive nodes output in the previous step are used as the origin to be drawn, if a plurality of nodes exist, the nodes are sequentially used as the origin to be drawn, and if two pieces of drawn node information appear in the list at the same time, the drawing is finished, and the method comprises the following steps:
and processing the information in the second group, outputting non-repetitive nodes in the previous step as an origin for drawing, if a plurality of nodes exist, drawing the origin in sequence, marking and checking a repetitive drawing node list, and finishing drawing when two repetitive nodes appear.
Further, constructing a forwarding path between any two points according to the drawing result includes:
according to the abstract node relation of the output result of the last step, marking the nodes with the cost of 0 and the quantity of more than 1 pointing to the neighbor nodes as X;
and making a fully-connected table according to the relationship of the upper nodes and each node.
In an embodiment of the present invention, a device for implementing end-to-end path dynamic management based on ISIS is further provided, where the device includes:
the ISIS link database acquisition module is used for acquiring an ISIS link database of certain equipment and storing the ISIS link database in a note book;
the row data grouping module is used for dividing row data marked with x into a first group, dividing the other row data into a second group, and marking the node information of each group;
the inter-node drawing module is used for processing the information in the first group preferentially, processing the second group of information after all processing is finished, storing the drawn node information by using a list, and finishing drawing if two pieces of drawn node information appear in the list at the same time;
and the forwarding path construction module between the two points is used for constructing the forwarding path between any two points according to the drawing result.
In an embodiment of the present invention, a computer device is further provided, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, and when the processor executes the computer program, the processor implements the method for implementing end-to-end path dynamic management based on ISIS.
In an embodiment of the present invention, a computer-readable storage medium is further provided, where the computer-readable storage medium stores a computer program for executing the method for implementing end-to-end path dynamic management based on ISIS.
Has the advantages that:
the method and the device for realizing the dynamic management of the end-to-end path based on the ISIS utilize the ISIS protocol link database of certain equipment to automatically calculate all paths and expenses between any two points, thereby facilitating the dynamic management of the forwarding path before the two points according to the business requirement.
Drawings
FIG. 1 is a path diagram between two points running the ISIS protocol;
FIG. 2 is a relational topology diagram of nodes;
FIG. 3 is a flowchart illustrating a method for implementing end-to-end path dynamic management based on ISIS according to an embodiment of the present invention;
FIG. 4 is a path diagram between nodes under the ISIS routing protocol according to an embodiment of the present invention;
FIG. 5 is a schematic structural diagram of an apparatus for implementing end-to-end path dynamic management based on ISIS according to an embodiment of the present invention;
fig. 6 is a schematic structural diagram of a computer device according to an embodiment of the present invention.
Detailed Description
The principles and spirit of the present invention will be described below with reference to several exemplary embodiments, which should be understood to be presented only to enable those skilled in the art to better understand and implement the present invention, and not to limit the scope of the present invention in any way. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
As will be appreciated by one skilled in the art, embodiments of the present invention may be embodied as a system, apparatus, device, method, or computer program product. Accordingly, the present disclosure may be embodied in the form of: entirely hardware, entirely software (including firmware, resident software, micro-code, etc.), or a combination of hardware and software.
According to the embodiment of the invention, the method and the device for realizing end-to-end path dynamic management based on ISIS are provided, on the basis of collecting a link database of a certain ISIS routing protocol device, the powerful and fast processing capability of a computer is utilized, and the effective path and the COST COST between any two points are automatically calculated through an effective logic algorithm of a programming language, wherein the effective path and the COST COST only need a few minutes at most under general conditions, so that a network engineer can be helped to realize quick and accurate deployment, the operation and maintenance and the cutover efficiency are improved, the operation time and the error rate are reduced, and the like.
The principles and spirit of the present invention are explained in detail below with reference to several representative embodiments of the invention.
Fig. 3 is a flowchart illustrating a method for implementing end-to-end path dynamic management based on ISIS according to an embodiment of the present invention. As shown in fig. 3, the method includes:
step S101, collecting an ISIS link database of a certain device and storing the ISIS link database in a note book;
step S102, dividing the row data marked with the characters into a first group, dividing the other rows into a second group, and marking the node information of each group;
specifically, the row data marked with the letters and the row data not marked with the letters are grouped, the row data marked with the letters are a first group, the row data not marked with the letters are a second group, and the designated indicators represent nodes of each group and are stored in the notepad;
S103-S104, preferentially processing the information in the first group, processing the second group of information after all processing is finished, storing the drawn node information by using a list, and finishing drawing if two drawn node information appear in the list at the same time;
specifically, step S103, according to the output content of S102, preferentially processing the information in the first group, drawing the relationship between nodes with the identifier as the origin, checking the detailed information of the identifier, and inserting interface + interface information corresponding to the primary IP address once in front of each address from the second address;
step S104, processing the information in the second group according to the output content of the step S102, drawing by taking the non-repetitive nodes output in the step S103 as an origin, if a plurality of non-repetitive nodes exist, drawing by sequentially taking the origin, marking and checking a repetitive drawing node list, wherein two repetitive nodes appear, and the drawing is finished;
S105-S106, constructing a forwarding path between any two points according to the drawing result;
specifically, step S105, according to the abstract node relationship of the output result of S104, marks nodes whose cost is 0 and whose number is greater than 1, which point to the neighbor node, as X;
and step S106, making a fully-connected table according to the upper node relation and each node.
It should be noted that although the operations of the method of the present invention have been described in the above embodiments and the accompanying drawings in a particular order, this does not require or imply that these operations must be performed in this particular order, or that all of the operations shown must be performed, to achieve the desired results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions.
For a clearer explanation of the above method for implementing end-to-end path dynamic management based on ISIS, a specific embodiment is described below, however, it should be noted that this embodiment is only for better explaining the present invention, and should not be construed as an undue limitation to the present invention.
The following describes in detail the steps of dynamically managing the ISIS routing protocol network path manner, taking fig. 4 as an example:
step S101: because the ISIS link databases of the whole network are synchronous, only the ISIS link database of a certain device needs to be collected and stored in a notebook, taking R2 as an example:
step S102: dividing the row data marked with the characters into a group, dividing the other groups into a group, storing the group into a note book, and indicating symbols such as [02-00 ] to represent 0002.0002.0002.00-00 nodes, wherein the note book stores the following data:
one group of:
two groups are as follows:
step S103: processing the first group of contents according to the output contents of S102, drawing the relation between the nodes by taking [02-00 ] as an origin, and viewing the detailed information of [02-00 ]:
according to the local node information, the neighbor node information and the corresponding cost value, the node relation is drawn according to the SOURCE, the NBR ID and the cost as follows:
| cost@NBRID|SOURCE|cost@NBRID | remarks for note |
| 10@01:02|02:00|10@03:01 | |
| 0@02:00|02:01|0@03:00 | |
The first set of information in this example is also:
the node relationship is drawn according to SOURCE, NBR ID and cost as follows:
| cost@NBRID|SOURCE|cost@NBRID | remarks for note |
| 10@01:02|02:00|10@03:01 | |
| 0@02:00|02:01|0@03:00 | |
Marking repetitive drawing nodes [02:00]
Step S104: according to the second group of information output in S102 and with the non-repetitive node output in S103 as the origin, if there are multiple nodes, the nodes are sequentially drawn as the origin, which is 0003.0003.0003.00 in this example, the database is viewed, and the drawing is performed according to the content:
the node relationship is drawn according to SOURCE, NBR ID and cost as follows:
| cost@NBRID|SOURCE|cost@NBRID | remarks for note |
| 10@01:02|02:00|10@03:01 | |
| 0@02:00|02:01|0@03:00 | |
| 10@05:00|03:00|10@02:01|10@01:01 | |
Marking repetitive drawing nodes [02:00, 02:01]
Similarly, drawing is performed by taking the non-repetitive node of the upper output content as an origin, and if a plurality of nodes exist, drawing is performed by taking the origin in turn, which is 0005.0005.0005.00 and 0001.0001.0001.01 in the example, the database is checked, and drawing is performed according to the content:
the node relationship is drawn according to SOURCE, NBR ID and cost as follows:
| cost@NBRID|SOURCE|cost@NBRID | remarks for note |
| 10@01:02|02:00|10@03:01 | |
| 0@02:00|02:01|0@03:00 | |
| 10@05:00|03:00|10@02:01|10@01:01 | |
| 10@03:00|05:00 |
The node relationship is drawn according to SOURCE, NBR ID and cost as follows:
| cost@NBRID|SOURCE|cost@NBRID | remarks for note |
| 10@01:02|02:00|10@03:01 | |
| 0@02:00|02:01|0@03:00 | |
| 10@05:00|03:00|10@02:01|10@01:01 | |
| 10@03:00|05:00 | |
| 0@01:00|01：01|0@03:00 |
Marking repetitive drawing nodes [02:00, 02:01, 03:00]
Similarly, the non-repetitive nodes of the upper output content are used as the original points for drawing, if a plurality of nodes exist, the nodes are used for drawing the original points in sequence, in this example, 0001.0001.0001.00, the database is viewed, and the drawing is performed according to the content:
the node relationship is drawn according to SOURCE, NBR ID and cost as follows:
| cost@NBRID|SOURCE|cost@NBRID | remarks for note |
| 10@01:02|02:00|10@03:01 | |
| 0@02:00|02:01|0@03:00 | |
| 10@05:00|03:00|10@02:01|10@01:01 | |
| 10@03:00|05:00 | |
| 0@01:00|01：01|0@03:00 | |
| |10@01:01|01:00|10@01:02 |
Marking repetitive drawing nodes [02:00, 02:01, 03:00, 01:01]
Similarly, the non-repetitive nodes of the upper output content are used as the original points for drawing, if a plurality of nodes exist, the nodes are used for drawing the original points in sequence, in this example, 0001.0001.0001.02, the database is viewed, and the drawing is performed according to the content:
the node relationship is drawn according to SOURCE, NBR ID and cost as follows:
| cost@NBRID|SOURCE|cost@NBRID | remarks for note |
| 10@01:02|02:00|10@03:01 | |
| 0@02:00|02:01|0@03:00 | |
| 10@05:00|03:00|10@02:01|10@01:01 | |
| 10@03:00|05:00 | |
| 0@01:00|01：01|0@03:00 | |
| |10@01:01|01:00|10@01:02 | |
| 0@01:00|01:02|0@02:00 |
Marking the repeated drawing nodes [02:00, 02:01, 03:00, 01:01] two repeated nodes appear, and the drawing is finished.
Step S105: according to the abstract node relationship of the output result of S104, marking the nodes with the cost of 0 and the quantity of more than 1 pointing to the neighbor nodes as X, as shown in the following table:
| cost@NBRID|SOURCE|cost@NBRID | remarks for note |
| 10@01:02|02:00|10@03:01 | |
| 0@02:00|02:01|0@03:00 | X |
| 10@05:00|03:00|10@02:01|10@01:01 | |
| 10@03:00|05:00 | |
| 0@01:00|01：01|0@03:00 | X |
| |10@01:01|01:00|10@01:02 | |
| 0@01:00|01:02|0@02:00 | X |
Step S106: and making a fully-connected table according to the relationship of the upper nodes according to each node:
are respectively 01:00-02:00, 01:00-03:00, 01:00-05:00, 02:00-03:00, 02:00-05:00, 03:00-05:00,
the two paths 01:00-02:00 are 01:00-10-02:00, and 01:00-10-03:00-10-02:00, respectively
The two paths 01:00-03:00 are 01:00-10-03:00, and 01:00-10-02:00-10-03:00, respectively
The two paths 01:00-05:00 are 01:00-10-03:00-10-05:00, and 01:00-10-02:00-10-03:00-10-05:00, respectively
The two paths 02:00-03:00 are 02:00-10-01:00-10-03:00, and 02:00-10-03:00, respectively
The two paths of 02:00-05:00 are respectively 02:00-10-01:00-10-03:00-10-05:0 and, 02:00-10-03:00-10-05:00
One of the paths 03:00-05:00 is 03:00-10-05:00
For the communication between some two points, the path can be determined only by checking the starting point and the end point through the path, and in addition, the optimal path can be displayed and selected according to the existence of a plurality of paths, so that the dynamic management of the end-to-end path is realized.
Based on the same inventive concept, the invention also provides a device for realizing the end-to-end path dynamic management based on the ISIS. The implementation of the device can be referred to the implementation of the method, and repeated details are not repeated. The term "module," as used below, may be a combination of software and/or hardware that implements a predetermined function. Although the means described in the embodiments below are preferably implemented in software, an implementation in hardware, or a combination of software and hardware is also possible and contemplated.
Fig. 5 is a schematic structural diagram of an apparatus for implementing end-to-end path dynamic management based on ISIS according to an embodiment of the present invention. As shown in fig. 5, the apparatus includes:
an ISIS link database acquisition module 201, configured to acquire an ISIS link database of a certain device and store the acquired ISIS link database in a notebook;
a row data grouping module 202, configured to group row data marked with x into a first group, and group the other row data into a second group, and mark node information of each group;
the inter-node drawing module 203 is used for preferentially processing the information in the first group, processing the second group of information after all the information is processed, storing the drawn node information by using a list, and finishing drawing if two pieces of drawn node information appear in the list at the same time;
and an inter-two-point forwarding path constructing module 204, configured to construct a forwarding path between any two points according to the drawing result.
It should be noted that although several modules of the apparatus implementing end-to-end path dynamic management based on ISIS are mentioned in the above detailed description, such partitioning is merely exemplary and not mandatory. Indeed, the features and functionality of two or more of the modules described above may be embodied in one module according to embodiments of the invention. Conversely, the features and functions of one module described above may be further divided into embodiments by a plurality of modules.
Based on the aforementioned inventive concept, as shown in fig. 6, the present invention further provides a computer device 300, which includes a memory 310, a processor 320, and a computer program 330 stored in the memory 310 and operable on the processor 320, wherein the processor 320 executes the computer program 330 to implement the aforementioned method for implementing end-to-end path dynamic management based on ISIS.
Based on the foregoing inventive concept, the present invention further provides a computer-readable storage medium storing a computer program for executing the above method for implementing end-to-end path dynamic management based on ISIS.
The method and the device for realizing the end-to-end path dynamic management based on the ISIS can realize rapid and accurate deployment, improve the operation and maintenance efficiency and the cutover efficiency, reduce the operation time, the error rate and the like.
While the spirit and principles of the invention have been described with reference to several particular embodiments, it is to be understood that the invention is not limited to the disclosed embodiments, nor is the division of aspects, which is for convenience only as the features in such aspects may not be combined to benefit. The invention is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.
The limitation of the protection scope of the present invention is understood by those skilled in the art, and various modifications or changes which can be made by those skilled in the art without inventive efforts based on the technical solution of the present invention are still within the protection scope of the present invention.
Claims (10)
1. A method for implementing end-to-end path dynamic management based on ISIS is characterized in that the method comprises the following steps:
collecting an ISIS link database of certain equipment and storing the ISIS link database in a note book;
dividing the row data marked with the index into a first group, dividing the other rows into a second group, and marking the node information of each group;
preferentially processing the information in the first group, processing the information in the second group after all the information is processed, storing the drawn node information by using a list, and finishing drawing if two drawn node information appear in the list at the same time;
and constructing a forwarding path between any two points according to the drawing result.
2. The ISIS-based method for implementing end-to-end path dynamic management according to claim 1, wherein dividing row data labeled with x into a first group and the others into a second group, and labeling node information of each group comprises:
and grouping the row data marked with the letters and the row data not marked with the letters, wherein the row data marked with the letters are a first group, the row data not marked with the letters are a second group, and indicating characters represent nodes of each group and are stored in the notebook.
3. The ISIS-based method for implementing dynamic end-to-end path management according to claim 1, wherein the information in the first group is processed preferentially, the information in the second group is processed after all the processing is completed, and the drawn node information is stored using the list, and if two drawn node information appear in the list at the same time, the drawing is finished, comprising:
preferentially processing the information in the first group according to the output content of the last step, drawing the relationship between the nodes by taking the identifier as an origin point, and checking the detailed information of the identifier;
and processing the information in the second group, outputting a non-repetitive node in the previous step as an origin point for drawing, and finishing drawing if two pieces of drawn node information appear in the list at the same time.
4. The ISIS-based method for implementing dynamic end-to-end path management according to claim 3, wherein the step of preferentially processing the information in the first group according to the content of the last output step, and plotting the relationship between the nodes with the identifier as the origin to view the detailed information of the identifier comprises:
and according to the output content of the last step, preferentially processing the information in the first group, drawing the relationship between the nodes by taking the identifier as an origin, checking the detailed information of the identifier, and inserting interface + interface information corresponding to the primary IP address in front of each second address.
5. The ISIS-based method for implementing end-to-end path dynamic management according to claim 3, wherein the information in the second group is processed and rendered with the non-duplicate node output in the previous step as the origin, and if two rendered node information appear in the list at the same time, the rendering is terminated, comprising:
and processing the information in the second group, outputting non-repetitive nodes in the previous step as an origin point to draw, if a plurality of nodes exist, drawing the origin point in sequence, and if two pieces of drawn node information appear in the list at the same time, ending the drawing.
6. The ISIS-based method for implementing end-to-end path dynamic management according to claim 5, wherein the information in the second group is processed again, and the non-duplicated nodes outputted in the previous step are rendered as the origin, and if there are multiple nodes, the rendering is performed sequentially as the origin, and if two rendered node information appear in the list at the same time, the rendering is terminated, including:
and processing the information in the second group, outputting non-repetitive nodes in the previous step as an origin for drawing, if a plurality of nodes exist, drawing the origin in sequence, marking and checking a repetitive drawing node list, and finishing drawing when two repetitive nodes appear.
7. The ISIS-based method for implementing dynamic end-to-end path management according to claim 1, wherein constructing a forwarding path between any two points according to the drawing result comprises:
according to the abstract node relation of the output result of the last step, marking the nodes with the cost of 0 and the quantity of more than 1 pointing to the neighbor nodes as X;
and making a fully-connected table according to the relationship of the upper nodes and each node.
8. An apparatus for implementing end-to-end path dynamic management based on ISIS, the apparatus comprising:
the ISIS link database acquisition module is used for acquiring an ISIS link database of certain equipment and storing the ISIS link database in a note book;
the row data grouping module is used for dividing row data marked with x into a first group, dividing the other row data into a second group, and marking the node information of each group;
the inter-node drawing module is used for processing the information in the first group preferentially, processing the second group of information after all processing is finished, storing the drawn node information by using a list, and finishing drawing if two pieces of drawn node information appear in the list at the same time;
and the forwarding path construction module between the two points is used for constructing the forwarding path between any two points according to the drawing result.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the method of any of claims 1-7 when executing the computer program.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program for executing the method of any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011066638.7A CN112242953B (en) | 2020-10-02 | 2020-10-02 | Method and device for realizing end-to-end path dynamic management based on ISIS |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011066638.7A CN112242953B (en) | 2020-10-02 | 2020-10-02 | Method and device for realizing end-to-end path dynamic management based on ISIS |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112242953A true CN112242953A (en) | 2021-01-19 |
| CN112242953B CN112242953B (en) | 2022-05-17 |
Family
ID=74168463
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011066638.7A Active CN112242953B (en) | 2020-10-02 | 2020-10-02 | Method and device for realizing end-to-end path dynamic management based on ISIS |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112242953B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101133408A (en) * | 2005-03-04 | 2008-02-27 | 思科技术公司 | Computation of a shortest inter-domain te-lsp across a set of autonomous systems |
| CN101888326A (en) * | 2009-05-15 | 2010-11-17 | 华为技术有限公司 | Business connection establishment method, path computing unit device and network system |
| CN102037685A (en) * | 2007-12-31 | 2011-04-27 | 北方电讯网络有限公司 | IP forwarding across a link state protocol controlled Ethernet network |
| CN102546375A (en) * | 2010-12-29 | 2012-07-04 | 中兴通讯股份有限公司 | Method and system for displaying host names of tunnel nodes, and nodes |
| US9100328B1 (en) * | 2012-03-12 | 2015-08-04 | Juniper Networks, Inc. | Forwarding mechanisms for fast reroute using maximally redundant trees |
| US20150365271A1 (en) * | 2014-06-13 | 2015-12-17 | Telefonaktiebolaget L M Ericsson (Publ) | Optimization to expand is-is leaf nodes during lfa computation |
| CN106506374A (en) * | 2015-09-06 | 2017-03-15 | 中兴通讯股份有限公司 | A kind of dummy node identification method and device |
-
2020
- 2020-10-02 CN CN202011066638.7A patent/CN112242953B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101133408A (en) * | 2005-03-04 | 2008-02-27 | 思科技术公司 | Computation of a shortest inter-domain te-lsp across a set of autonomous systems |
| CN102037685A (en) * | 2007-12-31 | 2011-04-27 | 北方电讯网络有限公司 | IP forwarding across a link state protocol controlled Ethernet network |
| CN101888326A (en) * | 2009-05-15 | 2010-11-17 | 华为技术有限公司 | Business connection establishment method, path computing unit device and network system |
| CN102546375A (en) * | 2010-12-29 | 2012-07-04 | 中兴通讯股份有限公司 | Method and system for displaying host names of tunnel nodes, and nodes |
| US9100328B1 (en) * | 2012-03-12 | 2015-08-04 | Juniper Networks, Inc. | Forwarding mechanisms for fast reroute using maximally redundant trees |
| US20150365271A1 (en) * | 2014-06-13 | 2015-12-17 | Telefonaktiebolaget L M Ericsson (Publ) | Optimization to expand is-is leaf nodes during lfa computation |
| CN106506374A (en) * | 2015-09-06 | 2017-03-15 | 中兴通讯股份有限公司 | A kind of dummy node identification method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112242953B (en) | 2022-05-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20130322298A1 (en) | Network Topology Discovery | |
| CN111143368B (en) | Relational database data comparison method and system | |
| CN109542330B (en) | Data storage method, data query method and device | |
| US20170270119A1 (en) | Systems and methods for distributed storage of data across multiple hash tables | |
| CN104021123A (en) | Method and system for data transfer | |
| CN102215136A (en) | Flow topology generation method and device | |
| CN105183898A (en) | Data sync method and data sync system | |
| CN113254535B (en) | Method and device for synchronizing data from mongodb to mysql and computer readable storage medium | |
| CN111901451A (en) | Method and device for combing reference relationship between private line user domain and address pool | |
| CN108108567A (en) | Power distribution network line chart automatic drafting method based on fault detector logical place | |
| CN111245662B (en) | Method and device for displaying network topology | |
| CN112242953B (en) | Method and device for realizing end-to-end path dynamic management based on ISIS | |
| CN114710469B (en) | IPV4 address rationalization management method and device | |
| CN101938420B (en) | Cluster topological collection method and device | |
| CN111901159B (en) | Method and device for replacing equipment configuration ports in batches | |
| CN116760681A (en) | Fault node association discovery method based on frequent item analysis | |
| CN101917282A (en) | Method, device and system for processing alarm shielding rules | |
| CN105468521A (en) | Pointer related semantic error location method based on subgraph search | |
| CN110572278A (en) | Method and device for positioning information of three-layer gateway of metropolitan area network | |
| KR101927689B1 (en) | Method for processing of cim network diagram | |
| CN110765190B (en) | Automatic database cluster capacity expansion method and device and electronic equipment | |
| CN114818994A (en) | Cross-business map fusion method based on multi-source heterogeneous power data | |
| CN111901452A (en) | Method and device for automatically adapting and adding IPV6 information for equipment interface | |
| CN113722297A (en) | Order system reconstruction smooth migration method | |
| CN108768863B (en) | Transmission network route analysis method and device and computer readable storage medium |
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 | ||
| CP02 | Change in the address of a patent holder | ||
| CP02 | Change in the address of a patent holder |
Address after: 200000 room 702-2, No. 4811 Cao'an Road, Jiading District, Shanghai Patentee after: CHINA UNITECHS Address before: Room 1004, 10th floor, 1112 Hanggui Road, Anting Town, Jiading District, Shanghai- Patentee before: CHINA UNITECHS |