会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 91. 发明授权
    • Reduced authentication times for shared-media network migration
    • 降低了共享媒体网络迁移的验证时间
    • US08949959B2
    • 2015-02-03
    • US13400991
    • 2012-02-21
    • Atul B. MahamuniCarol BarrettJean-Philippe Vasseur
    • Atul B. MahamuniCarol BarrettJean-Philippe Vasseur
    • H04L29/00
    • H04L63/065H04L45/00H04W40/24
    • In one embodiment, a management device in a computer network determines when nodes of the computer network join any one of a plurality of field area routers (FARs), which requires a shared-media mesh security key for that joined FAR. The management device also maintains a database that indicates to which FAR each node in the computer network is currently joined, and to which FARs, if any, each node had previously joined, where the nodes are configured to maintain the mesh security key for one or more previously joined FARs in order to return to those previously joined FARs with the maintained mesh security key. Accordingly, in response to an updated mesh security key for a particular FAR of the plurality of FARs, the management node initiates distribution of the updated mesh security key to nodes having previously joined that particular FAR that are not currently joined to that particular FAR.
    • 在一个实施例中,计算机网络中的管理设备确定计算机网络的何时节点连接多个场区域路由器(FAR)中的任何一个,其需要用于该加入的FAR的共享 - 媒体网状安全密钥。 管理设备还维护一个数据库,指示计算机网络中每个节点当前加入哪个FAR,以及每个节点先前已加入的哪个FAR(如果有的话),其中节点被配置为维护一个或多个节点的网状安全密钥 以前加入的FAR,以便返回到以前加入的FAR与维护的网状安全密钥。 因此,响应于针对多个FAR的特定FAR的更新的网状安全密钥,管理节点发起更新的网状安全密钥到先前已加入到当前未连接到该特定FAR的特定FAR的节点的分发。
    • 92. 发明申请
    • OAM and Time Slot Control in a Deterministic ARC Chain Topology Network
    • 确定性ARC链拓扑网络中的OAM和时隙控制
    • US20150023328A1
    • 2015-01-22
    • US14020936
    • 2013-09-09
    • Pascal ThubertJean-Philippe VasseurPatrick Wetterwald
    • Pascal ThubertJean-Philippe VasseurPatrick Wetterwald
    • H04W72/04
    • H04W72/0446H04J3/1694H04L43/067H04L43/0876H04L45/32H04W40/023
    • In one embodiment, a network of nodes is configured to communicate according to a configuration of Available Routing Construct (ARC) chains as well as monitoring communication in the network, and/or selectively controls whether or not provisioned particular links will be used. One embodiment colors nodes of the network (e.g., a wireless deterministic network) along different paths through the network and marks packets with the color of each traversed node to track a path taken by a packet. One embodiment sends a particular packet through the network and marks over which links the packet traverses and aggregates these traversed links of other copies of the particular packet. One embodiment controls whether or not the provisioned time slots are used based on flooding a control packet through the network with enable or disable information for each of these links.
    • 在一个实施例中,节点网络被配置为根据可用路由构造(ARC)链的配置进行通信,以及监视网络中的通信,和/或选择性地控制是否使用所提供的特定链路。 一个实施例沿着通过网络的不同路径来颜色网络的节点(例如,无线确定性网络),并且以每个遍历节点的颜色标记分组以跟踪由分组采取的路径。 一个实施例通过网络发送特定数据包,并标记数据包穿过哪个链接并聚合特定数据包的其他副本的这些遍历链接。 一个实施例控制是否基于通过网络淹没控制分组来使用所提供的时隙,而对于这些链路中的每一个,启用或禁用信息。
    • 96. 发明授权
    • Sliced tunnels in a computer network
    • 计算机网络中的切片隧道
    • US08634292B2
    • 2014-01-21
    • US13247548
    • 2011-09-28
    • Jean-Philippe VasseurJeff Apcar
    • Jean-Philippe VasseurJeff Apcar
    • H04J1/16
    • H04L12/4633H04L45/00H04L45/50H04L2212/00
    • In one embodiment, a path for a sliced tunnel that extends from a head-end node to a tail-end node is computed. The sliced tunnel is furcated into a plurality of child tunnels at one or more fork nodes located downstream from the head-end node. Each child tunnel carries a portion of traffic for the sliced tunnel. The sliced tunnel is merged at one or more merge nodes located downstream from respective ones of the fork nodes. The portions of traffic on the child tunnels are aggregated at the merge nodes. The head-end node sends a signaling message to establish the sliced tunnel along the computed path. The signaling message includes an indication of the one or more fork nodes where the sliced tunnel is furcated into child tunnels and the one or more merge nodes where child tunnels are merged. The head-end node then forwards traffic onto the sliced tunnel.
    • 在一个实施例中,计算从头端节点延伸到尾端节点的切片隧道的路径。 切割的隧道在位于头端节点下游的一个或多个叉节点处分割成多个子隧道。 每个子隧道都携带切片隧道的一部分流量。 切片隧道在位于相应叉节点下游的一个或多个合并节点处合并。 子隧道上的部分流量在合并节点处聚合。 头端节点发送信令消息,以沿着计算的路径建立切片隧道。 所述信令消息包括所述一个或多个叉节点的指示,其中所述切片的隧道分割成子隧道,以及所述一个或多个合并节点,其中子隧道被合并。 然后,头端节点将流量转发到切片隧道。
    • 97. 发明授权
    • Lightweight storing mode for constrained computer networks
    • 用于受限计算机网络的轻量级存储模式
    • US08593986B2
    • 2013-11-26
    • US13150956
    • 2011-06-01
    • Jean-Philippe VasseurJonathan W. Hui
    • Jean-Philippe VasseurJonathan W. Hui
    • H04J1/16
    • H04L45/34H04L45/74
    • In one embodiment, a management device, such as a root node, monitors Internet Protocol (IP) overhead (e.g., IP header sizes during source-routing or route table sizes) within a directed acyclic graph (DAG) in a computer network. If it is determined that the IP overhead is above a configured threshold, then in response, a trigger is initiated to have devices within the DAG label-switch downward traffic directed away from the root node within the DAG. In another embodiment, a device communicating within a DAG stores IP routes corresponding to upward traffic from the device directed toward a root of the DAG, and IP-routes upward traffic based on the IP routes. Conversely, the device also stores labels corresponding to downward traffic from the device directed away from the root of the DAG, and label-switches downward traffic based on the labels, accordingly.
    • 在一个实施例中,诸如根节点的管理设备在计算机网络中的有向无环图(DAG)内监视互联网协议(IP)开销(例如,源路由或路由表大小期间的IP报头大小)。 如果确定IP开销高于配置的阈值,则作为响应,启动触发以使DAG标签中的设备向下转发指向远离DAG内的根节点。 在另一个实施例中,在DAG内通信的设备存储对应于来自指向DAG的根的设备的向上业务的IP路由,并且基于IP路由IP路由上行业务。 相反,该设备还存储对应于来自远离DAG的根的设备的向下流量的标签,并且相应地基于标签对下行流量进行标签交换。
    • 100. 发明申请
    • MANAGING FATE-SHARING IN SHARED-MEDIA COMMUNICATION NETWORKS
    • 在共享媒体通信网络中管理FATE共享
    • US20130227055A1
    • 2013-08-29
    • US13403103
    • 2012-02-23
    • Jean-Philippe VasseurJonathan W. Hui
    • Jean-Philippe VasseurJonathan W. Hui
    • G06F15/16
    • H04L43/04G06F11/2002H04L41/145H04L45/14H04L45/22H04L45/28H04W40/34
    • In one embodiment, a management device receives one or more fate-sharing reports locally generated by one or more corresponding reporting nodes in a shared-media communication network, the fate-sharing reports indicating a degree of localized fate-sharing between one or more pairs of nodes local to the corresponding reporting nodes. The management device may then determine, globally from aggregating the fate-sharing reports, one or more fate-sharing groups indicating sets of nodes having a global degree of fate-sharing within the communication network. As such, the management device may then advertise the fate-sharing groups within the communication network, wherein nodes of the communication network are configured to select a plurality of next-hops that minimizes fate-sharing between the plurality of next-hops.
    • 在一个实施例中,管理设备接收在共享 - 媒体通信网络中由一个或多个对应的报告节点本地生成的一个或多个命运共享报告,命运共享报告指示一个或多个对之间的局部化命运共享程度 的节点本地到相应的报告节点。 然后,管理设备可以全局地从聚合命运共享报告中确定一个或多个命运共享组,指示在通信网络内具有全局命中共享度的节点集合。 这样,管理装置然后可以通告通信网络内的命运共享组,其中通信网络的节点被配置为选择使多个下一跳之间的命运共享最小化的多个下一跳。