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

1. 发明授权

US09198203B2 System and method for routing critical communications 有权
标题翻译：关键通信路由系统和方法
公开(公告)号：US09198203B2
公开(公告)日：2015-11-24
申请号：US12942972
申请日：2010-11-09
申请人： Shmuel Shaffer , Jean-Philippe Vasseur , Sandeep Jay Shetty
发明人： Shmuel Shaffer , Jean-Philippe Vasseur , Sandeep Jay Shetty
IPC分类号： G06F15/16 , H04W76/00 , H04L29/06 , H04L12/701 , H04L12/707 , H04W4/00 , H04W84/18
CPC分类号： H04W76/007 , H04L29/06 , H04L45/00 , H04L45/24 , H04W4/38 , H04W40/22 , H04W40/28 , H04W76/50 , H04W84/18 , Y02D70/142 , Y02D70/144 , Y02D70/22
摘要： According to one or more implementations of the disclosure, packets may be transmitted in a low power and lossy network (LLN) by receiving, on a first node, a message from a sending node, and by activating a critical message configuration to be applied in routing the message. A message identifier (e.g., signature) for the message may also be received or gleaned. The message identifier can be compared at the first node to a list of stored message identifiers, created based on routing history, to determine if the message has already been received. As such, if the message has not been received at the first node previously, a first parent and a second parent for the message are identified and the message, along with the critical message indication, can be transmitted to the first parent and the second parent, thereby achieving redundancy in the routing of the message.
摘要翻译：根据本公开的一个或多个实现方式，分组可以通过在第一节点上从发送节点接收消息并且通过激活要应用的关键消息配置来在低功率和有损网络（LLN）中发送路由消息。消息的消息标识符（例如，签名）也可以被接收或收集。可以将消息标识符在第一节点处与基于路由历史创建的存储消息标识符列表进行比较，以确定消息是否已经被接收。因此，如果先前还没有在第一个节点处接收到消息，则识别该消息的第一个父节点和第二个父节点，并将该消息连同关键消息指示一起发送到第一个父节点和第二个父节点从而在消息的路由中实现冗余。

2. 发明申请

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波形的过零时间，然后可以基于相对于频率内的对应位置的过零点的时间来确定设备处的多相电源系统的特定相位跳台超级计算机网络。

3. 发明申请

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加入（例如，用于多播和/或广播消息分配）。这可能会递归地继续下去，这样节点会越来越多的孩子越来越多的父母，可能会让孩子少的父母放弃父母的责任。

4. 发明申请

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的消息。

5. 发明申请

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.
摘要翻译：在一个实施例中，计算机网络中的接收节点可以检测拥塞，并且还识别其相邻节点的集合（例如子集）。响应于拥塞，接收节点可以基于拥塞来向组中的每个相邻节点分配传输时隙，其中每个邻居仅在其相应时隙期间被允许传输（同步）。然后可以将分配的时隙发送到相邻节点集合。在另一个实施例中，发送节点（例如，接收节点的邻居节点）可以从接收节点接收调度分组。因此，发送节点可以确定其发送节点被允许发送的其分配的传输时隙。因此，发送节点可以仅在分配的时隙（例如，给定时间）期间发送分组。以这种方式，可以减少接收节点处的拥塞。

6. 发明申请

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.
摘要翻译：可以通过在多播网络中的第一节点处从第一节点的父节点接收多播消息来分发多播消息。组播消息被发送到组播网络中第一个节点的子节点。访问发送多播消息的子节点的群体，并且接收到揭示小于第一节点的所有子节点的确认子集之中的子节点的确认消息。将接收到的确认消息所揭示的子节点与确定为预期要接收多播消息的子节点的群体中的子节点进行比较。基于比较的结果，识别压缩的非确认子集并将其发送到父节点。

7. 发明申请

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定时器。以这种方式，节点的第二子集可以较少地唤醒，例如节约能量。

8. 发明授权

US08842630B2 Extendable frequency hopping timeslots in wireless networks 有权
标题翻译：无线网络中可扩展的跳频时隙
公开(公告)号：US08842630B2
公开(公告)日：2014-09-23
申请号：US12971205
申请日：2010-12-17
申请人： Shmuel Shaffer , Sandeep Jay Shetty , Jean-Philippe Vasseur , Jonathan W. Hui
发明人： Shmuel Shaffer , Sandeep Jay Shetty , Jean-Philippe Vasseur , Jonathan W. Hui
IPC分类号： H04W4/00 , H04W72/04 , H04W84/18 , H04W28/06 , H04W72/00 , H04B1/713
CPC分类号： H04W72/0446 , H04B1/713 , H04W28/06 , H04W72/00 , H04W84/18
摘要： In one embodiment, a wireless transmitting node in a frequency hopping wireless network may determine whether a packet can be transmitted within a particular timeslot of a frequency hopping sequence based on a length of the packet. If unable to transmit the packet within the particular timeslot, the transmitting node extends the particular timeslot into a subsequent timeslot to allow transmission of the packet within the extended timeslot at a frequency associated with the particular timeslot. Once the extended timeslot ends, the transmitting node and receiving node hop frequencies into the subsequent timeslot to synchronize with the rest of the network that already hopped at the conventional rate. In another embodiment, a wireless receiving node may also extend the particular timeslot into a subsequent timeslot to allow reception of a packet that would extend beyond the particular timeslot, and may hop frequencies upon expiration of the extended timeslot.
摘要翻译：在一个实施例中，跳频无线网络中的无线发射节点可以基于分组的长度来确定是否可以在跳频序列的特定时隙内发送分组。如果不能在特定时隙内发送分组，则发送节点将特定时隙扩展到随后的时隙中，以允许以与特定时隙相关联的频率在扩展时隙内传输分组。一旦扩展时隙结束，发射节点和接收节点将频率跳到随后的时隙中，以与以常规速率跳过的网络的其余部分同步。在另一个实施例中，无线接收节点还可以将特定时隙扩展到随后的时隙中，以允许接收超出特定时隙的分组，并且可以在扩展时隙到期时跳频。

9. 发明申请

US20140006893A1 Repeater Nodes in Shared Media Networks 有权
标题翻译：共享媒体网络中的中继节点
公开(公告)号：US20140006893A1
公开(公告)日：2014-01-02
申请号：US12971148
申请日：2010-12-17
申请人： Sandeep Jay Shetty , Shmuel Shaffer , Jean-Philippe Vasseur
发明人： Sandeep Jay Shetty , Shmuel Shaffer , Jean-Philippe Vasseur
IPC分类号： G06F11/00
CPC分类号： H04L1/1867 , H04L2001/0097
摘要： In one embodiment, a repeater node in a shared media network may intercept a shared media transmission from a first node to a second node. Once a shared media transmission is intercepted, the repeater node may determine whether the second node returns an acknowledgement (ACK) to the first node. If the second node does not return an ACK to the first node, the repeater node repeats the shared media transmission to the second node. Also, according to one or more additional embodiments of the disclosure, when receiving an ACK at the repeater node from the second node in response to the repeated shared media transmission, the repeater node may also forward the ACK from the second node to the first node.
摘要翻译：在一个实施例中，共享媒体网络中的中继器节点可以拦截从第一节点到第二节点的共享媒体传输。一旦共享媒体传输被拦截，则中继器节点可以确定第二节点是否向第一节点返回确认（ACK）。如果第二节点不向第一节点返回ACK，则中继器节点重复向第二节点的共享媒体传输。此外，根据本公开的一个或多个附加实施例，当响应于重复的共享媒体传输从第二节点在中继器节点处接收到ACK时，中继器节点还可以将ACK从第二节点转发到第一节点。

10. 发明授权

US08447849B2 Negotiated parent joining in directed acyclic graphs (DAGS) 有权
标题翻译：协商的父母加入有针对性的非循环图（DAGS）
公开(公告)号：US08447849B2
公开(公告)日：2013-05-21
申请号：US12942949
申请日：2010-11-09
申请人： Shmuel Shaffer , Jean-Philippe Vasseur , Sandeep Jay Shetty
发明人： Shmuel Shaffer , Jean-Philippe Vasseur , Sandeep Jay Shetty
IPC分类号： G06F15/173
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 notify the parent node of a load associated with the request, and whether the node has any other parent node options. The response received from the parent node may be either an acceptance or a denial (based on the load and other parent node options), where in the case of an acceptance, the node may join the parent node in the DAG. Alternatively, in response to a denial, in one embodiment, the node may perform load shedding to become acceptable to the parent node. In another embodiment, a node receiving a join request from a child node may determine an impact associated with allowing the child node (and its load) to join the receiving node in the DAG prior to returning an acceptance or denial, accordingly.
摘要翻译：在一个实施例中，节点可以请求在计算机网络中的有向非循环图（DAG）中加入父节点，并且可以向父节点通知与该请求相关联的负载，以及节点是否具有任何其他父节点选项。从父节点接收的响应可以是接受或拒绝（基于负载和其他父节点选项），其中在接受的情况下，节点可以加入DAG中的父节点。或者，响应于拒绝，在一个实施例中，节点可以执行负载切换以使得父节点变得可接受。在另一个实施例中，从子节点接收加入请求的节点可以相应地确定与允许子节点（及其负载）在返回接受或拒绝之前在DAG中加入接收节点相关联的影响。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式