中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

14 records (took 0.023 seconds)

    SCALABLE DISTRIBUTED END-TO-END PERFORMANCE DELAY MEASUREMENT FOR SEGMENT ROUTING POLICIES
    1.
    发明申请
    SCALABLE DISTRIBUTED END-TO-END PERFORMANCE DELAY MEASUREMENT FOR SEGMENT ROUTING POLICIES 审中-公开

    公开(公告)号：WO2020086160A9

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

    申请号：PCT/US2019/049490

    申请日：2019-09-04

    Applicant: CISCO TECHNOLOGY, INC.

    Inventor： FILSFILS, Clarence ,  GANDHI, Rakesh ,  SAAD, Tarek ,  SONI, Sagar ,  KHORDOC, Patrick

    IPC: H04L12/26

    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.

    SCALABLE DISTRIBUTED END-TO-END PERFORMANCE DELAY MEASUREMENT FOR SEGMENT ROUTING POLICIES
    2.
    发明申请
    SCALABLE DISTRIBUTED END-TO-END PERFORMANCE DELAY MEASUREMENT FOR SEGMENT ROUTING POLICIES 审中-公开

    公开(公告)号：WO2020086160A1

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

    申请号：PCT/US2019/049490

    申请日：2019-09-04

    Applicant: CISCO TECHNOLOGY, INC.

    Inventor： FILSFILS, Clarence ,  GANDHI, Rakesh ,  SAAD, Tarek ,  SONI, Sagar ,  KHORDOC, Patrick

    IPC: H04L12/26

    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.

    AN ENHANCED PATH SELECTION SCHEME FOR EQUAL COST PATHS IN COMMUNICATION NETWORKS
    3.
    发明申请
    AN ENHANCED PATH SELECTION SCHEME FOR EQUAL COST PATHS IN COMMUNICATION NETWORKS 审中-公开
    通信网络中平均成本节点的增强路径选择方案

    公开(公告)号：WO2014120751A1

    公开(公告)日：2014-08-07

    申请号：PCT/US2014/013572

    申请日：2014-01-29

    Applicant: CISCO TECHNOLOGY, INC.

    Inventor： SAAD, Tarek ,  AWAD, Sherif Saeed ,  ALI, Zafar ,  TAILLON, Michel

    IPC: H04L12/721

    CPC classification number: H04L45/124 ,  H04L45/125 ,  H04L45/24 ,  H04L45/50 ,  H04L45/62

    Abstract: In one embodiment, a node in a communication network receives a label switched path (LSP) request and in response, the node determines at least two equal cost paths, each path having one or more path-nodes. The node may then further determine a total bandwidth-based transition value for each path of the at least two equal cost paths and selects the path having a lower total transition value. Once selected, the node may establish the requested LSP over the selected path.

    Abstract translation: 在一个实施例中，通信网络中的节点接收标签交换路径（LSP）请求，并且作为响应，节点确定至少两个相等的成本路径，每个路径具有一个或多个路径节点。 然后，节点可以进一步确定至少两个相等成本路径的每个路径的总带宽转换值，并选择具有较低总转换值的路径。 一旦选择，节点可以在所选路径上建立所请求的LSP。

    MAKE-BEFORE-BREAK MECHANISM FOR LABEL SWITCHED PATHS
    4.
    发明申请
    MAKE-BEFORE-BREAK MECHANISM FOR LABEL SWITCHED PATHS 审中-公开
    用于标签切换路径的预先折断机制

    公开(公告)号：WO2017066505A1

    公开(公告)日：2017-04-20

    申请号：PCT/US2016/056941

    申请日：2016-10-14

    Applicant: CISCO TECHNOLOGY, INC.

    Inventor： SWALLOW, George ,  SAAD, Tarek

    IPC: H04L12/701

    CPC classification number: H04L45/50 ,  H04L45/00 ,  H04L45/125 ,  H04L45/74

    Abstract: In one embodiment, a device in a network determines that traffic sent via a first label switched path should be sent via a new label switched path. The device sends the traffic along the new label switched path using a label stack that indicates one or more adjacency segments or interface binding labels. A particular node along the new label switched path is configured to forward the traffic via a particular interface of the node based on a corresponding interface binding label or adjacency segment indicated by the traffic. The device completes a switchover from the first path to the new path.

    Abstract translation: 在一个实施例中，网络中的设备确定经由第一标签交换路径发送的业务应该经由新的标签交换路径发送。 设备使用指示一个或多个邻接段或接口绑定标签的标签堆栈沿新标签交换路径发送流量。 沿着新标签交换路径的特定节点被配置为基于由业务指示的对应接口绑定标签或邻接段经由节点的特定接口转发业务。 设备完成从第一个路径切换到新路径。

    FAST REROUTE FOR BIDIRECTIONAL CO-ROUTED TRAFFIC ENGINEERING TUNNELS
    5.
    发明申请
    FAST REROUTE FOR BIDIRECTIONAL CO-ROUTED TRAFFIC ENGINEERING TUNNELS 审中-公开
    双向交通交通工程隧道快速路

    公开(公告)号：WO2014035941A1

    公开(公告)日：2014-03-06

    申请号：PCT/US2013/056754

    申请日：2013-08-27

    Applicant: CISCO TECHNOLOGY, INC.

    Inventor： TAILLON, Michel ,  SAAD, Tarek ,  GANDHI, Rakesh ,  ALI, Zafar

    IPC: H04L12/707 ,  H04L12/703 ,  H04L12/773

    CPC classification number: H04L45/22 ,  H04L45/28 ,  H04L45/50

    Abstract: In one embodiment, network devices are configured to route traffic and signaling onto co-routed bypass tunnels. Co-routed bypass tunnels protect against node or link failures in a label switched paths. The co-routed bypass tunnels provide bidirectional protection. In one example, a node acting as the point of local repair (PLR) receives a resource reservation state message at a first node and extracts a tunnel sender address from the reservation state message. The PLR is configured to identify a bypass tunnel to a second node in the reverse direction of the label switched path and signal resource reservation messages over the bypass tunnel in the reverse direction. In another example, a PLR receives a resource reservation message with bypass tunnel identification and the PLR is configured to identify a bypass tunnel to a second node in the reverse direction.

    Abstract translation: 在一个实施例中，网络设备被配置为将通信量和信令路由到共路由旁路隧道。 路由旁路隧道可防止标签交换路径中的节点或链路故障。 共路旁路隧道提供双向保护。 在一个示例中，充当本地修复点（PLR）的节点在第一节点处接收资源预留状态消息，并从预留状态消息中提取隧道发送方地址。 PLR被配置为在相反方向上通过旁路隧道来识别在标签交换路径的相反方向上的第二节点的旁路隧道和信号资源预留消息。 在另一示例中，PLR接收具有旁路隧道标识的资源预留消息，并且PLR被配置为在相反方向上识别到第二节点的旁路隧道。

    SOFT PREEMPTION FOR MINIMIZING PREEMPTIONS IN A NETWORK
    6.
    发明申请
    SOFT PREEMPTION FOR MINIMIZING PREEMPTIONS IN A NETWORK 审中-公开
    在网络中最小化预防措施的软预防措施

    公开(公告)号：WO2012134617A2

    公开(公告)日：2012-10-04

    申请号：PCT/US2012/022580

    申请日：2012-01-25

    Applicant: CISCO TECHNOLOGY, INC. ,  GANDHI, Rakesh ,  SAWAYA, Robert ,  SAAD, Tarek ,  ISRAR, Junaid

    Inventor： GANDHI, Rakesh ,  SAWAYA, Robert ,  SAAD, Tarek ,  ISRAR, Junaid

    IPC: H04L12/56

    CPC classification number: H04L45/50 ,  H04L47/245 ,  H04L47/724 ,  H04L47/805

    Abstract: In an embodiment, a method is disclosed for minimizing soft preemptions of LSPs. Upon receiving a reservation message for an LSP whose requested bandwidth that exceeds the available bandwidth of downstream links, a network node may select a set of LSPs for soft preemption and share the selection with other nodes along their paths, both upstream and downstream. By coordinating the selection of LSPs to soft-preempt among nodes on the path, fewer LSPs may require soft preemption, which may result in minimizing excessive network disruptions, and thus, allowing the network to function more efficiently.

    Abstract translation: 在一个实施例中，公开了一种用于最小化LSP的软抢占的方法。 一旦接收到请求的带宽超过下游链路的可用带宽的LSP的预留消息，网络节点可以选择一组用于软抢占的LSP，并与上游和下游沿着其路径的其他节点共享选择。 通过将LSP的选择协调为在路径上的节点之间进行软抢占，较少的LSP可能需要软抢占，这可能导致最小化过度的网络中断，从而允许网络更有效地运行。

    MAKE-BEFORE-BREAK MECHANISM FOR LABEL SWITCHED PATHS
    8.
    发明公开
    MAKE-BEFORE-BREAK MECHANISM FOR LABEL SWITCHED PATHS 审中-公开

    公开(公告)号：EP3363167A1

    公开(公告)日：2018-08-22

    申请号：EP16788335.4

    申请日：2016-10-14

    Applicant: Cisco Technology, Inc.

    Inventor： SWALLOW, George ,  SAAD, Tarek

    IPC: H04L12/701

    CPC classification number: H04L45/50 ,  H04L45/00 ,  H04L45/125 ,  H04L45/74

    Abstract: In one embodiment, a device in a network determines that traffic sent via a first label switched path should be sent via a new label switched path. The device sends the traffic along the new label switched path using a label stack that indicates one or more adjacency segments or interface binding labels. A particular node along the new label switched path is configured to forward the traffic via a particular interface of the node based on a corresponding interface binding label or adjacency segment indicated by the traffic. The device completes a switchover from the first path to the new path.

Patent Agency Ranking