Abstract: Devices and methods provide for error handling and dynamic path maximum transmission unit (MTU) discovery in a network with segment routing. In segment routing, applying traditional MTU Discovery may not be possible due to lack of tunnel identifiers. Therefore, when an ingress edge device (IED), in a segment routing domain, receives a first error packet including a first MTU value (MTU1) and an underlay encapsulation, the IED generates a second error packet based on the first error packet, determines a second MTU value (MTU2) based on MTU1 and the underlay encapsulation, updates the second error packet with MTU2, and relays the second error packet including MTU2 to a host device via an egress edge device (EED). The IED receives the second error packet, including a segment identifier of the IED, returned by the EED, based on which the IED identifies a segment routing policy for updating MTU2.

Abstract: This disclosure describes techniques for protecting data traffic sovereignty while routing data traffic across a network. The techniques include determining a geographic location of one or more network devices that may potentially be used in a data path for the data traffic. The techniques also include receiving a sovereignty policy related to the data traffic. The geographic location of the one or more network devices and the sovereignty policy may used to determine the data path for the data traffic. As such, data traffic sovereignty protection techniques may improve security in network communications.

Abstract: In one aspect, a method includes setting, at a source node of an SRv6 network, one or more bits of a packet to indicate an ingress service identifier associated with an ingress service, where the ingress service is behind a source node; transmitting, by the source node, the packet towards a destination device of the SRv6 network; accessing, at the source node and from a network device in communication with the source node, an Internet Control Message Protocol error message that includes a portion of the packet indicating the ingress service identifier; and identifying, based on the ingress service identifier indicated by the Internet Control Message Protocol error message for the packet, the ingress service associated with the packet.

Abstract: Discussed are systems, methods and computer readable media that use a segment routing system and compute a path for network traffic based on segment routing policies. Based on these computations, the system is able to determine a path, and if the path is unique. When the path is unique it is stored in a path database which includes the unique paths available to the segment routing system. Based on the path database and segment routing polices, the system will compute a best path from the available unique paths for the network traffic based on measured and predicted performance metrics of the unique paths.

Abstract: In one embodiment, an apparatus includes a physical port and a plurality of logical sub-interfaces under the physical port. The physical port and the logical sub-interfaces are configured as a Bidirectional Forwarding Detection (BFD) neighbor group. The physical port being configured to run BFD sessions to detect failures at a first rate that is substantially faster as compared to a second rate of BFD sessions to detect failures on the logical sub-interfaces. The physical port notifies the logical sub-interfaces of a BFD failure at the physical port, with the logical sub-interfaces shutting down responsive to the notification.

Abstract: A method of timing an attempt to establish a connection path between a first and second node in a communications network is provided. The method initiates the attempt to establish a connection path after a period of time has elapsed wherein the period of time is greater than another period of time which had previously elapsed between two previous attempts, if any, to establish the connection.

Abstract: A system and method for bidirectional forwarding detection (BFD) rate-limiting and automatic BFD session activation includes tracking a total bidirectional forwarding detection (BFD) packet rate for a line card (LC) of the node, and rejecting operations associated with creation of a new BFD session that would cause the total BFD packet rate to exceed a predetermined maximum rate. The new BFD session is stored in a state on the node and the operations of the new BFD session are automatically retried at a time when doing so would not exceed the predetermined maximum rate.

Abstract: A system and method for bidirectional forwarding detection (BFD) rate-limiting and automatic BFD session activation includes tracking a total bidirectional forwarding detection (BFD) packet rate for a line card (LC) of the node, and rejecting operations associated with creation of a new BFD session that would cause the total BFD packet rate to exceed a predetermined maximum rate. The new BFD session is stored in a state on the node and the operations of the new BFD session are automatically retried at a time when doing so would not exceed the predetermined maximum rate. It is emphasized that this abstract is provided to comply with the rules requiring an abstract that will allow a searcher or other reader to quickly ascertain the subject matter of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. 37 CFR 1.72(b).

Abstract: A system and method for bidirectional forwarding detection (BFD) rate-limiting and automatic BFD session activation includes tracking a total bidirectional forwarding detection (BFD) packet rate for a line card (LC) of the node, and rejecting operations associated with creation of a new BFD session that would cause the total BFD packet rate to exceed a predetermined maximum rate. The new BFD session is stored in a state on the node and the operations of the new BFD session are automatically retried at a time when doing so would not exceed the predetermined maximum rate. It is emphasized that this abstract is provided to comply with the rules requiring an abstract that will allow a searcher or other reader to quickly ascertain the subject matter of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.

Abstract: In one embodiment, an apparatus includes a physical port and a plurality of logical sub-interfaces under the physical port. The physical port and the logical sub-interfaces are configured as a Bidirectional Forwarding Detection (BFD) neighbor group. The physical port being configured to run BFD sessions to detect failures at a first rate that is substantially faster as compared to a second rate of BFD sessions to detect failures on the logical sub-interfaces. The physical port notifies the logical sub-interfaces of a BFD failure at the physical port, with the logical sub-interfaces shutting down responsive to the notification. It is emphasized that this abstract is provided to comply with the rules requiring an abstract that will allow a searcher or other reader to quickly ascertain the subject matter of the technical disclosure.

Abstract: A method of timing an attempt to establish a connection path between a first and second node in a communications network is provided. The method initiates the attempt to establish a connection path after a period of time has elapsed wherein the period of time is greater than another period of time which had previously elapsed between two previous attempts, if any, to establish the connection.

Abstract: A technique efficiently and dynamically maintains bidirectional forwarding detection (BFD) on a bundle of links in a computer network. According to the novel technique, one or more “standby” BFD sessions may be established on one or more corresponding line cards (LCs), the LCs having one or more links of the bundle (bundle links). Once established, one of the standby BFD sessions may be selected as an “active” BFD session based on activity of one of the bundle links of the corresponding LC. Also, BFD messages may be transmitted from one of the bundle links of the active BFD session, e.g., the link receiving BFD messages. In response to inactivity of the transmitting link (e.g., failure, removal, etc.), the active BFD session may switch to another available active bundle link, and if no other active bundle links are available to the active BFD session, one of the standby BFD sessions is selected as the new active BFD session.

Abstract: A method of timing an attempt to establish a connection path between a first and second node in a communications network is provided. The method initiates the attempt to establish a connection path after a period of time has elapsed wherein the period of time is greater than another period of time which had previously elapsed between two previous attempts, if any, to establish the connection.

Abstract: A system and method of configuring a communications path in a communications network from a start node to an end node through intermediate nodes is provided by: establishing a partial path for the communications path from the start node to a terminating node in the intermediate nodes; and at the terminating node, if a communications link to a next-hop node does not exist in the intermediate nodes, then establishing the terminating node as an interim egress node for the communications path; and notifying the start node of mapping parameters for the partial communications path.

Abstract: A system and method for bidirectional forwarding detection (BFD) rate-limiting and automatic BFD session activation includes tracking a total bidirectional forwarding detection (BFD) packet rate for a line card (LC) of the node, and rejecting operations associated with creation of a new BFD session that would cause the total BFD packet rate to exceed a predetermined maximum rate. The new BFD session is stored in a state on the node and the operations of the new BFD session are automatically retried at a time when doing so would not exceed the predetermined maximum rate. It is emphasized that this abstract is provided to comply with the rules requiring an abstract that will allow a searcher or other reader to quickly ascertain the subject matter of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims.

Abstract: A system and method of operating a communications network having a plurality of interconnected nodes is provided by: establishing a connection path from an ingress node to an egress node through intermediate nodes; associating the connection path with a network-wide unique identification; on the ingress node, storing the path identification so as to indicate that the path originates at the ingress node; on each intermediate node, storing the path identification so as to indicate that the path transits the intermediate node; and on the egress node, storing the path identification so as to indicate that the path terminates at the ingress node.

Abstract: A method of timing an attempt to establish a connection path between a first and second node in a communications network is provided. The method initiates the attempt to establish a connection path after a period of time has elapsed wherein the period of time is greater than another period of time which had previously elapsed between two previous attempts, if any, to establish the connection.

Abstract: A system and method of configuring a communications path in a communications network from a start node to an end node through intermediate nodes is provided by: establishing a partial path for the communications path from the start node to a terminating node in the intermediate nodes; and at the terminating node, if a communications link to a next-hop node does not exist in the intermediate nodes, then establishing the terminating node as an interim egress node for the communications path; and notifying the start node of mapping parameters for the partial communications path.

Abstract: A system and method of operating a communications network having a plurality of interconnected nodes is provided by: establishing a connection path from an ingress node to an egress node through intermediate nodes; associating the connection path with a network-wide unique identification; on the ingress node, storing the path identification so as to indicate that the path originates at the ingress node; on each intermediate node, storing the path identification so as to indicate that the path transits the intermediate node; and on the egress node, storing the path identification so as to indicate that the path terminates at the ingress node.