会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 6. 发明授权
    • 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. 发明授权
    • Computing disjoint paths for reactive routing mesh networks
    • 计算反应式路由网格网络的不相交路径
    • US08578054B2
    • 2013-11-05
    • US12044526
    • 2008-03-07
    • Pascal ThubertJean-Philippe VasseurVincent Jean Ribiere
    • Pascal ThubertJean-Philippe VasseurVincent Jean Ribiere
    • G06F15/173
    • H04L47/125H04L45/128H04L45/22H04L45/64H04W40/28
    • In one embodiment, a reactive routing computer network may be partitioned into diverse logical topologies, and a source node may transmit route request (RREQ) messages toward a destination node on each logical topology. In response, the source node may receive route reply (RREP) messages indicating routes to the destination node in each logical topology. The source node may thus select a route for each logical topology to reach the destination node, accordingly. In another embodiment, if partitioned logical topologies do not produce two or more routes or as a standalone embodiment, the source node may transmit RREQ messages toward the destination node without any corresponding logical topology. The destination node receives RREQ messages, and two or more routes from the source node to the destination node may be determined (e.g., by the destination or source node) based on the received RREQ messages at the destination node and path selection criteria.
    • 在一个实施例中,可以将反应性路由计算机网络划分成不同的逻辑拓扑,并且源节点可以向每个逻辑拓扑上的目的地节点发送路由请求(RREQ)消息。 作为响应,源节点可以在每个逻辑拓扑中接收指示到目的地节点的路由的路由回复(RREP)消息。 因此,源节点可以相应地为每个逻辑拓扑选择到达目的地节点的路由。 在另一个实施例中,如果分区逻辑拓扑不产生两个或更多个路由或者作为独立实施例,则源节点可以向目的地节点发送RREQ消息而没有任何对应的逻辑拓扑。 目的地节点接收RREQ消息,并且可以基于目的地节点处的接收到的RREQ消息和路径选择标准来确定从源节点到目的地节点的两条或更多路由(例如,由目的地或源节点)。