ROUTING IN FAT TREE NETWORKS USING NEGATIVE DISAGGREGATION ADVERTISEMENTS

    公开(公告)号:US20200177490A1

    公开(公告)日:2020-06-04

    申请号:US16781270

    申请日:2020-02-04

    Abstract: A particular fat tree network node stores default routing information indicating that the particular fat tree network node can reach a plurality of parent fat tree network nodes of the particular fat tree network node. The particular fat tree network node obtains, from a first parent fat tree network node of the plurality of parent fat tree network nodes, a negative disaggregation advertisement indicating that the first parent fat tree network node cannot reach a specific destination. The particular fat tree network node determines whether the first parent fat tree network node is the only parent fat tree network node of the plurality of parent fat tree network nodes that cannot reach the specific destination. If so, the particular fat tree network node installs supplemental routing information indicating that every parent fat tree network node except the first parent fat tree network node can reach the specific destination.

    Isolation networks for computer devices

    公开(公告)号:US10608843B2

    公开(公告)日:2020-03-31

    申请号:US15485673

    申请日:2017-04-12

    Abstract: In one embodiment, a server instructs one or more networking devices in a local area network (LAN) to form a virtual network overlay in the LAN that redirects traffic associated with a particular node in the LAN to the server. The server receives the redirected traffic associated with the particular node. The server trains a machine learning-based behavioral model for the particular node based on the redirected traffic. The server controls whether a particular redirected traffic flow associated with the node in the LAN is sent to a destination of the traffic flow using the trained behavioral model.

    Distributed and centralized modes for isolation networks

    公开(公告)号:US10579942B2

    公开(公告)日:2020-03-03

    申请号:US15485701

    申请日:2017-04-12

    Abstract: In one embodiment, a networking device in a local area network (LAN) receives an instruction from a server to form a virtual network overlay in the LAN that redirects traffic associated with a particular node in the LAN to the server for analysis. The networking device establishes the virtual network overlay in the LAN to redirect traffic associated with the particular node to the server. The networking device determines that at least a portion of the traffic associated with the particular node should be processed locally within the LAN and not via redirection to the server and adjusts the virtual network overlay to process the at least a portion of the traffic associated with the particular node locally within the LAN and not via redirection to the server.

    Predictive time allocation scheduling for computer networks

    公开(公告)号:US10554560B2

    公开(公告)日:2020-02-04

    申请号:US15711417

    申请日:2017-09-21

    Abstract: In one embodiment, a device in a network receives data regarding traffic volumes of deterministic and non-deterministic traffic along a first path in the network. The device predicts, using the received data, an increase in the traffic volume of the non-deterministic traffic along the first path in the network. The device identifies a period of time associated with the predicted increase in the traffic volume of the non-deterministic traffic along the first path. The device causes the deterministic traffic to be sent along a second path in the network during the identified period of time, to allow the first path to accommodate the predicted increase in the traffic volume of the non-deterministic traffic along the first path.

    VERTICAL COLLISION AVOIDANCE IN LLNs
    447.
    发明申请

    公开(公告)号:US20190335479A1

    公开(公告)日:2019-10-31

    申请号:US15962035

    申请日:2018-04-25

    Abstract: In one embodiment, a device receives data indicative of a routing topology of a network. The network comprises a root node and each node in the network has an associated network depth relative to the root node in the routing topology. The device assigns the nodes in the network to timeslots of a channel-hopping communication schedule in order of their associated network depths. The device assigns transmit and receive actions to the timeslots of the communication schedule for a particular time such that parent-to-child and child-to-parent communications alternate with network depth in the timeslots. The device sends the communication schedule with the node and action assignments to one or more of the nodes in the network.

    ROUTING IN FAT TREE NETWORKS USING NEGATIVE DISAGGREGATION ADVERTISEMENTS

    公开(公告)号:US20190327166A1

    公开(公告)日:2019-10-24

    申请号:US16160481

    申请日:2018-10-15

    Abstract: A particular fat tree network node stores default routing information indicating that the particular fat tree network node can reach a plurality of parent fat tree network nodes of the particular fat tree network node. The particular fat tree network node obtains, from a first parent fat tree network node of the plurality of parent fat tree network nodes, a negative disaggregation advertisement indicating that the first parent fat tree network node cannot reach a specific destination. The particular fat tree network node determines whether the first parent fat tree network node is the only parent fat tree network node of the plurality of parent fat tree network nodes that cannot reach the specific destination. If so, the particular fat tree network node installs supplemental routing information indicating that every parent fat tree network node except the first parent fat tree network node can reach the specific destination.

    Latency correction between transport layer host and deterministic interface circuit

    公开(公告)号:US10439940B2

    公开(公告)日:2019-10-08

    申请号:US15787790

    申请日:2017-10-19

    Abstract: In one embodiment, a method comprises establishing, by a deterministic device interface circuit, a deterministic link with a peer deterministic interface circuit within a deterministic data network based on identifying a repeating deterministic schedule for transmitting each data packet, allocated to the deterministic schedule, at a corresponding transmission instance coinciding with a reception instance by the peer deterministic interface circuit; determining a latency between sending a request for data to a host device via a non-deterministic data link provided by a network switch, and receiving from the host device a transport layer packet responsive to the request; and sending an instruction to the host device for initiating transfer of the transport layer packet, the instruction correcting for the latency and enabling the deterministic device interface circuit to receive the transport layer packet for transmission of a corresponding data packet on the deterministic link at the corresponding transmission instance.

    Multi-homed load-balanced rate-based tunnels

    公开(公告)号:US10425339B2

    公开(公告)日:2019-09-24

    申请号:US15332020

    申请日:2016-10-24

    Abstract: In one embodiment, a splitting device in a computer network transmits to a combining device first and second portions of a data stream via first and second tunnels, respectively, where packets of the data stream indicate a time of transmission of the packets from the splitting device, a first and second transmission rate of the packets on a respective one of the first and second tunnels, and sequencing information of the packets within the data stream. The splitting device receives from the combining device a first and second receive rate of the packets for each of the first and second tunnels, respectively. In response to the first receive rate being less than the first transmission rate, the splitting device reduces the first transmission rate and increases the second transmission rate.

Patent Agency Ranking