Abstract:
In one embodiment, a device in a segment routed network identifies an adjacency segment between the device and another device in the network. The device also identifies a merge point in the network. A first network path extends between the device and the merge point via the adjacency segment. A bypass network path that does not include the adjacency segment also extends between the device and the merge point. The device generates an interior gateway protocol (IGP) message that identifies the adjacency segment and the merge point. The device provides the IGP message to one or more other devices in the network.
Abstract:
At a first network device, a plurality of paths through a network from a source network device to a destination network device are determined. A vacant bandwidth is calculated for each of the plurality of paths. A primary path is selected from the plurality of paths based on the vacant bandwidth, and a standby path is selected from the plurality of paths based on the vacant bandwidth.
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:
Utilizing the systems disclosed herein, a network element (in a network) controls, within another network, the constraints of a service, timing of the creation of the service, and selection a service on which a packet is transmitted. For example, a first network element (located in a first network) receives a request associated with initiating a service. The request is received from a second network element located in a second network and includes at least one path constraint. The first network element controls creation of the service in the first network on behalf of the second network element located in the second network by, e.g., identifying a path based, at least in part, on the at least one path constraint; and binding an identifier and an interface to the path, wherein the interface is associated with one or more operation to perform on any traffic that is labeled with the identifier.
Abstract:
In one embodiment, a device in a segment routed network identifies an adjacency segment between the device and another device in the network. The device also identifies a merge point in the network. A first network path extends between the device and the merge point via the adjacency segment. A bypass network path that does not include the adjacency segment also extends between the device and the merge point. The device generates an interior gateway protocol (IGP) message that identifies the adjacency segment and the merge point. The device provides the IGP message to one or more other devices in 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:
An example method for seamless path monitoring and rapid fault isolation using bidirectional forwarding detection (BFD) in a network environment is provided and includes determining a BFD target identifier type for communicating in a BFD session in a network environment, determining a non-zero globally assigned BFD discriminator value associated with the BFD target identifier type, populating a Your Discriminator field in a BFD Control Packet with the non-zero globally assigned BFD discriminator value, with a My Discriminator field in the BFD Control Packet being populated with a locally assigned BFD Discriminator value, and initiating the BFD session by transmitting the BFD Control Packet to a target node in the network. In a specific embodiment, the BFD target identifier type is type 3, and the non-zero globally assigned BFD discriminator is an Alert Discriminator reserved by substantially all nodes in the network exclusively for BFD traceroute operations.
Abstract:
In one embodiment, a node in a communication network receives a label switched path (LSP) request and in response, the node determines at least two equal cost paths, each path having one or more path-nodes. The node may then further determine a total bandwidth-based transition value for each path of the at least two equal cost paths and selects the path having a lower total transition value. Once selected, the node may establish the requested LSP over the selected path.
Abstract:
A method, network device, and computer program product for network traffic diversion are disclosed. In one embodiment, a method according to the present disclosure includes receiving a frame at a core edge node that is a member of a redundancy group (where the frame comprises network address information and a packet), and determining whether a link (to which the core edge node is communicatively coupled) is affected by a network failure. The frame was sourced by a remote core edge node that is not a member of the redundancy group, and the network address information indicates that the packet is to be forwarded via the link. In response to the link being affected by the network failure, the method further includes generating a modified frame and forwarding the modified frame to another core edge node. The generating comprises including a redirect label in the modified frame. The another core edge node is another member of the redundancy group.
Abstract:
A method, network device, and computer program product for network traffic diversion are disclosed. In one embodiment, a method according to the present disclosure includes receiving a frame at a core edge node that is a member of a redundancy group (where the frame comprises network address information and a packet), and determining whether a link (to which the core edge node is communicatively coupled) is affected by a network failure. The frame was sourced by a remote core edge node that is not a member of the redundancy group, and the network address information indicates that the packet is to be forwarded via the link. In response to the link being affected by the network failure, the method further includes generating a modified frame and forwarding the modified frame to another core edge node. The generating comprises including a redirect label in the modified frame. The another core edge node is another member of the redundancy group.