会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 21. 发明授权
    • Computation of a shortest inter-domain TE-LSP across a set of autonomous systems
    • 跨一组自治系统计算最短域间TE-LSP
    • US07814227B2
    • 2010-10-12
    • US11073348
    • 2005-03-04
    • Jean-Philippe VasseurStefano B. Previdi
    • Jean-Philippe VasseurStefano B. Previdi
    • G06F15/173
    • H04L45/12H04L45/04H04L45/42H04L45/50
    • A technique calculates a shortest path for a traffic engineering (TE) label switched path (LSP) from a head-end node in a local domain to a tail-end node of a remote domain in a computer network. The novel path calculation technique determines a set of different remote domains through which the TE-LSP may traverse to reach the tail-end node (e.g., along “domain routes”). Once the set of possible routes is determined, the head-end node sends a path computation request to one or more path computation elements (PCEs) of its local domain requesting a computed path for each domain route. Upon receiving path responses for each possible domain route, the head-end node selects the optimal (shortest) path, and establishes the TE-LSP accordingly.
    • 一种技术计算从本地域中的头端节点到计算机网络中远程域的尾端节点的流量工程(TE)标签交换路径(LSP)的最短路径。 新颖的路径计算技术确定了一组不同的远程域,TE-LSP可以通过该组来遍历尾端节点(例如沿着“域路由”)。 一旦确定了可能的路由集合,则前端节点向其本地域的一个或多个路径计算元件(PCE)发送路径计算请求,请求每个域路由的计算路径。 在接收每个可能的域路由的路径响应时,前端节点选择最优(最短)路径,并相应建立TE-LSP。
    • 25. 发明授权
    • Border router protection with backup tunnel stitching in a computer network
    • 边缘路由器保护,在计算机网络中备份隧道缝合
    • US07512063B2
    • 2009-03-31
    • US11012044
    • 2004-12-14
    • Jean-Philippe VasseurStefano B. Previdi
    • Jean-Philippe VasseurStefano B. Previdi
    • H04J3/14
    • H04L45/22H04L45/02H04L45/04H04L45/28H04L45/50H04L47/70H04L47/724H04L47/728H04L47/746H04L47/825
    • A technique protects against the failure of a border router between two domains in a computer network using Fast Reroute and backup tunnels. According to the technique, the protected border router advertises a list of all its adjacent next-hop routers (i.e., its “neighbors”). A neighbor in the first domain that is immediately upstream to the protected border router and that is configured to protect the border router (i.e., the “protecting router”) selects a neighbor in a second domain (i.e., a “next-next-hop,” NNHOP) to act as a “merge point” of all the NNHOPs of that domain. The protecting router calculates a backup tunnel to the merge point that excludes the protected border router and associates the backup tunnel with all “protected prefixes.” The merge point then “stitches” additional backup tunnels onto the backup tunnel to provide a stitched tunnel to each remaining NNHOP. When the protected border router fails, Fast Reroute is triggered, and all protected prefix traffic is rerouted onto the backup tunnel to the merge point, which either forwards the traffic to its reachable prefixes or to a corresponding stitched tunnel.
    • 一种技术可以防止计算机网络中使用快速重路由和备份隧道的两个域之间的边界路由器发生故障。 根据该技术,受保护的边界路由器通告其所有相邻的下一跳路由器(即其“邻居”)的列表。 紧邻受保护边界路由器上游并被配置为保护边界路由器(即,“保护路由器”)的第一域中的邻居选择第二域中的邻居(即,下一跳) ,“NNHOP”)作为该域的所有NNHOP的“合并点”。 保护路由器计算到合并点的备用隧道,排除受保护的边界路由器,并将备份隧道与所有“受保护的前缀”相关联。 合并点然后将其他备用隧道“缝合”到备份隧道上,为每个剩余的NNHOP提供缝合隧道。 当受保护的边界路由器发生故障时,快速重路由被触发,并且所有保护的前缀流量被重新路由到到合并点的备份隧道,该合并点将流量转发到其可达到的前缀或相应的缝合隧道。