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.

A highly predicable quality shared distributed memory process is achieved using less than predicable public and private internet protocol networks as the means for communications within the processing interconnect. An adaptive private network (APN) service provides the ability for the distributed memory process to communicate data via an APN conduit service, to use high throughput paths by bandwidth allocation to higher quality paths avoiding lower quality paths, to deliver reliability via fast retransmissions on single packet loss detection, to deliver reliability and timely communication through redundancy transmissions via duplicate transmissions on high a best path and on a most independent path from the best path, to lower latency via high resolution clock synchronized path monitoring and high latency path avoidance, to monitor packet loss and provide loss prone path avoidance, and to avoid congestion by use of high resolution clock synchronized enabled congestion monitoring and avoidance.

Systems and techniques are provided for multi-hop path finding. Order data describing an order may be received. The order data may include a currency pair, a price level, and a volume. A one-hop path structure may be generated based on the order data describing the order. The one-hop path structure may include one-hop paths for the currency pair. The one-hop path structure may be written to a first ring buffer. The one-hop path structure may be read from the first ring buffer. Two-hop path structures may be generated by joining the one-hop path structure with other one-hop path structures. A value for the relative importance of the two-hop path structures may be determined to be greater than a threshold. Combined two-hop path structures may be written to a second ring buffer when the value for the relative importance of the two-hop path structures is greater than the threshold.

Systems and methods reduce delivery delay jitter in a delivery network. A processor identifies a plurality of routes between an originating node and a destination node. Each route has a respective mean delivery delay time and a respective delivery delay jitter. The processor solves a convex optimization problem for a plurality of values of delivery delay, thereby yielding a plurality of solutions. Each solution represents a corresponding allocation of traffic among the plurality of routes. Each allocation of traffic has a corresponding mean delivery delay time and a corresponding mean delivery delay jitter. The processor selects, from the plurality of solutions, a selected solution, which has a mean delivery delay jitter less than the delivery delay jitter of any route of the plurality of routes. Traffic is automatically distributed over the plurality of routes according to the allocation of traffic that corresponds to the selected solution.

A method including receiving, in a controller, from a client device in a network, a resolution query specifying a host name, is provided. The method includes parsing the resolution query to determine whether the host name is associated with an core host or with a public host, and directing the resolution query to a remote domain name system server dedicated to service the core host when the host name is associated with an enterprise name. The method also includes directing the resolution query to a local domain name system server when the host name is associated with a public service provided by the public host. A system to perform the above method is also provided.

A network element (NE) in a zone routing network includes a memory, receiver, processor, and transmitter. The memory stores a routing information base (RIB) identifying a first next-hop node for a first path in the network to reach a network controller of the network via a first communication node in the network. The first communication node is directly associated with the network controller. The receiver receives a first label-switched path (LSP) creation request message requesting creation of a first LSP through the network. The first LSP creation request message indicates an ingress node of the first LSP. The processor determines that the NE corresponds to the ingress node of the first LSP. The transmitter sends a first LSP creation response message towards the network controller via the first communication node according to the first path to indicate a creation status of the first LSP.

In one implementation, the present invention provides a mechanism for balanced ad-hoc network formation. To achieve the for balanced ad-hoc network formation, the present invention sends the metric information with DIO control message. A new metric container type is introduced in RPL to hold the metric information, and select the parent with minimum path cost, and switch the parent with minimum path cost, as per the defined logic. A stateless metric considers that the average traffic flow from each node is approximately same. The stateless metric directly uses the number of routing table entries (RT.sub.size) to decide which path to use. A stateful metric, wherein the node keeps a track of packets processed per second by itself. For stateful metric, the node maintains packets processed rate (PPR) variable, which is then used as the metric.

Systems and methods for route finding in networks and/or in a network of networks. A server is communicatively coupled to a datastore, which hosts a model of an industry of Internet infrastructure as a graph. Nodes of the graph represent physical infrastructure components that make up various networks that, collectively, interconnect with one another, infrastructure components that house the physical infrastructure components, and entities owning and/or operating any of these equipment and facilities. Edges of the graph, which are preferably directed in nature as defined by labels, represent the relationships between the physical infrastructure components. The server hosts and employs a route- finding application that utilizes the graph to search for an optimal path between nodes of the graph responsive and according to user-specified criteria.

A device can receive, from a node in a core network, application identifiers associated with applications accessible by a first user device. The application identifiers can be associated with latency requirements. The device can obtain, from the first user device, a first packet associated with a first packet flow. The device can compare information regarding the first packet flow, and the application identifiers to determine that the first packet is destined for a low-latency application having a specified latency range. The device can identify a first low-latency bearer that satisfies the specified latency range associated with the low-latency application. The device can map the first packet flow to the first low-latency bearer, and communicate packets, associated with the first packet flow, using the first low-latency bearer. The packets can include data packets communicated between an entity hosting the low-latency application and the first user device, while bypassing the core network.

A method as implemented in a controller in a SDN: (a) receiving service function chain orders of packet flows comprising a service function chain; (b) receiving, in real-time, delay measurements from either one of the virtual network functions and/or one of the network switches; (c) determining a plurality of realizations of the service function chain orders of (a) in order to minimize a total delay; (d) choosing an optimal realization corresponding to a least delay; and (e) determining one or more flow rules for the one or more network switches, the determining based on the optimal realization in (d). A controller and an article of manufacture implementing such a method are also described.