DEVICE MOBILITY IN A MESH NETWORK
    62.
    发明申请
    DEVICE MOBILITY IN A MESH NETWORK 审中-公开
    网络中的设备移动性

    公开(公告)号:WO2016182725A1

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

    申请号:PCT/US2016/029317

    申请日:2016-04-26

    Abstract: In one embodiment, a device in a network receives a notification from a neighbor of the device indicative of a child node of the device requesting a parent change from the device to the neighbor. The device updates an existing routing path from the device to the child node to be routed through the neighbor, in response to receiving the notification from the neighbor. The device receives an instruction to remove the updated routing path from the device to the child node through the neighbor. The device removes the updated routing path from the device to the child node, in response to receiving the instruction to remove the updated routing path.

    Abstract translation: 在一个实施例中,网络中的设备从设备的邻居接收指示设备的子节点的通知,请求从设备到邻居的父更改。 响应于接收到来自邻居的通知,设备更新从设备到子节点的现有路由路径以路由通过邻居。 设备接收到通过邻居将更新的路由路径从设备移除到子节点的指令。 响应于接收到删除更新的路由路径的指令,设备从设备移除更新的路由路径从设备到子节点。

    RELIABLE MULTICAST IN LOW-POWER AND LOSSY NETWORKS
    63.
    发明申请
    RELIABLE MULTICAST IN LOW-POWER AND LOSSY NETWORKS 审中-公开
    在低功耗和可靠的网络中可靠的多媒体

    公开(公告)号:WO2016148940A1

    公开(公告)日:2016-09-22

    申请号:PCT/US2016/020818

    申请日:2016-03-04

    Abstract: In one embodiment, a device in a network sends a first multicast message to a plurality of destinations in the network. The first multicast message includes a first bitmap that identifies the destinations. The device receives one or more acknowledgements from a subset of the destinations. The device determines a retransmission bitmap that identifies those of the plurality of destinations that did not acknowledge the first multicast message, based on the received one or more acknowledgements. The device sends a retransmission multicast message to those of the plurality of destinations that did not acknowledge the first multicast message. The retransmission multicast message includes the retransmission bitmap.

    Abstract translation: 在一个实施例中,网络中的设备向网络中的多个目的地发送第一多播消息。 第一组播消息包括标识目的地的第一位图。 设备从目的地的子集接收一个或多个确认。 该设备基于所接收的一个或多个确认来确定识别那些未确认第一多播消息的多个目的地的重传位图。 该装置向未确认第一多播消息的多个目的地的装置发送重传多播消息。 重传多播消息包括重传位图。

    PARENT DEVICE ALLOCATION OF RETRANSMIT SLOT TO CHILD NETWORK DEVICE ON BEHALF OF PEER CHILD DEVICE IN A DETERMINISTIC NETWORK
    64.
    发明申请
    PARENT DEVICE ALLOCATION OF RETRANSMIT SLOT TO CHILD NETWORK DEVICE ON BEHALF OF PEER CHILD DEVICE IN A DETERMINISTIC NETWORK 审中-公开
    儿童网络设备在确定性网络中的同龄儿童设备上的重新设计分配

    公开(公告)号:WO2016144938A1

    公开(公告)日:2016-09-15

    申请号:PCT/US2016/021335

    申请日:2016-03-08

    Abstract: In one embodiment, a method comprises receiving, by a parent network device in a wireless deterministic network, a retransmit capabilities message from a first child device attached to the parent network device, the retransmit capabilities message specifying that the first child device can detect a data packet transmission to the parent network device by a second child device attached to the parent network device and that is a peer of the first child device; and allocating, by the parent network device, a peer retransmit times lot to the first child device from within a channel distribution chunk appropriated by the parent network device, the peer retransmit timeslot enabling the first child device to retransmit a data packet on behalf of the second child device to the parent network device.

    Abstract translation: 在一个实施例中,一种方法包括由无线确定性网络中的父网络设备从附加到父网络设备的第一子设备接收重传能力消息,所述重传能力消息指定第一子设备可以检测数据 分组由连接到所述父网络设备并且是所述第一子设备的对等体的第二子设备传送到所述父网络设备; 以及由所述父网络设备从所述父网络设备专用的信道分发块内向所述第一子设备分配对等体重传次数,所述对等体重传时隙使得所述第一子设备能够代表所述第一子设备重传数据分组, 第二个子设备到父网络设备。

    INSTALLATION OF CACHED DOWNWARD PATHS BASED ON UPWARD DATA TRAFFIC IN A NON-STORING LOW-POWER AND LOSSY NETWORK
    65.
    发明申请
    INSTALLATION OF CACHED DOWNWARD PATHS BASED ON UPWARD DATA TRAFFIC IN A NON-STORING LOW-POWER AND LOSSY NETWORK 审中-公开
    基于在非存储的低功耗和损耗网络中的上行数据通信的缓存下行缓存的安装

    公开(公告)号:WO2016112007A1

    公开(公告)日:2016-07-14

    申请号:PCT/US2016/012177

    申请日:2016-01-05

    Abstract: In one embodiment, a method comprises: receiving, by a parent network device in a directed acyclic graph (DAG) network topology, a data packet destined toward a DAG root and having been output by a target device in the network topology; identifying, by the parent network device based on the received data packet, an identifiable condition for caching a downward path enabling the parent network device to reach the target device independent of any route table entry in the parent network device; and caching, in the parent network device, the downward path enabling the parent network device to reach the target device independent of any route table entry in the parent network device.

    Abstract translation: 在一个实施例中,一种方法包括:以有向非循环图(DAG)网络拓扑中的父网络设备接收目的地为DAG根并由网络拓扑中的目标设备输出的数据分组; 由所述父网络设备基于所接收的数据分组识别用于高速缓存向下路径的可识别条件,使所述父网络设备能够独立于所述父网络设备中的任何路由表条目到达所述目标设备; 以及在父网络设备中缓存使得父网络设备能够独立于父网络设备中的任何路由表条目的目标设备的向下路径。

    DYNAMIC INSTALLATION OF LOCAL STORING MODE PATHS IN A NON-STORING LOW-POWER AND LOSSY NETWORK
    66.
    发明申请
    DYNAMIC INSTALLATION OF LOCAL STORING MODE PATHS IN A NON-STORING LOW-POWER AND LOSSY NETWORK 审中-公开
    非存储低功耗网络中本地存储模式的动态安装

    公开(公告)号:WO2016040312A1

    公开(公告)日:2016-03-17

    申请号:PCT/US2015/048924

    申请日:2015-09-08

    Abstract: In one embodiment, a method comprises identifying, by a network device operating in a network topology as a directed acyclic graph (DAG) root, a source-route path for reaching a destination device in the network topology; determining whether one or more parent devices along the source-route path between the network device and the destination device are capable of storing a route entry specifying routing information for reaching the destination device; and causing installation of a route entry for reaching the destination device in one or more of the parent devices determined as capable of storing the corresponding route entry.

    Abstract translation: 在一个实施例中,一种方法包括通过在网络拓扑中作为有向无环图(DAG)根操作的网络设备识别用于到达网络拓扑中的目的地设备的源路由路径; 确定沿着网络设备和目的设备之间的源路由路径的一个或多个父设备是否能够存储指定用于到达目的地设备的路由信息​​的路由条目; 并且导致在被确定为能够存储对应的路由条目的一个或多个父设备中安装到达目的地设备的路由条目。

    PREDICTIVE TIME ALLOCATION SCHEDULING FOR TSCH NETWORKS
    67.
    发明申请
    PREDICTIVE TIME ALLOCATION SCHEDULING FOR TSCH NETWORKS 审中-公开
    TSCH网络的预测时间分配调度

    公开(公告)号:WO2016014331A1

    公开(公告)日:2016-01-28

    申请号:PCT/US2015/040719

    申请日:2015-07-16

    Abstract: In one embodiment, a device in a network receives one or more time slot usage reports regarding a use of time slots of a channel hopping schedule by nodes in the network. The device predicts a time slot demand change for a particular node based on the one or more time slot usage reports. The device identifies a time frame associated with the predicted time slot demand change. The device adjusts a time slot assignment for the particular node in the channel hopping schedule based on predicted demand change and the identified time frame associated with the predicted time slot demand change.

    Abstract translation: 在一个实施例中,网络中的设备接收关于使用网络中的节点的信道跳频调度的时隙的一个或多个时隙使用报告。 该设备基于一个或多个时隙使用报告来预测特定节点的时隙需求变化。 设备识别与预测的时隙需求变化相关联的时间帧。 该设备基于预测的需求变化和与预测的时隙需求变化相关联的识别的时间帧来调整信道跳频调度中的特定节点的时隙分配。

    REPAIR OF FAILED NETWORK ROUTING ARCS USING DATA PLANE PROTOCOL
    68.
    发明申请
    REPAIR OF FAILED NETWORK ROUTING ARCS USING DATA PLANE PROTOCOL 审中-公开
    使用数据平面协议修复故障网络路由ARCS

    公开(公告)号:WO2015088851A1

    公开(公告)日:2015-06-18

    申请号:PCT/US2014/068316

    申请日:2014-12-03

    CPC classification number: H04L45/28 H04L41/0668 H04L45/18 H04L45/48 H04L49/557

    Abstract: A network includes multiple routing arcs for routing network traffic to a destination. Each arc comprising nodes connected in sequence by reversible links oriented away from a node initially holding a cursor toward one of first and second edge nodes through which the network traffic exits the arc. Each node includes a network device. The nodes in the arc detect a first failure in the arc. Responsive to the detecting the first failure, the nodes exchange first management frames over a data plane within the arc in order to transfer the cursor from the node initially holding the cursor to a first node proximate the first failure and reverse links in the arc as appropriate so that the network traffic in the arc is directed away from the first failure toward the first edge node of the arc through which the network traffic is able to exit the arc.

    Abstract translation: 网络包括用于将网络流量路由到目的地的多个路由弧。 每个弧包括通过可逆的链接依次连接的节点,所述可逆链接朝向远离最初保持光标的节点朝向第一和第二边缘节点之一,网络业务通过该节点离开该弧。 每个节点包括网络设备。 弧中的节点检测到弧中的第一个故障。 响应于检测到第一故障,节点通过弧内的数据平面交换第一管理帧,以将光标从最初保持光标的节点传送到靠近第一故障的第一节点,并且适当地在弧中反向链接 使得电弧中的网络流量被引导离开第一故障朝向电弧的第一边缘节点,网络业务通过该第一边缘节点能够离开电弧。

    WIRELESS DETERMINISTIC NETWORK LOCAL PATH REPAIR
    69.
    发明申请
    WIRELESS DETERMINISTIC NETWORK LOCAL PATH REPAIR 审中-公开
    无线确定网络本地路径修复

    公开(公告)号:WO2015050763A1

    公开(公告)日:2015-04-09

    申请号:PCT/US2014/057269

    申请日:2014-09-24

    Abstract: In one embodiment, an initial path is established in a wireless deterministic network between a source and a destination through one or more intermediate nodes, which are typically informed of a required metric between the source and the destination for communicating a packet. The initial path is locally (e.g., without contacting a path computation engine) reconfigured to bypass at least one of the intermediate nodes creating a new path, with the new path meeting the requirement(s) of the metric. Note, "locally reconfiguring" refers to the network nodes themselves determining a replacement path without reliance on a path computation engine or other entity (e.g., network management system, operating support system) in determining the replacement path. In one embodiment, a network node not on the initial path replaces a node on the initial path while using the same receive and send timeslots used in the initial path.

    Abstract translation: 在一个实施例中,通过一个或多个中间节点在源和目的地之间的无线确定性网络中建立初始路径,所述中间节点通常被通知源和目的地之间传送分组所需的度量。 初始路径在本地(例如,不接触路径计算引擎)被重新配置为绕过创建新路径的中间节点中的至少一个,新路径满足度量的要求。 注意,“本地重新配置”是指网络节点本身在不依赖路径计算引擎或其他实体(例如,网络管理系统,操作支持系统))确定替换路径时确定替换路径。 在一个实施例中,不在初始路径上的网络节点替换初始路径上的节点,同时使用在初始路径中使用的相同的接收和发送时隙。

    CO-EXISTENCE OF A DISTRIBUTED ROUTING PROTOCOL AND CENTRALIZED PATH COMPUTATION FOR DETERMINISTIC WIRELESS NETWORKS
    70.
    发明申请
    CO-EXISTENCE OF A DISTRIBUTED ROUTING PROTOCOL AND CENTRALIZED PATH COMPUTATION FOR DETERMINISTIC WIRELESS NETWORKS 审中-公开
    分布式路由协议的共存和用于确定无线网络的集中路径计算

    公开(公告)号:WO2015048239A2

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

    申请号:PCT/US2014/057381

    申请日:2014-09-25

    Abstract: In one embodiment, a device both communicates with a network operating a distributed proactive routing protocol, and participates in a centralized path computation protocol. The device communicates routing characteristics of the distributed proactive routing protocol for the network from the network to the centralized path computation protocol, and also communicates one or more computed paths from the centralized path computation protocol to the network, where the computed paths from the centralized path computation protocol are based on the routing characteristics of the distributed proactive routing protocol for the network.

    Abstract translation: 在一个实施例中,设备都与运行分布式主动路由协议的网络通信,并且参与集中式路径计算协议。 该设备将网络的分布式主动路由协议的路由特性从网络传输到集中路径计算协议,并将一个或多个计算路径从集中路径计算协议传送到网络,其中计算出的路径从集中路径 计算协议基于网络的分布式主动路由协议的路由特性。

Patent Agency Ranking