专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

41. 发明授权

US08503309B2 Dynamic expelling of child nodes in directed acyclic graphs in a computer network 有权
标题翻译：在计算机网络中的有向非循环图中动态排除子节点
公开(公告)号：US08503309B2
公开(公告)日：2013-08-06
申请号：US12971422
申请日：2010-12-17
申请人： Jean-Philippe Vasseur , Shmuel Shaffer
发明人： Jean-Philippe Vasseur , Shmuel Shaffer
IPC分类号： H04L45/00
CPC分类号： H04W40/24 , H04L45/04 , H04L45/28 , H04L45/48 , H04W28/0289
摘要： A parent node in a directed acyclic graph (DAG) in a computer network may detect congestion from its child nodes. In response, the parent node may determine particular child nodes to expel from the parent node based on the congestion, and notifies the expelled child nodes that they must detach from the parent node in response to dynamically detecting congestion (e.g., to find a new parent, excluding the parent node and optionally any nodes in the vicinity). In another embodiment, a child node receives a detach request packet from a current parent node that indicates that the child node is expelled from using the current parent node. In response, the child node triggers a new parent selection to select a new parent node that specifically excludes the current parent node (e.g., and optionally any nodes in the parent's vicinity).
摘要翻译：计算机网络中的有向无环图（DAG）中的父节点可以检测其子节点的拥塞。作为响应，父节点可以基于拥塞来确定从父节点排出的特定子节点，并且响应于动态地检测到拥塞而通知被排除的子节点他们必须从父节点分离（例如，以找到新的父节点，不包括父节点和附近的任意节点）。在另一个实施例中，子节点从当前父节点接收指示子节点被排除使用当前父节点的分离请求分组。作为响应，子节点触发新的父选择以选择专门排除当前父节点（例如，以及父母附近的任选节点）的新父节点。

42. 发明申请

US20130013809A1 MANAGING HOST ROUTES FOR LOCAL COMPUTER NETWORKS WITH A PLURALITY OF FIELD AREA ROUTERS 有权
标题翻译：管理具有多个现场区域路由器的本地计算机网络的主机路由
公开(公告)号：US20130013809A1
公开(公告)日：2013-01-10
申请号：US13176301
申请日：2011-07-05
申请人： Jean-Philippe Vasseur , Jonathan W. Hui , Stefano Previdi , Shmuel Shaffer
发明人： Jean-Philippe Vasseur , Jonathan W. Hui , Stefano Previdi , Shmuel Shaffer
IPC分类号： G06F15/173
CPC分类号： H04L45/22 , H04L45/64
摘要： In one embodiment, a particular field area router (FAR), in a local computer network (e.g., a mesh network) having a plurality of FARs, advertises a common subnet prefix assigned to the local computer network into a global computer network. Each of the plurality of FARs of the local computer network is configured to accept any traffic destined to the local computer network, and a tunnel overlay is built among the plurality of FARs. Upon receiving a packet at the particular FAR destined to a particular device in the local computer network, and in response to the particular FAR not having a host route to the particular device, it forwards the packet on the tunnel overlay to another of the plurality of FARs of the local computer network.
摘要翻译：在一个实施例中，具有多个FAR的本地计算机网络（例如，网状网络）中的特定场区域路由器（FAR）将分配给本地计算机网络的公共子网前缀通告给全局计算机网络。本地计算机网络的多个FAR中的每一个被配置为接受去往本地计算机网络的任何流量，并且在多个FAR之间建立隧道覆盖。一旦在特定的FAR上收到一个目的地是本地计算机网络中的特定设备的分组，并且响应于特定的FAR没有到该特定设备的主机路由，它将隧道覆盖上的分组转发到多个本地计算机网络的FAR。

43. 发明申请

US20120320923A1 REDIRECTING TRAFFIC VIA TUNNELS TO DISCOVERED DATA AGGREGATORS 有权
标题翻译：通过隧道重新发现交通发现数据聚合器
公开(公告)号：US20120320923A1
公开(公告)日：2012-12-20
申请号：US13164708
申请日：2011-06-20
申请人： Jean-Philippe Vasseur , Shmuel Shaffer , Sandeep J. Shetty
发明人： Jean-Philippe Vasseur , Shmuel Shaffer , Sandeep J. Shetty
IPC分类号： H04L12/56
CPC分类号： H04L45/42 , H04L45/22 , H04W40/22 , H04W40/246 , H04W40/26
摘要： In one embodiment, a data aggregator discovery (DAD) message may be distributed by an associated data aggregator, the DAD message identifying the initiating data aggregator, and comprising a recorded route taken from the data aggregator to a receiving particular node as well as a total path cost for the particular node to reach a root node of the DAG through the recorded route and via the data aggregator. The receiving particular node determines a path cost increase (PCI) associated with use of the data aggregator based on the total path cost as compared to a DAG-based path cost for the particular node to reach the root node via the DAG. If the PCI is below a configured threshold, the particular node may redirect traffic to the data aggregator as source-routed traffic according to the recorded route. The traffic may then be aggregated by the data aggregator, accordingly.
摘要翻译：在一个实施例中，数据聚合器发现（DAD）消息可以由相关联的数据聚合器分发，DAD消息标识发起数据聚合器，并且包括从数据聚合器到接收特定节点的记录路由以及总数特定节点通过记录的路由并经由数据聚合器到达DAG的根节点的路径开销。与特定节点通过DAG到达根节点的基于DAG的路径开销相比，接收特定节点基于总路径开销来确定与数据聚合器的使用相关联的路径成本增加（PCI）。如果PCI低于配置的阈值，则特定节点可以根据记录的路由将流量重定向为数据聚合器作为源路由业务。因此，流量可以由数据聚合器进行聚合。

44. 发明授权

US08799510B2 Managing host routes for local computer networks with a plurality of field area routers 有权
标题翻译：管理具有多个场地路由器的本地计算机网络的主机路由
公开(公告)号：US08799510B2
公开(公告)日：2014-08-05
申请号：US13176301
申请日：2011-07-05
申请人： Jean-Philippe Vasseur , Jonathan W. Hui , Stefano Previdi , Shmuel Shaffer
发明人： Jean-Philippe Vasseur , Jonathan W. Hui , Stefano Previdi , Shmuel Shaffer
IPC分类号： G06F15/173
CPC分类号： H04L45/22 , H04L45/64
摘要： In one embodiment, a particular field area router (FAR), in a local computer network (e.g., a mesh network) having a plurality of FARs, advertises a common subnet prefix assigned to the local computer network into a global computer network. Each of the plurality of FARs of the local computer network is configured to accept any traffic destined to the local computer network, and a tunnel overlay is built among the plurality of FARs. Upon receiving a packet at the particular FAR destined to a particular device in the local computer network, and in response to the particular FAR not having a host route to the particular device, it forwards the packet on the tunnel overlay to another of the plurality of FARs of the local computer network.
摘要翻译：在一个实施例中，具有多个FAR的本地计算机网络（例如，网状网络）中的特定场区域路由器（FAR）将分配给本地计算机网络的公共子网前缀通告给全局计算机网络。本地计算机网络的多个FAR中的每一个被配置为接受去往本地计算机网络的任何流量，并且在多个FAR之间建立隧道覆盖。一旦在特定的FAR上收到一个目的地是本地计算机网络中的特定设备的分组，并且响应于特定的FAR没有到该特定设备的主机路由，它将隧道覆盖上的分组转发到多个本地计算机网络的FAR。

45. 发明授权

US08774050B2 Dynamic wake-up time adjustment based on designated paths through a computer network 有权
标题翻译：基于通过计算机网络的指定路径进行动态唤醒时间调整
公开(公告)号：US08774050B2
公开(公告)日：2014-07-08
申请号：US12942962
申请日：2010-11-09
申请人： Jean-Philippe Vasseur , Shmuel Shaffer , Sandeep Shetty
发明人： Jean-Philippe Vasseur , Shmuel Shaffer , Sandeep Shetty
IPC分类号： H04L12/28 , H04W84/18 , H04W40/00 , H04L29/06 , H04L29/08
CPC分类号： H04W84/18 , H04L12/12 , H04L29/06993 , H04L29/08027 , H04L29/08306 , H04L67/104 , H04W40/005 , H04W40/10 , H04W40/22 , Y02D70/142 , Y02D70/144 , Y02D70/22 , Y02D70/326 , Y02D70/39
摘要： In one embodiment, a computer network may include nodes and at least one root node. A first subset of the nodes may be located along a designated path (a directed acyclic graph (DAG)) through the computer network to the root node, where the first subset of nodes is configured to operate according to a first wake-up timer. A second subset of the nodes that are not along the designated path are in communication to at least one node of the first subset of nodes along the designated path, and operate according to a second wake-up timer that is longer than the first wake-up timer. In this manner, second subset of nodes may be awake less often, e.g., conserving energy.
摘要翻译：在一个实施例中，计算机网络可以包括节点和至少一个根节点。节点的第一子集可以沿着指定路径（有向非循环图（DAG））通过计算机网络定位到根节点，其中第一子节点被配置为根据第一唤醒定时器来操作。不沿着指定路径的节点的第二子集与沿着指定路径的第一节点子集的至少一个节点通信，并且根据比第一唤醒定时器长的第二唤醒定时器进行操作， up定时器。以这种方式，节点的第二子集可以较少地唤醒，例如节约能量。

46. 发明授权

US08891534B2 Redirecting traffic via tunnels to discovered data aggregators 有权
标题翻译：通过隧道将流量重定向到发现的数据聚合器
公开(公告)号：US08891534B2
公开(公告)日：2014-11-18
申请号：US13164708
申请日：2011-06-20
申请人： Jean-Philippe Vasseur , Shmuel Shaffer , Sandeep J Shetty
发明人： Jean-Philippe Vasseur , Shmuel Shaffer , Sandeep J Shetty
IPC分类号： H04W40/26 , H04W40/22 , H04W40/24
CPC分类号： H04L45/42 , H04L45/22 , H04W40/22 , H04W40/246 , H04W40/26
摘要： In one embodiment, a data aggregator discovery (DAD) message may be distributed by an associated data aggregator, the DAD message identifying the initiating data aggregator, and comprising a recorded route taken from the data aggregator to a receiving particular node as well as a total path cost for the particular node to reach a root node of the DAG through the recorded route and via the data aggregator. The receiving particular node determines a path cost increase (PCI) associated with use of the data aggregator based on the total path cost as compared to a DAG-based path cost for the particular node to reach the root node via the DAG. If the PCI is below a configured threshold, the particular node may redirect traffic to the data aggregator as source-routed traffic according to the recorded route. The traffic may then be aggregated by the data aggregator, accordingly.
摘要翻译：在一个实施例中，数据聚合器发现（DAD）消息可以由相关联的数据聚合器分发，DAD消息标识发起数据聚合器，并且包括从数据聚合器到接收特定节点的记录路由以及总数特定节点通过记录的路由并经由数据聚合器到达DAG的根节点的路径开销。与特定节点通过DAG到达根节点的基于DAG的路径开销相比，接收特定节点基于总路径开销来确定与数据聚合器的使用相关联的路径成本增加（PCI）。如果PCI低于配置的阈值，则特定节点可以根据记录的路由将流量重定向为数据聚合器作为源路由业务。因此，流量可以由数据聚合器进行聚合。

47. 发明授权

US08885501B2 Reachability rate computation without link layer acknowledgments 有权
标题翻译：无链路层确认的可达性速率计算
公开(公告)号：US08885501B2
公开(公告)日：2014-11-11
申请号：US13151062
申请日：2011-06-01
申请人： Jean-Philippe Vasseur , Jonathan W. Hui , Shmuel Shaffer
发明人： Jean-Philippe Vasseur , Jonathan W. Hui , Shmuel Shaffer
IPC分类号： H04L12/26 , H04L12/815 , H04W40/14 , H04L12/801 , H04L12/825
CPC分类号： H04W40/14 , H04L47/14 , H04L47/193 , H04L47/22 , H04L47/25 , H04L47/34
摘要： In one embodiment, a device in a computer network receives a particular packet associated with a transmission attempts value, the associated transmission attempts value indicative of a first number of times a transmitter has attempted to transmit the particular packet. In response, the device increases by one a stored successful attempts value stored at the device, the stored successful attempts value indicative of a second number of times the device has received the same particular packet. As such, a reachability rate of a link from the transmitter to the device may be determined based on comparing the associated transmission attempts value to the stored successful attempts value.
摘要翻译：在一个实施例中，计算机网络中的设备接收与传输尝试值相关联的特定分组，相关联的传输尝试值指示发射机尝试发送特定分组的第一次数。作为响应，设备增加存储在设备中的一个存储的成功尝试值，所存储的成功尝试值指示设备已经接收到相同特定分组的第二次数。因此，可以基于将相关联的传输尝试值与存储的成功尝试值进行比较来确定从发射机到设备的链路的可达性速率。

48. 发明授权

US08631101B2 Dynamic address assignment for address aggregation in low power and lossy networks 有权
标题翻译：低功耗和有损网络中地址聚合的动态地址分配
公开(公告)号：US08631101B2
公开(公告)日：2014-01-14
申请号：US12942979
申请日：2010-11-09
申请人： Shmuel Shaffer , Pascal Thubert , Patrick Wetterwald , Jean-Philippe Vasseur
发明人： Shmuel Shaffer , Pascal Thubert , Patrick Wetterwald , Jean-Philippe Vasseur
IPC分类号： G06F15/177
CPC分类号： H04L41/0816 , H04L29/12254 , H04L29/12273 , H04L29/12933 , H04L41/085 , H04L61/2038 , H04L61/2053 , H04L61/6068 , H04W8/26 , H04W40/248 , Y02D70/142 , Y02D70/144 , Y02D70/22 , Y04S40/162
摘要： A node in a Low power and Lossy Network (LLN) is managed by monitoring a routing configuration on a node in a LLN. A triggering parameter that is used to invoke an address change on a child node is tracked and a threshold against which to compare the triggering parameter is accessed. The triggering parameter is compared to the threshold. Based on results of comparing the triggering parameter to the threshold, it is determined that an address change at the child node is appropriate. An address change of a child node appearing in the routing configuration is invoked based on the determination that an address change is appropriate.
摘要翻译：低功耗和有损网络（LLN）中的节点通过监视LLN中节点上的路由配置进行管理。跟踪用于调用子节点上的地址更改的触发参数，并访问与之对比的触发参数的阈值。将触发参数与阈值进行比较。基于将触发参数与阈值进行比较的结果，确定子节点处的地址变化是适当的。基于地址改变的确定，调用出现在路由配置中的子节点的地址变化。

49. 发明授权

US08630291B2 Dynamic multi-path forwarding for shared-media communication networks 有权
标题翻译：共享媒体通信网络的动态多路径转发
公开(公告)号：US08630291B2
公开(公告)日：2014-01-14
申请号：US13214844
申请日：2011-08-22
申请人： Shmuel Shaffer , Jonathan W. Hui , Jean-Philippe Vasseur
发明人： Shmuel Shaffer , Jonathan W. Hui , Jean-Philippe Vasseur
IPC分类号： H04L12/28
CPC分类号： H04L45/70 , H04L12/1854 , H04L12/1877 , H04L43/08 , H04L45/16 , H04L45/22 , H04L45/24 , H04L45/302
摘要： In one embodiment, a quality of one or more links of a particular node in a communication network may be determined, and then whether the quality of the one or more links is below a threshold may also be determined. In response to determining that the quality of at least one of the one or more links is above the threshold, a select one of the at least one of the one or more links with quality above the threshold may be utilized for communication with the particular node. Conversely, in response to determining that the quality of each of the one or more links is below the threshold, multi-path forwarding over a plurality of links of the particular node may be utilized for communication with the particular node.
摘要翻译：在一个实施例中，可以确定通信网络中的特定节点的一个或多个链路的质量，然后也可以确定一个或多个链路的质量是否低于阈值。响应于确定一个或多个链路中的至少一个链路的质量高于阈值，可以利用具有高于阈值的质量的一个或多个链路中的至少一个链路中的一个选择之一用于与特定节点的通信。相反，响应于确定一个或多个链路中的每一个的质量低于阈值，可以利用特定节点的多个链路上的多路径转发来与特定节点进行通信。

50. 发明授权

US08406153B2 Affecting node association through load partitioning 有权
标题翻译：通过负载划分影响节点关联
公开(公告)号：US08406153B2
公开(公告)日：2013-03-26
申请号：US12942954
申请日：2010-11-09
申请人： Jean-Philippe Vasseur , Shmuel Shaffer , Sandeep Shetty
发明人： Jean-Philippe Vasseur , Shmuel Shaffer , Sandeep Shetty
IPC分类号： H04L12/28
CPC分类号： H04L47/726
摘要： In one embodiment, a node may request to join a parent node in a directed acyclic graph (DAG) in a computer network, and may also notify the parent node of a load associated with the request and whether the node has any other parent node options. The requesting node may then receive a response from the parent node that is either an acceptance or a denial. While the node may join the parent node in response to an acceptance, if a denial is received, the node may divide the load into first and second portions, and may re-request to join the parent node with the load of the first portion. In this manner, by partitioning the load, a load balancing mode of operation across multiple is parents in a DAG is provided.
摘要翻译：在一个实施例中，节点可以请求在计算机网络中的有向非循环图（DAG）中加入父节点，并且还可以向父节点通知与该请求相关联的负载以及节点是否具有任何其他父节点选项。然后，请求节点可以从父节点接收作为接受或拒绝的响应。当节点可以响应于接受而加入父节点时，如果接收到拒绝，节点可以将负载划分为第一和第二部分，并且可以重新请求以第一部分的负载加入父节点。以这种方式，通过划分负载，提供多个操作的负载平衡模式是DAG中的父节点。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式