GENERATING TRUSTABLE RPL MESSAGES HAVING ROOT-SIGNED RANK VALUES

    公开(公告)号:US20200186362A1

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

    申请号:US16685058

    申请日:2019-11-15

    Abstract: In one embodiment, a method comprises: identifying, by a root network device of a directed acyclic graph (DAG) in a low power and lossy network, a child network device in the DAG, including identifying a first rank associated with the child network device; allocating, by the root network device, an allocated rank for the child network device, the allocated rank different from the first rank; and outputting, by the root network device, a message to the child network device specifying the allocated rank, the message causing the child network device to implement the allocated rank in the DAG, including causing the child network device to generate and output a Destination Oriented Directed Acyclic Graph (DODAG) information object (DIO) message specifying the child network device is using the allocated rank.

    ENDPOINT DEVICE IDENTIFICATION BASED ON DETERMINED NETWORK BEHAVIOR
    35.
    发明申请
    ENDPOINT DEVICE IDENTIFICATION BASED ON DETERMINED NETWORK BEHAVIOR 有权
    基于确定的网络行为的终端设备识别

    公开(公告)号:US20160344693A1

    公开(公告)日:2016-11-24

    申请号:US14716927

    申请日:2015-05-20

    CPC classification number: H04L61/103 H04L61/6022

    Abstract: In one embodiment, a method comprises detecting, by a network device, an endpoint device attempting to access a data network via a data link; and generating, by the network device, a unique device signature for identifying the endpoint device based on the network device identifying a sequence of link layer data packets transmitted by the endpoint device upon connection to the data link, the unique device signature identifying a behavior of the endpoint device independent of any link layer address used by the endpoint device.

    Abstract translation: 在一个实施例中,一种方法包括由网络设备检测经由数据链路尝试访问数据网络的端点设备; 以及由所述网络设备生成用于基于所述网络设备识别所述端点设备的唯一设备签名,所述网络设备标识由所述端点设备在连接到所述数据链路时发送的链路层数据分组的序列,所述唯一设备签名识别 端点设备独立于端点设备使用的任何链路层地址。

    RECURSIVE LOAD BALANCING IN A LOOP-FREE ROUTING TOPOLOGY USING ROUTING ARCS
    36.
    发明申请
    RECURSIVE LOAD BALANCING IN A LOOP-FREE ROUTING TOPOLOGY USING ROUTING ARCS 审中-公开
    使用路由ARCS的无循环路由拓扑中的平衡负载平衡

    公开(公告)号:US20150036507A1

    公开(公告)日:2015-02-05

    申请号:US14518555

    申请日:2014-10-20

    CPC classification number: H04L47/125 H04L41/0663 H04L45/02 H04L45/18 H04L45/22

    Abstract: In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination device, each routing arc comprising a first network device as a first end of the routing arc, a second network device as a second end of the routing arc, and at least a third network device configured for routing any network traffic along the routing arc toward the destination device via any one of the first or second ends of the routing arc; and load balancing the network traffic along the routing arcs based on traffic metrics obtained at the first and second ends of the routing arcs, including selectively sending a backpressure command to a first one of the routing arcs supplying at least a portion of the network traffic to a congested one of the routing arcs.

    Abstract translation: 在一个实施例中,一种方法包括在计算网络中创建包括用于到达目的地设备的多个路由弧的无环路由拓扑,每个路由弧包括作为路由电弧的第一端的第一网络设备, 第二网络设备作为路由电弧的第二端,以及至少第三网络设备,被配置为经由所述路由电弧的所述第一或第二端中的任何一个沿着所述路由电弧将任何网络业务路由到目的地设备; 以及基于在所述路由弧的第一和第二端处获得的流量度量来沿着所述路由弧负载平衡网络流量,包括选择性地向所述路由弧中的所述路由弧中的第一个提供所述网络业务的至少一部分, 拥塞的一个路由弧。

    JITTER COMPENSATION ALONG MULTIPLE-PATH DETERMINISTIC NETWORK SEGMENT

    公开(公告)号:US20190280983A1

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

    申请号:US15914238

    申请日:2018-03-07

    Abstract: In one embodiment, a method comprises identifying, by a controller device, first and second paths between an ingress network node and an egress network node in a deterministic network for an identified flow of data packets in an identified sequence, the identifying including identifying a replication node for replicating the identified flow into the first and second paths, and identifying an elimination node for receiving transmitted data packets along the first and second paths for the identified flow and transmitting the identified flow of data packets in the identified sequence; determining a jitter difference of the identified flow between the first and second paths, the jitter difference identifying a maximum jitter encountered in an average difference of latency between the first and second paths; and causing at least one of the elimination node or an upstream node along one of the first or second paths to absorb the jitter difference.

    APPLICATION BUFFERING OF PACKETS BY FOG COMPUTING NODE FOR DETERMINISTIC NETWORK TRANSPORT

    公开(公告)号:US20190149629A1

    公开(公告)日:2019-05-16

    申请号:US15813289

    申请日:2017-11-15

    Abstract: In one embodiment, a method comprises: storing, by a computing device in a non-deterministic data network, a plurality of data packets originated by a source device into a mass storage medium associated with the computing device; receiving, by the computing device, a data request originated by an access point device providing deterministic reachability to a deterministic device in a deterministic data network providing reachability to multiple deterministic devices, the request specifying one or more deterministic constraints associated with reaching the deterministic device; and supplying, by the computing device, a selected one of the data packets to the access point device for delivery of data stored therein to the deterministic device according to the one or more deterministic constraints.

    LATENCY CORRECTION BETWEEN TRANSPORT LAYER HOST AND DETERMINISTIC INTERFACE CIRCUIT

    公开(公告)号:US20190124006A1

    公开(公告)日:2019-04-25

    申请号:US15787790

    申请日:2017-10-19

    CPC classification number: H04L47/12 H04L47/193 H04L47/2416 H04L47/39

    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.

Patent Agency Ranking