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

1. 发明申请

US20060039391A1 Computing inter-autonomous system MPLS traffic engineering LSP paths 有权
公开(公告)号：US20060039391A1
公开(公告)日：2006-02-23
申请号：US10767574
申请日：2004-01-29
申请人： Jean Vasseur , Muthurajah Sivabalan , Anca Zamfir , Carol Iturralde
发明人： Jean Vasseur , Muthurajah Sivabalan , Anca Zamfir , Carol Iturralde
IPC分类号： H04L12/56
CPC分类号： H04L45/48 , H04L45/04 , H04L45/124 , H04L45/50
摘要： Systems and methods for computing the paths of MPLS Traffic Engineering LSPs across Autonomous System and/or area boundaries. A distributed path computation algorithm exploits multiple path computation elements (PCEs) to develop a virtual shortest path tree (VSPT) resulting in computation of an end-to-end optimal (shortest) path. In some implementations, the VSPT is computed recursively across all the Autonomous Systems and/or areas between the head-end and tail-end of the Traffic Engineering LSP.

2. 发明授权

US07599349B2 Computing inter-autonomous system MPLS traffic engineering LSP paths 有权
标题翻译：计算自治系统MPLS流量工程LSP路径
公开(公告)号：US07599349B2
公开(公告)日：2009-10-06
申请号：US10767574
申请日：2004-01-29
申请人： Jean Philippe Vasseur , Muthurajah Sivabalan , Anca Zamfir , Carol Iturralde
发明人： Jean Philippe Vasseur , Muthurajah Sivabalan , Anca Zamfir , Carol Iturralde
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L45/48 , H04L45/04 , H04L45/124 , H04L45/50
摘要： Systems and methods for computing the paths of MPLS Traffic Engineering LSPs across Autonomous System and/or area boundaries. A distributed path computation algorithm exploits multiple path computation elements (PCEs) to develop a virtual shortest path tree (VSPT) resulting in computation of an end-to-end optimal (shortest) path. In some implementations, the VSPT is computed recursively across all the Autonomous Systems and/or areas between the head-end and tail-end of the Traffic Engineering LSP.
摘要翻译：用于计算跨自治系统和/或区域边界的MPLS流量工程LSP路径的系统和方法。分布式路径计算算法利用多路径计算元素（PCE）开发虚拟最短路径树（VSPT），导致端对端最优（最短）路径的计算。在一些实现中，VSPT被递归地跨越所有自治系统和/或交通工程LSP的前端和尾端之间的区域计算。

3. 发明申请

US20050117512A1 Soft preemption feedback 有权
标题翻译：软抢占反馈
公开(公告)号：US20050117512A1
公开(公告)日：2005-06-02
申请号：US10725606
申请日：2003-12-02
申请人： Jean Vasseur , Ramesh Uppili , Carol Iturralde , Muthurajah Sivabalan
发明人： Jean Vasseur , Ramesh Uppili , Carol Iturralde , Muthurajah Sivabalan
IPC分类号： H04L12/26 , H04L12/56 , H04L29/06
CPC分类号： H04L45/00 , H04L29/06 , H04L45/50 , H04L47/10 , H04L47/2433 , H04L47/245 , H04L47/70 , H04L47/74 , H04L47/765 , H04L47/805 , H04L47/824 , H04L47/825 , H04L47/826 , H04L69/28
摘要： Systems and methods for preemption of Traffic Engineering LSPs such that preemption decisions are made in a coordinated fashion along the path of a new LSP and computation of a new path for a preempted LSP can take advantage of knowledge of newly unavailable links. The efficiency of the preemption mechanism is greatly increased and the undesirable effects of heterogeneous preemption decisions are limited. The amount of signaling may also be significantly reduced. In one implementation, these advantages are achieved by exploiting an upstream preemption feedback mechanism that uses an incremental timer to delay preemption decisions until feedback is available.
摘要翻译：流量工程LSP抢占的系统和方法，使得沿着新LSP的路径以协调的方式进行抢占决策，并为抢占的LSP计算新的路径，可以利用新的不可用链路的知识。抢占机制的效率大大提高，异质抢占决策的不良影响有限。信号量也可以显着降低。在一个实现中，这些优点通过利用上游抢占反馈机制来实现，该机制使用增量定时器来延迟抢占决定，直到反馈可用。

4. 发明授权

US07359386B2 Soft preemption feedback 有权
标题翻译：软抢占反馈
公开(公告)号：US07359386B2
公开(公告)日：2008-04-15
申请号：US10725606
申请日：2003-12-02
申请人： Jean Philippe Vasseur , Ramesh Uppili , Carol Iturralde , Muthurajah Sivabalan
发明人： Jean Philippe Vasseur , Ramesh Uppili , Carol Iturralde , Muthurajah Sivabalan
IPC分类号： H04L12/28 , H04L12/54
CPC分类号： H04L45/00 , H04L29/06 , H04L45/50 , H04L47/10 , H04L47/2433 , H04L47/245 , H04L47/70 , H04L47/74 , H04L47/765 , H04L47/805 , H04L47/824 , H04L47/825 , H04L47/826 , H04L69/28
摘要： Systems and methods for preemption of Traffic Engineering LSPs such that preemption decisions are made in a coordinated fashion along the path of a new LSP and computation of a new path for a preempted LSP can take advantage of knowledge of newly unavailable links. The efficiency of the preemption mechanism is greatly increased and the undesirable effects of heterogeneous preemption decisions are limited. The amount of signaling may also be significantly reduced. In one implementation, these advantages are achieved by exploiting an upstream preemption feedback mechanism that uses an incremental timer to delay preemption decisions until feedback is available.
摘要翻译：流量工程LSP抢占的系统和方法，使得沿着新LSP的路径以协调的方式进行抢占决策，并为抢占的LSP计算新的路径，可以利用新的不可用链路的知识。抢占机制的效率大大提高，异质抢占决策的不良影响有限。信号量也可以显着降低。在一个实现中，这些优点通过利用上游抢占反馈机制来实现，该机制使用增量定时器来延迟抢占决定，直到反馈可用。

5. 发明申请

US20050259664A1 Reoptimization triggering by path computation elements 有权
标题翻译：路径计算元素的优化触发
公开(公告)号：US20050259664A1
公开(公告)日：2005-11-24
申请号：US10848744
申请日：2004-05-19
申请人： Jean Vasseur , David Ward , Muthurajah Sivabalan , Robert Goguen
发明人： Jean Vasseur , David Ward , Muthurajah Sivabalan , Robert Goguen
IPC分类号： H04J1/16 , H04L12/56
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来响应路由通知，允许路径计算元素减轻带宽分段的机会。

6. 发明申请

US20050083928A1 Transparent re-routing of MPLS traffic engineering LSPs within a link bundle 有权
标题翻译：链路束内MPLS流量工程LSP的透明重路由
公开(公告)号：US20050083928A1
公开(公告)日：2005-04-21
申请号：US10689385
申请日：2003-10-20
申请人： Muthurajah Sivabalan , Rakesh Gandhi , Sami Boutros , Jean Vasseur
发明人： Muthurajah Sivabalan , Rakesh Gandhi , Sami Boutros , Jean Vasseur
IPC分类号： H04L12/56
CPC分类号： H04L45/245 , H04L45/00 , H04L45/22 , H04L45/28 , H04L45/50 , Y02D50/30
摘要： Local rerouting around a failed component link of a link bundle is provided by immediately substituting one or more other component links of the same link bundle. The substitution of component links is performed at the point of failure without signaling to other nodes. This minimizes signaling traffic particularly when large numbers of LSPs are impacted by a single component link failure. Also, since LSP repair can be accomplished very quickly, traffic disruption is minimized.
摘要翻译：通过立即替换相同链路束的一个或多个其他组件链路来提供围绕链路束的故障组件链路的本地重新路由。组件链路的替换在故障点执行，而不向其他节点发信号。这特别是当大量的LSP受到单个组件链路故障的影响时，信令流量最小化。此外，由于可以非常快速地完成LSP修复，所以流量中断被最小化。

7. 发明申请

US20150304185A1 Operations Analysis of Packet Groups Identified based on Timestamps 有权
标题翻译：基于时间戳识别的数据包组的操作分析
公开(公告)号：US20150304185A1
公开(公告)日：2015-10-22
申请号：US14256185
申请日：2014-04-18
申请人： Daniel C. Frost , Stewart Frederick Bryant , Muthurajah Sivabalan , Simon James Trevor Spraggs
发明人： Daniel C. Frost , Stewart Frederick Bryant , Muthurajah Sivabalan , Simon James Trevor Spraggs
IPC分类号： H04L12/26 , H04L12/24
CPC分类号： H04L43/106 , H04L43/0829 , H04L43/0852
摘要： In one embodiment, operations analysis of packet groups identified based on timestamps is performed. One embodiment includes sending a plurality of sent timeframe groups of a plurality of time-stamped packets from a first packet network node towards a second packet network node in a network and recording first information associated with each of the plurality of said sent timeframe groups of the plurality of time-stamped packets. The second network node receives a plurality of received timeframe groups of a received plurality of time-stamped packets of said sent plurality of time-stamped packets and recording second information associated with each of the plurality of said received timeframe groups of the received plurality of time-stamped packets. Operations analysis based on one or more operations characteristics of said first information and said second information to produce analysis results.
摘要翻译：在一个实施例中，执行基于时间戳识别的分组组的操作分析。一个实施例包括将多个时间戳分组的多个发送时间帧组从第一分组网络节点发送到网络中的第二分组网络节点，并且记录与多个所述发送的时间帧组中的每一个相关联的第一信息多个时间戳的数据包。所述第二网络节点接收所接收的所述多个时间戳分组的接收到的多个时间戳分组的多个接收到的时间帧组，并且记录与所接收的多个时间帧中的多个所述接收到的时间帧组中的每一个相关联的第二信息被阻塞的数据包。基于所述第一信息和所述第二信息的一个或多个操作特征的操作分析以产生分析结果。

8. 发明授权

US08131873B2 Technique for selecting a path computation element 有权
标题翻译：选择路径计算元素的技术
公开(公告)号：US08131873B2
公开(公告)日：2012-03-06
申请号：US10983280
申请日：2004-11-05
申请人： Jean-Philippe Vasseur , David D. Ward , Muthurajah Sivabalan , Stefano B. Previdi
发明人： Jean-Philippe Vasseur , David D. Ward , Muthurajah Sivabalan , Stefano B. Previdi
IPC分类号： G06F15/173
CPC分类号： H04L45/42 , H04L45/04 , H04L45/12 , H04L45/127 , H04L45/44 , H04L45/58
摘要： A technique efficiently selects a Path Computation Element (PCE) to compute a path between nodes of a computer network. The PCE selection technique is illustratively based on dynamic advertisements of the PCE's available path computation resources, using (i) a low-pass filter algorithm to compute such resources, and (ii) threshold determinations to control distribution of those advertisements. To that end, the novel technique enables one or more PCEs to dynamically send (advertise) their available path computation resources to a Path Computation Client (PCC) by way of the controlled advertisements. In addition, the technique enables the PCC to efficiently select a PCE (or set of PCEs) to service a path computation request based upon those available resources.
摘要翻译：一种技术有效地选择路径计算元素（PCE）来计算计算机网络的节点之间的路径。 PCE选择技术说明性地基于PCE可用路径计算资源的动态广告，使用（i）低通滤波器算法来计算这样的资源，以及（ii）阈值确定以控制这些广告的分布。为此，新技术使得一个或多个PCE能够通过受控广告动态地向路径计算客户端（PCC）发送（通告）它们的可用路径计算资源。此外，该技术使得PCC能够基于这些可用资源有效地选择PCE（或一组PCE）来服务路径计算请求。

9. 发明申请

US20110280121A1 SYSTEM AND METHOD FOR SUMMARIZING ALARM INDICATIONS IN A NETWORK ENVIRONMENT 有权
标题翻译：在网络环境中总结报警指示的系统和方法
公开(公告)号：US20110280121A1
公开(公告)日：2011-11-17
申请号：US12778871
申请日：2010-05-12
申请人： Sami Boutros , Nagi Reddy Jonnala , Muthurajah Sivabalan , George Swallow , David D. Ward
发明人： Sami Boutros , Nagi Reddy Jonnala , Muthurajah Sivabalan , George Swallow , David D. Ward
IPC分类号： H04L12/24 , H04L12/26
CPC分类号： H04L41/0677
摘要： An example method includes detecting a failure at a first network element, the failure is associated with a link between the first network element and a second network element. The method also includes generating a list of network elements to be notified based on the failure, the second network element is included on the list. The method further includes generating an alarm indication signal (AIS) message, the AIS message identifies a plurality of tunnels affected by the failure. The AIS message is communicated to the second network element. In more detailed embodiments, each link between the first network element and the second network element includes a globally unique link identifier, which includes an associated autonomous system number. The globally unique link identifier can represent a string to be associated with the plurality of tunnels, the globally unique link identifier includes a source address and a destination address.
摘要翻译：示例性方法包括检测第一网络元件的故障，故障与第一网络元件和第二网络元件之间的链路相关联。该方法还包括基于故障生成要通知的网元的列表，第二网元包括在列表中。该方法还包括生成报警指示信号（AIS）消息，AIS消息识别受故障影响的多个隧道。 AIS消息被传送到第二网元。在更详细的实施例中，第一网络元件和第二网络元件之间的每个链路包括全球唯一链接标识符，其包括相关联的自主系统号码。全球唯一的链路标识符可以表示要与多个隧道相关联的字符串，全球唯一的链路标识符包括源地址和目的地址。

10. 发明授权

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来响应路由通知，允许路径计算元素减轻带宽分段的机会。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式