Method and apparatus for determining a preferred backup tunnel to protect point-to-multipoint label switch paths
    1.
    发明申请
    Method and apparatus for determining a preferred backup tunnel to protect point-to-multipoint label switch paths 有权
    用于确定优选备份隧道以保护点对多点标签交换路径的方法和装置

    公开(公告)号:US20070201355A1

    公开(公告)日:2007-08-30

    申请号:US11363840

    申请日:2006-02-27

    IPC分类号: H04J3/14

    摘要: A method, apparatus and computer program product for determining a preferred backup path to protect a point-to-multipoint label switching path is presented. A point-to-multipoint backup path is computed for each node located upstream from a branching node, the backup path originating at the node and including a set of nodes downstream from said branching node. A cost metric associated with each backup path is determined, as is a distance metric associated with each backup path. From the cost and distance metrics associated with each backup path a preferred backup path is selected using a distributed algorithm.

    摘要翻译: 提出了一种用于确定保护点对多点标签交换路径的优选备份路径的方法,装置和计算机程序产品。 针对位于分支节点上游的每个节点计算点对多点备份路径,源自节点的备份路径,并且包括从所述分支节点下游的一组节点。 确定与每个备份路径相关联的成本度量,以及与每个备份路径相关联的距离度量。 根据与每个备份路径相关联的成本和距离度量,使用分布式算法选择优选备份路径。

    Consistency between MPLS forwarding and control planes
    2.
    发明申请
    Consistency between MPLS forwarding and control planes 有权
    MPLS转发和控制平面之间的一致性

    公开(公告)号:US20050281192A1

    公开(公告)日:2005-12-22

    申请号:US10871076

    申请日:2004-06-18

    IPC分类号: H04L1/00 H04L12/56

    摘要: Systems and methods for assuring consistency between MPLS forwarding and control planes. The control plane can be made aware of forwarding plane anomalies and can respond appropriately. One particular application is assuring consistency between forwarding and control planes of a Fast Reroute backup tunnels used to protect an MPLS Traffic Engineering LSP from a link and/or a node failure. When a backup tunnel forwarding failure is detected, the control plane can react by, for example, rerouting the backup tunnel and/or sending a notification to the operator or head-end of the protected Traffic Engineering LSP.

    摘要翻译: 确保MPLS转发和控制平面之间一致性的系统和方法。 控制平面可以知道转发平面异常,并可以适当地做出响应。 一个特定的应用是确保用于保护MPLS流量工程LSP免受链路和/或节点故障的快速重路由备份隧道的转发和控制平面之间的一致性。 当检测到备份隧道转发失败时,控制平面可以通过例如重新路由备份隧道和/或向受保护的流量工程LSP的运营商或前端发送通知做出反应。

    Soft preemption feedback
    3.
    发明申请
    Soft preemption feedback 有权
    软抢占反馈

    公开(公告)号:US20050117512A1

    公开(公告)日:2005-06-02

    申请号:US10725606

    申请日:2003-12-02

    IPC分类号: H04L12/26 H04L12/56 H04L29/06

    摘要: 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计算新的路径,可以利用新的不可用链路的知识。 抢占机制的效率大大提高,异质抢占决策的不良影响有限。 信号量也可以显着降低。 在一个实现中,这些优点通过利用上游抢占反馈机制来实现,该机制使用增量定时器来延迟抢占决定,直到反馈可用。

    Method and apparatus for determining network routing information based on shared risk link group information
    4.
    发明申请
    Method and apparatus for determining network routing information based on shared risk link group information 有权
    基于共享风险链路组信息确定网络路由信息的方法和装置

    公开(公告)号:US20050111349A1

    公开(公告)日:2005-05-26

    申请号:US10719003

    申请日:2003-11-21

    摘要: 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的风险链路组。

    Trigger for packing path computation requests
    5.
    发明申请
    Trigger for packing path computation requests 有权
    用于打包路径计算请求的触发器

    公开(公告)号:US20060176828A1

    公开(公告)日:2006-08-10

    申请号:US11054145

    申请日:2005-02-09

    IPC分类号: H04J3/14 H04J1/16 H04L12/26

    摘要: 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,从而减少竞争条件,信令开销和建立故障。

    Reoptimization triggering by path computation elements
    6.
    发明申请
    Reoptimization triggering by path computation elements 有权
    路径计算元素的优化触发

    公开(公告)号:US20050259664A1

    公开(公告)日:2005-11-24

    申请号:US10848744

    申请日:2004-05-19

    IPC分类号: H04J1/16 H04L12/56

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

    Transparent re-routing of MPLS traffic engineering LSPs within a link bundle
    7.
    发明申请
    Transparent re-routing of MPLS traffic engineering LSPs within a link bundle 有权
    链路束内MPLS流量工程LSP的透明重路由

    公开(公告)号:US20050083928A1

    公开(公告)日:2005-04-21

    申请号:US10689385

    申请日:2003-10-20

    IPC分类号: H04L12/56

    摘要: 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修复,所以流量中断被最小化。

    Method and apparatus for forwarding data in a data communications network
    9.
    发明申请
    Method and apparatus for forwarding data in a data communications network 有权
    用于在数据通信网络中转发数据的方法和装置

    公开(公告)号:US20050265239A1

    公开(公告)日:2005-12-01

    申请号:US10858920

    申请日:2004-06-01

    IPC分类号: H04L12/28 H04L12/56

    摘要: A method is disclosed of forwarding data in a data communications network comprising a plurality of nodes and links therebetween, each link having an associated usage cost and a load capacity. A forwarding node identifies a lowest cost route, comprising one or more links, to a destination node. If a plurality of lowest cost routes is identified, then the forwarding node allocates data for forwarding along each of the lowest cost routes dependent on a relative load capacity of that route.

    摘要翻译: 公开了一种在数据通信网络中转发数据的方法,其中包括多个节点和链路之间的链路,每个链路具有相关联的使用成本和负载能力。 转发节点向目的地节点标识包括一个或多个链路的最低成本路由。 如果识别出多个最低成本路由,则转发节点根据该路由的相对负载能力分配用于沿每个最低成本路由转发的数据。

    Methods and devices for measuring the ratio of incondensables in gas
mixture
    10.
    发明授权
    Methods and devices for measuring the ratio of incondensables in gas mixture 失效
    测量气体混合物中不可燃物的比例的方法和装置

    公开(公告)号:US4831867A

    公开(公告)日:1989-05-23

    申请号:US36672

    申请日:1987-06-11

    摘要: A method and apparatus for measuring the ratio of incondensables in steam or other gaseous mixture. The mixture is led from a condenser through a transparent tube exposed to a light beam having a diameter approximately equal to the inside diameter of the tube, such that the beam is reflected by incondensable bubbles in the mixture but not by condensed droplets. A photoelectric sensor assembly is located in position to receive the light beam. The trajectory of the beam, and hence the signal from the sensor, is determined by whether the beam is intercepted by an incondensable bubble or a condensed droplet.

    摘要翻译: PCT No.PCT / FR86 / 00263 Sec。 371日期:1987年6月11日 102(e)日期1987年6月11日PCT提交1986年7月23日PCT公布。 出版物WO87 / 00631 日期1987年1月29日。一种用于测量蒸汽或其它气体混合物中不可避免物的比例的方法和装置。 将混合物从冷凝器通过暴露于直径大致等于管内径的光束的透明管引导,使得光束在混合物中被不可冷凝的气泡反射而不被冷凝的液滴反射。 光电传感器组件位于接收光束的位置。 光束的轨迹以及因此来自传感器的信号由光束是否被不可冷凝的气泡或凝聚液滴截取来确定。