A path selection apparatus in a sensor tree includes a node moving unit that selects a first node in the sensor tree, and moves a second node to under a third node in the sensor tree if the total number of packets transmitted and received in the sensor tree is reduced as a result of the second node being moved to under the third node, the first node having a child node under the first node, the second node being located under a subtree of which a vertex is the first node, the third node not belonging to the subtree. If nodes under the subtree of which the vertex is the first node do not include anode that reduces the total number of packets as a result of being moved, the node moving unit moves a node that is included in the nodes under the subtree and does not change the total number of packets, to under the third node.

A node device for forming a multi-hop network is provided. The node device is configured to avoid interference from coexisting interfering networks and includes a transceiver configured to receive and transmit data with respect to a Destination Oriented Directed Acyclic Graph (DODAG) Information Object message (DIO message), a memory configured to store computer executable programs including an interfered-node count (IC), single-rate link count (SLC), multi-rate link count (MLC), hop count (HP), path communication latency (PCL) and an interference efficient and multi-rate supported routing program CoM-RPL, and a processor configured to perform steps of the computer executable programs. The steps include determining if the received DIO message indicates a new DODAG or an existing DODAG. In this case, if a determined result in the determining indicates the new DODAG and no single-rate link and no interfered node on a path of multi-hop network, the node device joins DODAG network and the processor selects a sender of the DIO message as a default parent, computes a rank for itself, updates DIO message with its rank, IC, SLC, TRM, HP, PCL and transmits scheduled DIO messages based on transmission rate mode.

The system disclosed herein implements an improved end-to-end network performance for data transmissions that span multiple networks operated by different organizations. The improvements are achieved as a result of exchanging routing information. For instance, the exchanged routing information can be representative of network performance factors. When different operators of different networks agree to exchange routing information, an optimal end-to-end path between two endpoint devices can be identified and selected for data transmission. This benefits both network operators as the users served by the networks are more likely to be satisfied with the user experience (e.g., faster download and upload of data).

Embodiments herein disclose path selection for data traffic within a software-defined wide area network using traffic metrics. Some embodiments relate to a method that includes polling peers of the SD-WAN for traffic metrics, receiving traffic metrics from at least a portion of the peers, combining the received traffic metrics, calculating performance of a plurality of possible paths from a source node to a destination node, the nodes being within the SD-WAN topology, and selecting a path from the source node to the destination node based on the calculated performance.

Systems including at least one processor and a memory storing instructions that, when executed by the at least one processor, result in the system collecting real-time telemetry measurements for packets received at each hop of an overlay network, and the system injecting the measurements into a variable-length trailers of the packets.

A computer-implemented method determines a routing cost for routing data over a routing path between a first device in a first network and a second device, wherein the routing path has a path segment between a gateway device of the first network and a device in a second network, the gateway device being configured to establish a connection between the first and second networks. This method may include determining a routing cost for the path segment, the routing cost for the path segment having a default routing cost value that is based on capabilities of the gateway device and/or the communication technology; and determining the routing cost for the routing path based on the routing cost for the path segment. The invention furthermore relates to determining a route based on the routing cost, and to routing a data packet based on the route.

Logical Channel Prioritization (LCP) may be enhanced by accounting for Quality of Service (QoS) attributes of single hop and multi-hop paths. QoS attributes may be communicated as a QoS budget comprising a number of attributes, or as a single composite QoS “resistance” factor that quantifies the compounded impact of number of hops, latency, load conditions, and the like. The QoS budget or resistance may dynamically adjusted, and may be used by LCP to provide differentiated uplink resource allocation to data of the bearer or logical channel subject to different transmission paths between the transmitter and the receiver, for example. QoS budget and resistance information may be used to, e.g., enhance Buffer Status Report (BSR) and Scheduling Request (SR) operations.

Methods and systems are provided for performing lossy dropping and ECN marking in a flow-based network. The system can maintain state information of individual packet flows, which can be set up or released dynamically based on injected data. Each flow can be provided with a flow-specific input queue upon arriving at a switch. Packets of a respective flow are acknowledged after reaching the egress point of the network, and the acknowledgement packets are sent back to the ingress point of the flow along the same data path. As a result, each switch can obtain state information of each flow and perform per-flow packet dropping and ECN marking.

A method may include obtaining a topology of an optical network. The topology may indicate multiple optical links within the optical network. The method may also include obtaining a routing metric for each of the optical links. The routing metric may be used in selecting routes through the optical network along the multiple optical links. The method may further include obtaining a signal noise tolerance of an optical signal to be routed through the optical network and adjusting routing metrics of one or more of the multiple optical links based on the signal noise tolerance of the optical signal. The method may also include after the routing metrics of the one or more of the multiple optical links are adjusted, determining a route for the optical signal through the optical network along two or more of the multiple optical links based on the routing metrics of the multiple optical links.

A method may include obtaining a topology of an optical network. The topology may indicate multiple optical links within the optical network. The method may also include determining a signal noise tolerance for each of multiple optical signal types supported by the optical network and obtaining an optical noise for each of the multiple optical links. The method may also include determining a number of the multiple optical signal types that each of the multiple optical links is able to support based on the optical noise for each of the optical links and the signal noise tolerance for each of the multiple optical signal types and ranking the multiple optical links based on the number of the multiple optical signal types that each of the optical links is able to support.