摘要:
A method and apparatus for the dissemination of non-routing information to nodes of a network is provided. A new type of IS-IS packet (called a NRI IS-IS packet) is described that exclusively carries non-routing information. When the NRI IS-IS packet is received by a router, the router may send the NRI IS-IS packet to an appropriate component responsible for processing non-routing information, without analyzing, verifying, and validating the information carried in each TLV and sub-TLV of the NRI IS-IS packet. Advantageously, the time it takes for routers of the network to achieve convergence is decreased since a IS-IS packet reader need not analyze, verify, and validate information not related to network topology and IP routing. Therefore, when NRI IS-IS packets are received, there is no impact in the convergence time of nodes in the network.
摘要:
A technique treats a protected forwarding adjacency (FA) as a dynamic entity in that it allows a backup tunnel associated with the FA to carry traffic for the FA, when it's primary tunnel has failed, up to a predetermined amount of time. If after the predetermined amount of time has elapsed and the FA has not recovered (e.g., the primary tunnel has not been reestablished), a network topology change is automatically triggered causing the network to converge on a new network topology. By triggering the network topology change, a path that is more optimal than the path associated with the backup tunnel may be subsequently determined to carry the traffic.
摘要:
In one embodiment, a stateful path computation element (PCE) in a computer network determines a need to route at least a threshold number of tunnels, and in response, triggers a routing update from a determined set of routers. Having updated the routing information and available network resources for the set of routers, the stateful PCE may then compute the tunnels based on the update.
摘要:
In one embodiment, a router initiates reroutes of one or more tunnels at the router as part of optimization of a plurality of tunnels in a computer network, and stores an original state of the one or more tunnels at the router prior to the optimization. By detecting whether path computation element (PCE) failure occurs prior to completion of the optimization, the router may revert to the original state of the one or more tunnels in response to PCE failure prior to completion of the optimization.
摘要:
In one embodiment, a particular device in a computer network maintains a locally owned tunnel-state table, and joins a distributed hash table (DHT) ring. In addition, the locally owned tunnel-state table is shared with other devices of the DHT ring to establish a DHT-owned tunnel-state table. The particular device (and other devices) determines ownership of link-state advertisements (LSAs) for a specific portion of a traffic engineering database (TED) according to the DHT ring. As such, when the particular device (or any device) computes a path for a tunnel using a local TED, the particular device may request permission to use resources along the computed path that were advertised in particular LSAs from owners of those particular LSAs when not owned by the particular device.
摘要:
In one embodiment, a stateful path computation element (PCE) in a computer network determines a need to route at least a threshold number of tunnels, and in response, triggers a routing update from a determined set of routers. Having updated the routing information and available network resources for the set of routers, the stateful PCE may then compute the tunnels based on the update.
摘要:
In one embodiment, a router initiates reroutes of one or more tunnels at the router as part of optimization of a plurality of tunnels in a computer network, and stores an original state of the one or more tunnels at the router prior to the optimization. By detecting whether path computation element (PCE) failure occurs prior to completion of the optimization, the router may revert to the original state of the one or more tunnels in response to PCE failure prior to completion of the optimization.
摘要:
A technique triggers optimization of a traffic engineering (TE) label switched path (LSP) that spans multiple domains of a computer network from a head-end node of a local domain to a tail-end node of a remote domain. The technique is based on the detection of an event in the remote domain (“event domain”) that could create a more optimal TE-LSP, such as, e.g., restoration of a network element or increased available bandwidth. Specifically, a path computation element (PCE) in the event domain learns of the event and notifies other PCEs of the event through an event notification. These PCEs then flood an event notification to label switched routers (LSRs) in their respective domain. Upon receiving the notification, if an LSR has one or more TE-LSPs (or pending TE-LSPs), it responds to the PCE with an optimization request for the TE-LSPs. The PCE determines whether a particular TE-LSP may benefit from optimization based on the event domain (i.e., whether the TE-LSP uses the event domain), and processes the request accordingly.
摘要:
Customer edge (CE) to CE device verification checks initiate routes from available CEs as a set of path verification messages, destined for remote CE routes serving a remote VPN. An extended community attribute, included among the attributes of the path verification message, stores the identity of the originating CE router. The path verification message propagates across the network, and transports the identity of the originating CE router because the originator identity is not overwritten by successive routing. Upon receipt by the remote CE, the originator is determinable from the extended community attribute. A further reachability field is also included in the extended community attribute and indicates whether per CE or per prefix is appropriate for the particular route in question. In this manner, CE-CE connectivity checks identify CEs which are reachable from other CEs. Accordingly, such a mechanism allows for route reachability aggregation on a per-CE or per-prefix reachability basis.
摘要:
In one embodiment, an apparatus comprises logic for optimizing network resources usage. The logic is operable to store IGP information, where the IGP information includes a set of attribute values associated with each of a set of content servers. When the logic receives a request for content from a remote peer, the logic determines one or more content servers that can provide the requested content. The logic then retrieves, from the IGP information, a plurality of attribute values associated with a non-looping path from each of the one or more content servers. For each of the one or more content servers, the retrieved attribute values include: one or more capacity values indicating capacities of one or more communication links on the non-looping path from that content server; and one or more utilization values indicating utilizations of the one or more communication links on the non-looping path from that content server. The logic then selects a content server based on the retrieved attribute values, and causes the request for the content to be sent to the selected content server.