A method for autonomously selecting low-latency data routing paths across the Internet by a distributed system includes in response to a data transfer need between a first node in a first pulse group and a second node in a second pulse group, automatically forming a third pulse group comprising the first node, the second node, and at least one additional node from the first pulse group or the second pulse group, automatically measuring one-way latencies between nodes in the third pulse group, including a first one-way latency for a direct path from the first node to the second node, automatically determining a lower-latency data routing path from the first node to the second node through a relay node based on the one-way latencies in the third pulse group, and sending data from the first node to the second node along the lower-latency data routing path via the relay node.

Techniques for utilizing Software-Defined Field-Area Network (SD-FAN) controllers to receive a geographic location and transmission power of individual nodes and generate a geographic location topology of a Field-Area Network (FAN) to provide nodes with location-aware route paths for data transmission. One or more SD-FAN controller(s) may maintain a geographic location database to store the geographic location and transmission power of the individual nodes. Each node may utilize a Destination Address Object to advertise its geographic location and transmission power to the SD-FAN controller. The SD-FAN controller(s) may utilize the geographic location table to generate the geographic location topology of the FAN and determine a location-aware route path for optimized data transmission between nodes in the FAN.

Embodiments of the present disclosure relate to a method, an electronic device, and a computer program product for cross-regional data searching. The method includes acquiring a data identifier of target data in response to receiving a searching request for the target data at a first node. The method includes determining, based on the data identifier, a second node storing metadata of the target data, wherein both the first node and the second node are located in a first region, and the metadata includes the data identifier. The method further includes determining, based on the metadata, a third node storing the target data, wherein the third node is located in a second region different from the first region.

A device may include a memory storing instructions and a processor configured to execute the instructions to identify a communication link between a first domain object and a second domain object; identify a first endpoint associated with the first domain object and a second endpoint associated with the second domain object; and determine a location relationship between the first endpoint and the second endpoint. The processor may be further configured to select a communication mechanism based on the determined location relationship; instruct the first endpoint to communicate with the second endpoint using the selected communication mechanism; and instruct the second endpoint to communicate with the first endpoint using the selected communication mechanism.

Embodiments of this application disclose 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.

Techniques for centralized application-layer routing at the edge of an online application service provider network. In one embodiment, for example, a method comprises storing data representing a directed graph; based at least on a respective cost and the respective capacity associated with directed edges in the directed graph, determining a respective edge flow value for each directed edge; based at least on the respective edge flow value for a particular directed edge that connects a first node in directed graph to a second node in the directed graph, determining a weight for a location in a data communications network represented by the second node; receiving an application-layer request message at a location in the network represented by the first node; and selecting, based at least on the weight, the location represented by the second node to which to route the application-layer request message in the network.

The present invention is provides a method and apparatus for routing a data packet in a network. For each nearby device capable of routing the packet toward a further destination, an associated cost or utility is determined. The device with lowest cost or highest utility is selected and the packet is forwarded toward same. The selecting may use a comparator tree. The cost or utility may be associated with forwarding the data packet from the candidate device toward the further destination. The cost or utility may be based on a distance from candidate device to the further destination, and may be determined using a Haversine function or approximation thereof, or by computing an inner product of a first vector and a second vector originating at a center of Earth, the first vector directed toward the candidate device, the second vector directed toward the further destination.

In various embodiments, an apparatus, a non-transitory computer-readable media, and a method are provided, involving a technique to: receive, from at least one other node in a network, a plurality of segment identifiers, utilizing at least one of a link state protocol, a distance vector protocol, or a path vector protocol, store, in a data structure, the plurality of segment identifiers associated with nodes represented in a topology of at least a portion of a network, select, from the plurality of segment identifiers in the data structure and based on a specified policy, a first sequence of segment identifiers that identify a first sequence of at least one of: one or more nodes, one or more network interfaces, or one or more network regions, at least partially in a first path segment that communicatively couples the transmitting node with a receiving node in the network and that includes at least one particular node which is not predetermined by the first sequence of segment identifiers such that the at least one particular node is determined during routing of data between the transmitting node and the receiving node, identify, based on a segment identifier in a first subsequence, of the first sequence of segment identifiers, that precedes a second subsequence of the first sequence of segment identifiers, a first network interface of the transmitting node in the first path segment, store at least the second subsequence of the first sequence of segment identifiers in a header associated with a first packet, and transmit, via the first network interface, the first packet for delivering the data in a payload of the first packet to the receiving node in the network.

Methods and systems are described for associating a name with a network path. In an aspect, a first message is received, from a first node by a second node via a first network path in a network. A first symbolic identifier of the first node is identified, wherein the first network path includes a first hop included in communicatively coupling the first node and the second node. Second path information is identified that identifies a second hop in a second network path included in communicatively coupling the second node and a third node. A second message is sent, identifying the first symbolic identifier and the first hop, to the third node via the second hop to associate the first symbolic identifier with a third network path that includes a node included in at least one of the first hop and the second hop.

Aspects of the subject disclosure may include, for example, a network device that accesses internet protocol addresses associated with a group of end point devices where the network device is a closest network device to the group of end point devices, and transmitting data to another network device responsive to a determination that an internet protocol address associated with the data from an end point device is one of the internet protocol addresses associated with the group of end point devices. Other embodiments are disclosed.