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

21. 发明授权

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是否使用事件域）获益，并且相应地处理该请求。

22. 发明授权

US07675848B2 Dynamic forwarding adjacency 有权
标题翻译：动态转接邻接
公开(公告)号：US07675848B2
公开(公告)日：2010-03-09
申请号：US10891704
申请日：2004-07-15
申请人： Jean-Philippe Vasseur , Stefano B. Previdi , David D. Ward , Robert Goguen
发明人： Jean-Philippe Vasseur , Stefano B. Previdi , David D. Ward , Robert Goguen
IPC分类号： G01R31/08
CPC分类号： H04L45/50 , H04L45/02 , H04L45/28
摘要： A technique treats a protected forwarding adjacency (FA) as a dynamic entity in that it allows a backup tunnel associated with the FA to carry traffic for the FA, when it's primary tunnel has failed, up to a predetermined amount of time. If after the predetermined amount of time has elapsed and the FA has not recovered (e.g., the primary tunnel has not been reestablished), a network topology change is automatically triggered causing the network to converge on a new network topology. By triggering the network topology change, a path that is more optimal than the path associated with the backup tunnel may be subsequently determined to carry the traffic.
摘要翻译：一种技术将受保护的转发邻接（FA）视为动态实体，因为当主隧道发生故障时，它允许与FA相关联的备用隧道携带FA的流量，直到预定的时间量。如果经过了预定的时间量并且FA没有恢复（例如，主隧道没有被重新建立），则自动地触发网络拓扑变化，导致网络收敛在新的网络拓扑上。通过触发网络拓扑变化，可以随后确定比与备用隧道相关联的路径更优化的路径来承载流量。

23. 发明申请

US20090245259A1 FAST REROUTE (FRR) PROTECTION AT THE EDGE OF A RFC 2547 NETWORK 有权
标题翻译：快速REROUTE（FRR）保护在RFC 2547网络的边缘
公开(公告)号：US20090245259A1
公开(公告)日：2009-10-01
申请号：US12481411
申请日：2009-06-09
申请人： Clarence Filsfils , Stefano B. Previdi , John Galen Scudder , David D. Ward , Jean-Philippe Vasseur , Jim Guichard
发明人： Clarence Filsfils , Stefano B. Previdi , John Galen Scudder , David D. Ward , Jean-Philippe Vasseur , Jim Guichard
IPC分类号： H04L12/56
CPC分类号： H04L45/28 , H04L45/02 , H04L45/04 , H04L45/22 , H04L45/50
摘要： In one embodiment, an edge device in a first routing domain is configured to communicate with a second routing domain via a data link. The edge device receives a data packet containing a destination address that is reachable via the second routing domain and an indication that the data packet is a protected packet that was previously rerouted from another edge device in the first routing domain via a Multi-Protocol Label Switching (MPLS) Fast Reroute (FRR) backup path. The edge device determines if communication with the second routing domain is still available via the data link, and if so, removes the indication that the data packet is a protected packet and forwards the data packet to the second routing domain, and, if not, drops the data packet to prevent the data packet from being rerouted a second time in the first routing domain on another MPLS FRR backup path.
摘要翻译：在一个实施例中，第一路由域中的边缘设备被配置为经由数据链路与第二路由域进行通信。边缘设备接收包含经由第二路由域可到达的目的地地址的数据分组，以及指示数据分组是先前通过多协议标签交换在第一路由域中从另一边缘设备重新路由的受保护分组的指示（MPLS）快速重路由（FRR）备份路径。边缘设备确定与第二路由域的通信是否仍然通过数据链路可用，如果是，则删除数据分组是受保护分组的指示，并将数据分组转发到第二路由域，如果不是，删除数据包，以防止数据包在另一个MPLS FRR备份路径上的第一个路由域再次被重新路由。

24. 发明授权

US07551551B2 Fast reroute (FRR) protection at the edge of a RFC 2547 network 有权
标题翻译：在RFC 2547网络边缘的快速重路由（FRR）保护
公开(公告)号：US07551551B2
公开(公告)日：2009-06-23
申请号：US11010225
申请日：2004-12-10
申请人： Clarence Filsfils , Stefano B. Previdi , John Galen Scudder , David D. Ward , Jean-Philippe Vasseur , Jim Guichard
发明人： Clarence Filsfils , Stefano B. Previdi , John Galen Scudder , David D. Ward , Jean-Philippe Vasseur , Jim Guichard
IPC分类号： H04J1/16 , H04J3/14 , H04L1/00 , H04L12/26
CPC分类号： H04L45/28 , H04L45/02 , H04L45/04 , H04L45/22 , H04L45/50
摘要： A fast reroute (FRR) technique that may be deployed at the edge of a network having first and second edge devices coupled to a neighboring routing domain. If the first edge device detects a node or link failure that prevents it from communicating with the neighboring domain, the first edge device reroutes at least some data packets addressed to the neighboring domain to the second edge device. The second edge device receives the rerouted packets and then forwards the packets to the neighboring domain. Notably, the second edge device is not permitted to reroute the received packets a second time, e.g., upon identifying another inter-domain node or link failure. As such, loops are avoided at the edge of the network and packets are rerouted to the neighboring routing domain faster and more efficiently than in prior implementations.
摘要翻译：可以部署在具有耦合到相邻路由域的第一和第二边缘设备的网络边缘的快速重路由（FRR）技术。如果第一边缘设备检测到阻止其与相邻域通信的节点或链路故障，则第一边缘设备将寻址到相邻域的至少一些数据分组路由到第二边缘设备。第二边缘设备接收重新路由的报文，然后将报文转发给邻近的域。值得注意的是，第二边缘设备不允许第二次重新路由所接收的分组，例如在识别出另一个域间节点或链路故障时。因此，在网络的边缘避免了循环，并且与先前的实现相比，分组被更快地和更有效地重新路由到相邻路由域。

25. 发明申请

US20070208874A1 Technique for optimized routing of data streams on an IP backbone in a computer network 有权
标题翻译：用于在计算机网络中的IP骨干网上优化数据流路由的技术
公开(公告)号：US20070208874A1
公开(公告)日：2007-09-06
申请号：US11449162
申请日：2006-06-08
申请人： Stefano B. Previdi , David D. Ward
发明人： Stefano B. Previdi , David D. Ward
IPC分类号： G06F15/173
CPC分类号： H04L45/70 , H04L67/1002 , H04L67/1008 , H04L67/101 , H04L67/2814 , H04L67/32
摘要： A technique optimizes routing of application data streams on an Internet Protocol (IP) backbone in a computer network. According to the novel technique, a client router learns of server states (e.g., number of pending requests, etc.) of a plurality of application servers and also determines metrics of intermediate links between the application servers and the client router (intermediate link metrics), e.g., particularly link metrics in a direction from the application servers to the client router. Upon receiving an application request from an application client (“client request”), the client router determines to which of the application servers the client request is to be sent based on the server states and intermediate link metrics, and sends the client request accordingly.
摘要翻译：一种技术优化了计算机网络中的因特网协议（IP）骨干网上的应用数据流的路由。根据新技术，客户端路由器学习多个应用服务器的服务器状态（例如，等待请求的数量等），并且还确定应用服务器与客户端路由器之间的中间链路的度量（中间链路度量），例如，特别是从应用服务器到客户端路由器的方向上的链路度量。在从应用客户端（“客户端请求”）接收到应用请求时，客户端路由器根据服务器状态和中间链路度量确定哪个应用服务器要发送客户端请求，并相应地发送客户端请求。

26. 发明授权

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）的路径。

27. 发明授权

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

28. 发明授权

US08068411B2 Method and apparatus to compute local repair paths taking into account link resources and attributes 有权
标题翻译：考虑链路资源和属性来计算局部修复路径的方法和装置
公开(公告)号：US08068411B2
公开(公告)日：2011-11-29
申请号：US11025179
申请日：2004-12-29
申请人： Jean-Philippe Vasseur , Stefano B. Previdi , David D. Ward
发明人： Jean-Philippe Vasseur , Stefano B. Previdi , David D. Ward
IPC分类号： H04J1/16 , H04L1/00
CPC分类号： H04L45/28 , H04J3/14 , H04L45/02
摘要： A technique for calculating local repair paths through a computer network using one or more dynamically measured parameters in place of, or in addition to, statically assigned cost metrics. The dynamically measured parameters include various statistical measures of resources and attributes associated with data links and/or network nodes in the computer network. In operation, an intermediate node monitors a set of local link and/or node parameters. The node may generate an advertisement in response to at least one of its monitored parameters crossing a predetermined threshold value or changing value by a predetermined percentage or amount. The advertisement is “flooded” so as to advertise the dynamically measured parameter value to other neighboring intermediate nodes. After receiving the advertisement, each node may recalculate one or more local repair paths based on the advertised parameter value. The node may utilize a recalculated repair path if it provides an appreciably lower-cost path, e.g., by a predetermined percentage, as compared with the currently deployed repair path.
摘要翻译：一种用于通过使用一个或多个动态测量参数来代替静态分配的成本度量来计算通过计算机网络的局部修复路径的技术。动态测量的参数包括与计算机网络中的数据链路和/或网络节点相关联的资源和属性的各种统计测量。在运行中，中间节点监视一组本地链路和/或节点参数。该节点可以响应于其所监视的参数中的至少一个与预定阈值相交或者以预定百分比或数量改变值来生成广告。广告被“淹没”，以便将动态测量的参数值通告给其他相邻的中间节点。在接收到广告之后，每个节点可以基于所通告的参数值重新计算一个或多个本地修复路径。如果节点可以使用重新计算的修复路径，如果其与当前部署的修复路径相比提供了明显较低成本的路径，例如，以预定百分比。

29. 发明授权

US07558214B2 Mechanism to improve concurrency in execution of routing computation and routing information dissemination 有权
标题翻译：提高路由计算和路由信息传播执行中并发性的机制
公开(公告)号：US07558214B2
公开(公告)日：2009-07-07
申请号：US10928866
申请日：2004-08-27
申请人： Stefano B. Previdi , Clarence Filsfils , David D. Ward
发明人： Stefano B. Previdi , Clarence Filsfils , David D. Ward
IPC分类号： H04L12/28
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.
摘要翻译：一种技术使得中间网络节点能够使用单个运行的上下文（即，进程或线程）有效地处理链路状态分组。在执行最短路径优先（SPF）计算和路由信息库（RIB）更新之前，中间网络节点会洪泛接收链路状态分组（LSP）。此外，节点限制在节点执行其SPF计算之前允许被泛洪的LSP的数量。更具体地，如果在洪泛周期期间被洪泛的链路状态分组的数量超过第一预定阈值，则节点在附加分组可能被淹没之前执行SPF计算。中间网络节点还限制其RIB更新可能延迟多长时间，有利于洪水操作。当在SPF计算之后淹没的LSP的数量超过第二预定阈值或者没有更多的数据包被淹没时，节点基于SPF计算来更新其RIB的内容。

30. 发明授权

US07457248B1 Graceful shutdown of network resources in data networks 有权
标题翻译：数据网络中网络资源的正常关闭
公开(公告)号：US07457248B1
公开(公告)日：2008-11-25
申请号：US10775855
申请日：2004-02-10
申请人： Zafar Ali , Anca Zamfir , David D. Ward , Stefano B. Previdi , Jean-Philippe Vasseur , Peter Psenak
发明人： Zafar Ali , Anca Zamfir , David D. Ward , Stefano B. Previdi , Jean-Philippe Vasseur , Peter Psenak
IPC分类号： G01R31/08
CPC分类号： H04L43/0811 , H04L41/0681 , H04W48/08
摘要： A technique gracefully shuts down network resources, such as nodes, interfaces and protocols, in a data network in a manner that minimizes network disruption. The technique may be used with both connectionless and connection-oriented networking systems. A node gracefully shuts down a network resource associated with the node by i) notifying other nodes in the network that the resource is being gracefully shutdown, ii) waiting for a condition to occur, and iii) when the condition occurs, shutting down the resource. The condition may include the expiration of a predetermined amount of time and/or monitoring the resource to determine if the resource has reached a certain level of activity. In response to receiving a notification that a resource is being gracefully shutdown, a node takes action to reroute traffic around the resource. If no alternative route is available, the node may continue to route traffic to the resource until it is shut down.
摘要翻译：一种技术以最小化网络中断的方式，在数据网络中正常地关闭网络资源，如节点，接口和协议。该技术可以与无连接和面向连接的网络系统一起使用。一个节点通过i）通知网络中的其他节点资源被正常地关闭，从而正常地关闭与该节点相关联的网络资源，ii）等待状况发生，以及iii）当该情况发生时，关闭该资源。条件可以包括预定时间量的到期和/或监视资源以确定资源是否已经达到一定的活动水平。响应收到资源正常关闭的通知，节点将采取行动重新路由资源周围的流量。如果没有替代路由可用，节点可以继续将流量路由到资源，直到其被关闭。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式