会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明申请
    • END-TO-END HITLESS PROTECTION IN PACKET SWITCHED NETWORKS
    • 分组交换网络中的端到端无效保护
    • US20150043330A1
    • 2015-02-12
    • US14307573
    • 2014-06-18
    • NEC Laboratories America, Inc.
    • Junqiang HUYoshinobu OOTOKazuo TAKAGIYoshiaki AONOTing WANG
    • H04L12/939H04L12/721
    • H04L49/557H04L45/1283H04L45/28H04L45/50H04L45/68H04L45/70H04L47/34
    • A method and system are described for providing hitless protection in a packet switched network having source nodes and destination nodes. The method includes enabling a working path and a protecting path between the source and destination nodes. The working path is non-overlapping with respect to the protecting path. The method further includes replicating traffic in a given one of the source nodes to generate replicated traffic. The method also includes forwarding the traffic and the replicated traffic through a working path and a protecting path, respectively, from the given one of the source nodes to a particular one of the destination nodes. The method additionally includes delivering a hitless-protected service in the particular one of the destination nodes by selecting traffic packets received from either the working path or the protecting path.
    • 描述了一种用于在具有源节点和目的地节点的分组交换网络中提供无中断保护的方法和系统。 该方法包括启用源节点和目的节点之间的工作路径和保护路径。 工作路径与保护路径不重叠。 该方法还包括在给定的一个源节点中复制业务以生成复制业务。 该方法还包括将业务和复制的业务分别通过工作路径和保护路径转发到从给定的一个源节点到目标节点的特定一个。 该方法还包括通过选择从工作路径或保护路径接收到的业务分组来递送目标节点中的特定一个节点中的无受保护的服务。
    • 7. 发明授权
    • Disjoint path computation algorithm
    • 不相交路径计算算法
    • US08681607B2
    • 2014-03-25
    • US13457192
    • 2012-04-26
    • Wenhu LuSriganesh Kini
    • Wenhu LuSriganesh Kini
    • G01R31/08
    • H04L45/42H04L45/00H04L45/02H04L45/123H04L45/1283H04L45/28H04L45/50
    • A network element implementing Multiprotocol Label Switching to automatically create an optimal deterministic back-up Label Switch Path (LSP) that is maximally disjointed from a primary LSP to provide a reliable back up to the primary LSP. The network element receives a request for a generation of an LSP, determines that the request for the generation of the LSP is for the back-up LSP, locates each link of the primary LSP in a traffic engineering database, modifies each link of the primary LSP to have a link cost significantly greater than an actual link cost to discourage use of each link of the primary LSP in the back-up LSP, executes a Constrained Shortest Path First algorithm to obtain the back-up LSP, wherein the back-up LSP has a maximum disjointedness from the primary LSP due to a modified cost of each link of the primary LSP, and returns the back-up LSP.
    • 实现多协议标签交换的网元,自动创建一个最佳的确定性备份标签交换路径(LSP),最大限度地脱离主LSP,以提供可靠的备份到主LSP。 网元接收到生成LSP的请求,确定生成LSP的请求是用于备份LSP,将主LSP的每个链路定位在流量工程数据库中,修改主链路的每个链路 LSP具有明显大于实际链路成本的链路成本,以阻止在备用LSP中使用主LSP的每个链路,执行约束最短路径优先算法以获得备份LSP,其中备份LSP 由于主LSP的每个链路的修改成本,LSP与主LSP的最大不相容性,并返回备用LSP。
    • 9. 发明授权
    • Disjoint path computation algorithm
    • 不相交路径计算算法
    • US08233387B2
    • 2012-07-31
    • US12614323
    • 2009-11-06
    • Wenhu LuSriganesh Kini
    • Wenhu LuSriganesh Kini
    • G01R31/08
    • H04L45/42H04L45/00H04L45/02H04L45/123H04L45/1283H04L45/28H04L45/50
    • A network element implementing Multiprotocol Label Switching to automatically create an optimal deterministic back-up Label Switch Path (LSP) that is maximally disjointed from a primary LSP to provide a reliable back up to the primary LSP. The network element receives a request for a generation of an LSP, determines that the request for the generation of the LSP is for the back-up LSP, locates each link of the primary LSP in a traffic engineering database, modifies each link of the primary LSP to have a link cost significantly greater than an actual link cost to discourage use of each link of the primary LSP in the back-up LSP, executes a Constrained Shortest Path First algorithm to obtain the back-up LSP, wherein the back-up LSP has a maximum disjointedness from the primary LSP due to a modified cost of each link of the primary LSP, and returns the back-up LSP.
    • 实现多协议标签交换的网元,自动创建一个最佳的确定性备份标签交换路径(LSP),最大限度地脱离主LSP,以提供可靠的备份到主LSP。 网元接收到生成LSP的请求,确定生成LSP的请求是用于备份LSP,将主LSP的每个链路定位在流量工程数据库中,修改主链路的每个链路 LSP具有明显大于实际链路成本的链路成本,以阻止在备用LSP中使用主LSP的每个链路,执行约束最短路径优先算法以获得备份LSP,其中备份LSP 由于主LSP的每个链路的修改成本,LSP与主LSP的最大不相容性,并返回备用LSP。