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

21. 发明申请

US20060262772A1 System and methods for providing a network path verification protocol 审中-公开
标题翻译：提供网络路径验证协议的系统和方法
公开(公告)号：US20060262772A1
公开(公告)日：2006-11-23
申请号：US11135253
申请日：2005-05-23
申请人： James Guichard , Jean-Philippe Vasseur , Thomas Nadeau , David Ward , Stefano Previdi
发明人： James Guichard , Jean-Philippe Vasseur , Thomas Nadeau , David Ward , Stefano Previdi
IPC分类号： H04L12/28
CPC分类号： H04L45/308 , H04L43/0811 , H04L43/12 , H04L45/04 , H04L45/302 , H04L45/70 , H04L47/24 , H04L63/029
摘要： A path verification protocol (PVP) which enumerates a series of messages sent to a set of nodes, or routers, along a network path identifies connectivity and transmission characteristic attributes by defining, implementing, and analyzing path verification messages (PVMs) in a VPN environment. Typical VPN environments are characterized by service level agreements (SLAs) between service providers which specify particular service level and/or bandwidth level guarantees, typically in terms of megabits per second (MB/s) or other qualitative transfer criteria. Such guarantees are often expressed in contractual terms as Quality of Service (QoS) criteria. Configurations herein provide a mechanism for determination of paths and/or routes that satisfy a QoS or other delivery speed/bandwidth guarantee. Such a mechanism may therefore be employed to perform routing decisions for QoS based traffic. Further, such a mechanism is employable to verify QoS levels and related attributes related to contractual terms between service providers and customers.
摘要翻译：路径验证协议（PVP），其列举沿着网络路径发送到一组节点或路由器的一系列消息，通过在VPN环境中定义，实现和分析路径验证消息（PVM）来识别连接性和传输特性属性。典型的VPN环境的特征在于服务提供商之间的服务级别协议（SLA），其指定特定服务级别和/或带宽级别保证，通常以兆比特每秒（MB / s）或其他定性传输标准。这种保证通常以合同条款表示为服务质量（QoS）标准。本文中的配置提供了用于确定满足QoS或其他传送速度/带宽保证的路径和/或路由的机制。因此可以采用这种机制来执行基于QoS的业务的路由决策。此外，这种机制可用于验证与服务提供商和客户之间的合同条款相关的QoS等级和相关属性。

22. 发明授权

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）来服务路径计算请求。

23. 发明授权

US07684351B2 Inter-domain optimization trigger in PCE-based environment 有权
标题翻译：基于PCE的环境中的域间优化触发
公开(公告)号：US07684351B2
公开(公告)日：2010-03-23
申请号：US11052280
申请日：2005-02-07
申请人： Jean-Philippe Vasseur , David D. Ward , Muthurajah Sivabalan , Stefano B. Previdi
发明人： Jean-Philippe Vasseur , David D. Ward , Muthurajah Sivabalan , Stefano B. Previdi
IPC分类号： H04L12/28
CPC分类号： H04L45/42 , H04L45/02 , H04L45/04 , H04L45/32 , H04L45/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是否使用事件域）获益，并且相应地处理该请求。

24. 发明授权

US08717899B2 System and method for reporting out-of-resources (OOR) conditions in a data network 有权
标题翻译：在数据网络中报告资源不足（OOR）条件的系统和方法
公开(公告)号：US08717899B2
公开(公告)日：2014-05-06
申请号：US10964184
申请日：2004-10-13
申请人： Sami Boutros , Muthurajah Sivabalan , David D. Ward , Stefano B. Previdi , Jean-Philippe Vasseur , Rodolphe Figaro , Reshad A. Rahman
发明人： Sami Boutros , Muthurajah Sivabalan , David D. Ward , Stefano B. Previdi , Jean-Philippe Vasseur , Rodolphe Figaro , Reshad A. Rahman
IPC分类号： H04L12/26 , H04L12/56
CPC分类号： H04L47/125 , H04L41/06 , H04L45/00 , H04L45/50 , H04L47/2408 , H04L47/745
摘要： A system and method for advertising out-of-resources (OOR) conditions for entities, such as nodes, line cards and data links, in a manner that does not involve using a maximum cost to indicate the entity is “out-of-resources.” According to the technique, an OOR condition for an entity is advertised in one or more type-length-value (TLV) objects contained in an advertisement message. The advertisement message is flooded to nodes on a data network to inform them of the entity's OOR condition. Head-end nodes that process the advertisement message may use information contained in the TLV object to determine a path for a new label switched path (LSP) that does not include the entity associated with the OOR condition.
摘要翻译：用于以不涉及使用最大成本来指示实体的方式向诸如节点，线路卡和数据链路的实体（例如节点，线路卡和数据链路）广告外部资源（OOR）条件的系统和方法是“超出资源。“根据该技术，实体的OOR条件在广告消息中包含的一个或多个类型长度值（TLV）对象中通告。广告消息被洪泛到数据网络上的节点，以通知他们实体的OOR条件。处理广告消息的头端节点可以使用包含在TLV对象中的信息来确定不包括与OOR条件相关联的实体的新标签交换路径（LSP）的路径。

25. 发明授权

US08320255B2 Inter-domain path computation technique 有权
标题翻译：域间路径计算技术
公开(公告)号：US08320255B2
公开(公告)日：2012-11-27
申请号：US11049587
申请日：2005-02-02
申请人： Jean-Philippe Vasseur , Muthurajah Sivabalan , David D. Ward
发明人： Jean-Philippe Vasseur , Muthurajah Sivabalan , David D. Ward
IPC分类号： G01R31/08
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请求路径段，其中路径段表示所有入口边界路由器之间到特定远程域的所有出口边界路由器（即，通过域）的路径，，或到尾端节点。在从每个远程域接收到路径段时，前端节点将路径段与本地域信息相结合，并且执行从前端节点到尾端节点的前向路径计算，以找到最佳（即最短）路径。

26. 发明授权

US09197508B2 Time-based scheduling for tunnels computed by a stateful path computation element 有权
标题翻译：由状态路径计算元素计算的隧道的基于时间的调度
公开(公告)号：US09197508B2
公开(公告)日：2015-11-24
申请号：US13524751
申请日：2012-06-15
申请人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils , George Swallow
发明人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils , George Swallow
IPC分类号： H04L12/24 , H04L12/26 , H04L12/911
CPC分类号： H04L41/0896 , H04L41/147 , H04L47/823 , H04L47/825 , H04L47/826
摘要： In one embodiment, a path computation element (PCE) in a computer network receives one or more path computation requests (PCReqs), and records a time of each PCReq and the corresponding requested bandwidth. Based on this information, the PCE may determine a traffic profile of the computer network, and may augment a traffic engineering database (TED) with requested bandwidth according to time based on the traffic profile. As such, prior to a particular time, the PCE may determine placement of tunnels within the traffic profile for the particular time.
摘要翻译：在一个实施例中，计算机网络中的路径计算元件（PCE）接收一个或多个路径计算请求（PCReq），并记录每个PCReq的时间和相应的请求带宽。基于该信息，PCE可以确定计算机网络的流量简档，并且可以基于流量简档来根据时间来增加具有所请求带宽的流量工程数据库（TED）。因此，在特定时间之前，PCE可以在特定时间内确定隧道在业务简档内的布置。

27. 发明授权

US08817591B2 Inter-domain signaling to update remote path computation elements after a call set-up failure 有权
标题翻译：呼叫建立失败后更新远程路径计算元素的域间信令
公开(公告)号：US08817591B2
公开(公告)日：2014-08-26
申请号：US13524168
申请日：2012-06-15
申请人： Jean-Philippe Vasseur , Stefano Previdi
发明人： Jean-Philippe Vasseur , Stefano Previdi
IPC分类号： H04L1/00 , H04L12/26
CPC分类号： H04L41/12 , H04L45/04 , H04L45/22 , H04L45/28 , H04L45/50 , H04L47/724 , H04L47/785 , H04L47/825
摘要： In one embodiment, a router in a non-originating domain receives a signal to establish a tunnel, the signal having an identification (ID) of an originating path computation element (PCE) of an originating domain from where the signal to establish the tunnel originated. In response to determining that establishment of the tunnel fails, the router may signal the failure of the establishment to a local PCE of the non-originating domain, the signaling indicating the ID of the originating PCE to cause the local PCE to provide updated routing information of the non-originating domain to the originating PCE.
摘要翻译：在一个实施例中，非起始域中的路由器接收建立隧道的信号，该信号具有始发域的始发路径计算元件（PCE）的标识（ID），其中建立隧道的信号源自。响应于确定隧道的建立失败，路由器可以将建立的失败信号发送到非始发域的本地PCE，该信令指示发起PCE的ID，以使本地PCE提供更新的路由信息的非始发域到原始PCE。

28. 发明申请

US20130336116A1 CONGESTION-BASED NOTIFICATION DURING FAST REROUTE OPERATIONS IN STATEFUL PATH COMPUTATION ELEMENT ENVIRONMENTS 有权
标题翻译：紧急路线计算元件环境中快速REROUTE操作下的基于约束的通知
公开(公告)号：US20130336116A1
公开(公告)日：2013-12-19
申请号：US13524135
申请日：2012-06-15
申请人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils
发明人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils
IPC分类号： H04L12/56
CPC分类号： H04L45/125 , H04L45/22 , H04L45/28 , H04L47/11 , H04L47/825
摘要： In one embodiment, once activation of use of a backup tunnel is detected for a primary tunnel, then a level of congestion of the path of the backup tunnel may be determined. In response to the level being greater than a threshold, a head-end node of the primary tunnel is triggered to reroute the primary tunnel (e.g., requesting to a path computation element). Conversely, in response to the level not being greater than the threshold, the backup tunnel is allowed to remain activated.
摘要翻译：在一个实施例中，一旦检测到主隧道的备用隧道的使用的激活，则可以确定备用隧道的路径的拥塞级别。响应于该级别大于阈值，主隧道的前端节点被触发以重新路由主隧道（例如，请求到路径计算元件）。相反，响应级别不大于阈值，允许备份隧道保持激活。

29. 发明申请

US20070047469A1 Efficient constrained shortest path first optimization technique 有权
标题翻译：有效约束最短路径优化技术
公开(公告)号：US20070047469A1
公开(公告)日：2007-03-01
申请号：US11210910
申请日：2005-08-24
申请人： Jean-Philippe Vasseur , Stefano Previdi
发明人： Jean-Philippe Vasseur , Stefano Previdi
IPC分类号： H04L12/28
CPC分类号： H04L45/12 , H04L45/02 , H04L45/028 , H04L45/28 , H04L45/302 , H04L45/50
摘要： A technique performs an efficient constrained shortest path first (CSPF) optimization of Traffic Engineering (TE) Label Switched Paths (LSPs) in a computer network. The novel CSPF technique is triggered upon the detection of an event in the computer network that could create a more optimal path, such as, e.g., a new or restored network element or increased path resources. Once the novel CSPF technique is triggered, the computing node (e.g., a head-end node of the TE-LSP or a Path Computation Element, PCE) determines the set of nodes adjacent to the event, and further determines which of those adjacent nodes are within the TE-LSP (“attached nodes”). The computing node performs a CSPF computation rooted at the closest attached node to determine whether a new computed path cost is less than a current path cost (e.g., by a configurable amount), and if so, triggers optimization of the TE-LSP along the new path.
摘要翻译：一种技术在计算机网络中执行流量工程（TE）标签交换路径（LSP）的有效约束最短路径优先（CSPF）优化。检测到计算机网络中可能产生更为优化的路径（例如，新的或恢复的网络元件或增加的路径资源）的事件触发了新的CSPF技术。一旦新颖的CSPF技术被触发，计算节点（例如，TE-LSP的头端节点或路径计算元件PCE）确定与事件相邻的节点集合，并进一步确定那些相邻节点中的哪一个在TE-LSP（“附属节点”）内。计算节点执行根据最接近的附加节点的CSPF计算，以确定新的计算路径开销是否小于当前路径开销（例如，通过可配置的量），如果是，则触发TE-LSP沿着新途径

30. 发明申请

US20060164975A1 Loop prevention technique for MPLS using two labels 有权
公开(公告)号：US20060164975A1
公开(公告)日：2006-07-27
申请号：US11046163
申请日：2005-01-26
申请人： Clarence Filsfils , Jim Guichard , Jean-Philippe Vasseur , Stefano Previdi , Robert Raszuk
发明人： Clarence Filsfils , Jim Guichard , Jean-Philippe Vasseur , Stefano Previdi , Robert Raszuk
IPC分类号： H04L12/28 , G08C15/00
CPC分类号： H04L45/00 , H04L45/18 , H04L45/22 , H04L45/28 , H04L45/50 , H04W12/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.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式