SYSTEMS AND METHODS TO PROVIDE HYPERTEXT TRANSFER PROTOCOL 2.0 OPTIMIZATION THROUGH MULTIPLE LINKS

    公开(公告)号:US20180063220A1

    公开(公告)日:2018-03-01

    申请号:US15251747

    申请日:2016-08-30

    Abstract: A method for optimizing different data streams which flow through an HTTP/2 connection. The methods involve: establishing at least first and second network connections between a first network appliance and a second network appliance prior to knowing how many HTTP/2 data streams are being multiplexed over the HTTP/2 connection; determining, by the first network appliance, a QoS of each WAN link of a plurality of WAN links; receiving, by the first network appliance, a first HTTP/2 data packet communicated over the HTTP/2 connection; obtaining a first priority designator and a first data stream's identifier contained in the packet header of the first HTTP/2 data packet; and allocating the first HTTP/2 data packet of a first data stream to the first or second network connection based on the first data stream's priority and the WAN links' QoS.

    SYSTEMS AND METHODS TO EARLY DETECT LINK STATUS OF MULTIPLE PATHS THROUGH AN EXPLICIT CONGESTION NOTIFICATION BASED PROXY

    公开(公告)号:US20180063009A1

    公开(公告)日:2018-03-01

    申请号:US15251807

    申请日:2016-08-30

    CPC classification number: H04L47/32 H04L47/25 H04W28/0284

    Abstract: Systems and methods for early detection of link status of multiple paths through a first network. The methods comprise: receiving, by a first network appliance, a first packet sent from a second network appliance over a first data link established between the first and second network appliances which support Explicit Congestion Notification (“ECN”); determining, by the first network appliance, whether a quality of the first data link indicates future congestion in the first network; and communicating a packet drop notification from the first network appliance to a first end node over a second data link established in a second network different from the first network if (a) the quality of the first data link does indicate future congestion and (b) an ECN bit contained in a header of the first packet is marked. The first end node is incompatible or does not support ECN.

    NETWORK ROUTING THROUGH AN OVERLAY NETWORK
    6.
    发明申请

    公开(公告)号:US20180062986A1

    公开(公告)日:2018-03-01

    申请号:US15252821

    申请日:2016-08-31

    CPC classification number: H04L45/64 H04L43/08 H04L45/124 H04L47/12 H04L67/1061

    Abstract: Computer networking device obtains route information including route attributes specifying characteristics for each of a plurality of routes through a first network. A routing algorithm is applied to choose an optimal route to one of a plurality of peer computer networking devices comprising a second network which is an overlay upon the first network. The optimal route is chosen based on the type of data contained in the data packet and the plurality of route attributes associated with the routes. The routes traverse paths through the first computer network which include network nodes other than the peer networking devices.

    Systems and methods for inventory discovery in a network

    公开(公告)号:US10862756B2

    公开(公告)日:2020-12-08

    申请号:US15928160

    申请日:2018-03-22

    Abstract: Systems and methods for identifying a new device in an internet of things (IoT) network comprising a plurality of devices. The method includes, by a processor: detecting that a new device has been added to the IoT network; receiving identification data corresponding to the new device; determining a first device identification using a deep learning algorithm; determining a second device identification using a clustering algorithm; determining a third device identification based on a reference table; determining a fourth device identification by analyzing one or more values included in the identification data. The method further includes selecting, at least one of the first device identification, the second device identification, the third device identification, or the fourth device identification, as a final device identification by performing a weighted selection.

    Network routing using dynamic virtual paths in an overlay network

    公开(公告)号:US10153964B2

    公开(公告)日:2018-12-11

    申请号:US15259285

    申请日:2016-09-08

    Abstract: A computer networking appliance includes a networking device to route data through an overlay network. The networking device is connected to a first computer network and receives a data packet to be communicated to a destination computing device. The networking device analyzes the packet to determine a minimum bandwidth requirement corresponding to the data packet, and the destination computing device connected to a second computer network. The networking device then dynamically identifies a plurality of paths to the destination computing device, uses the minimum bandwidth requirement to obtain path information for each of the plurality of paths, and chooses an optimal path to the destination computing device from among the plurality of paths based on a plurality of path metrics associated with each of the plurality of paths.

    NETWORK ROUTING USING DYNAMIC VIRTUAL PATHS IN AN OVERLAY NETWORK

    公开(公告)号:US20180069780A1

    公开(公告)日:2018-03-08

    申请号:US15259285

    申请日:2016-09-08

    Abstract: A computer networking appliance includes a networking device to route data through an overlay network. The networking device is connected to a first computer network and receives a data packet to be communicated to a destination computing device. The networking device analyzes the packet to determine a minimum bandwidth requirement corresponding to the data packet, and the destination computing device connected to a second computer network. The networking device then dynamically identifies a plurality of paths to the destination computing device, uses the minimum bandwidth requirement to obtain path information for each of the plurality of paths, and chooses an optimal path to the destination computing device from among the plurality of paths based on a plurality of path metrics associated with each of the plurality of paths.

Patent Agency Ranking