专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20120096182A1 METHOD AND APPARATUS FOR COMPUTING A BACKUP PATH USING FATE-SHARING INFORMATION 有权
标题翻译：用于计算使用FACH共享信息的备用路径的方法和装置
公开(公告)号：US20120096182A1
公开(公告)日：2012-04-19
申请号：US13337773
申请日：2011-12-27
申请人： Der-Hwa GAN
发明人： Der-Hwa GAN
IPC分类号： G06F15/173
CPC分类号： G06F11/1464 , H04L41/0663 , H04L41/145 , H04L45/123 , H04L45/22
摘要： To address shortcomings in the prior art, the invention uses fate sharing information to compute backup paths. Fate sharing information relates groups of nodes or links according to common characteristics, attributes, or shared resources (e.g., a shared power supply, close proximity, same physical link). In one embodiment, fate-sharing information includes costs associated with groups of nodes or links. When a primary path contains a link or node that is in a fate-sharing group, the other links or nodes in the fate-sharing group are assigned the cost associated with that fate-sharing group. The node computing the backup path takes into account the assigned cost together with other node and link costs. Discovering the existence of the relationships and assigning costs to the groups may be done manually or automatically.
摘要翻译：为了解决现有技术中的缺点，本发明使用命运共享信息来计算备份路径。命运共享信息根据共同特征，属性或共享资源（例如共享电源，近距离，相同物理链路）关联节点或链路组。在一个实施例中，命运共享信息包括与节点或链路的组相关联的成本。当主路径包含命运共享组中的链接或节点时，命运共享组中的其他链接或节点将分配与该命运共享组相关联的成本。计算备份路径的节点考虑了分配的成本以及其他节点和链路成本。发现关系的存在和分配成本可以手动或自动完成。

2. 发明申请

US20100142370A1 PROTECTING CONNECTION TRAFFIC USING FILTERS 有权
标题翻译：使用过滤器保护连接交通
公开(公告)号：US20100142370A1
公开(公告)日：2010-06-10
申请号：US12705713
申请日：2010-02-15
申请人： Ping PAN , Der-Hwa Gan , Keith E. Holleman , Manoj Leelanivas , Nischal Sheth , Arun Vaidyanathan
发明人： Ping PAN , Der-Hwa Gan , Keith E. Holleman , Manoj Leelanivas , Nischal Sheth , Arun Vaidyanathan
IPC分类号： G06F11/00
CPC分类号： H04L43/0811 , H04L41/0668
摘要： A connection between network nodes in a communication network is backed up. A failover label-switched path (LSP) is created starting at a first network node of a connection and ending 5 at the second node of the connection, while bypassing the protected connection. In the event of connection failure, data is transmitted through the failover LSP. A network operator can selectively protect different types of data by using filters that bind one or more types of traffic received over one or more interfaces to different failover LSPs.
摘要翻译：备份通信网络中的网络节点之间的连接。从连接的第一个网络节点开始创建故障切换标签交换路径（LSP），并在连接的第二个节点处结束5，同时绕过受保护的连接。在连接失败的情况下，通过故障转移LSP传输数据。网络运营商可以通过使用将一个或多个接口上接收到的一种或多种类型的业务绑定到不同的故障切换LSP的过滤器来选择性地保护不同类型的数据。

3. 发明授权

US08438308B2 Method and apparatus for computing a backup path using fate-sharing information 有权
标题翻译：使用命运共享信息计算备份路径的方法和装置
公开(公告)号：US08438308B2
公开(公告)日：2013-05-07
申请号：US13337773
申请日：2011-12-27
申请人： Der-Hwa Gan
发明人： Der-Hwa Gan
IPC分类号： G06F15/173
CPC分类号： G06F11/1464 , H04L41/0663 , H04L41/145 , H04L45/123 , H04L45/22
摘要： To address shortcomings in the prior art, the invention uses fate sharing information to compute backup paths. Fate sharing information relates groups of nodes or links according to common characteristics, attributes, or shared resources (e.g., a shared power supply, close proximity, same physical link). In one embodiment, fate-sharing information includes costs associated with groups of nodes or links. When a primary path contains a link or node that is in a fate-sharing group, the other links or nodes in the fate-sharing group are assigned the cost associated with that fate-sharing group. The node computing the backup path takes into account the assigned cost together with other node and link costs. Discovering the existence of the relationships and assigning costs to the groups may be done manually or automatically.
摘要翻译：为了解决现有技术中的缺点，本发明使用命运共享信息来计算备份路径。命运共享信息根据共同特征，属性或共享资源（例如共享电源，近距离，相同物理链路）关联节点或链路组。在一个实施例中，命运共享信息包括与节点或链路的组相关联的成本。当主路径包含命运共享组中的链接或节点时，命运共享组中的其他链接或节点将分配与该命运共享组相关联的成本。计算备份路径的节点考虑了分配的成本以及其他节点和链路成本。发现关系的存在和分配成本可以手动或自动完成。

4. 发明申请

US20120020205A1 PROTECTING CONNECTION TRAFFIC USING FILTERS 有权
标题翻译：使用过滤器保护连接交通
公开(公告)号：US20120020205A1
公开(公告)日：2012-01-26
申请号：US13250731
申请日：2011-09-30
申请人： Ping PAN , Der-Hwa Gan , Keith E. Holleman , Manoj Leelanivas , Nischal Sheth , Arun Vaidyanathan
发明人： Ping PAN , Der-Hwa Gan , Keith E. Holleman , Manoj Leelanivas , Nischal Sheth , Arun Vaidyanathan
IPC分类号： H04L12/26
CPC分类号： H04L43/0811 , H04L41/0668
摘要： A connection between network nodes in a communication network is backed up. A failover switched path such as a label-switched path (LSP) is created starting at a first network node of a connection and ending at the second node of the connection, while bypassing the protected connection. In the event of connection failure, data is transmitted through the failover switched path (e.g., LSP). A network operator can selectively protect different types of data by using filters that bind one or more types of traffic received over one or more interfaces to different failover switched paths (LSPs).
摘要翻译：备份通信网络中的网络节点之间的连接。创建从连接的第一个网络节点开始并在连接的第二个节点结束的故障转移交换路径（如标签交换路径（LSP）），同时绕过受保护的连接。在连接失败的情况下，通过故障转移交换路径（例如，LSP）传输数据。网络运营商可以通过使用将通过一个或多个接口接收的一种或多种类型的业务绑定到不同的故障转移交换路径（LSP）的过滤器来选择性地保护不同类型的数据。

5. 发明授权

US08103789B1 Method and apparatus for computing a backup path using fate sharing information 有权
标题翻译：使用命运共享信息计算备份路径的方法和装置
公开(公告)号：US08103789B1
公开(公告)日：2012-01-24
申请号：US09795454
申请日：2001-03-01
申请人： Der-Hwa Gan
发明人： Der-Hwa Gan
IPC分类号： G06F15/173
CPC分类号： G06F11/1464 , H04L41/0663 , H04L41/145 , H04L45/123 , H04L45/22
摘要： To address shortcomings in the prior art, the invention uses fate sharing information to compute backup paths. Fate sharing information relates groups of nodes or links according to common characteristics, attributes, or shared resources (e.g., a shared power supply, close proximity, same physical link). In one embodiment, fate-sharing information includes costs associated with groups of nodes or links. When a primary path contains a link or node that is in a fate-sharing group, the other links or nodes in the fate-sharing group are assigned the cost associated with that fate-sharing group. The node computing the backup path takes into account the assigned cost together with other node and link costs. Discovering the existence of the relationships and assigning costs to the groups may be done manually or automatically.
摘要翻译：为了解决现有技术中的缺点，本发明使用命运共享信息来计算备份路径。命运共享信息根据共同特征，属性或共享资源（例如共享电源，近距离，相同物理链路）关联节点或链路组。在一个实施例中，命运共享信息包括与节点或链路的组相关联的成本。当主路径包含命运共享组中的链接或节点时，命运共享组中的其他链接或节点将分配与该命运共享组相关联的成本。计算备份路径的节点考虑了分配的成本以及其他节点和链路成本。发现关系的存在和分配成本可以手动或自动完成。

6. 发明授权

US07680952B1 Protecting connection traffic using filters 有权
标题翻译：使用过滤器保护连接流量
公开(公告)号：US07680952B1
公开(公告)日：2010-03-16
申请号：US10869501
申请日：2004-06-16
申请人： Ping Pan , Der-Hwa Gan , Keith E. Holleman , Manoj Leelanivas , Nischal Sheth , Arun Vaidyanathan
发明人： Ping Pan , Der-Hwa Gan , Keith E. Holleman , Manoj Leelanivas , Nischal Sheth , Arun Vaidyanathan
IPC分类号： G06F13/00
CPC分类号： H04L43/0811 , H04L41/0668
摘要： A connection between network nodes in a communication network is backed up. A failover label-switched path (LSP) is created starting at a first network node of a connection and ending at the second node of the connection, while bypassing the protected connection. In the event of connection failure, data is transmitted through the failover LSP. A network operator can selectively protect different types of data by using filters that bind one or more types of traffic received over one or more interfaces to different failover LSPs.
摘要翻译：备份通信网络中的网络节点之间的连接。从连接的第一个网络节点开始创建故障转移标签交换路径（LSP），并在连接的第二个节点处结束，同时绕过受保护的连接。在连接失败的情况下，通过故障转移LSP传输数据。网络运营商可以通过使用将通过一个或多个接口接收的一种或多种类型的业务绑定到不同的故障切换LSP的过滤器来选择性地保护不同类型的数据。

7. 发明申请

US20090040921A1 METHOD AND APPARATUS FOR FAST REROUTE IN A CONNECTION-ORIENTED NETWORK 有权
标题翻译：在面向连接的网络中快速解决的方法和设备
公开(公告)号：US20090040921A1
公开(公告)日：2009-02-12
申请号：US12254906
申请日：2008-10-21
申请人： Der-Hwa GAN , Anthony Joseph LI
发明人： Der-Hwa GAN , Anthony Joseph LI
IPC分类号： H04J3/14
CPC分类号： H04L41/0668 , H04L41/0654 , H04L43/0817 , H04L45/22 , H04L45/28 , H04L2012/562 , H04L2012/5627 , H04Q3/66 , H04Q11/0478 , H04Q2213/13056 , H04Q2213/13103 , H04Q2213/13141 , H04Q2213/13146 , H04Q2213/13164 , H04Q2213/13167 , H04Q2213/13176 , H04Q2213/13217 , H04Q2213/13332
摘要： A method and an apparatus for rapidly resuming, at times of failures, network traffic in a connection-oriented network by using an alternative route pre-computed and stored locally in nodes along an initial route without requiring signaling of upstream nodes or a master server.
摘要翻译：一种方法和装置，用于通过使用预先计算并沿着初始路由本地存储在节点中的替代路由在不需要上行节点或主服务器的信令的情况下在故障时快速恢复网络业务。

8. 发明授权

US08279754B1 RSVP-passive interfaces for traffic engineering peering links in MPLS networks 有权
标题翻译： MPLS网络中流量工程对等链路的RSVP-被动接口
公开(公告)号：US08279754B1
公开(公告)日：2012-10-02
申请号：US12491800
申请日：2009-06-25
申请人： Ina Minei , Der-Hwa Gan , Pedro R. Marques
发明人： Ina Minei , Der-Hwa Gan , Pedro R. Marques
IPC分类号： H04L12/26
CPC分类号： H04L41/0896 , H04L45/24 , H04L45/50 , H04L47/10 , H04L47/125 , H04L47/724 , H04L47/822
摘要： Constraint information associated with peering links is taken into account when establishing label switched paths (LSPs) to exit points of a network. Devices within the network, such as routers, designate interfaces associated with peering links as “passive interfaces” to indicate that the interfaces should be included for bandwidth accounting purposes and internal path computation. Other devices within the network utilize the constraint information, e.g., bandwidth availability, when computing and establishing LSPs to the exit points of the network to avoid congested peering links.
摘要翻译：当建立标签交换路径（LSP）以退出网络点时，会考虑与对等链路相关联的约束信息。网络中的设备（如路由器）将与对等链路相关联的接口指定为被动接口，以指示接口应包括在带宽计费和内部路径计算之中。当网络的出口点计算和建立LSP以避免拥塞的对等链路时，网络内的其他设备利用约束信息，例如带宽可用性。

9. 发明授权

US07995586B2 Multi-protocol label switching in a network device 有权
标题翻译：网络设备中的多协议标签交换
公开(公告)号：US07995586B2
公开(公告)日：2011-08-09
申请号：US12713570
申请日：2010-02-26
申请人： Dennis C. Ferguson , Der-Hwa Gan
发明人： Dennis C. Ferguson , Der-Hwa Gan
IPC分类号： H04L12/28
CPC分类号： H04L45/50 , H04L45/10 , H04L45/60 , H04L49/3009 , H04L69/22
摘要： A network device for processing data packets includes input logic, a register, route lookup logic and output processing logic. The input logic receives a data packet having at least one multi-protocol label switching (MPLS) tag, stores the packet and forwards a portion of the packet including the MPLS tag. The route lookup logic receives the portion of the packet, generates next hop information based on the MPLS tag and determines whether at least one MPLS tag is to be removed from the packet before the packet is to be output by the network device. The route lookup logic also modifies a start offset value in the register for each MPLS tag that is to be removed and forwards the start offset. The output processing logic receives the start offset and begins processing the data packet for output at a location identified by the start offset.
摘要翻译：用于处理数据分组的网络设备包括输入逻辑，寄存器，路由查找逻辑和输出处理逻辑。输入逻辑接收具有至少一个多协议标签交换（MPLS）标签的数据分组，存储分组并转发包括MPLS标签的分组的一部分。路由查找逻辑接收分组的部分，基于MPLS标签生成下一跳信息，并且确定在网络设备要输出分组之前是否要从分组中移除至少一个MPLS标签。路由查找逻辑还修改要删除的每个MPLS标签的寄存器中的起始偏移值，并转发起始偏移量。输出处理逻辑接收起始偏移并开始处理数据包以便在由起始偏移识别的位置输出。

10. 发明授权

US07558199B1 RSVP-passive interfaces for traffic engineering peering links in MPLS networks 有权
标题翻译： MPLS网络中流量工程对等链路的RSVP-被动接口
公开(公告)号：US07558199B1
公开(公告)日：2009-07-07
申请号：US10973677
申请日：2004-10-26
申请人： Ina Minei , Der-Hwa Gan , Pedro R. Marques
发明人： Ina Minei , Der-Hwa Gan , Pedro R. Marques
IPC分类号： H04L12/26
CPC分类号： H04L41/0896 , H04L45/24 , H04L45/50 , H04L47/10 , H04L47/125 , H04L47/724 , H04L47/822
摘要： Constraint information associated with peering links is taken into account when establishing label switched paths (LSPs) to exit points of a network. Devices within the network, such as routers, designate interfaces associated with peering links as “passive interfaces” to indicate that the interfaces should be included for bandwidth accounting purposes and internal path computation. Other devices within the network utilize the constraint information, e.g., bandwidth availability, when computing and establishing LSPs to the exit points of the network to avoid congested peering links.
摘要翻译：当建立标签交换路径（LSP）以退出网络点时，会考虑与对等链路相关联的约束信息。网络中的设备（如路由器）将与对等链路相关联的接口指定为“被动接口”，以指示接口应包含在带宽计费和内部路径计算之中。当网络的出口点计算和建立LSP以避免拥塞的对等链路时，网络内的其他设备利用约束信息，例如带宽可用性。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式