摘要:
A method and apparatus are presented supporting shortest path first (SPF) routing of data packets over a network by establishing link-state data at an router. Link-state data indicates direct links between the router and a different router and establishes an adjacency relationship with the different node. Initial link-state data is stored at a first router. After the initial link-state data is stored, a hello message is received at the first router. The hello message indicates a direct connection with a different second router on one network segment. Based on the initial link-state data, it is determined whether establishing an adjacency relationship with the second router is sufficiently valuable. If not, then an adjacency relationship is not established with the second router in response to the hello message. A shortest path first routing for a data packet traversing the network is determined based on one or more adjacency relationships indicated in link-state data stored at the first router.
摘要:
A method and apparatus are presented supporting shortest path first (SPF) routing of data packets over a network by establishing link-state data at an router. Link-state data indicates direct links between the router and a different router and establishes an adjacency relationship with the different node. Initial link-state data is stored at a first router. After the initial link-state data is stored, a hello message is received at the first router. The hello message indicates a direct connection with a different second router on one network segment. Based on the initial link-state data, it is determined whether establishing an adjacency relationship with the second router is sufficiently valuable. If not, then an adjacency relationship is not established with the second router in response to the hello message. A shortest path first routing for a data packet traversing the network is determined based on one or more adjacency relationships indicated in link-state data stored at the first router.
摘要:
Techniques for detecting loops in routes that cross route information boundaries include receiving a control message at a first edge node on one side of the boundary that is connected to a different second edge node on another side of the boundary. The control message indicates a particular network address of a particular node that is reachable from the first edge node. Distinguisher data is determined that indicates if a node in the first collection can reach the first edge node without leaving the first collection. An advertising message is sent from the first edge node to the second edge node that includes route data that indicates the particular network address and the distinguisher data. Based on the distinguisher data, a testing edge node in the first collection can determine whether there is a loop comprising both an internal path and an external path to the first edge node.
摘要:
Techniques for detecting loops in routes that cross route information boundaries include receiving a control message at a first edge node on one side of the boundary that is connected to a different second edge node on another side of the boundary. The control message indicates a particular network address of a particular node that is reachable from the first edge node. Distinguisher data is determined that indicates if a node in the first collection can reach the first edge node without leaving the first collection. An advertising message is sent from the first edge node to the second edge node that includes route data that indicates the particular network address and the distinguisher data. Based on the distinguisher data, a testing edge node in the first collection can determine whether there is a loop comprising both an internal path and an external path to the first edge node.
摘要:
The present invention elects an area border router from a plurality of potential area border routers by determining a full set of all areas attached to a router. A determination is made as to a full set of area pairs from the determined full set of areas. Routers are identified in a first area of the determined full set of areas that are reachable through an intra-area route in the first area, and routers are identified in a second area of the determined full set of areas that are reachable through an intra-area route in the second area. If there is a router that is unreachable through either an intra-area route in the first area or an intra-area route in the second area, then declare the first router to be an area border router, else new first and second areas are selected.
摘要:
A method and apparatus for sharing routing information include receiving first domain data that indicates domains of a first mobile router. A domain is a collection of routers that share uniform routing information at a particular level of detail. An inbound data packet is received from a second mobile router over a particular link. The inbound control plane packet lists second domain data that indicates domains of the second mobile router. The first domain data and the second domain data together include multiple domains. A particular domain is automatically selected from the first domain data and the second domain data. The second mobile router independently selects the same particular domain. The particular link is assigned to the particular domain; and routing information for the particular domain is shared between the first mobile router and the second mobile router over the particular link.
摘要:
A method and apparatus for sharing routing information include receiving first domain data that indicates domains of a first mobile router. A domain is a collection of routers that share uniform routing information at a particular level of detail. An inbound data packet is received from a second mobile router over a particular link. The inbound control plane packet lists second domain data that indicates domains of the second mobile router. The first domain data and the second domain data together include multiple domains. A particular domain is automatically selected from the first domain data and the second domain data. The second mobile router independently selects the same particular domain. The particular link is assigned to the particular domain; and routing information for the particular domain is shared between the first mobile router and the second mobile router over the particular link.
摘要:
The present invention elects an area border router from a plurality of potential area border routers by determining a full set of all areas attached to a router. A determination is made as to a full set of area pairs from the determined full set of areas. Routers are identified in a first area of the determined full set of areas that are reachable through an intra-area route in the first area, and routers are identified in a second area of the determined full set of areas that are reachable through an intra-area route in the second area. If there is a router that is unreachable through either an intra-area route in the first area or an intra-area route in the second area, then declare the first router to be an area border router, else new first and second areas are selected.
摘要:
In one embodiment, a Link State Advertisement (LSA) is received from a first router in a network at a second router in the network. The LSA advertises an address of an interface of the first router. The second router determines whether the LSA includes a transit-only identification that indicates the interface of the first router is a transit-only interface. If the LSA does not include a transit-only identification, the second router installs the advertised address of the interface of the first router in a Router Information Base (RIB) of the second router. If the LSA does include a transit-only identification, the second router declines to install the advertised address of the interface of the first router in the RIB of the second router.
摘要:
A system for hiding transit-only interfaces in a network. When a routing system is advertising a transit-only interface, the advertisement is marked to indicate the address is a transit-only interface. A routing system receives the advertisement and detects the identifier of the transit-only interface and does not store the address in the Router Information Base of the routing system.