会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Path optimization for mesh access points in a wireless mesh network
    • 无线网状网络中网状接入点的路径优化
    • US08155007B2
    • 2012-04-10
    • US11657662
    • 2007-01-25
    • Pascal ThubertVincent Jean RibierePatrick WetterwaldNeal Dante Castagnoli
    • Pascal ThubertVincent Jean RibierePatrick WetterwaldNeal Dante Castagnoli
    • H04L12/28
    • H04W40/30
    • In one embodiment, a method includes, in each of a plurality of mesh access points, connecting to one of a plurality of mesh controllers in a mesh network and passing connection information to the one mesh controller. The mesh access points include a wired mesh access point having a wired connection to the one mesh controller, and wireless mesh access points having a wireless connection to the one mesh controller via the wired mesh access point. The method also includes generating, in each mesh controller, a corresponding link state table based on the passed connection information from each corresponding connected mesh access point. The method also includes generating in at least one of the mesh controllers a mesh table, identifying all of the connecting links for the mesh access points connected among the mesh controllers, based on the mesh controllers sharing the respective link state tables.
    • 在一个实施例中,一种方法包括在多个网格接入点中的每一个中,连接到网状网络中的多个网格控制器中的一个,并将连接信息传递给一个网格控制器。 网格接入点包括具有到一个网格控制器的有线连接的有线网状接入点,以及具有经由有线网状接入点到一个网状控制器的无线连接的无线网状接入点。 该方法还包括在每个网格控制器中基于来自每个相应连接的网格接入点的传递的连接信息生成相应的链路状态表。 该方法还包括在网格控制器中的至少一个网格表中,基于共享相应链接状态表的网格控制器,在网格表之间生成网格表,以识别网格控制器之间连接的网格访问点的所有连接链接。
    • 2. 发明申请
    • Path optimization for mesh access points in a wireless mesh network
    • 无线网状网络中网状接入点的路径优化
    • US20080181133A1
    • 2008-07-31
    • US11657662
    • 2007-01-25
    • Pascal ThubertVincent Jean RibierePatrick WetterwaldNeal Dante Castagnoli
    • Pascal ThubertVincent Jean RibierePatrick WetterwaldNeal Dante Castagnoli
    • H04L12/28
    • H04W40/30
    • In one embodiment, a method includes, in each of a plurality of mesh access points, connecting to one of a plurality of mesh controllers in a mesh network and passing connection information to the one mesh controller. The mesh access points include a wired mesh access point having a wired connection to the one mesh controller, and wireless mesh access points having a wireless connection to the one mesh controller via the wired mesh access point. The method also includes generating, in each mesh controller, a corresponding link state table based on the passed connection information from each corresponding connected mesh access point. The method also includes generating in at least one of the mesh controllers a mesh table, identifying all of the connecting links for the mesh access points connected among the mesh controllers, based on the mesh controllers sharing the respective link state tables.
    • 在一个实施例中,一种方法包括在多个网格接入点中的每一个中,连接到网状网络中的多个网格控制器中的一个,并将连接信息传递给一个网格控制器。 网格接入点包括具有到一个网格控制器的有线连接的有线网状接入点,以及具有经由有线网状接入点到一个网状控制器的无线连接的无线网状接入点。 该方法还包括在每个网格控制器中基于来自每个相应连接的网格接入点的传递的连接信息生成相应的链路状态表。 该方法还包括在网格控制器中的至少一个网格表中,基于共享相应链接状态表的网格控制器,在网格表之间生成网格表,以识别网格控制器之间连接的网格访问点的所有连接链接。
    • 8. 发明授权
    • Alarm reordering to handle alarm storms in large networks
    • 报警重新排序以处理大型网络中的报警风暴
    • US07902973B2
    • 2011-03-08
    • US12272476
    • 2008-11-17
    • Pascal ThubertJean-Philippe VasseurPatrick WetterwaldVincent Jean Ribiere
    • Pascal ThubertJean-Philippe VasseurPatrick WetterwaldVincent Jean Ribiere
    • G08B29/00
    • H04L41/0681H04L41/12H04L43/0858H04L45/48H04W4/90H04W76/50
    • In one embodiment, one or more routing trees may be determined based on corresponding root nodes to reach a particular receiving node in a computer network. A delay value may be calculated at each node of the routing tree, the delay value inversely proportional to a distance between each respective node and the root node of the tree. Upon detecting a trigger at a particular node of the tree to transmit a stormed message to the particular receiving node (e.g., an alarm), the particular node may initiate a timer to count down the delay value in order to receive any upstream node stormed messages prior to expiration of the timer. The particular node may then coalesce the upstream node stormed messages with the stormed message of the particular node, and may transmit the coalesced stormed message downstream along the tree toward the particular receiving node upon expiration of the timer.
    • 在一个实施例中,可以基于对应的根节点确定一个或多个路由树,以到达计算机网络中的特定接收节点。 可以在路由树的每个节点处计算延迟值,延迟值与每个相应节点与树的根节点之间的距离成反比。 在检测到树的特定节点处的触发以将特定接收节点(例如,报警)发送冲击的消息时,特定节点可以启动定时器以对延迟值进行倒计数以便接收任何上游节点冲击的消息 在定时器到期之前。 然后,特定节点可以与特定节点的冲击消息合并上游节点冲击的消息,并且可以在定时器到期时沿着树向下向特定接收节点发送合并的风暴消息。
    • 9. 发明授权
    • Directed acyclic graph discovery and network prefix information distribution relative to a clusterhead in an ad hoc mobile network
    • 相对于自组织移动网络中的集群头的定向非循环图发现和网络前缀信息分发
    • US07860025B2
    • 2010-12-28
    • US11167240
    • 2005-06-28
    • Pascal ThubertPatrick WetterwaldVincent Jean Ribiere
    • Pascal ThubertPatrick WetterwaldVincent Jean Ribiere
    • H04L12/26
    • H04W40/24H04L45/00H04L45/02H04L45/04H04L45/48H04L45/54
    • Each mobile router in an ad hoc mobile network is configured for concurrently attaching to multiple parents advertising respective parent depths relative to a clusterhead of the ad hoc mobile network. The mobile router selects an advertised depth relative to the clusterhead based on adding a prescribed increment to a maximum one of the parent depths, enabling the mobile routers to form a directed acyclic graph relative to the clusterhead. Each mobile router sends to each of its parents a neighbor advertisement message specifying at least one reachable prefix, a corresponding cost for reaching the reachable prefix, and a corresponding sequence identifier that enables the parents to validate the neighbor advertisement message relative to stored router entries. Hence, mobile routers automatically can form a directed acylic graph relative to the clusterhead, and can distribute routing information with minimal overhead.
    • ad hoc移动网络中的每个移动路由器被配置为同时附接到相对于自组织移动网络的簇头广告相应父深度的多个父母。 移动路由器基于将规定的增量添加到父深度中的最大一个来选择相对于簇头的通告深度,使得移动路由器能够形成相对于簇头的有向非循环图。 每个移动路由器向每个移动路由器发送指定至少一个可达前缀的邻居通告消息,用于达到可达前缀的对应成本,以及相应的序列标识符,使得父母能够相对于存储的路由器条目验证邻居通告消息。 因此,移动路由器自动地可以形成相对于簇头的定向酰基图,并且可以以最小的开销来分发路由信息。