HARDWARE-FRIENDLY MECHANISMS FOR IN-BAND OAM PROCESSING

    公开(公告)号:WO2020131481A1

    公开(公告)日:2020-06-25

    申请号:PCT/US2019/065370

    申请日:2019-12-10

    Abstract: In one illustrative example, a network node (e.g. a router or switch) may receive a data packet and timestamp a copy of the data packet. The node may also compute a signature for the copy and insert the signature in a header of the copy. The node may send the copy to a controller for correlation with one or more other timestamped data packet copies of the data packet from one or more other network nodes having the same signature and for the computation of delay. The original data packet may be forwarded to a next network node without any timestamp or other metadata added to it. The processing of the data packets may be performed as part of a function for punting the timestamped data packet copy and forwarding, or as a function for forwarding and punting the timestamped data packet copy.

    PACKET NETWORK INTERWORKING INCLUDING SEGMENT ROUTING

    公开(公告)号:WO2020086570A1

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

    申请号:PCT/US2019/057424

    申请日:2019-10-22

    Abstract: In one embodiment, a network comprises a first forwarding domain using a first data plane forwarding protocol and a second forwarding domain using a second data plane forwarding protocol different than the first data forwarding plane forwarding protocol. The first forwarding domain includes a first path node and a particular border node. The second forwarding domain includes a second path node and the particular border node. The particular border node performs Segment Routing or other protocol interworking between the different data plane forwarding domains, such as for transporting packets through a different forwarding domain or translating a packet to use a different data forwarding protocol. These forwarding domains typically include Segment Routing (SR) and SR-Multiprotocol Label Switching (SR-MPLS). Paths through the network are determined by a Path Computation Engine and/or based on route advertisements such associated with Binding Segment Identifiers (BSIDs) (e.g., labels, Internet Protocol addresses).

    BANDWIDTH ON-DEMAND SERVICES IN MULTIPLE LAYER NETWORKS
    14.
    发明申请
    BANDWIDTH ON-DEMAND SERVICES IN MULTIPLE LAYER NETWORKS 审中-公开
    多层网络中的带宽需求服务

    公开(公告)号:WO2014081766A1

    公开(公告)日:2014-05-30

    申请号:PCT/US2013/070902

    申请日:2013-11-20

    CPC classification number: H04L41/5051 H04L41/0896 H04L43/0876 H04L47/825

    Abstract: Bandwidth usage for an existing communication tunnel between a first device and second device is monitored. A determination is made that additional bandwidth is required for communication between the first network device and the second network device. A determination is made that for the addition of the additional bandwidth would exceed available bandwidth for the existing tunnel. Additional bandwidth is established between the first network device and the second network device.

    Abstract translation: 监视第一设备和第二设备之间现有通信隧道的带宽使用情况。 确定第一网络设备和第二网络设备之间的通信需要额外的带宽。 确定附加带宽的增加将超过现有隧道的可用带宽。 在第一网络设备和第二网络设备之间建立额外的带宽。

    SYSTEM AND METHOD FOR EFFICIENT POINT-TO-MULTI-POINT TRAFFIC ENGINEERING (P2MP-TE) PATH PROTECTION
    15.
    发明申请
    SYSTEM AND METHOD FOR EFFICIENT POINT-TO-MULTI-POINT TRAFFIC ENGINEERING (P2MP-TE) PATH PROTECTION 审中-公开
    有效的点到多点交通工程(P2MP-TE)路径保护的系统和方法

    公开(公告)号:WO2014004792A1

    公开(公告)日:2014-01-03

    申请号:PCT/US2013/048130

    申请日:2013-06-27

    CPC classification number: H04L12/1863 H04L12/185 H04L45/28

    Abstract: A path protection method that includes: establishing a point to multi-point (P2MP) tree spanning from a head node to a plurality of tail nodes, the P2MP tree providing a label switched path (LSP) from the head node to a particular tail node; identifying a first and a second pluralities of source-to-leaf (S2L) sub-LSPs for the LSP included within the P2MP tree, each corresponding pair of S2L sub-LSP in the first and second pluralities are path diverse; setting a first flag in a RSVP path message to designate the second plurality of S2L sub-LSPs as protecting respective S2L sub-LSPs in the first plurality at a baseline level of protection; setting a second flag to designate a subset of S2L sub-LSPs in the second plurality as protecting respective S2L sub-LSPs in the first plurality at an elevated level of protection; and transmitting the RSVP path message.

    Abstract translation: 一种路径保护方法,包括:建立从头节点到多个尾节点的多点(P2MP)点的点,所述P2MP树提供从头节点到特定尾节点的标签交换路径(LSP) ; 识别P2MP树中包含的LSP的第一和第二多个源 - 叶(S2L)子LSP,第一和第二多个的每个对应的S2L子LSP对都是路径多样的; 在RSVP路径消息中设置第一标志,以将第二多个S2L子LSP指定为在基准保护级别保护第一组中的各个S2L子LSP; 设置第二标志以指定第二多个中的S2L子LSP的子集,以在提升的保护级别上保护第一多个中的各个S2L子LSP; 并发送RSVP路径消息。

    SYSTEM AND METHOD FOR EFFICIENT POINT-TO-MULTI-POINT TRAFFIC ENGINEERING (P2MP-TE) PATH PROTECTION
    17.
    发明公开
    SYSTEM AND METHOD FOR EFFICIENT POINT-TO-MULTI-POINT TRAFFIC ENGINEERING (P2MP-TE) PATH PROTECTION 有权
    系统和方法高效P2MP TE措手不及

    公开(公告)号:EP2868034A1

    公开(公告)日:2015-05-06

    申请号:EP13734300.0

    申请日:2013-06-27

    CPC classification number: H04L12/1863 H04L12/185 H04L45/28

    Abstract: A path protection method that includes: establishing a point to multi-point (P2MP) tree spanning from a head node to a plurality of tail nodes, the P2MP tree providing a label switched path (LSP) from the head node to a particular tail node; identifying a first and a second pluralities of source-to-leaf (S2L) sub-LSPs for the LSP included within the P2MP tree, each corresponding pair of S2L sub-LSP in the first and second pluralities are path diverse; setting a first flag in a RSVP path message to designate the second plurality of S2L sub-LSPs as protecting respective S2L sub-LSPs in the first plurality at a baseline level of protection; setting a second flag to designate a subset of S2L sub-LSPs in the second plurality as protecting respective S2L sub-LSPs in the first plurality at an elevated level of protection; and transmitting the RSVP path message.

Patent Agency Ranking