SECURED NEIGHBOR DISCOVERY REGISTRATION UPON DEVICE MOVEMENT
    371.
    发明申请
    SECURED NEIGHBOR DISCOVERY REGISTRATION UPON DEVICE MOVEMENT 审中-公开
    安全的邻居发现设备运动的注册

    公开(公告)号:US20160380776A1

    公开(公告)日:2016-12-29

    申请号:US14753373

    申请日:2015-06-29

    Abstract: In one embodiment, a device in a network receives a request from a neighbor of the device to add the neighbor as a child of the device in the network. The request includes a signed address registration certificate that certifies that a network address of the neighbor is registered in the network. The device determines whether the signed address registration certificate is valid. The device adds the neighbor as a child of the device in the network based on a determination that the signed address registration certificate is valid.

    Abstract translation: 在一个实施例中,网络中的设备接收来自设备的邻居的请求,以将邻居添加为网络中设备的子节点。 该请求包括签署的地址注册证书,证明邻居的网络地址已在网络中注册。 设备确定签名的地址注册证书是否有效。 该设备基于签署的地址注册证书有效的确定将邻居作为设备的子系统添加到网络中。

    DEVICE MOBILITY IN A MESH NETWORK
    372.
    发明申请
    DEVICE MOBILITY IN A MESH NETWORK 有权
    网络中的设备移动性

    公开(公告)号:US20160330107A1

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

    申请号:US14707117

    申请日:2015-05-08

    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
    373.
    发明申请
    RELIABLE MULTICAST IN LOW-POWER AND LOSSY NETWORKS 有权
    在低功耗和可靠的网络中可靠的多媒体

    公开(公告)号:US20160277201A1

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

    申请号:US14661301

    申请日:2015-03-18

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

    METHOD AND APPARATUS FOR VERIFYING SOURCE ADDRESSES IN A COMMUNICATION NETWORK
    374.
    发明申请
    METHOD AND APPARATUS FOR VERIFYING SOURCE ADDRESSES IN A COMMUNICATION NETWORK 有权
    用于在通信网络中验证源地址的方法和装置

    公开(公告)号:US20160212150A1

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

    申请号:US14598869

    申请日:2015-01-16

    CPC classification number: H04L63/126 H04L63/062 H04L63/162

    Abstract: In one embodiment, a method includes receiving a packet from an end node, the packet comprising an authenticated source MAC (Media Access Control) address and a source IP (Internet Protocol) address computed based on the authenticated source MAC address, and verifying the source IP address in the received packet, wherein verifying the source IP address comprises computing an IP address based on the authenticated source MAC address and comparing the computed IP address to the source IP address in the received packet to verify the source IP address. An apparatus is also disclosed herein.

    Abstract translation: 在一个实施例中,一种方法包括从终端节点接收分组,所述分组包括经认证的源MAC(媒体访问控制)地址和基于经认证的源MAC地址计算的源IP(因特网协议)地址,以及验证源 接收到的分组中的IP地址,其中验证源IP地址包括基于认证的源MAC地址来计算IP地址,并将计算的IP地址与接收到的分组中的源IP地址进行比较,以验证源IP地址。 本文还公开了一种装置。

    Dominating set identification for path computation based on directed acyclic graph membership
    375.
    发明授权
    Dominating set identification for path computation based on directed acyclic graph membership 有权
    基于有向非循环图隶属度的路径计算的主导集识别

    公开(公告)号:US09344256B2

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

    申请号:US14030949

    申请日:2013-09-18

    Abstract: In one embodiment, a method comprises a path computation device receiving device information from member network devices, each member network device belonging to a directed acyclic graph to a destination in a low power lossy network; and the path computation device classifying each member network device belonging to a directed acyclic graph as belonging to a dominating set, for generation of optimized routes distinct from any directed acyclic graph, for reaching any one of the member network devices of the dominating set.

    Abstract translation: 在一个实施例中,一种方法包括路径计算设备,从成员网络设备接收设备信息,每个成员网络设备属于低功率有损网络中的目的地的有向非循环图; 以及路径计算装置,将属于有向非循环图的每个成员网络装置分类为属于主导集合,用于生成与任何有向无环图不同的优化路线,用于到达主导集合的任何一个成员网络装置。

    Multiple path availability between walkable clusters
    376.
    发明授权
    Multiple path availability between walkable clusters 有权
    可步行群集之间的多路径可用性

    公开(公告)号:US09258208B2

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

    申请号:US13768453

    申请日:2013-02-15

    CPC classification number: H04L45/04 H04L45/02 H04L45/28 H04L45/46

    Abstract: In one embodiment, a method comprises creating, in a computing network, a hierarchal routing topology for reaching a destination, the hierarchal routing topology comprising a single parent supernode providing reachability to the destination, and a plurality of child supernodes, each child supernode comprising one or more exit network devices each providing a corresponding link to the parent supernode; receiving, in one of the child supernodes, a data packet for delivery to the destination; causing the data packet to traverse along any available data link in the one child supernode independent of any routing topology established by network devices in the one child supernode, until the data packet reaches one of the exit network devices; and the one exit network device forwarding the data packet to the parent supernode, via the corresponding link, for delivery to the destination.

    Abstract translation: 在一个实施例中,一种方法包括在计算网络中创建用于到达目的地的分层路由拓扑,所述分层路由拓扑包括提供到达目的地的可达性的单个父超节点以及多个子超节点,每个子超节点包括一个 或多个出口网络设备,每个退出网络设备提供到父级超级节点的对应链路; 在其中一个子超文本中接收用于传送到目的地的数据包; 使得数据分组沿着所述一个子超节点中的任何可用数据链路遍历,独立于由所述一个子超节点中的网络设备建立的任何路由拓扑,直到所述数据分组到达所述退出网络设备之一; 并且一个出口网络设备经由相应的链路将数据分组转发到父超节点,以传送到目的地。

    INTELLIGENT WIRING IN A LOW POWER AND LOSSY NETWORK
    378.
    发明申请
    INTELLIGENT WIRING IN A LOW POWER AND LOSSY NETWORK 有权
    智能接线在低功耗和损耗网络

    公开(公告)号:US20150200738A1

    公开(公告)日:2015-07-16

    申请号:US14155474

    申请日:2014-01-15

    Abstract: In one embodiment, the locations of a plurality of network devices in a low power and lossy network (LLN) are determined along an intelligent wire. One or more neighboring devices for each network device in the plurality are identified based on the locations of the network devices along the intelligent wire. A communication schedule for the network devices is determined that prevents neighboring devices along the intelligent wire from transmitting on the same frequency. The network devices are assigned to communication time slots based on the communication schedule. The network devices are also assigned frequency offsets based on the communication schedule.

    Abstract translation: 在一个实施例中,多个网络设备在低功率和有损耗网络(LLN)中的位置沿智能线路确定。 基于网络设备沿着智能电线的位置来识别多个中的每个网络设备的一个或多个相邻设备。 确定网络设备的通信调度,以防止沿着智能线路的相邻设备在相同频率上发送。 根据通信时间表将网络设备分配给通信时隙。 网络设备也根据通信时间表分配频率偏移。

    Repair of Failed Network Routing Arcs Using Data Plane Protocol
    379.
    发明申请
    Repair of Failed Network Routing Arcs Using Data Plane Protocol 有权
    使用数据平面协议修复失败的网络路由弧

    公开(公告)号:US20150163091A1

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

    申请号:US14155562

    申请日:2014-01-15

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

    SCHEDULE-BASED PRIORITIZATION IN CONTENTION-BASED SHARED-MEDIA COMPUTER NETWORKS
    380.
    发明申请
    SCHEDULE-BASED PRIORITIZATION IN CONTENTION-BASED SHARED-MEDIA COMPUTER NETWORKS 有权
    基于内容的共享计算机网络中基于时间表的优先

    公开(公告)号:US20140269759A1

    公开(公告)日:2014-09-18

    申请号:US13796176

    申请日:2013-03-12

    CPC classification number: H04L47/27 H04L45/24 H04L47/2458 H04L47/28 H04W74/04

    Abstract: In one embodiment, an intermediate node in a contention-based shared-media computer network determines a scheduled window within which a packet (with an assigned priority) should be transmitted by the intermediate node. In particular, the intermediate node may specifically determine whether an actual transmission time is prior to, during, or after the window, and sets a priority of the packet as either i) a reduced priority when the actual transmission time is prior to the window, ii) the assigned priority when the actual transmission time is during the window, or iii) an augmented priority when the actual transmission time is after the window. As such, the intermediate node may then transmit the packet from the intermediate node with the set priority at the actual transmission time.

    Abstract translation: 在一个实施例中,基于竞争的共享 - 媒体计算机网络中的中间节点确定调度窗口,其中中间节点应该发送分组(具有分配的优先级)的分组。 特别地,中间节点可以具体确定实际传输时间是否在窗口之前,之中或之后,并且当实际传输时间在窗口之前时,将分组的优先级设置为i)降低的优先级, ii)实际传输时间在窗口期间的分配优先级,或iii)当实际传输时间在窗口之后时的增强优先级。 因此,中间节点然后可以在实际传输时间以设定的优先级从中间节点传送分组。

Patent Agency Ranking