-
公开(公告)号：US20060039391A1
公开(公告)日：2006-02-23
申请号：US10767574
申请日：2004-01-29
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.
-
公开(公告)号：US07599349B2
公开(公告)日：2009-10-06
申请号：US10767574
申请日：2004-01-29
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的前端和尾端之间的区域计算。
-
公开(公告)号：US20050117512A1
公开(公告)日：2005-06-02
申请号：US10725606
申请日：2003-12-02
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计算新的路径，可以利用新的不可用链路的知识。 抢占机制的效率大大提高，异质抢占决策的不良影响有限。 信号量也可以显着降低。 在一个实现中，这些优点通过利用上游抢占反馈机制来实现，该机制使用增量定时器来延迟抢占决定，直到反馈可用。
-
公开(公告)号：US07359386B2
公开(公告)日：2008-04-15
申请号：US10725606
申请日：2003-12-02
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计算新的路径，可以利用新的不可用链路的知识。 抢占机制的效率大大提高，异质抢占决策的不良影响有限。 信号量也可以显着降低。 在一个实现中，这些优点通过利用上游抢占反馈机制来实现，该机制使用增量定时器来延迟抢占决定，直到反馈可用。
-
公开(公告)号：US20060176828A1
公开(公告)日：2006-08-10
申请号：US11054145
申请日：2005-02-09
申请人： Jean Vasseur , Carol Iturralde , Robert Goguen
发明人： Jean Vasseur , Carol Iturralde , Robert Goguen
CPC分类号： H04L45/42 , H04L41/0677 , H04L43/0894 , H04L45/02 , H04L45/44 , H04L45/50
摘要： A technique triggers packing of path computation requests (PCRs) for traffic engineering (TE) label switched paths (LSPs) that are sent from one or more label-switched routers (LSRs) to a path computation element (PCE) of a computer network. According to the novel technique, incoming PCRs are packed into sets in response to a certain event, and one or more TE-LSPs (paths) are computed for each PCR of a particular set based on the PCRs of that set. Specifically, the PCE detects an event in the network (“network event”) indicating that an increase in the number of incoming PCRs has occurred, or that an increase is likely to occur due to, e.g., a change in a network element. Once the net-work event has been detected, the PCE packs the incoming PCRs into configured-length sets, such as, e.g., for a specified time interval or a certain number of PCRs. The PCE computes paths for each PCR of a particular set while considering the other PCRs of that set, thereby reducing race conditions, signaling overhead, and set-up failures.
摘要翻译： 一种技术触发了从一个或多个标签交换路由器（LSR）发送到计算机网络的路径计算元件（PCE）的流量工程（TE）标签交换路径（LSP）的路径计算请求（PCR）的打包。 根据新技术，响应于某个事件将输入的PCR打包成集合，并且基于该集合的PCR针对特定集合的每个PCR计算一个或多个TE-LSP（路径）。 具体地，PCE检测网络中的事件（“网络事件”），其指示进入的PCR的数量的增加已经发生，或者由于例如网络元件的变化而可能发生增加。 一旦检测到网络工作事件，PCE将输入的PCR打包成配置长度的集合，诸如例如指定的时间间隔或一定数量的PCR。 PCE计算特定集合的每个PCR的路径，同时考虑该集合的其他PCR，从而减少竞争条件，信令开销和建立故障。
-
公开(公告)号：US20060056291A1
公开(公告)日：2006-03-16
申请号：US10938837
申请日：2004-09-10
申请人： Frederick Baker , Bruce Davie , David Oran , Carol Iturralde , Roger Levesque , Michael DiBiasio
发明人： Frederick Baker , Bruce Davie , David Oran , Carol Iturralde , Roger Levesque , Michael DiBiasio
IPC分类号： H04L12/26
CPC分类号： H04L43/00
摘要： A technique is provided for one or more network nodes to deterministically select data flows to preempt. In particular, each node employs a set of predefined rules which instructs the node as to which existing data flow should be preempted in order to admit a new high-priority data flow. The rules are precisely defined and are common to all nodes configured in accordance with the present invention. Illustratively, a network node not only selects a data flow to preempt, but additionally may identify other “fate sharing” data flows that may be preempted. As used herein, a group of data flows has a fate-sharing relationship if the application instance(s) containing the data flows functions adequately only when all the fate-shared flows are operational. In a first illustrative embodiment, after a data flow in a fate-sharing group is preempted, network nodes may safely tear down the group's remaining data flows. In a second illustrative embodiment, when a data flow is preempted, all its fate-shared data flows are marked as being “at risk.” Because the at-risk flows are not immediately torn down, it is less likely that resources allocated for the at-risk flows may be freed then subsequently used to establish relatively lower-priority data flows instead of relatively higher-priority data flows.
摘要翻译： 为一个或多个网络节点提供一种确定性地选择要抢占的数据流的技术。 特别地，每个节点采用一组预定义的规则，其指示节点应该抢占哪个现有数据流，以便允许新的高优先级数据流。 这些规则被精确定义，并且对于根据本发明配置的所有节点是共同的。 示例性地，网络节点不仅选择要抢占的数据流，而且可以标识可被抢占的其他“命运共享”数据流。 如本文所使用的，如果包含数据流的应用实例仅在所有命运共享流可操作时才起作用，则一组数据流具有命运共享关系。 在第一说明性实施例中，在命运共享组中的数据流被抢占之后，网络节点可以安全地拆除该组的剩余数据流。 在第二个说明性实施例中，当数据流被抢占时，其所有命运共享数据流被标记为处于“处于危险之中”。 由于风险流动并没有立即被拆除，所以分配给风险流动的资源可能会被释放，随后被用于建立相对较低优先级的数据流而不是相对较高优先级的数据流。
-
公开(公告)号：US07623461B2
公开(公告)日：2009-11-24
申请号：US11054145
申请日：2005-02-09
IPC分类号： G01R31/08
CPC分类号： H04L45/42 , H04L41/0677 , H04L43/0894 , H04L45/02 , H04L45/44 , H04L45/50
摘要： A technique triggers packing of path computation requests (PCRs) for traffic engineering (TE) label switched paths (LSPs) that are sent from one or more label-switched routers (LSRs) to a path computation element (PCE) of a computer network. According to the novel technique, incoming PCRs are packed into sets in response to a certain event, and one or more TE-LSPs (paths) are computed for each PCR of a particular set based on the PCRs of that set. Specifically, the PCE detects an event in the network (“network event”) indicating that an increase in the number of incoming PCRs has occurred, or that an increase is likely to occur due to, e.g., a change in a network element. Once the network event has been detected, the PCE packs the incoming PCRs into configured-length sets, such as, e.g., for a specified time interval or a certain number of PCRs. The PCE computes paths for each PCR of a particular set while considering the other PCRs of that set, thereby reducing race conditions, signaling overhead, and set-up failures.
摘要翻译： 一种技术触发了从一个或多个标签交换路由器（LSR）发送到计算机网络的路径计算元件（PCE）的流量工程（TE）标签交换路径（LSP）的路径计算请求（PCR）的打包。 根据新技术，响应于某个事件将输入的PCR打包成集合，并且基于该集合的PCR针对特定集合的每个PCR计算一个或多个TE-LSP（路径）。 具体地，PCE检测网络中的事件（“网络事件”），其指示进入的PCR的数量的增加已经发生，或者由于例如网络元件的变化而可能发生增加。 一旦检测到网络事件，PCE将输入的PCR打包成配置长度的集合，例如，指定的时间间隔或一定数量的PCR。 PCE计算特定集合的每个PCR的路径，同时考虑该集合的其他PCR，从而减少竞争条件，信令开销和建立故障。
-
8.发明申请Technique for dynamically restoring original TE-LSP attributes for interdomain TE-LSPs 有权用于动态恢复域间TE-LSP的原始TE-LSP属性的技术公开(公告)号：US20070208871A1
公开(公告)日：2007-09-06
申请号：US11368160
申请日：2006-03-03
IPC分类号： G06F15/16
摘要： A technique dynamically restores original attributes of a Traffic Engineering La-bel Switched Path (TE-LSP) that are provided in a source domain for a destination domain when traversing one or more intermediate domains that may translate the TE-LSP attributes in a computer network. According to the novel technique, a head-end node requests an interdomain TE-LSP having one or more original TE-LSP attributes (e.g., priority, bandwidth, etc.) using a signaling exchange. The head-end node may also request restoration of the original TE-LSP attributes upon entrance into the destination domain. Intermediate domains (e.g., border routers of the domains) receiving the request may translate the original TE-LSP attributes into corresponding intermediate domain TE-LSP attributes. When the request reaches the destination domain, the intermediate domain TE-LSP attributes of the requested TE-LSP are restored into the original TE-LSP attributes.
摘要翻译： 一种技术动态地恢复在遍历可能转换计算机网络中的TE-LSP属性的一个或多个中间域时为目的地域提供的源域中提供的流量工程La-bel交换路径（TE-LSP）的原始属性 。 根据该新技术，前端节点使用信令交换请求具有一个或多个原始TE-LSP属性（例如，优先级，带宽等）的域间TE-LSP。 前端节点还可以在进入目的地域时请求恢复原始TE-LSP属性。 接收请求的中间域（例如，域的边界路由器）可以将原始TE-LSP属性转换为相应的中间域TE-LSP属性。 当请求到达目的域时，请求的TE-LSP的中间域TE-LSP属性恢复为原始TE-LSP属性。
-
9.发明授权公开(公告)号：US07986618B2
公开(公告)日：2011-07-26
申请号：US10171395
申请日：2002-06-12
IPC分类号： G01R31/08
摘要： Systems and methods for distinguishing a node failure from a link failure are provided. By strengthening the assumption of independent failures, bandwidth sharing among backup tunnels protecting links and nodes of a network is facilitated as well as distributed computation of backup tunnel placement. Thus a backup tunnel overlay network can provide guaranteed bandwidth in the event of a failure.
摘要翻译： 提供了用于区分节点故障与链路故障的系统和方法。 通过加强独立故障的假设，便于保护网络链路和节点的备份隧道之间的带宽共享，以及备份隧道布局的分布式计算。 因此，备份隧道覆盖网络可以在发生故障时提供有保证的带宽。
-
公开(公告)号：US07953000B2
公开(公告)日：2011-05-31
申请号：US10938837
申请日：2004-09-10
申请人： Frederick Baker , Bruce S. Davie , David R. Oran , Carol Iturralde , Roger Levesque , Michael V. DiBiasio
发明人： Frederick Baker , Bruce S. Davie , David R. Oran , Carol Iturralde , Roger Levesque , Michael V. DiBiasio
IPC分类号： H04L12/28
CPC分类号： H04L43/00
摘要： A technique is provided for one or more network nodes to deterministically select data flows to preempt. In particular, each node employs a set of predefined rules which instructs the node as to which existing data flow should be preempted in order to admit a new high-priority data flow. The rules are precisely defined and are common to all nodes configured in accordance with the present invention. Illustratively, a network node not only selects a data flow to preempt, but additionally may identify other “fate sharing” data flows that may be preempted. As used herein, a group of data flows has a fate-sharing relationship if the application instance(s) containing the data flows functions adequately only when all the fate-shared flows are operational. In a first illustrative embodiment, after a data flow in a fate-sharing group is preempted, network nodes may safely tear down the group's remaining data flows. In a second illustrative embodiment, when a data flow is preempted, all its fate-shared data flows are marked as being “at risk.” Because the at-risk flows are not immediately torn down, it is less likely that resources allocated for the at-risk flows may be freed then subsequently used to establish relatively lower-priority data flows instead of relatively higher-priority data flows.
摘要翻译： 为一个或多个网络节点提供一种确定性地选择要抢占的数据流的技术。 特别地，每个节点采用一组预定义的规则，其指示节点应该抢占哪个现有数据流，以便允许新的高优先级数据流。 这些规则被精确定义，并且对于根据本发明配置的所有节点是共同的。 示例性地，网络节点不仅选择要抢占的数据流，而且可以标识可被抢占的其他“命运共享”数据流。 如本文所使用的，如果包含数据流的应用实例仅在所有命运共享流可操作时才起作用，则一组数据流具有命运共享关系。 在第一说明性实施例中，在命运共享组中的数据流被抢占之后，网络节点可以安全地拆除该组的剩余数据流。 在第二个说明性实施例中，当数据流被抢占时，其所有命运共享数据流被标记为处于“处于危险之中”。由于风险的流量并未立即被拆除，因此不太可能为 可能会释放风险流，然后随后用于建立相对较低优先级的数据流，而不是相对较高优先级的数据流。
-
-
-
-
-
-
-
-
-
搜索结果
19 条记录 (耗时 0.029 秒)
