Abstract:
A fast rerout (FRR) technique that may be deployed at the edge of a network having first and second edge devices coupled to a neiboring routing domain. If the first edge device detects a node or link failure that prevents it from communicating with the neighboring domain, the first edge device (830) reroutes at least some data packets addressed to the neighboring domain to the second edge device. The second edge device receives the reroute packets and then forwards (835) the packets to the neigboring domain. Notably, the second edge device is not permitted to reroute the received packets a second time, e.g., upon identifying another time-domain node or link failure. As such, loops are avoided at the edge of the network and packets are rerouted to the neighboring routing domain faster and more efficiently than in prior implementations.
Abstract:
A method is disclosed of forwarding data in a data communications network comprising a plurality of nodes and links therebetween, each link having an associated usage cost and a load capacity. A forwarding node identifies a lowest cost route, comprising one or more links, to a destination node. If a plurality of lowest cost routes is identified, then the forwarding node allocates data for forwarding along each of the lowest cost routes dependent on a relative load capacity of that route.
Abstract:
Disclosed are systems, apparatuses, methods, and computer-readable media to measure performance of distinct paths of a network. A method includes determining a collection of hashes of a network based on a network probe event, each hash in the collection of hashes corresponding to a distinct path from a first edge device to a second edge device through the network; transmitting a collection of probes from the first edge device in the network, wherein each probe in the collection of probes is assigned a hash selected from the collection of hashes; receiving probes from the collection of probes at the second edge device; and determining a network performance of each distinct path through the network.
Abstract:
The present technology is directed to a scalable solution for end-to-end performance delay measurement for Segment Routing Policies on both SR-MPLS and SRv6 data planes. The scalability of the solution stems from the use of distributed PM sessions along SR Policy ECMP paths. This is achieved by dividing the SR policy into smaller sections comprised of SPT trees or sub-paths, each of which is associated with a Root-Node. Downstream SID List TLVs may be used in Probe query messages for signaling SPT information to the Root-Nodes Alternatively, this SPT signaling may be accomplished by using a centralized controller. Root-Nodes are responsible for dynamically creating PM sessions and measuring delay metrics for their associated SPT tree section. The root-nodes then send the delay metrics for their local section to an ingress PE node or to a centralized controller using delay metric TLV field of the response message.
Abstract:
In one embodiment, segment routing (SR) network processing of packets is performed on packets having a segment identifier structure providing processing and/or memory efficiencies. Responsive to an identified particular segment routing policy, the particular router retrieves from memory a dynamic segment routing identifier portion of the particular SR policy that includes a SR node value and a SR function value. The SR function value identifies segment routing processing to be performed by a router in the network identified based on the SR node value. A segment routing discriminator is independently identified, possibly being a fixed value for all segment identifiers in the network. Before sending into the network, a complete segment identifier is added to the particular packet by combining the segment routing discriminator with the dynamic segment routing identifier portion. The particular packet including the complete segment identifier is sent into the network.
Abstract:
An apparatus and method for using indexed segment identifiers in segment routing. An example method involves receiving a globally unique index value at a node. The method also involves receiving a base value at the node, where the base value comprises a segment routing value configured to identify a nodal segment. The method then involves calculating a segment identifier based on the index value and the base value.
Abstract:
A method and apparatus for forwarding packets through a network domain that contains nodes that are label distribution protocol (LDP) enabled and nodes that are segment routing (SR) enabled. In one embodiment, the method may include a network node receiving a packet with a label attached thereto. The node swaps the label with a segment identifier (ID). The node then forwards the packet to an SR node. In another embodiment, the method may include a network node receiving a packet with a segment ID attached thereto. The node swaps the segment ID with a label. The node then forwards the packet to an LDP enabled node.
Abstract:
An apparatus and method is disclosed for segment routing (SR). In one embodiment, the method includes a node creating a segment stack that identifies one segment calculated using a first algorithm and a second segment calculated using a second, different algorithm. The node then attaches this header to a packet and sends it to another node.
Abstract:
In one embodiment, a method includes receiving a packet at a first network device, logging the packet into a demand corresponding to a cell of a demand matrix, and storing the demand in a demand database at the first network device. The demand database includes a plurality of demands computed for a specified time period and corresponding to cells of the demand matrix associated with traffic entering a network at the first network device. Demands corresponding to cells of the demand matrix associated with traffic entering the network at a second network device are computed and stored at the second network device. An apparatus and logic are also disclosed herein.
Abstract:
In one embodiment, an Internet Protocol (IP) routing information base of a packet switching device is filtered to produce a significantly smaller subset of IP routes that are installed in one or more forwarding information bases for forwarding of IP packets. In one embodiment, these smaller forwarding information bases are located in memory local to a network processor to more quickly perform lookup operations thereon. In one embodiment, one or more of these forwarding information bases is used only for exact matching of addresses (not longest prefix matching). In one embodiment, the IP routes in these smaller forwarding information bases substantially correspond to packet switching devices in a network (e.g., core and edge routers), such as in contrast to including all the IP routes for devices external to the network.