会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 91. 发明授权
    • 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字段都不变。 如果任何接收到的回复消息指示到达目的地路由器,则该过程终止。
    • 92. 发明授权
    • 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节点“快速重路由”(即将主隧道上接收到的流量转移到备份隧道上),并发送备份隧道路径质量的通知(例如,使用一个或多个度量) 到头端节点。 然后,头端节点分析备份隧道的路径质量度量,以确定是否利用备份隧道或重新建立新的主隧道。
    • 94. 发明申请
    • 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到达的前缀,而不通知其他节点关于这些前缀。
    • 95. 发明授权
    • 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从第一个隧道是多样的。
    • 96. 发明授权
    • 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。
    • 97. 发明授权
    • Inter-domain point-to-multipoint path computation in a computer network
    • 计算机网络中的域间点对多点路径计算
    • US07701940B2
    • 2010-04-20
    • US11684313
    • 2007-03-09
    • Stefano NovelloJean-Philippe Vasseur
    • Stefano NovelloJean-Philippe Vasseur
    • H04L12/28H04L12/16H04L12/46
    • H04L45/04H04L47/11
    • In one embodiment, distributed path computation elements (PCEs) collaboratively build local portions of an inter-domain P2MP path to each path destination or to each ingress border router of one or more respective successor domains based on a cost associated with using one or more local ingress border routers received from each predecessor domain. Once a furthest destination is reached, each PCE may recursively return a list of local ingress border routers used in the P2MP path to each predecessor domain, where each PCE receiving the list correspondingly prunes segments of its computed local portion of the P2MP path that lead to unused successor ingress border routers, and sends a prune message to its predecessor domains accordingly. A root PCE receives the final prune message(s) and a representation of each locally computed portion of the inter-domain P2MP path, and combines the portions into a final inter-domain P2MP path.
    • 在一个实施例中,基于与使用一个或多个本地的相关联的成本,分布式路径计算元件(PCE)协作地构建到每个路径目的地的域间P2MP路径的本地部分或一个或多个相应后继域的每个入口边界路由器 从每个前身域收到的入口边界路由器。 一旦达到最远的目的地,每个PCE可以递归地将在P2MP路径中使用的本地进入边界路由器的列表返回到每个前导域,其中接收列表的每个PCE相应地减少其计算出的P2MP路径的本地部分的段, 未使用的后继入口边界路由器,并相应地向其前身域发送剪枝消息。 根PCE接收最终的修剪消息和域间P2MP路径的每个本地计算的部分的表示,并将这些部分组合成最终的域间P2MP路径。
    • 98. 发明申请
    • SCALING VIRTUAL PRIVATE NETWORKS USING SERVICE INSERTION ARCHITECTURE
    • 使用服务插入式架构扩展虚拟私有网络
    • US20080198849A1
    • 2008-08-21
    • US11676800
    • 2007-02-20
    • Jim GuichardJean-Philippe Vasseur
    • Jim GuichardJean-Philippe Vasseur
    • H04L12/28
    • H04L12/4675H04L45/02
    • In one embodiment, service routers may register their serviced VPNs with a service directory/broker (SDB), and edge routers may register their attached VPNs. The SDB may then return service headers, each corresponding to a particular VPN, and also returns an address of a service router corresponding to each service header to the edge routers. An edge router may then push an appropriate service header onto a received packet, and forward the packet to the corresponding service router, which forwards the packet based on a maintained VRF for a VPN according to the service header (e.g., thus the edge routers need only maintain limited/reduced VRFs). Also, services provided by the service routers may be distinguished using service headers accordingly. In this manner, the edge routers may forward packets requiring one or more desired services to service routers configured to perform such services.
    • 在一个实施例中,服务路由器可以向服务目录/代理(SDB)注册其服务的VPN,并且边缘路由器可以注册其附接的VPN。 然后,SDB可以返回各自对应于特定VPN的服务头部,并且还将与每个服务头部对应的服务路由器的地址返回给边缘路由器。 边缘路由器然后可以将适当的服务头部推送到接收到的分组上,并将分组转发到相应的服务路由器,该服务路由器根据服务头部(例如,因此边缘路由器需要)基于用于VPN的维护的VRF转发分组 只保留有限/减少的VRF)。 此外,服务路由器提供的服务可以相应地使用服务头来区分。 以这种方式,边缘路由器可以将需要一个或多个所需服务的分组转发到被配置为执行这样的服务的服务路由器。