FAST REROUTE (FRR) PROTECTION AT THE EDGE OF A RFC 2547 NETWORK

    公开(公告)号:WO2006065440A3

    公开(公告)日:2006-06-22

    申请号:PCT/US2005/041795

    申请日:2005-11-17

    Abstract: A fast rerout (FRR) technique that may be deployed at the edge of a network having first and second edge devices coupled to a neiboring 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 (830) reroutes at least some data packets addressed to the neighboring domain to the second edge device. The second edge device receives the reroute packets and then forwards (835) the packets to the neigboring domain. Notably, the second edge device is not permitted to reroute the received packets a second time, e.g., upon identifying another time-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.

    SCALABLE DISTRIBUTED END-TO-END PERFORMANCE DELAY MEASUREMENT FOR SEGMENT ROUTING POLICIES

    公开(公告)号:WO2020086160A9

    公开(公告)日:2020-04-30

    申请号:PCT/US2019/049490

    申请日:2019-09-04

    Abstract: The present technology is directed to a scalable solution for end-to-end performance delay measurement for Segment Routing Policies on both SR-MPLS and SRv6 data planes. The scalability of the solution stems from the use of distributed PM sessions along SR Policy ECMP paths. This is achieved by dividing the SR policy into smaller sections comprised of SPT trees or sub-paths, each of which is associated with a Root-Node. Downstream SID List TLVs may be used in Probe query messages for signaling SPT information to the Root-Nodes Alternatively, this SPT signaling may be accomplished by using a centralized controller. Root-Nodes are responsible for dynamically creating PM sessions and measuring delay metrics for their associated SPT tree section. The root-nodes then send the delay metrics for their local section to an ingress PE node or to a centralized controller using delay metric TLV field of the response message.

    SEGMENT ROUTING NETWORK PROCESSING OF PACKETS

    公开(公告)号:WO2019139805A1

    公开(公告)日:2019-07-18

    申请号:PCT/US2019/012121

    申请日:2019-01-03

    Abstract: In one embodiment, segment routing (SR) network processing of packets is performed on packets having a segment identifier structure providing processing and/or memory efficiencies. Responsive to an identified particular segment routing policy, the particular router retrieves from memory a dynamic segment routing identifier portion of the particular SR policy that includes a SR node value and a SR function value. The SR function value identifies segment routing processing to be performed by a router in the network identified based on the SR node value. A segment routing discriminator is independently identified, possibly being a fixed value for all segment identifiers in the network. Before sending into the network, a complete segment identifier is added to the particular packet by combining the segment routing discriminator with the dynamic segment routing identifier portion. The particular packet including the complete segment identifier is sent into the network.

    INDEXED SEGMENT ID
    26.
    发明申请
    INDEXED SEGMENT ID 审中-公开
    索引部分ID

    公开(公告)号:WO2014163863A1

    公开(公告)日:2014-10-09

    申请号:PCT/US2014/018226

    申请日:2014-02-25

    CPC classification number: H04L45/745 H04L45/00 H04L45/02 H04L45/50 H04L45/54

    Abstract: An apparatus and method for using indexed segment identifiers in segment routing. An example method involves receiving a globally unique index value at a node. The method also involves receiving a base value at the node, where the base value comprises a segment routing value configured to identify a nodal segment. The method then involves calculating a segment identifier based on the index value and the base value.

    Abstract translation: 一种在段路由中使用索引段标识符的装置和方法。 一个示例方法涉及在节点处接收全局唯一的索引值。 该方法还涉及在节点处接收基本值,其中基本值包括被配置为识别节点段的段路由值。 该方法然后包括基于索引值和基础值计算段标识符。

    LABEL DISTRIBUTION PROTOCOL OVER SEGMENT ROUTING
    27.
    发明申请
    LABEL DISTRIBUTION PROTOCOL OVER SEGMENT ROUTING 审中-公开
    标签分配协议超过部分路由

    公开(公告)号:WO2014144216A1

    公开(公告)日:2014-09-18

    申请号:PCT/US2014/028526

    申请日:2014-03-14

    Abstract: A method and apparatus for forwarding packets through a network domain that contains nodes that are label distribution protocol (LDP) enabled and nodes that are segment routing (SR) enabled. In one embodiment, the method may include a network node receiving a packet with a label attached thereto. The node swaps the label with a segment identifier (ID). The node then forwards the packet to an SR node. In another embodiment, the method may include a network node receiving a packet with a segment ID attached thereto. The node swaps the segment ID with a label. The node then forwards the packet to an LDP enabled node.

    Abstract translation: 一种用于通过包含启用标签分发协议(LDP)的节点的网络域转发分组的方法和装置,以及启用分段路由(SR)的节点。 在一个实施例中,该方法可以包括接收具有附加到其上的标签的分组的网络节点。 节点用分段标识符(ID)交换标签。 然后节点将数据包转发到SR节点。 在另一个实施例中,该方法可以包括接收具有附加到其上的段ID的分组的网络节点。 节点用标签交换分段ID。 然后节点将数据包转发到启用LDP的节点。

    DISTRIBUTED DEMAND MATRIX COMPUTATIONS
    29.
    发明申请
    DISTRIBUTED DEMAND MATRIX COMPUTATIONS 审中-公开
    分布式需求矩阵计算

    公开(公告)号:WO2013155021A2

    公开(公告)日:2013-10-17

    申请号:PCT/US2013/035687

    申请日:2013-04-08

    Abstract: In one embodiment, a method includes receiving a packet at a first network device, logging the packet into a demand corresponding to a cell of a demand matrix, and storing the demand in a demand database at the first network device. The demand database includes a plurality of demands computed for a specified time period and corresponding to cells of the demand matrix associated with traffic entering a network at the first network device. Demands corresponding to cells of the demand matrix associated with traffic entering the network at a second network device are computed and stored at the second network device. An apparatus and logic are also disclosed herein.

    Abstract translation: 在一个实施例中,一种方法包括在第一网络设备处接收分组,将分组记录到与需求矩阵的小区相对应的需求中,并将需求存储在第一网络设备的需求数据库中。 需求数据库包括在指定的时间周期内计算出的多个需求量,并对应于与在第一网络设备处进入网络的流量相关联的需求矩阵的单元。 在第二网络设备处计算并存储与在第二网络设备处进入网络的业务相关联的需求矩阵的小区所对应的需求。 本文还公开了一种装置和逻辑。

    INSTALLING AND USING A SUBSET OF ROUTES
    30.
    发明申请
    INSTALLING AND USING A SUBSET OF ROUTES 审中-公开
    安装和使用一条路线

    公开(公告)号:WO2013032795A1

    公开(公告)日:2013-03-07

    申请号:PCT/US2012/051771

    申请日:2012-08-21

    CPC classification number: H04L45/025 H04L45/04 H04L45/54 H04L45/748

    Abstract: In one embodiment, an Internet Protocol (IP) routing information base of a packet switching device is filtered to produce a significantly smaller subset of IP routes that are installed in one or more forwarding information bases for forwarding of IP packets. In one embodiment, these smaller forwarding information bases are located in memory local to a network processor to more quickly perform lookup operations thereon. In one embodiment, one or more of these forwarding information bases is used only for exact matching of addresses (not longest prefix matching). In one embodiment, the IP routes in these smaller forwarding information bases substantially correspond to packet switching devices in a network (e.g., core and edge routers), such as in contrast to including all the IP routes for devices external to the network.

    Abstract translation: 在一个实施例中,分组交换设备的因特网协议(IP)路由信息库被过滤以产生安装在用于转发IP分组的一个或多个转发信息库中的明显较小的IP路由子集。 在一个实施例中,这些较小转发信息库位于网络处理器本地的存储器中,以更快速地执行其上的查找操作。 在一个实施例中,这些转发信息库中的一个或多个仅用于地址的精确匹配(不是最长的前缀匹配)。 在一个实施例中,这些较小转发信息库中的IP路由基本上对应于网络中的分组交换设备(例如,核心和边缘路由器),例如与包括网络外部设备的所有IP路由相反。

Patent Agency Ranking