PROACTIVE REFORM OF DIRECTED ACYCLIC GRAPH BY ACCELERATING PARENT ADVERTISEMENTS

    公开(公告)号:US20200014618A1

    公开(公告)日:2020-01-09

    申请号:US16026203

    申请日:2018-07-03

    Abstract: In one embodiment, a parent network device, operating according to a first Trickle operation using a first selected minimum contention interval, responds to detecting a loss of attached child network devices by starting a second Trickle operation using a second selected minimum contention interval. The second Trickle operation includes maintaining the second selected minimum contention interval for subsequent iterations of the second Trickle operation. The parent network device initiates an accelerated transmission rate of the advertisement message that is faster than the first and second Trickle operations (using a third selected minimum contention interval less than the first minimum contention interval) in response to receiving a message from one of the lost child network devices, and resumes the first Trickle operation upon recovery of all the lost child network devices.

    DETERMINISTIC STITCHING OF DETERMINISTIC SEGMENTS ACROSS DISTINCT DETERMINISTIC DOMAINS

    公开(公告)号:US20190097884A1

    公开(公告)日:2019-03-28

    申请号:US15713827

    申请日:2017-09-25

    Abstract: In one embodiment, a method comprises: receiving, by a switching device, one or more identified flows of data packets from first deterministic flows of a first deterministic segment in a first deterministic domain, the first deterministic segment established based on first deterministic attributes in the first deterministic domain; receiving, by the switching device, second deterministic attributes about second deterministic flows for a second deterministic segment in a second different deterministic domain, the second deterministic attributes different than the first deterministic attributes; and allocating, by the switching device based on the first deterministic attributes and the second deterministic attributes, at least a portion of the second deterministic flows for deterministic stitching of the one or more identified flows of data packets from the first deterministic segment in the first deterministic domain into the second deterministic segment in the second deterministic domain according to a guaranteed deterministic constraint.

    SOURCE ROUTED DETERMINISTIC PACKET IN A DETERMINISTIC DATA NETWORK

    公开(公告)号:US20180152377A1

    公开(公告)日:2018-05-31

    申请号:US15361563

    申请日:2016-11-28

    CPC classification number: H04L45/34 H04W40/04

    Abstract: In one embodiment, a method comprises receiving, by a network device in a deterministic data network, one or more deterministic schedules for reaching a destination network device along one or more deterministic paths in the deterministic data network; generating, by the network device, a deterministic source-route path for reaching the destination network device based on the deterministic schedules allocated for the deterministic paths, the deterministic source-route path comprising, for each specified hop, a corresponding deterministic start time; and outputting, by the network device, a source routed deterministic packet comprising the deterministic source-route path for deterministic forwarding of the source routed deterministic packet to the destination network device.

    BIT INDEXED EXPLICIT REPLICATION FOR DETERMINISTIC NETWORK DATA PLANE

    公开(公告)号:US20170222920A1

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

    申请号:US15271811

    申请日:2016-09-21

    Abstract: In one embodiment, a method comprises receiving, by a network device in a deterministic data network comprising deterministic segments, a data packet comprising a packet header having a bit index, each bit in the bit index associated with a corresponding one of the deterministic segments; the network device identifying, from the bit index, a first bit for a corresponding first deterministic segment and a second bit for a corresponding second deterministic segment, wherein the network device is an endpoint for transmitting deterministic traffic into each of the first and second deterministic segments; the network device selectively executing a replication operation of the data packet for transmission of a replicated data packet into each of the first and second deterministic segments, based on the network device detecting the corresponding first and second bits set for replication.

    DUPLICATE ADDRESS DETECTION BASED ON DISTRIBUTED BLOOM FILTER
    7.
    发明申请
    DUPLICATE ADDRESS DETECTION BASED ON DISTRIBUTED BLOOM FILTER 有权
    基于分布式滤波器的双重地址检测

    公开(公告)号:US20160112367A1

    公开(公告)日:2016-04-21

    申请号:US14516707

    申请日:2014-10-17

    Abstract: In one embodiment, a method comprises: generating, by a first network device in a network, a Bloom filter bit vector representing device addresses of devices having attached to at least one of the first network device or a second network device in the network; and determining whether a new device address is not a duplicate of any of the device addresses in the network based on the Bloom filter bit vector.

    Abstract translation: 在一个实施例中,一种方法包括:通过网络中的第一网络设备生成表示已连接到网络中的第一网络设备或第二网络设备中的至少一个的设备的设备地址的布隆过滤器位向量; 以及基于所述布隆过滤器比特向量来确定新的设备地址是否与所述网络中的所述设备地址中的任何设备地址不重复。

    PATH OPTIMIZATION BASED ON REDUCING DOMINATING SET MEMBERSHIP TO ESSENTIAL PARENT DEVICES

    公开(公告)号:US20200336406A1

    公开(公告)日:2020-10-22

    申请号:US16919793

    申请日:2020-07-02

    Abstract: In one embodiment, a method comprises identifying, by a path computation element, essential parent devices from a nonstoring destination oriented directed acyclic graph (DODAG) topology as dominating set members belonging to a dominating set; receiving, by the path computation element, an advertisement message specifying a first dominating set member having reachability to a second dominating set member, the reachability distinct from the nonstoring DODAG topology; and generating, by the path computation element based on the advertisement message, an optimized path for reaching a destination network device in the nonstoring DODAG topology via a selected sequence of dominating set members, the optimized path providing cut-through optimization across the nonstoring DODAG topology.

Patent Agency Ranking