会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 43. 发明授权
    • Technique for efficiently avoiding transient routing disturbances in link state routing protocols with link state packet fragmentation
    • 用于有效地避免链路状态路由协议中具有链路状态分组碎片的瞬时路由干扰的技术
    • US07751336B2
    • 2010-07-06
    • US11449282
    • 2006-06-08
    • Christian HoppsStefano B. Previdi
    • Christian HoppsStefano B. Previdi
    • H04J1/16
    • H04L45/02
    • A technique efficiently avoids transient routing disturbances in link state routing protocols with fragmented link state packets (LSPs) in a computer network. According to the novel technique, a link state router (LSR) specifies which of two or more links are to be advertised in each of two or more corresponding LSP fragments. The LSR advertises the states of the specified links in the corresponding LSP fragments to one or more other LSRs. In other words, each link of the LSR is assigned to a particular LSP fragment, and the state of the link is always to be advertised in that particular LSP fragment (i.e., no fragment wrapping). Upon receiving the LSP fragments, the other LSRs may update the correct link states based on the individual LSP fragments, i.e., without transient routing disturbances caused by fragment wrapping.
    • 一种技术有效地避免了在计算机网络中具有分段链路状态分组(LSP)的链路状态路由协议中的瞬时路由干扰。 根据新技术,链路状态路由器(LSR)规定两个或多个对应的LSP片段中的每一个中要发布两条或多条链路中的哪条链路。 LSR将对应的LSP片段中指定链路的状态通告给一个或多个其他LSR。 换句话说,LSR的每个链路被分配给特定的LSP片段,并且链路的状态总是在该特定的LSP片段中通告(即,没有片段包装)。 在接收到LSP片段时,其他LSR可以基于各个LSP片段来更新正确的链路状态,即没有由片段包装引起的瞬时路由干扰。
    • 44. 发明授权
    • Inter-domain optimization trigger in PCE-based environment
    • 基于PCE的环境中的域间优化触发
    • US07684351B2
    • 2010-03-23
    • US11052280
    • 2005-02-07
    • Jean-Philippe VasseurDavid D. WardMuthurajah SivabalanStefano B. Previdi
    • Jean-Philippe VasseurDavid D. WardMuthurajah SivabalanStefano B. Previdi
    • H04L12/28
    • H04L45/42H04L45/02H04L45/04H04L45/32H04L45/50
    • A technique triggers optimization of a traffic engineering (TE) label switched path (LSP) that spans multiple domains of a computer network from a head-end node of a local domain to a tail-end node of a remote domain. The technique is based on the detection of an event in the remote domain (“event domain”) that could create a more optimal TE-LSP, such as, e.g., restoration of a network element or increased available bandwidth. Specifically, a path computation element (PCE) in the event domain learns of the event and notifies other PCEs of the event through an event notification. These PCEs then flood an event notification to label switched routers (LSRs) in their respective domain. Upon receiving the notification, if an LSR has one or more TE-LSPs (or pending TE-LSPs), it responds to the PCE with an optimization request for the TE-LSPs. The PCE determines whether a particular TE-LSP may benefit from optimization based on the event domain (i.e., whether the TE-LSP uses the event domain), and processes the request accordingly.
    • 一种技术触发跨越计算机网络的多个域从本地域的头端节点到远程域的尾端节点的流量工程(TE)标签交换路径(LSP)的优化。 该技术基于对远程域(“事件域”)中的事件的检测,其可以创建更优化的TE-LSP,例如网络元件的恢复或增加的可用带宽。 具体地,事件域中的路径计算元素(PCE)学习事件并通过事件通知通知其他PCE事件。 然后,这些PCE将事件通知泛滥到其各自域中的标签交换路由器(LSR)。 在收到通知后,如果LSR有一个或多个TE-LSP(或待处理的TE-LSP),则对该TEE的优先请求响应PCE。 PCE确定特定TE-LSP是否可以从基于事件域的优化(即,TE-LSP是否使用事件域)获益,并且相应地处理该请求。
    • 46. 发明授权
    • Loop prevention technique for MPLS using two labels
    • 使用两个标签的MPLS环路防护技术
    • US07633859B2
    • 2009-12-15
    • US11046163
    • 2005-01-26
    • Clarence FilsfilsJim GuichardJean-Philippe VasseurStefano B. PrevidiRobert Raszuk
    • Clarence FilsfilsJim GuichardJean-Philippe VasseurStefano B. PrevidiRobert Raszuk
    • H04L12/56
    • H04L45/00H04L45/18H04L45/22H04L45/28H04L45/50H04W12/02
    • A fast reroute (FRR) technique is implemented at the edge of a 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. To differentiate which data packets are protected and which are not, the backup edge device employs different sets of VPN label values for protected and non-protected network traffic. That is, the backup edge device may allocate two different VPN label values for at least some destination address prefixes that are reachable through the neighboring domain: a first VPN label value for FRR protected traffic and a second VPN label value for non-protected traffic. Upon receiving a data packet containing a protected VPN label value, 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)技术。 根据该技术,如果边缘设备检测到阻止其与相邻路由域通信的节点或链路故障,则边缘设备将至少一些寻址到该域的数据分组重新路由到备用边缘设备, 将数据包转发到相邻域。 重新路由的数据包在被转发到备份边缘设备之前被指定为“保护”(即重新路由)数据分组。 为了区分哪些数据包受到保护,哪些数据包不受保护,备份边缘设备对受保护和未受保护的网络流量采用不同的VPN标签值集合。 也就是说,备份边缘设备可以为可通过相邻域到达的至少一些目的地地址前缀分配两个不同的VPN标签值:用于FRR保护的业务的第一VPN标签值和用于非保护业务的第二VPN标签值。 在接收到包含受保护的VPN标签值的数据分组时,不允许备份边缘设备第二次重新路由该分组,例如响应于另一个域间节点或链路故障,从而防止循环在 网络。
    • 49. 发明授权
    • Efficient mechanism for fast recovery in case of border router node failure in a computer network
    • 在计算机网络中边界路由器节点故障的情况下快速恢复的高效机制
    • US07515529B2
    • 2009-04-07
    • US11011814
    • 2004-12-14
    • Jean-Philippe VasseurStefano B. Previdi
    • Jean-Philippe VasseurStefano B. Previdi
    • H04L12/26
    • H04L45/22H04L45/04H04L45/28H04L45/50
    • A technique protects traffic (IP) against the failure of a border router between two domains in a computer network using Fast Reroute and backup tunnels. The border router (i.e., the “protected border router”) announces/advertises a list of all its adjacent next-hop routers (i.e., its “neighbors”) residing in first and second domains interconnected by the protected border router. 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”) learns address prefixes (i.e., “protected prefixes”) reachable from the next-hop router in the second domain (i.e., “next-next-hops,” NNHOPs to the protected prefixes from the protecting router). The protecting router calculates a backup tunnel to each NNHOP that excludes the protected border router, and associates each backup tunnel with protected prefixes accordingly. When the protected border router fails, Fast Reroute is triggered, and the protected prefixes are rerouted by the protecting router onto an appropriate backup tunnel to a corresponding NNHOP.
    • 一种技术可以使用快速重路由和备份隧道来保护流量(IP)免受计算机网络中两个域之间的边界路由器故障的影响。 边界路由器(即“受保护的边界路由器”)宣布/通告驻留在由受保护的边界路由器互连的第一和第二域中的所有相邻的下一跳路由器(即其“邻居”)的列表。 紧邻受保护边界路由器上游并被配置为保护边界路由器(即“保护路由器”)的第一个域中的邻居学习从下一跳到达的地址前缀(即,“保护前缀”) 路由器在第二个域(即“next-next-hops”,NNHOP到保护路由器的受保护的前缀)。 保护路由器计算每个NNHOP的备份隧道,排除受保护的边界路由器,并相应地将每个备份隧道与受保护的前缀相关联。 当受保护的边界路由器发生故障时,快速重路由被触发,受保护的前缀被保护路由器重新路由到相应的NNHOP的适当备份隧道。
    • 50. 发明授权
    • Method and apparatus for determining network routing information based on shared risk link group information
    • 基于共享风险链路组信息确定网络路由信息的方法和装置
    • US07428213B2
    • 2008-09-23
    • US10719003
    • 2003-11-21
    • Jean Philippe VasseurStefano B. PrevidiClarence FilsfilsDavid Ward
    • Jean Philippe VasseurStefano B. PrevidiClarence FilsfilsDavid Ward
    • H04L12/26
    • H04L45/12H04B1/71635H04L45/02H04L45/18H04L45/22H04L45/28H04L45/46H04L45/48H04L45/50H04W88/06H04W88/10
    • A method and apparatus are disclosed for performing a shortest path first network routing path determination in a data communications network based in part on information about links that are associated as shared risk link groups. Micro-loops are avoided in computing shortest path first trees by considering whether links are within shared risk link groups. In a first approach, for each link state packet in a link state database, listed adjacencies are removed if the link between the node originating the LSP and the reported adjacency belongs to a shared risk link group for which one component (local link) is known as down, and a shortest path first computation is then performed. In a second approach, during the SPT computation and after having added a first node to a path, each neighboring node is added to a tentative tree if and only if, a link between the first node and the neighboring node does not belong to a shared risk link group for which one component (local link) is known as down.
    • 公开了一种用于在数据通信网络中执行最短路径第一网络路由路径确定的方法和装置,部分地基于关于作为共享风险链路组关联的链路的信息。 通过考虑链路是否在共享风险链路组内,避免了计算最短路径树的微循环。 在第一种方法中,对于链路状态数据库中的每个链路状态分组,如果发起LSP的节点和报告的邻接关系之间的链路属于已知一个组件(本地链路)的共享风险链路组,则删除列出的邻接关系 然后执行最短路径优先计算。 在第二种方法中,在SPT计算期间,并且在将第一节点添加到路径之后,当且仅当第一节点和相邻节点之间的链路不属于共享时,每个相邻节点被添加到暂定树 一个组件(本地链路)被称为down的风险链路组。