会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 44. 发明申请
    • 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确定关于如何将不良行为节点与计算机网络隔离的隔离指令,并相应地将它们发送到计算机网络中的一个或多个节点。
    • 48. 发明申请
    • METHOD AND APPARATUS TO TRIGGER DAG REOPTIMIZATION IN A SENSOR NETWORK
    • 在传感器网络中触发DAG选择的方法和装置
    • US20120213124A1
    • 2012-08-23
    • US13044299
    • 2011-03-09
    • Jean-Philippe VasseurNavneet AgarwalJonathan W. Hui
    • Jean-Philippe VasseurNavneet AgarwalJonathan W. Hui
    • H04L12/28
    • H04L45/02H04L41/12H04L45/26H04L45/48H04W4/70H04W40/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拓扑偏差。 然后可以使用许多算法来确定是否需要重新优化,即全局修复,如果是,则根节点可以动态地触发全局修复。
    • 49. 发明申请
    • 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)中的父节点可以检测其子节点的拥塞。 作为响应,父节点可以基于拥塞来确定从父节点排出的特定子节点,并且响应于动态地检测到拥塞而通知被排除的子节点他们必须从父节点分离(例如,以找到新的父节点 ,不包括父节点和附近的任意节点)。 在另一个实施例中,子节点从当前父节点接收指示子节点被排除使用当前父节点的分离请求分组。 作为响应,子节点触发新的父选择以选择专门排除当前父节点(例如,以及父母附近的任选节点)的新父节点。
    • 50. 发明申请
    • Dynamic Synchronized Scheduling in a Computer Network
    • 计算机网络中的动态同步调度
    • US20120155260A1
    • 2012-06-21
    • US12971440
    • 2010-12-17
    • Jean-Philippe VasseurShmuel ShafferCharles OkwudiaforSandeep Jay Shetty
    • Jean-Philippe VasseurShmuel ShafferCharles OkwudiaforSandeep Jay Shetty
    • H04L12/26
    • 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.
    • 在一个实施例中,计算机网络中的接收节点可以检测拥塞,并且还识别其相邻节点的集合(例如子集)。 响应于拥塞,接收节点可以基于拥塞来向组中的每个相邻节点分配传输时隙,其中每个邻居仅在其相应时隙期间被允许传输(同步)。 然后可以将分配的时隙发送到相邻节点集合。 在另一个实施例中,发送节点(例如,接收节点的邻居节点)可以从接收节点接收调度分组。 因此,发送节点可以确定其发送节点被允许发送的其分配的传输时隙。 因此,发送节点可以仅在分配的时隙(例如,给定时间)期间发送分组。 以这种方式,可以减少接收节点处的拥塞。