H04L12/727

Data Transmission Method and Apparatus
20200044956 · 2020-02-06 ·

The method includes, when a first data packet of a data stream is received and the first data packet is not the first data packet of the data stream, determining a time interval between a first receiving time and a second receiving time, where the first receiving time is when the first data packet is received, and the second receiving time is when a second data packet is received, obtaining a sent data amount of the data stream, and determining a transmission path of the first data packet from a plurality of available transmission paths based on the time interval and the sent data amount, and transmitting the first data packet through the determined transmission path.

SYSTEM AND PROCESS FOR GENERALIZED REAL-TIME TRANSPORT PROTOCOL STREAM SEGMENTATION AND RECONSTRUCTION
20200045352 · 2020-02-06 ·

There is provided a network device comprising at least one processor, and a memory storing instructions which when executed by the at least one processor configure the processor to perform a method. The method comprises segmenting packets of an original data stream into at least two partial data streams, and transmitting the at least two partial data streams to a downstream receiver configured to consolidate the at least two partial data streams based on the sequence numbers of the original data stream to reconstruct the original data stream. Each of the at least two partial data streams has an identifier in a header. The at least two partial data streams maintain sequence numbers of the original data stream.

Dynamic link state routing protocol
10554538 · 2020-02-04 · ·

A router and methods for routing packets in a network are described. The router and methods are implemented with a dynamic link state routing protocol (DLSP). The router dynamically computes a best path from one or more paths by periodically probing links of peer nodes to determine link metrics associated with a link. The one or more link metrics include a link bandwidth to a peer node and a link latency to the peer node. Further, the router can dynamically recalculate the one or more link metrics associated with the link every 10 seconds. The router can also monitor one or more link state changes based on the one or more link metrics, wherein the link state changes are monitored every 60 second. The router can further determine a single link metric based on the link bandwidth to the peer node and the link latency to the peer node.

PROPAGATING AN INTELLIGENT WALKER AGENT IN A NETWORK TO PERFORM A COMPUTATION

In one embodiment, a device in a network receives a path computation agent configured to determine a path in the network that satisfies an objective function. The device executes the path computation agent to update state information regarding the network maintained by the path computation agent. The device selects a neighbor of the device in the network to execute the path computation agent based on the updated state information regarding the network. The device instructs the selected neighbor to execute the path computation agent with the updated state information regarding the network. The device unloads the path computation agent from the device after selecting the neighbor of the device to execute the path computation agent.

DISTRIBUTED ANTENNA SYSTEM PROVIDING REDUNDANCY
20200008128 · 2020-01-02 ·

A method of configuring a distributed antenna system (DAS) having digital remote units configured to provide a DAS interface to wireless communication devices connecting to the DAS, and at least one digital master unit configured to provide a DAS interface to base stations connecting to the DAS. The method includes connecting digital remote units such that each digital remote unit is connected either to at least another digital remote unit and the digital master unit or to at least two other digital remote units. The method further includes connecting at least one of the digital remote units either to other the digital remote units and the digital master unit, or to at least three other digital remote units, and connecting the digital master unit to at least two of the digital remote units, thereby providing at least one path for redundant data transport.

Method for prioritization of internet traffic by finding appropriate internet exit points

The systems and methods discussed herein provide for faster communications, particularly for high priority traffic, across a distributed network with multiple exit points to a Wide Area Network. Rather than simply routing traffic based on internal or external destination, an intelligent router may measure latency to an endpoint destination via multiple paths, both external and internal, and direct traffic accordingly. Steering high priority traffic via the internal connection to an exit point near the destination server, and then to the server via the external network, may be faster than simply forwarding the connection via the external network from the exit point closest to the source device. Additionally, to reduce bandwidth requirements of the nearby exit point and provide capability for higher priority traffic, low priority traffic may be redirected back via the internal connection and transmitted via a distant exit point.

Multi-hop path finding
10511520 · 2019-12-17 · ·

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.

Enabling resilient microgrid through ultra-fast programmable network

Systems and methods for integrating ultra-fast programmable networks in microgrid are disclosed to provide flexible and easy-to-manage communication solutions, thus enabling resilient microgrid operations in face of various cyber and physical disturbances. The system is configured to establish a novel software-defined networking (SDN) based communication architecture which abstracts the network infrastructure from the upper-level applications to significantly expedite the development of microgrid applications, develop three functions of the SDN controller for microgrid emergency operations, including time delay guarantee, failover reconfiguration and rate limit and create a hardware-in-the-loop cyber-physical platform for evaluating and validating the performance of the presented architecture and control techniques.

MULTI-HOP PATH FINDING
20190372885 · 2019-12-05 ·

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.

MINIMIZATION OF NETWORK DOWNTIME
20190372884 · 2019-12-05 ·

Methods for systems are provided. In one aspect, a method for minimizing a network outage includes identifying one or more paths connecting a resource node of the network to an edge switch of one or more edge switches of the network. Each edge switch is connected to one or more endpoint devices to allow resources coupled to the resource node to be provided to the one or more endpoint devices. The method further includes calculating endpoint downtime costs corresponding to rebooting each of the common switches in the network. The common switches are present in all paths connecting the resource node to the edge switch. The calculated endpoint downtime costs corresponding to the one or more common switches are compared. One of the common switches with a highest endpoint downtime cost is identified as a candidate switch for redundancy based on the comparison.