会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 31. 发明申请
    • Efficient Message Distribution for Directed Acyclic Graphs
    • 定向非循环图的有效消息分布
    • US20120233326A1
    • 2012-09-13
    • US13043168
    • 2011-03-08
    • Shmuel ShafferSandeep Jay ShettyJean-Philippe Vasseur
    • Shmuel ShafferSandeep Jay ShettyJean-Philippe Vasseur
    • G06F15/173
    • H04W4/70H04L45/04H04L45/16H04W40/023H04W84/18
    • In one embodiment, a particular node in a primary DAG receives a distributed message from distributing nodes, and from this, deterministically selects a distributing node as a distributing parent in a secondary DAG from which distributed messages are to be received. The particular node may then inform the deterministically selected distributing parent that it is being used by the particular node as its distributing parent, and if the selected distributing parent is not the particular node's primary DAG parent, then the primary DAG parent is informed that it need not send distributed messages for the particular node. In another embodiment, a distributing node continues to repeat distributed messages in response to receiving notification that it is being used as a distributing parent, and if a primary DAG parent, prevents the repeating in response to receiving a notification from all of its child nodes that it need not send distributed messages.
    • 在一个实施例中,主DAG中的特定节点从分发节点接收分布式消息,并且从此确定性地将分发节点确定性地选择为要从其接收分布式消息的辅助DAG中的分发父节点。 然后,特定节点可以将确定性地选择的分配的父节点通知该特定节点正在使用它作为其分发的父节点,并且如果选择的分配父节点不是特定节点的主DAG父节点,则主DAG父节点被通知它需要 不发送特定节点的分布式消息。 在另一个实施例中,分发节点响应于接收到它被用作分发父节点的通知继续重复分布式消息,并且如果主DAG父节点响应于从其所有子节点接收到通知,则防止重复 它不需要发送分布式消息。
    • 32. 发明申请
    • Dynamic Routing Metric Adjustment
    • 动态路由度量调整
    • US20120155475A1
    • 2012-06-21
    • US12971094
    • 2010-12-17
    • Jean-Philippe VasseurShmuel ShafferSandeep Jay Shetty
    • Jean-Philippe VasseurShmuel ShafferSandeep Jay Shetty
    • H04L12/56
    • H04L12/56H04L45/028H04W40/248
    • In one embodiment, one or more routing update parameters may be set for and propagated to nodes of a directed acyclic graph (DAG) in a computer network, the routing update parameters indicative of when to perform a corresponding routing update operation. A decision node (e.g., a root node of the DAG, application in a head-end, etc.) may gather network statistics of the DAG during operation based on the routing update parameters, and may accordingly determine at least one adjusted routing update parameter based on the gathered network statistics. This adjusted routing update parameter may then be propagated to the nodes of the DAG, such that the nodes operate according to the (adaptively) adjusted routing update parameter.
    • 在一个实施例中,可以为计算机网络中的有向无环图(DAG)的节点设置一个或多个路由更新参数并传播给路由更新参数,该路由更新参数指示何时执行相应的路由更新操作。 决策节点(例如,DAG的根节点,头端的应用等)可以在操作期间基于路由更新参数来收集DAG的网络统计信息,并且因此可以确定至少一个经调整的路由更新参数 基于收集的网络统计。 然后可以将经调整的路由更新参数传播到DAG的节点,使得节点根据(自适应)调整的路由更新参数进行操作。
    • 33. 发明申请
    • Increased Communication Opportunities with Low-Contact Nodes in a Computer Network
    • 增加与计算机网络中低联系节点的沟通机会
    • US20120155463A1
    • 2012-06-21
    • US12971360
    • 2010-12-17
    • Jean-Philippe VasseurShmuel ShafferSandeep Jay Shetty
    • Jean-Philippe VasseurShmuel ShafferSandeep Jay Shetty
    • H04L12/56
    • H04L12/1863H04L12/185H04L67/145
    • In one embodiment, a particular node (e.g., root node) in a directed acyclic graph (DAG) in a computer network may identify a low-contact (e.g., wireless) node in the DAG that is at risk of having an invalid path when attempts are made to reach the low-contact node. In response, the particular node may identify neighbors of the low-contact node, and may establish a multicast tree from the particular node to the low-contact node through a plurality of the neighbors to reach the low-contact node. When sending traffic to the low-contact node, the particular node sends the traffic on the multicast tree, wherein each of the plurality of neighbors attempts to forward the traffic to the low-contact node. In another embodiment, the low-contact node itself indicates its status to the particular/root node, along with its list of neighbors in order to receive the multicast traffic.
    • 在一个实施例中,计算机网络中的有向非循环图(DAG)中的特定节点(例如,根节点)可以标识DAG中具有无效路径风险的低接触(例如,无线)节点,当 尝试到达低接触节点。 作为响应,特定节点可以识别低联系节点的邻居,并且可以通过多个邻居来建立从特定节点到低联系节点的多播树,以到达低接触节点。 当向低联系节点发送流量时,特定节点在多播树上发送流量,其中多个邻居中的每一个尝试将流量转发到低联系节点。 在另一个实施例中,低接触节点本身指示其对特定/根节点的状态及其邻居列表以便接收多播业务。
    • 36. 发明申请
    • MANAGEMENT OF MISBEHAVING NODES IN A COMPUTER NETWORK
    • 计算机网络中的管理问题
    • US20120307624A1
    • 2012-12-06
    • US13150866
    • 2011-06-01
    • Jean-Philippe VasseurJonathan W. HuiShmuel Shaffer
    • Jean-Philippe VasseurJonathan W. HuiShmuel Shaffer
    • H04L12/24
    • H04L41/0659H04L41/0609H04L41/0631H04L45/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确定关于如何将不良行为节点与计算机网络隔离的隔离指令,并相应地将它们发送到计算机网络中的一个或多个节点。
    • 37. 发明申请
    • Dynamic Expelling of Child Nodes in Directed Acyclic Graphs in a Computer Network
    • 在计算机网络中的定向非循环图中动态排除子节点
    • US20120155276A1
    • 2012-06-21
    • US12971422
    • 2010-12-17
    • Jean-Philippe VasseurShmuel Shaffer
    • Jean-Philippe VasseurShmuel Shaffer
    • H04L12/26
    • H04W40/24H04L45/04H04L45/28H04L45/48H04W28/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)中的父节点可以检测其子节点的拥塞。 作为响应,父节点可以基于拥塞来确定从父节点排出的特定子节点,并且响应于动态地检测到拥塞而通知被排除的子节点他们必须从父节点分离(例如,以找到新的父节点 ,不包括父节点和附近的任意节点)。 在另一个实施例中,子节点从当前父节点接收指示子节点被排除使用当前父节点的分离请求分组。 作为响应,子节点触发新的父选择以选择专门排除当前父节点(例如,以及父母附近的任选节点)的新父节点。
    • 40. 发明授权
    • Dynamic synchronized scheduling in a computer network
    • 计算机网络中的动态同步调度
    • US08830837B2
    • 2014-09-09
    • US12971440
    • 2010-12-17
    • Jean-Philippe VasseurShmuel ShafferCharles OkwudiaforSandeep Shetty
    • Jean-Philippe VasseurShmuel ShafferCharles OkwudiaforSandeep Shetty
    • H04L12/26H04L12/803H04L12/801
    • H04L47/125H04L47/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.
    • 在一个实施例中,计算机网络中的接收节点可以检测拥塞,并且还识别其相邻节点的集合(例如子集)。 响应于拥塞,接收节点可以基于拥塞来向组中的每个相邻节点分配传输时隙,其中每个邻居仅在其相应时隙期间被允许传输(同步)。 然后可以将分配的时隙发送到相邻节点集合。 在另一个实施例中,发送节点(例如,接收节点的邻居节点)可以从接收节点接收调度分组。 因此,发送节点可以确定其发送节点被允许发送的其分配的传输时隙。 因此,发送节点可以仅在分配的时隙(例如,给定时间)期间发送分组。 以这种方式,可以减少接收节点处的拥塞。