Automatic generation and maintenance method for inter-domain routing protocol traffic engineering link
A technology of traffic engineering and routing protocol, applied in the field of designing optical network communication, it can solve the problems of increasing the possibility of errors, wasting network resources and time, slow response, etc., so as to reduce the probability of artificial network failure and avoid manual operation. , the effect of enhancing stability
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
no. 1 example
[0036] In this embodiment, a method for automatically generating an inter-domain routing protocol traffic engineering link is provided.
[0037] As shown in Figure 1, the automatic generation method of the Inter-Domain Routing Protocol Traffic Engineering (DDRPTE) link according to the present embodiment comprises: Step S102, search the link state database of Interior Gateway Protocol (IGP), obtain all domain boundary routers ID; step S104, based on the ID of the domain border router, construct a query request for generating a DDRP TE link between inter-domain routers for query, and receive the query result; and step S106, generate a DDRP TE link according to the query result.
[0038] Wherein, in step S104, the following processing is further included: based on the ID of the domain border router, it is judged whether there is a certain constraint requirement on the DDRP TE link, wherein the constraint requirement may include at least one of the following: bandwidth, shared ris...
example 1
[0054] Example 1, under certain constraints, the generation of DDRP TE link (link):
[0055] In this example, it is assumed that the attribute of the link between IGP domain border router A and IGP domain border router C has been determined as {x, y, z}.
[0056] (11) Obtain boundary nodes: (corresponding to the above step S102)
[0057] By querying the database of the IGP protocol, all summary-LSAs are obtained, and by querying the relevant fields in the LSA, the node ID (that is, the border router ID) of the domain border router can be obtained, thereby, the router IDs of nodes A and C can be obtained;
[0058] (12) Construct and generate the query request of DDRP TE link: (corresponding to the above-mentioned step S104)
[0059] Since there are definite constraint requirements on the link in this example, a routing query is sent to CSPF according to the specified constraint, with the starting point being router A and the ending point being router C (of course, there may al...
example 2
[0079] Example 2, under the best possible constraints, the generation of DDRP TE link:
[0080] In this example, it is assumed that the attributes of the E-F link are {x1, y1, z1}, and the attributes of the C-E link are {x2, y2, z2}.
[0081] (21) Obtain boundary nodes:
[0082] By querying the database of the IGP protocol, all summary-LSAs can be obtained, and by querying the relevant fields in the LSA, the node ID of the domain border router can be obtained. At this point, the router IDs of nodes C and E can be obtained;
[0083] (22) Construct a query request to generate a DDRP TE link:
[0084] Send route query to CSPF (constrained shortest route first algorithm) computing module, the starting point of this route is router C, and end point is router E (certainly, also may be two-way link); If return query result is success, then execute (23 ), if the return query result is failure, then transfer to (24);
[0085] After the query is successful, execute step (23)
[008...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com