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

1. 发明授权

US09210065B2 Providing cloud-based services using dynamic network virtualization 有权
标题翻译：使用动态网络虚拟化提供基于云的服务
公开(公告)号：US09210065B2
公开(公告)日：2015-12-08
申请号：US12489187
申请日：2009-06-22
申请人： Fang Hao , Tirunellai V. Lakshman , Sarit Mukherjee , Haoyu Song
发明人： Fang Hao , Tirunellai V. Lakshman , Sarit Mukherjee , Haoyu Song
IPC分类号： H04L12/28 , H04L12/701 , G06F9/455 , H04L12/751 , H04L29/08
CPC分类号： H04L45/02 , G06F9/45558 , G06F2009/4557 , G06F2009/45595 , H04L45/00 , H04L49/70 , H04L67/10
摘要： The invention is directed to providing cloud-based services using dynamic network virtualization. Embodiments of the invention provide a cloud-based service over a system that has a dynamic network virtualization architecture. The architecture includes a set of distributed forwarding elements with centralized control, and at least one virtual machine that is bound to one of the forwarding elements. These features enable the virtual machine to be migrated across a wide area network while maintaining its original IP address and service continuity.
摘要翻译：本发明旨在使用动态网络虚拟化来提供基于云的服务。本发明的实施例在具有动态网络虚拟化架构的系统上提供基于云的服务。该架构包括一组具有集中控制的分布式转发元件，以及绑定到其中一个转发元件的至少一个虚拟机。这些功能使虚拟机能够跨广域网迁移，同时保持其原始IP地址和服务连续性。

2. 发明申请

US20130111122A1 Method and apparatus for network table lookups 审中-公开
标题翻译：网络表查找的方法和装置
公开(公告)号：US20130111122A1
公开(公告)日：2013-05-02
申请号：US13285728
申请日：2011-10-31
申请人： Haoyu Song , Wang Xinyuan , Cao Wei
发明人： Haoyu Song , Wang Xinyuan , Cao Wei
IPC分类号： G06F12/00 , G06F12/06
CPC分类号： G06F13/1647 , G06F13/1684
摘要： An apparatus comprising a plurality of memory components each comprising a plurality of memory banks, a memory controller coupled to the memory components and configured to control and select a one of the plurality of memory components for a memory operation, a plurality of address/command buses coupled to the plurality of memory components and the memory controller comprising at least one shared address/command bus between at least some of the plurality of memory components, and a plurality of data buses coupled to the memory components and the memory controller comprising at least one data bus between at least some of the memory components, wherein the memory controller uses a memory interleaving and bank arbitration scheme in a time-division multiplexing (TDM) fashion to access the plurality of memory components and the memory banks.
摘要翻译：一种装置，包括多个存储器组件，每个存储器组件包括多个存储器组，存储器控制器，耦合到存储器组件并被配置为控制和选择用于存储器操作的多个存储器组件中的一个，多个地址/命令总线耦合到所述多个存储器组件，并且所述存储器控制器包括在所述多个存储器组件中的至少一些存储器组件之间的至少一个共享地址/命令总线以及耦合到所述存储器组件的多个数据总线以及包括至少一个在至少一些存储器组件之间的数据总线，其中存储器控制器以时分复用（TDM）方式使用存储器交错和存储体仲裁方案来访问多个存储器组件和存储体。

3. 发明申请

US20110137930A1 METHOD AND APPARATUS FOR GENERATING A SHAPE GRAPH FROM A BINARY TRIE 有权
标题翻译：用于从二进制生成形状图的方法和装置
公开(公告)号：US20110137930A1
公开(公告)日：2011-06-09
申请号：US12633845
申请日：2009-12-09
申请人： Fang Hao , Muralidharan Kodialam , T.V. Lakshman , Haoyu Song
发明人： Fang Hao , Muralidharan Kodialam , T.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数据结构的子树形状的顶点。形状图数据结构允许类似于可以对二进制特里数据结构执行的操作的操作，以执行来自该组数据值的数据值的查找，同时减少二进制特里数据结构的结构冗余，形状图数据结构在二进制数据结构中提供了对存储器使用的显着改进。

4. 发明授权

US08369333B2 Method and apparatus for transparent cloud computing with a virtualized network infrastructure 有权
标题翻译：具有虚拟化网络基础架构的透明云计算的方法和装置
公开(公告)号：US08369333B2
公开(公告)日：2013-02-05
申请号：US12582939
申请日：2009-10-21
申请人： Fang Hao , Tirunell V. Lakshman , Sarit Mukherjee , Haoyu Song
发明人： Fang Hao , Tirunell V. Lakshman , Sarit Mukherjee , Haoyu Song
IPC分类号： H04L12/56
CPC分类号： H04L12/4641 , G06F9/45558 , G06F2009/45595 , H04L12/4633 , H04L49/70
摘要： A capability is provided for providing transparent cloud computing with a virtualized network infrastructure. A method for enabling use of a resource of a data center as an extension of a customer network includes receiving, at a forwarding element (FE), a packet intended for a virtual machine hosted at an edge domain of the data center, determining a VLAN ID of the VLAN for the customer network in the edge domain, updating the packet to include the VLAN ID of the VLAN for the customer network in the edge domain, and propagating the updated packet from the FE toward virtual machine. The edge domain supports a plurality of VLANs for a respective plurality of customer networks. The packet includes an identifier of the customer network and a MAC address of the virtual machine. The VLAN ID of the VLAN for the customer network in the edge domain is determined using the identifier of the customer network and the MAC address of the virtual machine. The FE may be associated with the edge domain at which the virtual machine is hosted, an edge domain of the data center that is different than the edge domain at which the virtual machine is hosted, or the customer network. Depending on the location of the FE at which the packet is received, additional processing may be provided as needed.
摘要翻译：提供了一种提供透明云计算与虚拟化网络基础架构的能力。用于使数据中心的资源能够用作客户网络的扩展的方法包括在转发元件（FE）处接收旨在用于驻留在数据中心的边缘域的虚拟机的分组，确定VLAN 边缘域中客户网络的VLAN ID，更新报文，包括边缘域中客户网络的VLAN的VLAN ID，并将更新的报文从FE传播到虚拟机。边缘域为相应的多个客户网络支持多个VLAN。该分组包括客户网络的标识符和虚拟机的MAC地址。边缘域中客户网络的VLAN的VLAN ID使用客户网络的标识符和虚拟机的MAC地址来确定。 FE可以与托管虚拟机的边缘域，数据中心的边缘域与虚拟机所在的边缘域或客户网络相关联。根据接收到分组的FE的位置，可以根据需要提供额外的处理。

5. 发明授权

US07990973B2 Hash functions for applications such as network address lookup 有权
标题翻译：用于诸如网络地址查找等应用程序的哈希功能
公开(公告)号：US07990973B2
公开(公告)日：2011-08-02
申请号：US12190684
申请日：2008-08-13
申请人： Fang Hao , Muralidharan S. Kodialam , Haoyu Song
发明人： Fang Hao , Muralidharan S. Kodialam , Haoyu Song
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/745 , H04L45/7453 , H04L45/7457
摘要： In one embodiment, IP lookup into a routing table having prefixes of different prefix lengths is performed by hashing a candidate prefix value to generate a plurality of hash values, where m seed hash values are generated by applying m seed hash functions and one or more additional hash values are generated by combining two or more of the seed hash values in different ways, e.g., using a bit-wise XOR function. The hash values are used to perform membership probes into a Bloom filter programmed with the prefixes corresponding to all of the different prefix lengths in the routing table without having to expand any of the prefixes programmed into the Bloom filter.
摘要翻译：在一个实施例中，通过对候选前缀值进行散列来生成多个散列值来执行对具有不同前缀长度的前缀的路由表的IP查找，其中通过应用m个种子散列函数和一个或多个附加值来生成m个种子散列值通过以不同的方式组合两个或多个种子散列值来产生散列值，例如使用逐位XOR函数。散列值用于对布隆过滤器执行成员资格探测，该过滤器使用与路由表中所有不同前缀长度相对应的前缀进行编程，而无需扩展编程到布隆过滤器中的任何前缀。

6. 发明申请

US20100316051A1 PACKET PROCESSING USING BRAIDED TRIES 有权
标题翻译：使用BRAIDED TRIES进行分组处理
公开(公告)号：US20100316051A1
公开(公告)日：2010-12-16
申请号：US12482533
申请日：2009-06-11
申请人： Haoyu Song , Murali Kodialam , Fang Hao , T.V. Lakshman
发明人： Haoyu Song , Murali Kodialam , Fang Hao , T.V. Lakshman
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/742
摘要： Packets are processed (e.g., routed or classified) in accordance with a braided trie, which represents the combination of two or more different original tries (e.g., representing different forwarding/classification tables). The different tries are combined by twisting the mappings for specific trie nodes to make the shapes of the different tries more similar. Each node in the braided trie contains a braiding bit for at least one original trie indicating the mapping for that trie's node. Trie braiding can significantly reduce the number of nodes used to represent the different original tries, thereby reducing memory usage and improving scalability. Braided tries can be used for such applications as virtual routers and packet classification in which different forwarding/classification tables are represented by a single braided trie stored in shared memory.
摘要翻译：数据包根据编织特技进行处理（例如，路由或分类），其代表两个或多个不同的原始尝试的组合（例如，表示不同的转发/分类表）。通过扭转特定特里节点的映射来组合不同的尝试，使不同尝试的形状更相似。编织特技中的每个节点包含至少一个原始特里的编织位，指示该特里节点的映射。 Trie编织可以显着减少用于表示不同原始尝试的节点数量，从而减少内存使用并提高可扩展性。编织的尝试可以用于虚拟路由器和分组分类等应用，其中不同的转发/分类表由存储在共享存储器中的单个编织线索表示。

7. 发明申请

US20100269024A1 METHOD AND APPARATUS FOR MULTISET MEMBERSHIP TESTING USING COMBINATORIAL BLOOM FILTERS 有权
标题翻译：使用组合式BLOOM过滤器进行多种成员测试的方法和装置
公开(公告)号：US20100269024A1
公开(公告)日：2010-10-21
申请号：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分类号： G06F17/30 , G06F11/10 , H03M13/05
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位二进制向量与各自组。布隆过滤器使用多个散列滤波器组中的一个或多个（但不是全部）进行编程。

8. 发明申请

US20100266215A1 VARIABLE-STRIDE STREAM SEGMENTATION AND MULTI-PATTERN MATCHING 有权
标题翻译：可变条纹分段和多模式匹配
公开(公告)号：US20100266215A1
公开(公告)日：2010-10-21
申请号：US12425576
申请日：2009-04-17
申请人： Nan Hua , Tirunell V. Lakshman , Haoyu Song
发明人： Nan Hua , Tirunell V. Lakshman , Haoyu Song
IPC分类号： G06K9/72
CPC分类号： G06K9/62
摘要： A variable-stride multi-pattern matching apparatus segments patterns and input streams into variable-size blocks according to a modified winnowing algorithm. The variable-stride pattern segments are used to determine the block-symbol alphabet for a variable-stride discrete finite automaton (VS-DFA) that is used for detecting the patterns in the input streams. Applications include network-intrusion detection and protection systems, genome matching, and forensics. The modification of the winnowing algorithm includes using special hash values to determine the position of delimiters of the patterns and input streams. The delimiters mark the beginnings and ends of the segments. In various embodiments, the patterns are segmented into head, core, and tail blocks. The approach provides for memory, memory-bandwidth, and processor-cycle efficient, deterministic, high-speed, line-rate pattern matching.
摘要翻译：可变跨度多模式匹配装置根据修改的风选算法将模式和输入流分割成可变大小的块。可变步长模式段用于确定用于检测输入流中的模式的可变步长离散有限自动机（VS-DFA）的块符号字母表。应用包括网络入侵检测和保护系统，基因组匹配和取证。风选算法的修改包括使用特殊哈希值来确定模式和输入流的分隔符的位置。分隔符标记段的开头和结尾。在各种实施例中，图案被分割为头部，芯部和尾部块。该方法提供了存储器，存储器带宽和处理器周期效率，确定性，高速的线速率模式匹配。

9. 发明申请

US20100040067A1 HASH FUNCTIONS FOR APPLICATIONS SUCH AS NETWORK ADDRESS LOOKUP 有权
标题翻译：应用程序的HASH功能，如网络地址查询
公开(公告)号：US20100040067A1
公开(公告)日：2010-02-18
申请号：US12190684
申请日：2008-08-13
申请人： Fang Hao , Muralidharan S. Kodialam , Haoyu Song
发明人： Fang Hao , Muralidharan S. Kodialam , Haoyu Song
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L45/745 , H04L45/7453 , H04L45/7457
摘要： In one embodiment, IP lookup into a routing table having prefixes of different prefix lengths is performed by hashing a candidate prefix value to generate a plurality of hash values, where m seed hash values are generated by applying m seed hash functions and one or more additional hash values are generated by combining two or more of the seed hash values in different ways, e.g., using a bit-wise XOR function. The hash values are used to perform membership probes into a Bloom filter programmed with the prefixes corresponding to all of the different prefix lengths in the routing table without having to expand any of the prefixes programmed into the Bloom filter.
摘要翻译：在一个实施例中，通过对候选前缀值进行散列来生成多个散列值来执行对具有不同前缀长度的前缀的路由表的IP查找，其中通过应用m个种子散列函数和一个或多个附加值来生成m个种子散列值通过以不同的方式组合两个或多个种子散列值来产生散列值，例如使用逐位XOR函数。散列值用于对布隆过滤器执行成员资格探测，该过滤器使用与路由表中所有不同前缀长度相对应的前缀进行编程，而无需扩展编入Bloom过滤器的任何前缀。

10. 发明授权

US08976647B2 Hardware-based dynamic load balancing that avoids flow packet reordering statistically 有权
标题翻译：基于硬件的动态负载平衡，可以统计地避免流分组重排序
公开(公告)号：US08976647B2
公开(公告)日：2015-03-10
申请号：US13291198
申请日：2011-11-08
申请人： Haoyu Song
发明人： Haoyu Song
IPC分类号： H04L12/28 , G06F15/16 , G06F15/173 , G06F9/26 , G06F9/34 , G06F17/00 , H04L12/801 , H04L12/803
CPC分类号： H04L47/34 , H04L47/125
摘要： A network component comprising a hash generator configured to generate a first hash value using a first hash function and a packet, and generate a second hash value using a second hash function and the packet, a memory comprising a first hash table related to the first hash function and a second hash table related to the second hash function, the first and second hash tables comprising one or more entries, the one or more entries comprising a signature, a timestamp, and a path identification, a comparator configured to compare the first hash value and the second hash value with the one or more entries, and a forwarding decision module configured to forward the packet on a selected path.
摘要翻译：一种网络组件，包括哈希发生器，其被配置为使用第一散列函数和分组生成第一散列值，并且使用第二散列函数和所述分组生成第二散列值，所述存储器包括与所述第一散列函数相关的第一散列表功能和与第二散列函数相关的第二散列表，所述第一和第二散列表包括一个或多个条目，所述一个或多个条目包括签名，时间戳和路径标识，比较器，被配置为比较第一散列值和所述第二散列值与所述一个或多个条目相关联，以及转发决定模块，被配置为在所选择的路径上转发所述分组。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式