The disclosure provides a method for determining a configuration mismatch between a first device and a second device. During operation, a first device receives a plurality of Unidirectional Link Detection (UDLD) protocol messages from a second device. The first device is configured with a first interval configuration value corresponding to a frequency which the first device sends the UDLD protocol messages to the second device. The first device determines a second interval configuration value of the second device, which corresponds to a frequency which the second device sends the UDLD protocol messages to the first device. The first device determines that there is a configuration mismatch between the first device and the second device, and creates a log entry for the configuration mismatch, the log entry including the first and second interval configuration values.

A Time-To-Live budget can be determined for network packets and used to understand an impact of network expansion on dropped packets. Additionally, the TTL budget can be used to determine how network expansion impacts services provided in the data center. In one embodiment, agents executing on data center routers are used to transmit packet header data including a TTL budget to a collector server computer. The collector server computer can discern signal (production flows) from noise (traceroutes and probing traffic) to detect packets that are at risk of being dropped or have been dropped due to TTL expiration. Alerts can be generated for packet flows with dangerously low remaining TTL budget or no remaining budget, which are at high risk of expiring due to operational events resulting in traffic temporarily traversing slightly longer paths. A dashboard can be provided with historic TTL budget data and trends.

Embodiments of this application provide a method for determining route flapping information, to determine route flapping information based on parameter information reported by a routing device. The method in the embodiments of this application includes the following steps: receiving parameter information sent by each of at least one routing device, where parameter information sent by any routing device includes at least one of protocol packet information, count information, and identity identification information of the any routing device; and determining route flapping information of a target routing device based on the parameter information sent by each of the at least one routing device, where the target routing device is one of the at least one routing device.

In an example, a method includes computing, by a computing device, for a segment routing policy that specifies a bandwidth constraint for the segment routing policy, first shortest paths through a network of network nodes, wherein each shortest path of the first shortest paths represents a different sequence of links connecting pairs of the network nodes from a source to a destination; in response to determining, by the computing device based on the bandwidth constraint for the segment routing policy, a link of one of the first shortest paths has insufficient bandwidth to meet a required bandwidth for the link, increasing a metric of the link; computing, by the computing device, for the segment routing policy that specifies the bandwidth constraint, based on the increased metric of the link, second shortest paths through the network of network nodes; and provisioning the second shortest paths in the network of nodes.

A method may include monitoring a network performance metric for multiple paths to a destination through a network, and storing historical performance data for the paths. The method may also include receiving a data flow directed to the destination, where the data flow may be subject to a network performance agreement. The method may additionally include determining aggregate historical performances for the paths, and comparing the aggregate historical performances for the paths. The method may also include, based on the comparison of the aggregate historical performances, routing the data flow through the network.

A method is disclosed for autonomously discovering and utilizing low-latency routing paths in a distributed data routing network. The method includes automatically measuring one-way latencies between a plurality of nodes, and automatically calculating relay health scores of potential relayed data routing paths in the distributed network. A relayed data routing path is automatically selected based on the one-way latencies and relay health scores of potential relayed data routing paths. A relay health score for a potential relayed data routing path is based on uptimes of the potential relay node, or bandwidths, jitters, data package losses, or amount of data routed through the routing segments in the potential relayed data routing path. The selected relayed routing path has a routing health score that meets a pre-determined criterion. The selected relayed data routing path has a total one-way latency smaller than a one-way latency associated with in a direct path.

A system may include a transmitter node and a receiver node. Each node may include a communications interface including at least one antenna element and a controller operatively coupled to the communications interface, the controller including one or more processors, wherein the controller has information of own node velocity and own node orientation. Each node of the transmitter node and the receiver node may be in motion. Each node may be time synchronized to apply Doppler corrections associated with said node's own motions relative to a common reference frame. The common reference frame may be known to the transmitter node and the receiver node prior to the transmitter node transmitting signals to the receiver node and prior to the receiver node receiving the signals from the transmitter node.

The present disclosure discloses a method and an apparatus for controlling a network traffic path. The method includes: receiving routing advertisement information from a first network to a second network; determining all routing nodes included in a path through which data pass when flowing from the second network to the first network according to the routing advertisement information; and configuring a next hop routing node for each determined routing node, where the next hop routing node is a node in all the routing nodes included in the path and is adjacent to the routing node for which the next hop routing node is configured, and the routing node for which the next hop routing node is configured does not include a routing node of the first network or a routing node of the second network.

Exemplary methods, apparatuses, and systems include a path management hub and proxy server nodes that form a mesh network. The hub receives link performance metrics from each of the nodes. The hub determines optimal paths between first and second nodes for each of a plurality of metric types or a combination of metric types using the received link performance metrics. The hub maps a service identifier to a plurality of the determined optimal paths for a context representing one or more link performance metric types. The hub transmits a next hop for each of the plurality of mapped optimal paths along with the mapping to the first node. The first node receives the service identifier mapped to the next hops and traffic for the first connection. In response to determining the received traffic is for the service, the first node selects a first next hop and forwards the traffic.

Systems and techniques are provided for implementing multiprotocol label switching (MPLS) header extensions. In some examples, a method can include, receiving, by a router of a MPLS network, a data packet. In some aspects, the method can include adding, by the router of the MPLS network, at least one entry to an MPLS stack of the data packet, wherein the at least one entry includes an MPLS extension indicator (MEI) that is associated with at least one of an in-stack extension header presence indicator (IPI) and a bottom-of-stack extension header presence indicator (BPI). In some examples, the method can include adding, based on the IPI and the BPI, at least one of an in-stack extension header and a bottom-of-stack extension header to the MPLS stack of the data packet.