专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

21. 发明申请

US20060215577A1 System and methods for identifying network path performance 审中-公开
标题翻译：用于识别网络路径性能的系统和方法
公开(公告)号：US20060215577A1
公开(公告)日：2006-09-28
申请号：US11086007
申请日：2005-03-22
申请人： James Guichard , Jean-Philippe Vasseur , Thomas Nadeau , David Ward
发明人： James Guichard , Jean-Philippe Vasseur , Thomas Nadeau , David Ward
IPC分类号： H04L12/28
CPC分类号： H04L43/50 , H04L41/12 , H04L41/5003 , H04L45/00 , H04L45/121 , H04L45/123 , H04L45/124 , H04L45/22 , H04L45/26 , H04L45/302 , H04L45/42 , H04L45/50
摘要： A system and method for aggregating performance characteristics for core network paths allows computation of message traffic performance over each of the available candidate paths through the core for identifying an optimal core network path. Particular network traffic, or messages, include attributes indicative of performance, such as transport time, delay, jitter, and drop percentage, over individual hops along the candidate path. A diagnostic processor parses these messages to identify the attributes corresponding to performance, and analyzes the resulting parsed routing information to compute an expected performance, such as available bandwidth (e.g. transport rate) over the path. Messages including such attributes may include link state attribute (LSA) messages, diagnostic probe messages specifically targeted to enumerate such attributes, or other network suitable network traffic. In a particular configuration, the messages may be Path Verification Protocol (PVP) messages.
摘要翻译：用于聚合核心网络路径的性能特征的系统和方法允许通过核心的每个可用候选路径计算消息业务性能，用于识别最佳核心网路径。特定网络流量或消息包括指示性能的属性，例如沿着候选路径的单个跳跃的传输时间，延迟，抖动和丢弃百分比。诊断处理器解析这些消息以识别与性能相对应的属性，并分析所得到的解析路由信息以计算期望的性能，例如路径上的可用带宽（例如传输速率）。包括这些属性的消息可以包括链路状态属性（LSA）消息，专门用于枚举这样的属性的诊断探测消息，或其他网络合适的网络业务。在特定配置中，消息可以是路径验证协议（PVP）消息。

22. 发明授权

US07031262B2 Reoptimization triggering by path computation elements 有权
标题翻译：路径计算元素的优化触发
公开(公告)号：US07031262B2
公开(公告)日：2006-04-18
申请号：US10848744
申请日：2004-05-19
申请人： Jean Philippe Vasseur , David Ward , Muthurajah Sivabalan , Robert Goguen
发明人： Jean Philippe Vasseur , David Ward , Muthurajah Sivabalan , Robert Goguen
IPC分类号： H04L12/26
CPC分类号： H04L45/12 , H04L45/04 , H04L45/125 , H04L45/42 , H04L45/44 , H04L45/50 , H04L45/70 , H04L47/125 , H04L47/762 , H04L47/822 , H04L47/825
摘要： A mechanism to alleviate bandwidth fragmentation in a network employing path computation element(s) to place MPLS Traffic Engineering tunnels. One application is a multiple Autonomous System or multiple area network employing distributed computation of MPLS Traffic Engineering LSPs. A particular path computation element may determine that bandwidth fragmentation is present based on monitoring of path computation failures where desired paths are blocked due to bandwidth constraints. In response to the detected bandwidth fragmentation condition, the path computation element floods a routing notification within its Autonomous System or area. Nodes respond to the routing notification by requesting reoptimization of their own previously requested Traffic Engineering LSPs allowing the path computation element an opportunity to alleviate bandwidth fragmentation.
摘要翻译：一种减轻使用路径计算元素的网络中带宽分段的放置MPLS流量工程隧道的机制。一个应用是采用MPLS流量工程LSP的分布式计算的多自治系统或多区域网络。特定路径计算元件可以基于由于带宽限制阻止期望路径的路径计算失败的监视来确定存在带宽分段。响应于检测到的带宽分段条件，路径计算元件在其自治系统或区域内泛洪路由通知。节点通过请求重新优化自己先前请求的流量工程LSP来响应路由通知，允许路径计算元素减轻带宽分段的机会。

23. 发明授权

US07974285B2 Method and apparatus for identifying an egress point to a network location 有权
标题翻译：用于识别到网络位置的出口点的方法和装置
公开(公告)号：US07974285B2
公开(公告)日：2011-07-05
申请号：US11045015
申请日：2005-01-26
申请人： Stefano Benedetto Previdi , Clarence Filsfils , Jean-Philippe Vasseur , Benoit Claise , David Ward
发明人： Stefano Benedetto Previdi , Clarence Filsfils , Jean-Philippe Vasseur , Benoit Claise , David Ward
IPC分类号： H04L12/28 , H04L12/56 , G06F15/173
CPC分类号： H04L45/02
摘要： A method of identifying an egress point to a network location in a data communications network comprising a plurality of nodes and links there between comprises the step, performed at the identifying node, of receiving a notification through the network advertising an adjacency to a network location. The method further comprises the steps, performed at the identifying node, of deriving from the notification adjacency information and identifying, from the adjacency information, the egress point.
摘要翻译：一种识别包括在其中的多个节点和链路的数据通信网络中的网络位置的出口点的方法包括：在识别节点执行的步骤，通过网络接收通知与网络位置相邻的通知。所述方法还包括在所述识别节点处执行的从所述通知邻接信息导出并从所述邻接信息识别所述出口点的步骤。

24. 发明授权

US07428213B2 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 Vasseur , Stefano B. Previdi , Clarence Filsfils , David Ward
发明人： Jean Philippe Vasseur , Stefano B. Previdi , Clarence Filsfils , David Ward
IPC分类号： H04L12/26
CPC分类号： H04L45/12 , H04B1/71635 , H04L45/02 , H04L45/18 , H04L45/22 , H04L45/28 , H04L45/46 , H04L45/48 , H04L45/50 , H04W88/06 , H04W88/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的风险链路组。

25. 发明授权

US07801048B1 Concurrent path computation using virtual shortest path tree 有权
标题翻译：使用虚拟最短路径树的并行路径计算
公开(公告)号：US07801048B1
公开(公告)日：2010-09-21
申请号：US10874660
申请日：2004-06-23
申请人： Muthurajah Sivabalan , Jean Philippe Vasseur , David Ward
发明人： Muthurajah Sivabalan , Jean Philippe Vasseur , David Ward
IPC分类号： H04L12/28 , G08C15/00
CPC分类号： H04L45/12 , H04L45/04 , H04L45/44
摘要： Parallelism is exploited to accelerate the distributed computation of an MPLS Traffic Engineering LSP across multiple Autonomous Systems or areas using a virtual shortest path tree. After relaying a path computation request, a path computation element immediately begins local path segment computations even before a response to the request is received. When a response including virtual shortest path tree information is received, the tree is extended using the previously computed path segments. Also, a path computation element can verify the local feasibility of the requested path after receiving a request so that a requesting head-end or upstream path computation element can be quickly informed that a constraints-satisfying path is not available.
摘要翻译：利用并行化来加速跨越多个自治系统或使用虚拟最短路径树的区域的MPLS流量工程LSP的分布式计算。在中继路径计算请求之后，即使在接收到对请求的响应之前，路径计算元素也立即开始本地路径段计算。当接收到包括虚拟最短路径树信息的响应时，使用先前计算的路径段来扩展树。此外，路径计算元件可以在接收到请求之后验证所请求的路径的本地可行性，使得请求的头端或上游路径计算元件可以被快速通知约束满足路径不可用。

26. 发明申请

US20060171320A1 Inter-domain path computation technique 有权
标题翻译：域间路径计算技术
公开(公告)号：US20060171320A1
公开(公告)日：2006-08-03
申请号：US11049587
申请日：2005-02-02
申请人： Jean-Philippe Vasseur , Muthurajah Sivabalan , David Ward
发明人： Jean-Philippe Vasseur , Muthurajah Sivabalan , David Ward
IPC分类号： H04J3/14 , H04L12/28
CPC分类号： H04L45/04 , H04J3/14 , H04J3/16 , H04L45/02 , H04L45/42 , H04L45/44 , H04L45/50
摘要： A technique computes 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 novel inter-domain TE-LSP computation technique comprises a computation algorithm executed by the head-end node, which utilizes Path Computation Elements (PCEs) located within the remote domains (i.e., other than the local domain). Specifically, the head-end node requests path segments from a PCE in each of the remote domains, in which the path segments represent paths between all entry border routers to either all exit border routers of the particular remote domain (i.e., through the domain), or to the tail-end node. Upon receiving path segments from each remote domain, the head-end node combines the path segments with local domain information, and performs a forward path computation from the head-end node to the tail-end node to find the best (i.e., “shortest”) path.
摘要翻译：一种技术计算跨越计算机网络的多个域的流量工程（TE）标签交换路径（LSP），从本地域的头端节点到远程域的尾端节点。新颖的域间TE-LSP计算技术包括由前端节点执行的计算算法，其利用位于远程域内的路径计算元素（PCE）（即，除本地域之外）。特别地，前端节点从每个远程域中的PCE请求路径段，其中路径段表示所有入口边界路由器之间到特定远程域的所有出口边界路由器（即，通过域）的路径，，或到尾端节点。在从每个远程域接收路径段时，前端节点将路径段与本地域信息相结合，并且执行从前端节点到尾端节点的前向路径计算，以找到最佳（即“最短” “）路径。

27. 发明申请

US20060045024A1 Mechanism to improve concurrency in execution of routing computation and routing information dissemination 有权
公开(公告)号：US20060045024A1
公开(公告)日：2006-03-02
申请号：US10928866
申请日：2004-08-27
申请人： Stefano Previdi , Clarence Filsfils , David Ward
发明人： Stefano Previdi , Clarence Filsfils , David Ward
IPC分类号： H04L12/56 , H04L12/26
CPC分类号： H04L45/56 , H04L45/02 , H04L45/12 , H04L47/24 , H04L47/6235 , H04L49/90 , H04L49/9078
摘要： A technique enables an intermediate network node to efficiently process link-state packets using a single running context (i.e., process or thread). The intermediate network node floods received link-state packets (LSP) before performing shortest path first (SPF) calculations and routing information base (RIB) updates. In addition, the node limits the number of LSPs that are permitted to be flooded before the node performs its SPF calculations. More specifically, if the number of link-state packets that are flooded during a flooding cycle exceeds a first predetermined threshold value, the node performs the SPF calculations before additional packets may be flooded. The intermediate network node also limits how long its RIB update may be delayed in favor of flooding operations. When the number of LSPs flooded after the SPF calculations exceeds a second predetermined threshold value or there are no more packets to be flooded, the node updates the contents of its RIB based on the SPF calculations.

28. 发明申请

US20050111349A1 Method and apparatus for determining network routing information based on shared risk link group information 有权
标题翻译：基于共享风险链路组信息确定网络路由信息的方法和装置
公开(公告)号：US20050111349A1
公开(公告)日：2005-05-26
申请号：US10719003
申请日：2003-11-21
申请人： Jean Vasseur , Stefano Previdi , Clarence Filsfils , David Ward
发明人： Jean Vasseur , Stefano Previdi , Clarence Filsfils , David Ward
IPC分类号： G01S13/00 , H04B20060101 , H04B1/00 , H04B1/40 , H04B1/69 , H04L5/04 , H04L12/28 , H04L12/56 , H04M1/00 , H04W88/06 , H04W88/10 , H04L12/26
CPC分类号： H04L45/12 , H04B1/71635 , H04L45/02 , H04L45/18 , H04L45/22 , H04L45/28 , H04L45/46 , H04L45/48 , H04L45/50 , H04W88/06 , H04W88/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的风险链路组。

29. 发明申请

US20090010153A1 Fast remote failure notification 有权
标题翻译：快速远程故障通知
公开(公告)号：US20090010153A1
公开(公告)日：2009-01-08
申请号：US11824885
申请日：2007-07-03
申请人： Clarence Filsfils , Stefano Previdi , David Ward
发明人： Clarence Filsfils , Stefano Previdi , David Ward
IPC分类号： H04L12/24
CPC分类号： H04L45/22 , H04L45/02 , H04L45/28 , H04L67/14 , H04L69/40
摘要： A method and system for failure notification at a remote node in communication with a local node are disclosed. The local node is configured for faster failure detection than the remote node. In one embodiment, the method includes establishing a failure monitoring session between the local node and the remote node, receiving at the remote node, a failure notification from the local node, the failure notification sent using a protocol of the failure monitoring session, and rerouting traffic at the remote node in response to the failure notification.
摘要翻译：公开了一种在与本地节点通信的远程节点处的故障通知的方法和系统。本地节点配置为比远程节点更快的故障检测。在一个实施例中，该方法包括在本地节点和远程节点之间建立故障监视会话，在远程节点接收来自本地节点的故障通知，使用故障监视会话的协议发送的故障通知和重新路由响应故障通知在远程节点的流量。

30. 发明申请

US20070091795A1 Method of constructing a backup path in an autonomous system 有权
标题翻译：在自治系统中构建备份路径的方法
公开(公告)号：US20070091795A1
公开(公告)日：2007-04-26
申请号：US11254587
申请日：2005-10-20
申请人： Olivier Bonaventure , Pierre Francois , Clarence Filsfils , Stewart Bryant , David Ward , John Scudder , Stefano Previdi , Ian Shand , Gargi Nalawade
发明人： Olivier Bonaventure , Pierre Francois , Clarence Filsfils , Stewart Bryant , David Ward , John Scudder , Stefano Previdi , Ian Shand , Gargi Nalawade
IPC分类号： H04J3/14 , H04L12/56
CPC分类号： H04L45/22 , H04L45/04 , H04L45/28 , H04L2212/00
摘要： A method of constructing a backup path in an autonomous system (AS) for failure of an inter-AS link is described. The method comprises identifying an alternate inter-AS path and constructing a tunnel to an end point on the alternate path.
摘要翻译：描述了在自治系统（AS）中构建用于AS间链路故障的备用路径的方法。该方法包括识别替代的AS间路径并构建到备用路径上的终点的隧道。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式