WO2008055429A1 - Procédé et noeud limite pour l'annonce d'informations de connexion limite d'un système as - Google Patents

Procédé et noeud limite pour l'annonce d'informations de connexion limite d'un système as Download PDF

Info

Publication number
WO2008055429A1
WO2008055429A1 PCT/CN2007/070679 CN2007070679W WO2008055429A1 WO 2008055429 A1 WO2008055429 A1 WO 2008055429A1 CN 2007070679 W CN2007070679 W CN 2007070679W WO 2008055429 A1 WO2008055429 A1 WO 2008055429A1
Authority
WO
WIPO (PCT)
Prior art keywords
boundary
connection information
boundary connection
autonomous system
node
Prior art date
Application number
PCT/CN2007/070679
Other languages
English (en)
French (fr)
Inventor
Hongmiao Xia
Renhai Zhang
Guoyi Chen
Xingfeng Jiang
Original Assignee
Huawei Technologies Co., Ltd.
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Priority claimed from CNA200610063572XA external-priority patent/CN101102325A/zh
Priority claimed from CN2006101568154A external-priority patent/CN101179488B/zh
Application filed by Huawei Technologies Co., Ltd. filed Critical Huawei Technologies Co., Ltd.
Priority to ES07801087.3T priority Critical patent/ES2452340T3/es
Priority to EP07801087.3A priority patent/EP2086189B1/en
Priority to CN200780000353XA priority patent/CN101517998B/zh
Publication of WO2008055429A1 publication Critical patent/WO2008055429A1/zh
Priority to US12/463,218 priority patent/US8270317B2/en
Priority to US12/895,292 priority patent/US8125929B2/en
Priority to US13/595,721 priority patent/US9276836B2/en
Priority to US14/925,954 priority patent/US9397925B2/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • H04L45/033Topology update or discovery by updating distance vector protocols
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • H04L45/04Interdomain routing, e.g. hierarchical routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/32Flooding
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/50Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]

Definitions

  • the present invention relates to the field of communications technologies, and in particular, to a method and a boundary node for informing autonomous system boundary connection information. Background of the invention
  • Traffic Engineering is in the forefront. It focuses on the optimization of overall network performance. The main goal is to easily provide efficient and reliable network services, optimize the use of network resources, and optimize network traffic. According to the scope of traffic engineering, it can be divided into intra-domain traffic engineering and inter-domain traffic engineering. At present, the traffic engineering technology in the domain has been relatively mature. The main method is to extend the traditional interior gateway protocol (IGP), such as Open Shortest Path First Traffic Engineering (OSPF). -TE), the extension of the Intermediate System to Intermediate System Traffic Engineering (ISIS-TE), etc., flooding the TE information of the link within the domain to implement the traffic engineering database (Traffic Engine Database, TED ) Synchronization.
  • IGP interior gateway protocol
  • OSPF Open Shortest Path First Traffic Engineering
  • ISIS-TE Intermediate System to Intermediate System Traffic Engineering
  • TED Traffic Engine Database
  • TE information within each autonomous system cannot be flooded outside the autonomous system for scalability and security reasons. Therefore, in order to obtain the traffic engineering TE path between autonomous systems, there are currently two main path calculation methods: one is to use the Path Computation Element (PCE) collaborative computing, and there are one or more PCEs in the autonomous system.
  • PCE Path Computation Element
  • the PCE of the system cooperates to complete the path calculation between the autonomous systems. The other way is to display the AS sequence of the specified path or specify the boundary route of the autonomous system by displaying the route.
  • the IP address of the Autonomous System Border Router (ASBR) is J'J, and then the Label Switched Router (LSR) completes the path calculation between the autonomous systems based on the specified information.
  • the path calculation unit PCE or the label switching router LSR responsible for the TE path calculation needs to know the boundary connection information between the autonomous system and the external neighboring autonomous system, and the boundary connection information refers to The information about the connection relationship is established or deleted between the border router ASBR of the autonomous system where the path calculation node is located and the border router ASBR of the external neighboring autonomous system.
  • the boundary information of the autonomous system changes, for example, when a boundary node is disconnected from the corresponding neighbor boundary node in the neighboring autonomous system, if the node responsible for the path calculation in the autonomous system obtains the system through a static manual configuration method
  • the boundary connection information is used, the change of the boundary information is not known in time. The path calculation is still performed based on the previously statically configured information.
  • a main purpose of embodiments of the present invention is to provide a method for informing autonomous system boundary connection information
  • another main purpose is to provide a notification autonomous system boundary connection. Connect the boundary nodes of the information to adapt to the dynamic changes of the network topology, and timely notify the autonomous system boundary connection information to the system.
  • the embodiment of the invention discloses a method for informing autonomous system boundary connection information, the method comprising: a boundary node of an autonomous system establishing and maintaining boundary connection information of the autonomous system; and flooding the boundary connection information in the autonomous system; The node of the autonomous system receives the boundary connection information.
  • the embodiment of the invention further discloses a boundary node for informing autonomous system boundary connection information, where the boundary node includes:
  • a boundary connection information collection module configured to obtain boundary connection information established by the boundary node
  • boundary connection information database configured to store boundary connection information of the autonomous system, including boundary connection information established by the boundary node
  • a message generating module configured to encapsulate the boundary connection information established by the border node in the packet
  • the message advertisement module is configured to flood the message formed in the message generation module to the autonomous system.
  • FIG. 1 is a flowchart of a method for advertising boundary connection information of an autonomous system according to an embodiment of the present invention
  • FIG. 2 is a flowchart of a method for supporting boundary connection information of an autonomous system in an ISIS protocol according to an embodiment of the present invention
  • FIG. 3 is a flowchart of a method for supporting a boundary of autonomous system boundary notification information of an ISIS protocol according to an embodiment of the present invention
  • Scene map 4 is a network to which a method for advertising boundary connection information of an autonomous system is applied according to an embodiment of the present invention.
  • FIG. 5 is a boundary connection information table established by applying a method for notifying autonomous system boundary connection information in an embodiment of the present invention in the network scenario shown in FIG. 4;
  • FIG. 6 is a flowchart of a method for supporting a boundary of an autonomous system to notify an OSPF protocol to add boundary connection information according to an embodiment of the present invention
  • FIG. 7 is a flowchart of a method for supporting an AU protocol to notify a boundary of autonomous system boundary connection when deleting boundary connection information according to an embodiment of the present invention
  • FIG. 8 is a boundary node for informing an autonomous system boundary connection information according to an embodiment of the present invention. Mode for carrying out the invention
  • FIG. 1 is a flowchart of a method for advertising an autonomous system boundary connection information according to an embodiment of the present invention. The method includes:
  • Step 101 A boundary node of the autonomous system establishes and maintains boundary connection information of the autonomous system
  • Step 102 Flooding the boundary connection information in an autonomous system
  • Step 103 The node of the autonomous system receives the boundary connection information.
  • the method of the present invention for informing autonomous system boundary connection information is generally applicable to a large network including a plurality of autonomous systems.
  • An autonomous system implementing the method of the present invention includes at least two nodes, the nodes being connected to each other, and at least one of which is a boundary node for establishing a neighbor connection relationship with an external neighboring autonomous system, and the other node may be responsible for the autonomous system
  • the internal node forwarded by the internal message may also be another boundary node that can establish a neighbor connection relationship with the outside of the autonomous system.
  • the autonomous system includes multiple boundary nodes and internal nodes.
  • the boundary node and the internal node may be a one-to-one connection relationship, or may be a one-to-many or many-to-many connection relationship.
  • the side The border node and the internal node can use routers or other network devices with routing functions.
  • the node of the autonomous system may support the ISIS protocol or support the OSPF protocol. The technical solution of the present invention will be described in detail below by way of examples.
  • a router is used as an autonomous system node for explanation.
  • the following takes the ISIS protocol supported by the router of the autonomous system as an example to describe in detail the method for advertising the boundary information of the autonomous system shown in Figure 1.
  • Step 101A The border router of the autonomous system establishes and maintains boundary connection information of the autonomous system
  • the boundary connection information in step 101A may be obtained through the Border Gateway Protocol (BGP).
  • BGP Border Gateway Protocol
  • the process of establishing and maintaining the autonomous system boundary connection information may be: when the boundary router and the neighboring autonomous system have neighbor boundaries When the router establishes a connection relationship, the corresponding boundary connection information is established; when the connection between the border router and the neighboring border router of the external neighboring autonomous system is disconnected, the corresponding boundary connection information is deleted;
  • the boundary connection information in step 101A may also be obtained through static manual configuration.
  • the process of establishing and maintaining the autonomous system boundary connection information may be: the border router receives the user's manual input, when the border router When the link between the neighboring border routers of the external neighboring autonomous system is available, the corresponding border connection information is established; when the link between the border router and the neighboring border router of the external neighboring autonomous system is unavailable, the link is deleted. Corresponding boundary connection information.
  • the boundary connection information includes a neighbor border router identifier (RouterJD) and a neighboring autonomous system number (AS Number) in the neighboring autonomous system.
  • RouterJD neighbor border router identifier
  • AS Number neighboring autonomous system number
  • Step 102A The border router floods the boundary connection information in the autonomous system. Since the border router supports the ISIS protocol, the embodiment of the present invention defines a border connection description sub-TLV (ASBR Connection Descriptor Sub-TLV) field, which is used to carry the autonomous system boundary connection information and notify the internal autonomous system.
  • the boundary connection information may be included in a value (Value) field of a boundary connection description Sub-TLV field, or the Router_ID and AS Number in the boundary connection information may be respectively included in the value field of the two boundary connection description Sub-TLV fields. in.
  • Router_ID can be represented by 4 or 16 bytes
  • AS Number can be represented by 4 bytes.
  • TLV Type-Length-Value
  • LSP Label Switch Path
  • Sub-TLV ASBR Connection Descriptor Sub-TLV
  • the TSIS field defined in the LSP packet is defined in the ISIS protocol, such as the ISIS Routing Capability TLV field, the intermediate system reachability (IS Reachability) TLV field, and the Internet Protocol Reachability (TLV). Field, Inter-AS Reachability TLV field, etc.
  • the above TLV field contains one or more variable length sub-TLVs (Sub-TLVs) fields, and the sum of the lengths of all Sub-TLVs cannot exceed 250 bytes, and all Sub-TLV fields can be extended.
  • a field that identifies a flooding range and a flooding direction is defined in the TLV field. You can choose to flood the entire autonomous system by carrying a specific value of 1 in the field that identifies the flooding range and the flooding direction. A specific value of 2 is carried in the field identifying the flooding range and the flooding direction to select to flood the broadcast within a specific routing area.
  • the routing area refers to a level in an autonomous system that supports the ISIS protocol.
  • the sub-TLV field is described by using the newly defined boundary connection.
  • the border router supporting the ISIS protocol in step 102A floods the broadcast boundary connection information in the autonomous system.
  • the boundary router may include the boundary connection information in the boundary connection description Sub-TLV field.
  • the boundary connection description Sub-TLV field is included in the TLV field, and the TLV field is included in the LSP.
  • the broadcast LSP packet is flooded.
  • the border router saves the flooded LSPs.
  • the border router updates the corresponding boundary connection description Sub-TLV field in time, and refreshes the corresponding LSP message, and then the boundary connection information carried in the LSP message is autonomous. Flooding broadcasts within the system.
  • the border router After the border router floods the broadcast LSP for the first time, the border router does not save the LSP of the flooding broadcast. Therefore, when the border connection information changes, the border router regenerates the LSP that contains the updated border connection information. The packet is flooded and the regenerated LSP is flooded.
  • step 102A the boundary connection information carried in the TLV field of the LSP packet is flooded throughout the autonomous system.
  • all border routers and all PCEs that need to obtain boundary connection information are in the same layer, because other routers do not need to obtain boundary connection information except PCE.
  • Unnecessary flooding broadcasts users can configure according to actual needs so that information is flooded only in the layer where all border routers and all PCEs are located.
  • the configuration method is to use the above-mentioned fields for identifying the flooding range and the flooding direction, and to control the flooding range of the TLV field in all the border routers and all the layers where the PCE is located.
  • Step 103A The router of the autonomous system receives the boundary connection information.
  • the user can configure the router of the autonomous system as needed.
  • the router of the autonomous system receives the LSP packet, if the border connection information carried in the LSP packet is not required, the packet is forwarded only, and the information carried in the packet is not obtained.
  • a normal internal router that does not need to perform path calculation will only forward LSP packets after receiving LSP packets carrying boundary connection information, and is responsible for path calculation.
  • the PCE obtains the boundary connection information from the LSP packet to support the implementation of the path calculation.
  • the border router of the autonomous system is based on the BGP protocol and the external neighboring system.
  • the border router can further summarize the LSP packet notification processing into the following three cases:
  • FIG. 2 is a method for supporting the ISIS protocol to notify the boundary connection information of the autonomous system in the embodiment of the present invention. Flow chart when information. Includes the following steps:
  • Step 201 The border router obtains new boundary connection information, where the border connection information includes the neighbor border router identifier and a neighboring autonomous system number.
  • Step 202 Determine whether there is an ISIS router capability TLV field in the LSP message saved by the border router, if yes, go to step 203; if not, go to step 205.
  • Step 203 Determine whether the ISIS router capability TLV field has enough space to add new boundary connection information, if yes, execute step 204; if not, execute step 205.
  • the specific manner of determining in step 203 is: determining that in the ISIS router capability TLV field, if the boundary described in step 201 is added Connection information, whether the sum of the lengths of all Sub-TLV fields in the ISIS Router Capability TLV exceeds 250 bytes. If it exceeds 250 bytes, the ISIS router capability TLV field does not have enough space to add new boundary connection information; otherwise, there is enough space.
  • Step 204 Add the new boundary connection information to the boundary connection description Sub-TLV field in the TSIS field of the ISIS router capability, and continue to step 206.
  • boundary connection information there are two ways to add boundary connection information in this step: If ISIS routes If there is a boundary connection description Sub-TLV field in the TLV field, the added boundary connection information can be added to the existing boundary connection description Sub-TLV field in the ISIS Router Capability TLV field; if the ISIS Router Capability TLV field If there is no boundary connection description Sub-TLV field, a new boundary connection description Sub-TLV field can be created, and the newly added boundary connection information is added to the newly created boundary connection description Sub-TLV field in the ISIS Router Capability TLV field.
  • Step 205 Create an ISIS router capability TLV field in the LSP packet, and add the newly added border connection information to the boundary connection description Sub-TLV field in the TLV field of the newly created ISIS router capability, and continue to step 206.
  • Step 206 Refresh the LSP message
  • Step 207 Broadcast the LSP packet in the autonomous system.
  • FIG. 3 is a flowchart of the method for supporting the ASIS protocol to notify the boundary connection information of the autonomous system in deleting the boundary connection information according to the embodiment of the present invention. Includes the following steps:
  • Step 301 The border router obtains boundary connection information to be deleted.
  • Step 302 Determine whether there is a boundary connection description Sub-TLV field in the ISIS router capability TLV field of the LSP message saved by the border router, if yes, go to step 303; if not, go to step 303; Then step 304 is performed.
  • Step 303 Generate an error message to end the current process.
  • Step 304 Delete the boundary connection information in the boundary connection description Sub-TLV field, and update the boundary connection description Sub-TLV field;
  • Step 305 Refresh an LSP packet including the boundary connection description Sub-TLV field.
  • Step 306 Broadcast the LSP packet to the autonomous system for flooding.
  • the border router advertises the deletion of all corresponding border connection information, and floods the broadcast corresponding to the LSP message.
  • the specific procedure of the LSP packet is similar to the above (2) case.
  • an LSP packet containing all the boundary connection information may be found, and the LSP packet is aged and the boundary connection information carried in the aging LSP packet is flooded to the internal part of the system.
  • the above embodiment is exemplified by including one or more boundary connection information in the Value field of the boundary connection description Sub-TLV field.
  • the Router_ID and the AS Number in a boundary connection information may be respectively included in the Value field of two different boundary connection description Sub-TLV fields, and the two boundary connections may be described as Sub.
  • the -TLV field is included in the same TLV field, so that the correspondence between the Router_ID and the AS Number can be identified.
  • boundary connection description Sub-TLV field is included in the ISIS Routing Capability TLV field.
  • the boundary connection description Sub-TLV field may also be included in the IS reachability.
  • Other types of TLV fields such as TLV field, IP reachability TLV field, or Inter-AS reachability TLV field.
  • the router of the autonomous system can further establish and maintain a boundary connection information table locally according to the boundary connection information received in step 103A.
  • the autonomous system includes multiple border routers and multiple internal routers, if the link between the internal router and the border router is disconnected or the link between the internal routers is disconnected, etc. If the internal router fails to receive the update packet from the border router, the internal router deletes all relevant boundary connection information in the local border connection information table, and aging the previously received LSP packet carrying the border connection information. And the flooding broadcasts the boundary connection information carried in the aging LSP packet.
  • the maintenance of the boundary connection information table by the internal router generally includes the following three cases:
  • the boundary connection information table is updated according to the boundary connection information carried in the LSP message.
  • the boundary connection information table established by the method according to the embodiment of the present invention may be a linked list, and the linked list is various in form.
  • the boundary connection information table is generally indexed by an external neighboring autonomous system number that has a connection relationship with the autonomous system, and each external neighboring autonomous system number corresponds to one or more neighbor border routers.
  • the identity, each neighbor border router identifier corresponds to one or more border router identifiers.
  • the border router refers to a border router of the autonomous system, and the neighbor border router is a border router of the external neighboring autonomous system connected to the autonomous system border router.
  • FIG. 4 is a network scenario diagram of a method for advertising autonomous system boundary connection information according to an embodiment of the present invention.
  • the method of the invention is In a network scenario of a PCE model, the network scenario consists of three autonomous systems connected in sequence. These three autonomous systems are defined as AS100, AS200, and AS300.
  • the autonomous system AS200 includes three interconnected border routers R4, R5, R6 and an internal path calculation unit PCE2 connected to the three border routers, wherein the border router R4 and the external neighboring autonomous system AS100
  • the border router R2 is connected
  • the border router R5 is connected to the border router R3 in the external neighboring autonomous system AS100
  • the border router R6 is connected to the border routers R7 and R8 in the external neighboring autonomous system AS300.
  • the three-edge routers R4, R5, and R6 in the autonomous system AS200 respectively establish and maintain respective boundary connection information when the path calculation unit PCE2 needs to know the boundary connection information of the AS 200 in which the path calculation is performed.
  • the border connection information is carried in the LSP packet and flooded to the autonomous system.
  • the path calculation unit PCE2 receives the boundary connection information of the above-mentioned three-edge router, and establishes a boundary connection information table locally.
  • the boundary connection information table is shown in FIG. 5.
  • FIG. 5 is a boundary connection information table established by applying the method for notifying the boundary connection information of the autonomous system in the embodiment of the present invention in the network scenario shown in FIG. Figure 5 is a linked list of adjacent autonomous system numbers, including the autonomous system border router identifiers and neighboring border router identifiers in adjacent autonomous systems connected to it.
  • each of the three border routers R4, R5, and R6 will receive boundary connection information from the other two border routers, and locally establish a boundary connection information as shown in FIG. 5. table.
  • the border router R6 of the autonomous system AS200 and the border router R8 of the autonomous system AS300 When the connection between the border router R6 of the autonomous system AS200 and the border router R8 of the autonomous system AS300 is disconnected, the border router R6 will advertise the deletion of the boundary connection information including the autonomous system AS300 number and the border router R8 identifier. And the corresponding LSP packet is found, and the binary group information consisting of the autonomous system AS300 number and the border router R8 identifier in the sub-TLV field of the LSP packet is deleted, and the LSP is reported. After the message is refreshed, the update information carried in the LSP packet is self-directed. The flooding broadcast is performed within the system so that all routers in the AS200 can update the locally established boundary connection information table in time.
  • the PCE2 deletes the local border connection information.
  • the table all the boundary connection information about the border router R4 is generated, and an aging LSP packet is generated, and the boundary connection information carried in the aging packet is flooded and broadcasted in the system.
  • the router of the autonomous system supports the OSPF protocol.
  • the following takes the OSPF protocol supported by the router of the autonomous system as an example to describe in detail the method for advertising the boundary information of the autonomous system shown in Figure 1.
  • Step 101B The border router of the autonomous system establishes and maintains the boundary connection information of the autonomous system. This step is the same as step 101A in the first embodiment, and details are not described herein again.
  • Step 102B The border router floods the boundary connection information in the autonomous system.
  • a link TLV field is defined.
  • the boundary connection information may be included in the Link TLV field, and the specific inclusion manner may be three types:
  • the Router_ID in the boundary connection information is included in the Value field of the Link ID Sub-TLV field defined in the OSPF protocol, and the AS Number in the boundary connection information is included in the boundary connection description Sub-TLV.
  • Field's Value field The Link ID Sub-TLV and the Border Connection Description Sub-TLV are both included in the Link TLV field.
  • the Router_ID can be represented by 4 or 16 bytes, and the AS Number can be represented by 4 bytes.
  • the Link TLV field is included in the Link State Advertisement (LSA) packet, and the LSA packet is flooded.
  • OSPF defines a variety of LS A packets, such as Router Information (RI) LSA packets and non-transparency (Opaque) LSA packets.
  • the LSA packet can contain one or more Link TLV fields.
  • This embodiment can control flooding of border connection information throughout the autonomous system or flooding in a specific routing area.
  • the method of control is the same as that of the first embodiment.
  • the routing area refers to an autonomous domain in an autonomous system that supports OSPF.
  • the border router updates the corresponding Link TLV field in time, and refreshes the corresponding LSA message, and then floods the boundary connection information carried in the LSA message to the internal autonomous system. broadcast.
  • the border router After the border router broadcasts the LSA packet for the first time, the border router does not save the flooded LSA packet. Therefore, when the border connection information changes, the border router regenerates the updated boundary. The LSA packet of the information is flooded and the regenerated LSA packet is flooded.
  • the border router of the autonomous system establishes a neighbor connection relationship with a border router in an external neighboring autonomous system according to the BGP protocol.
  • the border router reports the LSA according to the dynamic change of the boundary connection information.
  • FIG. 6 is a flowchart of a method for supporting an AU protocol to notify autonomous system boundary connection information when adding boundary connection information according to an embodiment of the present invention. Includes the following steps:
  • Step 601 The border router obtains the newly added border connection information, where the border connection information includes the neighbor border router identifier and the neighboring autonomous system number thereof.
  • Step 602 Determine the RI LSA packet saved by the border router. Whether there is a Link TLV field, if yes, step 603 is performed; if not, step 604 is performed.
  • Step 603 Add the new boundary connection information to the Link TLV field of the RI LSA packet. The manner of the specific inclusion is described in step 102B, and details are not described herein again. Continue to step 605.
  • Step 604 Generate a new Link TLV field, add the newly added boundary connection information to the newly generated Link TLV field, and proceed to step 605.
  • Step 605 Refresh the RI LSA message
  • Step 606 Broadcast the RI LSA packet carrying the newly added border connection information to the autonomous system.
  • FIG. 7 is a flowchart of the method for supporting the OSPF protocol to notify the boundary connection information of the autonomous system in deleting the boundary connection information according to the embodiment of the present invention
  • Step 701 The border router obtains the boundary connection information to be deleted.
  • Step 702 Determine whether the RI LSA packet saved by the border router is already present. The Link TLV field containing the boundary information to be deleted is deleted. If not, step 703 is performed; if yes, step 704 is performed.
  • Step 703 Generate an error message to end the current process.
  • Step 704 Delete boundary connection information in the Link TLV field, and update the Link TLV field.
  • Step 705 Refresh the RI LSA packet including the Link TLV field.
  • Step 706 Broadcast the RI LSA packet to the autonomous system.
  • the border router advertises the deletion of all corresponding border connection information, and correspondingly updates the RI LSA message after the RI
  • the LSA message is flooded to the system, and the specific process is similar to the above (2) case.
  • an RI LSA packet containing all the boundary connection information may be found, the RI LSA packet is aged, and the aging RI LSA packet is flooded to the system.
  • the Link TLV field is included in the RI LSA message.
  • the Link TLV field may be included in other types of LSA messages, such as Opaque LSA messages.
  • the LSA packet can be flooded in a routing area of the autonomous system, that is, an autonomous domain.
  • Step 103B The router of the autonomous system receives the boundary connection information. This step is the same as step 103A in the first embodiment, and details are not described herein again.
  • the router of the autonomous system can further establish and maintain a boundary connection information table locally according to the boundary connection information received in step 103B.
  • the specific method for establishing the boundary connection information table is the same as that of the first embodiment, and details are not described herein again.
  • the embodiment of the present invention further provides a boundary node for notifying the boundary connection information of the autonomous system by using the foregoing method.
  • FIG. 8 is a schematic disclosure of an autonomous system boundary connection according to an embodiment of the present invention.
  • the boundary node mainly includes:
  • a boundary connection information collection module is configured to obtain boundary connection information established by the boundary node.
  • boundary connection information database configured to store boundary connection information of the autonomous system, including boundary connection information established by the boundary node
  • a message generating module configured to encapsulate the boundary connection information established by the border node in the packet
  • the message advertisement module is configured to flood the message formed in the message generation module to the autonomous system.
  • the boundary node can further include:
  • a message receiving module configured to receive a message sent by another border node in the autonomous system
  • a packet processing module configured to perform parsing processing on the packet received by the packet receiving module, obtain boundary connection information of the autonomous system from the packet, and store the obtained boundary connection information in the boundary connection In the information database.
  • the message advertisement module may be further configured to advertise the message received by the message receiving module.
  • the method for informing the autonomous system boundary connection information and the border node in the embodiment of the present invention carry the dynamic boundary information of the autonomous system in the LSP packet or the LSA packet to perform dynamic dynamics in the system.
  • the notification not only adapts to the dynamic changes of the network topology, but also updates the boundary connection information obtained by the internal nodes of the system, effectively supports the TE path calculation between the autonomous systems, optimizes the overall performance of the network, improves the network service quality, and can also solve
  • the problem of large workload, wasted time, and error-prone caused by the configuration of the boundary connection information by the static manual configuration technology is improved, the processing efficiency is improved, the network maintenance cost is reduced, and the system can be applied to multiple autonomous systems. In a large network system.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Description

一种通告自治系统边界连接信息的方法和边界节点
技术领域
本发明涉及通信技术领域, 特别涉及一种通告自治系统边界连接信 息的方法和边界节点。 发明背景
随着网络的不断扩大, 数据业务量的不断增长, 业务的日趋复杂, 使现有网络负担过重, 已经无法满足要求, 迫切需要进行网络优化。
流量工程(Traffic Engineering, TE )应运而兴, 其关注网络整体性 能的优化, 主要目标是方便地提供高效的、 可靠的网络服务, 优化网络 资源的使用, 优化网络流量。 根据流量工程作用的范围不同, 可分为域 内流量工程和域间流量工程。 目前, 域内的流量工程技术已经相对比较 成熟, 主要方法是通过传统的内部网关协议 (interior gateway protocol, IGP)扩展, 如开放式最短路径优先-流量工程的扩展 (Open Shortest Path First Traffic Engineering, OSPF-TE)、 中间系统中间系统-流量工程 (Intermediate System to Intermediate System Traffic Engineering, ISIS-TE) 的扩展等, 在域内洪泛链路的 TE信息, 从而实现域内的流量工程数据 库 ( Traffic Engine Database, TED ) 同步。
通常在包含多个自治系统( Autonomous System, AS )的大型网络 中, 出于扩展性以及安全性方面的考虑, 不能将各个自治系统内部的 TE信息洪泛到自治系统外部。 因此, 为了获得自治系统间的流量工 程 TE路径, 目前主要有两种路径计算方式: 一种方式是采用路径计 算单元 ( Path Computation Element, PCE ) 协作计算, 在自治系统内 部有一个或者多个 PCE负责本自治系统的路径计算, 通过与其它自治 系统的 PCE协作来完成自治系统间的路径计算; 另一种方式是采用显 示路由的方式, 显示指定路径的 AS序列或者指定自治系统边界路由
H ( Autonomous System Border Router, ASBR ) 的 IP地址序歹 'J , 然后 由标签交换路由器(Label Switched Router, LSR )根据指定信息完成 自治系统间的路径计算。 不管采用上述哪一种计算方式, 负责 TE路 径计算的路径计算单元 PCE或者标签交换路由器 LSR都需要知道其所 在自治系统与外部相邻自治系统之间的边界连接信息,所述边界连接 信息即指路径计算节点所在自治系统的边界路由器 ASBR与外部相邻 自治系统的边界路由器 ASBR之间建立或删除连接关系的信息。
目前尚未有方案提出如何通告自治系统边界连接信息,通常只是 在系统内部节点需要的时候进行静态手工配置。 然而, 静态手工配置 方法最显著的缺点是不能适应网络拓朴的动态变化, 因而无法有效地 支持自治系统间 TE路径计算, 进而难以实现网络整体性能的优化。 当自治系统边界连接信息发生变化,譬如某一边界节点与相邻自治系 统中对应的邻居边界节点连接断开时,如果所述自治系统内部负责路 径计算的节点是通过静态手工配置方法获得本系统边界连接信息,则 往往无法及时获知上述边界连接信息的变化,仍旧会依据先前静态配 置的信息进行路径计算, 在计算过程中才能够发现路径不可用, 并且 需要通过手工修改重新进行配置。 此外, 当自治系统边界连接关系比 较复杂时, 静态手工配置方法还存在工作量大, 耗时长, 处理效率低 而成本高等问题, 并且容易因人为疏失出现误配、 漏配的情况。 发明内容
有鉴于此,本发明实施例的一个主要目的在于提供通告自治系统 边界连接信息的方法,另一个主要目的在于提供通告自治系统边界连 接信息的边界节点, 以适应网络拓朴的动态变化, 及时将自治系统边 界连接信息向系统内部进行动态通告。
为达到上述目的, 本发明的技术方案是这样实现的:
本发明实施例公开了一种通告自治系统边界连接信息的方法, 该 方法包括: 自治系统的边界节点建立并维护该自治系统的边界连接信 息; 在自治系统内洪泛广播所述边界连接信息; 自治系统的节点接收所 述边界连接信息。
本发明实施例还公开了一种通告自治系统边界连接信息的边界节 点, 所述边界节点包括:
边界连接信息收集模块, 用于获得由所述边界节点建立的边界连接 信息;
边界连接信息数据库, 用于存放所述自治系统的边界连接信息, 包 括由所述边界节点建立的边界连接信息;
报文生成模块, 用于将所述边界节点建立的边界连接信息封装于报 文中;
报文通告模块, 用于将所述报文生成模块中形成的所述报文向所述 自治系统内洪泛广播。 附图简要说明
图 1为本发明实施例通告自治系统边界连接信息的方法流程图; 图 2为本发明实施例支持 ISIS协议的通告自治系统边界连接信息 的方法在新增边界连接信息时的流程图;
图 3为本发明实施例支持 ISIS协议的通告自治系统边界连接信息 的方法在删除边界连接信息时的流程图;
图 4为应用本发明实施例通告自治系统边界连接信息的方法的网络 场景图;
图 5为在图 4所示的网络场景中应用本发明实施例通告自治系统边 界连接信息的方法建立的边界连接信息表;
图 6为本发明实施例支持 OSPF协议的通告自治系统边界连接信 息的方法在新增边界连接信息时的流程图;
图 7为本发明实施例支持 OSPF协议的通告自治系统边界连接信 息的方法在删除边界连接信息时的流程图;
图 8为本发明实施例通告自治系统边界连接信息的边界节点。 实施本发明的方式
本发明提出一种通告自治系统边界连接信息的方法, 参见图 1 , 图 1为本发明实施例通告自治系统边界连接信息的方法流程图。该方 法包括:
步骤 101 : 自治系统的边界节点建立并维护该自治系统的边界连接 信息;
步骤 102: 在自治系统内洪泛广播所述边界连接信息;
步骤 103: 自治系统的节点接收所述边界连接信息。
本发明通告自治系统边界连接信息的方法通常适用于包含多个 自治系统的大型网络内。实现本发明方法的自治系统包括至少两个节 点, 所述节点互相连接, 并且其中至少一个是用于与外部相邻自治系 统建立邻居连接关系的边界节点,另一个节点可以是负责所述自治系 统内部报文转发的内部节点、也可以是另一个可与所述自治系统的外 部建立邻居连接关系的边界节点。 在本发明实施例中, 所述自治系统 包括多个边界节点与内部节点。所述边界节点与内部节点可以是一对 一的连接关系, 也可以是一对多或多对多的连接关系。 此外, 所述边 界节点与内部节点可以选用路由器或具有路由功能的其他网络设备。 本发明实施例通告自治系统边界连接信息的方法中, 自治系统的节 点可以支持 ISIS协议、 或者支持 OSPF协议。 下面通过实施例详细说明 书本发明的技术方案。
实施例一
在本实施例中, 用路由器作为自治系统节点进行说明。 下面以自 治系统的路由器支持 ISIS协议为例,详细介绍图 1中所示的通告自治系 统边界连接信息的方法。
步骤 101A: 自治系统的边界路由器建立并维护该自治系统的边界 连接信息;
步骤 101A 中的边界连接信息可以是通过边界网关协议(Border Gateway Protocol, BGP )获得的, 建立并维护自治系统边界连接信息的 过程可以为: 当所述边界路由器与外部相邻自治系统的邻居边界路由器 建立连接关系时, 建立对应的边界连接信息; 当所述边界路由器与外部 相邻自治系统的邻居边界路由器建立的连接断开时, 删除对应的边界连 接信息;
或者, 步骤 101A中的边界连接信息也可以是通过静态手工配置获 得的, 这种情况下, 建立并维护自治系统边界连接信息的过程可以为: 边界路由器接收用户的手动输入, 当所述边界路由器与外部相邻自治系 统的邻居边界路由器间链路为可用状态时, 建立对应的边界连接信息; 当所述边界路由器与外部相邻自治系统的邻居边界路由器间链路为不 可用状态时, 删除对应的边界连接信息。
所述边界连接信息包括相邻自治系统中的邻居边界路由器标识 ( RouterJD ) 以及相邻自治系统编号 ( AS Number )。
步骤 102A: 边界路由器在自治系统内洪泛广播所述边界连接信息。 由于边界路由器支持 ISIS协议,本发明实施例定义了一种边界连 接描述 Sub-TLV ( ASBR Connection Descriptor Sub-TLV ) 字段, 用于 携带自治系统边界连接信息, 向自治系统内部通告。 可以将边界连接 信息包含于一个边界连接描述 Sub-TLV字段的值(value )字段中, 也 可以将边界连接信息中的 Router_ID和 AS Number分别包含于两个边 界连接描述 Sub-TLV字段的 value字段中。 其中, Router_ID可以用 4 或 16个字节来表示, AS Number可以用 4个字节来表示。
之后,可以将边界连接描述 Sub-TLV ( ASBR Connection Descriptor Sub-TLV ) 字段包含于标签交换路径 (Label Switch Path, LSP )报文 中的类型-长度-值 ( Type-Length- Value, TLV ) 字段中。 ISIS协议中 定义了多种包含于 LSP报文中的 TLV字段,如 ISIS路由能力(Router Capability ) TLV字段、 中间系统可达性( IS Reachability ) TLV字段、 互联网协议可达性(IP Reachability ) TLV字段、 域间可达性( Inter- AS Reachability ) TLV字段等。 上述 TLV字段中包含一个或者多个可变长 的子 TLVs ( Sub-TLVs )字段, 并且所有 Sub-TLV的长度总和不能超 过 250个字节, 所有 Sub-TLV字段均可扩展。 并且, 在 TLV字段中 定义了标识洪泛范围和洪泛方向的字段,可以通过在标识洪泛范围和 洪泛方向的字段内携带特定值 1来选择在整个自治系统内洪泛广播、 或者通过在标识洪泛范围和洪泛方向的字段内携带特定值 2 来选择 在一个特定路由区域内洪泛广播。 所述的路由区域, 在支持 ISIS 协 议的自治系统中指的是层 (level ) 。
利用新定义的边界连接描述 Sub-TLV字段,步骤 102A支持 ISIS协 议的边界路由器在自治系统内洪泛广播边界连接信息具体可以为: 边界 路由器将边界连接信息包含于边界连接描述 Sub-TLV字段中,并将边界 连接描述 Sub-TLV字段包含于 TLV字段中, 并将 TLV字段包含于 LSP 报文中,洪泛广播 LSP报文。并且边界路由器保存洪泛广播的 LSP报文。 当所述边界连接信息发生变化时, 所述边界路由器将及时更新对 应的边界连接描述 Sub-TLV字段, 并刷新其保存的对应 LSP报文后 将该 LSP报文中携带的边界连接信息向自治系统内部洪泛广播。
当然, 边界路由器首次洪泛广播 LSP报文后,也可以不保存洪泛广 播的 LSP报文, 这样, 在边界连接信息发生变化时, 边界路由器就会重 新生成包含更新后的边界连接信息的 LSP报文, 并将重新生成的 LSP 报文洪泛广播出去。
在步骤 102A中, 一般情况下, LSP报文的 TLV字段中所携带的 边界连接信息会在整个自治系统内洪泛广播。 但是在某些情况下, 比 如所有的边界路由器和所有需要获得边界连接信息的 PCE都在同一 个层时, 因为除 PCE之外, 其他的路由器并不需要获得边界连接信 息, 此时, 为了减少无谓的洪泛广播, 用户可以根据实际需求进行配 置使得信息仅在所有边界路由器和所有 PCE所在的层内泛洪广播。 配置的方法是采用上述标识洪泛范围和洪泛方向的字段, 将 TLV字 段的洪泛范围控制在所有边界路由器和所有 PCE所在的层内。
步骤 103A: 自治系统的路由器接收所述边界连接信息。
用户可以根据需要对所述自治系统的路由器进行配置。当所述自 治系统的路由器收到 LSP报文时, 如果不需要 LSP报文中携带的边界 连接信息, 则仅对该报文进行转发, 并不获取报文中所携带的信息。 譬如在自治系统内包含一个或多个 PCE的网络场景中, 无需进行路径 计算的普通内部路由器在接收到携带边界连接信息的 LSP报文后将 只对 LSP报文进行转发, 而负责路径计算的 PCE在接收到 LSP报文后 将从 LSP报文中获取边界连接信息, 以支持路径计算的实现。
以所述自治系统的边界路由器是根据 BGP协议与外部相邻自治系 统中的边界路由器建立邻居连接关系为例, 在上述步骤 102A中, 根据 边界连接信息的动态变化, 所述边界路由器对 LSP报文的通告处理 可进一步归纳为以下三种情况:
( 1 ) 当所述边界路由器与外部相邻自治系统中的一个邻居边界 路由器建立起连接关系时,所述边界路由器中将通告增加一项边界连 接信息, 此时所述边界路由器将所述边界连接信息携带于 LSP报文并 向本自治系统内洪泛广播, 其具体过程如图 2所示, 图 2为本发明实施 例支持 ISIS协议的通告自治系统边界连接信息的方法在新增边界连 接信息时的流程图。 包括以下步骤:
步骤 201 : 所述边界路由器获得新增的边界连接信息, 所述边界 连接信息包括所述邻居边界路由器标识及其所在相邻自治系统编号。
步骤 202:判断边界路由器保存的 LSP报文中是否有 ISIS路由器能 力 TLV字段, 如果有, 则执行步骤 203; 如果没有, 则执行步骤 205。
步骤 203: 判断所述 ISIS路由器能力 TLV字段是否有足够空间可 添加新增边界连接信息, 如果有, 则执行步骤 204; 如果没有, 则执 行步骤 205。
由于 ISIS路由器能力 TLV字段中所有 Sub-TLV字段的长度总和不 能超过 250个字节, 因此步骤 203中判断的具体方式为: 判断在 ISIS路 由器能力 TLV字段中, 如果增加步骤 201中所述的边界连接信息, 该 ISIS路由器能力 TLV中所有 Sub-TLV字段的长度总和是否会超过 250 个字节。 如果超过 250个字节, 则说明 ISIS路由器能力 TLV字段没有 足够空间可添加新增边界连接信息; 否则, 说明有足够空间。
步骤 204: 将新增的边界连接信息添加到 ISIS路由器能力 TLV字 段中的边界连接描述 Sub-TLV字段中, 继续执行步骤 206。
本步骤添加边界连接信息的方式可以有 2种方式: 如果 ISIS路由 器能力 TLV字段中已有边界连接描述 Sub-TLV字段, 则可以将新增的 边界连接信息添加到 ISIS路由器能力 TLV字段中已有的边界连接描 述 Sub-TLV字段中; 如果 ISIS路由器能力 TLV字段中没有边界连接描 述 Sub-TLV字段, 则可以新建一个边界连接描述 Sub-TLV字段, 将新 增的边界连接信息添加到 ISIS路由器能力 TLV字段中新建的边界连 接描述 Sub-TLV字段中。
步骤 205: 在所述 LSP报文中新建一个 ISIS路由器能力 TLV字段, 将新增的边界连接信息添加新建的到 ISIS路由器能力 TLV字段中的 边界连接描述 Sub-TLV字段中, 继续执行步骤 206。
步骤 206: 刷新所述 LSP艮文;
步骤 207: 将所述 LSP报文在自治系统内洪泛广播。
( 2 ) 当所述边界路由器与外部相邻自治系统中的一个邻居边界 路由器连接断开时, 所述边界路由器中通告删除对应的边界连接信 息, 并对应更新 LSP报文后将该 LSP报文中的更新信息向自治系统 内部洪泛广播,其具体过程如图 3所示,图 3为本发明实施例支持 ISIS 协议的通告自治系统边界连接信息的方法在删除边界连接信息时的 流程图。 包括以下步骤:
步骤 301 : 所述边界路由器获得待删除的边界连接信息。
步骤 302: 判断边界路由器所保存的 LSP报文的 ISIS路由器能 力 TLV字段中是否已有包含所述待删除边界连接信息的边界连接描 述 Sub-TLV字段, 如果没有, 则执行步骤 303; 如果有, 则执行步骤 304。
步骤 303: 生成一个错误提示信息, 结束当前流程。
步骤 304:删除所述边界连接描述 Sub-TLV字段中的边界连接信 息, 并更新边界连接描述 Sub-TLV字段; 步骤 305: 刷新包括所述边界连接描述 Sub-TLV字段的 LSP报 文;
步骤 306: 将所述 LSP报文向自治系统内洪泛广播。
( 3 ) 当所述边界路由器的 BGP协议被删除或所有的外部连接关系 全部断开时, 所述边界路由器中将通告删除所有对应的边界连接信息, 并对应更新 LSP报文后洪泛广播该 LSP报文,其具体过程与上述第( 2 ) 种情况类似。 另外, 也可找到包含所有边界连接信息的 LSP报文, 将所 述 LSP报文老化并将该老化的 LSP报文中携带的边界连接信息向系统内 部洪泛广播。
上述实施例是以边界连接描述 Sub-TLV字段的 Value字段中包含 一个或者多个边界连接信息为例。 在本发明的其他实施例中, 也可以 将一个边界连接信息中的 Router_ID和 AS Number分别包含于两个不 同的边界连接描述 Sub-TLV字段的 Value字段中,可以将这两个边界 连接描述 Sub-TLV字段包含于同一个 TLV字段中, 这样就能够识别 出 Router_ID与 AS Number的对应关系。在删除或者增加边界连接信息 时, 需要分别在两个边界连接描述 Sub-TLV字段中增加或者删除边界 连接信息中的 Router_ID与 AS Number。
并且, 上述实施例是以边界连接描述 Sub-TLV字段包含于 ISIS 路由能力 TLV字段中为例, 在本发明的其他实施例中, 也可以将边 界连接描述 Sub-TLV字段包含于 IS可达性 TLV字段、 或者 IP可达性 TLV字段、 或者 Inter-AS 可达性 TLV字段等其他种类的 TLV字段中。
上述步骤 103A之后,自治系统的路由器可以根据步骤 103A中接收 到的边界连接信息, 进一步在本地建立并维护一个边界连接信息表。
当所述自治系统包括多个边界路由器和多个内部路由器时, 若由于 内部路由器与边界路由器间链路断开或内部路由器间链路断开等原因 导致内部路由器无法收到来自边界路由器的更新报文, 则所述内部路由 器将删除本地边界连接信息表中的所有相关边界连接信息, 同时将老化 先前所收到的携带有边界连接信息的 LSP报文并将洪泛广播所述老化 的 LSP报文中携带的边界连接信息。
除以上所述情况外, 所述内部路由器对边界连接信息表的维护大致 还包括以下三种情况:
( 1 ) 当收到一个有效的 LSP报文, 并且其中含有携带边界连接信 息的边界连接描述 Sub-TLV字段时, 则将根据所述 LSP报文中携带的 边界连接信息更新边界连接信息表。
( 2 ) 当收到一个老化的 LSP报文, 并且其中含有携带边界连接信 息的边界连接描述 Sub-TLV字段时, 则根据所述 LSP报文中携带的边 界连接信息, 对应删除所述边界连接信息表中的边界连接信息。
( 3 ) 当 ISIS协议被删除时, 所述内部路由器将删除整个边界连接 信息表。
根据本发明实施例方法建立的边界连接信息表可以是一个链表, 所 述链表形式多样。 在本发明实施例中, 所述边界连接信息表通常是以与 所述自治系统有连接关系的外部相邻自治系统编号为索引, 每个外部相 邻自治系统编号对应一个或多个邻居边界路由器标识, 每个邻居边界路 由器标识又对应一个或多个边界路由器标识。 其中, 所述边界路由器是 指所述自治系统的边界路由器, 所述邻居边界路由器是与所述自治系统 边界路由器相连的所述外部相邻自治系统的边界路由器。
为更清楚的阐述本发明方法, 下面将介绍一个由边界路由器利用本 发明方法向其所在系统内部通告边界连接信息并在系统内部路由器上 建立边界连接信息表的具体应用实例。 如图 4所示, 图 4为应用本发明 实施例通告自治系统边界连接信息的方法的网络场景图。 本发明方法是 应用于一个 PCE模型的网络场景中,该网络场景是由依序相连的三个自 治系统组成, 这三个自治系统分别定义为 AS100、 AS200、 AS300。 所 述自治系统 AS200中包括三个互连的边界路由器 R4、 R5、 R6和一个与 所述三个边界路由器相连的内部路径计算单元 PCE2, 其中所述边界路 由器 R4与外部相邻自治系统 AS100中的边界路由器 R2相连, 所述边 界路由器 R5与外部相邻自治系统 AS100中的边界路由器 R3相连, 边 界路由器 R6与外部相邻自治系统 AS300中的边界路由器 R7和 R8相连。 当所述路径计算单元 PCE2 为进行路径计算需要了解其所在自治系统 AS200的边界连接信息时,所述自治系统 AS200中的三边界路由器 R4、 R5、 R6 将分别建立并维护各自的边界连接信息, 并将所述边界连接信 息携带于 LSP报文中向自治系统内进行洪泛广播。 所述路径计算单元 PCE2接收到上述三边界路由器的边界连接信息, 并在本地建立一个边 界连接信息表。 所述边界连接信息表如图 5所示, 图 5为在图 4所示的 网络场景中应用本发明实施例通告自治系统边界连接信息的方法建立 的边界连接信息表。 图 5是一张以相邻自治系统编号为索引, 包含本自 治系统边界路由器标识以及与之相连的相邻自治系统中邻居边界路由 器标识的链表。 此外, 在本实施例中, 所述三边界路由器 R4、 R5、 R6 中的每一个都将收到来自另外两个边界路由器的边界连接信息, 在本地 建立一个如图 5所示的边界连接信息表。
当所述自治系统 AS200的边界路由器 R6与自治系统 AS300的边界 路由器 R8间的连接关系断开,则所述边界路由器 R6中将通告删除包含 自治系统 AS300编号及边界路由器 R8标识的边界连接信息, 并找到已 保存的对应的 LSP报文, 删除所述 LSP报文的边界连接描述 Sub-TLV 字段中由上述自治系统 AS300编号及边界路由器 R8标识组成的二元组 信息,再将所述 LSP报文刷新后将所述 LSP报文中携带的更新信息向自 治系统内洪泛广播,以使所述自治系统 AS200内所有路由器都能及时更 新本地建立的边界连接信息表。
当所述路径计算单元 PCE2与所述边界路由器 R4间链路出现故障, 以致所述 PCE2收不到所述边界路由器 R4发送的周期更新的边界连接 信息时, 所述 PCE2将删除本地边界连接信息表中所有关于边界路由器 R4的边界连接信息, 同时生成一个老化的 LSP报文, 并将所述老化报 文中携带的边界连接信息在系统内部洪泛广播。
实施例二
在本实施例中, 自治系统的路由器支持 OSPF协议。 下面以自治系 统的路由器支持 OSPF协议为例, 详细介绍图 1中所示的通告自治系统 边界连接信息的方法。
步骤 101B: 自治系统的边界路由器建立并维护该自治系统的边界连 接信息。 本步骤与实施例一中的步骤 101A相同, 在此不再赘述。
步骤 102B: 边界路由器在自治系统内洪泛广播所述边界连接信息。 在 OSPF协议中, 定义了一种链接 ( Link ) TLV字段, 本发明实施 例可以将边界连接信息包含于 Link TLV字段中 , 具体的包含方式可以 有三种:
方式一: 将边界连接信息包含于边界连接描述 Sub-TLV 字段中的 Value字段中,并将边界连接描述 Sub-TLV字段包含于 Link TLV字段中。
方式二: 将边界连接信息中的 Router_ID和 AS Number分别包含于 两个不同的边界连接描述 Sub-TLV字段的 Value字段中, 将所述两个不 同的边界连接描述 Sub-TLV字段包含于 Link TLV字段中。
方式三、 将边界连接信息中的 Router_ID包含于 OSPF协议中已有 定义的链接标识( Link ID ) Sub-TLV字段的 Value字段中, 将边界连接 信息中的 AS Number包含于边界连接描述 Sub-TLV字段的 Value字段 中,将 Link ID Sub-TLV和边界连接描述 Sub-TLV都包含于 Link TLV字 段中。
其中, Router_ID可以用 4或 16个字节来表示, AS Number可以 用 4个字节来表示。
之后, 可以将 Link TLV 字段包含于链路状态通告 (Link State Advertisement, LSA )报文中, 并将 LSA报文洪泛广播。 OSPF协议 中定义了多种 LS A报文, 如路由信息( Router Information , RI ) LSA 报文、 非透明性 (Opaque ) LSA报文等。 上述 LSA报文中可以包含 一个或者多个 Link TLV字段。
本实施例可以控制将边界连接信息在整个自治系统内洪泛广播、 或者在一个特定路由区域内洪泛广播。控制的方法与实施例一的方法 相同。 所述的路由区域, 在支持 OSPF协议的自治系统中指的是自治 域。
当所述边界连接信息发生变化时, 所述边界路由器将及时更新对 应的 Link TLV字段, 并刷新其保存的对应 LSA报文后将该 LSA报 文中携带的边界连接信息向自治系统内部洪泛广播。
与实施例一类似, 边界路由器首次洪泛广播 LSA报文后, 也可以 不保存洪泛广播的 LSA报文, 这样, 在边界连接信息发生变化时, 边界 路由器就会重新生成包含更新后的边界连接信息的 LSA报文,并将重新 生成的 LSA报文洪泛广播出去。
以所述自治系统的边界路由器是根据 BGP协议与外部相邻自治系 统中的边界路由器建立邻居连接关系为例, 在上述步骤 102B中, 根据 边界连接信息的动态变化, 所述边界路由器对 LSA报文的通告处理 可进一步归纳为以下三种情况:
( 1 ) 当所述边界路由器与外部相邻自治系统中的一个邻居边界 路由器建立起连接关系时,所述边界路由器中将通告增加一项边界连 接信息,此时所述边界路由器将携带有边界连接信息的 RI LS A报文向 本系统内洪泛广播, 其具体过程如图 6所示, 图 6为本发明实施例支持 OSPF协议的通告自治系统边界连接信息的方法在新增边界连接信息 时的流程图。 包括以下步骤:
步骤 601 : 所述边界路由器获得新增的边界连接信息, 所述边界 连接信息包括所述邻居边界路由器标识及其所在相邻自治系统编号; 步骤 602: 判断边界路由器保存的所述 RI LSA报文中是否有 Link TLV字段, 如果有, 则执行步骤 603; 如果没有, 则执行步骤 604。
步骤 603: 将新增的边界连接信息添加到所述 RI LSA报文的 Link TLV字段中。 具体包含的方式在步骤 102B中已有描述, 在此不再赘述。 继续执行步骤 605。
步骤 604: 产生一个新的 Link TLV字段, 将新增的边界连接信息 添加到新产生的 Link TLV字段中, 继续执行步骤 605。
步骤 605: 刷新所述 RI LSA艮文;
步骤 606: 将所述携带有新增边界连接信息的 RI LSA报文向自治 系统内洪泛广播。
( 2 ) 当所述边界路由器与外部相邻自治系统中的一个邻居边界 路由器连接断开时, 所述边界路由器中通告删除对应的边界连接信 息, 并对应更新 RI LSA报文后将该 LSA报文向系统内部洪泛广播, 其具体过程如图 7所示, 图 7为本发明实施例支持 OSPF协议的通告 自治系统边界连接信息的方法在删除边界连接信息时的流程图;
包括以下步骤:
步骤 701 : 所述边界路由器获得待删除的边界连接信息; 步骤 702: 判断边界路由器保存的所述 RI LSA报文中是否已有 包含所述待删除边界连接信息的 Link TLV字段, 如果没有, 则执行 步骤 703; 如果有, 则执行步骤 704。
步骤 703: 生成一个错误提示信息, 结束当前流程。
步骤 704: 删除所述 Link TLV字段中的边界连接信息, 并更新 Link TLV字段;
步骤 705: 刷新包括所述 Link TLV字段的 RI LSA报文; 步骤 706: 将所述 RI LSA报文向自治系统内洪泛广播。
( 3 ) 当所述边界路由器的 BGP协议被删除或所有的外部连接关系 全部断开时, 所述边界路由器中将通告删除所有对应的边界连接信息, 并对应更新 RI LSA报文后将该 RI LSA报文向系统内部洪泛广播,其 具体过程与上述第 (2 )种情况类似。 另外, 也可找到包含所有边界连 接信息的 RI LSA报文, 将所述 RI LSA报文老化并将该老化的 RI LSA 才艮文向系统内部洪泛广播。
上述实施例是以 Link TLV字段包含于 RI LSA报文中为例,在本 发明的其他实施例中,也可以将 Link TLV字段包含于 Opaque LSA报 文等其他种类的 LSA报文中。
本实施例中, 也可以在自治系统的一个路由区域, 即一个自治域内 洪泛广播 LSA报文。
步骤 103B: 自治系统的路由器接收所述边界连接信息。本步骤与实 施例一中的步骤 103A相同, 在此不再赘述。
在步骤 103B之后, 自治系统的路由器可以根据步骤 103B中接收到 的边界连接信息, 进一步在本地建立并维护一个边界连接信息表。 建立 边界连接信息表的具体方法与实施例一相同, 在此不再赘述。
本发明实施例还提出一种采用上述方法通告自治系统边界连接信 息的边界节点, 如图 8所示, 图 8为本发明实施例通告自治系统边界连接 信息的边界节点。 该边界节点主要包括:
边界连接信息收集模块, 用于获得由所述边界节点建立的边界连接 信息。
边界连接信息数据库, 用于存放所述自治系统的边界连接信息, 包 括由所述边界节点建立的边界连接信息;
报文生成模块, 用于将所述边界节点建立的边界连接信息封装于报 文中;
报文通告模块, 用于将所述报文生成模块中形成的报文向所述自治 系统内洪泛广播。
该边界节点可以进一步包括:
报文接收模块, 用于接收由所述自治系统内部其他边界节点发送的 报文;
报文处理模块, 用于对所述报文接收模块所接收的报文解析处理, 从所述报文中获取所述自治系统的边界连接信息, 并将所得边界连接信 息存放于所述边界连接信息数据库中。
所述报文通告模块还可用于将所述报文接收模块所收到的报文转 发通告出去。
可见,本发明实施例所提供的通告自治系统边界连接信息的方法 和边界节点通过洪泛广播的方式, 将所述自治系统边界连接信息携带 于 LSP报文或 LSA报文中向系统内部进行动态通告, 不仅能适应网 络拓朴的动态变化, 及时更新系统内部节点所获得的边界连接信息, 有效地支持自治系统间 TE路径计算, 实现网络整体性能的优化, 提 高网络服务质量,并且还可解决现有采用静态手工配置技术进行边界 连接信息配置时所带来的工作量大、 浪费时间、 易出错等问题, 提高 了处理效率, 降低了网络维护成本, 并可适用于包含多个自治系统的 大型网络体系中。
以上只是对本发明的优选实施方式进行了描述,本领域的技术人 员在本发明技术的方案范围内, 进行的通常变化和替换, 都应包含在 本发明的保护范围内。

Claims

权利要求书
1、 一种通告自治系统边界连接信息的方法, 其特征在于, 该方法 包括:
自治系统的边界节点建立并维护该自治系统的边界连接信息; 在自 治系统内洪泛广播所述边界连接信息; 自治系统的节点接收所述边界连 接信息。
2、 如权利要求 1 所述的方法, 其特征在于, 所述建立并维护的边 界连接信息是通过边界网关协议 BGP或者通过静态手工配置获得的。
3、如权利要求 2所述的方法, 其特征在于, 当所述边界连接信息是 通过 BGP获得时,所述建立并维护边界连接信息为: 当所述边界节点与 外部相邻自治系统的邻居边界节点建立连接关系时, 建立并维护对应的 边界连接信息; 当所述边界节点与外部相邻自治系统的邻居边界节点建 立的连接断开时, 从自身保存的所有边界连接信息中删除对应的边界连 接信息;
当所述边界连接信息是通过静态手工配置获得的时, 所述建立并维 护边界连接信息为: 边界节点接收用户的手动输入, 当所述边界节点与 外部相邻自治系统的邻居边界节点间链路为可用状态时, 建立并维护对 应的边界连接信息; 当所述边界节点与外部相邻自治系统的邻居边界节 点间链路为不可用状态时, 从自身保存的边界连接信息中删除对应的边 界连接信息。
4、如权利要求 1所述的方法, 其特征在于, 所述边界连接信息包括 相邻自治系统中的邻居边界节点标识 Router_ID以及相邻自治系统编号 AS Number
5、 如权利要求 1 所述的方法, 其特征在于, 所述自治系统的节点 支持中间系统中间系统 ISIS协议。
所述在自治系统内洪泛广播所述边界连接信息为: 将所述边界节点 当前维护的边界连接信息包含于边界连接描述子类型长度值 Sub-TLV 字段中, 并将所述边界连接描述 Sub-TLV字段包含于 TLV字段中, 并 将所述 TLV字段包含于链路状态数据包 LSP报文中,洪泛广播所述 LSP 报文。
6、 如权利要求 5所述的方法, 其特征在于, 所述 TLV字段为 ISIS 路由能力 Router Capability TLV 字段、 或者中间系统可达性 IS Reachability TLV字段、或者互联网协议可达性 IP Reachability TLV字段、 或者域间可达性 Inter- AS Reachability TLV字段。
7、如权利要求 5所述的方法, 其特征在于, 所述将边界连接信息包 含于边界连接描述 Sub-TLV字段中为:
将所述边界连接信息包含于边界连接描述 Sub-TLV 字段中的值 Value字段中; 或者,将所述边界连接信息中的 Router_ID和 AS Number 分别包含于两个不同的边界连接描述 Sub-TLV字段的 Value字段中。
8、根据权利要求 5所述的方法, 其特征在于, 当所述边界节点上增 加边界连接信息时, 所述在自治系统内洪泛广播所述边界连接信息为: 判断所述 LSP报文中是否有可供增加边界连接信息的 TLV字段, 如果有,则将所述增加的边界连接信息包含于 TLV字段中的边界连接描 述 Sub-TLV字段中, 刷新所述 LSP报文, 洪泛广播所述刷新后的 LSP 报文; 如果没有, 则建立新的 TLV字段, 将所述增加的边界连接信息包 含于所述新建立的 TLV字段中的边界连接描述 Sub-TLV字段中, 刷新 所述 LSP报文, 洪泛广播刷新后的 LSP报文。
9、根据权利要求 5所述的方法, 其特征在于, 所述边界节点上删除 边界连接信息时, 所述在自治系统内洪泛广播所述边界连接信息为: 判断所述 LSP报文中是否已有包含所述待删除边界连接信息的边界 连接描述 Sub-TLV字段, 如果有, 则删除所述边界连接描述 Sub-TLV 字段中对应的边界连接信息, 并更新所述边界连接描述 Sub-TLV字段, 刷新所述 LSP报文, 洪泛广播刷新后的 LSP报文。
10、 根据权利要求 5所述的方法, 其特征在于, 所述边界节点上删 除边界连接信息时, 所述在自治系统内洪泛广播所述边界连接信息为: 查找包含所有待删除边界连接信息的 LSP报文,将所述 LSP报文老 化并将所述老化的 LSP报文向自治系统内部洪泛广播。
11、 如权利要求 1所述的方法, 其特征在于, 所述自治系统的节点 支持开放式最短路径优先 OSPF协议;
所述洪泛广播所述边界连接信息为: 将边界节点当前维护的边界连 接信息包含于链接 Link TLV字段中, 并将所述 Link TLV字段包含于链 路状态通告 LSA报文中, 洪泛广播所述 LSA报文。
12、 如权利要求 11所述的方法, 其特征在于, 所述 LSA >¾文为路 由信息 RI LSA报文、 或者非透明性 Opaque LSA报文。
13、 如权利要求 11所述的方法, 其特征在于, 所述将边界连接信息 包含于 Link TLV字段中为:
将所述边界连接信息包含于边界连接描述 Sub-TLV 字段中的值 Value字段中,再将所述边界连接描述 Sub-TLV字段包含于 Link TLV字 段中; 或者, 将所述边界连接信息中的 Router_ID和 AS Number分别包 含于两个不同的边界连接描述 Sub-TLV字段的 Value字段中, 再将所述 两个不同的边界连接描述 Sub-TLV字段包含于 Link TLV字段中;或者, 将所述边界连接信息中的 Router_ID包含于链接标识 Link ID Sub-TLV 字段的 Value字段中, 将所述边界连接信息中的 AS Number包含于边界 连接描述 Sub-TLV字段的 Value字段中, 再将所述 Link ID Sub-TLV和 边界连接描述 Sub-TLV包含于 Link TLV字段中。
14、 如权利要求 11所述的方法, 其特征在于, 所述边界节点上增加 边界连接信息时, 所述在自治系统内洪泛广播边界连接信息为:
判断所述 LSA 报文中是否有可供添加所述新增边界连接信息的 Link TLV字段, 如果有, 则将所述新增边界连接信息添加到所述 Link TLV字段中, 刷新所述 LSA报文, 洪泛广播刷新后的 LSA报文; 如果 没有, 则建立新的 Link TLV字段, 将所述增加的边界连接信息包含于 新建立的 Link TLV字段, 刷新所述 LSA报文, 洪泛广播刷新后的 LS A 报文。
15、 如权利要求 11所述的方法, 其特征在于, 所述边界节点上删除 边界连接信息时, 所述在自治系统内洪泛广播边界连接信息为:
判断所述 LSA报文中是否已有包含所述待删除边界连接信息,如果 有,则删除所述 Link TLV字段中对应的边界连接信息,并刷新所述 LSA 报文, 洪泛广播刷新后的 LS A报文。
16、 如权利要求 11所述的方法, 其特征在于, 所述边界节点上删除 边界连接信息时, 所述在自治系统内洪泛广播边界连接信息为:
查找包含所有待删除边界连接信息的 LSA报文, 将所述 LSA报文 老化并将所述老化的 LSA报文向自治系统内部洪泛广播。
17、 如权利要求 1所述的方法, 其特征在于, 所述在自治系统内洪 泛广播为: 采用标识洪泛范围和洪泛方向的字段, 将边界连接信息在 自治系统中的一个路由区域内洪泛广播。
18、 如权利要求 1所述的方法, 其特征在于, 所述自治系统的节点 接收边界连接信息之后进一步包括:
所述自治系统的节点根据所获取的边界连接信息建立并维护一个边 界连接信息表。
19、如权利要求 18所述的方法, 其特征在于, 所述边界连接信息表 是以与所述自治系统相连的外部相邻自治系统编号为索引, 每个所述相 邻自治系统编号对应一个或多个邻居边界节点标识, 每个所述邻居边界 节点标识与所述边界节点的标识对应。
20、如权利要求 18所述的方法, 其特征在于, 当所述自治系统的节 点收到的 LSP报文或 LSA报文是有效的报文时, 则根据所述 LSP报文 或 LSA报文中的边界连接信息更新所述边界连接信息表。
21、如权利要求 18所述的方法, 其特征在于, 当所述自治系统的节 点收到的 LSP报文或 LSA报文是老化的报文时, 则根据所述 LSP报文 或 LSA报文中携带的边界连接信息对应删除所述边界连接信息表中对 应的边界连接信息。
22、如权利要求 18所述的方法, 其特征在于, 当所述自治系统的节 点中的所述 ISIS协议或 OSPF协议被删除时, 所述自治系统的节点删除 所述边界连接信息表。
23、 一种通告自治系统边界连接信息的边界节点, 其特征在于, 所 述边界节点包括:
边界连接信息收集模块, 用于获得由所述边界节点建立的边界连接 信息;
边界连接信息数据库, 用于存放所述自治系统的边界连接信息, 包 括由所述边界节点建立的边界连接信息;
报文生成模块, 用于将所述边界节点建立的边界连接信息封装于报 文中;
报文通告模块, 用于将所述报文生成模块中形成的所述报文向所述 自治系统内洪泛广播。
24、 如权利要求 23所述的边界节点, 其特征在于, 所述边界节点进 一步包括:
所述报文接收模块, 用于接收由所述自治系统内部其他边界节点发 送的报文;
报文处理模块, 用于对所述报文接收模块所接收的报文解析处理, 从所述报文中获取所述自治系统的边界连接信息, 并将所得边界连接信 息存放于所述边界连接信息数据库中。
25、 如权利要求 24所述的边界节点, 其特征在于, 所述报文通告模 块还用于将所述报文接收模块所收到的报文转发通告出去。
PCT/CN2007/070679 2006-10-09 2007-09-12 Procédé et noeud limite pour l'annonce d'informations de connexion limite d'un système as WO2008055429A1 (fr)

Priority Applications (7)

Application Number Priority Date Filing Date Title
ES07801087.3T ES2452340T3 (es) 2006-11-09 2007-09-12 Un método y nodo de borde para el anuncio de información de conexión de borde de un sistema
EP07801087.3A EP2086189B1 (en) 2006-11-09 2007-09-12 A method and border node for advertising border connection information of a system
CN200780000353XA CN101517998B (zh) 2006-11-09 2007-09-12 一种通告自治系统边界连接信息的方法和边界节点
US12/463,218 US8270317B2 (en) 2006-11-09 2009-05-08 Method and apparatus for advertising border connection information of autonomous system
US12/895,292 US8125929B2 (en) 2006-10-09 2010-09-30 Method and apparatus for advertising border connection information of autonomous system
US13/595,721 US9276836B2 (en) 2006-11-09 2012-08-27 Method and apparatus for advertising border connection information of autonomous system
US14/925,954 US9397925B2 (en) 2006-11-09 2015-10-28 Method and apparatus for advertising border connection information of autonomous system

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
CNA200610063572XA CN101102325A (zh) 2006-11-09 2006-11-09 通告自治系统边界连接信息的方法和装置
CN200610063572.X 2006-11-09
CN200610156815.4 2006-11-10
CN2006101568154A CN101179488B (zh) 2006-11-10 2006-11-10 通告自治系统边界连接信息的方法和装置

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US12/463,218 Continuation US8270317B2 (en) 2006-10-09 2009-05-08 Method and apparatus for advertising border connection information of autonomous system

Publications (1)

Publication Number Publication Date
WO2008055429A1 true WO2008055429A1 (fr) 2008-05-15

Family

ID=39364183

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2007/070679 WO2008055429A1 (fr) 2006-10-09 2007-09-12 Procédé et noeud limite pour l'annonce d'informations de connexion limite d'un système as

Country Status (4)

Country Link
US (4) US8270317B2 (zh)
EP (2) EP2086189B1 (zh)
ES (1) ES2452340T3 (zh)
WO (1) WO2008055429A1 (zh)

Families Citing this family (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008055429A1 (fr) 2006-11-09 2008-05-15 Huawei Technologies Co., Ltd. Procédé et noeud limite pour l'annonce d'informations de connexion limite d'un système as
JP4682255B2 (ja) * 2009-03-11 2011-05-11 富士通株式会社 経路制御装置、経路制御方法及び経路制御プログラム
US9210069B2 (en) * 2009-08-26 2015-12-08 Nec Corporation Network operation system, network operation method and network operation program
CN102065512B (zh) * 2009-11-12 2013-08-07 中兴通讯股份有限公司 多层网络中区域边界控制的方法、建立连接的方法和系统
US8990411B2 (en) * 2010-04-22 2015-03-24 Microsoft Technology Licensing, Llc Dynamic connection management on mobile peer devices
US8542578B1 (en) * 2010-08-04 2013-09-24 Cisco Technology, Inc. System and method for providing a link-state path to a node in a network environment
US8773992B2 (en) 2010-10-11 2014-07-08 At&T Intellectual Property I, L.P. Methods and apparatus for hierarchical routing in communication networks
US8799880B2 (en) 2011-04-08 2014-08-05 Siemens Aktiengesellschaft Parallelization of PLC programs for operation in multi-processor environments
US9124960B2 (en) * 2012-05-16 2015-09-01 Ciena Corporation Intelligent and scalable routing in multi-domain optical networks
US9112793B2 (en) * 2012-05-31 2015-08-18 International Business Machines Corporation End-to-end multipathing through network having switching devices compatible with different protocols
US9118573B2 (en) 2012-05-31 2015-08-25 International Business Machines Corporation Multipath effectuation within singly contiguous network fabric via switching device routing logic programming
JP6125019B2 (ja) * 2012-09-07 2017-05-10 レスピラトリー・モーション・インコーポレイテッド 電極パッドセット
CN103841048B (zh) * 2012-11-23 2017-03-15 杭州华三通信技术有限公司 邻居连接建立方法和设备
US9282026B2 (en) * 2013-03-11 2016-03-08 Dell Products L.P. System and method for improved routing in autonomous systems
CN104506430A (zh) * 2015-01-15 2015-04-08 安徽皖通邮电股份有限公司 一种isis协议lsp洪泛和同步方法
US9774504B2 (en) * 2015-09-30 2017-09-26 Telefonaktiebolaget Lm Ericsson (Publ) Route refresh mechanism for border gateway protocol link state
CN106130904A (zh) * 2016-08-26 2016-11-16 杭州华三通信技术有限公司 一种lsp链路状态协议数据单元的同步方法及装置
US11558291B2 (en) * 2017-03-10 2023-01-17 Futurewei Technologies, Inc. Routing protocol broadcast link extensions
CN113114528A (zh) * 2017-09-22 2021-07-13 华为技术有限公司 一种通信连接检测方法及装置
WO2020176140A1 (en) * 2019-02-27 2020-09-03 Futurewei Technologies, Inc. System and method for handling igp flooding topology inconsistency
CN114567580B (zh) * 2020-11-27 2023-10-20 华为技术有限公司 一种消息发送方法、消息处理方法、装置及系统

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030012179A1 (en) * 2001-07-13 2003-01-16 Masashi Yano Mobile communication system
WO2003049342A2 (en) 2001-11-29 2003-06-12 Ipsum Networks, Inc. Method and system for topology construction and path identification in a link state routing system
US6718396B1 (en) * 1999-08-04 2004-04-06 Hitachi, Ltd. Network structure method and route determination equipment
CN1761244A (zh) * 2005-11-11 2006-04-19 清华大学 设置边界网关协议路由选择通知功能的方法
WO2006071901A2 (en) * 2004-12-29 2006-07-06 Cisco Technology, Inc. Automatic route tagging of bgp next-hop routes in igp
US20060153200A1 (en) * 2004-12-29 2006-07-13 Clarence Filsfils Automatic prioritization of BGP next-hop in IGP

Family Cites Families (38)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2693907B2 (ja) * 1993-12-27 1997-12-24 日本電気株式会社 スタティック・ルーティング方式
US6173324B1 (en) * 1998-07-15 2001-01-09 At&T Corp Method and apparatus for fault detection and isolation in data
US6801496B1 (en) * 1999-01-15 2004-10-05 Cisco Technology, Inc. Network addressing scheme for reducing protocol overhead in an optical network
JP2000209271A (ja) * 1999-01-18 2000-07-28 Nec Corp ル―タ装置
US6754219B1 (en) * 1999-06-04 2004-06-22 Nortel Networks Limited Modular routing system
US7076559B1 (en) * 1999-12-28 2006-07-11 Nortel Networks Limited System, device, and method for establishing label switched paths across multiple autonomous systems
US7120934B2 (en) * 2000-03-30 2006-10-10 Ishikawa Mark M System, method and apparatus for detecting, identifying and responding to fraudulent requests on a network
US7013345B1 (en) * 2000-06-12 2006-03-14 Metric Systems Corporation Method and apparatus for wireless networking
US7120120B2 (en) * 2001-11-29 2006-10-10 Ipsum Networks, Inc. Method and system for topology construction and path identification in a two-level routing domain operated according to a simple link state routing protocol
US20030123457A1 (en) * 2001-12-27 2003-07-03 Koppol Pramod V.N. Apparatus and method for distributed software implementation of OSPF protocol
EP1331793A1 (en) * 2002-01-24 2003-07-30 Alcatel Canada Inc. Method for distributing aggregate route information
US7180864B2 (en) * 2002-02-27 2007-02-20 Lucent Technologies Inc. Method and apparatus for exchanging routing information within an autonomous system in a packet-based data network
AU2002326280A1 (en) * 2002-08-14 2004-03-19 Agency For Science, Technology And Research A method of generating an authentication
US7468956B1 (en) * 2002-08-16 2008-12-23 Juniper Networks, Inc. Managing routing information in a hub-and-spokes network
MXPA05003199A (es) 2002-09-26 2005-07-05 Siemens Ag Dispositivo y procedimiento para vigilar una instalacion tecnica que abarca varios sistemas, en particular una instalacion de central electrica.
US8036139B2 (en) * 2002-10-28 2011-10-11 Cisco Technology, Inc. Internal BGP downloader
DE10341336A1 (de) * 2003-09-08 2005-04-07 Siemens Ag Verfahren zur optimierten Deaktivierung von Inter-Domain Routen
US7626948B1 (en) * 2003-09-12 2009-12-01 Cisco Technology, Inc. System and method for verifying the validity of a path in a network environment
US7440438B2 (en) * 2003-10-24 2008-10-21 Nortel Networks Limited Refresh and filtering mechanisms for LDP based VPLS and L2VPN solutions
US7702765B1 (en) * 2004-03-01 2010-04-20 Cisco Technology, Inc. Techniques for automatically creating an iBGP mesh
JP4549961B2 (ja) * 2004-11-01 2010-09-22 株式会社日立製作所 通信路監視システム及び通信ネットワークシステム
US7460481B2 (en) 2004-12-01 2008-12-02 Cisco Technology, Inc. Inter-domain TE-LSP with IGP extensions
US7742431B2 (en) * 2004-12-22 2010-06-22 Cisco Technology, Inc. Selectively sending link state messages in a network link state protocol based on interest of network nodes
US9059867B2 (en) * 2005-03-02 2015-06-16 Cisco Technology, Inc. Technique for selecting a path computation element based on response time delay
US7814227B2 (en) * 2005-03-04 2010-10-12 Cisco Technology, Inc. Computation of a shortest inter-domain TE-LSP across a set of autonomous systems
US8228786B2 (en) 2005-04-07 2012-07-24 Cisco Technology, Inc. Dynamic shared risk node group (SRNG) membership discovery
US8107379B2 (en) * 2005-05-04 2012-01-31 Cisco Technology, Inc. Dynamic TE-LSP priority and preemption
US7561588B2 (en) * 2005-07-22 2009-07-14 Cisco Technology, Inc. Processing two-octet and four-octet values using border gateway protocol
FI20050919A0 (fi) * 2005-09-15 2005-09-15 Nokia Corp Monikotiselta isäntäkoneelta tulevien datapakettien reititys
US7855953B2 (en) * 2005-10-20 2010-12-21 Cisco Technology, Inc. Method and apparatus for managing forwarding of data in an autonomous system
US7864669B2 (en) * 2005-10-20 2011-01-04 Cisco Technology, Inc. Method of constructing a backup path in an autonomous system
US8589573B2 (en) * 2006-03-08 2013-11-19 Cisco Technology, Inc. Technique for preventing routing loops by disseminating BGP attribute information in an OSPF-configured network
US7957306B2 (en) * 2006-09-08 2011-06-07 Cisco Technology, Inc. Providing reachability information in a routing domain of an external destination address in a data communications network
WO2008055429A1 (fr) 2006-11-09 2008-05-15 Huawei Technologies Co., Ltd. Procédé et noeud limite pour l'annonce d'informations de connexion limite d'un système as
CN101179488B (zh) 2006-11-10 2010-08-25 华为技术有限公司 通告自治系统边界连接信息的方法和装置
WO2008129388A2 (en) * 2007-04-19 2008-10-30 Telefonaktiebolaget Lm Ericsson (Publ) System and method for identifying non-multiple spanning tree protocol control planes
CN101682518B (zh) * 2007-06-01 2013-01-16 北方电讯网络有限公司 分布式连接建立和恢复
US8374502B2 (en) * 2009-02-27 2013-02-12 Futurewei Technologies, Inc. Open shortest path first extensions in support of wavelength switched optical networks

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6718396B1 (en) * 1999-08-04 2004-04-06 Hitachi, Ltd. Network structure method and route determination equipment
US20030012179A1 (en) * 2001-07-13 2003-01-16 Masashi Yano Mobile communication system
WO2003049342A2 (en) 2001-11-29 2003-06-12 Ipsum Networks, Inc. Method and system for topology construction and path identification in a link state routing system
WO2006071901A2 (en) * 2004-12-29 2006-07-06 Cisco Technology, Inc. Automatic route tagging of bgp next-hop routes in igp
US20060153200A1 (en) * 2004-12-29 2006-07-13 Clarence Filsfils Automatic prioritization of BGP next-hop in IGP
CN1761244A (zh) * 2005-11-11 2006-04-19 清华大学 设置边界网关协议路由选择通知功能的方法

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
RENHAI ZHANG MACH CHEN HUAWEI TECHNOLOGIES CO. ET AL.: "Locate ASBR in PCE; draft-zhang-pce-locate-asbr-00", IETF STANDARD-WORKING-DRAFT, INTERNET ENGINEERING TASK FORCE, IETF, CH, 12 October 2006 (2006-10-12)
See also references of EP2086189A4

Also Published As

Publication number Publication date
US20110007749A1 (en) 2011-01-13
US9397925B2 (en) 2016-07-19
US8270317B2 (en) 2012-09-18
EP2391077B1 (en) 2014-01-01
US8125929B2 (en) 2012-02-28
EP2086189A1 (en) 2009-08-05
EP2391077A1 (en) 2011-11-30
US20160050138A1 (en) 2016-02-18
US9276836B2 (en) 2016-03-01
US20090274159A1 (en) 2009-11-05
EP2086189B1 (en) 2014-01-01
US20120320796A1 (en) 2012-12-20
EP2086189A4 (en) 2009-11-11
ES2452340T3 (es) 2014-04-01

Similar Documents

Publication Publication Date Title
WO2008055429A1 (fr) Procédé et noeud limite pour l'annonce d'informations de connexion limite d'un système as
US7551551B2 (en) Fast reroute (FRR) protection at the edge of a RFC 2547 network
EP3200402B1 (en) Segment routing information obtainment method and segment routing network establishment method
EP1986370B1 (en) Control system, data message transmission method and network device in the ethernet
US8199755B2 (en) Method and apparatus establishing forwarding state using path state advertisements
CN101517998B (zh) 一种通告自治系统边界连接信息的方法和边界节点
CN101505227B (zh) 一种实现点到多点伪线的方法、设备和系统
WO2018006671A1 (zh) 报文发送方法和装置、网络架构、计算机存储介质
TWI499237B (zh) 廣播網路之標籤分配協定與內部閘道協定同步化
US7940753B2 (en) Enhancing routing optimality in IP networks requiring path establishment
CN101247322A (zh) 一种进行自治系统间路径计算的方法及网络设备
CN113273156B (zh) 路由发布的方法、设备和系统
WO2009106012A1 (zh) 一种通告相邻网络域ds-te信息的方法和系统及设备
WO2012079421A1 (zh) 域间链路状态信息的处理方法及路径计算单元
CN104253752B (zh) 在ldp协议中实现lsp平滑切换的方法及系统
KR100428778B1 (ko) 다중 프로토콜 레이블 교환 시스템에서의 씨알-엘에스피의경로 보호 방법 및 이를 위한 기록매체
US20240007398A1 (en) Next-hop monitoring method for border gateway protocol in layer 3 virtual private network models
Frelechoux et al. Topology optimization of IP over ATM
Kamel et al. REEQOS: An RSVP-TE approach for the End-to-End QoS provisioning within MPLS Domains

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 200780000353.X

Country of ref document: CN

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 07801087

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 2007801087

Country of ref document: EP