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

81. 发明申请

US20120307624A1 MANAGEMENT OF MISBEHAVING NODES IN A COMPUTER NETWORK 审中-公开
标题翻译：计算机网络中的管理问题
公开(公告)号：US20120307624A1
公开(公告)日：2012-12-06
申请号：US13150866
申请日：2011-06-01
申请人： Jean-Philippe Vasseur , Jonathan W. Hui , Shmuel Shaffer
发明人： Jean-Philippe Vasseur , Jonathan W. Hui , Shmuel Shaffer
IPC分类号： H04L12/24
CPC分类号： H04L41/0659 , H04L41/0609 , H04L41/0631 , H04L45/28
摘要： In one embodiment, a node in a computer network detects a misbehaving node in the computer network based on the misbehaving node acting in violation of one or more rules. As such, the node communicates information regarding the misbehaving node to a network management system (NMS), and then may receive isolation instructions from the NMS regarding how to isolate the misbehaving node from the computer network. Accordingly, the node may perform the isolation instructions. In another embodiment, the NMS receives the communicated information regarding the misbehaving node, and determines whether the misbehaving node should be isolated based on the communicated information. If so, then the NMS determines isolation instructions regarding how to isolate the misbehaving node from the computer network, and transmits them to one or more nodes in the computer network, accordingly.
摘要翻译：在一个实施例中，计算机网络中的节点基于违反一个或多个规则而行为不正当行为节点检测计算机网络中的行为不正的节点。因此，节点将关于不良行为节点的信息传送到网络管理系统（NMS），然后可以从NMS接收关于如何将不良行为节点与计算机网络隔离的隔离指令。因此，节点可以执行隔离指令。在另一个实施例中，NMS接收关于不良行为节点的所传送的信息，并且基于所传送的信息来确定是否应该隔离不良行为节点。如果是这样，则NMS确定关于如何将不良行为节点与计算机网络隔离的隔离指令，并相应地将它们发送到计算机网络中的一个或多个节点。

82. 发明申请

US20120233485A1 Phase-Based Operation of Devices on a Polyphase Electric Distribution System 有权
标题翻译：多相配电系统设备的相位操作
公开(公告)号：US20120233485A1
公开(公告)日：2012-09-13
申请号：US13043213
申请日：2011-03-08
申请人： Shmuel Shaffer , Jean-Philippe Vasseur , Sandeep Jay Shetty
发明人： Shmuel Shaffer , Jean-Philippe Vasseur , Sandeep Jay Shetty
IPC分类号： G06F1/26 , G06F11/30
CPC分类号： G06F1/26 , G01R29/16 , G01R29/18 , H02J3/14 , H02J3/26 , Y02B70/3225 , Y02E40/50 , Y04S20/222
摘要： In one embodiment, a device in a computer network monitors an alternating-current (AC) waveform of an electrical power source at the device, where the power source is part of a polyphase power source system. Once the device determines a particular phase of the polyphase power source system at the device, then the device joins a directed acyclic graph (DAG) specific to the particular phase. In another embodiment, a device detects a time of a zero crossing of the AC waveform, and may then determine a particular phase of the polyphase power source system at the device based on the time of the zero crossing relative to a corresponding location within a frequency hopping superframe of the computer network.
摘要翻译：在一个实施例中，计算机网络中的设备监视设备处的电源的交流（AC）波形，其中电源是多相电源系统的一部分。一旦器件确定器件上的多相电源系统的特定相位，器件将连接特定相位的有向非循环图（DAG）。在另一个实施例中，设备检测AC波形的过零时间，然后可以基于相对于频率内的对应位置的过零点的时间来确定设备处的多相电源系统的特定相位跳台超级计算机网络。

83. 发明申请

US20120230222A1 Gravitational Parent Selection in Directed Acyclic Graphs 有权
标题翻译：引导非循环图中的重力父选择
公开(公告)号：US20120230222A1
公开(公告)日：2012-09-13
申请号：US13043176
申请日：2011-03-08
申请人： Shmuel Shaffer , Jean-Philippe Vasseur , Sandeep Jay Shetty
发明人： Shmuel Shaffer , Jean-Philippe Vasseur , Sandeep Jay Shetty
IPC分类号： H04L12/56
CPC分类号： H04L41/12 , H04L45/48 , H04W40/248 , H04W84/18
摘要： In one embodiment, a particular node in a computer network receives an indication of a number of child nodes of one or more potential parent nodes to the particular node in a primary directed acyclic graph (DAG). From this, the particular node selects a particular potential parent node with the highest number of child nodes as a secondary DAG parent for the particular node, and joins the secondary DAG at the selected secondary DAG parent (e.g., for multicast and/or broadcast message distribution). This may recursively continue, such that nodes gravitate toward parents with more children, potentially allowing parents with fewer children to relinquish their parental responsibilities.
摘要翻译：在一个实施例中，计算机网络中的特定节点在主要有向无环图（DAG）中接收到特定节点的一个或多个潜在父节点的子节点数量的指示。由此，特定节点选择具有最高数量的子节点的特定潜在父节点作为特定节点的辅助DAG父节点，并且将所选辅助DAG父节点上的辅助DAG加入（例如，用于多播和/或广播消息分配）。这可能会递归地继续下去，这样节点会越来越多的孩子越来越多的父母，可能会让孩子少的父母放弃父母的责任。

84. 发明申请

US20120230204A1 Remote Stitched Directed Acyclic Graphs 有权
标题翻译：远程拼接定向非循环图
公开(公告)号：US20120230204A1
公开(公告)日：2012-09-13
申请号：US13043111
申请日：2011-03-08
申请人： Jean-Philippe Vasseur , Shmuel Shaffer , Sandeep Jay Shetty
发明人： Jean-Philippe Vasseur , Shmuel Shaffer , Sandeep Jay Shetty
IPC分类号： H04L12/26
CPC分类号： H04W40/22 , H04L43/0823 , H04L43/16 , H04L45/24 , H04L45/48 , H04L67/12 , Y04S40/168
摘要： In one embodiment, in response to a trigger condition being detected at a particular location in a primary directed acyclic graph (DAG) in a computer network, a particular node in the primary DAG at the particular location may be determined to act as a remote stitched (RS)-DAG root for an RS-DAG at the particular location. The determined RS-DAG root may then be instructed to initiate the RS-DAG, the instructing indicating one or more properties for the RS-DAG that are based on the trigger condition and that are different from properties of the primary DAG. In another embodiment, a particular node receives instructions to initiate an RS-DAG as its RS-DAG root, initiates the RS-DAG, and relays messages of the RS-DAG with a primary root of the primary DAG.
摘要翻译：在一个实施例中，响应于在计算机网络中的主要有向非循环图（DAG）中的特定位置处检测到触发条件，特定位置处的主DAG中的特定节点可以被确定为用作远程缝合（RS）-DAG根在特定位置的RS-DAG。然后可以指示确定的RS-DAG根以启动RS-DAG，指示基于触发条件指示RS-DAG的一个或多个属性，并且不同于主DAG的属性。在另一个实施例中，特定节点接收指令以发起RS-DAG作为其RS-DAG根，发起RS-DAG，并用主DAG的主根中继RS-DAG的消息。

85. 发明申请

US20120213124A1 METHOD AND APPARATUS TO TRIGGER DAG REOPTIMIZATION IN A SENSOR NETWORK 有权
标题翻译：在传感器网络中触发DAG选择的方法和装置
公开(公告)号：US20120213124A1
公开(公告)日：2012-08-23
申请号：US13044299
申请日：2011-03-09
申请人： Jean-Philippe Vasseur , Navneet Agarwal , Jonathan W. Hui
发明人： Jean-Philippe Vasseur , Navneet Agarwal , Jonathan W. Hui
IPC分类号： H04L12/28
CPC分类号： H04L45/02 , H04L41/12 , H04L45/26 , H04L45/48 , H04W4/70 , H04W40/24
摘要： In one embodiment, a probing technique allows a root node to determine whether to trigger reoptimization of a computer network represented by a directed acyclic graph (DAG) without injecting unnecessary traffic into the network. The root node may store and maintain information indicative of an ideal shape or topology of the DAG. During a normal DAG maintenance operation, the root node may transmit a DAG discovery request (probe request) that is configured to probe each node within the DAG for information used to determine a current topology of the DAG. In response, each node may record the information, e.g., routing and non-routing metrics, in a DAG discovery reply (probe reply) that is propagated to the root node. Upon receiving one or more replies, the root node may analyze the metrics to determine whether the current topology of the DAG deviates from the ideal DAG topology. The root node may thus determine DAG topology deviation upon probing at minimal cost. A number of algorithms may then be used to determine whether reoptimization, i.e., global repair, of the DAG is is required and, if so, the root node may dynamically trigger the global repair.
摘要翻译：在一个实施例中，探测技术允许根节点确定是否触发由有向无环图（DAG）表示的计算机网络的重新优化，而不会将不必要的业务注入到网络中。根节点可以存储和维护指示DAG的理想形状或拓扑的信息。在正常的DAG维护操作期间，根节点可以发送被配置为探测DAG内的每个节点的DAG发现请求（探测请求），用于确定DAG的当前拓扑结构的信息。作为响应，每个节点可以在传播到根节点的DAG发现回复（探针回复）中记录信息，例如路由和非路由度量。在接收到一个或多个答复之后，根节点可以分析度量以确定DAG的当前拓扑是否偏离理想的DAG拓扑。因此，根节点可以以最小的成本在探测时确定DAG拓扑偏差。然后可以使用许多算法来确定是否需要重新优化，即全局修复，如果是，则根节点可以动态地触发全局修复。

86. 发明申请

US20120155276A1 Dynamic Expelling of Child Nodes in Directed Acyclic Graphs in a Computer Network 有权
标题翻译：在计算机网络中的定向非循环图中动态排除子节点
公开(公告)号：US20120155276A1
公开(公告)日：2012-06-21
申请号：US12971422
申请日：2010-12-17
申请人： Jean-Philippe Vasseur , Shmuel Shaffer
发明人： Jean-Philippe Vasseur , Shmuel Shaffer
IPC分类号： H04L12/26
CPC分类号： H04W40/24 , H04L45/04 , H04L45/28 , H04L45/48 , H04W28/0289
摘要： In one embodiment, 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）中的父节点可以检测其子节点的拥塞。作为响应，父节点可以基于拥塞来确定从父节点排出的特定子节点，并且响应于动态地检测到拥塞而通知被排除的子节点他们必须从父节点分离（例如，以找到新的父节点，不包括父节点和附近的任意节点）。在另一个实施例中，子节点从当前父节点接收指示子节点被排除使用当前父节点的分离请求分组。作为响应，子节点触发新的父选择以选择专门排除当前父节点（例如，以及父母附近的任选节点）的新父节点。

87. 发明申请

US20120155260A1 Dynamic Synchronized Scheduling in a Computer Network 有权
标题翻译：计算机网络中的动态同步调度
公开(公告)号：US20120155260A1
公开(公告)日：2012-06-21
申请号：US12971440
申请日：2010-12-17
申请人： Jean-Philippe Vasseur , Shmuel Shaffer , Charles Okwudiafor , Sandeep Jay Shetty
发明人： Jean-Philippe Vasseur , Shmuel Shaffer , Charles Okwudiafor , Sandeep Jay Shetty
IPC分类号： H04L12/26
CPC分类号： H04L47/125 , H04L47/14
摘要： In one embodiment, a receiving node in a computer network may detect congestion, and also identifies a set (e.g., subset) of its neighbor nodes. In response to the congestion, the receiving node may assign a transmission timeslot to each neighbor node of the set based on the congestion, where each neighbor is allowed to transmit (synchronously) only during its respective timeslot. The assigned timeslots may then be transmitted to the set of neighbor nodes. In another embodiment, a transmitting node (e.g., a neighbor node of the receiving node) may receive a scheduling packet from the receiving node. Accordingly, the transmitting node may determine its assigned transmission timeslot during which the transmitting node is allowed to transmit. As such, the transmitting node may then transmit packets only during the assigned timeslot (e.g., for a given time). In this manner, congestion at the receiving node may be reduced.
摘要翻译：在一个实施例中，计算机网络中的接收节点可以检测拥塞，并且还识别其相邻节点的集合（例如子集）。响应于拥塞，接收节点可以基于拥塞来向组中的每个相邻节点分配传输时隙，其中每个邻居仅在其相应时隙期间被允许传输（同步）。然后可以将分配的时隙发送到相邻节点集合。在另一个实施例中，发送节点（例如，接收节点的邻居节点）可以从接收节点接收调度分组。因此，发送节点可以确定其发送节点被允许发送的其分配的传输时隙。因此，发送节点可以仅在分配的时隙（例如，给定时间）期间发送分组。以这种方式，可以减少接收节点处的拥塞。

88. 发明申请

US20120117208A1 Dynamic Address Assignment for Address Aggregation in Low Power and Lossy Networks 有权
标题翻译：低功耗和有损网络中地址聚合的动态地址分配
公开(公告)号：US20120117208A1
公开(公告)日：2012-05-10
申请号：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中节点上的路由配置进行管理。跟踪用于调用子节点上的地址更改的触发参数，并访问与之对比的触发参数的阈值。将触发参数与阈值进行比较。基于将触发参数与阈值进行比较的结果，确定子节点处的地址变化是适当的。基于地址改变的确定，调用出现在路由配置中的子节点的地址变化。

89. 发明申请

US20120113986A1 SYSTEM AND METHOD FOR MANAGING ACKNOWLEDGEMENT MESSAGES IN A VERY LARGE COMPUTER NETWORK 有权
标题翻译：用于在非常大的计算机网络中管理确认消息的系统和方法
公开(公告)号：US20120113986A1
公开(公告)日：2012-05-10
申请号：US12942985
申请日：2010-11-09
申请人： Shmuel SHAFFER , Jean-Philippe Vasseur , Sandeep Jay Shetty
发明人： Shmuel SHAFFER , Jean-Philippe Vasseur , Sandeep Jay Shetty
IPC分类号： H04L12/56
CPC分类号： H04L12/1868 , H04L1/1854 , H04L2001/0093
摘要： A multicast message may be distributed by receiving, at a first node in a multicast network, a multicast message from a parent node of the first node. The multicast message is transmitted to child nodes of the first node in the multicast network. A population of the child nodes to which the multicast message was transmitted is accessed and acknowledgement messages which reveal child nodes that are among an acknowledging subset of less than all of the child nodes of the first node are received. Child nodes revealed by the received acknowledgement messages are compared with child nodes determined to be among the population of child nodes to which the multicast message is expected to be received. Based on results of the comparison, a compressed non-acknowledging subset is identified and transmitted to the parent node.
摘要翻译：可以通过在多播网络中的第一节点处从第一节点的父节点接收多播消息来分发多播消息。组播消息被发送到组播网络中第一个节点的子节点。访问发送多播消息的子节点的群体，并且接收到揭示小于第一节点的所有子节点的确认子集之中的子节点的确认消息。将接收到的确认消息所揭示的子节点与确定为预期要接收多播消息的子节点的群体中的子节点进行比较。基于比较的结果，识别压缩的非确认子集并将其发送到父节点。

90. 发明申请

US20120113863A1 Dynamic Wake-up Time Adjustment Based on Designated Paths Through a Computer Network 有权
标题翻译：基于通过计算机网络指定路径的动态唤醒时间调整
公开(公告)号：US20120113863A1
公开(公告)日：2012-05-10
申请号：US12942962
申请日：2010-11-09
申请人： Jean-Philippe Vasseur , Shmuel Shaffer , Sandeep Jay Shetty
发明人： Jean-Philippe Vasseur , Shmuel Shaffer , Sandeep Jay Shetty
IPC分类号： H04L12/28
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定时器。以这种方式，节点的第二子集可以较少地唤醒，例如节约能量。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式