会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Local path repair in a wireless deterministic network
    • 无线确定性网络中的本地路径修复
    • US09319962B2
    • 2016-04-19
    • US14043974
    • 2013-10-02
    • Patrick WetterwaldJean-Philippe VasseurPascal Thubert
    • Patrick WetterwaldJean-Philippe VasseurPascal Thubert
    • H04W40/04H04W72/04H04W40/34H04W40/38H04L12/721H04L12/707H04L12/703
    • H04W40/04H04L45/12H04L45/22H04L45/28H04W40/34H04W40/38H04W72/0446Y02D70/144Y02D70/32
    • In one embodiment, an initial path is established in a wireless deterministic network between a source and a destination through one or more intermediate nodes, which are typically informed of a required metric between the source and the destination for communicating a packet. The initial path is locally (e.g., without contacting a path computation engine) reconfigured to bypass at least one of the intermediate nodes creating a new path, with the new path meeting the requirement(s) of the metric. Note, “locally reconfiguring” refers to the network nodes themselves determining a replacement path without reliance on a path computation engine or other entity (e.g., network management system, operating support system) in determining the replacement path. In one embodiment, a network node not on the initial path replaces a node on the initial path while using the same receive and send timeslots used in the initial path.
    • 在一个实施例中,通过一个或多个中间节点在源和目的地之间的无线确定性网络中建立初始路径,所述中间节点通常被通知源和目的地之间用于传送分组的所需度量。 初始路径在本地(例如,不接触路径计算引擎)被重新配置为绕过创建新路径的至少一个中间节点,新路径满足度量的要求。 注意,“本地重新配置”是指网络节点本身在不依赖路径计算引擎或其他实体(例如,网络管理系统,操作支持系统))确定替换路径时确定替换路径。 在一个实施例中,不在初始路径上的网络节点替换初始路径上的节点,同时使用在初始路径中使用的相同的接收和发送时隙。
    • 4. 发明申请
    • Sensor Data Transport and Consolidation Within Communication Nodes in a Network
    • 传感器数据传输和网络中通信节点的合并
    • US20150071255A1
    • 2015-03-12
    • US14021744
    • 2013-09-09
    • Patrick WetterwaldJean-Philippe VasseurPascal Thubert
    • Patrick WetterwaldJean-Philippe VasseurPascal Thubert
    • H04L5/00
    • H04L5/0037H04L12/46H04L12/56H04W4/38Y02D70/144
    • In one embodiment, sensor data is transported in a network to a rendezvous point network node, which consolidates the information into a consolidated result which is communicated to the destination. Such consolidation by a network node reduces the number of paths required in the network between the sensors and the destination. One embodiment includes acquiring, by each of a plurality of originating nodes in a wireless deterministic network, external data related to a same physical event; communicating through the network said external data from each of the plurality of originating nodes to a rendezvous point network node (RP) within the network; processing, by the RP, said external data from each of the plurality of originating nodes to produce a consolidated result; and communicating the consolidated result to a destination node of the network. In one embodiment, the network is a low power lossy network (LLN).
    • 在一个实施例中,传感器数据在网络中传送到会合点网络节点,其将信息合并到通信到目的地的综合结果中。 网络节点的这种整合减少了传感器和目的地之间网络中所需的路径数量。 一个实施例包括由无线确定性网络中的多个始发节点中的每一个获取与相同物理事件相关的外部数据; 通过所述网络将来自所述多个始发节点中的每一个的所述外部数据传送到所述网络内的会合点网络节点(RP); 通过RP处理来自多个始发节点中的每一个的外部数据来产生合并结果; 并将合并结果传送到网络的目的地节点。 在一个实施例中,网络是低功率有损网络(LLN)。
    • 5. 发明申请
    • 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)链的配置进行通信,以及监视网络中的通信,和/或选择性地控制是否使用所提供的特定链路。 一个实施例沿着通过网络的不同路径来颜色网络的节点(例如,无线确定性网络),并且以每个遍历节点的颜色标记分组以跟踪由分组采取的路径。 一个实施例通过网络发送特定数据包,并标记数据包穿过哪个链接并聚合特定数据包的其他副本的这些遍历链接。 一个实施例控制是否基于通过网络淹没控制分组来使用所提供的时隙,而对于这些链路中的每一个,启用或禁用信息。
    • 8. 发明申请
    • ALTERNATE DOWN PATHS FOR DIRECTED ACYCLIC GRAPH (DAG) ROUTING
    • 方向图(DAG)路由的替代下行方式
    • US20110228788A1
    • 2011-09-22
    • US12727893
    • 2010-03-19
    • Pascal ThubertPatrick WetterwaldJean-Philippe Vasseur
    • Pascal ThubertPatrick WetterwaldJean-Philippe Vasseur
    • H04L12/56
    • H04L41/12H04L45/02H04L45/48Y04S40/164
    • In one embodiment, a node “N” within a computer network utilizing directed acyclic graph (DAG) routing selects a parent node “P” within the DAG, and, where P is not a DAG root, may determine a grandparent node “GP” as a parent node to the parent node P. The node N may then also select an alternate parent node “P′” that has connectivity to GP and N. N may then inform P and P′ about prefixes reachable via N, and also about P′ as an alternate parent node to P to reach the prefixes reachable via N. Also, in one embodiment, P may be configured to inform GP about the prefixes reachable via N and also about P′ as an alternate parent node to P to reach the prefixes reachable via N, and P′ may be configured to store the prefixes reachable via N without informing other nodes about those prefixes.
    • 在一个实施例中,利用有向非循环图(DAG)路由的计算机网络内的节点“N”选择DAG内的父节点“P”,并且其中P不是DAG根,可以确定祖父节点“GP” 作为到父节点P的父节点。节点N然后还可以选择具有与GP和N的连接性的替代父节点“P”.N然后可以通知P和P'关于经由N可达的前缀,并且还关于 P'作为到P的替代父节点以到达可通过N到达的前缀。此外,在一个实施例中,P可以被配置为向GP通知关于可以经由N到达的前缀以及关于P'作为到P的替代父节点 可通过N和P'到达的前缀可被配置为存储可通过N到达的前缀,而不通知其他节点关于这些前缀。
    • 9. 发明申请
    • OAM and Time Slot Control in a Vertical Ladder Topology Network
    • 在垂直梯形拓扑网络中的OAM和时隙控制
    • US20170013621A1
    • 2017-01-12
    • US15275542
    • 2016-09-26
    • Pascal ThubertJean-Philippe VasseurPatrick Wetterwald
    • Pascal ThubertJean-Philippe VasseurPatrick Wetterwald
    • H04W72/04H04L12/26
    • H04W72/0446H04J3/1694H04L43/067H04L43/0876H04L45/32H04W40/023
    • In one embodiment, a network of nodes is configured to communicate according to a configuration of a vertical ladder topology 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.
    • 在一个实施例中,节点网络被配置为根据垂直梯形拓扑的配置以及监视网络中的通信进行通信,和/或选择性地控制是否使用所提供的特定链路。 一个实施例沿着通过网络的不同路径来颜色网络的节点(例如,无线确定性网络),并且以每个遍历节点的颜色标记分组以跟踪由分组采取的路径。 一个实施例通过网络发送特定数据包,并标记数据包穿过哪个链接并聚合特定数据包的其他副本的这些遍历链接。 一个实施例控制是否基于通过网络淹没控制分组来使用所提供的时隙,而对于这些链路中的每一个,启用或禁用信息。
    • 10. 发明申请
    • Local Path Repair in a Wireless Deterministic Network
    • 无线确定性网络中的本地路径修复
    • US20150092595A1
    • 2015-04-02
    • US14043974
    • 2013-10-02
    • Patrick WetterwaldJean-Philippe VasseurPascal Thubert
    • Patrick WetterwaldJean-Philippe VasseurPascal Thubert
    • H04W40/04H04W72/04
    • H04W40/04H04L45/12H04L45/22H04L45/28H04W40/34H04W40/38H04W72/0446Y02D70/144Y02D70/32
    • In one embodiment, an initial path is established in a wireless deterministic network between a source and a destination through one or more intermediate nodes, which are typically informed of a required metric between the source and the destination for communicating a packet. The initial path is locally (e.g., without contacting a path computation engine) reconfigured to bypass at least one of the intermediate nodes creating a new path, with the new path meeting the requirement(s) of the metric. Note, “locally reconfiguring” refers to the network nodes themselves determining a replacement path without reliance on a path computation engine or other entity (e.g., network management system, operating support system) in determining the replacement path. In one embodiment, a network node not on the initial path replaces a node on the initial path while using the same receive and send timeslots used in the initial path.
    • 在一个实施例中,通过一个或多个中间节点在源和目的地之间的无线确定性网络中建立初始路径,所述中间节点通常被通知源和目的地之间用于传送分组的所需度量。 初始路径在本地(例如,不接触路径计算引擎)被重新配置为绕过创建新路径的至少一个中间节点,新路径满足度量的要求。 注意,“本地重新配置”是指网络节点本身在不依赖路径计算引擎或其他实体(例如,网络管理系统,操作支持系统))确定替换路径时确定替换路径。 在一个实施例中,不在初始路径上的网络节点替换初始路径上的节点,同时使用在初始路径中使用的相同的接收和发送时隙。