摘要:
In one embodiment, an edge device in a first routing domain is configured to communicate with a second routing domain via a data link. The edge device receives a data packet containing a destination address that is reachable via the second routing domain and an indication that the data packet is a protected packet that was previously rerouted from another edge device in the first routing domain via a Multi-Protocol Label Switching (MPLS) Fast Reroute (FRR) backup path. The edge device determines if communication with the second routing domain is still available via the data link, and if so, removes the indication that the data packet is a protected packet and forwards the data packet to the second routing domain, and, if not, drops the data packet to prevent the data packet from being rerouted a second time in the first routing domain on another MPLS FRR backup path.
摘要:
In one embodiment, a loss of communication is detected between a first edge device of a computer network and a neighboring routing domain. A data packet is received at the first edge device, where the received data packet contains a destination address that is reachable via the neighboring routing domain. A determination is made whether a service label is located in a Multi-Protocol Label Switching (MPLS) label stack included in the received data packet. A service label in the MPLS label stack indicates that the received data packet was previously rerouted in accordance with fast reroute (FRR) operations. In response to a determination that the received data packet does not include a service label in the MPLS label stack, the received data packet is rerouted to a second edge device of the computer network for forwarding to the neighboring routing domain.
摘要:
A method of constructing a backup path in an autonomous system (AS) for failure of an inter-AS link is described. The method comprises identifying an alternate inter-AS path and constructing a tunnel to an end point on the alternate path.
摘要:
A method and system for protecting valuable resources within an autonomous system network. Address prefixes within the system are designated as valuable and a flag bit is associated with the address within routing tables of routers of the network. Interfaces to border routers are identified and when packets are received at those interfaces, the packets are flagged with a flag or tag bit. The destination address of the received packet is compared to the flag bit associated with the valuable resource prefix, and if the packet is directed to that resource the packet is dropped and/or logged, but the packet is not forwarded to that resource. In specific cases an interface from an external source may be configured to not create the flag or tag bit, wherein that packet will be delivered to the destination prefix of the packet.
摘要:
In one embodiment, a node identifies a plurality of equal cost best paths to a destination, the best paths having one or more associated links. The node receives dynamic link utilization information for the associated links, and determines an amount of traffic to the destination to forward over each of the equal cost best paths, the amount being dynamically dependent upon the dynamic link utilization of the associated links for each equal cost best path.
摘要:
An apparatus for providing reachability in a routing domain of a data communications network having as components nodes and links therebetween for a routing domain external destination address is provided. The apparatus is arranged to advertise destination address reachability internally to nodes in the routing domain and associate a reachability category with the internal advertisement of the destination address reachability.
摘要:
An apparatus for providing reachability in a routing domain of a data communications network having as components nodes and links therebetween for a routing domain—external destination address is described. The apparatus is arranged to advertise destination address reachability internally to nodes in the routing domain and associate a reachability category with said internal advertisement of said destination address reachability.
摘要:
A technique dynamically resizes Traffic Engineering (TE) Label Switched Paths (LSPs) at a head-end node of the TE-LSPs in preparation to receive redirected traffic in response to an event in a computer network. The novel dynamic TE-LSP resizing technique is based on the detection of an event in the network that could cause traffic destined for one or more other (“remote”) head-end nodes of one or more TE-LSPs to be redirected to an event-detecting (“local”) head-end node of one or more TE-LSPs. An example of such a traffic redirection event is failure of a remote head-end node or failure of any of its TE-LSPs. Specifically, the local head-end node maintains TE-LSP steady state sampling and resizing frequencies to adapt the bandwidth of its TE-LSP(s) to gradual changes in the network over time. Upon detection of an event identifying possible traffic redirection, the local head-end node enters a Fast Resize (FR) state, in which the sampling and resizing frequencies are increased to quickly adapt the TE-LSP bandwidth(s) to any received redirected traffic.
摘要:
In one embodiment, an apparatus and method are described for constructing a repair path in the event of non-availability of a routing domain component of a routing domain comprising, as components, links and nodes. The apparatus is arranged to receive respective network repair addresses from each of the far-side and near-side advertising node for use in the event of non-availability of a routing domain component between the advertising node. The apparatus is further arranged to advertise the near-side advertising node network repair address to one or more far-side nodes via a path external to the routing domain.
摘要:
In one embodiment, a node identifies a plurality of equal cost best paths to a destination, the best paths having one or more associated links. The node receives dynamic link utilization information for the associated links, and determines an amount of traffic to the destination to forward over each of the equal cost best paths, the amount being dynamically dependent upon the dynamic link utilization of the associated links for each equal cost best path.