Systems and methods for determining locations of wireless nodes in a network architecture are disclosed herein. In one example, an asynchronous system includes a first wireless node having a wireless device with one or more processing units and RF circuitry for transmitting and receiving communications in the wireless network architecture including a first RF signal having a first packet. The system also includes a second wireless node having a wireless device with a transmitter and a receiver to enable bi-directional communications with the first wireless node in the wireless network architecture including a second RF signal with a second packet. The first wireless node determines a time of flight estimate for localization based on a time estimate of round trip time of the first and second packets and a time estimate that is based on channel sense information of the first and second wireless nodes.

A path establishment method and a controller are disclosed. The method includes: when detecting a path establishment request for establishing P2MP TE, computing a P2MP TE path by using head node information and tail node information included in the path establishment request; identifying a target branch node in the P2MP TE path, and obtaining a label of the target branch node; and when a third node corresponding to the head node information and the target branch node are not a same node, sending first information to the third node, and sending second information to the target branch node, where the second information is used to instruct the target branch node to generate a multicast forwarding entry. Embodiments of this application can reduce complexity of establishing the P2MP TE path.

Described embodiments provide systems and methods for path selection proportional to a penalty delay in processing packets. A server-side intermediary may identify a delay penalty for processing packets of a server destined for a client. The server-side intermediary may be in communication via links of different latencies with a client-side intermediary. The server-side intermediary may select a second link with a latency that deviates from the lowest latency of a first link by the delay penalty. The server-side intermediary may transmit, to the client-side intermediary, duplicates of the packets via the selected second link with information indicating to hold the duplicates at the client-side intermediary. The server-side intermediary may receive an indication to drop or send the duplicates to the client. The server-side intermediary may transmit the indication to the client-side intermediary to drop or send the duplicates according to the indication.

Conventional internet routing is handled using routing protocols such as the Border Gateway Protocol (BGP). However, simple BGP does not account for latency, packet loss, or cost. To address this problem, smart routing systems that route traffic fast and in a cost-effective manner are implemented. In one approach, smart routing systems measure, compare, and analyze round-trip latencies and other metrics between a customer premises and one or more endpoints. Optimal inbound and outbound transit providers are selected for each endpoint based on these measurements. Other smart routing systems collect and analyze Real User Monitoring (RUM) data to predict latency performance of different content origins for serving data to a particular client based on the client's IP address and the content origins' IP addresses, which are ranked by performance. These rankings are used to steer traffic along lower latency paths by resolving Domain Name System (DNS) queries based on the performance associated with the IP addresses.

Provided is a machine-implemented method for operating a device in a network, comprising entering the device into a non-router membership relation with a self-organizing subnet of the network; receiving at least one message making known parameters of the subnet, the at least one message comprising a centrally-generated and propagated sequence number; detecting, based on the received at least one message comprising a sequence number, a deterioration in propagation of said at least one message; and responsive to the detecting, entering the device into a router membership relation with the self-organizing subnet of the network.

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.

A first network device detects a link down event associated with a second network device, where the link down event is detected by the first network device prior to being detected by a third network device, and the second network device is a designated network device of a network. The first network device starts a delay timer before processing the link down event, and detects an event that includes at least one of receipt, from the third network device, of a link state advertisement message based on the link down event, or an expiration of the delay timer. The first network device determines the first network device to be a new designated network device for the network based on detecting the event, and provides, to the third network device, information indicating that the first network device is the new designated network device for the network.

Deploying a point of presence (PoP) changes traffic flow to a cloud service provider. To determine if the PoP improves the performance of a cloud service to a client, actual network latencies between the client and the cloud service are measured. In more complex scenarios, multiple PoPs are used. The client sends multiple requests for the same content to the cloud provider. The requests are sent via different routes. The cloud provider serves the requests and collates the latency information. Based on the latency information, a route for a future request is selected, resources are allocated, or a user interface is presented. The process of determining the latency for content delivered by different routes may be repeated for content of different sizes. A future request is routed along the network path that provides the lowest latency for the data being requested.

Described embodiments provide systems and methods for path selection proportional to a penalty delay in processing packets. A server-side intermediary may identify a delay penalty for processing packets of a server destined for a client. The server-side intermediary may be in communication via links of different latencies with a client-side intermediary. The server-side intermediary may select a second link with a latency that deviates from the lowest latency of a first link by the delay penalty. The server-side intermediary may transmit, to the client-side intermediary, duplicates of the packets via the selected second link with information indicating to hold the duplicates at the client-side intermediary. The server-side intermediary may receive an indication to drop or send the duplicates to the client. The server-side intermediary may transmit the indication to the client-side intermediary to drop or send the duplicates according to the indication.

A method of control Maximum Transmission Unit (MTU) reporting and discovery using AT commands is proposed. In communications networks, the MTU of a communication protocol of a layer is the size (in bytes or octets) of the largest protocol data unit that the layer can pass onwards. In an IP network, IP packets may be fragmented if the supported MTU size is smaller than the packet length. In accordance with one novel aspect, the packet data protocol (PDP) context of a packet data network (PDN) connection comprises MTU information. By introducing MTU information to the PDP contexts, TE can use AT commands to query MTU parameters from the network and thereby avoid fragmentation. TE can also use AT command to set MTU parameters and thereby control MTU discovery.