会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 62. 发明授权
    • Optimal automated exploration of hierarchical multiprotocol label switching label switch paths
    • 分层多协议标签交换标签交换路径的最佳自动化探索
    • US08116227B1
    • 2012-02-14
    • US11642473
    • 2006-12-20
    • Danny PrairieYufei ShiGeorge SwallowThomas D. NadeauVanson LimJean-Philippe Vasseur
    • Danny PrairieYufei ShiGeorge SwallowThomas D. NadeauVanson LimJean-Philippe Vasseur
    • H04L12/28H04L12/56
    • H04L45/50H04L45/24
    • Optimal automated exploration of hierarchical MPLS LSPs is disclosed. A path verification message (PVM) is transmitted from an initial router. Each label in the PVM's label stack corresponds to a hierarchy layer and is associated with a time-to-live (TTL) field. The TTL field for the label of a current layer is set so the PVM travels one hop from the initial router. In response, a reply message indicating that the PVM reached its destination is received. These steps are then repeated. For each successive PVM transmitted, the TTL field associated with a label corresponding to the current hierarchy layer is incremented. For any reply message including information describing a non-current layer, modify the next PVM's label stack and increment the TTL field of the label for the described different layer; any other TTL fields are unchanged. If any received reply message indicates a destination router was reached, the process terminates.
    • 公开了分层MPLS LSP的最佳自动化探索。 从初始路由器发送路径验证消息(PVM)。 PVM标签堆栈中的每个标签对应于层次结构层,并与生存时间(TTL)字段相关联。 当前层的标签的TTL字段设置为使PVM从初始路由器传播一跳。 作为响应,接收到指示PVM到达其目的地的应答消息。 然后重复这些步骤。 对于发送的每个连续的PVM,与当前层级层相对应的标签相关联的TTL字段递增。 对于包含描述非当前层的信息的任何回复消息,修改下一个PVM的标签栈,并增加描述的不同层的标签的TTL字段; 任何其他TTL字段都不变。 如果任何接收到的回复消息指示到达目的地路由器,则该过程终止。
    • 63. 发明授权
    • Technique for determining whether to reestablish fast rerouted primary tunnels based on backup tunnel path quality feedback
    • 基于备份隧道路径质量反馈确定是否重新建立快速重新路由的主隧道的技术
    • US08072879B2
    • 2011-12-06
    • US11347781
    • 2006-02-03
    • Jean-Philippe VasseurAlton LoAnna Charny
    • Jean-Philippe VasseurAlton LoAnna Charny
    • H04J1/16
    • H04L45/28H04J3/14H04L12/4633H04L45/22H04L45/50H04L45/60
    • A technique dynamically determines whether to reestablish a Fast Rerouted primary tunnel based on path quality feedback of a utilized backup tunnel in a computer network. According to the novel technique, a head-end node establishes a primary tunnel to a destination, and a point of local repair (PLR) node along the primary tunnel establishes a backup tunnel around one or more protected network elements of the primary tunnel, e.g., for Fast Reroute protection. Once one of the protected network elements fail, the PLR node “Fast Reroutes,” i.e., diverts, the traffic received on the primary tunnel onto the backup tunnel, and sends notification of backup tunnel path quality (e.g., with one or more metrics) to the head-end node. The head-end node then analyzes the path quality metrics of the backup tunnel to determine whether to utilize the backup tunnel or reestablish a new primary tunnel.
    • 一种技术基于计算机网络中利用的备用隧道的路径质量反馈来动态地确定是否重新建立快速重新路由的主隧道。 根据新技术,头端节点建立到目的地的主要隧道,沿主隧道的本地修复(PLR)节点建立围绕主隧道的一个或多个受保护网元的备用隧道,例如 ,用于快速重路由保护。 一旦受保护的网络元件发生故障,PLR节点“快速重路由”(即将主隧道上接收到的流量转移到备份隧道上),并发送备份隧道路径质量的通知(例如,使用一个或多个度量) 到头端节点。 然后,头端节点分析备份隧道的路径质量度量,以确定是否利用备份隧道或重新建立新的主隧道。
    • 64. 发明授权
    • Method and apparatus to compute local repair paths taking into account link resources and attributes
    • 考虑链路资源和属性来计算局部修复路径的方法和装置
    • US08068411B2
    • 2011-11-29
    • US11025179
    • 2004-12-29
    • Jean-Philippe VasseurStefano B. PrevidiDavid D. Ward
    • Jean-Philippe VasseurStefano B. PrevidiDavid D. Ward
    • H04J1/16H04L1/00
    • H04L45/28H04J3/14H04L45/02
    • A technique for calculating local repair paths through a computer network using one or more dynamically measured parameters in place of, or in addition to, statically assigned cost metrics. The dynamically measured parameters include various statistical measures of resources and attributes associated with data links and/or network nodes in the computer network. In operation, an intermediate node monitors a set of local link and/or node parameters. The node may generate an advertisement in response to at least one of its monitored parameters crossing a predetermined threshold value or changing value by a predetermined percentage or amount. The advertisement is “flooded” so as to advertise the dynamically measured parameter value to other neighboring intermediate nodes. After receiving the advertisement, each node may recalculate one or more local repair paths based on the advertised parameter value. The node may utilize a recalculated repair path if it provides an appreciably lower-cost path, e.g., by a predetermined percentage, as compared with the currently deployed repair path.
    • 一种用于通过使用一个或多个动态测量参数来代替静态分配的成本度量来计算通过计算机网络的局部修复路径的技术。 动态测量的参数包括与计算机网络中的数据链路和/或网络节点相关联的资源和属性的各种统计测量。 在运行中,中间节点监视一组本地链路和/或节点参数。 该节点可以响应于其所监视的参数中的至少一个与预定阈值相交或者以预定百分比或数量改变值来生成广告。 广告被“淹没”,以便将动态测量的参数值通告给其他相邻的中间节点。 在接收到广告之后,每个节点可以基于所通告的参数值重新计算一个或多个本地修复路径。 如果节点可以使用重新计算的修复路径,如果其与当前部署的修复路径相比提供了明显较低成本的路径,例如,以预定百分比。
    • 66. 发明申请
    • 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到达的前缀,而不通知其他节点关于这些前缀。
    • 68. 发明授权
    • Path diversity for customer-to-customer traffic
    • 客户到客户流量的路径多样性
    • US07710902B2
    • 2010-05-04
    • US11604624
    • 2006-11-27
    • Jean-Philippe VasseurJim Guichard
    • Jean-Philippe VasseurJim Guichard
    • H04L12/56H04J1/16
    • H04L45/24H04L12/4633H04L45/04H04L45/28H04L45/50
    • In one embodiment, egress provider edge devices (PEs) send advertisements to ingress PEs for address prefixes of a first multi-homed customer network that desires path diversity through a service provider network to a second customer network. A first ingress PE receives the advertisements, and determines whether a second ingress PE is multi-homed with the first ingress PE to the second customer network. If so, the first ingress PE computes a plurality of diverse paths within the service provider network from the first and second multi-homed ingress PEs to a corresponding egress PE. If a plurality of diverse paths exists, the first ingress PE employs one of those paths to establish a first tunnel from itself to a first egress PE, and the second ingress PE employs another of the paths to establish a second tunnel from itself to a second egress PE that is diverse from the first tunnel.
    • 在一个实施例中,出口提供商边缘设备(PE)向用于向通过服务提供商网络到第二客户网络的路径分集的第一多归属客户网络的地址前缀的入口PE发送广告。 第一入口PE接收广告,并且确定第二入口PE是否与第一入口PE多宿主到第二客户网络。 如果是,则第一入口PE将服务提供商网络内的多个不同路径从第一和第二多归位进入PE计算到对应的出口PE。 如果存在多个不同的路径,则第一入口PE使用这些路径之一来建立自己到第一出口PE的第一隧道,并且第二入口PE采用另一路径来建立从其自身到第二隧道的第二隧道 出口PE从第一个隧道是多样的。
    • 69. 发明授权
    • Technique for enabling traffic engineering on CE-CE paths across a provider network
    • 通过供应商网络在CE-CE路径上实现流量工程的技术
    • US07710872B2
    • 2010-05-04
    • US11302595
    • 2005-12-14
    • Jean-Philippe Vasseur
    • Jean-Philippe Vasseur
    • H04J1/16
    • H04L45/50H04L45/02
    • A technique enables Traffic Engineering (TE) on paths between customer edge devices (CEs) across a provider network (“CE-CE paths”) in a computer network. According to the novel technique, TE is configured on a link from a sending provider edge device (PE) to a first CE (“PE-CE link”), e.g., a CE of one or more virtual private networks (VPNs). The sending PE conveys TE information of the PE-CE link to one or more receiving PEs in the provider network. Upon receiving the TE information, each receiving PE expands a TE database (TED) for information regarding the provider network (i.e., a “core TED”) to include TE-configured PE-CE links, e.g., by updating one or more corresponding VPN TEDs (VTEDs) for each VPN maintained by the receiving PE. Once the receiving PEs have the TE information for configured PE-CE links from the provider network, one or more TE techniques may be applied to paths from a second CE of the receiving PE to the first CE (a CE-CE path) to thereby facilitate, e.g., establishment of TE-LSPs along CE-CE paths.
    • 一种技术使计算机网络中跨供应商网络(“CE-CE路径”)的客户边缘设备(CE)之间路径的流量工程(TE)。 根据新技术,TE在从发送提供商边缘设备(PE)到第一CE(“PE-CE链路”),例如一个或多个虚拟专用网(VPN)的CE的链路上配置。 发送PE将PE-CE链路的TE信息传递给提供商网络中的一个或多个接收PE。 在接收到TE信息时,每个接收的PE扩展TE数据库(TED)以获得关于提供商网络(即,“核心TED”)的信息,以包括TE配置的PE-CE链路,例如通过更新一个或多个对应的VPN 由接收PE维护的每个VPN的TED(VTED)。 一旦接收到的PE具有来自提供商网络的配置的PE-CE链路的TE信息,则一个或多个TE技术可以应用于从接收PE的第二CE到第一CE(CE-CE路径)的路径,从而 方便,例如沿CE-CE路径建立TE-LSP。
    • 70. 发明授权
    • Loop prevention technique for MPLS using service labels
    • 使用服务标签的MPLS环路防护技术
    • US07664013B2
    • 2010-02-16
    • US11068081
    • 2005-02-28
    • Clarence FilsfilsDavid D. WardStefano B. PrevidiJean-Philippe VasseurJim GuichardRobert Raszuk
    • Clarence FilsfilsDavid D. WardStefano B. PrevidiJean-Philippe VasseurJim GuichardRobert Raszuk
    • H04L12/26
    • H04L45/18H04L45/04H04L45/22H04L45/28H04L45/50
    • A local fast reroute (FRR) technique is implemented at the edge of a computer network. In accordance with the technique, if an edge device detects a node or link failure that prevents it from communicating with a neighboring routing domain, the edge device reroutes at least some data packets addressed to that domain to a backup edge device which, in turn, forwards the packets to the neighboring domain. The rerouted packets are designated as being “protected” (i.e., rerouted) data packets before they are forwarded to the backup edge device. The backup edge device identifies protected data packets as those which contain a predetermined “service” label in their MPLS label stacks. In other words, the service label is used as an identifier for packets that have been FRR rerouted. Upon receiving a data packet containing a service label, the backup edge device is not permitted to reroute the packet a second time, e.g., in response to another inter-domain node or link failure, thereby preventing loops from developing at the edge of the network.
    • 本地快速重路由(FRR)技术在计算机网络的边缘实现。 根据该技术,如果边缘设备检测到阻止其与相邻路由域通信的节点或链路故障,则边缘设备将至少一些寻址到该域的数据分组重新路由到备用边缘设备, 将数据包转发到相邻域。 重新路由的数据包在被转发到备份边缘设备之前被指定为“保护”(即重新路由)数据分组。 备份边缘设备将受保护的数据包标识为在其MPLS标签堆栈中包含预定“服务”标签的数据包。 换句话说,服务标签被用作已被FRR重新路由的数据包的标识符。 在接收到包含服务标签的数据分组时,不允许备份边缘设备第二次重新路由该分组,例如响应于另一个域间节点或链路故障,从而防止在网络边缘发展的环路 。