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

51. 发明申请

US20100040066A1 NETWORK ADDRESS LOOKUP BASED ON BLOOM FILTERS 有权
标题翻译：基于BLOOM过滤器的网络地址查找
公开(公告)号：US20100040066A1
公开(公告)日：2010-02-18
申请号：US12190633
申请日：2008-08-13
申请人： Fang Hao , Muralidharan S. Kodialam , Tirunell V. Lakshman , Haoyu Song
发明人： Fang Hao , Muralidharan S. Kodialam , Tirunell V. Lakshman , Haoyu Song
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/745 , H04L45/7457
摘要： In one embodiment, IP lookup into a routing table having prefixes of different prefix lengths is performed using a Bloom filter that was programmed with the prefixes corresponding to all of the different prefix lengths without having to expand any of the prefixes programmed into the Bloom filter. Membership probes are performed into the Bloom filter using candidate prefix values of a given network address. The Bloom filter can be implemented in a distributed manner using Bloom sub-filters, where each Bloom sub-filter is hashed based on a set of hash functions, where each different hash function in the set corresponds to a different prefix length in the routing table. Each Bloom sub-filter can in turn be implemented using a plurality of practically realizable multi-port memory devices controlled by a port scheduler. False-positive matches can be detected and next-hop information for true-positive matches retrieved using an off-chip, hash-based prefix table.
摘要翻译：在一个实施例中，使用具有与所有不同前缀长度相对应的前缀编程的布隆过滤器来执行具有不同前缀长度的前缀的路由表的IP查找，而不必将编程到布隆过滤器中的任何前缀扩展。使用给定网络地址的候选前缀值对Bloom过滤器进行成员资格探测。 Bloom过滤器可以使用Bloom子过滤器以Bloom子过滤器实现，其中每个Bloom子过滤器基于一组散列函数进行散列，其中集合中的每个不同的散列函数对应于路由表中的不同的前缀长度。可以使用由端口调度器控制的多个实际可实现的多端口存储器件来实现每个Bloom子滤波器。可以检测到假阳性匹配，并使用片外基于散列的前缀表检索真正匹配的下一跳信息。

52. 发明授权

US10374939B2 Hop constrained maximum flow with segment routing 有权
公开(公告)号：US10374939B2
公开(公告)日：2019-08-06
申请号：US15605790
申请日：2017-05-25
申请人： Fang Hao , Murali Kodialam , T. V. Lakshman
发明人： Fang Hao , Murali Kodialam , T. V. Lakshman
IPC分类号： H04L12/26 , H04L12/721 , H04L12/733
摘要： A method of determining a maximum flow on a network path using segment routing, the method including establishing a segment graph, establishing underlying dual weights on the segment graph, computing the dual weights from the segment graph, finding a minimum dual weight path not having more than a predetermined number of hops, augmenting a flow on the dual weight path, and updating the dual weights on the underlying segment graph.

53. 发明授权

US10326688B2 Method and apparatus for instantiating a path with the minimum number of segments 有权
公开(公告)号：US10326688B2
公开(公告)日：2019-06-18
申请号：US15605712
申请日：2017-05-25
申请人： Fang Hao , Murali Kodialam , T. V. Lakshman , Ehsan Rezaaifar
发明人： Fang Hao , Murali Kodialam , T. V. Lakshman , Ehsan Rezaaifar
IPC分类号： H04L12/721 , H04L12/723
摘要： Various embodiments relate to a method and apparatus for computing a minimum segment labeling of a given path on a segment cover graph, the method including receiving a connection request for a connection between a source node and a destination node, generating a Shortest Path Directed Acyclic Graph (“SPDAG”) from the source node to the destination node by running a shortest path algorithm from the source node, determining an end node, between the source node and the destination node, at which the SPDAG deviates from the given path, determining whether the end node is the end of an Equal Cost Multipath (“ECMP”) and terminating the shortest path algorithm at a predecessor node to the end node if the end node is the end of an ECMP and making the predecessor node to the end node the source node.

54. 发明申请

US20170244619A1 ANCHOR MOBILITY IN WIRELESS NETWORKS 审中-公开
公开(公告)号：US20170244619A1
公开(公告)日：2017-08-24
申请号：US15047988
申请日：2016-02-19
申请人： Randeep S. Bhatia , Fang Hao , Tirunell V. Lakshman , Harish Viswanathan , Colin L. Kahn
发明人： Randeep S. Bhatia , Fang Hao , Tirunell V. Lakshman , Harish Viswanathan , Colin L. Kahn
IPC分类号： H04L12/26 , H04L12/927 , H04L29/08
CPC分类号： H04L43/08 , H04L47/80 , H04L67/141 , H04L67/143 , H04W36/12 , H04W88/16
摘要： This disclosure generally discloses an anchor mobility mechanism. The anchor mobility mechanism is configured to support migration of flows between mobility anchors within a wireless communication system. The anchor mobility mechanism may be configured to support migration of flows between mobility anchors within a wireless communication system in a highly seamless manner. The anchor mobility mechanism may be configured to support migration of a flow of a wireless device between mobility anchors within a wireless communication system using functions performed by a control element (CE) and one or more forwarding elements (FEs) within the data plane of the flow of the wireless device. The functions may include identifying a time at which to initiate migration of the flow, initiating migration of the flow based on identification of the time at which to initiate migration of the flow, or the like, as well as various combinations thereof.

55. 发明授权

US09066160B2 Apparatus and method for protection in a data center 有权
标题翻译：数据中心保护装置及方法
公开(公告)号：US09066160B2
公开(公告)日：2015-06-23
申请号：US13350457
申请日：2012-01-13
申请人： Fang Hao , Muralidharam S. Kodialam , Tirunell V. Lakshman , Haoyu Song , Martin Zimgibl
发明人： Fang Hao , Muralidharam S. Kodialam , Tirunell V. Lakshman , Haoyu Song , Martin Zimgibl
IPC分类号： H04B10/00 , H04Q11/00
CPC分类号： H04B10/032 , H04B10/038 , H04B10/27 , H04L1/22 , H04Q11/00
摘要： A manner of providing redundancy protection for a data center network that is both reliable and low-cost. In a data center network where the data traffic between numerous access nodes and a network core layer via primary aggregation nodes, an optical network device such as and OLT (optical line terminal) is provided as a backup aggregation node for one or more of the primary aggregation nodes. When a communication path through a primary aggregation node fails, traffic is routed through the optical network device. In a preferred embodiment, a communication link is formed from a plurality of access nodes to a single port of the OLT or other optical network device via an optical splitter that combines upstream transmissions and distributes downstream transmissions. The upstream transmissions from the plurality of access nodes may occur according to an allocation schedule generated when the backup aggregation node is needed.
摘要翻译：为可靠和低成本的数据中心网络提供冗余保护的方式。在通过主聚合节点在多个接入节点和网络核心层之间的数据业务的数据中心网络中，提供诸如OLT（光线路终端）之类的光网络设备作为主要的一个或多个的备份聚合节点聚合节点。当通过主聚合节点的通信路径发生故障时，流量将通过光网络设备进行路由。在优选实施例中，通过组合上行传输并分发下行传输的光分路器，从多个接入节点到OLT或其他光网络设备的单个端口形成通信链路。来自多个接入节点的上行传输可以根据需要备份聚合节点时生成的分配调度进行。

56. 发明授权

US08631043B2 Method and apparatus for generating a shape graph from a binary trie 有权
标题翻译：用于从二进制trie生成形状图的方法和装置
公开(公告)号：US08631043B2
公开(公告)日：2014-01-14
申请号：US12633845
申请日：2009-12-09
申请人： Fang Hao , Muralidharan Kodialam , Tirunell V. Lakshman , Haoyu Song
发明人： Fang Hao , Muralidharan Kodialam , Tirunell V. Lakshman , Haoyu Song
IPC分类号： G06F17/30
CPC分类号： G06F17/30958
摘要： A capability is provided for representing a set of data values using data structures, including converting a binary trie data structure representing the set of data values to a shape graph data structure representing the set of data values. The shape graph data structure is generated from the binary trie data structure based on the shapes of the sub-trees rooted at the nodes of the binary trie data structure. The shape graph includes vertices representing shapes of the sub-trees of the binary trie data structure. A shape graph data structure permits operations similar to the operations that may be performed on the binary trie data structure for performing lookups for data values from the set of data values, while at the same time reducing the structural redundancy of the binary trie data structure such that the shape graph data structure provides significant improvements in memory usage over the binary trie data structure.
摘要翻译：提供了一种用于使用数据结构表示一组数据值的能力，包括将表示该组数据值的二进制特里数据结构转换为表示数据值集合的形状图数据结构。形状图数据结构是从二进制trie数据结构生成的基于二叉树数据结构的节点的子树的形状。形状图包括表示二进制trie数据结构的子树形状的顶点。形状图数据结构允许类似于可以对二进制特里数据结构执行的操作的操作，以执行来自该组数据值的数据值的查找，同时减少二进制特里数据结构的结构冗余，形状图数据结构在二进制数据结构中提供了对存储器使用的显着改进。

57. 发明申请

US20130305311A1 APPARATUS AND METHOD FOR PROVIDING A FLUID SECURITY LAYER 有权
标题翻译：提供流体安全层的装置和方法
公开(公告)号：US20130305311A1
公开(公告)日：2013-11-14
申请号：US13469176
申请日：2012-05-11
申请人： Krishna P. Puttaswamy Naga , Fang Hao , Antony Martin
发明人： Krishna P. Puttaswamy Naga , Fang Hao , Antony Martin
IPC分类号： G06F21/00
CPC分类号： H04L63/0263 , H04L63/20
摘要： A security management capability enables migration of individual security rules between storage/application locations. The migration of a security rule may include selection of a location at which the security rule is to be applied and migration of the security rule to the selected location at which the security rule is to be applied. The selection of the location at which the security rule is to be applied may be performed based on security rule policies and/or security rule location selection information. The security rule is migrated from a current location (e.g., a location at which the security rule is currently applied, a management system, or the like) to the selected location at which the security rule is to be applied. In this manner, a fluid security layer may be provided. The fluid security layer may be optimized for one or more of security level, performance, cost, or the like.
摘要翻译：安全管理功能可以在存储/应用程序位置之间迁移各个安全规则。安全规则的迁移可以包括选择要应用安全规则的位置，以及将安全规则迁移到要应用安全规则的所选择的位置。可以基于安全规则策略和/或安全规则位置选择信息来执行对应用安全规则的位置的选择。安全规则从当前位置（例如，当前应用安全规则的位置，管理系统等）迁移到要应用安全规则的所选择的位置。以这种方式，可以提供流体安全层。可以针对安全级别，性能，成本等中的一个或多个优化流体安全层。

58. 发明申请

US20130187257A1 Semiconductor device and method for manufacturing the same 审中-公开
标题翻译：半导体装置及其制造方法
公开(公告)号：US20130187257A1
公开(公告)日：2013-07-25
申请号：US13825505
申请日：2011-11-18
申请人： Du Jian , Li Jiajia , Fang Hao
发明人： Du Jian , Li Jiajia , Fang Hao
IPC分类号： H01L23/29 , H01L21/265
CPC分类号： H01L21/26513 , H01L21/265 , H01L21/2652 , H01L21/266 , H01L21/28238 , H01L23/291 , H01L2924/0002 , H01L2924/00
摘要： A method is disclosed for manufacturing a semiconductor device. The method includes providing a substrate and forming a well region in the substrate by an ion implantation. The method also includes forming, by rapid thermal oxidation and on the substrate having the well region, an oxide layer for repairing the substrate damaged by the ion implantation. Further, the method includes removing the oxide layer and forming a gate oxide layer on the repaired substrate having the well region.
摘要翻译：公开了制造半导体器件的方法。该方法包括提供衬底并通过离子注入在衬底中形成阱区。该方法还包括通过快速热氧化和在具有阱区的基板上形成用于修复由离子注入损坏的衬底的氧化物层。此外，该方法包括去除氧化物层并在具有阱区的修复的衬底上形成栅极氧化物层。

59. 发明申请

US20130166943A1 Method And Apparatus For Energy Efficient Distributed And Elastic Load Balancing 有权
标题翻译：用于能量效率分布和弹性负载平衡的方法和装置
公开(公告)号：US20130166943A1
公开(公告)日：2013-06-27
申请号：US13334141
申请日：2011-12-22
申请人： Haoyu Song , Fang Hao , Tirunell V. Lakshman
发明人： Haoyu Song , Fang Hao , Tirunell V. Lakshman
IPC分类号： G06F15/173 , G06F11/20
CPC分类号： G06F9/505 , G06F9/5083 , Y02D10/22
摘要： Various embodiments provide a method and apparatus of providing a load balancing configuration that adapts to the overall load and scales the power consumption with the load to improve energy efficiency and scalability. The energy efficient distributed and elastic load balancing architecture includes a collection of multi-tiered servers organized as a tree structure. The handling of incoming service requests is distributed amongst a number of the servers. Each server in the virtual load distribution tree accepts handles incoming service requests based on its own load. Once a predetermined loading on the receiving server has been reached, the receiving server passes the incoming requests to one or more of its children servers.
摘要翻译：各种实施例提供一种方法和装置，其提供适应于总负载的负载平衡配置，并且与负载缩放功率消耗以提高能量效率和可扩展性。节能分布式和弹性负载平衡架构包括组织为树结构的多层服务器集合。传入服务请求的处理分布在多个服务器之间。虚拟负载分配树中的每个服务器都会根据自己的负载接收传入的服务请求。一旦达到接收服务器上的预定加载，接收服务器将传入请求传递给其一个或多个子服务器。

60. 发明授权

US08266506B2 Method and apparatus for multiset membership testing using combinatorial bloom filters 有权
标题翻译：使用组合绽放滤波器进行多集群成员化测试的方法和装置
公开(公告)号：US08266506B2
公开(公告)日：2012-09-11
申请号：US12426227
申请日：2009-04-18
申请人： Fang Hao , Muralidharan Sampath Kodialam , Tirunell V. Lakshman , Haoyu Song
发明人： Fang Hao , Muralidharan Sampath Kodialam , Tirunell V. Lakshman , Haoyu Song
IPC分类号： G06F11/00
CPC分类号： H03M13/13 , H03M13/51
摘要： A method and apparatus providing improved set membership determination and group membership identification of candidate data elements using a single Bloom filter programmed to provide a plurality of non-zero f-bit binary vectors, where each of the f-bit binary vectors is associated with a respective group. The Bloom filter is programmed using one or more (but not all) of a plurality of hash filter sets.
摘要翻译：一种使用编程为提供多个非零f位二进制向量的单个Bloom滤波器来提供候选数据元素的改进的集合隶属确定和组成员标识的方法和装置，其中每个f位二进制向量与各自组。布隆过滤器使用多个散列滤波器组中的一个或多个（但不是全部）进行编程。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式